|new language syntax firstname.lastname@example.org (Aleksey Beregov) (2001-08-24)|
|Re: new language syntax email@example.com (2001-08-25)|
|Re: new language syntax firstname.lastname@example.org (2001-08-25)|
|Re: new language syntax email@example.com (2001-09-21)|
|Re: new language syntax firstname.lastname@example.org (HSM) (2001-09-25)|
|Re: new language syntax email@example.com (Ralph Boland) (2001-09-26)|
|Re: new language syntax firstname.lastname@example.org (Joachim Durchholz) (2001-10-06)|
|Re: new language syntax email@example.com (2001-10-20)|
|[1 later articles]|
|From:||firstname.lastname@example.org (Hans Aberg)|
|Date:||25 Aug 2001 13:24:58 -0400|
|Posted-Date:||25 Aug 2001 13:24:58 EDT|
Aleksey Beregov" <email@example.com> wrote:
>I am developing the syntax for a language which should [must] be very
>suitable for working with sets, collections and other aggregate types.
>If somebody has an experience or ideas in this field send me please
One way to go is to identify sets with certain types of predciates as in
CLP (Prolog style languages). Axiomatic set theory roughly says that a
"class" can be gotten from a predicate by letting the variables run over
sets. Then a set is a class that is a member of another class.
FAQ of newsgroup comp.constraints.
Hans Aberg * Anti-spam: remove "remove." from email address.
* Email: Hans Aberg <firstname.lastname@example.org>
* Home Page: <http://www.matematik.su.se/~haberg/>
* AMS member listing: <http://www.ams.org/cml/>
Return to the
Search the comp.compilers archives again.