madsobitsoe / CATITORLinks
The extremely portable, extremely extensible line editor
☆13Updated 3 years ago
Alternatives and similar repositories for CATITOR
Users that are interested in CATITOR are comparing it to the libraries listed below
Sorting:
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Updated 10 months ago
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Updated 2 years ago
- The official interpreter for the Jeopardy language☆16Updated 3 years ago
- Staged compilation with dependent types☆187Updated last week
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- A Coq development of the theory of Indexed W types with function extensionality.☆11Updated 8 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆101Updated 3 years ago
- ☆25Updated last year
- Alternative algorithm for algebraic subtyping.☆174Updated 2 months ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆46Updated 11 months ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆70Updated last year
- ☆45Updated 10 months ago
- ☆90Updated 4 years ago
- Design, play with, and analyze sequent calculus proof systems.☆14Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Updated 4 months ago
- A Dependently Timed Drum Machine Language☆11Updated last year
- ☆31Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- An Agda library for programming with ternary relations☆18Updated 10 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆69Updated last year
- An embedding of ZFC into Agda☆13Updated 4 years ago
- ☆28Updated 2 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A simple functional programming language.☆22Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago