The following pages link to LEGO (Q21664):
Displaying 50 items.
- (Q3024849) (← links)
- Faking it Simulating dependent types in Haskell (Q3149006) (← links)
- Structural subtyping for inductive types with functorial equality rules (Q3535679) (← links)
- Unifying Sets and Programs via Dependent Types (Q3605541) (← links)
- Ivor, a Proof Engine (Q3612951) (← links)
- A Dependently Typed Framework for Static Analysis of Program Execution Costs (Q3623950) (← links)
- Manifest Fields and Module Mechanisms in Intensional Type Theory (Q3638256) (← links)
- (Q4222932) (← links)
- (Q4223031) (← links)
- (Q4246944) (← links)
- (Q4246948) (← links)
- (Q4281462) (← links)
- (Q4281483) (← links)
- Program specification and data refinement in type theory (Q4282807) (← links)
- (Q4296744) (← links)
- (Q4335371) (← links)
- (Q4473723) (← links)
- (Q4484330) (← links)
- (Q4508290) (← links)
- (Q4539624) (← links)
- Type theoretic semantics for SemNet (Q4632324) (← links)
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits (Q4645242) (← links)
- More Church-Rosser proofs (in Isabelle/HOL) (Q4647561) (← links)
- A two-level approach towards lean proof-checking (Q4647567) (← links)
- Internal type theory (Q4647575) (← links)
- A natural deduction approach to dynamic logic (Q4647578) (← links)
- Termination checking with types (Q4659886) (← links)
- (Q4736399) (← links)
- (Q4790657) (← links)
- (Q4790671) (← links)
- (Q4809074) (← links)
- (Q4880706) (← links)
- (Q4944846) (← links)
- (Q4944855) (← links)
- (Q4944858) (← links)
- (Q4945244) (← links)
- Martin Hofmann’s contributions to type theory: Groupoids and univalence (Q5084306) (← links)
- A Partial Type Checking Algorithm for Type:Type (Q5166618) (← links)
- Ynot (Q5178765) (← links)
- Exploring abstract algebra in constructive type theory (Q5210799) (← links)
- Machine Translation and Type Theory (Q5253933) (← links)
- Functional and Logic Programming (Q5308009) (← links)
- Mathematical Knowledge Management (Q5313058) (← links)
- Advanced Functional Programming (Q5394302) (← links)
- A Normalizing Intuitionistic Set Theory with Inaccessible Sets (Q5426072) (← links)
- Artificial Intelligence and Symbolic Computation (Q5464706) (← links)
- Theorem Proving in Higher Order Logics (Q5477646) (← links)
- Types for Proofs and Programs (Q5712325) (← links)
- (Q5714446) (← links)
- Equations: A Dependent Pattern-Matching Compiler (Q5747666) (← links)
