I am looking for information on "combinator languages", both specific instances
and literature on combinator languages an sich (is there any?).
To tell the truth, I'm not really sure what qualifies as a combinator language,
so opinions on this are welcome. I think one can argue that any monad
generates one, but there are important instances which are not monads, for
example Swierstra & Duponcheel's deterministic error-correcting combinator
parsers or Hughes' pretty-printing combinators. In fact, those are the only
two well known non-monadic combinators I'm aware of; but I suspect there are
many more, developed out of "proprietary" concerns, which have not been written
up.
Any help would be appreciated.
Thanks in advance!
--FC
