A typed, polyglot, functional language
-
Updated
May 10, 2024 - Haskell
A typed, polyglot, functional language
A framework for natural language syntax and semantics based on type theory.
An experimental type checker implementation
Support code for talk 'XXIst century shall be typed or not be'
This repository is meant to be a personal collection of implementations of the concepts from the TaPL(Types and Programming Languages) book.
Simple implementation of ST LC type checker in Haskell
An implementation of the toy fb-lang
A playground Statix implementation
Building a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
A gradually typed language with intersection types
Programming work for my Senior Initiative project
Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficient LLVM IR.
🚧 dependently typed functional language
Alcuni appunti sul libro "Thinking With Types", di Sandy Maguire
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.
An implementation of System F, System Fsub (F_{<:}) and Finter (F_∧)
Limited equirecursive types in Haskell
Haskell implementation of languages found in "Types and Programming Languages" book
A repository dedicated to the derivation and implementation of type systems. Current system: Extended System F
Camille is an interpreted yet statically-typed programming language implemented in Haskell.
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."