gallais / thesisLinks
Syntaxes with Binding, Their Programs, and Proofs
☆23Updated last year
Alternatives and similar repositories for thesis
Users that are interested in thesis are comparing it to the libraries listed below
Sorting:
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- my phd thesis☆26Updated last year
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆21Updated 3 years ago
- ☆21Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Where my everyday research happens☆54Updated 2 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Quasi-quoting library for agda☆18Updated 8 months ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- being a particular fragment of Haskell, extended to a proof system☆33Updated 2 weeks ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆11Updated 5 years ago
- ☆29Updated 3 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- ☆16Updated 3 years ago
- ☆18Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- ☆48Updated last week
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆23Updated last year