jameshaydon / lawvereLinks
A categorical programming language with effects
☆282Updated 2 years ago
Alternatives and similar repositories for lawvere
Users that are interested in lawvere are comparing it to the libraries listed below
Sorting:
- Dependent type checker using normalisation by evaluation☆263Updated 10 months ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆621Updated 2 months ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆379Updated last year
- Frank compiler☆296Updated last year
- 😎TT☆230Updated last year
- The cuteness implementation of a dependently typed language.☆191Updated 2 years ago
- Embeddable Lambda Prolog Interpreter☆317Updated last week
- Demo for high-performance type theory elaboration☆559Updated last year
- Spartan type theory☆268Updated last year
- ☆227Updated last week
- The Makam Metalanguage☆198Updated 2 years ago
- A ready-to-fork interpreted functional language with type inference☆414Updated this week
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆382Updated this week
- Standard library for linear types in Haskell.☆345Updated 3 weeks ago
- Relational programming in Haskell. Mostly developed on twitch.☆263Updated 10 months ago
- An introductory course to Homotopy Type Theory☆373Updated 4 years ago
- Language Server for Idris2☆179Updated last month
- Resources for type theory, functional programming, etc.☆320Updated 4 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- formally verified category theory library☆263Updated 5 years ago
- A new Categories library for Agda☆384Updated last week
- The adventures of a Haskell compiler☆227Updated 2 months ago
- A course on homotopy theory and type theory, taught jointly with Jaka Smrekar☆301Updated last year
- Staged compilation with dependent types☆177Updated 2 months ago
- Functional teaching language for use in a discrete mathematics course☆169Updated last month
- A small implementation of higher-order unification☆189Updated 7 years ago
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆222Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- Minimal implementations for dependent type checking and elaboration☆685Updated last month
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆242Updated 4 months ago