robrix / ManifoldLinks
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
Sorting:
- being a thing I build on a Saturday☆28Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- An "extensible coeffect" system built out of comonads and Day convolution.☆36Updated 5 years ago
- My master thesis about generic programming and ornaments☆16Updated 9 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- Category theory and algebra☆27Updated 9 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Haskell Type Level Example Programs☆28Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 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 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Deriving via☆33Updated 7 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Clowns to the left of me, jokers to the right☆15Updated 6 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 9 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- ☆20Updated last year