JFP 1998

25 papers

1. A Coherence Theorem for Martin-Löf's Type Theory · Michael Hedberg
2. A Theory of Weak Bisimulation for Core CML · William Ferreira, Matthew Hennessy, Alan Jeffrey
3. A Type-Based Escape Analysis for Functional Languages · John Hannan
4. Algorithms + Strategy = Parallelism · Philip W. Trinder, Kevin Hammond, Hans-Wolfgang Loidl, Simon L. Peyton Jones
5. Animated Fuzzy Logic · Gary Meehan, Mike Joy
6. Classical Logic, Continuation Semantics and Abstract Machines · Thomas Streicher, Bernhard Reus
7. Computational Types from a Logical Perspective · P. N. Benton, Gavin M. Bierman, Valeria de Paiva
8. Diets for Fat Sets · Martin Erwig
9. Dynamic Tabbing for Automatic Indentation with the Layout Rule · Guy Lapalme
10. Efficient Graph Algorithms Using Lazy Monolithic Arrays · Thomas Johnsson
11. Expansion Postponement for Normalising Pure Type Systems · Erik Poll
12. From ML to Ada: Strongly-Typed Language Interoperability via Source Translation · Andrew P. Tolmach, Dino Oliva
13. Functional Pearl: Even Higher-Order Functions for Parsing · Chris Okasaki
14. Functional Runtime Systems Within the Lambda-Sigma Calculus · Thérèse Hardin, Luc Maranget
15. Functional Unparsing · Olivier Danvy
16. Functorial ML · C. Barry Jay, Gianna Bellè, Eugenio Moggi
17. Meertens Number · Richard S. Bird
18. Monadic Parsing in Haskell · Graham Hutton, Erik Meijer
19. Polytypic Unification · Patrik Jansson, Johan Jeuring
20. Profiling Large-Scale Lazy Functional Programs · Richard G. Morgan, Stephen A. Jarvis
21. Structured Operational Semantics of a Fragment of the Language Scheme · Furio Honsell, Alberto Pravato, Simona Ronchi Della Rocca
22. The Call-by-Need Lambda Calculus · John Maraist, Martin Odersky, Philip Wadler
23. The Dynamic Compilation of Lazy Functional Programs · David Wakeling
24. What is a Purely Functional Language? · Amr Sabry
25. Why the Constant 'Undefined'? Logics of Partial Terms for Strict and Non-Strict Functional Programming Languages · Robert F. Stärk