Advertisement

Arrays, Functional Languages, and Parallel Systems

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

Table of contents

  1. Front Matter
    Pages i-xi
  2. Klaus Berkling
    Pages 1-17
  3. Robert Bernecky
    Pages 19-33
  4. Walter Schwarz
    Pages 35-57
  5. Guang R. Gao
    Pages 59-92
  6. John T. Feo
    Pages 93-106
  7. Carl McCrosky, Kanad Roy, Ken Sailor
    Pages 107-123
  8. Guy Lapalme
    Pages 125-131
  9. Janice Glasgow
    Pages 133-144
  10. Luigi Semenzato, Paul Hilfinger
    Pages 155-169
  11. C. Schmittgen, H. Blödorn, W. Kluge
    Pages 171-183
  12. Lenore M. Restifo Mullin
    Pages 185-200
  13. Sebastian Shaumyan
    Pages 201-236
  14. Michael A. Jenkins, Lenore R. Mullin
    Pages 237-267
  15. Cory F. Skutt
    Pages 269-294
  16. Gaétan Hains
    Pages 295-302
  17. Back Matter
    Pages 317-319

About this book

Introduction

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.

Keywords

Calc DEX Haskell Jenkins algorithms calculus computer design formal methods function functional presentation processor programming scientific computing

Editors and affiliations

  • Lenore M. R. Mullin
    • 1
  • Michael Jenkins
    • 2
  • Gaétan Hains
    • 3
  • Robert Bernecky
    • 4
  • Guang Gao
    • 5
  1. 1.University of VermontUSA
  2. 2.Queen’s UniversityUSA
  3. 3.University of MontrealCanada
  4. 4.Snake Island ResearchUSA
  5. 5.McGill UniversityCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4615-4002-1
  • Copyright Information Springer Science+Business Media New York 1991
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-6789-5
  • Online ISBN 978-1-4615-4002-1
  • Buy this book on publisher's site