12 Commits

Author	SHA1	Message	Date
Mark Harrah	8d6dd10798	2.10.0-M5, different arity generalization ... 1. KList[M[_]] now instead of KList[HL <: HList, M[_]] a. head, tail work properly in this variant b. disadvantage is that full type not easily transformed to new type constructor 2. AList abstracts on K[L[x]], a higher order type constructor. A. Instances written for: a. KList b. Seq[M[T]] for a fixed T c. TupleN d. single values e. operate on one type constructor when nested B. Main disadvantage is type inference. It just doesn't happen for K[L[x]]. This is mitigated by AList being used internally and rarely needing to construct a K.	2012-11-17 20:19:24 -05:00
Mark Harrah	e2b5ce374c	fix task tests	2012-07-01 15:16:41 -04:00
Mark Harrah	b096d1b175	global settings preparation: separate compilation/loading stages of Eval	2011-07-09 16:54:41 -04:00
Mark Harrah	818382766e	add Types.idFun to replace Predef.identity, replace a :== overload ... idFun[T]: T => T instead of identity[T](t: T): T doesn't require a new class file when used as a function value replaced overloads of :== that assigned the Scoped reference on the right to the Scoped on the left with <<= scoped.identity	2011-04-16 11:24:58 -04:00
Mark Harrah	087bc569e0	multi-project model based on Settings and ProjectRef	2011-01-18 18:48:32 -05:00
Mark Harrah	0846ffd02b	minor updates to utilities	2010-10-30 11:54:43 -04:00
Mark Harrah	32150e7097	type alias A ~>| B for [T]A[T] => Option[B[T]]	2010-08-10 08:40:14 -04:00
Mark Harrah	899920a0a0	conversions	2010-06-10 08:14:50 -04:00
Mark Harrah	5eed8ccbef	graph evaluator, rewrite, general updates	2010-06-07 08:53:21 -04:00
Mark Harrah	ec19be6152	variance fixes, inference fixes with Result hierarchy	2010-06-01 08:38:56 -04:00
Mark Harrah	75a784d5ec	MList covariant, initial Node	2010-05-30 21:14:18 -04:00
Mark Harrah	9a4cfa0037	higher-kinded heterogeneous lists: MList[M[_]] ... natural transformations: ~>[A[_], B[_]] Scala 2.8	2010-05-30 18:42:58 -04:00