VictorTaelin / abstract-algorithmLinks
Optimal evaluator of λ-calculus terms.
☆281Updated 2 years ago
Alternatives and similar repositories for abstract-algorithm
Users that are interested in abstract-algorithm are comparing it to the libraries listed below
Sorting:
- A minimal proof language.☆209Updated 6 years ago
- Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.☆115Updated 8 years ago
- A categorical programming language with effects☆284Updated 2 years ago
- A bare-bones calculus-of-constructions☆380Updated 3 years ago
- Dependent type checker using normalisation by evaluation☆268Updated last year
- Frank compiler☆299Updated last year
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆384Updated last year
- Compiling to Categories☆455Updated last year
- Programming language agnostic type construction language based on polynomials.☆370Updated last year
- Resources for type theory, functional programming, etc.☆320Updated 4 years ago
- Spartan type theory☆271Updated 3 weeks ago
- Standard library for linear types in Haskell.☆350Updated 3 months ago
- Demo for high-performance type theory elaboration☆568Updated last year
- Relational programming in Haskell. Mostly developed on twitch.☆266Updated last year
- An implementation of the Formality language in JavaScript☆71Updated 6 years ago
- The LLVM LHC Haskell Optimization System☆202Updated 5 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆633Updated 4 months ago
- Parser combinators for Idris☆244Updated 6 years ago
- Functional programming with fewer indirections☆771Updated 5 years ago
- GRIN backend for GHC☆144Updated 3 years ago
- Classic Algorithm W for type inference.☆254Updated 15 years ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆119Updated 4 years ago
- An implementation of Pie in Haskell☆210Updated 5 years ago
- The cuteness implementation of a dependently typed language.☆193Updated 2 years ago
- A small implementation of higher-order unification☆191Updated 8 years ago
- Software Foundations in Idris☆456Updated 6 years ago
- A minimalistic, elegant and powerful approach to working with graphs in a functional programming language☆197Updated 4 years ago
- Examples of Dependently-typed programs in Haskell☆307Updated 2 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- A simple expressions language with polymorphic extensible row types.☆303Updated 2 years ago