Skip to main content
SpringerLink
Log in

Functional Programming Languages and Computer Architecture

5th ACM Conference. Cambridge, MA, USA, August 26-30, 1991 Proceedings

  • Conference proceedings
  • © 1991

Overview

Editors:
  1. John Hughes
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 523)

Included in the following conference series:

Conference proceedings info: FPCA 1991.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  2. Type classes and overloading resolution via order-sorted unification

    • Tobias Nipkow, Gregor Snelting
    Pages 1-14

  3. On the complexity of ML typability with overloading

    • Dennis M. Volpano, Geoffrey S. Smith
    Pages 15-28

  4. Coercive type isomorphism

    • Satish R. Thatte
    Pages 29-49

  5. Compiler-controlled multithreading for lenient parallel languages

    • Klaus Erik Schauser, David E. Culler, Thorsten von Eicken
    Pages 50-72

  6. Multi-thread code generation for dataflow architectures from non-strict programs

    • Kenneth R. Traub
    Pages 73-101

  7. GAML: A parallel implementation of lazy ML

    • Luc Maranget
    Pages 102-123

  8. Functional programming with bananas, lenses, envelopes and barbed wire

    • Erik Meijer, Maarten Fokkinga, Ross Paterson
    Pages 124-144

  9. A strongly-typed self-applicable partial evaluator

    • John Launchbury
    Pages 145-164

  10. Automatic online partial evaluation

    • Daniel Weise, Roland Conybeare, Erik Ruf, Scott Seligman
    Pages 165-191

  11. Assignments for applicative languages

    • Vipin Swarup, Uday S. Reddy, Evan Ireland
    Pages 192-214

  12. Linearity and laziness

    • David Wakeling, Colin Runciman
    Pages 215-240

  13. Syntactic detection of single-threading using continuations

    • Pascal Fradet
    Pages 241-258

  14. A projection model of types

    • D. J. Lillie, P. G. Harrison
    Pages 259-288

  15. What is an efficient implementation of the λ-calculus?

    • Gudmund S. Frandsen, Carl Sturtivant
    Pages 289-312

  16. Outline of a proof theory of parametricity

    • Harry G. Mairson
    Pages 313-327

  17. Reasoning about simple and exhaustive demand in higher-order lazy languages

    • Allen Leung, Prateek Mishra
    Pages 328-351

  18. Strictness analysis in logical form

    • Thomas P. Jensen
    Pages 352-366

  19. A note on abstract interpretation of polymorphic functions

    • Gebreselassie Baraki
    Pages 367-378

  20. Incremental polymorphism

    • Shail Aditya, Rishiyur S. Nikhil
    Pages 379-405
Back to top

Other volumes

  1. Functional Programming Languages and Computer Architecture

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation