jyp / prettiestLinks
The Prettiest Printer
☆35Updated last year
Alternatives and similar repositories for prettiest
Users that are interested in prettiest are comparing it to the libraries listed below
Sorting:
- ☆26Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- NbE course @ Chalmers☆28Updated 9 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆52Updated last week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- ☆27Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Where my everyday research happens☆53Updated last month
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 2 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago