yzyzsun / CP-nextLinks
The Next Generation of Compositional Programming
☆56Updated last week
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 10 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆62Updated last year
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- an implementation of Observational Type Theory (OTT) and more☆29Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 5 years ago
- a proof-of-concept programming language based on call-by-push-value☆61Updated last week
- Educational Proof Assistant for Type Theory☆81Updated last month
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- SPSC: A Small Positive Supercompiler☆39Updated last year
- MetaML and MetaOCaml bibliography☆98Updated last year
- Gallina to Bedrock2 compilation toolkit☆65Updated 3 weeks ago
- A bidirectional type checker☆66Updated 8 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A mechanisation of Wasm in Isabelle.☆31Updated last month
- An experimental language server for SomewhatML☆24Updated 3 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- ☆42Updated 4 months ago
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 5 years ago
- Interpreter for the reversible functional language rFun☆38Updated 7 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆38Updated this week
- Staged compilation with dependent types☆186Updated 7 months ago
- A deterministic parser with fused lexing☆75Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago