Syntaxes with Binding, Their Programs, and Proofs
☆23Oct 26, 2023Updated 2 years ago
Alternatives and similar repositories for thesis
Users that are interested in thesis are comparing it to the libraries listed below
Sorting:
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- A typechecker for WebAssembly, written in Agda (WIP)☆17Feb 23, 2018Updated 8 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Distributions of Agda executable compiled into WebAssembly.☆25Nov 9, 2025Updated 3 months ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- An agda2hs-compatible library for well-scoped syntax☆11Nov 6, 2025Updated 3 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Oct 22, 2024Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Jul 11, 2016Updated 9 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- A Language and its compiler on Ethereum Virtual Machine☆14Dec 17, 2018Updated 7 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- ☆48Jul 5, 2019Updated 6 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- ☆16Mar 11, 2022Updated 3 years ago
- Library of Coq proof automation☆16Feb 15, 2022Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Proof automation – for Agda, in Agda.☆45Sep 7, 2020Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Let's rethink how we interact with Agda☆18Nov 18, 2022Updated 3 years ago
- ☆21Jan 24, 2022Updated 4 years ago
- Generalized Convolution and Efficient Language Recognition☆18Jul 20, 2019Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆105Aug 11, 2025Updated 6 months ago
- The Evolution of a Typechecker☆54Jan 20, 2019Updated 7 years ago
- Agda grammar for tree-sitter☆42Aug 30, 2025Updated 6 months ago
- Benchmarking tool for compile-time performance of Agda programs☆19Jan 26, 2022Updated 4 years ago
- Derivation of Optimized Definitions Based on Specs☆14Sep 28, 2019Updated 6 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Jan 31, 2022Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year