Nondeterminacy and recursion via stacks and games

DOI10.1016/0304-3975(92)00016-KzbMath0795.68128OpenAlexW2092038514MaRDI QIDQ1318704

Wim H. Hesselink

Publication date: 5 April 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)00016-k

zbMATH Keywords

unfoldingrecursive proceduresfixpoint inductioncompositional formal semanticsgame- theoretic operational semanticsprogramming language with recursionstack semanticsweakest- precondition

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items

DUALITY: A simple formalism for the analysis of UNITY, Safety and progress of recursive procedures, Games and winning strategies, Alternating states for dual nondeterminism in imperative programming, Dual unbounded nondeterminacy, recursion, and fixpoints

Cites Work

• A theoretical basis for stepwise refinement and the programming calculus
• Data refinement by calculation
• Duality in specification languages: A lattice-theoretical approach
• Processes and formalisms for unbounded choice
• A lattice-theoretical fixpoint theorem and its applications
• Alternation
• Programs, Recursion and Unbounded Choice
• Programming as a Discipline of Mathematical Nature
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item