Pattern Calculus

Computing with Functions and Structures

  • Barry Jay

Table of contents

  1. Front Matter
    Pages i-xv
  2. Terms

    1. Front Matter
      Pages 1-1
    2. Barry Jay
      Pages 3-12
    3. Barry Jay
      Pages 13-22
    4. Barry Jay
      Pages 23-31
    5. Barry Jay
      Pages 33-44
    6. Barry Jay
      Pages 45-58
    7. Barry Jay
      Pages 59-64
  3. Types

    1. Front Matter
      Pages 65-65
    2. Barry Jay
      Pages 67-79
    3. Barry Jay
      Pages 81-90
    4. Barry Jay
      Pages 91-103
    5. Barry Jay
      Pages 105-111
    6. Barry Jay
      Pages 113-128
    7. Barry Jay
      Pages 129-141
  4. Programming in bondi

    1. Front Matter
      Pages 143-143
    2. Barry Jay
      Pages 145-147
    3. Barry Jay
      Pages 149-160
    4. Barry Jay
      Pages 161-168
    5. Barry Jay
      Pages 169-171

About this book

Introduction

Over time, basic research tends to lead to specialization – increasingly narrow t- ics are addressed by increasingly focussed communities, publishing in increasingly con ned workshops and conferences, discussing increasingly incremental contri- tions. Already the community of programming languages is split into various s- communities addressing different aspects and paradigms (functional, imperative, relational, and object-oriented). Only a few people manage to maintain a broader view, and even fewer step back in order to gain an understanding about the basic principles, their interrelation, and their impact in a larger context. The pattern calculus is the result of a profound re-examination of a 50-year - velopment. It attempts to provide a unifying approach, bridging the gaps between different programming styles and paradigms according to a new slogan – compu- tion is pattern matching. It is the contribution of this book to systematically and elegantly present and evaluate the power of pattern matching as the guiding paradigm of programming. Patterns are dynamically generated, discovered, passed, applied, and automatically adapted, based on pattern matching and rewriting technology, which allows one to elegantly relate things as disparate as functions and data structures. Of course, pattern matching is not new. It underlies term rewriting – it is, for example, inc- porated in, typically functional, programming languages, like Standard ML – but it has never been pursued as the basis of a unifying framework for programming.

Keywords

Data structures Functional programming Imperative programming Lambda calculus Lisp OCaml Pattern calculus Pattern matching Polymorphism Programming style Type theory bondi data structure programming programming language

Authors and affiliations

  • Barry Jay
    • 1
  1. 1.Fac. Engineering & InformationUniversity of Technology, SydneyBroadwayAustralia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-89185-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-89184-0
  • Online ISBN 978-3-540-89185-7
  • About this book