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 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
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- ☆18Updated 2 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 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
- ☆12Updated 5 years ago
- ☆17Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆15Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A discouraging story.☆15Updated 6 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- An Agda formalisation of the theory of directed containers☆11Updated 13 years ago
- ☆11Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago