Categorical combinators, sequential algorithms, and functional programming.
This is a completely revised version of the book published by \textit{B. Pitman} Publishing Ltd. (1986; Zbl 0643.68002). The author presents an approach to the semantics of sequential programming languages based on the relationship between \(\lambda\)-calculus and category theory, with applications to the design and implementation of programming languages. In the second edition many new results due to various authors (including the author of the book) are added, mostly in the form of exercises. Many new references are included. Among other things, the following new topics are reported: the confluence properties of rewriting systems of categorical combinators, calculi of explicit substitutions, connections of sequential algorithms with linear logic and games, a theory of sequential structures. The additions make the book more comprehensive and up-to-date.
- Applications of infinitary lambda calculus
- Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
- Lambda calculus with explicit recursion
- Degrees of parallelism in the continuous type hierarchy
- Infinitary lambda calculus
- Glueing and orthogonality for models of linear logic
- The sequentially realizable functionals
- A relative PCF-definability result for strongly stable functions and some corollaries
- Higher order unification via explicit substitutions
- Descendants and origins in term rewriting.
- Games and full abstraction for FPC.
- Full abstraction for PCF
- Prelogical relations
- Simply typed lambda calculus with first-class environments
- Confluence theory for graphs
- A stable programming language
- Interaction nets with McCarthy's \(\mathsf{amb}\)
- Definability and full abstraction
- scientific article; zbMATH DE number 4048997 (Why is no real title available?)
- scientific article; zbMATH DE number 1531361 (Why is no real title available?)
- Bistructures, bidomains and linear logic
- On the enumeration of closures and environments with an application to random generation
- Stable bistructure models of PCF (preliminary draft)
- New developments in environment machines
- A semantics for nabla
- Musings around the geometry of interaction, and coherence
- Type similarity for the Lambek-Grishin calculus revisited
- Mechanizing logical relations
- Concrete data structures and functional parallel programming
- On the expressive power of first-order boolean functions in PCF
- Languages and logical definability in concurrency monoids
- The largest cartesian closed category of stable domains
- Refunctionalization at work
This page was built for publication: Categorical combinators, sequential algorithms, and functional programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287527)
