catseye / MascarponeLinks
MIRROR of https://codeberg.org/catseye/Mascarpone : You are lost in a twisty maze of meta-circular interpreters, all alike.
☆23Updated last year
Alternatives and similar repositories for Mascarpone
Users that are interested in Mascarpone are comparing it to the libraries listed below
Sorting:
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- Specification of the Cedille Core language☆33Updated 5 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- A simple functional programming language.☆22Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆49Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Implementing a small functional language with a combinator based graph-reduction machine☆36Updated last week
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 weeks ago