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.☆98Updated 7 months 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
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Categorical logic from a categorical point of view☆78Updated last year
- A TACtic library for Agda☆48Updated 8 months ago
- Programming library for Agda☆128Updated 9 months ago
- A work-in-progress core language for Agda, in Agda☆52Updated last month
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- ☆45Updated 5 years ago
- A tutorial on how Agda infers things☆42Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆114Updated this week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- SPLV20 course notes☆108Updated 2 years ago
- Lecture notes on realizability☆72Updated 3 months ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 2 months ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆60Updated this week
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆54Updated 2 years ago
- ☆84Updated 7 years ago