Volltext
function ifbool : bool × bool × bool → bool ifbool(true, b, c) ≡ b
ifbool(false, b, c) ≡ c
function eq : number × number → bool eq(O, O) ≡ true
eq(succ(x), O) ≡ false eq(O, succ(y)) ≡ false
eq(succ(x), succ(y)) ≡ eq(x, y)
function member : number × list → bool member(x, nil) ≡ false
member(x, cons(y, l)) ≡ ifbool(eq(x, y), true, member(x, l))
function sublist : list × list → bool sublist(nil, k) ≡ true
sublist(cons(x, l), k) ≡ ifbool(member(x, k), sublist(l, k), false)
1
ÄHNLICHE DOKUMENTE
h) Write a function forall : (’a -> bool) -> ’a list -> bool, which calculates wether all ele- ments of a list satisfy the given predicate.. i) Write a function exists :
controlled function mode: Benutzer → Aktion controlled function finished: Benutzer → Bool controlled function currentUser: → Benutzer controlled function loggedin: Benutzer →
isDoesNotExistError :: IOError -> Bool isIllegalOperation :: IOError -> Bool isPermissionError :: IOError -> Bool isUserError :: IOError -> Bool ioeGetErrorString ::
Index Titel (s tring ) Original ( bool ). [0]
Index Titel ( string ) Original ( bool ). [0]
Index Titel ( string ) Original ( bool ). [0]
ServoCmd.bWithoutLagLimit Bool True: deactivate lag distance limit False: activate lag distance limit ServoCmd.bWithoutSWLimit Bool True: deactivate SW limit
Stelligkeit des entsprechenden Konstruktors I Rekursion im Typ → Rekursion im Muster I zu jedem rekursiven Datentyp gibt es genau ein.
