1.)
Does anybody know of (a set of) combinators describing the data flow
through functions? The most prominent representative in this resepct
is probably composition ('.' in Haskell).
2.)
In
http://members.aol.com/lawsofform/
I read the following:
Hopkins, 1994
Hopkins, M. (1994). Laws of Form as a functional calculus.
Posted to the USEnet newsgroup sci.math Mar 13,
1994 and updated to sci.logic Apr 21.
An attempt to translate LoF, the whole book, including the
meta-level canons,
principles and rules, into a
functional language and categorical combinator system in the spirit
of CAML.
Author's Email address: [EMAIL PROTECTED]
But the above mentioned Email address is outdated.
Does anybody have further information about the Laws of Form?
TIA,
Arne
--
| Arne Bayer Universitaet der Bundeswehr Muenchen |
| Institut fuer Softwaretechnologie |
| eMail: [EMAIL PROTECTED] |
| WWW: http://www2.informatik.unibw-muenchen.de/People/arne/ |
