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 5 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
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- ☆17Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- An Agda formalisation of the theory of directed containers☆12Updated 6 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 2 weeks ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- ☆18Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- being an experiment with potato power☆23Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 8 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 9 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago