|
5
|
Ordinals and Interactive Programs
– Peter Hancock
- 2000
|
|
|
A Survey of Sequential and Parallel Implementation Techniques for Functional Programming Languages
– Ralph C. Hilzer, Jr. , Lawrence A. Crowl
- 1995
|
|
4
|
A Parallel Functional Language Compiler for Message-Passing Multicomputers
– Sahalu B. Junaidu
- 1998
|
|
29
|
Compilation by Transformation in Non-Strict Functional Languages
– André L. de M. Santos
- 1995
|
|
|
A lambda-to-CL Translation for Strong Normalization
– Yohji Akama
- 1997
|
|
8
|
Models for Persistence in Lazy Functional Programming Systems
– David John McNally, Ky Ss, Tony Davie, Al Dearle, Simon Peyton Jones, Stef Joosten, Graham Kirby
- 1993
|
|
3
|
Higher Order Function Synthesis Through Proof Planning
– Andrew Cook, Andrew Ireland, Greg Michaelson
- 2001
|
|
|
Introduction to Functional Programming using Gofer
– E. P. Wentworth
- 1990
|
|
29
|
Tail Recursion Without Space Leaks
– Richard Jones
- 1991
|
|
|
Lambda-Calculus and Functional Programming
– Jonathan P. Seldin
|
|
7
|
Deterministic Concurrency
– David Paul Carter
- 1993
|
|
59
|
Defunctionalization at Work
– Olivier Danvy, Lasse R. Nielsen
- 2001
|
|
114
|
Confluence properties of Weak and Strong Calculi of Explicit Substitutions
– Pierre-Louis Curien , Therese Hardin, Jean-Jacques Levy
- 1996
|
|
|
An Applied λ-Calculus for Iteration Templates
– Harold Simmons
|
|
1
|
A Comparison of Two Systems of Ordinal Notations
– Harold Simmons
|
|
8
|
Putting the Spine back in the Spineless Tagless G-Machine: An Implementation of Resumable Black-Holes
– Alastair Reid
- 1998
|
|
|
The proof theory of classical and constructive inductive definitions. A 40 year saga, 1968-2008.
– Solomon Feferman
- 2008
|
|
|
Lexicographic Path Induction
– Jeffrey Sarnat, Carsten Schürmann
|
|
|
Discovering Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors
– Philip Meguire
- 2003
|
