A mathematical semantics for a nondeterministic typed lambda-calculus
From MaRDI portal
Publication:1152949
DOI10.1016/0304-3975(80)90015-8zbMath0462.68006MaRDI QIDQ1152949
Matthew C. B. Hennessy, E. A. Ashcroft
Publication date: 1980
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(80)90015-8
68Q65: Abstract data types; algebraic specification
03B40: Combinatory logic and lambda calculus
68W99: Algorithms in computer science
Related Items
Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Semantics of algorithmic languages, Distributive semantics for nondeterministic typed \(\lambda\)-calculi, A theory for nondeterminism, parallelism, communication, and concurrency, A generalized setting for fixpoint theory, The origins of structural operational semantics
Uses Software
Cites Work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- LCF considered as a programming language
- Fully abstract models of typed \(\lambda\)-calculi
- A Powerdomain Construction
- Intensional interpretations of functionals of finite type I
- Fixpoint approach to the theory of computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item