groupoid / TeXLinks
🧊 TeX-подібна система верстки наукових праць
☆20Updated 10 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
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆33Updated 7 years ago
- A constraint solver built from scratch in OCaml☆12Updated 4 years ago
- Matita (proof assistant) with embedded elpi☆15Updated 8 years ago
- TPTP linear logic version☆15Updated last year
- A simple λProlog interpreter☆20Updated 4 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A small NuPRL style proof assistant☆31Updated 7 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆21Updated 9 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- The Alms Programming Language☆44Updated 7 years ago
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Choice operator in OCaml, providing a backtracking monad☆26Updated 4 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- Two-Level Type Theory☆28Updated 6 years ago
- A formalization of System Fω in Agda☆20Updated last month
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 7 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 5 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
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated 2 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆45Updated 6 years ago