Fri, 11 Dec 2009 17:28:01 -0800 (PST)

Related articles |
---|

Research about better integrating sets with languages bennu.strelitzia@gmail.com (Bennu Strelitzia) (2009-12-04) |

Re: Research about better integrating sets with languages preston.briggs@gmail.com (preston.briggs@gmail.com) (2009-12-11) |

From: | "preston.briggs@gmail.com" <preston.briggs@gmail.com> |

Newsgroups: | comp.compilers |

Date: | Fri, 11 Dec 2009 17:28:01 -0800 (PST) |

Organization: | Compilers Central |

References: | 09-12-006 |

Keywords: | design |

Posted-Date: | 12 Dec 2009 12:18:52 EST |

On Dec 4, 7:11 am, Bennu Strelitzia <bennu.strelit...@gmail.com>

wrote:

*> Am interested in pointers to any of the following computer language*

*> research or implementations:*

*>*

*> * Set abstractions and operations including infinite, realizing the*

*> impossibility of any complete implementation of such infinite sets, but*

*> undaunted in the desire to still implement, for example, many natural*

*> useful infinite sets, i.e. the set of integers, the set of X-collated*

*> lists, etc. ...*

*> [Well, there's always SETL. -John]*

SETL's cool, but only for finite sets. For infinite sets, check out

CM Lisp for ideas. Though I know of no implementation, sadly.

Preston

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.