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:
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- ☆17Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 5 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
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Work in progress☆38Updated 6 months ago
- ☆22Updated 9 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 4 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago