jaspervdj / uplcgLinks
Untitled PL Card Game
☆20Updated 4 years ago
Alternatives and similar repositories for uplcg
Users that are interested in uplcg are comparing it to the libraries listed below
Sorting:
- Where my everyday research happens☆53Updated last month
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- NbE course @ Chalmers☆28Updated 9 months ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- ☆23Updated last year
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 10 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 weeks ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Paper and talk☆54Updated 2 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated 3 weeks ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 5 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 8 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- A Coq library for parametric coinduction☆50Updated 5 months ago