scientific article
From MaRDI portal
Publication:3900995
zbMath0453.68021MaRDI QIDQ3900995
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algebraic semanticsinfinite treesultrametric spacesnondeterministic programsF-algebrascomplete metric F-magmascomplete partially ordered F-magmascomputation domaininfinite computation sequence
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Connections of general topology with other structures, applications (54H99) Theory of computing (68Q99)
Related Items
The greatest fixed-points and rational omega-tree languages, De Bakker-Zucker processes revisited, Recursively defined metric spaces without contraction, Model Checking Real-Time Systems, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, Algebraic solutions to recursion schemes, The category-theoretic solution of recursive program schemes, Algèbres effectives dans la programmation logique avec contraintes, Convergence in infinitary term graph rewriting systems is simple, The equational logic of fixed points, Unnamed Item, On final coalgebras of continuous functors, Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes, Combining data type and recursive process specifications using projection algebras, On Normalisation of Infinitary Combinatory Reduction Systems, Unnamed Item, A first order logic for partial functions, Algebraic and fixed point equations over inverse limits of algebras, Generalized automata on infinite trees and Muller-McNaughton's theorem, Unnamed Item, On the greatest fixed point of a set functor, Unnamed Item, Fixing Zeno gaps, Infinitary combinatory reduction systems, An introduction to metric semantics: Operational and denotational models for programming and specification languages, Theμ-calculus alternation-depth hierarchy is strict on binary trees, Fixed point equations with parameters in the projective model, Automata on infinite objects and their applications to logic and programming, Whither semantics?, Transfinite reductions in orthogonal term rewriting systems, The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity), Fundamental properties of infinite trees, Context-sensitive rewriting strategies, Infinitary affine proofs, The infinitary lambda calculus of the infinite eta Böhm trees
