Category:Ela: Difference between revisions

From Rosetta Code
Content added Content deleted
No edit summary
(external link)
 
(4 intermediate revisions by 3 users not shown)
Line 3: Line 3:
|site=http://code.google.com/p/elalang/
|site=http://code.google.com/p/elalang/
|gc=yes
|gc=yes
|strength=strong
|safety=safe
|checking=dynamic
|checking=dynamic
|express=implicit
|compat=duck
|parampass=value
}}
}}
{{language programming paradigm|functional}}
{{language programming paradigm|functional}}
Ela is a high-level functional language. Ela supports both strict and non-strict evaluation but is strict by default. Ela has an [[ML]]-style syntax with several features borrowed from [[Haskell]] (where-bindings, function definition by pattern matching, etc.).
[http://elalang.net/ 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), and 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]].
Ela runs on its own virtual machine but currently requires [[.NET]] or [[Mono]].

Latest revision as of 15:46, 16 March 2016

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), and 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.