AndrasKovacs / system-f-omegaLinks
System F-omega normalization by hereditary substitution in Agda
☆59Updated 5 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 2 months ago
- 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 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Where my everyday research happens☆54Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- A TACtic library for Agda☆49Updated 10 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆33Updated 5 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Mtac in Agda☆28Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago