Metric interpretations of infinite trees and semantics of non deterministic recursive programs

DOI10.1016/0304-3975(80)90045-6MaRDI QIDQ1136494zbMATH OpenOpenAlexFDO

Authors André Arnold, M. Nivat

Publication date 1980

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(80)90045-6

zbMATH Keywords

semantics of non deterministic recursive programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• A Powerdomain Construction
• scientific article; zbMATH DE number 3748943 (Why is no real title available?)
• scientific article; zbMATH DE number 3540387 (Why is no real title available?)
• scientific article; zbMATH DE number 3562469 (Why is no real title available?)
• scientific article; zbMATH DE number 3597848 (Why is no real title available?)
• scientific article; zbMATH DE number 3232606 (Why is no real title available?)
• scientific article; zbMATH DE number 3255438 (Why is no real title available?)
• scientific article; zbMATH DE number 3349291 (Why is no real title available?)
• scientific article; zbMATH DE number 3362972 (Why is no real title available?)
• Initial Algebra Semantics and Continuous Algebras
• Power domains

Cited in

(31)

• On infinite computations in denotational semantics
• Fundamental properties of infinite trees
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Algebraic solutions to recursion schemes
• Recursion-closed algebraic theories
• Recursion over realizability structures
• Algebraic and fixed point equations over inverse limits of algebras
• Contraction algebras and unification of (infinite) terms
• Fairness, distances and degrees
• Strong fairness and ultra metrics
• Banach's fixed-point theorem as a base for data-type equations
• The equational logic of fixed points
• Bisimulation indexes and their applications
• Subtyping recursion and parametric polymorphism in kernel Fun
• Modal event-clock specifications for timed component-based design
• Quantitative logics for equivalence of effectful programs
• Infinitary rewriting: closure operators, equivalences and models
• The alternation hierarchy in fixpoint logic with chop is strict too
• Equational properties of fixed point operations in Cartesian categories: an overview
• Modularity of Convergence in Infinitary Rewriting
• scientific article; zbMATH DE number 3932271 (Why is no real title available?)
• Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
• Generalizing finiteness conditions of labelled transition systems
• scientific article; zbMATH DE number 7453165 (Why is no real title available?)
• Differential logical relations. I: The simply-typed case
• Equational properties of fixed-point operations in Cartesian categories: an overview
• Liminf progress measures
• A partial metric semantics of higher-order types and approximate program transformations
• Towards univalent reference types: the impact of univalence on denotational semantics
• Infinitary rewriting: meta-theory and convergence
• CPO semantics of timed interactive actor networks

This page was built for publication: Metric interpretations of infinite trees and semantics of non deterministic recursive programs

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