yzyzsun / CP-nextLinks
The Next Generation of Compositional Programming
☆54Updated last month
Alternatives and similar repositories for CP-next
Users that are interested in CP-next are comparing it to the libraries listed below
Sorting:
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- a proof-of-concept programming language based on call-by-push-value☆57Updated this week
- Staged compilation with dependent types☆183Updated 5 months ago
- A toy dependent typed language.☆32Updated last week
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated last week
- being an operating system for typechecking processes☆130Updated 3 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 months ago
- Hoare Type Theory☆81Updated 4 months ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- A deterministic parser with fused lexing☆73Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Fωμ type checker and compiler☆54Updated 2 years ago
- An enhanced unification algorithm for Coq☆58Updated 6 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- ☆39Updated 2 months ago
- A bidirectional type checker☆65Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Duo - A research language exploring duality in programming language design☆58Updated 2 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- A verified compiler for a lazy functional language☆37Updated last week
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated this week
- A core language and API for dependently typed languages☆96Updated 8 months ago
- Command-like expressions for real infinite-precision calculations☆54Updated 2 months ago