A fully abstract semantics for a higher-order functional language with nondeterministic computation

DOI10.1016/S0304-3975(98)00356-9zbMath0954.68038OpenAlexW1968787210MaRDI QIDQ1575887

Alan Jeffrey

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00356-9

zbMATH Keywords

functional programming language

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65) Categorical semantics of formal languages (18C50) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Call-by-push-value: Decomposing call-by-value and call-by-name ⋮ Adjunction Models For Call-By-Push-Value With Stacks ⋮ Program equivalence in linear contexts

This page was built for publication: A fully abstract semantics for a higher-order functional language with nondeterministic computation