[Imprint][Data Privacy Statement][E-Mail]

Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Signature symbols in this unit

Symbol	Specification	Kind	Type
# .	list-data	f	List('a) → Nat
#oc	list-perm	f	'a × List('a) → Nat
. '	list	f	'a → List('a)
. + .	nat-basic	f	Nat × Nat → Nat
. + .	list-data	f	'a × List('a) → List('a)
. + .	list	f	List('a) × List('a) → List('a)
. + .	list	f	List('a) × 'a → List('a)
. ++ .	list-dup	f	List('a) × 'a → List('a)
. +1	nat-basic	f	Nat → Nat
. +2 .	list	f	'a × 'a → List('a)
. - .	nat	pf	Nat × Nat → Nat with λ n, m. n ≥ m
. -1	nat-basic	pf	Nat → Nat with λ n. n ≠ 0
. -1l .	list-del	f	List('a) × 'a → List('a)
. -l .	list-del	f	List('a) × 'a → List('a)
. -p .	list-del	f	List('a) × Nat → List('a)
. .R?	RWevent	p	RWevent
. .W?	RWevent	p	RWevent
. .butlast	list-last	pf	List('a) → List('a) with λ x. x ≠ []
. .count ( . )	filter-count	f	List('a) × ('a → Bool) → Nat
. .count ( . )	filter-count	pf	List('a) × Nat × Nat × ('a → Bool) → Nat with λ x, m, n, p. m ≤ n ∧ n ≤ # x
. .distinct	list-dup	f	List('a) → List('a)
. .drop ( . )	list-del	pf	List('a) × Nat → List('a) with λ x, n. n ≤ # x
. .dropRight ( . )	list-last	pf	List('a) × Nat → List('a) with λ x, n. n ≤ # x
. .exists ( . )	forall-indexWhere	p	List('a) × ('a → Type(Bool))
. .filter ( . )	filter-count	f	List('a) × ('a → Bool) → List('a)
. .foldLeft ( . )	list	f	List('a) × 'b × ('b × 'a → 'b) → 'b
. .forall ( . )	forall-indexWhere	p	List('a) × ('a → Type(Bool))
. .head	list-data	pf	List('a) → 'a with λ x. x ≠ []
. .indexOf ( . )	list-del	f	List('a) × 'a → Nat
. .indexWhere ( . )	forall-indexWhere	f	List('a) × ('a → Bool) → Nat
. .l	RWevent	f	RWevent → L
. .last	list-last	pf	List('a) → 'a with λ x. x ≠ []
. .lastPersistedOrElse ( . )	PLIB-preds	p	List((RWevent, Bool)) × L × Bool
. .map ( . )	list	f	List('a) × ('a → 'b) → List('b)
. .sublist ( . )	list-del	pf	List('a) × Nat × Nat → List('a) with λ x, n, m. n + m ≤ # x
. .t	RWevent	f	RWevent → T
. .tail	list-data	pf	List('a) → List('a) with λ x. x ≠ []
. .take ( . )	list-del	pf	List('a) × Nat → List('a) with λ x, n. n ≤ # x
. .takeRight ( . )	list-del	pf	List('a) × Nat → List('a) with λ x, n. n ≤ # x
. .v	RWevent	f	RWevent → V
. < .	nat-basic	p	Nat × Nat
. < .	list-data	p	List('a) × List('a)
. > .	nat	p	Nat × Nat
. [ . := . ]	list-getput	pf	List('a) × Nat × 'a → List('a) with λ x, n, a. n < # x
. [ . ]	list-getput	pf	List('a) × Nat → 'a with λ x, n. n < # x
. \ .	list-set	f	List('a) × List('a) → List('a)
. \| .	PLIB-preds	f	List((RWevent, Bool)) × T → List((RWevent, Bool))
. \| .	PLIB-preds	f	List((RWevent, Bool)) × Bool → List((RWevent, Bool))
. \| .	PLIB-preds	f	List((RWevent, Bool)) × L → List((RWevent, Bool))
. \|R	PLIB-preds	f	List((RWevent, Bool)) → List((RWevent, Bool))
. \|W	PLIB-preds	f	List((RWevent, Bool)) → List((RWevent, Bool))
. ∈ .	list	p	'a × List('a)
. ∪ .	list-set	f	List('a) × List('a) → List('a)
. ≤ .	nat	p	Nat × Nat
. ≥ .	nat	p	Nat × Nat
. ⊆ .	list-set	p	List('a) × List('a)
. ⊆m .	list-perm	p	List('a) × List('a)
. ⊑ .	list-last	p	List('a) × List('a)
. ⊑p .	PLIB-preds	p	List((RWevent, Bool)) × List((RWevent, Bool))
. ⊒ .	list-last	p	List('a) × List('a)
. ⊕ .	PLIB-preds	f	(L → V) × List((RWevent, Bool)) → L → V
. intersect .	list-set	f	List('a) × List('a) → List('a)
. zip .	filter-count	f	List('a) × List('b) → List(('a, 'b))
[]	list-data	c	List('a)
∅	memory	f	L → V
L	memory	s
List	list-data	s
Nat	nat-basic	s
O	memory	c	V
R	RWevent	f	T × L × V → RWevent
RWevent	RWevent	s
T	memory	s
V	memory	s
W	RWevent	f	T × L × V → RWevent
allReadsOK	PLIB-preds	p	List((RWevent, Bool))
allReadsOKInd	PLIB-preds	p	(L → Type(V)) × (L → Type(Bool)) × List((RWevent, Bool))
allWritesOK	PLIB-preds	p	List((RWevent, Bool))
allWritesOKInd	PLIB-preds	p	(T → Type(Bool)) × (L → Type(Bool)) × List((RWevent, Bool))
b	PLIB-preds	v	Bool
disj	list-dup	p	List('a) × List('a)
dups	list-dup	p	List('a)
e	PLIB-preds	v	RWevent
el	PLIB-preds	v	List(RWevent)
events	PLIB-preds	f	List((RWevent, Bool)) → List(RWevent)
fillfirst	list-last	f	Nat × 'a × List('a) → List('a)
firstVolWrite	PLIB-preds	f	L × List((RWevent, Bool)) → Nat
frome	list-del	f	List('a) × 'a → List('a)
h	PLIB-preds	v	List((RWevent, Bool))
hPred	PLIB-preds	v	List((RWevent, Bool)) → Bool
l	PLIB-preds	v	L
mem	PLIB-preds	v	L → V
mklist	list-last	f	'a × Nat → List('a)
n	PLIB-preds	v	Nat
pending	PLIB-preds	v	T → Bool
perm	list-perm	p	List('a) × List('a)
persistDependentReads	PLIB-preds	f	L × List((RWevent, Bool)) → List((RWevent, Bool))
persisted	PLIB-preds	v	L → Bool
rely	PLIB-preds	p	T × List((RWevent, Bool)) × List((RWevent, Bool))
rev	list-last	f	List('a) → List('a)
t	PLIB-preds	v	T
v	PLIB-preds	v	V
vpe	PLIB-preds	v	(RWevent, Bool)