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:
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- ☆18Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆12Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 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
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- being an experiment with potato power☆23Updated 5 years ago
- An Agda formalisation of the theory of directed containers☆12Updated 2 months ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆17Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago