On the fixpoints of nondeterministic recursive definitions
From MaRDI portal
Publication:1059391
DOI10.1016/0022-0000(84)90014-XzbMath0566.68009OpenAlexW1987239174MaRDI QIDQ1059391
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90014-x
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formalization of equivalence of recursively defined functions
- Backtracking in recursive computations
- The convergence of functions to fixedpoints of recursive definitions
- Formalization of correctness of recursive definitions
- On the relationship between computed functions and fixpoints of nondeterministic recursive definitions
- The Theoretical Aspects of the Optimal Fixedpoint
This page was built for publication: On the fixpoints of nondeterministic recursive definitions