ICFP 1996
25 papers
- A New Look to Pattern Matching in Abstract Data Types
- A Probabilistic Approach to the Problem of Automatic Selection of Data Representations
- A Provable Time and Space Efficient Implementation of NESL
- A Reflection on Call-by-Value
- A Theory of Weak Bisimulation for Core CML
- Analysis and Caching of Dependencies
- Cogen in Six Lines
- Complexity of Kernel Fun Subtype Checking
- Deriving Structural Hylomorphisms From Recursive Definitions
- Enriching the Lambda Calculus with Contexts: Toward a Theory of Incremental Program Construction
- First-Class Synchronization Barriers
- Functional Back-Ends within the Lambda-Sigma Calculus
- Inductive, Coinductive, and Pointed Types
- Lag, Drag, Void and Use - Heap Profiling and Space-Efficient Compilation Revisited
- Let-floating: Moving Bindings to Give Faster Programs
- Mixin Modules
- Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus?
- Sharing Code through First-class Environments
- Simplifying Subtyping Constraints
- Static and Dynamic Partitioning of Pointers as Links and Threads
- Storage Use Analysis and its Applications
- Synchronous Kahn Networks
- The Role of Lazy Evaluation in Amortized Data Structures
- The Semantics of Scheme with Future
- pHluid: The Design of a Parallel Functional Language Implementation on Workstations