annotate demo/tcSum.ur @ 954:2a50da66ffd8

Basic tail recursion introduction seems to be working
author Adam Chlipala <adamc@hcoop.net>
date Thu, 17 Sep 2009 16:35:11 -0400
parents 669ac5e9a69e
children 8d3aa6c7cee0
rev   line source
adamc@823 1 fun sum [t] (_ : num t) [fs ::: {Unit}] (fl : folder fs) (x : $(mapU t fs)) =
adamc@417 2 foldUR [t] [fn _ => t]
adamc@823 3 (fn [nm :: Name] [rest :: {Unit}] [[nm] ~ rest] n acc => n + acc)
adamc@632 4 zero [fs] fl x
adamc@417 5
adamc@417 6 fun main () = return <xml><body>
adamc@633 7 {[sum {A = 0, B = 1}]}<br/>
adamc@633 8 {[sum {C = 2.1, D = 3.2, E = 4.3}]}
adamc@417 9 </body></xml>