Mercurial > urweb

annotate tests/termination.ur @ 1739:c414850f206f

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add support for -boot flag, which allows in-tree execution of Ur/Web The boot flag rewrites most hardcoded paths to point to the build directory, and also forces static compilation. This is convenient for developing Ur/Web, or if you cannot 'sudo make install' Ur/Web. The following changes were made: * Header files were moved to include/urweb instead of include; this lets FFI users point their C_INCLUDE_PATH at this directory at write <urweb/urweb.h>. For internal Ur/Web executables, we simply pass -I$PATH/include/urweb as normal. * Differentiate between LIB and SRCLIB; SRCLIB is Ur and JavaScript source files, while LIB is compiled products from libtool. For in-tree compilation these live in different places. * No longer reference Config for paths; instead use Settings; these settings can be changed dynamically by Compiler.enableBoot () (TODO: add a disableBoot function.) * config.h is now generated directly in include/urweb/config.h, for consistency's sake (especially since it gets installed along with the rest of the headers!) * All of the autotools build products got updated. * The linkStatic field in protocols now only contains the name of the build product, and not the absolute path. Future users have to be careful not to reference the Settings files to early, lest they get an old version (this was the source of two bugs during development of this patch.)
author Edward Z. Yang <ezyang@mit.edu>
date Wed, 02 May 2012 17:17:57 -0400
parents e0ed0d4dabc9
children
rev   line source
adamc@313 1 datatype list a = Nil | Cons of a * list a
adamc@313 2
adamc@313 3 fun isNil (t ::: Type) (ls : list t) : bool =
adamc@313 4 case ls of
adamc@313 5 Nil => True
adamc@313 6 | Cons _ => False
adamc@313 7
adamc@313 8 fun append (t ::: Type) (ls1 : list t) (ls2 : list t) : list t =
adamc@313 9 case ls1 of
adamc@313 10 Nil => ls2
adamc@313 11 | Cons (x, ls1') => Cons (x, append ls1' ls2)
adamc@313 12
adamc@313 13 fun appendR (t ::: Type) (ls2 : list t) (ls1 : list t) : list t =
adamc@313 14 case ls1 of
adamc@313 15 Nil => ls2
adamc@313 16 | Cons (x, ls1') => Cons (x, appendR ls2 ls1')
adamc@313 17
adamc@313 18 (*fun naughty (t ::: Type) (ls : list t) : list t = naughty ls*)
adamc@313 19
adamc@313 20 fun append1 (t ::: Type) (ls1 : list t) (ls2 : list t) : list t =
adamc@313 21 case ls1 of
adamc@313 22 Nil => ls2
adamc@313 23 | Cons (x, ls1') => Cons (x, append2 ls2 ls1')
adamc@313 24
adamc@313 25 and append2 (t ::: Type) (ls2 : list t) (ls1 : list t) : list t =
adamc@313 26 case ls1 of
adamc@313 27 Nil => ls2
adamc@313 28 | Cons (x, ls1') => Cons (x, append1 ls1' ls2)