nukata / little-schemeView external linksLinks
A meta-circular interpreter of a subset of Scheme
☆16Apr 12, 2020Updated 5 years ago
Alternatives and similar repositories for little-scheme
Users that are interested in little-scheme are comparing it to the libraries listed below
Sorting:
- Alternative implementation of the logical framework Dedukti in Rust☆23Apr 10, 2025Updated 10 months ago
- A mini language for logic programming☆23Jun 5, 2020Updated 5 years ago
- Survey on materials that touch on the history of Lambda Calculus☆12Sep 13, 2020Updated 5 years ago
- Reverse Engineering Environment for Retro-Programming☆11Oct 29, 2025Updated 3 months ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- A revival of the TREE-META compiler-compiler.☆15May 15, 2018Updated 7 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Feb 28, 2019Updated 6 years ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- Another attempt for visualizing proofs☆12Nov 19, 2024Updated last year
- A small example of a source->source pattern matching to decision tree compiler☆14Jul 29, 2020Updated 5 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Sep 29, 2022Updated 3 years ago
- A library for non-deterministically parsing natural language expressions into a structured form.☆18Feb 3, 2023Updated 3 years ago
- Specification of the Cedille Core language☆35Jul 21, 2020Updated 5 years ago
- Metacircular evaluator for a tiny fexpr language☆44Apr 28, 2012Updated 13 years ago
- A browser Pong game, taking advantage of Idris's ability to compile to javascript.☆18Nov 20, 2014Updated 11 years ago
- OCaml library to transform an Llvm control flow graph in an SMT formula.☆13Apr 20, 2018Updated 7 years ago
- A Scheme interpreter with first-class continuations in circa 800 lines of TypeScript code☆13Mar 22, 2022Updated 3 years ago
- A simple BDD library for OCaml☆13May 20, 2025Updated 8 months ago
- haha I'm graduating☆14Jul 22, 2021Updated 4 years ago
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago
- "operating system" based on the calculus of constructions☆18Jun 22, 2022Updated 3 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- miniKanren with a first-order representation of the search space☆17Jul 23, 2024Updated last year
- A Coq plugin that implements exceptions in Coq☆13Jan 7, 2021Updated 5 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated last year
- Library for writing tests for utilities that read text files and produce text output☆23Jun 26, 2020Updated 5 years ago
- Standard library for the Formality language☆18Mar 22, 2020Updated 5 years ago
- Formal Semantics for Why3☆19Sep 28, 2025Updated 4 months ago
- ☆18Aug 20, 2019Updated 6 years ago
- An experimental language with compile time bounds checking☆14Oct 27, 2019Updated 6 years ago
- a minimal implementation of incremental computation in Scheme☆36Apr 30, 2017Updated 8 years ago
- The uncurried minimal functional programming language for CPS transformation☆19Feb 23, 2024Updated last year
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- A functional scripting language.☆17Jan 18, 2025Updated last year
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated 2 weeks ago
- A simple functional programming language.☆22Jun 3, 2021Updated 4 years ago