aradarbel10
/ Main.hs
Created
December 6, 2022 15:40
A minimalistic example of bidirectional type checking for system F
This file contains hidden or 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 StrictData, DerivingVia, OverloadedRecordDot #-} | |
| {- | |
| (compiled with GHC 9.4.2) | |
| -} | |
| {- | |
| HEADS UP | |
| this is an example implementation of a non-trivial type system using bidirectional type checking. | |
| it is... |
neel-krishnaswami
/ pcomb.ml
Last active
September 6, 2023 13:43
A linear-time parser combinator library in Ocaml
This file contains hidden or 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
| module C : sig | |
| type t | |
| val empty : t | |
| val one : char -> t | |
| val union : t -> t -> t | |
| val inter : t -> t -> t | |
| val top : t | |
| val mem : char -> t -> bool | |
| val make : (char -> bool) -> t | |
| val equal : t -> t -> bool |
OlderNewer