Tipoca / intuitionisticLinks
Intuitionistic Programming Language
☆12Updated 11 years ago
Alternatives and similar repositories for intuitionistic
Users that are interested in intuitionistic are comparing it to the libraries listed below
Sorting:
- Experimental implementation of a meta-hybrid JIT compiler mixing trace- and method-based compilation strategies.☆32Updated 6 months ago
- A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.☆21Updated 6 months ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Fairly readable homoiconic language with primarily value (non-referential) semantics that balances the programmer's productivity with sca…☆63Updated last year
- Common lisp implementation of Val Schorr's Meta-II language☆17Updated 8 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆34Updated 2 weeks ago
- High-end Cryptographic Library☆44Updated 5 years ago
- purple: compiling a reflective language☆33Updated last year
- Charity Programming Language☆41Updated 10 years ago
- SKI combinators☆55Updated 8 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago
- SPSC: A Small Positive Supercompiler☆38Updated last year
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆45Updated 7 years ago
- Simple Neural Network Examples in 8 lines APL☆32Updated 2 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆31Updated 8 years ago
- Automatically exported from code.google.com/p/ghilbert☆47Updated 8 years ago
- My Own Linear Lisp☆42Updated 7 years ago
- Nominal logic programming extensions to miniKanren, based on alphaProlog.☆25Updated 11 years ago
- Accompanying materials for "A Core Calculus for Documents"☆35Updated 2 years ago
- miniKanren for search, SMT for solving☆13Updated 6 years ago
- ☆31Updated 2 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- The Definition of Standard ML, Revised (1997)☆117Updated 8 years ago
- ICFP 2017 Artifact for Functional Pearl: A Unified Approach to Solving Seven Programming Problems☆29Updated 7 years ago
- source code for the bondi programming language☆42Updated 6 years ago
- ☆37Updated last year
- Orc programming language implementation☆45Updated 3 years ago
- A minimal ML, type-inferred, compiled, and/or interpreted in less than 750 lines☆38Updated 5 years ago
- a self-hosting lambda calculus compiler☆37Updated 7 months ago
- An ergonomic, mobile-first, Prolog playground!☆31Updated 3 years ago