msullivan / typecoin
Typecoin: Massively Multiplayer Online Linear Logic
☆18Updated 7 years ago
Alternatives and similar repositories for typecoin:
Users that are interested in typecoin are comparing it to the libraries listed below
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- Category theory and algebra☆28Updated 8 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- ☆11Updated 4 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Bindings to Haskell's IO monad which respect Agda's semantics☆24Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- ☆12Updated 5 years ago
- Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.☆11Updated 7 years ago
- ☆18Updated 2 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago