JFP 1996

35 papers

1. A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object · Pierre-Louis Curien, Roberto Di Cosmo
2. A Positive Supercompiler · Morten Heine Sørensen, Robert Glück, Neil D. Jones
3. A Simple Proof of the Undecidability of Inhabitation in lambdaP · Marc Bezem, Jan Springintveld
4. A Syntactic Theory of Type Generativity and Sharing · Xavier Leroy
5. Back to Basics: Deriving Representation Changers Functionally · Graham Hutton, Erik Meijer
6. Benchmarking Implementations of Functional Languages with 'Pseudoknot', a Float-Intensive Benchmark · Pieter H. Hartel, Marc Feeley, Martin Alt, Lennart Augustsson, Peter Baumann, Marcel Beemster + 21 more
7. Canonical Typing and Pi-Conversion in the Barendregt Cube · Fairouz Kamareddine, Rob Nederpelt
8. Combinators for Parsing Expressions · Steve Hill
9. Deduction for Functional Programmers · James J. Leifer, Bernard Sufrin
10. Deriving Tidy Drawings of Trees · Jeremy Gibbons
11. Drawing Trees · Andrew Kennedy
12. Empirical and Analytic Study of Stack Versus Heap Cost for Languages with Closures · Andrew W. Appel, Zhong Shao
13. Formal Basis for the Refinement of Rule Based Transition Systems · Anthony N. Clark
14. Generating Action Compilers by Partial Evaluation · Anders Bondorf, Jens Palsberg
15. Generic Functional Programming with Types and Relations · Richard S. Bird, Oege de Moor, Paul F. Hoogendijk
16. Haskore Music Notation - An Algebra of Music · Paul Hudak, Tom Makucevich, Syam Gadde, Bo Whong
17. New Dimensions in Heap Profiling · Colin Runciman, Niklas Röjemo
18. Note on Algol and Conservatively Extending Functional Programming · Peter W. O'Hearn
19. On Cubism · Bart Jacobs
20. Operational Interpretations of an Extension of Fomega with Control Operators · Robert Harper, Mark Lillibridge
21. Optimal Purely Functional Priority Queues · Gerth Stølting Brodal, Chris Okasaki
22. Predictive Parser Combinators Need four Values to Report Errors · Andrew S. Partridge, David Wright
23. Proof-Irrelevance out of Exluded-Middle and Choice in the Calculus of Constructions · Franco Barbanera, Stefano Berardi
24. Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis · Geoffrey Livingston Burn, Daniel Le Métayer
25. Reference Counting as a Computational Interpretation of Linear Logic · Jawahar Chirimar, Carl A. Gunter, Jon G. Riecke
26. Representing Demand by Partial Projections · John Launchbury, Gebreselassie Baraki
27. Some Lattice-Based Scientific Problems, Expressed in Haskell · D. B. Carpenter, Hugh Glaser
28. Sparse Matrix Representations in a Functional Language · Philip W. Grant, John A. Sharp, Michael F. Webster, Xiaoming Zhang
29. The Bologna Optimal Higher-Order Machine · Andrea Asperti, Cecilia Giovanetti, Andrea Naletto
30. The Resource Constrained Shortest Path Problem Implemented in a Lazy Functional Language · Pieter H. Hartel, Hugh Glaser
31. The Third Homomorphism Theorem · Jeremy Gibbons
32. Type Classes with Existential Types · Konstantin Läufer
33. Weak Polymorphism can be Sound · John Greiner
34. lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation · Zine-El-Abidine Benaissa, Daniel Briaud, Pierre Lescanne, Jocelyne Rouyer-Degli
35. π-Red+ An Interactive Compiling Graph Reduction System for an Applied λ-Calculus · Dietmar Gärtner, Werner E. Kluge