scott-fleischman / agda-from-nothing-2017Links
Agda from Nothing: Order in the Types
☆13Updated 8 years ago
Alternatives and similar repositories for agda-from-nothing-2017
Users that are interested in agda-from-nothing-2017 are comparing it to the libraries listed below
Sorting:
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Pure Type Systems for Functional Programming☆31Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- A tutorial on writing a concurrency testing tool in Haskell☆12Updated 8 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- Work in progress☆39Updated 7 months ago
- The Alms Programming Language☆44Updated 7 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 5 years ago
- ☆21Updated 8 years ago
- ICFP Bingo 2017 (Idris edition)☆30Updated 6 years ago
- Examples from Introduction to Programming in ATS☆26Updated 11 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Summer school on programming in Agda☆68Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Build tool for ATS.☆42Updated 3 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Type theory + whales and syntax☆11Updated 6 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Invertible parsing for S-expressions☆34Updated 9 months ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago