ICFP 2002
27 papers
- A compiled implementation of strong reduction
- A demand-driven adaptive type analysis
- A theory of overloading
- An experimental study of renewal-older-first garbage collection
- An expressive, scalable type theory for certified code
- An interoperable calculus for external object access
- Bootstrapping one-sided flexible arrays
- Compiling scheme to JVM bytecode: : a performance study
- Composable and compilable macros: : you want it when?
- Composing monads using coproducts
- Concatenate, reverse and map vanish for free
- Contracts for higher-order functions
- Exception analysis for non-strict languages
- Final shift for call/cc: : direct implementation of shift and reset
- Functional formal methods
- Interactive visual functional programming
- Meta-programming with names and necessity
- Modular typechecking for hierarchically extensible datatypes and functions
- Monads for incremental computing
- Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
- Program generation, termination, and binding-time analysis
- Shortcut fusion for accumulating parameters & zip-like functions
- Tagless staged interpreters for typed languages
- There and back again
- Towards more natural functional programming languages
- Type classes with more higher-order polymorphism
- Typing dynamic typing