1.Previous
3.Next

that will accept the second, and so on. Recursive functions require so the function name is in scope within its body. The syntax for an anonymous function is similar to lambda calculus, with for lambda and separating arguments from the expression:

Lists use semicolons between elements. and are built-in functions that return the head and tail; is cons (prepend); is append. Functions like are polymorphic--ML uses generic type variables (, , etc.) to express this:

Mutable variables

1.Previous
3.Next