Formal computations of non deterministic recursive program schemes
From MaRDI portal
Publication:3883492
DOI10.1007/BF01744297zbMath0441.68044MaRDI QIDQ3883492
Publication date: 1980
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (13)
Variétés d'automates descendants d'arbres infinis ⋮ Iterative and recursive matrix theories ⋮ Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes ⋮ Algebraic and fixed point equations over inverse limits of algebras ⋮ Pushdown tree automata ⋮ Automata on infinite objects and their applications to logic and programming ⋮ Linear context-free tree languages and inverse homomorphisms ⋮ Semantics of algorithmic languages ⋮ Distributive semantics for nondeterministic typed \(\lambda\)-calculi ⋮ Infinitary tree languages recognized by \(\omega\)-automata ⋮ Context-free series on trees ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation ⋮ A short scientific biography of Maurice Nivat
Cites Work
This page was built for publication: Formal computations of non deterministic recursive program schemes