robrix / Manifold
Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.
☆18Updated 6 years ago
Alternatives and similar repositories for Manifold:
Users that are interested in Manifold are comparing it to the libraries listed below
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- what I did on my holidays☆12Updated 6 years ago
- "Programs that explain their effects" talk material☆17Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Haskell Type Level Example Programs☆29Updated 7 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 3 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 8 years ago
- Category theory and algebra☆28Updated 8 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- complexity testing for haskell☆48Updated 9 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Playing with incremental parsing and later compiler passes☆12Updated 6 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 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