> beyond specific combinator tutorial, are there any generic combinator
> paper, or introductory ones ?
what exactly do you mean by "combinator".
there's the recent area of parser combinators and such,
but there's also Combinatory Logic in itself,
which is a formal system closely related to the lambda calculus.
a nice introduction is here: http://uq.net.au/~zzdkeena/Lambda/index.htm
which is based on the "ornithology" from here:
Smullyan, R.M. (1985) To mock a mockingbird. Alfred A. Knopf, New York.
of course, the definitive references on Comb. L. and Lambda Calc.
are the books by Curry, Feys, Hindley, Seldin, Barendregt (check your library).
beware that the classical theory (as expressed in these books)
is mostly un-typed (you can apply anything to anything).
enjoy,
--
-- Johannes Waldmann ---- http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
_______________________________________________
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
