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 3 months ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆26Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated last week
- Where my everyday research happens☆55Updated this week
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- System F in coq.☆19Updated 11 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated 2 years ago
- NbE course @ Chalmers☆28Updated last year
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 9 months ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago