9783540159759 - functional programming languages and computer architecture: proceedings, nancy, france, september 16-19, 1985: 201 di jouannaud, jean-pierre (7 risultati)
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,28
EUR 13,80 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: Chiron Media, Wallingford, , Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 56,79
EUR 17,85 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 10 disponibili
Paperback. Condizione: New.
- Brossura
Da: moluna, Greven, , Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,37
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 63,20 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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 mach…ine 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.
Altre immagini- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 50,25
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: 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.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 1985 1985
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: 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.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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…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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 424 pp. Englisch.
