Pattern Calculus: Computing with Functions and Structures

Publication Type:
2009, 1
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2009001841OK_Jay.pdf1.86 MB
Adobe PDF
The pattern calculus is a new foundation for computation, in which the expressive power of functions and of data structures are fruitfully combined within pattern-matching functions. The best of existing foundations focus on either functions (in the lambda-calculus) or on data structures (in Turing machines) or compromise on both (as in object-orientation). By contrast, a small typed pattern calculus supports all the main programming styles, including functional, imperative, object-oriented and query-based styles. Indeed, it may help to support web services, to the extent that these are generic functions applied to partially specified data structures.
Please use this identifier to cite or link to this item: