jonsterling / agda-effectful-forcingLinks
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 4 years ago
Alternatives and similar repositories for agda-effectful-forcing
Users that are interested in agda-effectful-forcing are comparing it to the libraries listed below
Sorting:
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- ☆12Updated 5 years ago
- ☆18Updated 3 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- ☆17Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- secret project☆17Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Typed DSLs for sorting☆19Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆11Updated 4 years ago
- Type theory in type theory☆16Updated 13 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago