/usr/lib/ats2-postiats-0.2.6/libats/DATS/SHARE/funralist.hats is in ats2-lang 0.2.6-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 | (***********************************************************************)
(* *)
(* Applied Type System *)
(* *)
(***********************************************************************)
(*
** ATS/Postiats - Unleashing the Potential of Types!
** Copyright (C) 2011-2013 Hongwei Xi, ATS Trustful Software, Inc.
** All rights reserved
**
** ATS is free software; you can redistribute it and/or modify it under
** the terms of the GNU GENERAL PUBLIC LICENSE (GPL) as published by the
** Free Software Foundation; either version 3, or (at your option) any
** later version.
**
** ATS is distributed in the hope that it will be useful, but WITHOUT ANY
** WARRANTY; without even the implied warranty of MERCHANTABILITY or
** FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
** for more details.
**
** You should have received a copy of the GNU General Public License
** along with ATS; see the file COPYING. If not, please write to the
** Free Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
** 02110-1301, USA.
*)
(* ****** ****** *)
(* Author: Hongwei Xi *)
(* Authoremail: hwxi AT cs DOT bu DOT edu *)
(* Start time: May, 2012 *)
(* ****** ****** *)
staload
UN = "prelude/SATS/unsafe.sats"
(* ****** ****** *)
implement{a}
funralist_make_list
(xs) = let
//
fun loop {m,n:nat} .<m>.
(
xs: list_vt (a, m), res: ralist (a, n)
) : ralist (a, m+n) =
(
case+ xs of
| ~list_vt_cons
(x, xs) => loop (xs, funralist_cons (x, res))
| ~list_vt_nil ((*void*)) => res
) // end of [loop]
//
prval () = lemma_list_param (xs)
//
in
loop (list_reverse (xs), funralist_nil ())
end // end of [funralist_make_list]
(* ****** ****** *)
implement{a}
fprint_funralist (out, xs) = let
//
typedef tenv = int
//
implement
funralist_foreach$fwork<a><tenv>
(x, env) = let
//
val () =
if env > 0 then
fprint_funralist$sep (out)
// end of [val]
val () = fprint_val<a> (out, x)
val () = env := env + 1
//
in
// nothing
end // end of [funralist_foreach$fwork]
//
var env: tenv = 0
val () = funralist_foreach_env<a><tenv> (xs, env)
//
in
// nothing
end // end of [fprint_funralist]
implement{}
fprint_funralist$sep (out) = fprint (out, ", ")
(* ****** ****** *)
local
staload Q = "libats/SATS/qlist.sats"
in (* in of [local] *)
implement{a}
funralist_listize
{n} (xs) = let
//
viewtypedef tenv = $Q.qstruct (a)
//
implement
funralist_foreach$fwork<a><tenv> (x, env) = $Q.qstruct_insert<a> (env, x)
//
var env: $Q.qstruct
val () = $Q.qstruct_initize {a} (env)
val () = $effmask_all (funralist_foreach_env (xs, env))
val res = $Q.qstruct_takeout_list (env)
val () = $Q.qstruct_uninitize {a} (env)
//
in
$UN.castvwtp0{list_vt(a,n)}(res)
end // end of [funralist_listize]
end // end of [local]
(* ****** ****** *)
(* end of [funralist.hats] *)
|