smimram / stridLinks
A string diagram generator for LaTeX.
☆31Updated 2 years ago
Alternatives and similar repositories for strid
Users that are interested in strid are comparing it to the libraries listed below
Sorting:
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- ☆18Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- ☆17Updated 7 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 8 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]☆27Updated 10 months ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Type theory in type theory☆16Updated 13 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- ☆22Updated 9 years ago
- ☆12Updated 4 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago