jules-hedges / open-games
Haskell implementation of open games
☆12Updated 9 years ago
Alternatives and similar repositories for open-games
Users that are interested in open-games are comparing it to the libraries listed below
Sorting:
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 4 months ago
- Codo notation for programming with comonads in Haskell☆26Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- [Talk] Framing the Discussion with EDSLs☆9Updated 10 years ago
- Combinators for manipulating dependently-typed predicates.☆12Updated 10 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆21Updated 2 weeks ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Synthetic Differential Geometry in Agda☆12Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 3 weeks ago
- Relative Monad Library for Agda☆24Updated 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
- Logical relations proof in Agda☆26Updated 9 years ago
- machine fusion☆16Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Category theory and algebra☆28Updated 8 years ago
- An experiment in functional interface design☆24Updated 8 years ago