A space-efficient call-by-value virtual machine for gradual set-theoretic types

Abstract : We describe the design and implementation of a virtual machine for programming languages that use gradual typing with set-theoretic types focusing on practical issues such as runtime space efficiency, and efficient implementation of tail recursive calls.
Document type :
Conference papers
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02351383
Contributor : Giuseppe Castagna <>
Submitted on : Wednesday, November 6, 2019 - 1:25:27 PM
Last modification on : Tuesday, November 19, 2019 - 2:24:22 AM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02351383, version 1

Collections

Citation

Giuseppe Castagna, Guillaume Duboc, Victor Lanvin, Jeremy Siek. A space-efficient call-by-value virtual machine for gradual set-theoretic types. 31st International Symposium on Implementation and Application of Functional Languages (IFL '19), Sep 2019, Singapour, Singapore. ⟨hal-02351383⟩

Share

Metrics

Record views

10

Files downloads

6