Distributive semantics for nondeterministic typed \(\lambda\)-calculi

DOI10.1016/0304-3975(84)90027-6zbMath0555.03007OpenAlexW1996751264MaRDI QIDQ760418

Egidio Astesiano, Gerardo Costa

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90027-6

zbMATH Keywords

operational semanticsrewriting systemsdenotational semanticstyped lambda-calculusapplicative languagesdistributive modelsfully abstract modelsnondeterministic binary choice operatornondeterministic languages

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)

Cites Work

• Parameter passing in nondeterministic recursive programs
• A mathematical semantics for a nondeterministic typed lambda-calculus
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• Formal computations of non deterministic recursive program schemes
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distributive semantics for nondeterministic typed \(\lambda\)-calculi