AndrasKovacs / system-f-omegaLinks
System F-omega normalization by hereditary substitution in Agda
☆62Updated 6 years ago
Alternatives and similar repositories for system-f-omega
Users that are interested in system-f-omega are comparing it to the libraries listed below
Sorting:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- Where my everyday research happens☆55Updated this week
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- ☆51Updated 5 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A TACtic library for Agda☆50Updated last year
- A prototypical dependently typed languages with sized types and variances☆115Updated this week
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 5 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Eventually a practical 2-level TT-based compiler☆29Updated this week
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated last month
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago