Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
☆53Jul 24, 2019Updated 6 years ago
Alternatives and similar repositories for foundations-harper
Users that are interested in foundations-harper are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Relative Monad Library for Agda☆24May 29, 2019Updated 6 years ago
- Porting of software foundations book to Agda☆39Feb 16, 2014Updated 12 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Base library for HoTT in Agda☆39Apr 2, 2019Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Jul 11, 2016Updated 9 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A simple GUI for Agda☆31Dec 13, 2015Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- ☆18May 10, 2022Updated 3 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Proof automation – for Agda, in Agda.☆45Sep 7, 2020Updated 5 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 3 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Programming library for Agda☆135Aug 22, 2024Updated last year
- ☆13Nov 23, 2019Updated 6 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago