Functional Programming Languages and Computer Architecture: Proceedings, Nancy, France, September 16-19, 1985Jean-Pierre Jouannaud |
Contents
A nonstrict functional language with polymorphic types | 1 |
DATA FLOW GRAPH OPTIMIZATION IN IF1 | 17 |
Strictness analysis a practical approach | 35 |
THE CATEGORICAL ABSTRACT MACHINE | 50 |
HIGH ORDER PROGRAMMING IN EXTENDED FP | 65 |
a Virtual Machine for Applicative Programming | 81 |
COBWEB A Combinator Reduction Architecture | 99 |
A method for exception handling backtracking and pattern matching in lazy functional languages | 113 |
Designing Regular Array Architectures using Higher Order Functions | 220 |
An Environment for the Multilevel Specification Analysis and Synthesis of Hardware Algorithms | 238 |
A Distributed Garbage Collection Algorithm | 256 |
CYCLIC REFERENCE COUNTING FOR COMBINATOR MACHINES | 273 |
Design for a Multiprocessing Heap with Onboard Reference Counting | 289 |
A FUNCTIONAL LANGUAGE AND MODULAR ARCHITECTURE FOR SCIENTIFIC COMPUTING | 305 |
Practical Polymorphism | 319 |
Program Verification in a Logical Theory of Constructions | 334 |
Lazy Memofunctions | 129 |
AN ARCHITECTURE FOR FAST DATA MOVEMENT IN THE FFP MACHINE | 147 |
An Architecture that Efficiently Updates Associative Aggregates in Applicative Programming Languages | 164 |
Transforming Programs to Recursive Equations | 190 |
Optimizing AlmostTailRecursive Prolog Programs | 204 |
TRANSFORMING RECURSIVE PROGRAMS FOR EXECUTION ON PARALLEL MACHINES | 350 |
Compiling Pattern Matching | 368 |
Optimal Grains of Parallelism | 382 |
A fast graphreduction evaluator | 400 |
Other editions - View all
Functional Programming Languages and Computer Architecture: Proceedings ... Jean-Pierre Jouannaud No preview available - 1985 |
Functional Programming Languages and Computer Architecture Jean-Pierre Jouannaud No preview available - 2014 |
Common terms and phrases
abstract abstract data type abstract interpretation aggregate algebraic algorithm almost-tail-recursive Applicative Languages architecture argument array associative backtracking Batcher sort cell circuit clause combinatory logic compiler conc constructor CP RQ cycle data structures data type defined deleted described efficient elements environment equations eval example exception handling execution free variables function definitions functional form functional languages Functional Programming G-code garbage collection graph hardware identifiers implementation input instruction lambda expression lambda lifting lazy evaluation letrec Lisp logic loop machine memo-table memory merge Miranda module node object operations optimization output parallel pattern matching perfect shuffle performance polymorphic predicate problem processor Programming Languages recursive call redo reduce reference counting remote pointer representation result returns SECD machine semantics sequence sequential SISAL stack storage strict subexpressions super-combinators tail-computation tail-recursive techniques time-stamp transformation type theory type-checker update VLSI
Popular passages
Page 413 - London 1989. [8] WRStoye, TJWClarke, ACNorman; Some practical methods for rapid combinator reduction; Proc. of 1984 ACM Conf on Lisp and Functional Prog, pp 159-166, aug 1984. [9] M.Scheevel, NORMA, a normal-order combinator reduction machine, colloquium presented at Oregon Graduate Center, july 1984. [10] RBKieburtz; The...