Functional Programming Languages Computer by Jouannaud Jean Pierre (7 results)
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 50.80
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 47.85
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
Paperback. Condition: New.
- Softcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 42.98
£ 42.27 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 47.53
£ 54.53 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 machi…ne 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.- $$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 combinators: 'optimal' grains of parallelism.- The G-machine: A fast, graph-reduction evaluator.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 44.66
£ 60.39 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Functional Programming Languages and Computer Architecture | Proceedings, Nancy, France, September 16-19, 1985 | Jean-Pierre Jouannaud | Taschenbuch | viii | Englisch | 1985 | Springer | EAN 9783540159759 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg,…juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Language: English
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 1985 1985
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 47.53
£ 19.84 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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.- $$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 combinators: 'optimal' grains of parallelism.- The G-machine: A fast, graph-reduction evaluator. 424 pp. Englisch.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 47.53
£ 51.77 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 v…irtual 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.- $$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 combinators: 'optimal' grains of parallelism.- The G-machine: A fast, graph-reduction evaluator.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 424 pp. Englisch.
