ICFP 1999
25 papers
- A Simple Proof Technique for Certain Parametricity Results
- Atomic Heap Transactions and Fine-grain Interrupts
- Calling Hell From Heaven and Heaven From Hell
- Flexible Type Analysis
- From Fast Exponentiation to Square Matrices: An Adventure in Types
- Haskell and XML: Generic Combinators or Type-Based Translation?
- Interlanguage Working Without Tears: Blending SML with Java
- Monadic Encapsulation in ML
- On Embedding a Microarchitectural Design Language within Haskell
- Principals in Programming Languages: A Syntactic Proof Technique
- Programming Languages as Operating Systems (or Revenge of the Son of the Lisp Machine)
- Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming
- Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
- Representing Java Classes in a Typed Intermediate Language
- Specialization of Inductively Sequential Functional Logic Programs
- Static Interpretation of Modules
- Tracing Piece by Piece: Affordable Debugging for Lazy Functional Languages
- Trampolined Style
- Transparent Modules with Fully Syntactic Signatures
- Type Dispatch for Named Hierarchical Types
- Type Fixpoints: Iteration vs. Recursion
- Type Inference Builds a Short Cut to Deforestation
- Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
- Verification of Erlang Programs using Abstract Interpretation and Model Mhecking
- When is a Functional Program Not a Functional Program?