ICFP
2006
ACM
14 years 5 months ago
2006
ACM
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...