madsobitsoe / CATITOR
The extremely portable, extremely extensible line editor
☆13Updated 2 years ago
Alternatives and similar repositories for CATITOR:
Users that are interested in CATITOR are comparing it to the libraries listed below
- DIKU Support Tools for Canvas LMS☆14Updated 5 months ago
- The official interpreter for the Jeopardy language☆16Updated 2 years ago
- Image Utilities for F# (2d-drawing, loading/saving of image files, simple Gtk apps)☆9Updated 2 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆21Updated 3 years ago
- a proof-of-concept programming language based on Call-by-push-value☆53Updated 2 weeks ago
- Call Futhark programs from Standard ML☆10Updated 5 months ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 2 years ago
- Mechanizations of Type Theories☆28Updated 2 months ago
- A digital archive of category theory papers.☆23Updated last year
- ☆23Updated 5 months ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆14Updated last year
- MLB support for CM (the SML/NJ Compilation and Library Manager)☆18Updated last year
- Design, play with, and analyze sequent calculus proof systems.☆13Updated 5 months ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆29Updated 6 months ago
- Formalization of 2LTT in Agda☆14Updated last year
- ☆28Updated last year
- antifunext☆31Updated 7 months ago
- Parallel Functional Programming, 2020☆15Updated last year
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- ☆10Updated 2 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago
- define ZF Set Theory in Agda and it's model on Ordinal and Ordinal Definable Set☆14Updated 2 weeks ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆64Updated 10 months ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- ☆13Updated 5 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Partition refinement☆15Updated last year
- HTTP utility library for Standard ML☆11Updated last year
- An interactive theorem prover based on lambda-tree syntax☆91Updated 2 weeks ago