alhassy / gentle-intro-to-reflectionLinks
A slow-paced introduction to reflection in Agda. ---Tactics!
☆101Updated 3 years ago
Alternatives and similar repositories for gentle-intro-to-reflection
Users that are interested in gentle-intro-to-reflection are comparing it to the libraries listed below
Sorting:
- Agda bindings to SMT-LIB2 compatible solvers.☆99Updated 8 months ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Categorical logic from a categorical point of view☆79Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A TACtic library for Agda☆48Updated 9 months ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Total Parser Combinators in Agda☆129Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- ☆45Updated 6 years ago
- A tutorial on how Agda infers things☆42Updated 4 years ago
- SPLV20 course notes☆110Updated 2 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆81Updated 4 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Programming library for Agda☆128Updated 10 months ago
- A work-in-progress core language for Agda, in Agda☆52Updated last week
- Benchmarks for capture-avoiding substitution☆114Updated 3 weeks ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- HoTT in Lean 3☆80Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Lecture notes on realizability☆72Updated 4 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- Learn the Agda basics in three 2-hour sessions.☆59Updated last year