Mercurial > cpdt > repo
diff src/DataStruct.v @ 302:7b38729be069
Tweak mark-up to support coqdoc 8.3
author | Adam Chlipala <adam@chlipala.net> |
---|---|
date | Mon, 17 Jan 2011 15:12:30 -0500 |
parents | 559ec7328410 |
children | d5787b70cf48 |
line wrap: on
line diff
--- a/src/DataStruct.v Mon Jan 17 11:42:09 2011 -0500 +++ b/src/DataStruct.v Mon Jan 17 15:12:30 2011 -0500 @@ -136,26 +136,30 @@ (** %\vspace{-.15in}% [[ Cons 0 (Cons 1 (Cons 2 Nil)) : ilist nat 3 -]] *) +]] +*) (* begin thide *) Eval simpl in get (Cons 0 (Cons 1 (Cons 2 Nil))) First. (** %\vspace{-.15in}% [[ = 0 : nat -]] *) +]] +*) Eval simpl in get (Cons 0 (Cons 1 (Cons 2 Nil))) (Next First). (** %\vspace{-.15in}% [[ = 1 : nat -]] *) +]] +*) Eval simpl in get (Cons 0 (Cons 1 (Cons 2 Nil))) (Next (Next First)). (** %\vspace{-.15in}% [[ = 2 : nat -]] *) +]] +*) (* end thide *) (** Our [get] function is also quite easy to reason about. We show how with a short example about an analogue to the list [map] function. *) @@ -258,13 +262,15 @@ (** %\vspace{-.15in}% [[ = 5 : (fun T : Set => T) nat -]] *) +]] +*) Eval simpl in hget someValues (MNext MFirst). (** %\vspace{-.15in}% [[ = true : (fun T : Set => T) bool -]] *) +]] +*) (** We can also build indexed lists of pairs in this way. *) @@ -324,32 +330,37 @@ (** %\vspace{-.15in}% [[ = tt : typeDenote Unit -]] *) +]] +*) Eval simpl in expDenote (Abs (dom := Unit) (Var MFirst)) MNil. (** %\vspace{-.15in}% [[ = fun x : unit => x : typeDenote (Arrow Unit Unit) -]] *) +]] +*) Eval simpl in expDenote (Abs (dom := Unit) (Abs (dom := Unit) (Var (MNext MFirst)))) MNil. (** %\vspace{-.15in}% [[ = fun x _ : unit => x : typeDenote (Arrow Unit (Arrow Unit Unit)) -]] *) +]] +*) Eval simpl in expDenote (Abs (dom := Unit) (Abs (dom := Unit) (Var MFirst))) MNil. (** %\vspace{-.15in}% [[ = fun _ x0 : unit => x0 : typeDenote (Arrow Unit (Arrow Unit Unit)) -]] *) +]] +*) Eval simpl in expDenote (App (Abs (Var MFirst)) Const) MNil. (** %\vspace{-.15in}% [[ = tt : typeDenote Unit -]] *) +]] +*) (* end thide *)