JFP 1999
27 papers
- A Pointless Derivation of Radix Sort
- A Poor Man's Concurrency Monad
- A Tutorial on the Universality and Expressiveness of Fold
- A confluent lambda-calculus with a catch/throw mechanism
- Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms
- Automatic Verification of Functions with Accumulating Parameters
- Combinators for Program Generation
- Compilation and Equivalence of Imperative Objects
- Compiling lazy functional programs for the Java Virtual Machine
- De Bruijn Notation as a Nested Datatype
- Explaining Binomial Heaps
- Functional Design and Implementation of Graphical User Interfaces for Theorem Provers
- HOLCF=HOL+LCF
- Higher-Order Functional Languages and Intensional Logic
- Higher-Order Narrowing with Definitional Trees
- Implementing Theorem Provers in a Purely Functional Style
- Parallel Functional Programming on Recursively Defined Data via Data-Parallel Recursion
- Parallelization of Divide-and-Conquer by Translation to Nested Loops
- Parallelizing functional programs by generalization
- Power Series, Power Serious
- Proof-Directed Debugging
- Red-Black Trees in a Functional Setting
- Semantics of Linear/Modal Lambda Calculus
- The Semantics of Future and an Application
- Transparent Optimisation of Rewriting Combinators
- Type-checking injective pure type systems
- Using randomization to make recursive matrix algorithms practical