A mathematical semantics for a nondeterministic typed lambda-calculus

DOI10.1016/0304-3975(80)90015-8zbMath0462.68006OpenAlexW1986227685MaRDI 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

zbMATH Keywords

lambda calculussemantics of nondeterministic algorithms

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40) Algorithms in computer science (68W99)

Related Items

A theory for nondeterminism, parallelism, communication, and concurrency, The origins of structural operational semantics, Unnamed Item, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, A Game Semantics of Idealized CSP, An operational domain-theoretic treatment of recursive types, Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, A generalized setting for fixpoint theory, Semantics of algorithmic languages, Distributive semantics for nondeterministic typed \(\lambda\)-calculi

Uses Software

• LCF

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