1.1 --- a/src/Pure/ML-Systems/polyml.ML	Sat Jun 05 13:06:28 2004 +0200
     1.2 +++ b/src/Pure/ML-Systems/polyml.ML	Sat Jun 05 13:06:39 2004 +0200
     1.3 @@ -3,7 +3,7 @@
     1.4      Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
     1.5      Copyright   1991  University of Cambridge
     1.6  
     1.7 -Compatibility file for Poly/ML (version 4.0).
     1.8 +Compatibility file for Poly/ML (version 4.0, 4.1, 4.1.x).
     1.9  *)
    1.10  
    1.11  (** ML system related **)
    1.12 @@ -26,14 +26,17 @@
    1.13  val explode = SML90.explode;
    1.14  val implode = SML90.implode;
    1.15  
    1.16 +
    1.17  (* compiler-independent timing functions *)
    1.18  
    1.19  use "ML-Systems/cpu-timer-basis.ML";
    1.20  
    1.21 +
    1.22  (* bounded time execution *)
    1.23  
    1.24  use "ML-Systems/polyml-time-limit.ML";
    1.25  
    1.26 +
    1.27  (* prompts *)
    1.28  
    1.29  fun ml_prompts p1 p2 = (PolyML.Compiler.prompt1 := p1; PolyML.Compiler.prompt2 := p2);

     2.1 --- a/src/Pure/sorts.ML	Sat Jun 05 13:06:28 2004 +0200
     2.2 +++ b/src/Pure/sorts.ML	Sat Jun 05 13:06:39 2004 +0200
     2.3 @@ -84,8 +84,8 @@
     2.4    arities: table of association lists of all type arities; (t, ars)
     2.5      means that type constructor t has the arities ars; an element (c,
     2.6      Ss) of ars represents the arity t::(Ss)c.  "Coregularity" of the
     2.7 -    arities structure requires that for any two declarations t:(Ss1)c1
     2.8 -    and t:(Ss2)c2 such that c1 <= c2 holds Ss1 <= Ss2.
     2.9 +    arities structure requires that for any two declarations
    2.10 +    t::(Ss1)c1 and t::(Ss2)c2 such that c1 <= c2 holds Ss1 <= Ss2.
    2.11  *)
    2.12  
    2.13  type classes = stamp Graph.T;