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:
- being bits and pieces I'm inclined to leave lying around☆56Updated 2 weeks ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 6 years ago
- ☆26Updated 9 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated last month
- NbE course @ Chalmers☆28Updated last year
- Where my everyday research happens☆56Updated this week
- Miller/pattern unification in Agda☆68Updated 3 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 9 months ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 10 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 6 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago