Pages that link to "Item:Q1121676"
From MaRDI portal
The following pages link to Full abstraction and limiting completeness in equational languages (Q1121676):
Displaying 8 items.
- Normalization, approximation, and semantics for combinator systems (Q1853619) (← links)
- Full abstraction and expressive completeness for FP (Q1892888) (← links)
- Full abstraction, totality and PCF (Q4237906) (← links)
- Approximation and normalization results for typeable term rewriting systems (Q4645802) (← links)
- Full Abstraction and the Context Lemma (Q4887022) (← links)
- Full abstraction and the Context Lemma (preliminary report) (Q5096215) (← links)
- An universal termination condition for solving goals in equational languages (Q5881302) (← links)
- Generalization of final algebra semantics by relativization (Q5887520) (← links)