/usr/lib/ats2-postiats-0.2.6/libats/SATS/typeval.sats 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 | (***********************************************************************)
(* *)
(* Applied Type System *)
(* *)
(***********************************************************************)
(*
** ATS/Postiats - Unleashing the Potential of Types!
** Copyright (C) 2011-2015 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: gmmhwxiATgmailDOTcom
// Start Time: March, 2015
//
(* ****** ****** *)
//
abstype Z() // 0
abstype S(type) // n+1
//
(* ****** ****** *)
//
#define fS(n)
if n > 0 then S(fS(n-1)) else Z()
//
(* ****** ****** *)
//
dataprop
tieq(type, int) =
| TIEQZ (Z(), 0)
| {t:type}{n:nat}
TIEQS(S(t), n+1) of tieq(t, n)
//
fun
{t:type}
tieq2int
{n:int}
(pf: tieq(t, n) | (*void*)): int(n)
//
(* ****** ****** *)
//
abstype B0(type) // 2*n+0
abstype B1(type) // 2*n+1
//
dataprop
ti2eq(type, int) =
| TI2EQZ (Z(), 0)
| {t:type}{n:nat}
TI2EQB0(B0(t), 2*n) of ti2eq(t, n)
| {t:type}{n:nat}
TI2EQB1(B1(t), 2*n+1) of ti2eq(t, n)
//
fun
{t:type}
ti2eq2int
{n:int}
(pf: ti2eq(t, n) | (*void*)): int(n)
//
(* ****** ****** *)
//
fun
{a:vt0p}
{t:type}
sarray_foreach
{n:int}
(
pf: tieq(t, n)| A0: &array(a, n), env: ptr
) : void // end-of-fun
//
fun
{a:vt0p}
sarray_foreach$fwork(x: &a >> _, env: ptr): void
//
(* ****** ****** *)
//
fun
{a:vt0p}
{t:type}
sarray_foreach2
{n:int}
(
pf: tieq(t, n)
| A0: &array(a, n), A1: &array(a, n), env: ptr
) : void // end-of-fun
//
fun
{a:vt0p}
sarray_foreach2$fwork(x0: &a >> _, x1: &a >> _, env: ptr): void
//
(* ****** ****** *)
(* end of [typeval.sats] *)
|