mietek / agda-introLinks
Mirror of Conor McBride’s 2011 Agda course materials
☆12Updated 6 years ago
Alternatives and similar repositories for agda-intro
Users that are interested in agda-intro are comparing it to the libraries listed below
Sorting:
- A small NuPRL style proof assistant☆31Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆17Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- xmonad in Coq☆46Updated 13 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- ☆26Updated 8 years ago
- ☆18Updated 3 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago