Functional Programming Languages and Computer Architecture: Proceedings, Nancy, France, September 16-19, 1985 by Jean-Pierre JouannaudFunctional Programming Languages and Computer Architecture: Proceedings, Nancy, France, September 16-19, 1985 by Jean-Pierre Jouannaud

Functional Programming Languages and Computer Architecture: Proceedings, Nancy, France, September…

EditorJean-Pierre Jouannaud

Paperback | September 1, 1985

Pricing and Purchase Info

$150.30 online 
$154.95 list price
Earn 752 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

Title:Functional Programming Languages and Computer Architecture: Proceedings, Nancy, France, September…Format:PaperbackDimensions:413 pages, 9.25 × 6.1 × 0.07 inPublished:September 1, 1985Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540159754

ISBN - 13:9783540159759

Look for similar items by category:

Reviews

Table of Contents

Miranda: A non-strict functional language with polymorphic types.- Data flow graph optimization in if1.- Strictness analysis - a practical approach.- The categorical abstract machine.- High order programming in extended FP.- Secd-m: a virtual machine for applicative programming.- Cobweb - A combinator reduction architecture.- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages.- Lazy memo-functions.- An architecture for fast data movement in the FFP machine.- An architecture that efficiently updates associative aggregates in applicative programming languages.- Lambda lifting: Transforming programs to recursive equations.- Optimizing almost-tail-recursive prolog programs.- Designing regular array architectures using higher order functions.- $$v\mathcal{F}\mathcal{P}$$ : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms.- A distributed garbage collection algorithm.- Cyclic reference counting for combinator machines.- Design for a multiprocessing heap with on-board reference counting.- A functional language and modular architecture for scientific computing.- Practical polymorphism.- Program verification in a logical theory of constructions.- Transforming recursive programs for execution on parallel machines.- Compiling pattern matching.- Serial combinators: "optimal" grains of parallelism.- The G-machine: A fast, graph-reduction evaluator.