Functional Programming Languages and Computer Architecture

Proceedings, Nancy, France, September 16-19, 1985

AvJean-Pierre Jouannaud

Häftad, Engelska, 1985

Del i serien Lecture Notes in Computer Science

573 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1985-09-01
Mått:155 x 235 x 23 mm
Vikt:639 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:416
Upplaga:1985
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540159759

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av

Nyhet

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Conditional Term Rewriting Systems

Stephane Kaplan, Jean-Pierre Jouannaud

Häftad, 1988

573 kr

Certified Programs and Proofs

Jean-Pierre Jouannaud, Zhong Shao

Häftad, 2011

573 kr

Constraints in Computational Logics

Jean-Pierre Jouannaud

Häftad, 1994

557 kr

Algebra, Meaning, and Computation

Jose Meseguer, Jean-Pierre Jouannaud, Kokichi Futatsugi

E-bok

2006

1 470 kr

Term Rewriting

Hubert Comon, Jean-Pierre Jouannaud

Häftad, 1995

573 kr

Certified Programs and Proofs

Zhong Shao, Jean-Pierre Jouannaud

E-bok

2011

739 kr

Rewriting Techniques and Applications

Jean-Pierre Jouannaud

Häftad, 1985

460 kr

TAPSOFT '93: Theory and Practice of Software Development

Marie-Claude Gaudel, Jean-Pierre Jouannaud

Häftad, 1993

1 139 kr

Algebra, Meaning, and Computation

Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer

Häftad, 2006

1 106 kr

Functional Programming Languages and Computer Architecture

Proceedings, Nancy, France, September 16-19, 1985

AvJean-Pierre Jouannaud

Häftad, Engelska, 1985

Del i serien Lecture Notes in Computer Science

573 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1985-09-01
Mått:155 x 235 x 23 mm
Vikt:639 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:416
Upplaga:1985
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540159759

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.