jsiek / gradual-typing-in-agdaView external linksLinks
Formalizations of Gradually Typed Languages in Agda
☆59Dec 18, 2025Updated last month
Alternatives and similar repositories for gradual-typing-in-agda
Users that are interested in gradual-typing-in-agda are comparing it to the libraries listed below
Sorting:
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆55May 28, 2020Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 5 months ago
- A Unifying Cartesian Cubical Set Model☆35Oct 14, 2019Updated 6 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74May 7, 2018Updated 7 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 4 years ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- ☆18May 10, 2022Updated 3 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- Featherweight C, Executable Semantics: Parser, Type Checker, and Abstract Machine☆29Feb 18, 2021Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 3 years ago
- Benchmarking tool for compile-time performance of Agda programs☆19Jan 26, 2022Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- Syntax Parse Bee 2021☆11Nov 7, 2022Updated 3 years ago
- Anders: Cubical Type Checker☆23Oct 23, 2023Updated 2 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- ☆17Oct 31, 2025Updated 3 months ago
- ☆17Jun 10, 2022Updated 3 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- ☆15Oct 31, 2023Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Haskell implementation of nominal datatypes and functions☆44Aug 4, 2020Updated 5 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Jul 11, 2016Updated 9 years ago
- Formalization of 2LTT in Agda☆17Aug 6, 2025Updated 6 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Oct 18, 2025Updated 3 months ago
- ☆17Oct 16, 2018Updated 7 years ago
- A work-in-progress structure editor for the cooltt proof assistant.☆18Jul 28, 2022Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- Experiments in formalizing refinement type systems in Coq☆18Feb 7, 2016Updated 10 years ago
- Contextual types meet mechanized metatheory!☆206Sep 30, 2025Updated 4 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- A formalization of the theory behind the mugen library☆19Jun 24, 2024Updated last year
- my phd thesis☆26Aug 7, 2024Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Sep 21, 2022Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year