chapter ‹Instantiating the Framework with a simple While-Language using procedures›
section ‹Commands›
theory Com imports "../StaticInter/BasicDefs" begin
subsection ‹Variables and Values›
type_synonym vname = string ― ‹names for variables›
type_synonym pname = string ― ‹names for procedures›
datatype val
= Bool bool ― ‹Boolean value›
| Intg int ― ‹integer value›
abbreviation "true == Bool True"
abbreviation "false == Bool False"
subsection ‹Expressions›
datatype bop = Eq | And | Less | Add | Sub ― ‹names of binary operations›
datatype expr
= Val val ― ‹value›
| Var vname ― ‹local variable›
| BinOp expr bop expr (‹_ «_¬ _› [80,0,81] 80) ― ‹binary operation›
fun binop :: "bop → val → val → val option"
where "binop Eq v1 v2 = Some(Bool(v1 = v2))"
| "binop And (Bool b1) (Bool b2) = Some(Bool(b1 ∧ b2))"
| "binop Less (Intg i1) (Intg i2) = Some(Bool(i1 < i2))"
| "binop Add (Intg i1) (Intg i2) = Some(Intg(i1 + i2))"
| "binop Sub (Intg i1) (Intg i2) = Some(Intg(i1 - i2))"
| "binop bop v1 v2 = None"
subsection ‹Commands›
datatype cmd
= Skip
| LAss vname expr (‹_:=_› [70,70] 70) ― ‹local assignment›
| Seq cmd cmd (‹_;;/ _› [60,61] 60)
| Cond expr cmd cmd (‹if '(_') _/ else _› [80,79,79] 70)
| While expr cmd (‹while '(_') _› [80,79] 70)
| Call pname "expr list" "vname list"
― ‹Call needs procedure, actual parameters and variables for return values›
fun num_inner_nodes :: "cmd → nat" (‹#:_›)
where "#:Skip = 1"
| "#:(V:=e) = 2" (* additional Skip node *)
| "#:(c1;;c2) = #:c1 + #:c2"
| "#:(if (b) c1 else c2) = #:c1 + #:c2 + 1"
| "#:(while (b) c) = #:c + 2" (* additional Skip node *)
| "#:(Call p es rets) = 2" (* additional Skip (=Return) node *)
lemma num_inner_nodes_gr_0 [simp]:"#:c > 0"
by(induct c) auto
lemma [dest]:"#:c = 0 ==> False"
by(induct c) auto
end
¤ Dauer der Verarbeitung: 0.0 Sekunden
(vorverarbeitet am 2026-11-04)
¤
*© Formatika GbR, Deutschland