Pages that link to "Item:Q3851585"
From MaRDI portal
The following pages link to Infinite trees in normal form and recursive equations having a unique solution (Q3851585):
Displayed 22 items.
- Proving the correctness of recursion-based automatic program transformations (Q671683) (← links)
- Interpretations of recursively defined types (Q685350) (← links)
- Deterministic and nondeterministic flowchart interpretations (Q796975) (← links)
- An extension to trees of the Sardinas and Patterson algorithm (Q1050318) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Axiomatisation des tests (Q1062748) (← links)
- Fully abstract submodels of typed lambda calculi (Q1095880) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- Graph grammars and operational semantics (Q1165029) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- Algebraic and fixed point equations over inverse limits of algebras (Q1177146) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Static correctness of hierarchical procedures (Q1351792) (← links)
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
- Recursion induction principle revisited (Q1838286) (← links)
- (Q3675498) (← links)
- An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289) (← links)
- Continuous monoids and yields of infinite trees (Q3743357) (← links)
- Algebraic semantics and complexity of term rewriting systems (Q5055729) (← links)
- Proving the correctness of recursion-based automatic program transformations (Q5096758) (← links)
- Computing in unpredictable environments: Semantics, reduction strategies, and program transformations (Q5878908) (← links)