zydeco-lang / zydecoLinks
a proof-of-concept programming language based on call-by-push-value
☆54Updated this week
Alternatives and similar repositories for zydeco
Users that are interested in zydeco are comparing it to the libraries listed below
Sorting:
- ☆33Updated 8 months ago
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 6 months ago
- high-performance cubical evaluation☆73Updated last month
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- A monadic library for symbolic evaluation☆67Updated last week
- Mechanizations of Type Theories☆30Updated 2 weeks ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆114Updated 3 weeks ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Staged compilation with dependent types☆174Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- A Language with Dependent Data and Codata Types☆107Updated 2 weeks ago
- A deterministic parser with fused lexing☆73Updated last year
- Elaboration with inductive types☆16Updated 2 years ago
- ☆25Updated 9 months ago
- Setoid type theory implementation☆38Updated last year
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- PL conference deadline countdowns☆60Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago