luke/sbt - sbt - Gitea: Git with a cup of tea

Commit Graph

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	8daaf9ea17	Cut down launcher jar size a bit	2010-02-04 18:56:07 -05:00
Mark Harrah	fa73205ac3	Extra logging, update default sbt.boot.properties Tests for standard library substitutes	2009-10-18 22:25:50 -04:00

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

8daaf9ea17

Cut down launcher jar size a bit

2010-02-04 18:56:07 -05:00

Mark Harrah

fa73205ac3

Extra logging, update default sbt.boot.properties

Tests for standard library substitutes

2009-10-18 22:25:50 -04:00

3 Commits