zydeco-lang / zydeco
a proof-of-concept programming language based on Call-by-push-value
☆50Updated this week
Related projects ⓘ
Alternatives and complementary repositories for zydeco
- Benchmarking various normalization algorithms for the lambda calculus☆43Updated 2 years ago
- A monadic library for symbolic evaluation☆55Updated 2 weeks ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆33Updated last week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A Language with Dependent Data and Codata Types☆57Updated this week
- high-performance cubical evaluation☆68Updated 4 months ago
- Normalization by evaluation of simply typed combinators.☆26Updated 2 years ago
- ☆24Updated last month
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 8 months ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆22Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- being an operating system for typechecking processes☆121Updated last year
- PL conference deadline countdowns☆52Updated 2 weeks ago
- Demo for dependent types + runtime code generation☆54Updated this week
- Language Server for Agda☆102Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- A core language and API for dependently typed languages☆89Updated 11 months ago
- ☆47Updated last month
- Mechanizations of Type Theories☆27Updated this week
- Unification and type inference algorithms☆123Updated 9 years ago
- A deterministic parser with fused lexing☆71Updated last year
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- Lecture notes on realizability☆65Updated last month
- SPLV20 course notes☆106Updated 2 years ago
- Staged compilation with dependent types☆162Updated this week
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆33Updated last year