Last active
June 25, 2019 23:58
-
-
Save n-hansen/e15b0a774f9fb53da36df70562462d89 to your computer and use it in GitHub Desktop.
Constrained Trees
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 PolyKinds #-} | |
{-# LANGUAGE UndecidableInstances #-} | |
{-# LANGUAGE GADTs #-} | |
{-# LANGUAGE DataKinds #-} | |
{-# LANGUAGE FlexibleContexts #-} | |
{-# LANGUAGE FlexibleInstances #-} | |
{-# LANGUAGE TypeOperators #-} | |
{-# LANGUAGE TypeFamilies #-} | |
{-# LANGUAGE TypeOperators #-} | |
{-# LANGUAGE MultiParamTypeClasses #-} | |
{-# LANGUAGE FunctionalDependencies #-} | |
module ConstraintTrees where | |
import Data.Type.Equality | |
type family If (p :: Bool) (a :: k) (b :: k) :: k where | |
If 'True a b = a | |
If 'False a b = b | |
type family Remove (k :: a) (ks :: [*]) :: [*] where | |
Remove k (l ': ls) = If (k == l) ls (l ': Remove k ls) | |
type family (xs :: [*]) :++ (ys :: [*]) :: [*] where | |
'[] :++ as = as | |
(a ': as) :++ bs = as :++ (a ': bs) | |
data ConstraintTree requires provides x where | |
Leaf :: ConstraintTree '[] '[] x | |
BlankNode :: x | |
-> ConstraintTree reqA provA x | |
-> ConstraintTree reqB provB x | |
-> ConstraintTree (reqA :++ reqB) (provA :++ provB) x | |
ReqNode :: req | |
-> x | |
-> ConstraintTree reqA provA x | |
-> ConstraintTree reqB provB x | |
-> ConstraintTree (req ': (reqA :++ reqB)) (provA :++ provB) x | |
ProvNode :: prov | |
-> x | |
-> ConstraintTree reqA provA x | |
-> ConstraintTree reqB provB x | |
-> ConstraintTree (reqA :++ reqB) (prov ': (provA :++ provB)) x | |
class ValidTree a where | |
validate :: a -> a | |
validate = id | |
instance ValidTree (ConstraintTree '[] '[] x) | |
instance ValidTree (ConstraintTree (Remove p rs) ps x) => ValidTree (ConstraintTree rs (p ': ps) x) | |
data Foo = Foo | |
data Bar = Bar | |
data Baz = Baz | |
tree1 = validate $ | |
BlankNode "a" | |
( ReqNode Foo "b" | |
(ProvNode Foo "c" Leaf Leaf) | |
(BlankNode "d" (ReqNode Bar "e" Leaf Leaf) Leaf) | |
) | |
(ProvNode Bar "f" Leaf Leaf) | |
-- `validate tree2` will fail to typecheck, due to the unmet requirement of Baz | |
tree2 = -- validate $ | |
BlankNode "a" | |
( ReqNode Foo "b" | |
(ProvNode Foo "c" Leaf Leaf) | |
(BlankNode "d" (ReqNode Bar "e" Leaf Leaf) Leaf) | |
) | |
( ProvNode Bar "f" Leaf | |
(ReqNode Baz "g" Leaf Leaf) | |
) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment