pigworker / TypesWhoSayNi
being the materials for a paper I have in mind to write about the bidirectional discipline
☆49Updated 7 months ago
Alternatives and similar repositories for TypesWhoSayNi:
Users that are interested in TypesWhoSayNi are comparing it to the libraries listed below
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- NbE course @ Chalmers☆28Updated 5 months ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 2 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated 2 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Where my everyday research happens☆52Updated this week
- Unification and type inference algorithms☆124Updated 10 years ago
- ☆23Updated 8 months ago
- Session Types with Priority in Linear Haskell☆25Updated 8 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- Compiler backend for generating Scheme code☆27Updated last year
- being the materials for Summer 2013's course☆112Updated last year
- A tutorial on how Agda infers things☆41Updated 4 years ago
- GRIN backend for Idris2☆33Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- ICFP tutorial☆39Updated 3 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago