Michael Lazear lazear
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // A simple Lexer meant to demonstrate a few theoretical concepts. It can | |
| // support several parser concepts and is very fast (though speed is not its | |
| // design goal). | |
| // | |
| // J. Arrieta, Nabla Zero Labs | |
| // | |
| // This code is released under the MIT License. | |
| // | |
| // Copyright 2018 Nabla Zero Labs | |
| // |
lexi-lambda
/ Main.hs
Last active
July 5, 2023 18:01
Minimal Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| {-# LANGUAGE GeneralizedNewtypeDeriving #-} | |
| module Language.HigherRank.Main | |
| ( Expr(..) | |
| , EVar(..) | |
| , Type(..) | |
| , TVar(..) | |
| , TEVar(..) | |
| , runInfer | |
| ) where |