### annotate tests/specialize.ur @ 317:6a4e365db60c

Fix memory bounds checks; specialization of multi-argument polymorphic function works
author Adam Chlipala Thu, 11 Sep 2008 10:34:47 -0400 04ebfe929a98 60907c06b4c4
rev   line source
adamc@315 1 datatype list a = Nil | Cons of a * list a
adamc@315 3 fun isNil (t ::: Type) (ls : list t) : bool =
adamc@315 6 | Cons _ => False
adamc@316 8 fun append (t ::: Type) (ls1 : list t) (ls2 : list t) : list t =
adamc@315 11 | Cons (x, ls1') => Cons (x, append ls1' ls2)
adamc@317 13 fun pairAppend (t1 ::: Type) (t2 ::: Type) (ls1 : list (t1 * t2)) (ls2 : list (t1 * t2)) : list (t1 * t2) =
adamc@317 16 | Cons (x, ls1') => Cons (x, pairAppend ls1' ls2)
adamc@315 18 fun delist (ls : list string) : xml body [] [] =
adamc@316 21 | Cons (h, t) => <body>{cdata h} :: {delist t}</body>
adamc@317 23 fun pairDelist (ls : list (string * int)) : xml body [] [] =
adamc@317 26 | Cons ((s, n), t) => <body>({cdata s}, {cdata (show _ n)}) :: {pairDelist t}</body>
adamc@315 28 val ls = Cons ("X", Cons ("Y", Cons ("Z", Nil)))
adamc@316 29 val ls' = Cons ("A", Cons ("B", Nil))
adamc@317 31 val pls = Cons (("X", 1), Cons (("Y", 2), Cons (("Z", 3), Nil)))
adamc@317 32 val pls' = Cons (("A", 1), Cons (("B", 2), Nil))