2 ms·
Amazing work nonetheless, I'm looking at slide 50 now. Very interesting concept. I had to google "unfree data types". This seems to refer to data types that ar
by innguest 12y ago
Amazing work nonetheless, I'm looking at slide 50 now. Very interesting concept.
I had to google "unfree data types". This seems to refer to data types that are unstructured and therefore no one thought of a way to represent in syntax. For instance we can ask if the first item of a list (a structured data type) is equal to the last, but we do not have good syntax (nor semantics) to ask what are the pairs that occur in a collection. That's why we keep having to translate between those structures in order to do some operations or ask certain questions.
Very cool stuff.
- egi 12y agoI 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/poker-hands.html http://www.egison.org/demonstrations/poker-hands.html
- deleted 12y ago[deleted]