Egison is a programming language that features extensible efficient non-linear pattern matching with backtracking for non-free data types.
We can directly represent pattern matching for a wide range of data types including lists, multisets, sets, trees, graphs, and mathematical expressions.
Egison makes programming dramatically simple!
Egison proposes a new paradigm pattern-match-oriented. The combination of all of the following features enables intuitive powerful pattern matching.
Egison allows programmers to use tensor index notation including the support for differential forms.
Egison introduces two types of parameters, scalar and tensor parameters, and a set of simple index reduction rules for that.
Please refer this cheat sheet when you write Egison programs.
We aim at intuitive representation of algorithms and formalization of human recognitions.
We believe this is the shortest way to the artificial intelligence.