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 2 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆22Updated 5 months ago
- A Dependently Timed Drum Machine Language☆10Updated last year
- Cambridge ACS Category Theory, Type Theory, and Logic - lecture notes 2017.☆14Updated 7 years ago
- DIKU Support Tools for Canvas LMS☆14Updated last year
- Mechanizations of Type Theories☆32Updated last month
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- An automated theorem prover that uses Büchi automata.☆42Updated 4 years ago
- Design, play with, and analyze sequent calculus proof systems.☆13Updated last year
- a proof-of-concept programming language based on call-by-push-value☆55Updated last week
- Staged compilation with dependent types☆180Updated 4 months ago
- Command-like expressions for real infinite-precision calculations☆54Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated last year
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆45Updated 6 months ago
- Tutorial for using the MPL compiler for Parallel ML☆21Updated 8 months ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- ☆90Updated 3 years ago
- ☆29Updated 2 years ago
- ☆64Updated 3 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 4 months ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆68Updated last year
- A simple functional programming language.☆22Updated 4 years ago
- A Coq development of the theory of Indexed W types with function extensionality.☆11Updated 8 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 3 weeks ago
- Verified C programming in Agda☆16Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- A constructive proof assistant for second order logic.☆35Updated 11 months ago