scmu / aopa
Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
☆80Updated 8 years ago
Alternatives and similar repositories for aopa:
Users that are interested in aopa are comparing it to the libraries listed below
- ☆84Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- HoTT in Lean 3☆78Updated 4 years ago
- Summer school on programming in Agda☆68Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆100Updated 2 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Programming library for Agda☆127Updated 7 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated last month
- Benchmarks for capture-avoiding substitution☆113Updated last month
- Tiny type-checker with dependent types☆76Updated 11 years ago
- being the materials for Summer 2013's course☆112Updated last year
- Strongly-typed System F in Haskell☆117Updated 2 years ago