Sciweavers

2272 search results - page 368 / 455
» A Calculus for
Sort
View
ICFP
2008
ACM
14 years 11 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
ICFP
2006
ACM
14 years 11 months ago
The missing link: dynamic components for ML
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
Andreas Rossberg
ICFP
2005
ACM
14 years 11 months ago
The anatomy of a loop: a story of scope and control
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
Olin Shivers
ICFP
2004
ACM
14 years 11 months ago
From process logic to program logic
We present a process logic for the -calculus with the linear/affine type discipline (Berger et al. 2001; Berger et al. 2003; Honda and Yoshida 2002; Honda and Yoshida 2003; Honda ...
Kohei Honda
ICFP
2003
ACM
14 years 11 months ago
Discriminative sum types locate the source of type errors
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
Matthias Neubauer, Peter Thiemann