227
click to vote
ICFP
16 years 1 months ago
2009 ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
199
Voted
ICFP
16 years 1 months ago
2009 ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
216
click to vote
ICFP
16 years 1 months ago
2009 ACM
Functional Reactive Programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. FRP is based on the synchr...
197
click to vote
ICFP
16 years 1 months ago
2009 ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
205
click to vote
ICFP
16 years 1 months ago
2009 ACM
rrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML. This mechanism admits a powerful, modular style of concurrent programming, c...
|