[simantics/platform.git] /

// Idea here is to test the following property:\r
// When a function is called recursively it has locally a monomorphic type.\r
// Therefore the definition of cons does not work even if it works\r
// with a proper type annotation.\r
\r
data Vec a = Nil | Zero (Vec (a,a)) | One a (Vec (a,a))\r
\r
// cons :: a -> Vec a -> Vec a\r
cons x Nil        = One x Nil\r
cons x (Zero ps)  = One x ps\r
cons x (One y ps) = Zero (cons (x, y) ps)\r
--\r
11:21-11:42: Expected <Vec (a, a)> got <Vec a>.\r
11:33-11:34: Type (a, a) is not a subtype of a.\r
11:36-11:37: Type (a, a) is not a subtype of a.\r
11:39-11:41: Expected <Vec a> got <Vec (a, a)>.