Sciweavers

ICFP
2009
ACM
16 years 1 months ago
Complete and decidable type inference for GADTs
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...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
199
Voted
ICFP
2009
ACM
16 years 1 months ago
Biorthogonality, step-indexing and compiler correctness
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...
Nick Benton, Chung-Kil Hur
ICFP
2009
ACM
16 years 1 months ago
Safe functional reactive programming through dependent types
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...
Neil Sculthorpe, Henrik Nilsson
ICFP
2009
ACM
16 years 1 months ago
Effective interactive proofs for higher-order imperative programs
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...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
ICFP
2009
ACM
16 years 1 months ago
A concurrent ML library in concurrent Haskell
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...
Avik Chaudhuri
Programming Languages
Top of PageReset Settings