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:
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Mtac in Agda☆28Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- ☆50Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- NbE course @ Chalmers☆28Updated last year
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Where my everyday research happens☆55Updated 3 weeks ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Benchmarking tool for compile-time performance of Agda programs☆19Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year