Functional Programming Languages and Computer Architecture 5th ACM Conference. Cambridge, MA, USA, August 26-30, 1991 Proceedings / edited by John Hughes.

This 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...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Hughes, John (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1991.
Edition:1st ed. 1991.
Series:Lecture Notes in Computer Science, 523
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3241703
003 MWH
005 20191025112551.0
007 cr nn 008mamaa
008 121227s1991 gw | s |||| 0|eng d
020 |a 9783540475996 
024 7 |a 10.1007/3-540-54396-1  |2 doi 
035 |a (DE-He213)978-3-540-47599-6 
050 4 |a E-Book 
072 7 |a UYD  |2 bicssc 
072 7 |a COM032000  |2 bisacsh 
072 7 |a UYD  |2 thema 
245 1 0 |a Functional Programming Languages and Computer Architecture  |h [electronic resource] :  |b 5th ACM Conference. Cambridge, MA, USA, August 26-30, 1991 Proceedings /  |c edited by John Hughes. 
250 |a 1st ed. 1991. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1991. 
300 |a VIII, 672 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 523 
490 1 |a Springer eBook Collection 
505 0 |a Type 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. 
520 |a This 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. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Architecture, Computer. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Microprocessors. 
650 0 |a Computer programming. 
650 0 |a Computer logic. 
690 |a Electronic resources (E-books) 
700 1 |a Hughes, John.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 523 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/3-540-54396-1  |3 Click to view e-book  |t 0 
907 |a .b32417032  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21548687  |z 02-26-20 
999 f f |i cebfd977-f0e2-5d1c-83bd-e0b7e0c28979  |s 5b5ae634-249a-5e41-b00d-f503f80347eb  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File