scientific article; zbMATH DE number 3709584

MaRDI QIDQ3900995zbMATH OpenFDO

Authors M. Nivat, André Arnold

Publication date 1980

zbMATH Keywords

algebraic semanticscomplete metric F-magmascomplete partially ordered F-magmascomputation domainF-algebrasinfinite computation sequenceinfinite treesnondeterministic programsultrametric spaces

Mathematics Subject Classification ID

Connections of general topology with other structures, applications (54H99) General topics in the theory of software (68N01) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of computing (68Q99)

Cited in

(36)

• Fundamental properties of infinite trees
• The greatest fixed-points and rational omega-tree languages
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Algebraic solutions to recursion schemes
• Algebraic and fixed point equations over inverse limits of algebras
• Generalized automata on infinite trees and Muller-McNaughton's theorem
• The equational logic of fixed points
• On final coalgebras of continuous functors
• Context-sensitive rewriting strategies
• De Bakker-Zucker processes revisited
• Whither semantics?
• Recursively defined metric spaces without contraction
• scientific article; zbMATH DE number 7037626 (Why is no real title available?)
• Model Checking Real-Time Systems
• On Normalisation of Infinitary Combinatory Reduction Systems
• The \Pi^0_2 -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
• scientific article; zbMATH DE number 3818648 (Why is no real title available?)
• Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
• Algèbres effectives dans la programmation logique avec contraintes
• Convergence in infinitary term graph rewriting systems is simple
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• Strict ideal completions of the lambda calculus
• Alternation is strict for higher-order modal fixpoint logic
• Transfinite reductions in orthogonal term rewriting systems
• Infinitary affine proofs
• The infinitary lambda calculus of the infinite eta Böhm trees
• Fixing Zeno gaps
• Infinitary combinatory reduction systems
• Fixed point equations with parameters in the projective model
• Automata on infinite objects and their applications to logic and programming
• An introduction to metric semantics: Operational and denotational models for programming and specification languages
• On the greatest fixed point of a set functor
• Combining fixpoint and differentiation theory
• The category-theoretic solution of recursive program schemes
• Combining data type and recursive process specifications using projection algebras
• A first order logic for partial functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3900995)