Pages that link to "Item:Q1891251"
From MaRDI portal
The following pages link to Strong normalization in type systems: A model theoretical approach (Q1891251):
Displaying 13 items.
- A domain model characterising strong normalisation (Q958484) (← links)
- Strong normalization for typed terms with surjective pairing (Q1092042) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Strong normalization for non-structural subtyping via saturated sets (Q1351999) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Strong normalization for the simply-typed lambda calculus in constructive type theory using Agda (Q2229159) (← links)
- Intuitionistic model constructions and normalization proofs (Q2785696) (← links)
- (Q4457448) (← links)
- (Head-)normalization of typeable rewrite systems (Q5055837) (← links)
- Normalization by Evaluation for Martin-Löf Type Theory with One Universe (Q5262927) (← links)
- New Computational Paradigms (Q5717056) (← links)
- Strong normalizability of the non-deterministic catch/throw calculi (Q5958297) (← links)
- An induction principle for pure type systems (Q5958776) (← links)