bellissimogiorno / nominalLinks
Haskell implementation of nominal datatypes and functions
☆44Updated 5 years ago
Alternatives and similar repositories for nominal
Users that are interested in nominal are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆28Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 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
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆48Updated last week
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Multimode simple type theory as an Agda library.☆23Updated 11 months ago
- Benchmarking tool for compile-time performance of Agda programs☆19Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- Compiler backend for generating Scheme code☆26Updated last year
- Where my everyday research happens☆54Updated 2 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Simplified Observational Type Theory☆84Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago