jespercockx / atacaLinks
A TACtic library for Agda
☆50Updated last year
Alternatives and similar repositories for ataca
Users that are interested in ataca are comparing it to the libraries listed below
Sorting:
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Where my everyday research happens☆55Updated this week
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- ☆23Updated last year
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆104Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- ☆51Updated 5 months ago
- The multimode presheaf proof-assistant☆37Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- NbE course @ Chalmers☆28Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 5 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- ☆31Updated 2 years ago
- A tutorial on how Agda infers things☆63Updated 6 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- Eventually a practical 2-level TT-based compiler☆29Updated this week
- Mtac in Agda☆29Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago