diff --git a/arch/dummy/dummy.nw b/arch/dummy/dummy.nw index 4ebc134..76e11d9 100644 --- a/arch/dummy/dummy.nw +++ b/arch/dummy/dummy.nw @@ -331,7 +331,7 @@ let simple = The [[return]] instruction for a possibly alternate return. -<>= +<>= let return k n ~ra = if k = 0 && n = 0 then store pc ra diff --git a/arch/mips/mipscall.nw b/arch/mips/mipscall.nw index bc082a5..7f79ffa 100644 --- a/arch/mips/mipscall.nw +++ b/arch/mips/mipscall.nw @@ -321,7 +321,7 @@ let spec = @ <>= let c' ~return_to cut auto = - <> + <> in let t = CS.to_call cut (rtn return_to) auto spec in { t with (* fix what callspec got wrong *) diff --git a/arch/mips/mipsrec.nw b/arch/mips/mipsrec.nw index 904d287..6850a1a 100644 --- a/arch/mips/mipsrec.nw +++ b/arch/mips/mipsrec.nw @@ -419,7 +419,7 @@ and loc = function | RP.Slice _ -> error "cannot handle slice" @ -<>= +<>= let effect = function <> | RP.Store(l,e,w) -> conStore (loc l) (exp e) w diff --git a/arch/x86/x86asm.nw b/arch/x86/x86asm.nw index 3cc5d29..f298c08 100644 --- a/arch/x86/x86asm.nw +++ b/arch/x86/x86asm.nw @@ -210,7 +210,7 @@ method value (v:Bits.bits) = <>= let mask32 = Int64.pred (Int64.shift_left Int64.one 32) @ -<>= +<>= method addr a = match Reloc.if_bare a with | Some b -> this#value b diff --git a/front_ir/opshape.nw b/front_ir/opshape.nw index a9b555d..1e90e8e 100644 --- a/front_ir/opshape.nw +++ b/front_ir/opshape.nw @@ -201,14 +201,14 @@ let shape scheme = match scheme with | [ <<'a>> ; - <<'a>> + <<'a>> ], - <<'a>> + <<'a>> -> Binop ((), ()) | [ <<'a>> ], - <<'a>> + <<'a>> -> Unop () | [ <<'a>> diff --git a/front_ir/proc.nw b/front_ir/proc.nw index 58496e8..53022a9 100644 --- a/front_ir/proc.nw +++ b/front_ir/proc.nw @@ -101,9 +101,9 @@ incoming overflow results, some deallocated by the \end{itemize} <>= -<> +<> @ -<>= -<> +<>= +<> @ diff --git a/front_nelab/elabstmt.nw b/front_nelab/elabstmt.nw index d383e70..bdbcb39 100644 --- a/front_nelab/elabstmt.nw +++ b/front_nelab/elabstmt.nw @@ -256,7 +256,7 @@ let arm (rgs, ss) = | [] -> E.error "case arm has an empty range list" | (rg, w) :: rgs -> let strip w (rg, w') = if w = w' then rg else - <> + <> in ((rg :: List.map (strip w) rgs), ss), w) in @ @@ -266,11 +266,11 @@ We check this requirement and strip the width off everything in sight. <>= let striprange w (rg, w') = if w = w' then rg else - <> + <> in let striparms w = let strip (arm, w') = if w = w' then arm else - <> + <> in List.map strip in @ @@ -312,7 +312,7 @@ let assign lhs rhs = try E.ematch (E.Raise.list (List.map2 effect lhs rhs)) (fun es -> Assign (vrtl (srcmap, r) (Rtl.par es))) with Invalid_argument _ -> - <> + <> in @ <>= diff --git a/front_rtl/types.nw b/front_rtl/types.nw index 84fe91d..85ab25b 100644 --- a/front_rtl/types.nw +++ b/front_rtl/types.nw @@ -192,7 +192,7 @@ type size = Const of int @ <>= -<> +<> (* types from the interface definition *) @ \emph{Rather than having a fixed operator [[Double]] we could implement a diff --git a/front_zipcfg/zipcfg.nw b/front_zipcfg/zipcfg.nw index f05926d..4c93b9e 100644 --- a/front_zipcfg/zipcfg.nw +++ b/front_zipcfg/zipcfg.nw @@ -504,7 +504,7 @@ module Blocks : BLOCKS with type t = block UM.t = struct let iter = UM.iter end @ -<>= +<>= type graph = Blocks.t type zgraph = zblock * Blocks.t type nodes = zgraph -> zgraph (* sequence of nodes in Hughes's representation *)