Modularity à la ML

Transcript

1. Modularity à la ML Ionuț G. Stan — igstan.ro — ionut@eloquentix.com
2. • Software Developer at • Worked with Scala for the past 5 years • FP, programming languages, compilers • Mostly-tech blog at igstan.ro About Me
3. Why ML?
4. Why ML
5. Why ML
6. A Taste of Standard ML
7. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map option f = case option of NONE => NONE | SOME a => SOME (f a) end
8. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map option f = case option of NONE => NONE | SOME a => SOME (f a) end
9. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map option f = case option of NONE => NONE | SOME a => SOME (f a) end
10. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map option f = case option of NONE => NONE | SOME a => SOME (f a) end
11. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map option f = case option of NONE => NONE | SOME a => SOME (f a) end
12. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f f = case option of NONE => NONE | SOME a => SOME (f a) end
13. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f option = case option of NONE => NONE | SOME a => SOME (f a) end
14. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f option = case option of NONE => NONE | SOME a => SOME (f a) end
15. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f option = case option of NONE => NONE | SOME a => SOME (f a) end
16. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f option = case option of NONE => NONE | SOME a => SOME (f a) end
17. $ sml - datatype 'a option = … NONE … | SOME of 'a; datatype 'a option = NONE | SOME of 'a - - fun map f option = … case option of … NONE => NONE … | SOME a => SOME (f a); val map = fn : ('a -> 'b) -> 'a option -> 'b option - - val a = SOME 1; val a = SOME 1 : int option - - map (fn a => a + 1) a; val it = SOME 2 : int option
18. $ sml - datatype 'a option = … NONE … | SOME of 'a; datatype 'a option = NONE | SOME of 'a - - fun map f option = … case option of … NONE => NONE … | SOME a => SOME (f a); val map = fn : ('a -> 'b) -> 'a option -> 'b option - - val a = SOME 1; val a = SOME 1 : int option - - map (fn a => a + 1) a; val it = SOME 2 : int option
19. $ sml - datatype 'a option = … NONE … | SOME of 'a; datatype 'a option = NONE | SOME of 'a - - fun map f option = … case option of … NONE => NONE … | SOME a => SOME (f a); val map = fn : ('a -> 'b) -> 'a option -> 'b option - - val a = SOME 1; val a = SOME 1 : int option - - map (fn a => a + 1) a; val it = SOME 2 : int option
20. $ sml - datatype 'a option = … NONE … | SOME of 'a; datatype 'a option = NONE | SOME of 'a - - fun map f option = … case option of … NONE => NONE … | SOME a => SOME (f a); val map = fn : ('a -> 'b) -> 'a option -> 'b option - - val a = SOME 1; val a = SOME 1 : int option - - map (fn a => a + 1) a; val it = SOME 2 : int option
21. $ sml - datatype 'a option = … NONE … | SOME of 'a; datatype 'a option = NONE | SOME of 'a - - fun map f option = … case option of … NONE => NONE … | SOME a => SOME (f a); val map = fn : ('a -> 'b) -> 'a option -> 'b option - - val a = SOME 1; val a = SOME 1 : int option - - map (fn a => a + 1) a; val it = SOME 2 : int option
22. $ sml - datatype 'a option = … NONE … | SOME of 'a; datatype 'a option = NONE | SOME of 'a - - fun map f option = … case option of … NONE => NONE … | SOME a => SOME (f a); val map = fn : ('a -> 'b) -> 'a option -> 'b option - - val a = SOME 1; val a = SOME 1 : int option - - map (fn a => a + 1) a; val it = SOME 2 : int option
23. $ sml - datatype 'a option = … NONE … | SOME of 'a; datatype 'a option = NONE | SOME of 'a - - fun map f option = … case option of … NONE => NONE … | SOME a => SOME (f a); val map = fn : ('a -> 'b) -> 'a option -> 'b option - - val a = SOME 1; val a = SOME 1 : int option - - map (fn a => a + 1) a; val it = SOME 2 : int option
24. $ sml - datatype 'a option = … NONE … | SOME of 'a; datatype 'a option = NONE | SOME of 'a - - fun map f option = … case option of … NONE => NONE … | SOME a => SOME (f a); val map = fn : ('a -> 'b) -> 'a option -> 'b option - - val a = SOME 1; val a = SOME 1 : int option - - map (fn a => a + 1) a; val it = SOME 2 : int option
25. $ sml - datatype 'a option = … NONE … | SOME of 'a; datatype 'a option = NONE | SOME of 'a - - fun map f option = … case option of … NONE => NONE … | SOME a => SOME (f a); val map = fn : ('a -> 'b) -> 'a option -> 'b option - - val a = SOME 1; val a = SOME 1 : int option - - map (fn a => a + 1) a; val it = SOME 2 : int option
26. Modules
27. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f option = case option of NONE => NONE | SOME a => SOME (f a) end
28. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f option = case option of NONE => NONE | SOME a => SOME (f a) end
29. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f option = case option of NONE => NONE | SOME a => SOME (f a) end
30. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f option = case option of NONE => NONE | SOME a => SOME (f a) end
31. structure Option = struct datatype 'a option = NONE | SOME of 'a fun map f option = case option of NONE => NONE | SOME a => SOME (f a) end
32. $ sml - use "option.sml"; - - val a = Option.SOME 1; val a = SOME 1 : int Option.option - - Option.map (fn a => a + 1) a; val it = SOME 2 : int Option.option
33. $ sml - use "option.sml"; - - val a = Option.SOME 1; val a = SOME 1 : int Option.option - - Option.map (fn a => a + 1) a; val it = SOME 2 : int Option.option
34. $ sml - use "option.sml"; - - val a = Option.SOME 1; val a = SOME 1 : int Option.option - - Option.map (fn a => a + 1) a; val it = SOME 2 : int Option.option
35. $ sml - use "option.sml"; - - val a = Option.SOME 1; val a = SOME 1 : int Option.option - - Option.map (fn a => a + 1) a; val it = SOME 2 : int Option.option
36. $ sml - use "option.sml"; - - val a = Option.SOME 1; val a = SOME 1 : int Option.option - - Option.map (fn a => a + 1) a; val it = SOME 2 : int Option.option
37. Functors
38. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
39. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
40. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
41. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
42. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
43. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
44. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
45. datatype order = LESS | EQUAL | GREATER
46. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
47. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
48. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
49. structure IntListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Int.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
50. structure StringListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case String.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
51. structure StringListSet = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case String.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
52. functor ListSet(Elem : ORD) = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
53. functor ListSet(Elem : ORD) = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
54. In Standard ML, a functor is a module-level function that takes a module as argument and produces a module as a result.
55. Note: There's no relationship between an SML functor and the Functor type-class as defined by the cats or scalaz libraries.
56. functor ListSet(Elem : ORD) = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
57. functor ListSet(Elem : ORD) = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
58. Signatures
59. functor ListSet(Elem : ORD) = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
60. functor ListSet(Elem : ORD) = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
61. functor ListSet(Elem : ORD) = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
62. functor ListSet(Elem : ORD) = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
63. signature ORD = sig type t val compare : t * t -> order end
64. signature ORD = sig type t val compare : t * t -> order end
65. signature ORD = sig type t val compare : t * t -> order end
66. signature ORD = sig type t val compare : t * t -> order end
67. A signature can be seen as the type of a module. It specifies the types and values that a module must define.
68. functor ListSet(Elem : ORD) = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
69. functor ListSet(Elem : ORD) : SET = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
70. functor ListSet(Elem : ORD) : SET = struct val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
71. signature SET = sig structure Key : ORD type t val empty : t val add : t -> key -> t end
72. signature SET = sig type t type key val empty : t val add : t -> key -> t end
73. signature SET = sig type t type key val empty : t val add : t -> key -> t end
74. signature SET = sig type t type key val empty : t val add : t -> key -> t end
75. signature SET = sig type t type key val empty : t val add : t -> key -> t end
76. signature SET = sig type t type key val empty : t val add : t -> key -> t end
77. signature SET = sig type t type key val empty : t val add : t -> key -> t end
78. functor ListSet(Elem : ORD) : SET = struct type t = Elem.t list type key = Elem.t val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
79. functor ListSet(Elem : ORD) : SET = struct type t = Elem.t list type key = Elem.t val empty = [] fun add set elem = case set of [] => [elem] | head :: tail => case Elem.compare (head, elem) of LESS => head :: (add tail elem) | EQUAL => set | GREATER => elem :: set end
80. structure IntOrd = struct type t = Int.int val compare = Int.compare end structure IntListSet = ListSet(IntOrd) structure StringListSet = ListSet(struct type t = String.string val compare = String.compare end)
81. structure IntOrd = struct type t = Int.int val compare = Int.compare end structure IntListSet = ListSet(IntOrd) structure StringListSet = ListSet(struct type t = String.string val compare = String.compare end)
82. structure IntOrd = struct type t = Int.int val compare = Int.compare end structure IntListSet = ListSet(IntOrd) structure StringListSet = ListSet(struct type t = String.string val compare = String.compare end)
83. Similarities with Scala?
84. Similarities Standard ML Scala
85. Similarities Standard ML Scala structure object
86. Similarities Standard ML Scala structure object signature trait
87. Similarities Standard ML Scala structure object signature trait functor class / def
88. Differences & Limitations
89. Limitations in SML
90. Limitations in SML Q If a functor is like a function, can we pass functors to functors, just like we can pass functions to functions?
91. Limitations in SML Q If a functor is like a function, can we pass functors to functors, just like we can pass functions to functions? A No. Standard ML does not have higher-order functors. OCaml and some other ML dialects have it, though.
92. Limitations in SML
93. Limitations in SML Q So we can't return functors from functors, either?
94. Limitations in SML Q So we can't return functors from functors, either? A No, we cannot in Standard ML.
95. Limitations in Scala
96. Limitations in Scala Q If Scala classes are the equivalent of SML functors, are they higher-order or not?
97. Limitations in Scala Q If Scala classes are the equivalent of SML functors, are they higher-order or not? A They're not. One cannot, save for reflection, pass classes as arguments to classes or produce classes from classes.
98. Limitations in SML
99. Limitations in SML Q In Scala, we can store objects in variables, pass them to functions or return them from functions. Does SML allow this with structures and functors?
100. Limitations in SML Q In Scala, we can store objects in variables, pass them to functions or return them from functions. Does SML allow this with structures and functors? A No. In Standard ML, modules are not first-class. Values and modules form two different, separate languages — the so- called core and module languages.
101. Limitations in SML
102. Limitations in SML Q Why aren't modules first-class values in Standard ML?
103. Limitations in SML Q Why aren't modules first-class values in Standard ML? A Let's see...
104. trait Ord { type T def compare(a: T, b: T): Int }
105. object IntOrd extends Ord { type T = Int def compare(a: T, b: T): Int = a - b }
106. trait Set { type T type K def empty: T def add(set: T, key: K): T }
107. class ListSet(val ord: Ord) extends Set { type K = ord.T type T = List[ord.T] def empty: T = List.empty def add(set: T, key: K): T = ??? }
108. object TwitterClient { object UserSet extends ListSet(UserOrd) def followers(username: String) = { val users: UserSet.T = UserSet.empty // add users and return them users } }
109. object TwitterClient { object UserSet extends ListSet(UserOrd) def followers(username: String) = { val users: UserSet.T = UserSet.empty // add users and return them users } }
110. object TwitterClient { object UserSet extends ListSet(UserOrd) def followers(username: String) = { val users: UserSet.T = UserSet.empty // add users and return them users } }
111. object TwitterClient { object UserSet extends ListSet(UserOrd) def followers(username: String) = { val users = UserSet.empty // add users and return them users } }
112. object TwitterClient { object UserSet extends ListSet(UserOrd) def followers(username: String) = { val users = UserSet.empty // add users and return them users } }
113. object TwitterClient { def followers(username: String) = { object UserSet extends ListSet(UserOrd) val users = UserSet.empty // add users and return them users } }
114. object TwitterClient { def followers(username: String) = { val userSet = new ListSet(UserOrd) val users = UserSet.empty // add users and return them users } }
115. object TwitterClient { def followers(username: String) = { val userSet = new ListSet(UserOrd) val users: UserSet.T = UserSet.empty // add users and return them users } }
116. object TwitterClient { def followers(username: String) = { val userSet = new ListSet(UserOrd) val users: userSet.T = UserSet.empty // add users and return them users } }
117. object TwitterClient { def followers(username: String): List[userSet.ord.T] forSome { val userSet: ListSet } = { val userSet = new ListSet(UserOrd) val users: userSet.T = UserSet.empty // add users and return them users } }
118. object TwitterClient { def followers(username: String): List[userSet.ord.T] forSome { val userSet: ListSet } = { val userSet = new ListSet(UserOrd) val users: userSet.T = UserSet.empty // add users and return them users } }
119. object TwitterClient { import scala.language.existentials def followers(username: String): List[userSet.ord.T] forSome { val userSet: ListSet } = { val userSet = new ListSet(UserOrd) val users: userSet.T = UserSet.empty // add users and return them users } }
120. object TwitterClient { import scala.language.existentials def followers(username: String): userSet.T forSome { val userSet: Set } = { val userSet = new ListSet(UserOrd) val users: userSet.T = UserSet.empty // add users and return them users } }
121. object TwitterClient { import scala.language.existentials def followers(username: String): Set#T = { val userSet = new ListSet(UserOrd) val users: userSet.T = UserSet.empty // add users and return them users } }
122. Limitations in SML Q Why aren't modules first-class values in Standard ML?
123. Limitations in SML Q Why aren't modules first-class values in Standard ML? A Having types as components of a signature seems to require the notion of dependent types if the language were to support first-class modules. Scala has path-dependent types.
124. Other Differences
125. Other Differences • SML's modules are not (mutually) recursive, while Scala's objects and classes are.
126. Other Differences • SML's modules are not (mutually) recursive, while Scala's objects and classes are. • Because objects, traits and classes are values, they're also types in Scala.
127. Other Differences • SML's modules are not (mutually) recursive, while Scala's objects and classes are. • Because objects, traits and classes are values, they're also types in Scala. • Objects come with a concept of this (open recursion), SML modules do not.
128. Other Differences • SML's modules are not (mutually) recursive, while Scala's objects and classes are. • Because objects, traits and classes are values, they're also types in Scala. • Objects come with a concept of this (open recursion), SML modules do not. • SML modules allow some sort of inheritance, but not overriding, as there's no this.
129. Dependency Injection
130. Dependency Injection
131. Dependency Injection • Functor params look a lot like constructor injection.
132. Dependency Injection • Functor params look a lot like constructor injection. • The Reader monad is usually advocated by FP people for doing "functional" DI.
133. Dependency Injection • Functor params look a lot like constructor injection. • The Reader monad is usually advocated by FP people for doing "functional" DI. • But Reader only injects values, not types.
134. Dependency Injection • Functor params look a lot like constructor injection. • The Reader monad is usually advocated by FP people for doing "functional" DI. • But Reader only injects values, not types. • A functor-like approach, i.e., constructor injection, is still useful.
135. Dependency Injection • Functor params look a lot like constructor injection. • The Reader monad is usually advocated by FP people for doing "functional" DI. • But Reader only injects values, not types. • A functor-like approach, i.e., constructor injection, is still useful. • Scala alternative: implicit params.
136. Dependency Injection • We should distinguish between:
137. Dependency Injection • We should distinguish between: • static dependencies: dependencies are known at compile-time. Employ constructor injection or type-classes (coherent implicit params).
138. Dependency Injection • We should distinguish between: • static dependencies: dependencies are known at compile-time. Employ constructor injection or type-classes (coherent implicit params). • dynamic dependencies: dependencies are known at runtime. Employ constructor injection, implicit params, Reader monad.
139. Scala's object system can and should be seen as a first-class module system.
140. Thank You!
141. Questions!