|
|
|
}}
{{language programming paradigm|functional}}
Ela is a high-levelpure functional language. Ela supports both strict and non-strict evaluation but is strict by default. Ela has ana layout based, [[MLHaskell]]- style syntax. withFeatures severalsupported featuresby borrowedEla frominclude [[Haskell]]first (where-bindingsclass functions, function definition by pattern matching, etc.lazy evaluation, algebraic data types (including open algebraic data types), type classes.
Ela is an impure functional language and provides a support for side effects. However it is primary oriented towards pure functional programming styles. Features supported by Ela include first class functions, pattern matching, lazy evaluation, variants.
Ela runs on its own virtual machine but currently requires [[.NET]] or [[Mono]].
|