117
Voted
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
101
Voted
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
81
Voted
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
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...
100
click to vote
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of ma...
92
Voted
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
We have designed, implemented, and evaluated AtomCaml, an extension to Objective Caml that provides a synchronization primitive for atomic (transactional) execution of code. A fir...
111
Voted
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
78
Voted
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
Current languages allow a programmer to describe an interface only by enumerating its parts, possibly including other interfaces wholesale. Such languages cannot express relations...
114
click to vote
ICFP
2005
ACM
16 years 9 days ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...