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☆71Updated 7 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Educational Proof Assistant for Type Theory☆75Updated last year
- A toy dependent typed language.☆32Updated this week
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- A verified compiler for a lazy functional language☆37Updated 2 weeks ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- EGraphs in OCaml☆75Updated last year
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated last week
- ☆38Updated 2 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- an implementation of Observational Type Theory (OTT) and more☆28Updated 2 years ago
- A bidirectional type checker☆64Updated 8 years ago
- MetaML and MetaOCaml bibliography☆93Updated 10 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Accompanying materials for "A Core Calculus for Documents"☆34Updated 2 years ago
- a proof-of-concept programming language based on call-by-push-value☆55Updated last month
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Refinement types + dependent types = ❤️☆61Updated 3 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 5 years ago
- Anders: Cubical Type Checker☆23Updated last year
- Staged compilation with dependent types☆182Updated 5 months ago
- Setoid type theory implementation☆38Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆76Updated this week
- being an operating system for typechecking processes☆130Updated this week