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:
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆17Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆23Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆26Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆18Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- ☆16Updated 3 months ago
- System F implemented in Haskell☆24Updated 13 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
- Linear map categories in Agda☆5Updated 2 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
- Compositional type checking for Haskell☆37Updated 14 years ago
- Session types in Idris2!☆27Updated 4 years ago
- ☆21Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago