The Egison Programming Language

– Categorical Instinct Immediately with Primarily New Syntax –

Egison is a programming language that options extensible environment friendly non-linear sample matching with backtracking for non-free knowledge sorts.
We are able to straight characterize sample matching for a variety of information sorts together with lists, multisets, units, bushes, graphs, and mathematical expressions.
Egison makes programming dramatically easy!

— Extract all twin primes from the infinite record of prime numbers with sample matching!<br /> def twinPrimes :=<br /> matchAll primes as record integer with<br /> | _ ++ $p :: #(p + 2) :: _ -> (p, p + 2)</p> <p>— Enumerate first 10 twin primes.<br /> take 10 twinPrimes<br /> — => [(3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73), (101, 103), (107, 109)]

Sample-Match-Oriented

Egison proposes a brand new paradigm pattern-match-oriented.
The mixture of all the following options allows intuitive highly effective sample matching.

• Effectivity of the backtracking algoirthm for non-linear patterns
• Extensibility of sample matching
• Polymorphisim in patterns

Egison Pattern-Matching Paper

See Also

The Hidden Efficiency Price of NodeJS and GraphQL

On-line Demonstrations

Please attempt Egison’s authentic options.

• Sample Matching
• Laptop Algebra System