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☆33Updated 3 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 3 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Mtac in Agda☆28Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- 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
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- Linear map categories in Agda☆5Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Multimode simple type theory as an Agda library.☆22Updated 6 months ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- ☆16Updated 3 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last week
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- ☆23Updated 8 months ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Compiler backend for generating Scheme code☆27Updated last year
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago