Functional Programming Languages and Computer Architecture: Nancy, France, September 16-19, 1985 (Lecture Notes in Computer Science)

Jouannaud, Jean-Pierre

ISBN 10: 0387159754 / ISBN 13: 9780387159751

Published by Springer Verlag, 1986

About this Item

Very Good.

Seller Inventory # ERICA70403871597545

Bibliographic Details

• Title: Functional Programming Languages and Computer Architecture: Nancy, France, September 16-19, 1985 (Lecture Notes in Computer Science)
• Publisher: Springer Verlag
• Publication Date: 1986
• Language: English
• ISBN 10: 0387159754
• ISBN 13: 9780387159751
• Binding: Paperback
• Condition: Very Good
• Book Type: book

About this title

Synopsis

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.- 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 Transforming programs to recursive equations.- Optimizing almost-tail-recursive prolog programs.- Designing regular array architectures using higher order functions.- $$vmathcal{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 "optimal" grains of parallelism.- The A fast, graph-reduction evaluator.