sergei-romanenko / agda-simple-scpView external linksLinks
A simple supercompiler formally verified in Agda
☆34Mar 17, 2017Updated 8 years ago
Alternatives and similar repositories for agda-simple-scp
Users that are interested in agda-simple-scp are comparing it to the libraries listed below
Sorting:
- A well typed by construction kernel language for bidirectional programming☆14Jan 2, 2025Updated last year
- A library for doing generic programming in Agda☆36Jan 27, 2021Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Coherence typechecker for infinity categories☆20Dec 29, 2025Updated last month
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- The Cambridge Haskell Supercompiler: an extension of "Supercompilation by Evaluation"☆23Mar 30, 2011Updated 14 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- ☆23Jul 1, 2024Updated last year
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Implementations of various toy programming languages☆12Apr 19, 2018Updated 7 years ago
- Implementation of a language interpreter in the browser, using js_of_ocaml.☆15Dec 25, 2017Updated 8 years ago
- ☆10May 3, 2017Updated 8 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- Verified C programming in Agda☆16Mar 19, 2021Updated 4 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Sep 2, 2023Updated 2 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- ☆16Dec 28, 2021Updated 4 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Benchmarking tool for compile-time performance of Agda programs☆19Jan 26, 2022Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago