Pages that link to "Item:Q672060"
From MaRDI portal
The following pages link to Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060):
Displaying 9 items.
- A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions (Q1850959) (← links)
- Relative full completeness for bicategorical Cartesian closed structure (Q2200828) (← links)
- (Q4323124) (← links)
- Axiomatic rewriting theory II: the -calculus enjoys finite normalisation cones (Q4500179) (← links)
- (Q4855295) (← links)
- Dynamic game semantics (Q4988428) (← links)
- Coherence for bicategorical cartesian closed structure (Q5068207) (← links)
- An abstract formulation for rewrite systems (Q5096266) (← links)
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search (Q5236550) (← links)