scmu / aopa
Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
☆82Updated 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
- 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
- Programming library for Agda☆127Updated 8 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 2 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Summer school on programming in Agda☆68Updated last year
- A TACtic library for Agda☆48Updated 7 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 6 months ago
- Benchmarks for capture-avoiding substitution☆113Updated this week
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 4 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆94Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- Total Parser Combinators in Agda☆126Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated 3 months ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago