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

Programming LanguagesDan Grossman Mutual Recursion Mutual Recursion Allow f to call g and g to call f Useful? Yes. Idiom we will show: implementing state machines The problem: ML’s bindings-in-order rule for environments Fix #1: Special new language construct Fix #2: Workaround using higher-order functions 2 Dan Grossman, Programming Languages New language features Mutually recursive functions (the and keyword) Similarly, mutually recursive datatype bindings Everything in “mutual recursion bundle” type-checked together and can refer to each other 3 Dan Grossman, Programming Languages fun f1 p1 = e1 and f2 p2 = e2 and f3 p3 = e3 datatype t1 = … and t2 = … and t3 = … State-machine example Each “state of the computation” is a function “State transition” is “call another function” with “rest of input” Generalizes to any finite-state-machine example 4 Dan Grossman, Programming Languages fun state1 input_left = … and state2 input_left = … and … Work-around Suppose we did not have support for mutually recursive functions Or could not put functions next to each other Can have the “later” function pass itself to the “earlier” one Yet another higher-order function idiom 5 Dan Grossman, Programming Languages fun earlier (f,x) = … f y … … (* no need to be nearby *) fun later x = … earlier(later,y) …