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

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:
Architecture, Computer.
Programming languages (Electronic computers).
Microprocessors.
Computer programming.
Computer logic.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items