Theory Decl (Isabelle2005: October 2005)

# Theory Decl

Up to index of Isabelle/HOL/NanoJava

theory Decl
imports Term
begin

    (*  Title:      HOL/NanoJava/Decl.thy
        ID:         $Id: Decl.thy,v 1.7 2005/06/17 14:13:09 haftmann Exp $
        Author:     David von Oheimb
        Copyright   2001 Technische Universitaet Muenchen
    *)

    header "Types, class Declarations, and whole programs"

    theory Decl imports Term begin

    datatype ty
      = NT           --{* null type  *}
      | Class cname  --{* class type *}

    text{* Field declaration *}
    types   fdecl
            = "fname × ty"

    record  methd
            = par :: ty
              res :: ty
              lcl ::"(vname × ty) list"
              bdy :: stmt

    text{* Method declaration *}
    types   mdecl
            = "mname × methd"

    record  class
            = super   :: cname
              flds    ::"fdecl list"
              methods ::"mdecl list"

    text{* Class declaration *}
    types   cdecl
            = "cname × class"

    types   prog
            = "cdecl list"

    translations
      "fdecl" \<leftharpoondown> (type)"fname × ty"
      "mdecl" \<leftharpoondown> (type)"mname × ty × ty × stmt"
      "class" \<leftharpoondown> (type)"cname × fdecl list × mdecl list"
      "cdecl" \<leftharpoondown> (type)"cname × class"
      "prog " \<leftharpoondown> (type)"cdecl list"

    consts

      Prog    :: prog       --{* program as a global value *}
      Object  :: cname      --{* name of root class *}

    constdefs
      class      :: "cname \<rightharpoonup> class"
     "class      ≡ map_of Prog"

      is_class   :: "cname => bool"
     "is_class C ≡ class C ≠ None"

    lemma finite_is_class: "finite {C. is_class C}"
    apply (unfold is_class_def class_def)
    apply (fold dom_def)
    apply (rule finite_dom_map_of)
    done

    end

lemma finite_is_class:

      finite {C. is_class C}