uwplse / magicLinks
Demystifying the magic of supertactics
☆13Updated 3 years ago
Alternatives and similar repositories for magic
Users that are interested in magic are comparing it to the libraries listed below
Sorting:
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- secret project☆17Updated 7 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- 🌳 Generate a fresh bonsai in your terminal☆27Updated 3 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 9 months ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- An infinity-categorical coherence typechecker☆17Updated 8 months ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- ☆17Updated 6 years ago
- Experimental functional language☆17Updated 3 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 8 months ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- ☆22Updated 9 years ago
- Type systems written in 1ML☆9Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 months ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- OCaml back end for Idris☆22Updated 7 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago