面向敏捷虚拟企业的制造agent投标优化模型.pptVIP

Introduction to Compilation of Functional Languages Wanhe Zhang Computing and Software Department McMaster University 16th, March, 2004 Functional Programs Based on the idea that a program is a function with one input parameter, its input and one result, its output. Difference between functional and imperative language is efficiency consideration and readability. We can see that from the factorial function below: Difference between Func and Imperative Language Compilation of Functional Languages A short tour of Haskell Compiling functional languages Polymorphic type checking Desugaring Tour of Haskell Function application syntax: f 11 13 1)No bracket around the arguments, allows currying to be expressed naturally. 2)Function application binds stronger than any operator. g n+1 is (g n) + 1 rather than g (n+1) Tour of Haskell Offside rule Lists List comprehension Pattern matching Polymorphic typing Referential transparency Higher-order functions Lazy evaluation Offside rule Divide x 0 = inf Divide x y = x/y An equation consists of a left-hand side, followed by the = token, followed by the right-hand side. No explicit token to denote the end of each equation. If treats line break as the terminator is inconvenient. Offside rule controls the bounding box of an expression. Offside rule Everything below and to the right of the = token is defined to be part of the expression making up the right-hand side. The right-hand side terminates before the first token that is ‘offside’-to the left-of the = position. Lists The polymorphic typing of Haskell, does not allow lists to contain elements of different. [] [1,2,3,4] = (1:(2:(3:(4:[])))) [“red”, “yellow”] [1..10] List Comprehension Syntax that closely matches set notation. S = [n^2 | n - [1..100], odd n] List comprehension generates lists rather than sets: ordering is important and elements may occur multiple times in list comprehensions. It is convenient to use when generating new lists from old ones.