JFP 1997
25 papers
- A Competitive Algorithm for Managing Sharing in the Distributed Execution of Functional Programs
- A Foundation for Actor Computation
- A Functional Description of TEX's Formula Layout
- A New Method for Functional Arrays
- A Syntactic Method for Finding Least Fixed Points of Higher-Order Functions over Finite Domains
- Deriving a Lazy Abstract Machine
- EQUALS - A Fast Parallel Implementation of a Lazy Language
- Extending a lambda-Calculus with Explicit Substitution which Preserves Strong Normalisation Into a Confluent Calculus on Open Terms
- First-Order Functional Languages and Intensional Logic
- Lazy Wheel Sieves and Spirals of Primes
- Leftmost Outside-In Narrowing Calculi
- Modularity of Strong Normalization in the Algebraic-lambda-Cube
- More Haste, Less Speed: Lazy Versus Eager Evaluation
- Natural Expert: A Commercial Functional Programming Environment
- On Building Trees with Minimum Height
- On Combinatory Complete Sets of Proper Combinators
- On Merging and Selection
- On the Effectiveness of Functional Language Features: NAS Benchmark FT
- Shrinking lambda Expressions in Linear Time
- The Call-By-Need lambda Calculus
- The Zipper
- Three Algorithms on Braun Trees
- Thunks and the lambda-Calculus
- Trust in the lambda-Calculus
- Type and Behaviour Reconstruction for Higher-Order Concurrent Programs