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

✍ Scribed by Tobias Nipkow (auth.), John Hughes (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 1991
• Tongue: English
• Leaves: 675
• Series: Lecture Notes in Computer Science 523
• Edition: 1
• Category: Library

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

✦ Table of Contents

Type classes and overloading resolution via order-sorted unification....Pages 1-14
On the complexity of ML typability with overloading....Pages 15-28
Coercive type isomorphism....Pages 29-49
Compiler-controlled multithreading for lenient parallel languages....Pages 50-72
Multi-thread code generation for dataflow architectures from non-strict programs....Pages 73-101
GAML: A parallel implementation of lazy ML....Pages 102-123
Functional programming with bananas, lenses, envelopes and barbed wire....Pages 124-144
A strongly-typed self-applicable partial evaluator....Pages 145-164
Automatic online partial evaluation....Pages 165-191
Assignments for applicative languages....Pages 192-214
Linearity and laziness....Pages 215-240
Syntactic detection of single-threading using continuations....Pages 241-258
A projection model of types....Pages 259-288
What is an efficient implementation of the λ-calculus?....Pages 289-312
Outline of a proof theory of parametricity....Pages 313-327
Reasoning about simple and exhaustive demand in higher-order lazy languages....Pages 328-351
Strictness analysis in logical form....Pages 352-366
A note on abstract interpretation of polymorphic functions....Pages 367-378
Incremental polymorphism....Pages 379-405
Dynamics in ML....Pages 406-426
Implementing regular tree expressions....Pages 427-447
Efficient type inference for higher-order binding-time analysis....Pages 448-472
Finiteness analysis....Pages 473-495
For a better support of static data flow....Pages 496-519
An architectural technique for cache-level garbage collection....Pages 520-537
M-structures: Extending a parallel, non-strict, functional language with state....Pages 538-568
List comprehensions in agna, a parallel persistent object system....Pages 569-591
Generating efficient code for lazy functional languages....Pages 592-617
Making abstract machines less abstract....Pages 618-635
Unboxed values as first class citizens in a non-strict functional language....Pages 636-666

✦ Subjects

Programming Languages, Compilers, Interpreters; Processor Architectures; Programming Techniques; Logics and Meanings of Programs