Copy Link
Add to Bookmark
Report
AIList Digest Volume 8 Issue 037
AIList Digest Thursday, 4 Aug 1988 Volume 8 : Issue 37
Queries:
Moral Sciences?
Attendees of ECCE
Church's Y-operator
D.Goldberg Adress
----------------------------------------------------------------------
Date: 2 Aug 88 20:18:42 GMT
From: sdcc6!calmasd!jnp@ucsd.edu (John Pantone)
Subject: Moral Sciences?
Re: the recent Kyoto prizes. (Japanese "Nobel"s)
I notice that one category was Creative Arts and Moral Sciences.
I understand the Creative Arts part - but I cannot imagine what Moral
Sciences could mean. Would someone who knows what the Kyoto
prize-givers are describing please enlighten me?
Please e-mail.
--
These opinions are solely mine and in no way reflect those of my employer.
John M. Pantone @ GE/Calma R&D, 9805 Scranton Rd., San Diego, CA 92121
...{ucbvax|decvax}!sdcsvax!calmasd!jnp jnp@calmasd.GE.COM GEnie: J.PANTONE
------------------------------
Date: 2 Aug 88 21:27:22 GMT
From: mcvax!unido!cosmo!JS%cosmo.UUCP@uunet.uu.net (Juergen Seeger)
Subject: Attendees of ECCE
Has anyone participated at the ECCE-Conference in Suisse
last weekend?
If so, please send a message to
JS@cosmo
------------------------------
Date: Wed, 3 Aug 88 09:16 EDT
From: GODDEN%gmr.com@RELAY.CS.NET
Subject: Church's Y-operator
In the new >Lisp and Symbolic Computation< vol.1, no.1 Gabriel and Pitman
make reference to "the Y operator" (p.85). There is also a reference
to it in a footnote in "The Art of the Interpreter" by Steele and Sussman
where they supply a pointer to McCarthy "History of LISP", ACM SIGPLAN
Notices, Aug. 78. McCarthy refers to "Church's Y-operator". I've been
scanning through Church's >The Calculi of Lambda-Conversion< but have
been unable to find any mention of it (alas, Church has no index). Can
anyone help direct me to where this is originally discussed by Church?
Perhaps it appears in some other work of Church? FYI: The Y operator,
defined in a Scheme-like language is:
(defun y (f)
((lambda (g) (lambda (h) ((f (g g)) h)))
(lambda (g) (lambda (h) ((f (g g)) h)))))
Interesting, huh? You can use it to implement recursive procedures
even when your interpreter does not explicitly support recursion.
Thus, to calculate 6! recursively, it could be invoked as
((y (lambda (fn)
(lambda (x)
(if (zerop x) 1 (* x (fn (- x 1)))))))
6)
-Kurt Godden
godden@gmr.com
------------------------------
Date: Wed, 03 Aug 88 12:28:40
From: Perfecto Herrera Boyer <D4PBPHB2%EB0UB011.BITNET@MITVMA.MIT.EDU>
Subject: D.Goldberg Adress
Dear Colleagues:
Could anybody send me the adress of Dr. D. Goldberg ? The only
available information I possess to identify him is that his Ph. D.
dissertation was called "Computer-aided gas pipeline operation
using genetic algorithms and rule learning" (1983 at the University
of Michigan). (I am interested in receiving that thesis). Please,
send the adress to my e-mail adress D4pbphb2@eb0ub011.
Thank you.
------------------------------
End of AIList Digest
********************
