robrix / Manifold
Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.
☆18Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for Manifold
- Type Theory with Indexed Equality☆23Updated 7 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
- Resources for "One Monad to Prove Them All"☆28Updated 5 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 7 years ago
- My master thesis about generic programming and ornaments☆16Updated 8 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- Category theory and algebra☆27Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆16Updated 7 years ago
- what I did on my holidays☆12Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- A Haskell library providing separation of effects on the type level, effectively splitting up the monolithic IO-monad into more limited c…☆27Updated 6 years ago
- ☆14Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- Folds for recursive types with GHC Generics☆26Updated 4 years ago
- System F in coq.☆19Updated 9 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 6 years ago
- Formalizations of strong normalization proofs☆34Updated 5 years ago
- An "extensible coeffect" system built out of comonads and Day convolution.☆36Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- 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