alhassy / gentle-intro-to-reflectionLinks
A slow-paced introduction to reflection in Agda. ---Tactics!
☆104Updated 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.☆103Updated 4 months ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- A TACtic library for Agda☆50Updated last year
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago
- Lecture notes on realizability☆75Updated 10 months ago
- Categorical logic from a categorical point of view☆81Updated 2 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- Programming library for Agda☆134Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆53Updated 5 months ago
- A work-in-progress core language for Agda, in Agda☆61Updated last week
- Unification and type inference algorithms☆125Updated 10 years ago
- A tutorial on how Agda infers things☆63Updated 5 months ago
- Total Parser Combinators in Agda☆132Updated 4 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆67Updated last week
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆56Updated 3 years ago
- Compiling Agda code to readable Haskell☆196Updated 3 weeks ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- SPLV20 course notes☆114Updated 3 years ago
- Where my everyday research happens☆55Updated last week
- Agda formalisation of the Introduction to Homotopy Type Theory☆125Updated 4 years ago