Elements of ML ProgrammingThis book offers both an accurate, step-by-step introductory tutorial on ML programming and a complete reference to advanced features. It also features a description of SML/NJ, an ML dialect used with UNIX. The material is arranged so that it may be used in a number of courses, different settings, for class discussion or self-study. It takes a practical approach, applicable for sophomores through grad students, sets a reasonable pace without assuming previous knowledge of ML or functional programming. The book can also be used as supplement or reference for programming language concepts, sophisticated functional programming, or compiler courses. |
Contents
A Perspective on ML and SMLNJ | 1 |
Expressions | 7 |
Type Consistency | 14 |
Copyright | |
25 other sections not shown
Other editions - View all
Common terms and phrases
andalso apply array BadM binary search tree binary tree binding bool Boolean character component compute data constructors datatype declarations define definition delete deletemin digits empty list empty tree environment equality type evaluate Example exception function comb function F function that takes functor handle hash table higher-order functions identifier implementations inductive infix operator input insert instream int list integer keyword label btree languages left subtree let-expression list of elements lookup match mergeSort mutually recursive node operand orelse pair parameters parentheses Pascal pattern polymorphic polynomial precedence preorder produces raise recursive call represented result returns right subtree root side-effects signature SiMapping SML/NJ Solution to Exercise Solutions for Chapter Standard ML string btree string list structure syntactic category T₁ tail takes a list tuple type int type variables UNIX val-declaration Write a function ㅁㅁ