Web based opetopic editor
☆36Oct 21, 2024Updated last year
Alternatives and similar repositories for opetopic
Users that are interested in opetopic are comparing it to the libraries listed below
Sorting:
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- Orchard Opetopic Proof Assistant☆29May 2, 2016Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Mar 26, 2017Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- A dependently typed programming language, and verification tool☆27Apr 3, 2016Updated 9 years ago
- Revised Omega-categorical Typechecker☆27Nov 3, 2024Updated last year
- an SML language server that uses SML/NJ's "visible compiler" feature☆24Jan 15, 2018Updated 8 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Jul 12, 2019Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- Cohesive type theory☆19Dec 6, 2021Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- An approach to higher algebra in type theory☆23May 12, 2020Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 6 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated 2 weeks ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Jan 28, 2016Updated 10 years ago