bellissimogiorno / nominal
Haskell implementation of nominal datatypes and functions
☆39Updated 4 years ago
Related projects: ⓘ
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆68Updated 2 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- The Evolution of a Typechecker☆51Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Mtac in Agda☆28Updated 3 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆28Updated last year
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- ☆46Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆44Updated this week
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- ☆21Updated 2 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆55Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Where my everyday research happens☆53Updated 3 weeks ago
- NbE course @ Chalmers☆28Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆45Updated last month
- Deciding Presburger arithmetic in agda☆31Updated last year
- ☆35Updated 2 years ago