granstrom / intuitionisticLinks
Automatically exported from code.google.com/p/intuitionistic
☆31Updated 10 years ago
Alternatives and similar repositories for intuitionistic
Users that are interested in intuitionistic are comparing it to the libraries listed below
Sorting:
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated 2 years ago
- Specification of the Cedille Core language☆35Updated 5 years ago
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- a self-hosting lambda calculus compiler☆37Updated 10 months ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 10 months ago
- Logic for story telling!☆36Updated 7 years ago
- αProlog☆18Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- A simple λProlog interpreter☆20Updated 4 years ago
- The Caml Light implementation of the Caml language☆68Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Brainfuck formalized in Coq☆31Updated 3 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- 🌳 Generate a fresh bonsai in your terminal☆30Updated 4 years ago
- A pure type system implemented in OCaml☆78Updated 5 years ago
- A programming language with infinite arrays☆31Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A Pretty Printer, based on Philip Wadler's "A prettier printer". But heavily modified to be efficient in a strict language.☆19Updated 4 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆33Updated 7 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆45Updated 6 years 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
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- Like the Programming Languages Zoo but with esoteric languages.☆25Updated 5 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆91Updated 7 years ago