sergei-romanenko / spsc
SPSC: A Small Positive Supercompiler
☆35Updated last year
Alternatives and similar repositories for spsc
Users that are interested in spsc are comparing it to the libraries listed below
Sorting:
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated 4 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- A verified compiler for a lazy functional language☆36Updated this week
- dependently-typed lisp with flexible compiler backends☆27Updated 5 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".☆27Updated 3 years ago
- A toy dependent typed language.☆28Updated 3 weeks ago
- Datatypes as quotients of polynomial functors☆35Updated 5 years ago
- Anders: Cubical Type Checker☆24Updated last year
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- MetaML and MetaOCaml bibliography☆89Updated 5 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Demo for dependent types + runtime code generation☆69Updated 3 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated last year
- Two-Level Type Theory☆28Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆29Updated 4 years ago
- ☆36Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- a self-hosting lambda calculus compiler☆35Updated last month
- ☆33Updated 7 months ago
- A SuperCompiler for Martin-Löf's Type Theory☆121Updated 3 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated last month