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:
- Miller/pattern unification in Agda☆68Updated 11 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Where my everyday research happens☆55Updated 2 weeks ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- NbE course @ Chalmers☆28Updated last year
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- ☆26Updated 8 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆37Updated 12 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Work in progress☆38Updated 4 months ago