TACS 2001 CFP

Preliminary Call for Papers Fourth International Symposium on Theoretical Aspects of Computer Science (TACS 2001) October 29-31, 2001 Tohoku University,

Re: type class

Simon Peyton-Jones <[EMAIL PROTECTED]> writes: > | How about extending TC with a branch for abstraction: > | > | TC ::= ... > | | /\a. TC -- abstraction > | > | This is too powerful and will get out of control -- we surely > | don't want to give TC the full power of lambda-calculus. So

JFP Special Issue on Haskell

-- CALL FOR PAPERS Journal of Functional Programming Special Issue on Haskell Since its inception in 1987, Haskell has provided a focal point for resear

Re: negative export list

George Russell <[EMAIL PROTECTED]> writes: > > As a result, I seldom write > > "private" functions at top-level, > > and I think the situation might be > > true for other functional > > programmers as well. > It isn't true for me. Me neither. I simply disregard the whole export list during

RE: type class

| How about extending TC with a branch for abstraction: | | TC ::= ... | | /\a. TC -- abstraction | | This is too powerful and will get out of control -- we surely | don't want to give TC the full power of lambda-calculus. So let's impose a | restriction: in /\a.TC, a must occur free in