smimram / strid
A string diagram generator for LaTeX.
☆26Updated last year
Alternatives and similar repositories for strid:
Users that are interested in strid are comparing it to the libraries listed below
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- ☆22Updated 8 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 6 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- ☆17Updated 6 years ago
- A repository of MetaOCaml packages☆12Updated last year
- A simple implementation of linear type theory☆38Updated 7 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Deciding Presburger arithmetic in agda☆31Updated 2 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 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 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Combinatorial species in HoTT☆12Updated 9 years ago