| Ml Programming Language |
Website Links For Programming |
Information AboutMl Programming Language |
| CATEGORIES ABOUT ML PROGRAMMING LANGUAGE | |
| functional languages | |
| imperative programming languages | |
| ml programming language family | |
| statically-typed programming languages | |
|
ML is often referred to as an impure functional language, because it permits Side-effect s, and therefore Imperative Programming , unlike purely functional programming languages such as Haskell . Features of ML include a call-by-value Evaluation Strategy , first class Function s, automatic memory management through Garbage Collection , parametric Polymorphism , static Typing , Type Inference , Algebraic Data Types , Pattern Matching , and Exception Handling . Unlike Haskell, ML uses eager evaluation, which means that all subexpressions are always evaluated. One result of this is that you cannot use infinite lists per se. However, lazy evaluation and hence infinite lists can be simulated, through use of anonymous functions. Today there are several languages in the ML family; the two major dialects are Standard ML and Caml , but others exist, including F# - an open research project that targets the Microsoft .NET platform. Ideas from ML have influenced numerous other languages, such as Haskell , Cyclone , and Nemerle . ML's strengths are mostly applied in language design and manipulation (compilers, analyzers, theorem provers), but it is a general-purpose language also used in bioinformatics, financial systems, and applications including a genealogical database, a peer-to-peer client/server program, etc. EXAMPLES OF ML Anatomy of a ML function The "Hello World" of functional languages is the Factorial function. Expressed as pure ML: fun fac : (fn: int -> int) 0 = 1 | ||
| Fac N | n fac(n-1) |
|
|