Metric interpretations of infinite trees and semantics of non deterministic recursive programs
From MaRDI portal
Publication:1136494
DOI10.1016/0304-3975(80)90045-6zbMath0427.68022OpenAlexW2023309117MaRDI QIDQ1136494
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
Related Items (29)
Banach's fixed-point theorem as a base for data-type equations ⋮ Quantitative logics for equivalence of effectful programs ⋮ Infinitary rewriting: closure operators, equivalences and models ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Algebraic solutions to recursion schemes ⋮ Infinitary rewriting: meta-theory and convergence ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ The equational logic of fixed points ⋮ Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes ⋮ Liminf progress measures ⋮ Modal event-clock specifications for timed component-based design ⋮ Recursion-closed algebraic theories ⋮ Unnamed Item ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Recursion over realizability structures ⋮ Algebraic and fixed point equations over inverse limits of algebras ⋮ Generalizing finiteness conditions of labelled transition systems ⋮ Contraction algebras and unification of (infinite) terms ⋮ Fairness, distances and degrees ⋮ Strong fairness and ultra metrics ⋮ CPO semantics of timed interactive actor networks ⋮ Unnamed Item ⋮ Subtyping recursion and parametric polymorphism in kernel Fun ⋮ The alternation hierarchy in fixpoint logic with chop is strict too ⋮ Modularity of Convergence in Infinitary Rewriting ⋮ Differential logical relations, Part I: The simply-typed case ⋮ On infinite computations in denotational semantics ⋮ Fundamental properties of infinite trees ⋮ Bisimulation indexes and their applications
Cites Work
This page was built for publication: Metric interpretations of infinite trees and semantics of non deterministic recursive programs
