Formal computations of non deterministic recursive program schemes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3692668 (Why is no real title available?)
- scientific article; zbMATH DE number 3540387 (Why is no real title available?)
- scientific article; zbMATH DE number 3551848 (Why is no real title available?)
- scientific article; zbMATH DE number 3560704 (Why is no real title available?)
- scientific article; zbMATH DE number 3578343 (Why is no real title available?)
- scientific article; zbMATH DE number 3590261 (Why is no real title available?)
- scientific article; zbMATH DE number 3430132 (Why is no real title available?)
- scientific article; zbMATH DE number 3349291 (Why is no real title available?)
- A Powerdomain Construction
- IO and OI. I
- Nondeterministic Algorithms
- Power domains
- The correctness of nondeterministic programs
Cited in
(12)- Algebraic and fixed point equations over inverse limits of algebras
- Variétés d'automates descendants d'arbres infinis
- A short scientific biography of Maurice Nivat
- Automata on infinite objects and their applications to logic and programming
- Infinitary tree languages recognized by \(\omega\)-automata
- Iterative and recursive matrix theories
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Context-free series on trees
- Distributive semantics for nondeterministic typed -calculi
- Semantics of algorithmic languages
- Pushdown tree automata
- Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
This page was built for publication: Formal computations of non deterministic recursive program schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883492)
