Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 beta 3/9/83; site uf-csv.UUCP
Path: utzoo!watmath!clyde!bonnie!akgua!uf-csv!jnw
From: jnw@uf-csv.UUCP (Joseph N. Wilson)
Newsgroups: net.lang
Subject: Berkeley FP question
Message-ID: <137@uf-csv.UUCP>
Date: Mon, 19-Nov-84 15:41:53 EST
Article-I.D.: uf-csv.137
Posted: Mon Nov 19 15:41:53 1984
Date-Received: Wed, 28-Nov-84 04:29:49 EST
Organization: University of Florida CIS dept.
Lines: 20

["Laugh while you can monkey boy."]

On page 29 of the Berkeley FP Users Manual, Rev. 4.1 I find the sentence

>>	The binary-to-unary functions [sic] ('bu') has been omitted.

No explanation or illuminating commentary is offered.  It doesn't appear
to me to be all that complex to implement 'bu'. Am I missing something subtle?
Or is it the case that the Berkeley implementors didn't feel this sort of
function is useful?

While we're on this subject, I wonder why Backus includes the function
'bu' when a more general currying function might be desirable.

Any comments?

 joe "If only Alex Colvin was here I wouldn't have had to ask" wilson
 Univ. of Florida
 CIS dept.
 USENET: ...akgua!uf-csv!jnw   CSNET: jnw@ufl   ARPANET: jnw.ufl@csnet-relay