Skip to main content
SpringerLink
Log in
Book cover

Functional Programming Languages and Computer Architecture

Proceedings, Nancy, France, September 16-19, 1985

  • Conference proceedings
  • © 1985

Overview

Editors:
  1. Jean-Pierre Jouannaud
    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 201)

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 54.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 (25 papers)

  1. Front Matter

    Download chapter PDF

  2. Miranda: A non-strict functional language with polymorphic types

    • D. A. Turner
    Pages 1-16

  3. Data flow graph optimization in if1

    • S. K. Skedzielewski, M. L. Welcome
    Pages 17-34

  4. Strictness analysis — a practical approach

    • Chris Clack, Simon L Peyton Jones
    Pages 35-49

  5. The categorical abstract machine

    • G. Cousineau, P-L. Curien, M. Mauny
    Pages 50-64

  6. High order programming in extended FP

    • Patrick Bellot
    Pages 65-80

  7. Secd-m: a virtual machine for applicative programming

    • S. Abramsky, R. Sykes
    Pages 81-98

  8. Cobweb — A combinator reduction architecture

    • CL Hankin, PE Osmon, MJ Shute
    Pages 99-112

  9. How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages

    • Philip Wadler
    Pages 113-128

  10. Lazy memo-functions

    • John Hughes
    Pages 129-146

  11. An architecture for fast data movement in the FFP machine

    • David A. Plaisted
    Pages 147-163

  12. An architecture that efficiently updates associative aggregates in applicative programming languages

    • John T. O'Donnell
    Pages 164-189

  13. Lambda lifting: Transforming programs to recursive equations

    • Thomas Johnsson
    Pages 190-203

  14. Optimizing almost-tail-recursive prolog programs

    • Saumya K. Debray
    Pages 204-219

  15. Designing regular array architectures using higher order functions

    • Mary Sheeran
    Pages 220-237

  16. \(v\mathcal{F}\mathcal{P}\): An environment for the multi-level specification, analysis, and synthesis of hardware algorithms

    • Dorab Patel, Martine Schlag, MiloÅ¡ Ercegovac
    Pages 238-255

  17. A distributed garbage collection algorithm

    • John Hughes
    Pages 256-272

  18. Cyclic reference counting for combinator machines

    • D. R. Brownbridge
    Pages 273-288

  19. Design for a multiprocessing heap with on-board reference counting

    • David S. Wise
    Pages 289-304

  20. A functional language and modular architecture for scientific computing

    • Mark F. Young
    Pages 305-318
Back to top

Keywords

Bibliographic Information

  • Book Title: Functional Programming Languages and Computer Architecture

  • Book Subtitle: Proceedings, Nancy, France, September 16-19, 1985

  • Editors: Jean-Pierre Jouannaud

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-15975-4

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1985

  • Softcover ISBN: 978-3-540-15975-9Published: 01 September 1985

  • eBook ISBN: 978-3-540-39677-2Published: 06 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 416

  • Topics: Processor Architectures

Publish with us

Policies and ethics

Back to top

Search

Navigation