Alternatives and similar repositories for intuitionistic

Users that are interested in intuitionistic are comparing it to the libraries listed below

• siraben / r5rs-denot
  A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.
  ☆21Updated 5 months ago
• SMLFamily / SMLFamily.github.io
  Web site for standardml.org.
  ☆36Updated 2 years ago
• logic-tools / sml-handbook
  SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
  ☆36Updated 8 years ago
• ghosthamlet / ann.apl
  Simple Neural Network Examples in 8 lines APL
  ☆32Updated 2 years ago
• orchid-hybrid / minimips
  minikanren mips assembler/disassembler
  ☆33Updated 10 years ago
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 6 years ago
• gregr / icfp2017-artifact-auas7pp
  ICFP 2017 Artifact for Functional Pearl: A Unified Approach to Solving Seven Programming Problems
  ☆29Updated 7 years ago
• namin / lms-black
  purple: compiling a reflective language
  ☆33Updated last year
• fare / moll
  My Own Linear Lisp
  ☆42Updated 7 years ago
• SMLFamily / The-Definition-of-Standard-ML-Revised
  The Definition of Standard ML, Revised (1997)
  ☆116Updated 8 years ago
• hellerve-pl-experiments / microml
  A minimal ML, type-inferred, compiled, and/or interpreted in less than 750 lines
  ☆36Updated 5 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 11 years ago
• rusini / manool
  Fairly readable homoiconic language with primarily value (non-referential) semantics that balances the programmer's productivity with sca…
  ☆63Updated last year
• stokito / fortress-lang
  ☆57Updated 8 years ago
• techcentaur / Krivine-Machine
  Abstract krivine machine implementing call-by-name semantics. In OCaml.
  ☆45Updated 7 years ago
• mit-plv / timl
  TiML: A Functional Programming Language with Time Complexity
  ☆80Updated 8 years ago
• ptarau / TypesAndProofs
  Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
  ☆33Updated 3 weeks ago
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆75Updated 3 years ago
• prg-titech / baccaml
  Experimental implementation of a meta-hybrid JIT compiler mixing trace- and method-based compilation strategies.
  ☆32Updated 5 months ago
• bsaleil / lc
  JIT compiler for Scheme targeting x86-64 platforms
  ☆31Updated 6 years ago
• dhess / rabbit-scheme
  Guy Steele's RABBIT Scheme compiler
  ☆61Updated 16 years ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 13 years ago
• herrmanntom / setlX
  setlX is an interpreter for the high level programming-language SetlX (set language extended).
  ☆28Updated 4 years ago
• raphlinus / ghilbert
  Automatically exported from code.google.com/p/ghilbert
  ☆47Updated 8 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆54Updated 5 years ago
• hanshuebner / secd
  SECD microprocessor reimplementation in VHDL
  ☆35Updated 5 years ago
• mb64 / sel
  Sed Lisp -- a lisp interpreter in GNU sed
  ☆55Updated 4 years ago
• bldl / magnolisp
  Magnolisp, a toy programming language
  ☆17Updated last year
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆38Updated 3 years ago