Del 201 - Lecture Notes in Computer Science

Functional Programming Languages and Computer Architecture

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

Häftad, Engelska, 1985

Av Jean-Pierre Jouannaud

739 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1985-09-01
Mått155 x 235 x 23 mm
Vikt639 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor416
Upplaga1985
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540159759

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

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

Conditional Term Rewriting Systems

Del 308

Conditional Term Rewriting Systems

Stephane Kaplan, Jean-Pierre Jouannaud

739 kr

Certified Programs and Proofs

Certified Programs and Proofs

Jean-Pierre Jouannaud, Zhong Shao

739 kr

Harry Potter och de vises sten

Del 1

Harry Potter och de vises sten

439 kr

Alchemised

Nyhet

Alchemised

349 kr

Constraints in Computational Logics

Del 845

Constraints in Computational Logics

Jean-Pierre Jouannaud

719 kr

Term Rewriting

Del 909

Term Rewriting

Hubert Comon, Jean-Pierre Jouannaud

739 kr

Rewriting Techniques and Applications

Del 202

Rewriting Techniques and Applications

Jean-Pierre Jouannaud

589 kr

TAPSOFT '93: Theory and Practice of Software Development

Del 668

TAPSOFT '93: Theory and Practice of Software Development

Marie-Claude Gaudel, Jean-Pierre Jouannaud

1 459 kr

Kvinnorna

4 pocket för 3

Kvinnorna

125 kr

Väninnorna på Nordiska Kompaniet

Nyhet

Del 2

Väninnorna på Nordiska Kompaniet

Ruth Kvarnström-Jones

79 kr125 kr