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
- A slow-paced introduction to reflection in Agda. ---Tactics!☆98Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago
- Unification and type inference algorithms☆124Updated 10 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆109Updated this week
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- 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
- A tutorial on how Agda infers things☆41Updated 4 years ago
- A TACtic library for Agda☆48Updated 5 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Programming library for Agda☆126Updated 5 months ago
- Organization and planning for the Initial Types Club☆72Updated 2 years ago
- being the materials for Summer 2013's course☆112Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 5 months ago
- Total Parser Combinators in Agda☆126Updated last year
- HoTT in Lean 3☆78Updated 4 years ago
- Summer school on programming in Agda☆68Updated last year
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 4 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- An interactive theorem prover based on lambda-tree syntax☆92Updated 3 weeks ago