AndrasKovacs / system-f-omegaLinks
System F-omega normalization by hereditary substitution in Agda
☆60Updated 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:
- ☆48Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Where my everyday research happens☆55Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated this week
- Unification and type inference algorithms☆125Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- being a particular fragment of Haskell, extended to a proof system☆34Updated last month
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month
- NbE course @ Chalmers☆28Updated 11 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An experimental Haskell library for programming with effectful runners.☆30Updated 5 years ago