The following pages link to (Q4772711):
Displayed 17 items.
- Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- The insensitivity theorem for nonreducing reflexive types (Q792755) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- On schematological equivalence of partially interpreted dataflow networks (Q1373139) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- On the logic of unification (Q1823935) (← links)
- Initial Algebra Semantics for Cyclic Sharing Structures (Q3637190) (← links)
- (Q4192947) (← links)
- (Q4558787) (← links)
- Term graph rewriting (Q4645801) (← links)
- Rational rewriting (Q5096902) (← links)