Talk:Set Language

From Esolang
Jump to navigation Jump to search

You might also want to look at my (implemented) spl which also has sets as primitives, but also has others. soundandfury 23:08, 5 October 2009 (UTC)

It seems to only have finite sets. I think that makes it rather different than mine. DanielLC 04:53, 6 October 2009 (UTC)
As for these infinite sets, I think the only way you could do those is by having lazy evaluation, which basically means that your infinite sets are chains of callback functions which ultimately tell you, for a given x, whether x is in S. It would be possibly the most inefficient language ever, with one exception: once you have sets, you're just asking for groups, rings and modules. (I actually wrote a few bits of a groups API in C once, as a caricature of excessive abstraction) soundandfury 10:54, 31 December 2009 (UTC)
I do infinite sets with infinite memory. It can't be implemented on a regular computer. For example, I could use the for function to check to see if something ever halts, or to see if it's possible to prove or disprove something. I might be able to simulate it, where it will tend to work, but some programs just crash. --(this comment by DanielLC at 05:31, 6 December 2010 UTC; please sign your comments with ~~~~)

A sequence is formally defined as function whose domain is set of natural numbers. 07:07, 17 December 2009 (UTC)

So, how do I do ordered pairs? If I just do {a,b}, it would get confused for {b,a}. Do I do {a,{a,b}}? Thanks. DanielLC 05:31, 6 December 2010 (UTC)
Never mind. I just noticed the Hyper Set Language answers that question. I made a language good enough for someone to base theirs off of it. Yay! DanielLC 05:33, 6 December 2010 (UTC)