scientific article; zbMATH DE number 3597848

Cited in

(31)

Fundamental properties of infinite trees
Order completion monads
Axiomatisation des tests
An algebraic semantics approach to the effective resolution of type equations
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Metric interpretations of infinite trees and semantics of non deterministic recursive programs
On the algebra of order
Varieties of chain-complete algebras
An algebraic definition for control structures
Adherences of languages
The IO- and OI-hierarchies
Partial abstract types
On rational definitions in complete algebras without rank
Conditional rewriting logic as a unified model of concurrency
Least fixed points revisited
On some classes of interpretations
Testing equivalences for processes
The evaluation of first-order substitution is monadic second-order compatible
A short scientific biography of Maurice Nivat
Recursion induction principle revisited
Confluent complement: an algorithm for the intersection of face ideals
Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
scientific article; zbMATH DE number 3814949 (Why is no real title available?)
scientific article; zbMATH DE number 3896271 (Why is no real title available?)
Infinite trees in normal form and recursive equations having a unique solution
A class of functions synthesized from a finite number of examples and a lisp program scheme
scientific article; zbMATH DE number 3688675 (Why is no real title available?)
scientific article; zbMATH DE number 3631912 (Why is no real title available?)
Conditional rewriting logic: Deduction, models and concurrency
All solutions of a system of recursion equations in infinite trees and other contraction theories
Implementation of data types by algebraic methods

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 Q4164787)