Models for the computational λ-calculus
From MaRDI portal
Publication:4923379
DOI10.1016/S1571-0661(05)80056-8zbMath1264.03047MaRDI QIDQ4923379
Publication date: 6 June 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Categorical logic, topoi (03G30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Combinatory logic and lambda calculus (03B40)
Related Items (3)
Pseudo-distributive laws and axiomatics for variable binding ⋮ A survey of categorical properties of \(\mathbb{L}\)-fuzzy relations ⋮ The untyped computational \(\lambda \)-calculus and its intersection type discipline
Cites Work
- Notions of computation and monads
- Enrichment through variation
- Modelling environments in call-by-value programming languages.
- Premonoidal categories as categories with algebraic structure
- The formal theory of monads
- Premonoidal categories and notions of computation
- Game theoretic analysis of call-by-value computation
- Semantics for Algebraic Operations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Models for the computational λ-calculus
