Miranda
It features terse syntax using the offside rule for indentation. The type of an expression is inferred from the source by the compiler but explicit type declarations are also allowed. Nested pattern-matching, list comprehensions, modules. Operator sections rather than lambda abstractions. User types are algebraic, and in early versions could be constrained by laws. Implemented by SKI combinator reduction. The KAOS operating system is written entirely in Miranda.
E-mail: Translators from Miranda to Haskell (mira2hs) and to LML (mira2lml) are available, ftp://www.foldoc.org/pub/. Non-commercial near-equivalents of Miranda include Miracula and Orwell. ["Miranda: A Non Strict Functional Language with Polymorphic Types", D.A. Turner, in Functional Programming Languages and Computer Architecture, LNCS 201, Springer 1985]. ["Functional Programming with Miranda", Ian Holyer, Pitman Press 0-273-03453-7]. (1997-08-01) ![]()

