catseye / Mascarpone
MIRROR of https://codeberg.org/catseye/Mascarpone : You are lost in a twisty maze of meta-circular interpreters, all alike.
☆21Updated last year
Alternatives and similar repositories for Mascarpone:
Users that are interested in Mascarpone are comparing it to the libraries listed below
- A SKI combinators interpreter written in assembly☆19Updated 4 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆29Updated 7 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 5 years ago
- ☆14Updated last month
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Yoneda lemma in every known language☆17Updated 2 years ago
- A simple functional programming language.☆21Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 weeks ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆38Updated 9 months ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆21Updated 3 years ago
- The official interpreter for the Jeopardy language☆16Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆10Updated 10 months ago
- being a particular fragment of Haskell, extended to a proof system☆30Updated last month
- Formalizing nbe in agda☆30Updated 12 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago