msp-strath / Mary
Mary is the successor of Marx, a content delivery and assessment engine based on markdown and git
☆17Updated last year
Alternatives and similar repositories for Mary:
Users that are interested in Mary are comparing it to the libraries listed below
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 4 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- ☆23Updated 10 months ago
- ☆16Updated 3 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Multimode simple type theory as an Agda library.☆22Updated 7 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- A library for doing generic programming in Agda☆31Updated 4 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
- Mtac in Agda☆28Updated 4 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- ☆11Updated 4 years ago