Research Article
Compiling lazy functional programs for the Java Virtual Machine
-
- Published online by Cambridge University Press:
- 01 November 1999, pp. 579-603
-
- Article
-
- You have access
- Export citation
The semantics of future and an application
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 1-31
-
- Article
-
- You have access
- Export citation
Combinators for program generation
-
- Published online by Cambridge University Press:
- 01 September 1999, pp. 483-525
-
- Article
-
- You have access
- Export citation
Semantics of linear/modal lambda calculus
-
- Published online by Cambridge University Press:
- 01 May 1999, pp. 247-277
-
- Article
-
- You have access
- Export citation
Transparent optimisation of rewriting combinators
-
- Published online by Cambridge University Press:
- 01 March 1999, pp. 113-146
-
- Article
-
- You have access
- Export citation
A tutorial on the universality and expressiveness of fold
-
- Published online by Cambridge University Press:
- 01 July 1999, pp. 355-372
-
- Article
-
- You have access
- Export citation
Using randomization to make recursive matrix algorithms practical
-
- Published online by Cambridge University Press:
- 01 November 1999, pp. 605-624
-
- Article
-
- You have access
- Export citation
Higher-order narrowing with definitional trees
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 33-75
-
- Article
-
- You have access
- Export citation
Parallelization of divide-and-conquer by translation to nested loops
-
- Published online by Cambridge University Press:
- 01 May 1999, pp. 279-310
-
- Article
-
- You have access
- Export citation
Higher-order functional languages and intensional logic
-
- Published online by Cambridge University Press:
- 01 September 1999, pp. 527-564
-
- Article
-
- You have access
- Export citation
Compilation and equivalence of imperative objects
-
- Published online by Cambridge University Press:
- 01 July 1999, pp. 373-426
-
- Article
-
- You have access
- Export citation
Implementing theorem provers in a purely functional style
-
- Published online by Cambridge University Press:
- 01 March 1999, pp. 147-166
-
- Article
-
- You have access
- Export citation
Editorial
Editorial
-
- Published online by Cambridge University Press:
- 01 May 1999, p. 311
-
- Article
-
- You have access
- Export citation
THEORETICAL PEARL
Applications of Plotkin-terms: partitions and morphisms for closed terms
-
- Published online by Cambridge University Press:
- 01 September 1999, pp. 565-575
-
- Article
-
- You have access
- Export citation
Research Article
A confluent λ-calculus with a catch/throw mechanism
-
- Published online by Cambridge University Press:
- 01 November 1999, pp. 625-647
-
- Article
-
- You have access
- Export citation
Functional design and implementation of graphical user interfaces for theorem provers
-
- Published online by Cambridge University Press:
- 01 March 1999, pp. 167-189
-
- Article
-
- You have access
- Export citation
Parallel functional programming on recursively defined data via data-parallel recursion
-
- Published online by Cambridge University Press:
- 01 July 1999, pp. 427-462
-
- Article
-
- You have access
- Export citation
de Bruijn notation as a nested datatype
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 77-91
-
- Article
-
- You have access
- Export citation
FUNCTIONAL PEARL
Proof-directed debugging
-
- Published online by Cambridge University Press:
- 01 July 1999, pp. 463-469
-
- Article
-
- You have access
- Export citation
Explaining binomial heaps
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 93-104
-
- Article
-
- You have access
- Export citation