Monotonic gradual typing in a common calculus

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F18%3A00329577" target="_blank" >RIV/68407700:21240/18:00329577 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1145/3236454.3236475" target="_blank" >http://dx.doi.org/10.1145/3236454.3236475</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3236454.3236475" target="_blank" >10.1145/3236454.3236475</a>

Result language

angličtina

Original language name

Monotonic gradual typing in a common calculus

Original language description

Gradual typing refers to the notion that programs can be incrementally decorated with type annotations. Languages that support this approach to software development allow for programs being in various states of "typedness" on a scale ranging from entirely untyped to fully statically typed. Points in the middle of this typed-untyped scale create interactions between typed and untyped code, which is where gradual type systems differ. Each gradual type system comes with tradeoffs. Some systems provide strong guarantees at the expense of vastly degraded performance; others do not impact the running time of programs, but they do little to prevent type errors. This paper looks at an intriguing point in the landscape of these systems: the monotonic semantics. The monotonic semantics is designed to reduce the overhead of typed field access through a different enforcement mechanism compared to other gradual type systems. In our previous paper, [1], we described four semantics for gradual typing. This paper uses the framework of that companion paper to present and explore a formulation for the monotonic semantics. In comparison to the others, the monotonic semantics is designed to reduce the overhead of typed field access. We translate a common gradually typed source language to a common statically typed target language according to the monotonic semantics, allowing easy comparison to other gradual type systems in our framework.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

R - Projekt Ramcoveho programu EK

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceeding ISSTA '18 Companion Proceedings for the ISSTA/ECOOP 2018 Workshops

ISBN

978-1-4503-5939-9

ISSN

—

e-ISSN

—

Number of pages

7

Pages from-to

17-23

Publisher name

ACM

Place of publication

New York

Event location

Amsterodam

Event date

Jun 16, 2018

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—