JFP 1991

18 papers

1. A Partial Evaluator for the Untyped lambda-Calculus · Carsten K. Gomard, Neil D. Jones
2. A Semantic Basis for Quest · Luca Cardelli, Giuseppe Longo
3. An Unsolvable Numeral System in lambda Calculus · Erik Barendsen
4. Domain Generating Functions for Solving Constraint Satisfaction Problems · François Major, Guy Lapalme, Robert Cedergren
5. Encapsulating Non-Determinacy in an Abstract Data Type with Determinate Semantics · F. Warren Burton
6. Equivalence in Functional Languages with Effects · Ian A. Mason, Carolyn L. Talcott
7. Explicit Substitutions · Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy
8. Fixed Points and Frontiers: A New Perspective · Sebastian Hunt, Chris Hankin
9. Implementing the Evaluation Transformer Model of Reduction on Parallel Machines · Geoffrey Livingston Burn
10. Introduction to Generalized Type Systems · Henk Barendregt
11. Modular Proof of Strong Normalization for the Calculus of Constructions · Herman Geuvers, Mark-Jan Nederhof
12. On Removing Duplicates · Richard S. Bird
13. Retrieving Reusable Software Components by Polymorphic Type · Colin Runciman, Ian Toyn
14. Self-Interpretations in lambda Calculus · Henk Barendregt
15. The Minout Problem · Richard S. Bird
16. Type Inference With Simple Subtypes · John C. Mitchell
17. Using Transformations in the Implementations of Higher-Order Functions · Hanne Riis Nielson, Flemming Nielson
18. Using Types as Search Keys in Function Libraries · Mikael Rittri