Functional Programming Languages and Computer Architecture [electronic resource] : 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings /
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.
Main Authors: | , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1991
|
Subjects: | Computer science., Microprocessors., Architecture, Computer., Computer programming., Programming languages (Electronic computers)., Computer logic., Computer Science., Computer System Implementation., Programming Languages, Compilers, Interpreters., Processor Architectures., Programming Techniques., Logics and Meanings of Programs., |
Online Access: | http://dx.doi.org/10.1007/3-540-54396-1 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
KOHA-OAI-TEST:207921 |
---|---|
record_format |
koha |
institution |
COLPOS |
collection |
Koha |
country |
México |
countrycode |
MX |
component |
Bibliográfico |
access |
En linea En linea |
databasecode |
cat-colpos |
tag |
biblioteca |
region |
America del Norte |
libraryname |
Departamento de documentación y biblioteca de COLPOS |
language |
eng |
topic |
Computer science. Microprocessors. Architecture, Computer. Computer programming. Programming languages (Electronic computers). Computer logic. Computer Science. Computer System Implementation. Programming Languages, Compilers, Interpreters. Processor Architectures. Programming Techniques. Logics and Meanings of Programs. Computer science. Microprocessors. Architecture, Computer. Computer programming. Programming languages (Electronic computers). Computer logic. Computer Science. Computer System Implementation. Programming Languages, Compilers, Interpreters. Processor Architectures. Programming Techniques. Logics and Meanings of Programs. |
spellingShingle |
Computer science. Microprocessors. Architecture, Computer. Computer programming. Programming languages (Electronic computers). Computer logic. Computer Science. Computer System Implementation. Programming Languages, Compilers, Interpreters. Processor Architectures. Programming Techniques. Logics and Meanings of Programs. Computer science. Microprocessors. Architecture, Computer. Computer programming. Programming languages (Electronic computers). Computer logic. Computer Science. Computer System Implementation. Programming Languages, Compilers, Interpreters. Processor Architectures. Programming Techniques. Logics and Meanings of Programs. Hughes, John. editor. SpringerLink (Online service) Functional Programming Languages and Computer Architecture [electronic resource] : 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings / |
description |
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. |
format |
Texto |
topic_facet |
Computer science. Microprocessors. Architecture, Computer. Computer programming. Programming languages (Electronic computers). Computer logic. Computer Science. Computer System Implementation. Programming Languages, Compilers, Interpreters. Processor Architectures. Programming Techniques. Logics and Meanings of Programs. |
author |
Hughes, John. editor. SpringerLink (Online service) |
author_facet |
Hughes, John. editor. SpringerLink (Online service) |
author_sort |
Hughes, John. editor. |
title |
Functional Programming Languages and Computer Architecture [electronic resource] : 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings / |
title_short |
Functional Programming Languages and Computer Architecture [electronic resource] : 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings / |
title_full |
Functional Programming Languages and Computer Architecture [electronic resource] : 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings / |
title_fullStr |
Functional Programming Languages and Computer Architecture [electronic resource] : 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings / |
title_full_unstemmed |
Functional Programming Languages and Computer Architecture [electronic resource] : 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings / |
title_sort |
functional programming languages and computer architecture [electronic resource] : 5th acm conference cambridge, ma, usa, august 26–30, 1991 proceedings / |
publisher |
Berlin, Heidelberg : Springer Berlin Heidelberg, |
publishDate |
1991 |
url |
http://dx.doi.org/10.1007/3-540-54396-1 |
work_keys_str_mv |
AT hughesjohneditor functionalprogramminglanguagesandcomputerarchitectureelectronicresource5thacmconferencecambridgemausaaugust26301991proceedings AT springerlinkonlineservice functionalprogramminglanguagesandcomputerarchitectureelectronicresource5thacmconferencecambridgemausaaugust26301991proceedings |
_version_ |
1756268451447439360 |
spelling |
KOHA-OAI-TEST:2079212018-07-30T23:38:40ZFunctional Programming Languages and Computer Architecture [electronic resource] : 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings / Hughes, John. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,1991.engThis 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.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.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.Computer science.Microprocessors.Architecture, Computer.Computer programming.Programming languages (Electronic computers).Computer logic.Computer Science.Computer System Implementation.Programming Languages, Compilers, Interpreters.Processor Architectures.Programming Techniques.Logics and Meanings of Programs.Springer eBookshttp://dx.doi.org/10.1007/3-540-54396-1URN:ISBN:9783540475996 |