Advertisement

Table of contents

  1. Front Matter
  2. Dennis M. Volpano, Geoffrey S. Smith
    Pages 15-28
  3. Satish R. Thatte
    Pages 29-49
  4. Klaus Erik Schauser, David E. Culler, Thorsten von Eicken
    Pages 50-72
  5. Luc Maranget
    Pages 102-123
  6. Erik Meijer, Maarten Fokkinga, Ross Paterson
    Pages 124-144
  7. Daniel Weise, Roland Conybeare, Erik Ruf, Scott Seligman
    Pages 165-191
  8. Vipin Swarup, Uday S. Reddy, Evan Ireland
    Pages 192-214
  9. David Wakeling, Colin Runciman
    Pages 215-240
  10. D. J. Lillie, P. G. Harrison
    Pages 259-288
  11. Gudmund S. Frandsen, Carl Sturtivant
    Pages 289-312
  12. Harry G. Mairson
    Pages 313-327
  13. Thomas P. Jensen
    Pages 352-366
  14. Shail Aditya, Rishiyur S. Nikhil
    Pages 379-405
  15. Xavier Leroy, Michel Mauny
    Pages 406-426
  16. Alexander Aiken, Brian R. Murphy
    Pages 427-447
  17. Carsten Kehler Holst
    Pages 473-495
  18. Charles Consel, Olivier Danvy
    Pages 496-519
  19. Paul S. Barth, Rishiyur S. Nikhil, Arvind Massachusetts Institute of Technology
    Pages 538-568
  20. Michael L. Heytens, Rishiyur S. Nikhil
    Pages 569-591
  21. Sjaak Smetsers, Eric Nöcker, John van Groningen, Rinus Plasmeijer
    Pages 592-617
  22. John Hannan
    Pages 618-635
  23. Simon L Peyton Jones, John Launchbury
    Pages 636-666
  24. Back Matter

About these proceedings

Introduction

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.

Keywords

Evaluation Parallele Architekturen Partial Evaluation Partielle Evaluation Programmiersprache Semantik von computer computer architecture functional programming logic programming programming language

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-54396-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 1991
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-54396-1
  • Online ISBN 978-3-540-47599-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
Electronics
IT & Software
Telecommunications