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 2 months ago
- my phd thesis☆26Updated last year
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 7 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Mechanizations of Type Theories☆32Updated 2 months ago
- Meta-programming utilities for Agda.☆20Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Organize mathematical thoughts☆20Updated 2 years ago
- ☆45Updated 6 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
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- 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
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- Extensions to cubical for categorical logic/type theory☆32Updated this week
- Quasi-quoting library for agda☆18Updated 10 months ago
- CS410 "Advanced Functional Programming"☆27Updated 5 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- A cost-aware logical framework, embedded in Agda.☆67Updated 2 weeks ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- ☆30Updated 2 years ago
- ☆29Updated 3 years ago