AHartNtkn / Dependent-Binary-Lambda-CalculusLinks
A Dependently Typed Esolang
☆10Updated 8 years ago
Alternatives and similar repositories for Dependent-Binary-Lambda-Calculus
Users that are interested in Dependent-Binary-Lambda-Calculus are comparing it to the libraries listed below
Sorting:
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- a self-hosting lambda calculus compiler☆36Updated 4 months ago
- A Self-Interpreter for F-omega☆16Updated 9 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated last year
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Edit is a monad for rewriting things.☆23Updated 4 years ago
- Classical Logic in Haskell☆24Updated 4 months ago
- Implementation of dependent type theory in SWI-Prolog☆9Updated 4 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆40Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- Propositional logic tools, inspired by the Coq standard library.☆9Updated 7 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago