Sciweavers

LFP
1992
153views more  LFP 1992»
14 years 18 days ago
Reasoning About Programs in Continuation-Passing Style
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...
Amr Sabry, Matthias Felleisen
LFP
1992
56views more  LFP 1992»
14 years 18 days ago
Back to Direct Style II: First-Class Continuations
Olivier Danvy, Julia L. Lawall
LFP
1992
78views more  LFP 1992»
14 years 18 days ago
A Syntactic Approach to Fixed Point Computation on Finite Domains
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...
Tyng-Ruey Chuang, Benjamin Goldberg
LFP
1992
140views more  LFP 1992»
14 years 18 days ago
Global Tagging Optimization by Type Inference
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...
Fritz Henglein
LFP
1992
90views more  LFP 1992»
14 years 18 days ago
Polymorphic Type Reconstruction for Garbage Collection Without Tags
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...
Benjamin Goldberg, Michael Gloger