The following pages link to (Q4164787):
Displayed 31 items.
- All solutions of a system of recursion equations in infinite trees and other contraction theories (Q791310) (← links)
- Implementation of data types by algebraic methods (Q792753) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Order completion monads (Q1055871) (← links)
- Axiomatisation des tests (Q1062748) (← links)
- An algebraic semantics approach to the effective resolution of type equations (Q1093359) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Metric interpretations of infinite trees and semantics of non deterministic recursive programs (Q1136494) (← links)
- On the algebra of order (Q1143782) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- An algebraic definition for control structures (Q1151016) (← links)
- Adherences of languages (Q1157971) (← links)
- The IO- and OI-hierarchies (Q1161273) (← links)
- Partial abstract types (Q1169290) (← links)
- On rational definitions in complete algebras without rank (Q1171374) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Least fixed points revisited (Q1234588) (← links)
- On some classes of interpretations (Q1251892) (← links)
- Testing equivalences for processes (Q1348526) (← links)
- The evaluation of first-order substitution is monadic second-order compatible (Q1603690) (← links)
- A short scientific biography of Maurice Nivat (Q1605477) (← links)
- Recursion induction principle revisited (Q1838286) (← links)
- Confluent complement: an algorithm for the intersection of face ideals (Q2135553) (← links)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040) (← links)
- (Q3662598) (← links)
- (Q3675498) (← links)
- Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
- A class of functions synthesized from a finite number of examples and a lisp program scheme (Q3863043) (← links)
- (Q3883458) (← links)
- (Q4192947) (← links)
- Conditional rewriting logic: Deduction, models and concurrency (Q5881267) (← links)