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.
Domains
Programming Languages [cs.PL]
Origin : Files produced by the author(s)
Loading...