The following pages link to Type checking with universes (Q1177937):
Displaying 10 items.
- Categorical abstract machines for higher-order typed \(\lambda\)-calculi (Q1349667) (← links)
- Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism (Q2123048) (← links)
- Reduction and Conversion Strategies for the Calculus of (co)Inductive Constructions: Part I (Q2866803) (← links)
- Formal polytypic programs and proofs (Q3070767) (← links)
- Algebra of programming in Agda: Dependent types for relational program derivation (Q3644935) (← links)
- Program specification and data refinement in type theory (Q4282807) (← links)
- A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading (Q5372007) (← links)
- (Q5472887) (← links)
- Finitary type theories with and without contexts (Q6053849) (← links)
- Sharing proofs with predicative theories through universe-polymorphic elaboration (Q6635505) (← links)
