Mercurial > urweb
view demo/listFun.ur @ 469:b393c2fc80f8
About to begin optimization of recursive transaction functions
author | Adam Chlipala <adamc@hcoop.net> |
---|---|
date | Thu, 06 Nov 2008 17:09:53 -0500 |
parents | e756d3a47726 |
children | 7ef4b2911b09 |
line wrap: on
line source
open List functor Make(M : sig type t val toString : t -> string val fromString : string -> option t end) = struct fun toXml (ls : list M.t) = case ls of Nil => <xml>[]</xml> | Cons (x, ls') => <xml>{[M.toString x]} :: {toXml ls'}</xml> fun console (ls : list M.t) = return <xml><body> Current list: {toXml ls}<br/> Reversed list: {toXml (rev ls)}<br/> Length: {[length ls]}<br/> <br/> <form> Add element: <textbox{#X}/> <submit action={cons ls}/> </form> </body></xml> and cons (ls : list M.t) (r : {X : string}) = case M.fromString r.X of None => return <xml><body>Invalid string!</body></xml> | Some v => console (Cons (v, ls)) fun main () = console Nil end