ICFP 2006
27 papers
- A pattern for almost compositional functions
- Abstraction preservation and subtyping in distributed languages
- Access control in a core calculus of dependency
- Algebraic fusion of functions with an accumulating parameter and its improvement
- Boxy types: inference for higher-rank types and impredicativity
- Delimited dynamic binding
- Equality of streams is a Pi0 over 2-complete problem
- Extensible programming with first-class cases
- Fifteen years of functional pearls
- From structures and functors to modules and units
- Improving flow analyses via GammaCFA: abstract garbage collection and counting
- Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection
- Modelling deterministic concurrent I/O
- Modular development of certified program verifiers with a proof assistant
- OCaml + XDuce
- Polymorphism and separation in hoare type theory
- Practical proofs of concurrent programs
- Programming monads operationally with Unimo
- Recursive modules for programming
- Simple unification-based type inference for GADTs
- Stabilizers: a modular checkpointing abstraction for concurrent functional programs
- Static analysis for syntax objects
- Static typing for a faulty lambda calculus
- The development of Chez Scheme
- The missing link: dynamic components for ML
- Transactional events
- biXid: a bidirectional transformation language for XML