Several papers ([Appe189],[Goldberg9 1]) have recently claimed that garbage collection can be performed on untagged data in the presence of ML-style type polymorphism. They rely o...
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...