Scheme libraries written or packaged for R7RS implementations
☆13Apr 7, 2018Updated 7 years ago
Alternatives and similar repositories for r7rs-libs
Users that are interested in r7rs-libs are comparing it to the libraries listed below
Sorting:
- Import SRFI metadata into the Scheme API☆11Jan 19, 2026Updated last month
- Survey on materials that touch on the history of Lambda Calculus☆12Sep 13, 2020Updated 5 years ago
- Collection of generative art made by me.☆10Jul 8, 2018Updated 7 years ago
- Arete is an experimental programming language.☆12Oct 6, 2023Updated 2 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 2 years ago
- Scheme library collection with yearly stable releases☆17Jun 5, 2022Updated 3 years ago
- SWORD: A Whole Program Race Detector for Java☆13Jan 30, 2021Updated 5 years ago
- Python implementation of sinewave speech, as a command-line tool☆14May 30, 2020Updated 5 years ago
- First-order temporal logic programming with microKanren☆19Nov 3, 2017Updated 8 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- Notes on Common Lisp Libraries☆17Oct 16, 2024Updated last year
- An embedding of ZFC into Agda☆13Dec 10, 2021Updated 4 years ago
- Talking about classical logic and abstract algebra in Haskell☆16Feb 12, 2021Updated 5 years ago
- Yoneda lemma in every known language☆17Mar 10, 2023Updated 2 years ago
- A simple compiler from the lambda calculus to MIPS assembly☆20May 19, 2017Updated 8 years ago
- Erlang BEAM emulator in Haskell☆48Jun 14, 2014Updated 11 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Aug 11, 2025Updated 6 months ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆24May 1, 2016Updated 9 years ago
- Experiments with higher-order abstract syntax in Agda☆22Jul 14, 2022Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Feb 21, 2016Updated 10 years ago
- A compilation-friendly fexpr language. (Proof of concept.)☆24Sep 2, 2025Updated 6 months ago
- A formally verified compiler for a simple language with numbers and sums☆28Nov 29, 2020Updated 5 years ago
- A Redex Model of Rust, or more specifically an encoding of Patina, the formal model for rust's type safety☆24Sep 22, 2014Updated 11 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Aug 1, 2014Updated 11 years ago
- A simple scheme interpreter in Python☆26Feb 2, 2014Updated 12 years ago
- An implementation of Scheme R7RS-small in 48 working hours.☆19Mar 13, 2020Updated 5 years ago
- Searchable index of Scheme Lisp libraries☆22Feb 14, 2026Updated 2 weeks ago
- Portable Foreign Function Interface (FFI) for R6RS☆51Oct 25, 2025Updated 4 months ago
- Formalisation of a capability machine and principles for reasoning about security properties☆26Jul 4, 2025Updated 8 months ago
- A mini language for logic programming☆23Jun 5, 2020Updated 5 years ago
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Sep 21, 2022Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Apr 7, 2025Updated 10 months ago