LEADER 03253nam  22004815  450 
001 996466144203316
005 20220920151525.0
010   $a3-540-39677-2
024 7 $a10.1007/3-540-15975-4
035   $a(CKB)1000000000230473
035   $a(SSID)ssj0000323363
035   $a(PQKBManifestationID)11277798
035   $a(PQKBTitleCode)TC0000323363
035   $a(PQKBWorkID)10299426
035   $a(PQKB)10825316
035   $a(DE-He213)978-3-540-39677-2
035   $a(PPN)155183990
035   $a(EXLCZ)991000000000230473
100   $a20121227d1985      u|             0
101 0 $aeng
135   $aurnn#|||mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFunctional Programming Languages and Computer Architecture$b[electronic resource] $eProceedings, Nancy, France, September 16-19, 1985 /$fedited by Jean-Pierre Jouannaud
205   $a1st ed. 1985.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1985.
215   $a1 online resource (VIII, 416 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v201
300   $aBibliographic Level Mode of Issuance: Monograph
311 1 $a3-540-15975-4 
327   $aMiranda: 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 ordertions -- vFP  : 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v201
606   $aMicroprocessors
606   $aProcessor Architectures$3https://scigraph.springernature.com/ontologies/product-market-codes/I13014
615  0$aMicroprocessors.
615 14$aProcessor Architectures.
676   $a004.1
702   $aJouannaud$b Jean-Pierre$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466144203316
996   $aFunctional programming languages and computer architecture$9383025
997   $aUNISA