Set-theoretic models of computations
From MaRDI portal
Recommendations
Cites work
- A theoretical basis for stepwise refinement and the programming calculus
- An axiomatic basis for computer programming
- Data refinement of predicate transformers
- Distributed cooperation with action systems
- Guarded commands, nondeterminacy and formal derivation of programs
- scientific article; zbMATH DE number 3943003 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 517333 (Why is no real title available?)
- Modeling in Event B. System and software engineering.
- Programs, Recursion and Unbounded Choice
- The B-Book
- The specification statement
- Unifying theories for logic programming
Cited in
(8)- Models of computation
- Towards a computation system based on set theory
- The Complexity of Infinite Computations In Models of Set Theory
- scientific article; zbMATH DE number 4128803 (Why is no real title available?)
- Techniques of computable set theory with applications to proof verification
- scientific article; zbMATH DE number 7340320 (Why is no real title available?)
- Computable Models
- New Computational Paradigms
This page was built for publication: Set-theoretic models of computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842623)