Building a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
-
Updated
Jan 11, 2021 - Haskell
Building a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
A typed, polyglot, functional language
Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficient LLVM IR.
Compositional type checking for Haskell
Support code for talk 'XXIst century shall be typed or not be'
A framework for natural language syntax and semantics based on type theory.
Simple implementation of ST LC type checker in Haskell
Masters Thesis, University of Oxford. Research project combining Calculating Compilers and Algebraic Effects using Haskell, supervised by Jeremy Gibbons. Presented work at the International Conference on Functional Programming Student Research Competition and the 7th South of England Regional Programming Languages Seminar.
This repository is meant to be a personal collection of implementations of the concepts from the TaPL(Types and Programming Languages) book.
An implementation of System F, System Fsub (F_{<:}) and Finter (F_∧)
An experimental type checker implementation
A playground Statix implementation
A repository dedicated to the derivation and implementation of type systems. Current system: Extended System F
A simple dependently typed programming language based on…
🚧 dependently typed functional language
Limited equirecursive types in Haskell
Haskell implementation of languages found in "Types and Programming Languages" book
Add a description, image, and links to the type-system topic page so that developers can more easily learn about it.
To associate your repository with the type-system topic, visit your repo's landing page and select "manage topics."