ionathanch / parapolyLinks
A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
☆31Updated 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☆42Updated 3 weeks ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Meta-programming utilities for Agda.☆20Updated 4 months ago
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 2 months ago
- my phd thesis☆26Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- CS410 "Advanced Functional Programming"☆28Updated 7 months ago
- NbE course @ Chalmers☆28Updated last year
- Work in progress on semi-simplicial types☆23Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Extensions to cubical for categorical logic/type theory☆35Updated this week
- Quasi-quoting library for agda☆18Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆61Updated this week
- ☆29Updated 3 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Compiler backend for generating Scheme code☆28Updated 3 weeks ago
- Mtac in Agda☆28Updated 4 years ago