xieyuheng / innerLinks
Ones Inner Universe.
☆5Updated this week
Alternatives and similar repositories for inner
Users that are interested in inner are comparing it to the libraries listed below
Sorting:
- MLpolyR☆7Updated 8 years ago
- ☆22Updated 5 years ago
- Idris 2 bindings to various C libraries☆15Updated 3 years ago
- The Alms Programming Language☆44Updated 6 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Some rudimentary proofs on subtyping☆11Updated 3 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆13Updated 6 years ago
- Optimizing Abstract Abstract Machines☆31Updated 8 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Lean4 backend using `libgccjit`!☆11Updated last year
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- miniKanren for search, SMT for solving☆13Updated 5 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- A simple and educational compiler for the SASL programming language☆23Updated 7 years ago
- My Own Linear Lisp☆40Updated 6 years ago
- A very little language☆16Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- A categorical semantics library in Agda.☆17Updated 5 years ago
- 🧊 TeX-подібна система верстки наукових праць☆19Updated 3 months ago
- Type systems written in 1ML☆9Updated 5 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated last month
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- SPSC: A Small Positive Supercompiler☆35Updated last year
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago