ICFP 2001
24 papers
- A Dependently Typed Assembly Language
- A Fresh Approach to Representing Syntax with Static Binders in Functional Programming
- A New Notation for Arrows
- A Simple Implementation Technique for Priority Search Queues
- Automatic Generation of Staged Geometric Predicates
- Charting Patterns on Price History
- Compositional Explanation of Types and Algorithmic Debugging of Type Errors
- Contification Using Dominators
- Cost Recurrences for DML Programs
- Developing a Stage Lighting System from Scratch
- Down with Emacs Lisp: Dynamic Scope Analysis
- Events in Haskell, and How to Implement Them
- Extensible Algebraic Datatypes with Defaults
- Functional Array Fusion
- Functioning without Closure: Type-Safe Customized Function Representations for Standard ML
- Generic Unification via Two-Level Types and Parameterized Modules
- Generic Validation of Structural Content with Parametric Modules
- Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
- On Regions and Linear Types
- Optimizing Pattern Matching
- Possibilities and Limitations of Call-by-Need Space Improvement
- Real-Time FRP
- Recursive Structures for Standard ML
- Type-Based Hot Swapping of Running Modules