jonsterling / agda-effectful-forcing
Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -> nat) in System T.
☆12Updated 3 years ago
Related projects: ⓘ
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- secret project☆17Updated 6 years ago
- ☆14Updated this week
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- ☆15Updated this week
- A playground for type theory implementations in Racket☆20Updated 8 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- ☆18Updated 2 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Educational implementation of dependent types☆19Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- ☆11Updated this week
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- ☆17Updated 5 years ago
- ☆12Updated this week
- being an experiment with potato power☆23Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- A tiny implementation of dependent types.☆11Updated 6 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆10Updated 5 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- System F in coq.☆19Updated 9 years ago
- ☆16Updated 5 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 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…☆19Updated 2 years ago
- van Laarhoven lenses for Idris☆20Updated 6 years ago