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:
- The official interpreter for the Jeopardy language☆16Updated 3 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Updated 9 months ago
- Cambridge ACS Category Theory, Type Theory, and Logic - lecture notes 2017.☆14Updated 7 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆32Updated last year
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- ☆45Updated 9 months ago
- ☆90Updated 4 years ago
- A simple functional programming language.☆22Updated 4 years ago
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 2 months ago
- Slides and handwritten notes on the course on models of programming languages☆51Updated 5 years ago
- Mechanizations of Type Theories☆32Updated last week
- Design, play with, and analyze sequent calculus proof systems.☆14Updated last year
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆101Updated 3 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- A Dependently Timed Drum Machine Language☆11Updated last year
- ☆31Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Command-like expressions for real infinite-precision calculations☆55Updated 5 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- ☆25Updated last year
- a proof-of-concept programming language based on call-by-push-value☆61Updated this week
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Coq library for handling names☆19Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- MLB support for CM (the SML/NJ Compilation and Library Manager)☆18Updated 7 months ago
- Setoid type theory implementation☆38Updated 2 years ago
- Writeup that goes along with this:☆40Updated 7 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago