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:
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- Class instances for Coq inductive types with little boilerplate☆25Updated 5 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last week
- Where my everyday research happens☆55Updated 3 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- ☆48Updated last month
- ☆21Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 5 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Tutorial series introducing Agda to the people at BCAM☆27Updated 3 years ago
- A TACtic library for Agda☆49Updated last year
- being a particular fragment of Haskell, extended to a proof system☆34Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- ☆23Updated last year
- A Coq library for parametric coinduction☆50Updated 7 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year