Dual unbounded nondeterminacy, recursion, and fixpoints

DOI10.1007/S00236-007-0049-9zbMATH Open1127.68018OpenAlexW2121657617MaRDI QIDQ995749FDOQ995749

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

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

Mathematics Subject Classification ID

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

Cites Work

• A lattice-theoretical fixpoint theorem and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory for nondeterminism, parallelism, communication, and concurrency
• A Powerdomain Construction
• Countable nondeterminism and random assignment
• Title not available (Why is that?)
• Fixed-point calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theoretical basis for stepwise refinement and the programming calculus
• Title not available (Why is that?)
• General correctness: A unification of partial and total correctness
• Title not available (Why is that?)
• Power domain constructions
• Power domains
• Title not available (Why is that?)
• A fixpoint theory for non-monotonic parallelism
• Nondeterminacy and recursion via stacks and games
• Duality in specification languages: A lattice-theoretical approach
• Predicate-transformer semantics of general recursion
• The free completely distributive lattice over a poset
• Interpretations of recursion under unbounded nondeterminacy
• The Hoare and Symth power domain constructors commute under composition
• A source of inconsistency in theories of nondeterministic functions
• Mathematics of Program Construction
• Lower and upper power domain constructions commute on all cpos
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Nondeterminacy and recursion via stacks and games
• 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
• A fixpoint theory for non-monotonic parallelism
• Interpretations of recursion under unbounded nondeterminacy
• Title not available (Why is that?)
• On the fixpoints of nondeterministic recursive definitions
• Modelling higher-order dual nondeterminacy

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)