FPCA 1985: Nancy, France

@proceedings{DBLP:conf/fpca/85,
  editor    = {Jean-Pierre Jouannaud},
  title     = {Functional Programming Languages and Computer Architecture, Nancy,
               France, September 16-19, 1985, Proceedings},
  booktitle = {FPCA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {201},
  year      = {1985},
  isbn      = {3-540-15975-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• D. A. Turner: Miranda: A Non-Strict Functional language with Polymorphic Types. 1-16 BibTeX
• Stephen K. Skedzielewski, M. L. Welcome: Data Flow Graph Optimization in IF1. 17-34 BibTeX
• Chris D. Clack, Simon L. Peyton Jones: Strictness Analysis - A Practical Approach. 35-49 BibTeX
• Guy Cousineau, Pierre-Louis Curien, Michel Mauny: The Categorical Abstract Machine. 50-64 BibTeX
• Patrick Bellot: High Order Programming in Extended FP. 65-80 BibTeX
• Samson Abramsky, R. Sykes: Secd-m: a Virtual Machine for Applicative Programming. 81-98 BibTeX
• Chris Hankin, Peter Osmon, Malcolm J. Shute: COBWEB - A Combinator Reduction Architecture. 99-112 BibTeX
• Philip Wadler: How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages. 113-128 BibTeX
• John Hughes: Lazy Memo-functions. 129-146 BibTeX
• David A. Plaisted: An Architecture for fast Data Movement in the FFP Machine. 147-163 BibTeX
• John T. O'Donnell: An Architecture that Efficiently Updates Associative Aggregates in Applicative Programing Languages. 164-189 BibTeX
• Thomas Johnsson: Lambda Lifting: Treansforming Programs to Recursive Equations. 190-203 BibTeX
• Saumya K. Debray: Optimizing Almost-Tail-Recursive Prolog Programs. 204-219 BibTeX
• Mary Sheeran: Designing Regular Array Architectures using Higher Order Functions. 220-237 BibTeX
• Dorab Patel, Martine D. F. Schlag, Milos D. Ercegovac: vFP: An Environment for the Multi-level Specification, Analysis, and Synthesis of Hardware Algorithms. 238-255 BibTeX
• John Hughes: A Distributed Garbage Collection Algorithm. 256-271 BibTeX
• David R. Brownbridge: Cyclic Reference Counting for Combinator Machines. 273-288 BibTeX
• David S. Wise: Design for a Multiprocessing Heap with On-board Reference Counting. 289-304 BibTeX
• Mark F. Young: A Functional Language and Modular Architecture for Scientific Computing. 305-318 BibTeX
• Rishiyur S. Nikhil: Practical Polymorphism. 319-333 BibTeX
• Peter Dybjer: Program Verification in a Logical Theory of Constructions. 334-349 BibTeX
• V. J. Bush, John R. Gurd: Transforming Recursive Programs for Execution on Parallel Machines. 350-367 BibTeX
• Lennart Augustsson: Compiling Pattern Matching. 368-381 BibTeX
• Paul Hudak, Benjamin Goldberg: Serial Combinators: ``Optimal'' Grains of Parallelism. 382-399 BibTeX
• Richard B. Kieburtz: The G-Machine: A Fast, Graph-Reduction Evaluator. 400-413 BibTeX