A space-efficient call-by-value virtual machine for gradual set-theoretic types - Université Sorbonne Paris Cité Access content directly
Conference Papers Year : 2019

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.
Fichier principal
Vignette du fichier
main.pdf (991.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02351383 , version 1 (06-11-2019)

Identifiers

Cite

Giuseppe Castagna, Guillaume Duboc, Victor Lanvin, Jeremy G 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. ⟨10.1145/3412932.3412940⟩. ⟨hal-02351383⟩
111 View
107 Download

Altmetric

Share

Gmail Facebook X LinkedIn More