Pages that link to "Item:Q5277716"
From MaRDI portal
The following pages link to On equivalence and canonical forms in the LF type theory (Q5277716):
Displaying 19 items.
- Automated techniques for provably safe mobile code. (Q1853627) (← links)
- \texttt{slepice}: towards a verified implementation of type theory in type theory (Q2119108) (← links)
- Hybridizing a logical framework (Q2867954) (← links)
- Normalization for the simply-typed lambda-calculus in Twelf (Q2871835) (← links)
- A logical framework with explicit conversions (Q2871837) (← links)
- Redundancy elimination for LF (Q2871840) (← links)
- A bidirectional refinement type system for LF (Q2871879) (← links)
- Structural recursion with locally scoped names (Q3016213) (← links)
- Polarised subtyping for sized types (Q3535676) (← links)
- Parametricity, type equality, and higher-order polymorphism (Q3564921) (← links)
- Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis (Q4559809) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- Mechanizing proofs with logical relations – Kripke-style (Q4691187) (← links)
- (Q5094128) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301) (← links)
- Mechanizing metatheory in a logical framework (Q5308093) (← links)
- Normalization by evaluation for modal dependent type theory (Q6065506) (← links)
- (Q6079236) (← links)