On Mon, Mar 30, 2015 at 2:54 AM, Keean Schupke <[email protected]> wrote: > As such the function concretization pass only has to deal with fully > determined arity abstract types.
What exactly is fully determined about an arity-abstract type, whose arity is--by definition--not yet determined? > A curried type is already arity abstract (the point of currying is to make > type system imementation easier, not partial application etc) We either do not mean the same thing by "curried" or by "arity-abstract". Curried: One function nested as the return of another Arity-Abstract: Concrete arity is unknown It seems perfectly reasonable to me to curry arity-concrete functions. Indeed, (cfn 'a->cfn 'b->'c) is such a function type. But I don't think we ever reached a consensus on this terminology. _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
