The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
From MaRDI portal
Publication:3878733
DOI10.1137/0209005zbMath0437.68002OpenAlexW2037785443MaRDI QIDQ3878733
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209005
operational semanticsdenotational semanticsnondeterminismrecursive programscall-by-valuecall-by-namemathematical semanticscomputation rules
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items (21)
A semantic characterization for faults in replicated systems ⋮ A theory for nondeterminism, parallelism, communication, and concurrency ⋮ The origins of structural operational semantics ⋮ Categorical semantics for programming languages ⋮ About fair asynchrony ⋮ Discrete Lawvere theories and computational effects ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Parameter passing in nondeterministic recursive programs ⋮ Generated models and the ω-rule: The nondeterministic case ⋮ Composition and behaviors of probabilistic I/O automata ⋮ A proof system for the first-order relational calculus ⋮ The IO- and OI-hierarchies ⋮ Measuring the confinement of probabilistic systems ⋮ Combining effects: sum and tensor ⋮ Refusal testing ⋮ Semantics of algorithmic languages ⋮ Distributive semantics for nondeterministic typed \(\lambda\)-calculi ⋮ A process algebra with distributed priorities ⋮ Linda-based applicative and imperative process algebras ⋮ Testing preorders for probabilistic processes. ⋮ Trace and testing equivalence on asynchronous processes
This page was built for publication: The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment