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 last week
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- ☆51Updated 4 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A prototypical dependently typed languages with sized types and variances☆113Updated 5 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A TACtic library for Agda☆50Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆53Updated 5 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago