yallop / causal-commutative-arrows-revisited
Causal commutative arrows revisited: an optimizing arrow library
☆9Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for causal-commutative-arrows-revisited
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 8 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- SubML (prototype) language☆23Updated 2 years ago
- Domain theory and denotational semantics in Coq☆10Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 5 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆15Updated last month
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- Concurrent IO language with Uniqueness Types☆9Updated 9 years ago
- ☆14Updated 6 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- An experimental intermediate language for GHC☆37Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- ☆17Updated 2 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 5 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 3 months ago
- Type level lists, pairs, sums, their operations, and their properties.☆24Updated 6 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆20Updated 11 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆19Updated 9 years ago
- Efficient search weighted by an ordered monoid with monus.☆16Updated last year
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 8 years ago
- ☆8Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago