Ailrun / core-lang-haskell
Implementation for the book <Implementing functional languages: a tutorial>
☆32Updated 6 years ago
Alternatives and similar repositories for core-lang-haskell:
Users that are interested in core-lang-haskell are comparing it to the libraries listed below
- My portfolio contains a lexer generator, a parser generator, my own λProlog interpreter, and several meta-theorems for the propositional …☆14Updated 2 months ago
- ☆10Updated last year
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Code from/to the book S.L.Peyton Jones, D.Lester: Implementing Functional Languages. A Tutorial, 1992☆33Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- The Software Foundations book, in GHC☆82Updated 3 months ago
- Types and Programming Languages☆38Updated 10 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Notes on higher-order typed compilation. Probably wrong☆23Updated 2 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- ☆17Updated 10 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- A verified compiler for a lazy functional language☆35Updated this week
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A Coq library for parametric coinduction☆47Updated 2 months ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated 2 months ago
- Dependently Typed Lambda Calculus in Haskell☆114Updated 4 years ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆117Updated 3 years ago
- Type inference for 'type level computation one step at a time'☆12Updated 7 years ago
- The MLPolyR programming language, revived☆24Updated 4 years ago
- ☆12Updated last year
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 6 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A collection of Notes on GHC☆69Updated 6 years ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆124Updated 10 months ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago