- From: Adrian Paschke <adrian.paschke@gmx.de>
- Date: Thu, 16 Apr 2009 20:38:36 +0200
- To: "'Gary Hallmark'" <gary.hallmark@oracle.com>
- Cc: "'RIF WG'" <public-rif-wg@w3.org>
Why not simply support the typical list built-ins of ISO Prolog. They are supported by most rule engines which provide support for lists. -Adrian -----Ursprüngliche Nachricht----- Von: public-rif-wg-request@w3.org [mailto:public-rif-wg-request@w3.org] Im Auftrag von Dave Reynolds Gesendet: Donnerstag, 16. April 2009 14:56 An: Gary Hallmark Cc: RIF WG Betreff: Re: action-743: list builtins Gary Hallmark wrote: > are enumerated briefly at > http://www.w3.org/2005/rules/wiki/Lists#List_Builtins An alternative to the collection of aggregation operators might be to have map/reduce functions which take a list and the iri of a unary/binary function. That would be one way to allow fairly general list processing while ensuring finite termination. Dave
Received on Thursday, 16 April 2009 18:39:13 UTC