default search action
FPCA 1985: Nancy, France
- Jean-Pierre Jouannaud:
Functional Programming Languages and Computer Architecture, FPCA 1985, Nancy, France, September 16-19, 1985, Proceedings. Lecture Notes in Computer Science 201, Springer 1985, ISBN 3-540-15975-4 - D. A. Turner:
Miranda: A Non-Strict Functional language with Polymorphic Types. 1-16 - Stephen K. Skedzielewski, M. L. Welcome:
Data Flow Graph Optimization in IF1. 17-34 - Chris D. Clack, Simon L. Peyton Jones:
Strictness Analysis - A Practical Approach. 35-49 - Guy Cousineau, Pierre-Louis Curien, Michel Mauny:
The Categorical Abstract Machine. 50-64 - Patrick Bellot:
High Order Programming in Extended FP. 65-80 - Samson Abramsky, R. Sykes:
Secd-m: a Virtual Machine for Applicative Programming. 81-98 - Chris Hankin, Peter Osmon, Malcolm J. Shute:
COBWEB - A Combinator Reduction Architecture. 99-112 - 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 - John Hughes:
Lazy Memo-functions. 129-146 - David A. Plaisted:
An Architecture for fast Data Movement in the FFP Machine. 147-163 - John T. O'Donnell:
An Architecture that Efficiently Updates Associative Aggregates in Applicative Programing Languages. 164-189 - Thomas Johnsson:
Lambda Lifting: Treansforming Programs to Recursive Equations. 190-203 - Saumya K. Debray:
Optimizing Almost-Tail-Recursive Prolog Programs. 204-219 - Mary Sheeran:
Designing Regular Array Architectures using Higher Order Functions. 220-237 - 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 - John Hughes:
A Distributed Garbage Collection Algorithm. 256-271 - David R. Brownbridge:
Cyclic Reference Counting for Combinator Machines. 273-288 - David S. Wise:
Design for a Multiprocessing Heap with On-board Reference Counting. 289-304 - Mark F. Young:
A Functional Language and Modular Architecture for Scientific Computing. 305-318 - Rishiyur S. Nikhil:
Practical Polymorphism. 319-333 - Peter Dybjer:
Program Verification in a Logical Theory of Constructions. 334-349 - V. J. Bush, John R. Gurd:
Transforming Recursive Programs for Execution on Parallel Machines. 350-367 - Lennart Augustsson:
Compiling Pattern Matching. 368-381 - Paul Hudak, Benjamin Goldberg:
Serial Combinators: "Optimal" Grains of Parallelism. 382-399 - Richard B. Kieburtz:
The G-Machine: A Fast, Graph-Reduction Evaluator. 400-413
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.