langston-barrett / write-yourself-a-scheme-in-agdaView external linksLinks
Like "Write Yourself a Scheme in 48 Hours", but in Agda
☆51Apr 18, 2018Updated 7 years ago
Alternatives and similar repositories for write-yourself-a-scheme-in-agda
Users that are interested in write-yourself-a-scheme-in-agda are comparing it to the libraries listed below
Sorting:
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Design, play with, and analyze sequent calculus proof systems.☆14Sep 5, 2024Updated last year
- Learn the Agda basics in three 2-hour sessions.☆60Sep 26, 2025Updated 4 months ago
- A lambda calculus to explore type-directed program synthesis.☆85Jan 20, 2020Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- Lambda Calculus with quote and unquote☆19Jun 29, 2020Updated 5 years ago
- Collaborative work on reversible computing☆25Oct 30, 2021Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Feb 23, 2018Updated 7 years ago
- Existential type.☆37Updated this week
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- My final year project at the University of Strathclyde☆13Jan 26, 2023Updated 3 years ago
- A simple GUI for Agda☆31Dec 13, 2015Updated 10 years ago
- Web based opetopic editor☆36Oct 21, 2024Updated last year
- Yet another concurrent playground☆33Nov 18, 2015Updated 10 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- theseus, functional programming language with fully reversible computation☆126Jun 3, 2019Updated 6 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆21Aug 24, 2025Updated 5 months ago
- Linear Logic for Constructive Mathematics, in Agda☆18Jul 7, 2019Updated 6 years ago
- The compiler for N⋆, a statically typed assembly language used as a compiler backend for Zilch☆31May 27, 2023Updated 2 years ago
- Proof automation – for Agda, in Agda.☆45Sep 7, 2020Updated 5 years ago
- Sometimes when I feel sad I implement a dependently typed lambda calculus.☆15Mar 26, 2020Updated 5 years ago