Category:Ela: Difference between revisions

From Rosetta Code
Content added Content deleted
m (More lang params from the LCT)
No edit summary
Line 11:
}}
{{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]].

Revision as of 20:33, 6 August 2012

Language
Ela
This programming language may be used to instruct a computer to perform a task.
Official website
Execution method: Compiled (bytecode)
Garbage collected: Yes
Parameter passing methods: By value
Type safety: Safe
Type strength: Strong
Type compatibility: Duck
Type expression: Implicit
Type checking: Dynamic
See Also:


Listed below are all of the tasks on Rosetta Code which have been solved using Ela.

Ela is a pure functional language. Ela supports both strict and non-strict evaluation but is strict by default. Ela has a layout based, Haskell style syntax. Features supported by Ela include first class functions, pattern matching, lazy evaluation, algebraic data types (including open algebraic data types), type classes. Ela runs on its own virtual machine but currently requires .NET or Mono.

Subcategories

This category has the following 3 subcategories, out of 3 total.