- From: Michael Kifer <kifer@cs.sunysb.edu>
- Date: Wed, 09 Jan 2008 12:09:59 -0500
- To: Sandro Hawke <sandro@w3.org>
- Cc: public-rif-wg@w3.org
If the order of arguments is fixed, then it is easy. But the order of arguments is not fixed in BLD, and this is cumbersome. --michael > How hard is it to translate from BLD with named-argument uniterms to BLD > without them, or to various rule languages without them? Is this > basically syntactic sugar, or is it pretty hard? > > If it's hard, I don't think it's appropriate to include named-argument > uniterms in BLD, as much as I happen to personally like them. > > Specifically, can someone provide a translation algorithm and example? > > -- Sandro > >
Received on Wednesday, 9 January 2008 17:10:21 UTC