程序语言设计-华盛顿大学equivalences.pptxVIP

Programming LanguagesDan Grossman Standard Equivalences Syntactic sugar Using or not using syntactic sugar is always equivalent By definition, else not syntactic sugar Example: But be careful about evaluation order 2 Dan Grossman, Programming Languages fun f x = if x then g x else false fun f x = x andalso g x fun f x = if g x then x else false fun f x = x andalso g x Standard equivalences Three general equivalences that always work for functions In any (?) decent language Consistently rename bound variables and uses But notice you can’t use a variable name already used in the function body to refer to something else 3 Dan Grossman, Programming Languages val y = 14 fun f x = x+y+x val y = 14 fun f z = z+y+z val y = 14 fun f x = x+y+x val y = 14 fun f y = y+y+y fun f x = let val y = 3 in x+y end fun f y = let val y = 3 in y+y end Standard equivalences Three general equivalences that always work for functions In (any?) decent language 2. Use a helper function or do not But notice you need to be careful about environments 4 Dan Grossman, Programming Languages val y = 14 fun f x = x+y+x fun g z = (f z)+z val y = 14 fun g z = (z+y+z)+z val y = 14 fun f x = x+y+x val y = 7 fun g z = (f z)+z val y = 14 val y = 7 fun g z = (z+y+z)+z Standard equivalences Three general equivalences that always work for functions In (any?) decent language Unnecessary function wrapping But notice that if you compute the function to call and that computation has side-effects, you have to be careful 5 Dan Grossman, Programming Languages fun f x = x+x fun g y = f y fun f x = x+x val g = f fun f x = x+x fun h () = (print hi; f) fun g y = (h()) y fun f x = x+x fun h () = (print hi; f) val g = (h()) One more If we ignore types, then ML let-bindings can be syntactic sugar for calling an anonymous function: These both evaluate e1 to v1, then evaluate e2 in an environment extended to map x to v1 So exa