bellissimogiorno / nominalLinks
Haskell implementation of nominal datatypes and functions
☆43Updated 4 years ago
Alternatives and similar repositories for nominal
Users that are interested in nominal are comparing it to the libraries listed below
Sorting:
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- ☆47Updated 3 weeks ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆36Updated 3 years ago
- Multimode simple type theory as an Agda library.☆23Updated 9 months ago
- Mtac in Agda☆28Updated 4 years ago
- Benchmarking tool for compile-time performance of Agda programs☆19Updated 3 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- ☆30Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated 3 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year