[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,

Theorem base for Specification eval

This is a listing of all goals defined over the current specification. Axioms are yellow, proof obligations purple and theorems green. Click on individual names to get more information on the proof.

Name:	Sequent:	Type:
eval		An Axiom
eval-existing-path	closed(H), path(x, r0, r1, H) ⊦ ⟪eval#(r0, x, H; a?)⟫ (a? = some(H[r1].value))	A User Theorem
eval-nonexisting-path	r0 ∈ H, closed(H), ¬(∃ r1. path(x, r0, r1, H)) ⊦ ⟪eval#(r0, x, H; a?)⟫ (a? = none)	A User Theorem
eval-term	r ∈ H, closed(H) ⊦ ⟪eval#(r, x, H; a?)⟫ true	A User Theorem