ICFP 2003
27 papers
- A sound and complete axiomatization of delimited continuations
- A static type system for JVM access control
- A theory of aspects
- A user-centred approach to functions in Excel
- An effective theory of type refinements
- An extension of HM(X) with bounded existential and universal data-types
- Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism
- CDuce: an XML-centric general-purpose language
- Call-by-value is dual to call-by-name
- Compiling regular patterns
- Conservation of information: applications in functional, reversible, and quantum computing
- Dependency-style generic Haskell
- Discriminative sum types locate the source of type errors
- Disjunctive normal forms and local exceptions
- Dynamic rebinding for marshalling and update, with destruct-time?
- FreshML: programming with binders made simple
- From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis
- Functional automatic differentiation with dirac impulses
- Global abstraction-safe marshalling with hash types
- Iterative-free program analysis
- MLF: raising ML to the power of system F
- Meta-programming through typeful code representation
- Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
- Polish parsers, step by step
- Scripting the type inference process
- Software is discrete mathematics
- Understanding aspects: extended abstract