03253nam 22004815 450 99646614420331620220920151525.03-540-39677-210.1007/3-540-15975-4(CKB)1000000000230473(SSID)ssj0000323363(PQKBManifestationID)11277798(PQKBTitleCode)TC0000323363(PQKBWorkID)10299426(PQKB)10825316(DE-He213)978-3-540-39677-2(PPN)155183990(EXLCZ)99100000000023047320121227d1985 u| 0engurnn#|||mamaatxtccrFunctional Programming Languages and Computer Architecture[electronic resource] Proceedings, Nancy, France, September 16-19, 1985 /edited by Jean-Pierre Jouannaud1st ed. 1985.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1985.1 online resource (VIII, 416 p.)Lecture Notes in Computer Science,0302-9743 ;201Bibliographic Level Mode of Issuance: Monograph3-540-15975-4 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 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.Lecture Notes in Computer Science,0302-9743 ;201MicroprocessorsProcessor Architectureshttps://scigraph.springernature.com/ontologies/product-market-codes/I13014Microprocessors.Processor Architectures.004.1Jouannaud Jean-Pierreedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466144203316Functional programming languages and computer architecture383025UNISA