anuyts / agda-sessionsView external linksLinks
Learn the Agda basics in three 2-hour sessions.
☆60Sep 26, 2025Updated 4 months ago
Alternatives and similar repositories for agda-sessions
Users that are interested in agda-sessions are comparing it to the libraries listed below
Sorting:
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 10 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- A workshop on learning Agda with minimal prerequisites.☆85May 26, 2016Updated 9 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Sep 3, 2019Updated 6 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Dafny for Metatheory of Programming Languages☆29Feb 6, 2026Updated last week
- 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
- The theory of algebraic graphs formalised in Agda☆91Jul 15, 2018Updated 7 years ago
- being a thing I build on a Saturday☆28Mar 5, 2018Updated 7 years ago
- My final year project at the University of Strathclyde☆13Jan 26, 2023Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- Lecture notes for a short course on proving/programming in Coq via SSReflect.☆175Jun 24, 2021Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Extra and extended datatypes for Lean 4☆12Nov 12, 2022Updated 3 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Dec 11, 2023Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 5 years ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 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
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- Total Parser Combinators in Agda☆133Aug 5, 2025Updated 6 months ago
- Fun plugin to play with the Gallina AST.☆38Oct 3, 2019Updated 6 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago