jyp / prettiestLinks
The Prettiest Printer
☆34Updated last year
Alternatives and similar repositories for prettiest
Users that are interested in prettiest are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆26Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- NbE course @ Chalmers☆28Updated 8 months ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- Where my everyday research happens☆53Updated last month
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 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
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- An experimental intermediate language for GHC☆36Updated 7 years ago