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

ISBN-13: 9783540543961 / Angielski / Miękka / 1991 / 672 str.

John Hughes; John Hughes

Opis

This volume of conference proceedings offers a view of the latest work in functional programming. A number of themes emerge. One is a growing interest in types, such as 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.

Spis treści

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.