Dual unbounded nondeterminacy, recursion, and fixpoints

DOI10.1007/S00236-007-0049-9MaRDI QIDQ995749zbMATH OpenOpenAlexFDO

Authors Joseph M. Morris, Malcolm Tyrrell

Publication date 10 September 2007

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-007-0049-9

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18)

Recommendations

• On the fixpoints of nondeterministic recursive definitions
• Terms with unbounded demonic and angelic nondeterminacy
• Interpretations of recursion under unbounded nondeterminacy
• Mathematics of Program Construction
• Unbounded Non-determinism in CSP

Cites work

• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 3846844 (Why is no real title available?)
• scientific article; zbMATH DE number 3705887 (Why is no real title available?)
• scientific article; zbMATH DE number 3707731 (Why is no real title available?)
• scientific article; zbMATH DE number 3716749 (Why is no real title available?)
• scientific article; zbMATH DE number 3765109 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 3602653 (Why is no real title available?)
• scientific article; zbMATH DE number 1332105 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• scientific article; zbMATH DE number 2087342 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• A Powerdomain Construction
• A fixpoint theory for non-monotonic parallelism
• A lattice-theoretical fixpoint theorem and its applications
• A source of inconsistency in theories of nondeterministic functions
• A theoretical basis for stepwise refinement and the programming calculus
• A theory for nondeterminism, parallelism, communication, and concurrency
• Countable nondeterminism and random assignment
• Duality in specification languages: A lattice-theoretical approach
• Fixed-point calculus
• General correctness: A unification of partial and total correctness
• Interpretations of recursion under unbounded nondeterminacy
• Lower and upper power domain constructions commute on all cpos
• Mathematics of Program Construction
• Nondeterminacy and recursion via stacks and games
• Power domain constructions
• Power domains
• Predicate-transformer semantics of general recursion
• The Hoare and Symth power domain constructors commute under composition
• The free completely distributive lattice over a poset

Cited in

(10)

• On the fixpoints of nondeterministic recursive definitions
• Alternating states for dual nondeterminism in imperative programming
• Language constructs for non-well-founded computation
• Terms with unbounded demonic and angelic nondeterminacy
• On the structural properties of the set of fixpoints for nondeterministic recursive definitions
• Nondeterminacy and recursion via stacks and games
• Interpretations of recursion under unbounded nondeterminacy
• Modelling higher-order dual nondeterminacy
• scientific article; zbMATH DE number 1948158 (Why is no real title available?)
• A fixpoint theory for non-monotonic parallelism

This page was built for publication: Dual unbounded nondeterminacy, recursion, and fixpoints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995749)