granstrom / intuitionistic
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.☆40Updated 7 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- a self-hosting lambda calculus compiler☆35Updated last month
- Miller/pattern unification in Agda☆65Updated 11 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- Logic for story telling!☆34Updated 7 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆27Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A programming language with infinite arrays☆31Updated 5 years ago
- ReasonML code to construct an NFA from a regular expression☆24Updated 6 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A verified compiler for a lazy functional language☆35Updated this week
- ☆36Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆48Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- ☆22Updated 8 years ago
- Brainfuck formalized in Coq☆26Updated 3 years ago