lexa-lang / lexaLinks
☆39Updated 2 months ago
Alternatives and similar repositories for lexa
Users that are interested in lexa are comparing it to the libraries listed below
Sorting:
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- high-performance cubical evaluation☆75Updated 5 months ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months ago
- A cost-aware logical framework, embedded in Agda.☆67Updated 2 weeks ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆45Updated 7 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- a proof-of-concept programming language based on call-by-push-value☆56Updated last month
- Staged compilation with dependent types☆183Updated 5 months ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A toy dependent typed language.☆32Updated this week
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 2 weeks ago
- A toy example of a verified compiler.☆29Updated 6 months ago
- being an operating system for typechecking processes☆130Updated 2 weeks ago
- A deterministic parser with fused lexing☆74Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- ☆43Updated last month
- Educational Proof Assistant for Type Theory☆75Updated last year
- ☆36Updated 4 years ago
- Logical Relation for MLTT in Coq☆27Updated this week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- ☆53Updated last week
- Lecture notes on realizability☆74Updated 8 months ago
- Benchmark repository of polyglot effect handler examples☆29Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month