mietek / agda-intro
Mirror of Conor McBride’s 2011 Agda course materials
☆11Updated 5 years ago
Alternatives and similar repositories for agda-intro:
Users that are interested in agda-intro are comparing it to the libraries listed below
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated last month
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- ☆17Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A small NuPRL style proof assistant☆32Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- ☆18Updated 2 years ago
- System F in coq.☆19Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Linear map categories in Agda☆5Updated last year
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last month
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 3 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago