Skip to main content
SpringerLink
Log in
Book cover

Arrays, Functional Languages, and Parallel Systems

  • Book
  • © 1991

Overview

Editors:
  1. Lenore M. R. Mullin

    1. University of Vermont, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michael Jenkins

    1. Queen’s University, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Gaétan Hains

    1. University of Montreal, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Robert Bernecky

    1. Snake Island Research, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Guang Gao

    1. McGill University, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Access this book

Log in via an institution
eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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 (17 chapters)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Arrays and The Lambda Calculus

    • Klaus Berkling
    Pages 1-17

  3. Compiling APL

    • Robert Bernecky
    Pages 19-33

  4. Acorn Run-Time System for the CM-2

    • Walter Schwarz
    Pages 35-57

  5. Compiling Issues of Monolithic Arrays

    • Guang R. Gao
    Pages 59-92

  6. Arrays in Sisal

    • John T. Feo
    Pages 93-106

  7. Falafel: Arrays in a Functional Language

    • Carl McCrosky, Kanad Roy, Ken Sailor
    Pages 107-123

  8. Arrays in HASKELL

    • Guy Lapalme
    Pages 125-131

  9. Array Theory and Knowledge Representation

    • Janice Glasgow
    Pages 133-144

  10. A Parallel Intermediate Representation based on Lambda Expressions

    • Timothy A. Budd
    Pages 145-153

  11. Arrays in FIDIL

    • Luigi Semenzato, Paul Hilfinger
    Pages 155-169

  12. Structured Data-Types in the Reduction System π-RED

    • C. Schmittgen, H. Blödorn, W. Kluge
    Pages 171-183

  13. Psi, the Indexing Function: a basis for FFP with arrays

    • Lenore M. Restifo Mullin
    Pages 185-200

  14. Genotype—A Pure Functional Array Language

    • Sebastian Shaumyan
    Pages 201-236

  15. A Comparison of Array Theory and a Mathematics of Arrays

    • Michael A. Jenkins, Lenore R. Mullin
    Pages 237-267

  16. Alternative Evaluation of Array Expressions

    • Cory F. Skutt
    Pages 269-294

  17. Matrix Inversion in 3 Dimensions

    • Gaétan Hains
    Pages 295-302

  18. Fuzzy Inference using Array Theory and Nial

    • Jan Jantzen
    Pages 303-316

  19. Back Matter

    Pages 317-319
    Download chapter PDF
Back to top

Keywords

About this book

During a meeting in Toronto last winter, Mike Jenkins, Bob Bernecky and I were discussing how the two existing theories on arrays influenced or were in­ fluenced by programming languages and systems. More's Army Theory was the basis for NIAL and APL2 and Mullin's A Mathematics of A rmys(MOA) , is being used as an algebra of arrays in functional and A-calculus based pro­ gramming languages. MOA was influenced by Iverson's initial and extended algebra, the foundations for APL and J respectively. We discussed that there is a lot of interest in the Computer Science and Engineering communities concerning formal methods for languages that could support massively parallel operations in scientific computing, a back­ to-roots interest for both Mike and myself. Languages for this domain can no longer be informally developed since it is necessary to map languages easily to many multiprocessor architectures. Software systems intended for parallel computation require a formal basis so that modifications can be done with relative ease while ensuring integrity in design. List based lan­ guages are profiting from theoretical foundations such as the Bird-Meertens formalism. Their theory has been successfully used to describe list based parallel algorithms across many classes of architectures.

Editors and Affiliations

  • University of Vermont, USA

    Lenore M. R. Mullin

  • Queen’s University, USA

    Michael Jenkins

  • University of Montreal, Canada

    Gaétan Hains

  • Snake Island Research, USA

    Robert Bernecky

  • McGill University, Canada

    Guang Gao

Bibliographic Information

  • Book Title: Arrays, Functional Languages, and Parallel Systems

  • Editors: Lenore M. R. Mullin, Michael Jenkins, Gaétan Hains, Robert Bernecky, Guang Gao

  • DOI: https://doi.org/10.1007/978-1-4615-4002-1

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 1991

  • Hardcover ISBN: 978-0-7923-9213-2Published: 31 October 1991

  • Softcover ISBN: 978-1-4613-6789-5Published: 30 September 2012

  • eBook ISBN: 978-1-4615-4002-1Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: XI, 319

  • Topics: Processor Architectures

Publish with us

Policies and ethics

Back to top

Search

Navigation