catseye / MascarponeLinks
MIRROR of https://codeberg.org/catseye/Mascarpone : You are lost in a twisty maze of meta-circular interpreters, all alike.
☆23Updated 2 years ago
Alternatives and similar repositories for Mascarpone
Users that are interested in Mascarpone are comparing it to the libraries listed below
Sorting:
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 3 weeks ago
- The official interpreter for the Jeopardy language☆16Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- a self-hosting lambda calculus compiler☆37Updated 10 months ago
- A simple functional programming language.☆22Updated 4 years ago
- Specification of the Cedille Core language☆35Updated 5 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- A small NuPRL style proof assistant☆31Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Observational Type Theory as an Agda library☆57Updated 8 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆40Updated 5 months ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- ☆40Updated last year
- Yoneda lemma in every known language☆17Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 8 months ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Updated 10 months ago
- a simple total pure functional language, eventually to have powerful static checking and optimization☆33Updated last month
- classical sequent calculus, embedded in Haskell☆21Updated 5 months ago