[Haskell-cafe] Theory about uncurried functions

Jonathan Cast jonathanccast at fastmail.fm
Tue Mar 3 19:37:57 EST 2009

On Wed, 2009-03-04 at 01:35 +0100, Henning Thielemann wrote:
> On Tue, 3 Mar 2009, Peter Verswyvelen wrote:
> > Now, does a similar theory exist of functions that always have one
> > input and one output, but these inputs and outputs are *always*
> > tuples? Or maybe this does not make any sense?
> I don't think one can forbid currying.

Sure you can, just work in a category with finite products (and possibly
finite co-products) but not exponentials.  Of course, then your language
is first order --- and this doesn't do anything to stop partial
application, which is still easy --- but it's quite possible.


More information about the Haskell-Cafe mailing list