groupoid / TeXLinks
🧊 TeX-подібна система верстки наукових праць
☆20Updated 9 months ago
Alternatives and similar repositories for TeX
Users that are interested in TeX are comparing it to the libraries listed below
Sorting:
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A constraint solver built from scratch in OCaml☆12Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Idris 2 bindings to various C libraries☆15Updated 4 years ago
- TPTP linear logic version☆15Updated 11 months ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- SML Parser Combinator Library☆28Updated 9 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- Two-Level Type Theory☆28Updated 6 years ago
- Matita (proof assistant) with embedded elpi☆15Updated 7 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆57Updated 5 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- For supporting template-based programming☆23Updated 5 years ago
- N2O: Standard ML Application Server☆18Updated 4 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- ☆22Updated 5 years ago
- Delimited continuations in byte-code and native OCaml☆27Updated 4 years ago
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- αProlog☆18Updated 2 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A simple λProlog interpreter☆20Updated 4 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆33Updated 7 years ago
- Higher kinded polymorphism in SML☆15Updated 5 years ago