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:
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- miniKanren for search, SMT for solving☆13Updated 6 years ago
- A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.☆21Updated 6 months ago
- Web site for standardml.org.☆36Updated 2 years ago
- My Own Linear Lisp☆42Updated 7 years ago
- Fairly readable homoiconic language with primarily value (non-referential) semantics that balances the programmer's productivity with sca…☆64Updated last week
- ICFP 2017 Artifact for Functional Pearl: A Unified Approach to Solving Seven Programming Problems☆29Updated 7 years ago
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆45Updated 7 years ago
- SKI combinators☆55Updated 8 years ago
- Experimental implementation of a meta-hybrid JIT compiler mixing trace- and method-based compilation strategies.☆32Updated 7 months ago
- Standard ML compiler based on typed intermediate languages.☆50Updated 11 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆34Updated last month
- SPSC: A Small Positive Supercompiler☆38Updated last year
- purple: compiling a reflective language☆33Updated last year
- minikanren mips assembler/disassembler☆33Updated 10 years ago
- The Definition of Standard ML, Revised (1997)☆117Updated 8 years ago
- SML, The Living Language (aka, Successor ML)☆72Updated 9 years ago
- The Definition of Standard ML (1990)☆124Updated 11 years ago
- An ergonomic, mobile-first, Prolog playground!☆31Updated 3 years ago
- Editor for language composition☆58Updated 2 years ago
- Simple Neural Network Examples in 8 lines APL☆32Updated 2 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- ☆31Updated 2 years ago
- Datalog implemented in minikanren☆24Updated 8 years ago
- ☆49Updated 2 weeks ago
- Reason about Term Rewriting Systems☆18Updated 3 years ago
- CLP(SMT) on top of miniKanren☆38Updated 3 years ago
- JIT compiler for Scheme targeting x86-64 platforms☆31Updated 6 years ago
- Guy Steele's RABBIT Scheme compiler☆62Updated 16 years ago