zydeco-lang / zydecoLinks
a proof-of-concept programming language based on call-by-push-value
☆53Updated this week
Alternatives and similar repositories for zydeco
Users that are interested in zydeco are comparing it to the libraries listed below
Sorting:
- high-performance cubical evaluation☆72Updated last month
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- ☆33Updated 7 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 5 months ago
- Demo for dependent types + runtime code generation☆69Updated 3 months ago
- A monadic library for symbolic evaluation☆66Updated last week
- Benchmarks for capture-avoiding substitution☆114Updated this week
- Staged compilation with dependent types☆173Updated 3 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- Mechanizations of Type Theories☆29Updated 3 months ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆52Updated last month
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆58Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- Setoid type theory implementation☆38Updated last year
- ☆25Updated 9 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆45Updated last year
- Formalizations of Gradually Typed Languages in Agda☆57Updated 3 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- A Language with Dependent Data and Codata Types☆104Updated 2 weeks ago
- Fast equality saturation in Haskell☆84Updated 3 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- A deterministic parser with fused lexing☆73Updated last year