Lysxia / system-FLinks
Formalization of the polymorphic lambda calculus and its parametricity theorem
☆35Updated 6 months ago
Alternatives and similar repositories for system-F
Users that are interested in system-F are comparing it to the libraries listed below
Sorting:
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 3 weeks ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 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
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 weeks ago
- Quasi-quoting library for agda☆18Updated 10 months ago
- a version of the 2048 game for Coq☆22Updated last year
- my phd thesis☆26Updated last year
- being a particular fragment of Haskell, extended to a proof system☆39Updated 2 months ago
- NbE course @ Chalmers☆28Updated last year
- https://metaborg.github.io/mj.agda/☆13Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆33Updated last year
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆16Updated 3 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- Mechanizations of Type Theories☆32Updated last month