ionathanch / parapolyLinks
A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
☆30Updated last year
Alternatives and similar repositories for parapoly
Users that are interested in parapoly are comparing it to the libraries listed below
Sorting:
- being a particular fragment of Haskell, extended to a proof system☆33Updated 2 weeks ago
- my phd thesis☆26Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 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
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆20Updated 3 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 6 months ago
- Mechanizations of Type Theories☆31Updated last week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- ☆36Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆29Updated 3 years ago
- Organize mathematical thoughts☆20Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- antifunext☆34Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- Quasi-quoting library for agda☆18Updated 8 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An agda2hs-compatible library for well-scoped syntax☆11Updated 3 months ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- Extensions to cubical for categorical logic/type theory☆31Updated this week
- ☆29Updated 2 years ago
- Mtac in Agda☆28Updated 4 years ago