smimram / stridLinks
A string diagram generator for LaTeX.
☆30Updated 2 years ago
Alternatives and similar repositories for strid
Users that are interested in strid are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- ☆17Updated 7 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated this week
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Web based opetopic editor☆35Updated last year
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- being an experiment with potato power☆23Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 5 years ago
- ☆18Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago