Functional Programming Languages and Computer Architecture : 5th ACM Conference. Cambridge, MA, USA, August 26-30, 1991 Proceedings

John Hughes

ISBN 10: 3540543961 / ISBN 13: 9783540543961

Published by Springer Berlin Heidelberg, 1991

About this Item

Druck auf Anfrage Neuware - Printed after ordering - This book offers a comprehensive view of the best and thelatest work in functional programming. It is the proceedingsof a major international conference and contains 30 papersselected from 126 submitted. A number of themes emerge. Oneis a growing interest in types: powerful type systems ortype checkers supporting overloading, coercion, dynamictypes, and incremental inference; linear types to optimizestorage, and polymorphic types to optimize semanticanalysis. The hot topic of partial evaluation is wellrepresented: techniques for higher-order binding-timeanalysis, assuring termination of partial evaluation, andimproving the residual programs a partial evaluatorgenerates. The thorny problem of manipulating state infunctional languages is addressed: one paper even arguesthat parallel programs with side-effects can be 'moredeclarative' than purely functional ones. Theoretical workcovers a new model of types based on projections,parametricity, a connection between strictness analysis andlogic, and a discussion of efficient implementations of thelambda-calculus. The connection with computer architectureand a variety of other topics are also addressed.

Seller Inventory # 9783540543961

Bibliographic Details

• Title: Functional Programming Languages and Computer Architecture : 5th ACM Conference. Cambridge, MA, USA, August 26-30, 1991 Proceedings
• Publisher: Springer Berlin Heidelberg
• Publication Date: 1991
• Language: English
• ISBN 10: 3540543961
• ISBN 13: 9783540543961
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

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.