AndrasKovacs / SemanticsWithApplicationsLinks
Formal semantics in Agda.
☆16Updated 10 years ago
Alternatives and similar repositories for SemanticsWithApplications
Users that are interested in SemanticsWithApplications are comparing it to the libraries listed below
Sorting:
- Logical relations proof in Agda☆27Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 weeks ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated 2 years ago
- NbE course @ Chalmers☆28Updated 9 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Where my everyday research happens☆53Updated last month
- A TACtic library for Agda☆48Updated 10 months ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- 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 Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- ☆23Updated last year
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 8 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 10 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- ☆19Updated 11 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago