Category:Egison: Difference between revisions
Content added Content deleted
(initial commit) |
|||
| Line 11: | Line 11: | ||
'''Egison''' is the programming langugage that realized non-linear pattern-matching against unfree data types. With Egison, we can represent pattern-matching with unfree data types intuitively. |
'''Egison''' is the programming langugage that realized non-linear pattern-matching against unfree data types. With Egison, we can represent pattern-matching with unfree data types intuitively. |
||
For example, we can represent pattern-matching against lists, multisets, sets, trees, and graphs. |
For example, we can represent pattern-matching against lists, multisets, sets, trees, and graphs. |
||
==Citations== |
|||
* [[http://hackage.haskell.org/package/egison|Hackage:egison]] |
|||
Revision as of 02:38, 24 January 2014
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Garbage collected: | Yes |
|---|---|
| Type safety: | Safe |
| Type strength: | Strong |
| Type compatibility: | Structural |
| Type checking: | Dynamic |
| See Also: |
Egison is the programming langugage that realized non-linear pattern-matching against unfree data types. With Egison, we can represent pattern-matching with unfree data types intuitively. For example, we can represent pattern-matching against lists, multisets, sets, trees, and graphs.
Pages in category "Egison"
The following 8 pages are in this category, out of 8 total.