The following pages link to Types for Proofs and Programs (Q5712305):
Displaying 5 items.
- A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. (Q1401936) (← links)
- Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications (Q2683029) (← links)
- (Q2778886) (← links)
- Axiomatic rewriting theory II: the -calculus enjoys finite normalisation cones (Q4500179) (← links)
- (Q5195246) (← links)