wenkokke / setup-agda
Set up a specific version of Agda for your GitHub Actions workflow.
☆26Updated 3 months ago
Alternatives and similar repositories for setup-agda:
Users that are interested in setup-agda are comparing it to the libraries listed below
- A work-in-progress core language for Agda, in Agda☆44Updated 3 months ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- ☆28Updated 2 years ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- ☆36Updated 3 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated this week
- A tutorial on how Agda infers things☆40Updated 4 years ago
- Organize mathematical thoughts☆19Updated last year
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 11 months ago
- Synthetic geometry. Probably mostly algebraic geometry.☆23Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 5 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Compiler backend for generating Scheme code☆27Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆24Updated 2 years ago
- This is the place where (more or less) stable releases of my RW library will be published.☆16Updated 4 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- antifunext☆31Updated 7 months ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- Lecture notes and exercises for the advanced course on categorical realizability at the Midlands Graduate School (MGS) 2024☆19Updated 7 months ago
- high-performance cubical evaluation☆69Updated 2 months ago
- being a particular fragment of Haskell, extended to a proof system☆26Updated last week
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Mechanizations of Type Theories☆28Updated 2 months ago
- NbE course @ Chalmers☆28Updated 4 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆30Updated last year