AndrasKovacs / system-f-omegaView external linksLinks
System F-omega normalization by hereditary substitution in Agda
☆62Aug 31, 2019Updated 6 years ago
Alternatives and similar repositories for system-f-omega
Users that are interested in system-f-omega are comparing it to the libraries listed below
Sorting:
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Jul 10, 2015Updated 10 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Dec 10, 2017Updated 8 years ago
- Logical relations proof in Agda☆27May 27, 2015Updated 10 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- ☆20Aug 13, 2024Updated last year
- secret project☆17Mar 14, 2018Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Nov 3, 2024Updated last year
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 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
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 10 months ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 5 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- A simple supercompiler formally verified in Agda☆34Mar 17, 2017Updated 8 years ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago