Pages that link to "Item:Q1822494"
From MaRDI portal
The following pages link to Proof of termination of the rewriting system SUBSET on CCL (Q1822494):
Displaying 17 items.
- Termination by completion (Q757069) (← links)
- Alpha conversion, conditions on variables and categorical logic (Q913792) (← links)
- Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL (Q918956) (← links)
- Church-Rosser theorem for a rewriting system on categorical combinators (Q1119562) (← links)
- Categorical abstract machines for higher-order typed \(\lambda\)-calculi (Q1349667) (← links)
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions (Q1575247) (← links)
- (Q3201049) (← links)
- Maximal Termination (Q3522012) (← links)
- (Q4222997) (← links)
- A categorical understanding of environment machines (Q4763978) (← links)
- Explicit Substitutions à la de Bruijn (Q4924548) (← links)
- Explicit substitutions (Q4939690) (← links)
- Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract) (Q5055860) (← links)
- Strong normalization of substitutions (Q5096832) (← links)
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301) (← links)
- On Termination of Binary CLP Programs (Q5458805) (← links)
- Termination of term rewriting by interpretation (Q5881183) (← links)