egi

5 ms·

1.
by egi 8y ago
Which syntax sugar do you think verbose? I don't think Egison has lots of syntax sugar. Egison features a customizable pattern-matching facility. Pattern-matching methods for each data type and pattern can be customizable by users. The
2.
by egi 8y ago
Thank you for your comment! I started to implement a computer algebra system as a killer application of customizable pattern matching of Egison. It allows users to customize the pattern-method for mathematical expressions from more primitiv
3.
by egi 8y ago
Which syntax sugar do you think verbose? I don't think Egison has lots of syntax sugar.
4.
by egi 8y ago
The calculus for differential forms is a part of Geometric algebra, so I think there is a relation. Egison's strong point is it can handle tensor-valued p-forms due to its ability to handle both of tensor index notation and differentia
5.
by egi 8y ago
Thank you for your interest! Here is a link for a new paper that discusses the integration of tensor index notation including the support for differential forms. https://arxiv.org/abs/1804.03140
6.
by egi 8y ago
Thank you for your comment! The power of Egison's pattern matching becomes more obvious when we consider more general pattern such as (p, p+ 100) not only (p, p+2). We can write the first 5 prime pairs whose form is (p, p+100) with a s
7.
Show HN: A Ruby gem for very strong pattern-matching(github.com)
1 points by egi 12y ago|0 comments
8.
by egi 12y ago
I wrote my answer. 1- I'm sorry but I don't know materials for the baby steps to implement pattern matching. However, I think it is not so difficult to compile ordinary pattern matching expression into many nested if expressions,
9.
by egi 12y ago
I'm sorry but I think if you would like to implement a language not only use it, it would be better to learn lisp at first. It is very easy to implement lisp on lisp and modify it as you like. This is an scheme interpreter I wrote in s
10.
by egi 12y ago
Thank you for letting me to know about this issue. I noticed this problem for the first time. Our implementation of lazy evaluation is not straight wrap of Haskell. I'll look into about this.
11.
by egi 12y ago
Why do you think so? I've created Egison not for text processing, but I think text processing is important application of pattern matching and I'd like to do work for that in future.
12.
by egi 12y ago
The biggest difference is Egison realizes non-linear pattern matching against unfree data types such as multisets and sets. I've wrote brief comparison here. https://github.com/egison/egison#comparison-with-related
13.
by egi 12y ago
If you install egison on your machine, ctrl-c should work on your machine. However, ctrl-c does not work online egison currently.
14.
by egi 12y ago
At first, I tried to extend the existing language. However, it was difficult because implementation of the Egison pattern-matching has big influence for whole design of a programming language. I wrote answers for this question and other fre
15.
by egi 12y ago
Thanks! I've fixed that just now.
16.
by egi 12y ago
What you wrote is what I wanted to write. We call the Egison command on the server limiting code with side-effects via an API server implemeted in Ruby. All source code on Egison including its website is on GitHub. Please check them, too.
17.
by egi 12y ago
Thank you. We are providing only an interpreter now. Egison is not fast and we don't provide benchmark yet. The development of Egison is currently sponsored by Rakuten and Rakuten Institute of Technology, but a current active developer
18.
by egi 12y ago
I read a slide on OMeta. http://tinlizzie.org/ometa/dls07-slides.pdf Its pattern matching is specialized in expressing pattern matching against lists and trees. Egison aims intuitive expression for a wider range of dat
19.
by egi 12y ago
I believe Egison has provided good syntax and semantics for that. We have demonstration pages of various Egison programs that you can edit and run online. Please check them too. http://www.egison.org/demonstrations/poke
20.
by egi 12y ago
No. I don't refer to the Pattern Calculus when I've implemented Egison. I've implemented Egison to realize non-linear pattern matching against unfree data types such as sets and multisets. The Pattern Calculus seems not for t
21.
by egi 12y ago
The creator of the language here, ask me anything. Please check my paper recently I put on arXiv.org. http://arxiv.org/abs/1407.0729
22.
by egi 12y ago
Hello! I'm the creator of Egison. Would you tell me what your project like? I got an idea of Egison when I was working with logic expressions. Pattern-matching of the existing languages are not strong enough to do what I'd like to