The following pages link to Tridirectional typechecking (Q3452267):
Displaying 10 items.
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage (Q930871) (← links)
- Graded modal dependent type theory (Q2233475) (← links)
- On the unity of duality (Q2482843) (← links)
- Preemptive Type Checking in Dynamically Typed Languages (Q2851907) (← links)
- Extensible Datasort Refinements (Q2988653) (← links)
- Refinement Types as Proof Irrelevance (Q3637193) (← links)
- On the Values of Reducibility Candidates (Q3637200) (← links)
- Termination checking with types (Q4659886) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- Set Constraints, Pattern Match Analysis, and SMT (Q5098738) (← links)