LEADER 05587nam 22006855 450 001 996465290203316 005 20240124011451.0 010 $a3-540-47599-0 024 7 $a10.1007/3-540-54396-1 035 $a(CKB)1000000000233687 035 $a(SSID)ssj0000323362 035 $a(PQKBManifestationID)11247873 035 $a(PQKBTitleCode)TC0000323362 035 $a(PQKBWorkID)10296665 035 $a(PQKB)10343387 035 $a(DE-He213)978-3-540-47599-6 035 $a(PPN)155226495 035 $a(EXLCZ)991000000000233687 100 $a20121227d1991 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFunctional Programming Languages and Computer Architecture$b[electronic resource] $e5th ACM Conference. Cambridge, MA, USA, August 26-30, 1991 Proceedings /$fedited by John Hughes 205 $a1st ed. 1991. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991. 215 $a1 online resource (VIII, 672 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v523 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-54396-1 327 $aType classes and overloading resolution via order-sorted unification -- On the complexity of ML typability with overloading -- Coercive type isomorphism -- Compiler-controlled multithreading for lenient parallel languages -- Multi-thread code generation for dataflow architectures from non-strict programs -- GAML: A parallel implementation of lazy ML -- Functional programming with bananas, lenses, envelopes and barbed wire -- A strongly-typed self-applicable partial evaluator -- Automatic online partial evaluation -- Assignments for applicative languages -- Linearity and laziness -- Syntactic detection of single-threading using continuations -- A projection model of types -- What is an efficient implementation of the ?-calculus? -- Outline of a proof theory of parametricity -- Reasoning about simple and exhaustive demand in higher-order lazy languages -- Strictness analysis in logical form -- A note on abstract interpretation of polymorphic functions -- Incremental polymorphism -- Dynamics in ML -- Implementing regular tree expressions -- Efficient type inference for higher-order binding-time analysis -- Finiteness analysis -- For a better support of static data flow -- An architectural technique for cache-level garbage collection -- M-structures: Extending a parallel, non-strict, functional language with state -- List comprehensions in agna, a parallel persistent object system -- Generating efficient code for lazy functional languages -- Making abstract machines less abstract -- Unboxed values as first class citizens in a non-strict functional language. 330 $aThis book offers a comprehensive view of the best and the latest work in functional programming. It is the proceedings of a major international conference and contains 30 papers selected from 126 submitted. A number of themes emerge. One is a growing interest in types: powerful type systems or type checkers supporting overloading, coercion, dynamic types, and incremental inference; linear types to optimize storage, and polymorphic types to optimize semantic analysis. The hot topic of partial evaluation is well represented: techniques for higher-order binding-time analysis, assuring termination of partial evaluation, and improving the residual programs a partial evaluator generates. The thorny problem of manipulating state in functional languages is addressed: one paper even argues that parallel programs with side-effects can be "more declarative" than purely functional ones. Theoretical work covers a new model of types based on projections, parametricity, a connection between strictness analysis and logic, and a discussion of efficient implementations of the lambda-calculus. The connection with computer architecture and a variety of other topics are also addressed. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v523 606 $aArchitecture, Computer 606 $aProgramming languages (Electronic computers) 606 $aMicroprocessors 606 $aComputer programming 606 $aComputer logic 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aProcessor Architectures$3https://scigraph.springernature.com/ontologies/product-market-codes/I13014 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 615 0$aArchitecture, Computer. 615 0$aProgramming languages (Electronic computers). 615 0$aMicroprocessors. 615 0$aComputer programming. 615 0$aComputer logic. 615 14$aComputer System Implementation. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aProcessor Architectures. 615 24$aProgramming Techniques. 615 24$aLogics and Meanings of Programs. 676 $a005.13 702 $aHughes$b John$f1958-$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465290203316 996 $aFunctional programming languages and computer architecture$9383025 997 $aUNISA