(************************************************************************* * Copyright (C) * 2019-2022 The University of Exeter * 2018-2022 The University of Paris-Saclay * 2018 The University of Sheffield * * License: * This program can be redistributed and/or modified under the terms * of the 2-clause BSD-style license. * * SPDX-License-Identifier: BSD-2-Clause *************************************************************************) chapter \The Document Ontology Framework for Isabelle\ text\ Offering \<^item> text-elements that can be annotated with meta-information \<^item> typed links to text-elements via specifically generated anti-quotations \<^item> typed structure of this meta-information specifiable in an Ontology-Language ODL providing syntax and PIDE support of document classes \<^item> inner-syntax-antiquotations (ISA's) allowing to reference Isabelle-entities such as types, terms, theorems inside the meta-information \<^item> monitors allowing to enforce a specific textual structure of an Isabelle Document \<^item> a basic infrastructure to define class invariants (for continuous checking of meta-information side-conditions of text-elements \<^item> LaTeX support. \ text\ In this section, we develop on the basis of a management of references Isar-markups that provide direct support in the PIDE framework. \ theory Isa_DOF (* Isabelle Document Ontology Framework *) imports Main RegExpInterface (* Interface to functional regular automata for monitoring *) keywords "+=" ":=" "accepts" "rejects" "invariant" and "open_monitor*" "close_monitor*" "declare_reference*" "update_instance*" "doc_class" "onto_class" (* a syntactic alternative *) "ML*" "define_shortcut*" "define_macro*" :: thy_decl and "text*" "text-macro*" :: document_body and "term*" "value*" "assert*" :: document_body and "use_template" "use_ontology" :: thy_decl and "define_template" "define_ontology" :: thy_load and "print_doc_classes" "print_doc_items" "print_doc_class_template" "check_doc_global" "list_ontologies" "list_templates" :: diag begin text\ @{footnote \sdf\}, @{file "$ISABELLE_HOME/src/Pure/ROOT.ML"}\ section\Primitive Markup Generators\ ML\ val docrefN = "docref"; val docclassN = "doc_class"; val onto_classN = "onto_class"; (** name components **) val defN = "def" val def_suffixN = "_" ^ defN val defsN = defN ^ "s" val instances_of_suffixN = "_instances" val invariant_suffixN = "_inv" val instance_placeholderN = "\" val makeN = "make" val schemeN = "_scheme" val instanceN = "instance" val monitor_infoN = "monitor_info" val isa_transformerN = "isa_transformer" val ml_invariantN = "ml_invariant" (* derived from: theory_markup *) fun docref_markup_gen refN def name id pos = if id = 0 then Markup.empty else Position.make_entity_markup {def = def} id refN (name, pos); (* or better store the thy-name as property ? ? ? *) val docref_markup = docref_markup_gen docrefN val docclass_markup = docref_markup_gen docclassN \ section\ Utilities\ ML\ fun spy x y = (writeln (x ^ y); y) fun markup2string x = XML.content_of (YXML.parse_body x) (* a hacky, but save encoding of unicode comming from the interface to the string format that can be parsed by the inner-syntax string parser ''dfdf''. *) fun bstring_to_holstring ctxt x (* (x:bstring) *) : string = let val term = Syntax.parse_term ctxt (markup2string x) fun hpp x = if x = #"\\" then "@" else if x = #"@" then "@@" else String.implode [x] in term |> Sledgehammer_Util.hackish_string_of_term ctxt |> map hpp o String.explode |> String.concat end; fun chopper p (x:string) = let fun hss buff [] = rev buff |hss buff (S as a::R) = if p a then let val (front,rest) = chop_prefix p S in hss (String.implode front :: buff) rest end else let val (front,rest) = chop_prefix (not o p) S in hss (String.implode front ::buff) rest end in hss [] (String.explode x) end; fun holstring_to_bstring ctxt (x:string) : bstring = let fun collapse "" = "" |collapse S = if String.sub(S,0) = #"@" then let val n = String.size S val front = replicate (n div 2) #"@" val back = if (n mod 2)=1 then [#"\\"] else [] in String.implode (front @ back) end else S; val t = String.concat (map collapse (chopper (fn x => x = #"@") x)); in t |> Syntax.string_of_term ctxt o Syntax.parse_term ctxt end; fun map_option _ NONE = NONE |map_option f (SOME x) = SOME (f x); fun map_optional _ s NONE = s |map_optional f _ (SOME x) = f x; fun map_fst f (x,y) = (f x,y) fun map_snd f (x,y) = (x,f y) fun map_eq_fst_triple f (x,_,_) (y,_,_) = equal (f x) (f y) \ section\ A HomeGrown Document Type Management (the ''Model'') \ ML\ structure DOF_core = struct datatype onto_class = Onto_Class of {params : (string * sort) list, (*currently not used *) name : binding, virtual : {virtual : bool}, inherits_from : (typ list * string) option, (* imports *) attribute_decl : (binding*typ*term option)list, (* class local *) rejectS : term list, rex : term list, invs : ((string * Position.T) * term) list } (* monitoring regexps --- product semantics*) fun make_onto_class (params, name, virtual, inherits_from, attribute_decl , rejectS, rex, invs) = Onto_Class {params = params, name = name, virtual = virtual, inherits_from = inherits_from , attribute_decl = attribute_decl, rejectS = rejectS , rex = rex, invs = invs} structure Onto_Classes = Theory_Data ( type T = onto_class Name_Space.table; val empty : T = Name_Space.empty_table onto_classN; fun merge data : T = Name_Space.merge_tables data; ); val get_onto_classes = Onto_Classes.get o Proof_Context.theory_of fun get_onto_class_global name thy = Name_Space.check (Context.Theory thy) (get_onto_classes (Proof_Context.init_global thy)) (name, Position.none) |> #2 fun resolve_syn thy name = name |> Syntax.read_typ_global thy |> Syntax.string_of_typ_global thy |> YXML.parse_body |> XML.content_of (* takes class synonyms into account *) fun get_onto_class_global' name thy = let val name' = name |> resolve_syn thy in Name_Space.check (Context.Theory thy) (get_onto_classes (Proof_Context.init_global thy)) (name', Position.none) |> #2 end fun get_onto_class_name_global name thy = Name_Space.check (Context.Theory thy) (get_onto_classes (Proof_Context.init_global thy)) (name, Position.none) |> #1 (* takes class synonyms into account *) fun get_onto_class_name_global' name thy = let val name' = name |> resolve_syn thy in Name_Space.check (Context.Theory thy) (get_onto_classes (Proof_Context.init_global thy)) (name', Position.none) |> #1 end fun check_onto_class ctxt = #1 o Name_Space.check (Context.Proof ctxt) (get_onto_classes ctxt); fun add_onto_class name onto_class thy = thy |> Onto_Classes.map (Name_Space.define (Context.Theory thy) true (name, onto_class) #> #2); fun update_onto_class name onto_class thy = thy |> Onto_Classes.map (Name_Space.define (Context.Theory thy) false (name, onto_class) #> #2); fun update_onto_class_entry name new_onto_class = Onto_Classes.map (Name_Space.map_table_entry name (K new_onto_class)); fun print_onto_classes verbose ctxt = Pretty.big_list "Isabelle.DOF Onto_Classes:" (map (Pretty.mark_str o #1) (Name_Space.markup_table verbose ctxt (get_onto_classes ctxt))) |> Pretty.writeln; fun the_onto_class T i = (case Name_Space.lookup_key T i of SOME entry => entry | NONE => raise TYPE ("Unknown onto_class: " ^ quote i, [], [])); val tag_attr = (\<^binding>\tag_attribute\, \<^Type>\int\, Mixfix.NoSyn) (* Attribute hidden to the user and used internally by isabelle_DOF. For example, this allows to add a specific id to a class to be able to reference the class internally. *) val default_cid = "text" (* the top (default) document class: everything is a text.*) fun is_subclass0 s t ctxt = let fun get id = if id = default_cid then default_cid else check_onto_class ctxt (id, Position.none) val s' = get s val t' = get t fun father_is_sub s = case get_onto_class_global s (Proof_Context.theory_of ctxt) of (Onto_Class {inherits_from=NONE, ...}) => s' = t' | (Onto_Class {inherits_from=SOME (_,s''), ...}) => s'' = t' orelse father_is_sub s'' val s'_defined = s' |> Name_Space.declared (get_onto_classes ctxt |> Name_Space.space_of_table) in s' = t' orelse (t' = default_cid andalso s'_defined) orelse (s' <> default_cid andalso father_is_sub s') end datatype instance = Instance of {defined: bool, input_term: term, value: term, inline: bool, cid: string, vcid: string option} val empty_instance = Instance {defined = false, input_term = \<^term>\()\, value = \<^term>\()\, inline = false, cid = "", vcid = NONE} fun make_instance (defined, input_term, value, inline, cid, vcid) = Instance {defined = defined, input_term = input_term, value = value, inline = inline , cid = cid, vcid = vcid} structure Instances = Theory_Data ( type T = instance Name_Space.table; val empty : T = Name_Space.empty_table instanceN; fun merge data : T = Name_Space.merge_tables data; ); val get_instances = Instances.get o Proof_Context.theory_of fun get_instance_global oid thy = Name_Space.check (Context.Theory thy) (get_instances (Proof_Context.init_global thy)) (oid, Position.none) |> #2 fun get_instance_name_global oid thy = Name_Space.check (Context.Theory thy) (get_instances (Proof_Context.init_global thy)) (oid, Position.none) |> #1 fun check_instance ctxt = #1 o Name_Space.check (Context.Proof ctxt) (get_instances ctxt); fun add_instance name instance thy = thy |> Instances.map (Name_Space.define (Context.Theory thy) true (name, instance) #> #2); fun update_instance name instance thy = thy |> Instances.map (Name_Space.define (Context.Theory thy) false (name, instance) #> #2); fun update_instance_entry name new_instance = Instances.map (Name_Space.map_table_entry name (K new_instance)); fun print_instances verbose ctxt = Pretty.big_list "Isabelle.DOF Instances:" (map (Pretty.mark_str o #1) (Name_Space.markup_table verbose ctxt (get_instances ctxt))) |> Pretty.writeln; fun the_instance T i = (case Name_Space.lookup_key T i of SOME entry => entry | NONE => raise TYPE ("Unknown instance: " ^ quote i, [], [])); datatype isa_transformer = ISA_Transformer of {check : (theory -> term * typ * Position.T -> string -> term option), elaborate : (theory -> string -> typ -> term option -> Position.T -> term)} fun make_isa_transformer (check, elaborate) = ISA_Transformer {check = check, elaborate = elaborate} structure ISA_Transformers = Theory_Data ( type T = isa_transformer Name_Space.table; val empty : T = Name_Space.empty_table isa_transformerN; fun merge data : T = Name_Space.merge_tables data; ); val get_isa_transformers = ISA_Transformers.get o Proof_Context.theory_of fun check_isa_transformer ctxt = #1 o Name_Space.check (Context.Proof ctxt) (get_isa_transformers ctxt); fun add_isa_transformer name isa_transformer thy = thy |> ISA_Transformers.map (Name_Space.define (Context.Theory thy) true (name, isa_transformer) #> #2); fun update_isa_transformer name isa_transformer thy = thy |> ISA_Transformers.map (Name_Space.define (Context.Theory thy) false (name, isa_transformer) #> #2); fun update_isa_transformer_entry name new_isa_transformer thy = ISA_Transformers.map (Name_Space.map_table_entry name (K new_isa_transformer)); fun print_isa_transformers verbose ctxt = Pretty.big_list "Isabelle.DOF ISA_Transformers:" (map (Pretty.mark_str o #1) (Name_Space.markup_table verbose ctxt (get_isa_transformers ctxt))) |> Pretty.writeln; fun the_isa_transformer T i = (case Name_Space.lookup_key T i of SOME entry => entry | NONE => raise TYPE ("Unknown isa_transformer: " ^ quote i, [], [])); type ml_invariant = string -> {is_monitor:bool} -> Context.generic -> bool structure ML_Invariants = Theory_Data ( type T = ml_invariant Name_Space.table; val empty : T = Name_Space.empty_table ml_invariantN; fun merge data : T = Name_Space.merge_tables data; ); val get_ml_invariants = ML_Invariants.get o Proof_Context.theory_of fun get_ml_invariant_global cid thy = Name_Space.check (Context.Theory thy) (get_ml_invariants (Proof_Context.init_global thy)) (cid, Position.none) |> #2 fun get_ml_invariant_name_global cid thy = Name_Space.check (Context.Theory thy) (get_ml_invariants (Proof_Context.init_global thy)) (cid, Position.none) |> #1 fun check_ml_invariant ctxt = #1 o Name_Space.check (Context.Proof ctxt) (get_ml_invariants ctxt); fun add_ml_invariant name ml_invariant thy = thy |> ML_Invariants.map (Name_Space.define (Context.Theory thy) true (name, ml_invariant) #> #2); fun update_ml_invariant name ml_invariant thy = thy |> ML_Invariants.map (Name_Space.define (Context.Theory thy) false (name, ml_invariant) #> #2); fun update_ml_invariant_entry name new_ml_invariant = ML_Invariants.map (Name_Space.map_table_entry name (K new_ml_invariant)); fun print_ml_invariants verbose ctxt = Pretty.big_list "Isabelle.DOF ML_Invariants:" (map (Pretty.mark_str o #1) (Name_Space.markup_table verbose ctxt (get_ml_invariants ctxt))) |> Pretty.writeln; fun the_ml_invariant T i = (case Name_Space.lookup_key T i of SOME entry => entry | NONE => raise TYPE ("Unknown ml_invariant: " ^ quote i, [], [])); structure Opening_ML_Invariants = Theory_Data ( type T = ml_invariant Name_Space.table; val empty : T = Name_Space.empty_table ml_invariantN; fun merge data : T = Name_Space.merge_tables data; ); val get_opening_ml_invariants = Opening_ML_Invariants.get o Proof_Context.theory_of fun get_opening_ml_invariant_global cid thy = Name_Space.check (Context.Theory thy) (get_opening_ml_invariants (Proof_Context.init_global thy)) (cid, Position.none) |> #2 fun get_opening_ml_invariant_name_global cid thy = Name_Space.check (Context.Theory thy) (get_opening_ml_invariants (Proof_Context.init_global thy)) (cid, Position.none) |> #1 fun check_opening_ml_invariant ctxt = #1 o Name_Space.check (Context.Proof ctxt) (get_opening_ml_invariants ctxt); fun add_opening_ml_invariant name opening_ml_invariant thy = thy |> Opening_ML_Invariants.map (Name_Space.define (Context.Theory thy) true (name, opening_ml_invariant) #> #2); fun update_opening_ml_invariant name opening_ml_invariant thy = thy |> Opening_ML_Invariants.map (Name_Space.define (Context.Theory thy) false (name, opening_ml_invariant) #> #2); fun update_opening_ml_invariant_entry name new_opening_ml_invariant = Opening_ML_Invariants.map (Name_Space.map_table_entry name (K new_opening_ml_invariant)); fun print_opening_ml_invariants verbose ctxt = Pretty.big_list "Isabelle.DOF Opening_ML_Invariants:" (map (Pretty.mark_str o #1) (Name_Space.markup_table verbose ctxt (get_opening_ml_invariants ctxt))) |> Pretty.writeln; fun the_opening_ml_invariant T i = (case Name_Space.lookup_key T i of SOME entry => entry | NONE => raise TYPE ("Unknown opening_ml_invariant: " ^ quote i, [], [])); structure Closing_ML_Invariants = Theory_Data ( type T = ml_invariant Name_Space.table; val empty : T = Name_Space.empty_table ml_invariantN; fun merge data : T = Name_Space.merge_tables data; ); val get_closing_ml_invariants = Closing_ML_Invariants.get o Proof_Context.theory_of fun get_closing_ml_invariant_global cid thy = Name_Space.check (Context.Theory thy) (get_closing_ml_invariants (Proof_Context.init_global thy)) (cid, Position.none) |> #2 fun get_closing_ml_invariant_name_global cid thy = Name_Space.check (Context.Theory thy) (get_closing_ml_invariants (Proof_Context.init_global thy)) (cid, Position.none) |> #1 fun check_closing_ml_invariant ctxt = #1 o Name_Space.check (Context.Proof ctxt) (get_closing_ml_invariants ctxt); fun add_closing_ml_invariant name closing_ml_invariant thy = thy |> Closing_ML_Invariants.map (Name_Space.define (Context.Theory thy) true (name, closing_ml_invariant) #> #2); fun update_closing_ml_invariant name closing_ml_invariant thy = thy |> Closing_ML_Invariants.map (Name_Space.define (Context.Theory thy) false (name, closing_ml_invariant) #> #2); fun update_closing_ml_invariant_entry name new_closing_ml_invariant = Closing_ML_Invariants.map (Name_Space.map_table_entry name (K new_closing_ml_invariant)); fun print_closing_ml_invariants verbose ctxt = Pretty.big_list "Isabelle.DOF Closing_ML_Invariants:" (map (Pretty.mark_str o #1) (Name_Space.markup_table verbose ctxt (get_closing_ml_invariants ctxt))) |> Pretty.writeln; fun the_closing_ml_invariant T i = (case Name_Space.lookup_key T i of SOME entry => entry | NONE => raise TYPE ("Unknown closing_ml_invariant: " ^ quote i, [], [])); datatype monitor_info = Monitor_Info of {accepted_cids : string list, rejected_cids : string list, automatas : RegExpInterface.automaton list} fun make_monitor_info (accepted_cids, rejected_cids, automatas) = Monitor_Info {accepted_cids = accepted_cids, rejected_cids = rejected_cids, automatas = automatas} structure Monitor_Info = Theory_Data ( type T = monitor_info Name_Space.table; val empty : T = Name_Space.empty_table monitor_infoN; fun merge data : T = Name_Space.merge_tables data; ); val get_monitor_infos = Monitor_Info.get o Proof_Context.theory_of fun get_monitor_info_global oid thy = Name_Space.check (Context.Theory thy) (get_monitor_infos (Proof_Context.init_global thy)) (oid, Position.none) |> #2 fun get_monitor_info_name_global oid thy = Name_Space.check (Context.Theory thy) (get_monitor_infos (Proof_Context.init_global thy)) (oid, Position.none) |> #1 fun check_monitor_info ctxt = #1 o Name_Space.check (Context.Proof ctxt) (get_monitor_infos ctxt); fun add_monitor_info name monitor_info thy = thy |> Monitor_Info.map (Name_Space.define (Context.Theory thy) true (name, monitor_info) #> #2); fun update_monitor_info name monitor_info thy = thy |> Monitor_Info.map (Name_Space.define (Context.Theory thy) false (name, monitor_info) #> #2); fun update_monitor_info_entry name new_monitor_info = Monitor_Info.map (Name_Space.map_table_entry name (K new_monitor_info)); fun print_monitors_infos verbose ctxt = Pretty.big_list "Isabelle.DOF Monitor_Infos:" (map (Pretty.mark_str o #1) (Name_Space.markup_table verbose ctxt (get_monitor_infos ctxt))) |> Pretty.writeln; fun the_monitor_info T i = (case Name_Space.lookup_key T i of SOME entry => entry | NONE => raise TYPE ("Unknown monitor_info: " ^ quote i, [], [])); fun get_accepted_cids (Monitor_Info {accepted_cids, ... }) = accepted_cids fun get_rejected_cids (Monitor_Info {rejected_cids, ... }) = rejected_cids fun get_alphabet monitor_info = (get_accepted_cids monitor_info) @ (get_rejected_cids monitor_info) fun get_automatas (Monitor_Info {automatas, ... }) = automatas (* doc-class-name management: We still use the record-package for internally representing doc-classes. The main motivation is that "links" to entities are types over doc-classes, *types* in the Isabelle sense, enriched by additional data. This has the advantage that the type-inference can be abused to infer long-names for doc-class-names. Note, however, that doc-classes are currently implemented by non-polymorphic records only; this means that the extensible "_ext" versions of type names must be reduced to qualifier names only. The used Syntax.parse_typ handling the identification does that already. However, we use Syntax.read_typ in order to allow type-synonyms which requires an appropriate adaption in read_cid.*) fun is_subclass (ctxt) s t = is_subclass0 s t ctxt fun is_subclass_global thy s t = let val ctxt = Proof_Context.init_global thy in is_subclass0 s t ctxt end fun typ_to_cid (Type(s,[\<^Type>\unit\])) = Long_Name.qualifier s |typ_to_cid (Type(_,[T])) = typ_to_cid T |typ_to_cid _ = error("type is not an ontological type.") fun get_onto_class_name_super_class_global _ "text" = default_cid | get_onto_class_name_super_class_global thy cid = get_onto_class_name_global' cid thy fun is_virtual cid thy = let val Onto_Class {virtual, ...} = get_onto_class_global' cid thy in virtual |> #virtual end val SPY = Unsynchronized.ref(Bound 0) fun check_regexps term = let val _ = case fold_aterms Term.add_free_names term [] of n::_ => error("No free variables allowed in monitor regexp:" ^ n) | _ => () val _ = case fold_aterms Term.add_var_names term [] of (n,_)::_ => error("No schematic variables allowed in monitor regexp:" ^ n) | _ => () (* Missing: Checks on constants such as undefined, ... *) in term end fun check_reject_atom term = let val _ = case fold_aterms Term.add_free_names term [] of n::_ => error("No free variables allowed in monitor regexp:" ^ n) | _ => () val _ = case fold_aterms Term.add_var_names term [] of (n,_)::_ => error("No schematic variables allowed in monitor regexp:" ^ n) | _ => () (* Missing: Checks on constants such as undefined, ... *) in term end fun define_doc_class_global (params', binding) parent fields rexp reject_Atoms invs virtual thy = (* This operation is executed in a context where the record has already been defined, but its conversion into a class is not yet done. *) let (*val cid = (Binding.name_of binding) val _ = if is_defined_cid_global cid thy then error("redefinition of document class:"^cid ) else ()*) (* takes class synonyms into account *) val parent' = map_option (map_snd (fn x => get_onto_class_name_global' x thy)) parent val rejectS = map (Syntax.read_term_global thy) reject_Atoms; val _ = map (check_reject_atom) rejectS; val reg_exps = map (Syntax.read_term_global thy) rexp; val _ = map check_regexps reg_exps val _ = if not(null rejectS) andalso (null reg_exps) then error ("reject clause requires accept clause ! " ) else (); val _ = if has_duplicates (op =) (map (fst o fst) invs) then error("invariant labels must be unique"^ Position.here (snd(fst(hd invs)))) else () val invs' = map (map_snd(Syntax.read_term_global thy)) invs in thy |> add_onto_class binding (make_onto_class (params', binding, virtual, parent', fields , rejectS, reg_exps, invs')) end fun define_object_global {define = define} ((oid, pos), instance) thy = let val binding = if Long_Name.is_qualified oid then Binding.make (Long_Name.base_name oid, pos) else Binding.make (oid, pos) val undefined_instance = "undefined_instance" val (oid', instance') = Name_Space.check (Context.Theory thy) (get_instances (Proof_Context.init_global thy)) (oid, Position.none) handle ERROR _ => (undefined_instance, empty_instance) val Instance {input_term, value, inline, cid, vcid, ...} = instance val instance'' = make_instance (define, input_term, value, inline, cid, vcid) in if oid' = undefined_instance andalso instance' = empty_instance then add_instance binding instance'' thy else if define then let val Instance {defined, ...} = instance' in if defined then add_instance binding instance'' thy else update_instance_entry oid' instance'' thy end else add_instance binding instance thy end fun get_attributes_local cid ctxt = if cid = default_cid then [] else let val cid_long = get_onto_class_name_global cid (Proof_Context.theory_of ctxt) in case get_onto_class_global cid (Proof_Context.theory_of ctxt) of Onto_Class {inherits_from=NONE, attribute_decl = X, ...} => [(cid_long,X)] | Onto_Class {inherits_from=SOME(_,father), attribute_decl = X, ...} => get_attributes_local father ctxt @ [(cid_long,X)] end fun get_attributes cid thy = get_attributes_local cid (Proof_Context.init_global thy) fun get_all_attributes_local cid ctxt = (tag_attr, get_attributes_local cid ctxt) fun get_all_attributes cid thy = get_all_attributes_local cid (Proof_Context.init_global thy) type attributes_info = { def_occurrence : string, def_pos : Position.T, long_name : string, typ : typ } fun get_attribute_info_local (*long*)cid attr ctxt : attributes_info option= let val hierarchy = get_attributes_local cid ctxt (* search in order *) fun found (s,L) = case find_first (fn (bind,_,_) => Binding.name_of bind = attr) L of NONE => NONE | SOME X => SOME(s,X) in case get_first found hierarchy of NONE => NONE | SOME (cid',(bind, ty,_)) => SOME({def_occurrence = cid, def_pos = Binding.pos_of bind, long_name = cid'^"."^(Binding.name_of bind), typ = ty}) end fun get_attribute_info (*long*)cid attr thy = get_attribute_info_local cid attr (Proof_Context.init_global thy) fun get_attribute_defaults (* long*)cid thy = let val attrS = flat(map snd (get_attributes cid thy)) fun trans (_,_,NONE) = NONE |trans (na,ty,SOME def) =SOME(na,ty, def) in map_filter trans attrS end fun get_value_global oid thy = let val Instance v = get_instance_global oid thy in v |> #value end fun get_value_local oid ctxt = let val Instance v = get_instance_global oid (Proof_Context.theory_of ctxt) in v |> #value end (* missing : setting terms to ground (no type-schema vars, no schema vars. )*) fun binding_from_pos get_objects get_object_name name thy = let val ns = get_objects (Proof_Context.init_global thy) |> Name_Space.space_of_table val {pos, ...} = Name_Space.the_entry ns (get_object_name name thy) in if Long_Name.is_qualified name then Binding.make (Long_Name.base_name name, pos) else Binding.make (name, pos)end fun binding_from_onto_class_pos name thy = binding_from_pos get_onto_classes get_onto_class_name_global name thy fun binding_from_instance_pos name thy = binding_from_pos get_instances get_instance_name_global name thy fun update_value_global name upd_value thy = let val binding = binding_from_instance_pos name thy val Instance {defined, input_term, value, inline, cid, vcid} = get_instance_global name thy val instance' = make_instance (defined, input_term, upd_value value, inline, cid, vcid) in update_instance binding instance' thy end fun update_input_term_global name upd_input_term thy = let val binding = binding_from_instance_pos name thy val Instance {defined, input_term, value, inline, cid, vcid} = get_instance_global name thy val instance' = make_instance (defined, upd_input_term input_term, value, inline, cid, vcid) in update_instance binding instance' thy end fun update_value_input_term_global name upd_input_term upd_value thy = update_value_global name upd_value thy |> update_input_term_global name upd_input_term val ISA_prefix = "Isabelle_DOF_" val doc_class_prefix = ISA_prefix ^ "doc_class_" fun is_ISA s = String.isPrefix ISA_prefix (Long_Name.base_name s) fun get_class_name_without_prefix s = String.extract (s, String.size(doc_class_prefix), NONE) fun get_doc_class_name_without_ISA_prefix s = String.extract (s, String.size(ISA_prefix), NONE) fun transduce_term_global {mk_elaboration=mk_elaboration} (term,pos) thy = (* pre: term should be fully typed in order to allow type-related term-transformations *) let val ctxt = Proof_Context.init_global thy val tab = get_isa_transformers ctxt fun T(Const(s,ty) $ t) = if is_ISA s then let val name = check_isa_transformer ctxt (s, Position.none) val (_, ISA_Transformer {check, elaborate}) = the_isa_transformer tab name in case check thy (t,ty,pos) s of NONE => Const(s,ty) $ t (* checking isa, may raise error though. *) | SOME t => if mk_elaboration then elaborate thy s ty (SOME t) pos else Const(s,ty) $ t (* transforming isa *) end else (Const(s,ty) $ (T t)) | T(t1 $ t2) = T(t1) $ T(t2) | T(Const(s,ty)) = if is_ISA s then let val name = check_isa_transformer ctxt (s, Position.none) val (_, ISA_Transformer {elaborate, ...}) = the_isa_transformer tab name in if mk_elaboration then elaborate thy s ty NONE pos else Const(s, ty) (* transforming isa *) end else Const(s, ty) | T(Abs(s,ty,t)) = Abs(s,ty,T t) | T t = t in T term end fun elaborate_term ctxt term = transduce_term_global {mk_elaboration=true} (term , Position.none) (Proof_Context.theory_of ctxt) fun check_term ctxt term = transduce_term_global {mk_elaboration=false} (term , Position.none) (Proof_Context.theory_of ctxt) fun print_doc_class_tree ctxt P T = let val classes = Name_Space.dest_table (get_onto_classes ctxt) fun is_class_son X (_, onto_class) = let val Onto_Class inherits_from = onto_class in (inherits_from |> #inherits_from) = X end fun tree _ [] = "" |tree lev ((n,_)::S) = (if P(lev,n) then "."^Int.toString lev^" "^(T n)^"{...}.\n" ^ (tree(lev + 1)(filter(is_class_son(SOME([],n))) classes)) else "."^Int.toString lev^" ... \n") ^ (tree lev S) val roots = filter(is_class_son NONE) classes in ".0 .\n" ^ tree 1 roots end val (object_value_debug, object_value_debug_setup) = Attrib.config_bool \<^binding>\object_value_debug\ (K false); val (strict_monitor_checking, strict_monitor_checking_setup) = Attrib.config_bool \<^binding>\strict_monitor_checking\ (K false); val (free_class_in_monitor_checking, free_class_in_monitor_checking_setup) = Attrib.config_bool \<^binding>\free_class_in_monitor_checking\ (K false); val (free_class_in_monitor_strict_checking, free_class_in_monitor_strict_checking_setup) = Attrib.config_bool \<^binding>\free_class_in_monitor_strict_checking\ (K false); val (invariants_checking, invariants_checking_setup) = Attrib.config_bool \<^binding>\invariants_checking\ (K true); val (invariants_strict_checking, invariants_strict_checking_setup) = Attrib.config_bool \<^binding>\invariants_strict_checking\ (K false); val (invariants_checking_with_tactics, invariants_checking_with_tactics_setup) = Attrib.config_bool \<^binding>\invariants_checking_with_tactics\ (K false); end (* struct *) \ setup\DOF_core.object_value_debug_setup #> DOF_core.strict_monitor_checking_setup #> DOF_core.free_class_in_monitor_checking_setup #> DOF_core.free_class_in_monitor_strict_checking_setup #> DOF_core.invariants_checking_setup #> DOF_core.invariants_strict_checking_setup #> DOF_core.invariants_checking_with_tactics_setup\ section\ Syntax for Term Annotation Antiquotations (TA)\ text\Isabelle/DOF allows for annotations at the term level, for which an antiquotation syntax and semantics is defined at the inner syntax level. (For this reasons, the mechanism has been called somewhat misleading \<^emph>\inner syntax antiquotations\ in earlier versions of Isabelle/DOF.) For the moment, only a fixed number of builtin TA's is supported, future versions might extend this feature substantially.\ subsection\ Syntax \ datatype "doc_class" = mk string \ \and others in the future : file, http, thy, ...\ datatype "typ" = Isabelle_DOF_typ string ("@{typ _}") datatype "term" = Isabelle_DOF_term string ("@{term _}") consts Isabelle_DOF_term_repr :: "string \ term" ("@{termrepr _}") datatype "thm" = Isabelle_DOF_thm string ("@{thm _}") datatype "file" = Isabelle_DOF_file string ("@{file _}") datatype "thy" = Isabelle_DOF_thy string ("@{thy _}") consts Isabelle_DOF_docitem :: "string \ 'a" ("@{docitem _}") datatype "docitem_attr" = Isabelle_DOF_docitem_attr string string ("@{docitemattr (_) :: (_)}") consts Isabelle_DOF_trace_attribute :: "string \ (string * string) list" ("@{trace-attribute _}") \ \Dynamic setup of inner syntax cartouche\ ML \ (* Author: Frédéric Tuong, Université Paris-Saclay *) (* Title: HOL/ex/Cartouche_Examples.thy Author: Makarius *) local fun mk_char (f_char, f_cons, _) (s, _) accu = fold (fn c => fn (accu, l) => (f_char c accu, f_cons c l)) (rev (map Char.ord (String.explode s))) accu; fun mk_string (_, _, f_nil) accu [] = (accu, f_nil) | mk_string f accu (s :: ss) = mk_char f s (mk_string f accu ss); in fun string_tr f f_mk accu content args = let fun err () = raise TERM ("string_tr", args) in (case args of [(c as Const (@{syntax_const "_constrain"}, _)) $ Free (s, _) $ p] => (case Term_Position.decode_position p of SOME (pos, _) => c $ f (mk_string f_mk accu (content (s, pos))) $ p | NONE => err ()) | _ => err ()) end; end; \ syntax "_cartouche_string" :: "cartouche_position \ _" ("_") ML\ structure Cartouche_Grammar = struct fun list_comb_mk cst n c = list_comb (Syntax.const cst, String_Syntax.mk_bits_syntax n c) val nil1 = Syntax.const @{const_syntax String.empty_literal} fun cons1 c l = list_comb_mk @{const_syntax String.Literal} 7 c $ l val default = [ ( "char list" , ( Const (@{const_syntax Nil}, @{typ "char list"}) , fn c => fn l => Syntax.const @{const_syntax Cons} $ list_comb_mk @{const_syntax Char} 8 c $ l , snd)) , ( "String.literal", (nil1, cons1, snd))] end \ ML\ fun parse_translation_cartouche binding l f_integer accu = let val cartouche_type = Attrib.setup_config_string binding (K (fst (hd l))) (* if there is no type specified, by default we set the first element to be the default type of cartouches *) in fn ctxt => let val cart_type = Config.get ctxt cartouche_type in case List.find (fn (s, _) => s = cart_type) l of NONE => error ("Unregistered return type for the cartouche: \"" ^ cart_type ^ "\"") | SOME (_, (nil0, cons, f)) => string_tr f (f_integer, cons, nil0) accu (Symbol_Pos.cartouche_content o Symbol_Pos.explode) end end \ parse_translation \ [( @{syntax_const "_cartouche_string"} , parse_translation_cartouche \<^binding>\cartouche_type\ Cartouche_Grammar.default (K I) ())] \ (* tests *) term "@{typ ''int => int''}" term "@{term ''Bound 0''}" term "@{thm ''refl''}" term "@{docitem ''''}" ML\ @{term "@{docitem ''''}"}\ term "@{typ \int \ int\}" term "@{term \\x. P x \ Q\}" term "@{thm \refl\}" term "@{docitem \doc_ref\}" ML\ @{term "@{docitem \doc_ref\}"}\ (**) declare [[cartouche_type = "String.literal"]] term "\Université\ :: String.literal" declare [[cartouche_type = "char list"]] term "\Université\ :: char list" subsection\ Semantics \ ML\ structure ISA_core = struct fun err msg pos = error (msg ^ Position.here pos); fun warn msg pos = warning (msg ^ Position.here pos); fun check_path check_file ctxt dir (name, pos) = let val _ = Context_Position.report ctxt pos (Markup.language_path true); (* TODO: pos should be "lifted" to type source *) val path = Path.append dir (Path.explode name) handle ERROR msg => err msg pos; val _ = Path.expand path handle ERROR msg => err msg pos; val _ = Context_Position.report ctxt pos (Markup.path (Path.implode_symbolic path)); val _ = (case check_file of NONE => path | SOME check => (check path handle ERROR msg => err msg pos)); in path end; fun ML_isa_antiq check_file thy (name, _, pos) = let val path = check_path check_file (Proof_Context.init_global thy) Path.current (name, pos); in "Path.explode " ^ ML_Syntax.print_string (Path.implode path) end; fun ML_isa_check_generic check thy (term, pos) = let val name = (HOLogic.dest_string term handle TERM(_,[t]) => error ("wrong term format: must be string constant: " ^ Syntax.string_of_term_global thy t )) val _ = check thy (name,pos) in SOME term end; fun check_identity _ (term, _, _) _ = SOME term fun ML_isa_check_typ thy (term, _, pos) _ = let fun check thy (name, _) = let val ctxt = (Proof_Context.init_global thy) in (Syntax.check_typ ctxt o Syntax.parse_typ ctxt) name end in ML_isa_check_generic check thy (term, pos) end fun ML_isa_check_term thy (term, _, pos) _ = let fun check thy (name, _) = let val ctxt = (Proof_Context.init_global thy) in (Syntax.check_term ctxt o Syntax.parse_term ctxt) name end in ML_isa_check_generic check thy (term, pos) end fun ML_isa_check_thm thy (term, _, pos) _ = (* this works for long-names only *) let fun check thy (name, _) = case Proof_Context.lookup_fact (Proof_Context.init_global thy) name of NONE => err ("No Theorem:" ^name) pos | SOME X => X in ML_isa_check_generic check thy (term, pos) end fun ML_isa_check_file thy (term, _, pos) _ = let fun check thy (name, pos) = check_path (SOME File.check_file) (Proof_Context.init_global thy) (Path.current) (name, pos); in ML_isa_check_generic check thy (term, pos) end; fun check_instance thy (term, _, pos) s = let val bname = Long_Name.base_name s; val qual = Long_Name.qualifier s; val class_name = Long_Name.qualify qual (String.extract(bname , String.size(DOF_core.doc_class_prefix), NONE)); fun check thy (name, _) = let val object_cid = let val DOF_core.Instance cid = DOF_core.get_instance_global name thy in cid |> #cid end fun check' (class_name, object_cid) = if class_name = object_cid then DOF_core.get_value_global name thy else err (name ^ " is not an instance of " ^ class_name) pos in check' (class_name, object_cid) end; in ML_isa_check_generic check thy (term, pos) end fun ML_isa_id thy (term,pos) = SOME term fun ML_isa_check_docitem thy (term, req_ty, pos) _ = let fun check thy (name, _) s = let val DOF_core.Instance {cid,...} = DOF_core.get_instance_global name thy val ns = DOF_core.get_instances (Proof_Context.init_global thy) |> Name_Space.space_of_table val {pos=pos', ...} = Name_Space.the_entry ns name val ctxt = (Proof_Context.init_global thy) val req_class = case req_ty of \<^Type>\fun _ T\ => DOF_core.typ_to_cid T | _ => error("can not infer type for: "^ name) in if cid <> DOF_core.default_cid andalso not(DOF_core.is_subclass ctxt cid req_class) then error("reference ontologically inconsistent: " ^cid^" vs. "^req_class^ Position.here pos') else () end in ML_isa_check_generic check thy (term, pos) end fun ML_isa_check_trace_attribute thy (term, _, pos) s = let val oid = (HOLogic.dest_string term handle TERM(_,[t]) => error ("wrong term format: must be string constant: " ^ Syntax.string_of_term_global thy t )) val _ = DOF_core.get_instance_global oid thy in SOME term end fun ML_isa_elaborate_generic (_:theory) isa_name ty term_option _ = case term_option of NONE => error("Wrong term option. You must use a defined term") | SOME term => Const (isa_name, ty) $ term fun elaborate_instance thy _ _ term_option pos = case term_option of NONE => error ("Malformed term annotation") | SOME term => let val instance_name = HOLogic.dest_string term val value = DOF_core.get_value_global instance_name thy in DOF_core.transduce_term_global {mk_elaboration=true} (value, pos) thy end (* The function declare_ISA_class_accessor_and_check_instance uses a prefix because the class name is already bound to "doc_class Regular_Exp.rexp" constant by add_doc_class_cmd function *) fun declare_ISA_class_accessor_and_check_instance doc_class_name = let val bind = Binding.prefix_name DOF_core.doc_class_prefix doc_class_name val typestring = "string => " ^ (Binding.name_of doc_class_name) (* Unfortunately due to different lexical conventions for constant symbols and mixfix symbols we can not use "_" for classes names in term antiquotation. We chose to convert "_" to "-".*) val conv_class_name = String.translate (fn #"_" => "-" | x => String.implode [x] ) (Binding.name_of doc_class_name) val mixfix_string = "@{" ^ conv_class_name ^ " _}" in Sign.add_consts_cmd [(bind, typestring, Mixfix.mixfix(mixfix_string))] #> DOF_core.add_isa_transformer bind ((check_instance, elaborate_instance) |> DOF_core.make_isa_transformer) end fun elaborate_instances_list thy isa_name _ _ pos = let val base_name = Long_Name.base_name isa_name fun get_isa_name_without_intances_suffix s = String.extract (s, 0, SOME (String.size(s) - String.size(instances_of_suffixN))) val base_name_without_suffix = get_isa_name_without_intances_suffix base_name val base_name' = DOF_core.get_class_name_without_prefix (base_name_without_suffix) val class_typ = Proof_Context.read_typ (Proof_Context.init_global thy) (base_name') val long_class_name = DOF_core.get_onto_class_name_global base_name' thy val values = thy |> Proof_Context.init_global |> DOF_core.get_instances |> Name_Space.dest_table |> filter (fn (_, instance) => let val DOF_core.Instance cid = instance in (cid |> #cid) = long_class_name end) |> map (fn (oid, _) => DOF_core.get_value_global oid thy) in HOLogic.mk_list class_typ values end fun declare_class_instances_annotation thy doc_class_name = let val bind = Binding.prefix_name DOF_core.doc_class_prefix doc_class_name |> Binding.suffix_name instances_of_suffixN val class_list_typ = Proof_Context.read_typ (Proof_Context.init_global thy) ((Binding.name_of doc_class_name) ^ " List.list") (* Unfortunately due to different lexical conventions for constant symbols and mixfix symbols we can not use "_" for classes names in term antiquotation. We chose to convert "_" to "-".*) val conv_class_name' = String.translate (fn #"_" => "-" | x=> String.implode [x]) ((Binding.name_of doc_class_name) ^ instances_of_suffixN) val mixfix_string = "@{" ^ conv_class_name' ^ "}" in Sign.add_consts [(bind, class_list_typ, Mixfix.mixfix(mixfix_string))] #> DOF_core.add_isa_transformer bind ((check_identity, elaborate_instances_list) |> DOF_core.make_isa_transformer) end fun symbex_attr_access0 ctxt proj_term term = let val [subterm'] = Type_Infer_Context.infer_types ctxt [proj_term $ term] in Value_Command.value ctxt (subterm') end fun compute_attr_access ctxt attr oid pos_option pos' = (* template *) let val value = DOF_core.get_value_global oid (Context.theory_of ctxt) val ctxt' = Context.proof_of ctxt val thy = Context.theory_of ctxt val DOF_core.Instance {cid,...} = DOF_core.get_instance_global oid thy val instances = DOF_core.get_instances ctxt' val markup = DOF_core.get_instance_name_global oid thy |> Name_Space.markup (Name_Space.space_of_table instances) val _ = Context_Position.report ctxt' pos' markup; val (* (long_cid, attr_b,ty) = *) {long_name, typ=ty, ...} = case DOF_core.get_attribute_info_local cid attr ctxt' of SOME f => f | NONE => error("attribute undefined for reference: " ^ oid ^ Position.here (the pos_option handle Option.Option => error("Attribute " ^ attr ^ " undefined for reference: " ^ oid ^ Position.here pos'))) val proj_term = Const(long_name,dummyT --> ty) val _ = case pos_option of NONE => () | SOME pos => let val class_name = Long_Name.qualifier long_name val onto_classes = DOF_core.get_onto_classes ctxt' val markup = DOF_core.get_onto_class_name_global class_name thy |> Name_Space.markup (Name_Space.space_of_table onto_classes) in Context_Position.report ctxt' pos markup end in symbex_attr_access0 ctxt' proj_term value end fun ML_isa_elaborate_trace_attribute (thy:theory) _ _ term_option pos = case term_option of NONE => err ("Malformed term annotation") pos | SOME term => let val oid = HOLogic.dest_string term val traces = compute_attr_access (Context.Theory thy) "trace" oid NONE pos fun conv (\<^Const>\Pair \<^typ>\doc_class rexp\ \<^typ>\string\\ $ (\<^Const>\Atom \<^typ>\doc_class\\ $ (\<^Const>\mk\ $ s)) $ S) = let val s' = DOF_core.get_onto_class_name_global (HOLogic.dest_string s) thy in \<^Const>\Pair \<^typ>\string\ \<^typ>\string\\ $ HOLogic.mk_string s' $ S end val traces' = map conv (HOLogic.dest_list traces) in HOLogic.mk_list \<^Type>\prod \<^typ>\string\ \<^typ>\string\\ traces' end (* utilities *) fun property_list_dest ctxt X = map (fn \<^Const_>\Isabelle_DOF_term for s\ => HOLogic.dest_string s |\<^Const_>\Isabelle_DOF_term_repr for s\ => holstring_to_bstring ctxt (HOLogic.dest_string s)) (HOLogic.dest_list X) end; (* struct *) \ subsection\ Isar - Setup\ (* Isa_transformers declaration for Isabelle_DOF term anti-quotations (typ, term, thm, etc.). They must be declared in the same theory file as the one of the declaration of Isabelle_DOF term anti-quotations !!! *) setup\ [(\<^type_name>\typ\, ISA_core.ML_isa_check_typ, ISA_core.ML_isa_elaborate_generic) , (\<^type_name>\term\, ISA_core.ML_isa_check_term, ISA_core.ML_isa_elaborate_generic) , (\<^type_name>\thm\, ISA_core.ML_isa_check_thm, ISA_core.ML_isa_elaborate_generic) , (\<^type_name>\file\, ISA_core.ML_isa_check_file, ISA_core.ML_isa_elaborate_generic)] |> fold (fn (n, check, elaborate) => fn thy => let val ns = Sign.tsig_of thy |> Type.type_space val name = n val {pos, ...} = Name_Space.the_entry ns name val bname = Long_Name.base_name name val binding = Binding.make (bname, pos) |> Binding.prefix_name DOF_core.ISA_prefix |> Binding.prefix false bname in DOF_core.add_isa_transformer binding ((check, elaborate) |> DOF_core.make_isa_transformer) thy end) #> ([(\<^const_name>\Isabelle_DOF_term_repr\, ISA_core.check_identity, ISA_core.ML_isa_elaborate_generic) ,(\<^const_name>\Isabelle_DOF_docitem\, ISA_core.ML_isa_check_docitem, ISA_core.ML_isa_elaborate_generic) ,(\<^const_name>\Isabelle_DOF_trace_attribute\, ISA_core.ML_isa_check_trace_attribute, ISA_core.ML_isa_elaborate_trace_attribute)] |> fold (fn (n, check, elaborate) => fn thy => let val ns = Sign.consts_of thy |> Consts.space_of val name = n val {pos, ...} = Name_Space.the_entry ns name val bname = Long_Name.base_name name val binding = Binding.make (bname, pos) in DOF_core.add_isa_transformer binding ((check, elaborate) |> DOF_core.make_isa_transformer) thy end)) \ section\ Syntax for Annotated Documentation Commands (the '' View'' Part I) \ (* ================== 2018 ====================================================== (* Exported from Pure_Syn *) fun output_document state markdown txt = let val ctxt = Toplevel.presentation_context state; val _ = Context_Position.report ctxt (Input.pos_of txt) (Markup.language_document (Input.is_delimited txt)); in Thy_Output.output_document ctxt markdown txt end; fun document_command markdown (loc, txt) = Toplevel.keep (fn state => (case loc of NONE => ignore (output_document state markdown txt) | SOME (_, pos) => error ("Illegal target specification -- not a theory context" ^ Position.here pos))) o Toplevel.present_local_theory loc (fn state => ignore (output_document state markdown txt)); ====================== 2017 =================================================== (* Exported from Thy_Output *) fun document_command markdown (loc, txt) = Toplevel.keep (fn state => (case loc of NONE => ignore (output_text state markdown txt) | SOME (_, pos) => error ("Illegal target specification -- not a theory context" ^ Position.here pos))) o Toplevel.present_local_theory loc (fn state => ignore (output_text state markdown txt)); *) ML\ structure ODL_Meta_Args_Parser = struct type meta_args_t = (((string * Position.T) * (string * Position.T) option) * ((string * Position.T) * string) list) val empty_meta_args = ((("", Position.none), NONE), []) val is_improper = not o (Token.is_proper orf Token.is_begin_ignore orf Token.is_end_ignore); val improper = Scan.many is_improper; (* parses white-space and comments *) val attribute = Parse.position Parse.const --| improper -- Scan.optional (Parse.$$$ "=" --| improper |-- Parse.!!! Parse.term --| improper) "True" : ((string * Position.T) * string) parser; val attribute_upd : (((string * Position.T) * string) * string) parser = Parse.position Parse.const --| improper -- ((@{keyword "+="} --| improper) || (@{keyword ":="} --| improper)) -- Parse.!!! Parse.term --| improper : (((string * Position.T) * string) * string) parser; val reference = Parse.position Parse.name --| improper -- Scan.option (Parse.$$$ "::" -- improper |-- (Parse.!!! (Parse.position Parse.name)) ) --| improper; val attributes = ((Parse.$$$ "[" -- improper |-- (reference -- (Scan.optional(Parse.$$$ "," -- improper |-- (Parse.enum "," (improper |-- attribute)))) [])) --| Parse.$$$ "]" --| improper) : meta_args_t parser val opt_attributes = Scan.optional attributes empty_meta_args val attributes_upd = ((Parse.$$$ "[" -- improper |-- (reference -- (Scan.optional(Parse.$$$ "," -- improper |-- (Parse.enum "," (improper |-- attribute_upd)))) [])) --| Parse.$$$ "]") --| improper end (* structure ODL_Meta_Args_Parser *) \ ML\ (* c.f. \<^file>\~~/src/HOL/Tools/value_command.ML\ *) (* The value* command uses the same code as the value command and adds the evaluation Term Annotation Antiquotations (TA) with the help of the DOF_core.transduce_term_global function. *) (* Based on: Title: HOL/Tools/value_command.ML Author: Florian Haftmann, TU Muenchen Generic value command for arbitrary evaluators, with default using nbe or SML. *) (*signature VALUE_COMMAND = sig val value: Proof.context -> term -> term val value_without_elaboration: Proof.context -> term -> term val value_select: string -> Proof.context -> term -> term val value_cmd: {assert: bool} -> ODL_Command_Parser.meta_args_t option -> string -> string list -> string -> Position.T -> theory -> theory val add_evaluator: binding * (Proof.context -> term -> term) -> theory -> string * theory end;*) structure Value_Command (*: VALUE_COMMAND*) = struct structure Evaluators = Theory_Data ( type T = (Proof.context -> term -> term) Name_Space.table; val empty = Name_Space.empty_table "evaluator"; val merge = Name_Space.merge_tables; ) fun add_evaluator (b, evaluator) thy = let val (name, tab') = Name_Space.define (Context.Theory thy) true (b, evaluator) (Evaluators.get thy); val thy' = Evaluators.put tab' thy; in (name, thy') end; fun intern_evaluator thy raw_name = if raw_name = "" then "" else Name_Space.intern (Name_Space.space_of_table (Evaluators.get (thy))) raw_name; fun default_value ctxt t = if null (Term.add_frees t []) then Code_Evaluation.dynamic_value_strict ctxt t else Nbe.dynamic_value ctxt t; fun value_select name ctxt = if name = "" then default_value ctxt else Name_Space.get (Evaluators.get (Proof_Context.theory_of ctxt)) name ctxt; fun value_select' raw_name ctxt = if raw_name = "" then (DOF_core.elaborate_term ctxt) #> default_value ctxt else (DOF_core.elaborate_term ctxt) #> (let val name = intern_evaluator (Proof_Context.theory_of ctxt) raw_name in Name_Space.get (Evaluators.get (Proof_Context.theory_of ctxt)) name ctxt end); val value = value_select' "" val value_without_elaboration = value_select "" structure Docitem_Parser = struct fun cid_2_cidType cid_long thy = if cid_long = DOF_core.default_cid then \<^Type>\unit\ else let fun ty_name cid = cid^"."^ Long_Name.base_name cid ^ Record.extN fun fathers cid_long = case DOF_core.get_onto_class_global cid_long thy of DOF_core.Onto_Class {inherits_from=NONE, ...} => [cid_long] | DOF_core.Onto_Class {inherits_from=SOME(_,father), ...} => cid_long :: (fathers father) in fold (fn x => fn y => Type(ty_name x,[y])) (fathers cid_long) \<^Type>\unit\ end fun create_default_object thy class_name = let val purified_class_name = String.translate (fn #"." => "_" | x => String.implode [x]) class_name val make_const = Syntax.read_term_global thy (Long_Name.qualify class_name makeN); fun attr_to_free (binding, typ, _) = Free (purified_class_name ^ "_" ^ (Binding.name_of binding) ^ "_Attribute_Not_Initialized", typ) val class_list = DOF_core.get_attributes class_name thy fun attrs_filter [] = [] | attrs_filter (x::xs) = let val (cid, ys) = x fun is_duplicated _ [] = false | is_duplicated y (x::xs) = let val (_, ys) = x in if exists (map_eq_fst_triple Binding.name_of y) ys then true else is_duplicated y xs end in (cid, filter_out (fn y => is_duplicated y xs) ys)::attrs_filter xs end val class_list' = rev (attrs_filter (rev class_list)) val tag_attr = HOLogic.mk_number \<^Type>\int\ fun add_tag_to_attrs_free' tag_attr thy (cid, filtered_attr_list) = if DOF_core.is_virtual cid thy then (tag_attr (serial ()))::(map (attr_to_free) filtered_attr_list) else (map (attr_to_free) filtered_attr_list) val class_list'' = flat (map (add_tag_to_attrs_free' tag_attr thy) class_list') in list_comb (make_const, (tag_attr (serial()))::class_list'') end fun check_classref {is_monitor=is_monitor} (SOME(cid,pos)) thy = let val cid_long = DOF_core.get_onto_class_name_global' cid thy val DOF_core.Onto_Class {rex, ...} = DOF_core.get_onto_class_global cid_long thy val _ = if is_monitor andalso (null rex orelse cid_long= DOF_core.default_cid ) then error("should be monitor class!") else () val ctxt = Proof_Context.init_global thy val onto_classes = DOF_core.get_onto_classes ctxt val markup = DOF_core.get_onto_class_name_global cid_long thy |> Name_Space.markup (Name_Space.space_of_table onto_classes) val _ = Context_Position.report ctxt pos markup; in (cid_long, pos) end | check_classref _ NONE _ = (DOF_core.default_cid, Position.none) fun generalize_typ n = Term.map_type_tfree (fn (str,sort)=> Term.TVar((str,n),sort)); fun infer_type thy term = hd (Type_Infer_Context.infer_types (Proof_Context.init_global thy) [term]) fun calc_update_term {mk_elaboration=mk_elaboration} thy cid_long (S:(string * Position.T * string * term)list) term = let val cid_ty = cid_2_cidType cid_long thy val ctxt = Proof_Context.init_global thy val generalize_term = Term.map_types (generalize_typ 0) fun toString t = Syntax.string_of_term ctxt t fun instantiate_term S t = Term_Subst.map_types_same (Term_Subst.instantiateT (TVars.make S)) (t) fun read_assn (lhs, pos:Position.T, opr, rhs) term = let fun get_class_name parent_cid attribute_name pos = let val DOF_core.Onto_Class {attribute_decl, inherits_from, ...} = DOF_core.get_onto_class_global parent_cid thy in if exists (fn (binding, _, _) => Binding.name_of binding = attribute_name) attribute_decl then parent_cid else case inherits_from of NONE => ISA_core.err ("Attribute " ^ attribute_name ^ " not defined for class: " ^ cid_long) pos | SOME (_, parent_name) => get_class_name parent_name attribute_name pos end val _ = if mk_elaboration then let val attr_defined_cid = get_class_name cid_long lhs pos val onto_classes = DOF_core.get_onto_classes ctxt val markup = DOF_core.get_onto_class_name_global attr_defined_cid thy |> Name_Space.markup (Name_Space.space_of_table onto_classes) in Context_Position.report ctxt pos markup end else () val info_opt = DOF_core.get_attribute_info cid_long (Long_Name.base_name lhs) thy val (ln,lnt,lnu,lnut) = case info_opt of NONE => error ("unknown attribute >" ^((Long_Name.base_name lhs)) ^"< in class: "^cid_long) | SOME{long_name, typ, ...} => (long_name, typ, long_name ^ Record.updateN, (typ --> typ) --> cid_ty --> cid_ty) val tyenv = Sign.typ_match thy ((generalize_typ 0)(type_of rhs), lnt) (Vartab.empty) handle Type.TYPE_MATCH => (error ("type of attribute: " ^ ln ^ " does not fit to term: " ^ toString rhs)); val tyenv' = (map (fn (s,(t,u)) => ((s,t),u)) (Vartab.dest tyenv)) val _ = if Long_Name.base_name lhs = lhs orelse ln = lhs then () else error("illegal notation for attribute of "^cid_long) fun join (ttt as \<^Type>\int\) = \<^Const>\Groups.plus ttt\ |join (ttt as \<^Type>\set _\) = \<^Const>\Lattices.sup ttt\ |join \<^Type>\list A\ = \<^Const>\List.append A\ |join _ = error("implicit fusion operation not defined for attribute: "^ lhs) (* could be extended to bool, map, multisets, ... *) val rhs' = instantiate_term tyenv' (generalize_term rhs) val rhs'' = DOF_core.transduce_term_global {mk_elaboration=mk_elaboration} (rhs',pos) thy in case opr of "=" => Const(lnu,lnut) $ Abs ("uu_", lnt, rhs'') $ term | ":=" => Const(lnu,lnut) $ Abs ("uu_", lnt, rhs'') $ term | "+=" => Const(lnu,lnut) $ Abs ("uu_", lnt, join lnt $ (Bound 0) $ rhs'') $ term | _ => error "corrupted syntax - oops - this should not occur" end in Sign.certify_term thy (fold read_assn S term) end fun msg thy txt pos = if Config.get_global thy DOF_core.strict_monitor_checking then ISA_core.err txt pos else ISA_core.warn txt pos fun register_oid_cid_in_open_monitors oid pos cid_pos thy = let val cid_long= fst cid_pos val pos' = snd cid_pos fun is_enabled (n, monitor_info) = if exists (DOF_core.is_subclass_global thy cid_long) (DOF_core.get_alphabet monitor_info) then SOME (n, monitor_info) else if Config.get_global thy DOF_core.free_class_in_monitor_strict_checking orelse Config.get_global thy DOF_core.free_class_in_monitor_checking then SOME (n, monitor_info) else NONE (* filtering those monitors with automata, whose alphabet contains the cid of this oid. The enabled ones were selected and moved to their successor state along the super-class id. The evaluation is in parallel, simulating a product semantics without expanding the subclass relationship. *) fun is_enabled_for_cid (moid , monitor_info) = let val DOF_core.Monitor_Info {accepted_cids, automatas, rejected_cids, ...} = monitor_info val indexS= 1 upto (length automatas) val indexed_autoS = automatas ~~ indexS fun check_for_cid (A,n) = let fun direct_super_class _ cid [] = cid | direct_super_class thy cid (x::xs) = if DOF_core.is_subclass_global thy cid x then direct_super_class thy cid xs else direct_super_class thy x xs val accS = (RegExpInterface.enabled A accepted_cids) val accS' = filter (DOF_core.is_subclass_global thy cid_long) accS fun first_super_class cids = case List.getItem cids of SOME (hd,tl) => SOME (direct_super_class thy hd tl) | NONE => NONE val first_accepted = first_super_class accS' val rejectS = filter (DOF_core.is_subclass_global thy cid_long) rejected_cids val first_rejected = first_super_class rejectS in case first_accepted of NONE => (case first_rejected of NONE => let val msg_intro = ("accepts clause " ^ Int.toString n ^ " of monitor " ^ moid ^ " not enabled for doc_class: " ^ cid_long) in if Config.get_global thy DOF_core.free_class_in_monitor_strict_checking then ISA_core.err msg_intro pos' else if Config.get_global thy DOF_core.free_class_in_monitor_checking then (ISA_core.warn msg_intro pos';A) else A end | SOME _ => (msg thy ("accepts clause " ^ Int.toString n ^ " of monitor " ^ moid ^ " rejected doc_class: " ^ cid_long) pos';A)) | SOME accepted => (case first_rejected of NONE => RegExpInterface.next A accepted_cids (accepted) | SOME rejected => if DOF_core.is_subclass_global thy accepted rejected then RegExpInterface.next A accepted_cids (accepted) else (msg thy ("accepts clause " ^ Int.toString n ^ " of monitor " ^ moid ^ " rejected doc_class: " ^ cid_long) pos';A)) end in (moid,map check_for_cid indexed_autoS, monitor_info) end val enabled_monitors = List.mapPartial is_enabled (Name_Space.dest_table (DOF_core.get_monitor_infos (Proof_Context.init_global thy))) fun conv_attrs (((lhs, pos), opn), rhs) = (markup2string lhs,pos,opn, Syntax.read_term_global thy rhs) val trace_attr = [((("trace", @{here}), "+="), "[("^cid_long^", ''"^oid^"'')]")] val assns' = map conv_attrs trace_attr fun cid_of oid = let val DOF_core.Instance params = DOF_core.get_instance_global oid thy in #cid params end val ctxt = Proof_Context.init_global thy fun def_trans_input_term oid = #1 o (calc_update_term {mk_elaboration=false} thy (cid_of oid) assns') fun def_trans_value oid = (#1 o (calc_update_term {mk_elaboration=true} thy (cid_of oid) assns')) #> value ctxt val _ = if null enabled_monitors then () else writeln "registrating in monitors ..." val _ = app (fn (n, _) => writeln(oid^" : "^cid_long^" ==> "^n)) enabled_monitors; (* check that any transition is possible : *) fun inst_class_inv x = let val invs = DOF_core.get_ml_invariants ctxt val check_option = Name_Space.lookup invs (cid_of x) in case check_option of NONE => (K true) | SOME check => (check x {is_monitor=false}) end fun class_inv_checks ctxt = map (fn (x, _) => inst_class_inv x ctxt) enabled_monitors val delta_autoS = map is_enabled_for_cid enabled_monitors; fun update_info (n, aS, monitor_info) = let val DOF_core.Monitor_Info {accepted_cids,rejected_cids,...} = monitor_info in Name_Space.map_table_entry n (K ((accepted_cids, rejected_cids, aS) |> DOF_core.make_monitor_info)) end fun update_trace mon_oid = if Config.get_global thy DOF_core.object_value_debug then DOF_core.update_value_input_term_global mon_oid (def_trans_input_term mon_oid) (def_trans_value mon_oid) else DOF_core.update_value_global mon_oid (def_trans_value mon_oid) in thy |> (* update traces of all enabled monitors *) fold update_trace (map #1 enabled_monitors) |> (* check class invariants of enabled monitors *) (fn thy => (class_inv_checks (Context.Theory thy); thy)) |> (* update the automata of enabled monitors *) DOF_core.Monitor_Info.map (fold update_info delta_autoS) end fun check_invariants thy (oid, pos) = let val docitem_value = DOF_core.get_value_global oid thy val DOF_core.Instance params = DOF_core.get_instance_global oid thy val cid = #cid params fun get_all_invariants cid thy = case DOF_core.get_onto_class_global cid thy of DOF_core.Onto_Class {inherits_from=NONE, invs, ...} => invs | DOF_core.Onto_Class {inherits_from=SOME(_,father), invs, ...} => (invs) @ (get_all_invariants father thy) val invariants = get_all_invariants cid thy val inv_and_apply_list = let fun mk_inv_and_apply inv value thy = let val ((s, pos), _ (*term*)) = inv val inv_def = Syntax.read_term_global thy (s ^ invariant_suffixN) val inv_def_typ = Term.type_of value in case inv_def of Const (s, Type (st, [_ (*ty*), ty'])) => ((s, pos), Const (s, Type (st,[inv_def_typ, ty'])) $ value) | _ => ((s, pos), inv_def $ value) end in map (fn inv => mk_inv_and_apply inv docitem_value thy) invariants end fun check_invariants' ((inv_name, pos), term) = let val ctxt = Proof_Context.init_global thy val trivial_true = \<^term>\True\ |> HOLogic.mk_Trueprop |> Thm.cterm_of ctxt |> Thm.trivial val evaluated_term = value ctxt term handle ERROR e => if (String.isSubstring "Wellsortedness error" e) andalso (Config.get_global thy DOF_core.invariants_checking_with_tactics) then (warning("Invariants checking uses proof tactics"); let val prop_term = HOLogic.mk_Trueprop term val thms = Proof_Context.get_thms ctxt (inv_name ^ def_suffixN) (* Get the make definition (def(1) of the record) *) val thms' = (Proof_Context.get_thms ctxt (Long_Name.append cid defsN)) @ thms val _ = Goal.prove ctxt [] [] prop_term (K ((unfold_tac ctxt thms') THEN (auto_tac ctxt))) |> Thm.close_derivation \<^here> handle ERROR e => let val msg_intro = "Invariant " ^ inv_name ^ " failed to be checked using proof tactics" ^ " with error:\n" in if Config.get_global thy DOF_core.invariants_strict_checking then ISA_core.err (msg_intro ^ e) pos else (ISA_core.warn (msg_intro ^ e) pos; trivial_true) end (* If Goal.prove does not fail, then the evaluation is considered True, else an error is triggered by Goal.prove *) in @{term True} end) else \<^term>\True \ True\ in case evaluated_term of \<^term>\True\ => ((inv_name, pos), term) | \<^term>\True \ True\ => let val msg_intro = "Fail to check invariant " ^ inv_name ^ ".\nMaybe you can try " ^ "to activate invariants_checking_with_tactics\n" ^ "if your invariant is checked against doc_class algebraic " ^ "types like 'doc_class list' or 'doc_class set'" in if Config.get_global thy DOF_core.invariants_strict_checking then ISA_core.err (msg_intro) pos else (ISA_core.warn (msg_intro) pos; ((inv_name, pos), term)) end | _ => let val msg_intro = "Invariant " ^ inv_name ^ " violated" in if Config.get_global thy DOF_core.invariants_strict_checking then ISA_core.err msg_intro pos else (ISA_core.warn msg_intro pos; ((inv_name, pos), term)) end end val _ = map check_invariants' inv_and_apply_list in thy end fun create_and_check_docitem is_monitor {is_inline=is_inline} {define=define} oid pos cid_pos doc_attrs thy = let val cid_pos' = check_classref is_monitor cid_pos thy val cid_long = fst cid_pos' val default_cid = cid_long = DOF_core.default_cid val vcid = case cid_pos of NONE => NONE | SOME (cid,_) => if (DOF_core.is_virtual cid thy) then SOME (DOF_core.get_onto_class_name_global' cid thy) else NONE val value_terms = if default_cid then let val undefined_value = Free ("Undefined_Value", \<^Type>\unit\) in (undefined_value, undefined_value) end (* Handle initialization of docitem without a class associated, for example when you just want a document element to be referenceable without using the burden of ontology classes. ex: text*[sdf]\ Lorem ipsum @{thm refl}\ *) else let val defaults_init = create_default_object thy cid_long fun conv (na, _(*ty*), term) =(Binding.name_of na, Binding.pos_of na, "=", term); val S = map conv (DOF_core.get_attribute_defaults cid_long thy); val (defaults, _(*ty*), _) = calc_update_term {mk_elaboration=false} thy cid_long S defaults_init; fun conv_attrs ((lhs, pos), rhs) = (markup2string lhs,pos,"=", Syntax.read_term_global thy rhs) val assns' = map conv_attrs doc_attrs val (value_term', _(*ty*), _) = calc_update_term {mk_elaboration=true} thy cid_long assns' defaults in if Config.get_global thy DOF_core.object_value_debug then let val (input_term, _(*ty*), _) = calc_update_term {mk_elaboration=false} thy cid_long assns' defaults in (input_term, value_term') end else (\<^term>\()\, value_term') end val check_inv = Context.Theory #> (let val invs = DOF_core.get_ml_invariants (Proof_Context.init_global thy) val check_option = Name_Space.lookup invs cid_long in case check_option of NONE => (K true) | SOME check => (check oid is_monitor) end) in thy |> DOF_core.define_object_global {define = define} ((oid, pos), DOF_core.make_instance (false, fst value_terms, (snd value_terms) |> value (Proof_Context.init_global thy), is_inline, cid_long, vcid)) |> register_oid_cid_in_open_monitors oid pos cid_pos' |> (fn thy => if #is_monitor(is_monitor) then ((Context.Theory #> (let val invs = DOF_core.get_opening_ml_invariants (Proof_Context.init_global thy) val check_option = Name_Space.lookup invs cid_long in case check_option of NONE => (K true) | SOME check => (check oid is_monitor) end)) thy; thy) else thy) |> (fn thy => (check_inv thy; thy)) (* Bypass checking of high-level invariants when the class default_cid = "text", the top (default) document class. We want the class default_cid to stay abstract and not have the capability to be defined with attribute, invariants, etc. Hence this bypass handles docitem without a class associated, for example when you just want a document element to be referenceable without using the burden of ontology classes. ex: text*[sdf]\ Lorem ipsum @{thm refl}\ *) |> (fn thy => if default_cid then thy else if Config.get_global thy DOF_core.invariants_checking then check_invariants thy (oid, pos) else thy) end end (* structure Docitem_Parser *) val empty_meta_args = ((("", Position.none), NONE), []) fun meta_args_exec (meta_args as (((oid, pos), cid_pos), doc_attrs) : ODL_Meta_Args_Parser.meta_args_t) thy = thy |> (if meta_args = empty_meta_args then (K thy) else Docitem_Parser.create_and_check_docitem {is_monitor = false} {is_inline = false} {define = true} oid pos (I cid_pos) (I doc_attrs)) fun value_cmd {assert=assert} meta_args_opt raw_name modes raw_t pos thy = let val thy' = meta_args_exec meta_args_opt thy val name = intern_evaluator thy' raw_name; val t = Syntax.read_term_global thy' raw_t; val term' = DOF_core.transduce_term_global {mk_elaboration=true} (t , pos) (thy'); val t' = value_select name (Proof_Context.init_global thy') term'; val ty' = Term.type_of t'; val ty' = if assert then case ty' of \<^typ>\bool\ => ty' | _ => error "Assertion expressions must be boolean." else ty' val t' = if assert then case t' of \<^term>\True\ => t' | _ => error "Assertion failed." else t' val ctxt' = Proof_Context.augment t' (Proof_Context.init_global thy'); val p = Print_Mode.with_modes modes (fn () => Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t'), Pretty.fbrk, Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' ty')]) (); val _ = Pretty.writeln p in thy' end; val opt_modes = Scan.optional (\<^keyword>\(\ |-- Parse.!!! (Scan.repeat1 Parse.name --| \<^keyword>\)\)) []; val opt_evaluator = Scan.optional (\<^keyword>\[\ |-- Parse.name --| \<^keyword>\]\) ""; fun pass_trans_to_value_cmd meta_args_opt ((name, modes), t) trans = let val pos = Toplevel.pos_of trans in trans |> Toplevel.theory (value_cmd {assert=false} meta_args_opt name modes t pos) end fun pass_trans_to_assert_value_cmd meta_args_opt ((name, modes), t) trans = let val pos = Toplevel.pos_of trans in trans |> Toplevel.theory (value_cmd {assert=true} meta_args_opt name modes t pos) end \ \c.f. \<^file>\~~/src/Pure/Isar/isar_cmd.ML\\ (* term* command uses the same code as term command and adds the possibility to check Term Annotation Antiquotations (TA) with the help of DOF_core.transduce_term_global function *) fun string_of_term s pos ctxt = let val t = Syntax.read_term ctxt s; val T = Term.type_of t; val ctxt' = Proof_Context.augment t ctxt; val _ = DOF_core.transduce_term_global {mk_elaboration=false} (t , pos) (Proof_Context.theory_of ctxt'); in Pretty.string_of (Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t), Pretty.fbrk, Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' T)]) end; fun print_item string_of (modes, arg) state = Print_Mode.with_modes modes (fn () => writeln (string_of state arg)) (); (* We want to have the current position to pass it to transduce_term_global in string_of_term, so we pass the Toplevel.transition *) fun print_term meta_args_opt (string_list, string) trans = let val pos = Toplevel.pos_of trans fun prin state _ = string_of_term string pos (Toplevel.context_of state) in Toplevel.theory(fn thy => (print_item prin (string_list, string) (Toplevel.theory_toplevel thy); thy |> meta_args_exec meta_args_opt ) ) trans end val _ = Toplevel.theory val _ = Toplevel.theory_toplevel (* setup ontology aware commands *) val _ = Outer_Syntax.command \<^command_keyword>\term*\ "read and print term" (ODL_Meta_Args_Parser.opt_attributes -- (opt_modes -- Parse.term) >> (fn (meta_args_opt, eval_args ) => print_term meta_args_opt eval_args)); val _ = Outer_Syntax.command \<^command_keyword>\value*\ "evaluate and print term" (ODL_Meta_Args_Parser.opt_attributes -- (opt_evaluator -- opt_modes -- Parse.term) >> (fn (meta_args_opt, eval_args ) => pass_trans_to_value_cmd meta_args_opt eval_args)); val _ = Outer_Syntax.command \<^command_keyword>\assert*\ "evaluate and assert term" (ODL_Meta_Args_Parser.opt_attributes -- (opt_evaluator -- opt_modes -- Parse.term) >> (fn (meta_args_opt, eval_args ) => pass_trans_to_assert_value_cmd meta_args_opt eval_args)); (* setup ontology - aware text and ML antiquotations. Due to lexical restrictions, we can not declare them as value* or term*, although we will refer to them this way in papers. *) local fun pretty_term_style ctxt (style: term -> term, t) = Document_Output.pretty_term ctxt (style (DOF_core.check_term ctxt t)); fun print_term ctxt t = ML_Syntax.print_term (DOF_core.check_term (Context.proof_of ctxt) t) in val _ = Theory.setup (Document_Output.antiquotation_pretty_source_embedded \<^binding>\value_\ (Scan.lift opt_evaluator -- Term_Style.parse -- Args.term) (fn ctxt => fn ((name, style), t) => Document_Output.pretty_term ctxt (style (value_select' name ctxt t))) #> ML_Antiquotation.inline_embedded \<^binding>\value_\ ((Scan.lift opt_evaluator -- Args.term) #> (fn ((name, t),(ctxt, ts)) => (((value_select' name (Context.proof_of ctxt) t) |> (ML_Syntax.atomic o (print_term ctxt))), (ctxt, ts)))) #> Document_Output.antiquotation_pretty_source_embedded \<^binding>\term_\ (Term_Style.parse -- Args.term) pretty_term_style #> ML_Antiquotation.inline_embedded \<^binding>\term_\ (fn (ctxt, ts) => (Args.term >> (ML_Syntax.atomic o (print_term ctxt))) (ctxt, ts))) end (* setup evaluators *) val _ = Theory.setup( add_evaluator (\<^binding>\simp\, Code_Simp.dynamic_value) #> snd #> add_evaluator (\<^binding>\nbe\, Nbe.dynamic_value) #> snd #> add_evaluator (\<^binding>\code\, Code_Evaluation.dynamic_value_strict) #> snd); end; (* structure Value_Command *) structure Monitor_Command_Parser = struct fun update_instance_command (((oid, pos), cid_pos), doc_attrs: (((string*Position.T)*string)*string)list) thy : theory = let val cid = let val DOF_core.Instance {cid,...} = DOF_core.get_instance_global oid thy val ctxt = Proof_Context.init_global thy val instances = DOF_core.get_instances ctxt val markup = DOF_core.get_instance_name_global oid thy |> Name_Space.markup (Name_Space.space_of_table instances) val _ = Context_Position.report ctxt pos markup; in cid end val cid_pos' = Value_Command.Docitem_Parser.check_classref {is_monitor = false} cid_pos thy val cid_long = fst cid_pos' val _ = if cid_long = DOF_core.default_cid orelse cid = cid_long then () else error("incompatible classes:"^cid^":"^cid_long) fun conv_attrs (((lhs, pos), opn), rhs) = ((markup2string lhs),pos,opn, Syntax.read_term_global thy rhs) val assns' = map conv_attrs doc_attrs val def_trans_input_term = #1 o (Value_Command.Docitem_Parser.calc_update_term {mk_elaboration=false} thy cid_long assns') val def_trans_value = #1 o (Value_Command.Docitem_Parser.calc_update_term {mk_elaboration=true} thy cid_long assns') #> Value_Command.value (Proof_Context.init_global thy) fun check_inv thy = ((Context.Theory #> (let val invs = DOF_core.get_ml_invariants (Proof_Context.init_global thy) val check_option = Name_Space.lookup invs cid_long in case check_option of NONE => (K true) | SOME check => (check oid {is_monitor=false}) end) ) thy ; thy) in thy |> (if Config.get_global thy DOF_core.object_value_debug then DOF_core.update_value_input_term_global oid def_trans_input_term def_trans_value else DOF_core.update_value_global oid def_trans_value) |> check_inv |> (fn thy => if Config.get_global thy DOF_core.invariants_checking then Value_Command.Docitem_Parser.check_invariants thy (oid, pos) else thy) end (* General criticism : attributes like "level" were treated here in the kernel instead of dragging them out into the COL -- bu *) fun open_monitor_command ((((oid, pos),cid_pos), doc_attrs) : ODL_Meta_Args_Parser.meta_args_t) = let fun o_m_c oid pos cid_pos doc_attrs thy = Value_Command.Docitem_Parser.create_and_check_docitem {is_monitor=true} (* this is a monitor *) {is_inline=false} (* monitors are always inline *) {define=true} oid pos cid_pos doc_attrs thy fun compute_enabled_set cid thy = let val DOF_core.Onto_Class X = DOF_core.get_onto_class_global' cid thy val ralph = RegExpInterface.alphabet (#rejectS X) val aalph = RegExpInterface.alphabet (#rex X) in (aalph, ralph, map (RegExpInterface.rexp_term2da aalph)(#rex X)) end fun create_monitor_entry oid thy = let val cid = case cid_pos of NONE => ISA_core.err ("You must specified a monitor class.") pos | SOME (cid, _) => cid val (accS, rejectS, aS) = compute_enabled_set cid thy val info = {accepted_cids = accS, rejected_cids = rejectS, automatas = aS } in DOF_core.add_monitor_info (Binding.make (oid, pos)) (DOF_core.Monitor_Info info) thy end in o_m_c oid pos cid_pos doc_attrs #> create_monitor_entry oid end; fun close_monitor_command (args as (((oid, pos), cid_pos), doc_attrs: (((string*Position.T)*string)*string)list)) thy = let fun check_if_final aS = let val i = (find_index (not o RegExpInterface.final) aS) + 1 in if i >= 1 then Value_Command.Docitem_Parser.msg thy ("accepts clause " ^ Int.toString i ^ " of monitor " ^ oid ^ " not in final state.") pos else () end val _ = let val DOF_core.Monitor_Info {automatas,...} = DOF_core.get_monitor_info_global oid thy in check_if_final automatas end val oid' = DOF_core.get_monitor_info_name_global oid thy val delete_monitor_entry = DOF_core.Monitor_Info.map (Name_Space.del_table oid') val DOF_core.Instance {cid=cid_long,...} = DOF_core.get_instance_global oid thy val ctxt = Proof_Context.init_global thy val instances = DOF_core.get_instances ctxt val markup = DOF_core.get_instance_name_global oid thy |> Name_Space.markup (Name_Space.space_of_table instances) val _ = Context_Position.report ctxt pos markup; val check_inv = Context.Theory #> (let val invs = DOF_core.get_ml_invariants (Proof_Context.init_global thy) val check_option = Name_Space.lookup invs cid_long in case check_option of NONE => (K true) | SOME check => (check oid {is_monitor=true}) end) val check_closing_inv = Context.Theory #> (let val invs = DOF_core.get_closing_ml_invariants (Proof_Context.init_global thy) val check_option = Name_Space.lookup invs cid_long in case check_option of NONE => (K true) | SOME check => (check oid {is_monitor=true}) end) in thy |> (fn thy => (check_closing_inv thy; thy)) |> update_instance_command args |> (fn thy => (check_inv thy; thy)) |> (fn thy => if Config.get_global thy DOF_core.invariants_checking then Value_Command.Docitem_Parser.check_invariants thy (oid, pos) else thy) |> delete_monitor_entry end fun meta_args_2_latex thy ((((lab, pos), cid_opt), attr_list) : ODL_Meta_Args_Parser.meta_args_t) = (* for the moment naive, i.e. without textual normalization of attribute names and adapted term printing *) let val l = "label = "^ (enclose "{" "}" lab) (* val _ = writeln("meta_args_2_string lab:"^ lab ^":"^ (@{make_string } cid_opt) ) *) val cid_long = case cid_opt of NONE => let val DOF_core.Instance cid = DOF_core.get_instance_global lab thy in cid |> #cid end | SOME(cid,_) => DOF_core.get_onto_class_name_global' cid thy (* val _ = writeln("meta_args_2_string cid_long:"^ cid_long ) *) val cid_txt = "type = " ^ (enclose "{" "}" cid_long); fun ltx_of_term _ _ (c as \<^Const_>\Cons \<^Type>\char\ for _ _\) = HOLogic.dest_string c | ltx_of_term _ _ \<^Const_>\Nil _\ = "" | ltx_of_term _ _ \<^Const_>\numeral _ for t\ = Int.toString(HOLogic.dest_numeral t) | ltx_of_term ctx encl \<^Const_>\Cons _ for t1 t2\ = let val inner = (case t2 of \<^Const_>\Nil _\ => ltx_of_term ctx true t1 | _ => ((ltx_of_term ctx false t1)^", " ^(ltx_of_term ctx false t2))) in if encl then enclose "{" "}" inner else inner end | ltx_of_term _ _ \<^Const_>\None _\ = "" | ltx_of_term ctxt _ \<^Const_>\Some _ for t\ = ltx_of_term ctxt true t | ltx_of_term ctxt _ t = ""^(Sledgehammer_Util.hackish_string_of_term ctxt t) fun ltx_of_term_dbg ctx encl term = let val t_str = ML_Syntax.print_term term handle (TERM _) => "Exception TERM in ltx_of_term_dbg (print_term)" val ltx = ltx_of_term ctx encl term val _ = writeln(""^(Sledgehammer_Util.hackish_string_of_term ctx term)^"") val _ = writeln(""^ltx^"") val _ = writeln(""^t_str^"") in ltx end fun markup2string s = String.concat (List.filter (fn c => c <> Symbol.DEL) (Symbol.explode (YXML.content_of s))) fun ltx_of_markup ctxt s = let val term = (Syntax.check_term ctxt o Syntax.parse_term ctxt) s val str_of_term = ltx_of_term ctxt true term handle _ => "Exception in ltx_of_term" in str_of_term end fun toLong n = #long_name(the(DOF_core.get_attribute_info cid_long (markup2string n) thy)) val ctxt = Proof_Context.init_global thy val actual_args = map (fn ((lhs,_),rhs) => (toLong lhs, ltx_of_markup ctxt rhs)) attr_list val default_args = map (fn (b,_,t) => (toLong (Long_Name.base_name ( Sign.full_name thy b)), ltx_of_term ctxt true t)) (DOF_core.get_attribute_defaults cid_long thy) val default_args_filtered = filter (fn (a,_) => not (exists (fn b => b = a) (map (fn (c,_) => c) actual_args))) default_args val str_args = map (fn (lhs,rhs) => lhs^" = "^(enclose "{" "}" rhs)) (actual_args@default_args_filtered) val label_and_type = String.concat [ l, ",", cid_txt] val str_args = label_and_type::str_args in Latex.string (enclose "[" "]" (String.concat [ label_and_type, ", args={", (commas str_args), "}"])) end (* level-attribute information management *) fun gen_enriched_document_cmd {inline} cid_transform attr_transform ((((oid, pos),cid_pos), doc_attrs) : ODL_Meta_Args_Parser.meta_args_t) : theory -> theory = Value_Command.Docitem_Parser.create_and_check_docitem {is_monitor = false} {is_inline = inline} {define = true} oid pos (cid_transform cid_pos) (attr_transform doc_attrs); (* markup reports and document output *) (* {markdown = true} sets the parsing process such that in the text-core markdown elements are accepted. *) fun document_output {markdown: bool, markup: Latex.text -> Latex.text} meta_args text ctxt = let val thy = Proof_Context.theory_of ctxt; val _ = Context_Position.reports ctxt (Document_Output.document_reports text); val output_meta = meta_args_2_latex thy meta_args; val output_text = Document_Output.output_document ctxt {markdown = markdown} text; in markup (output_meta @ output_text) end; fun document_output_reports name {markdown, body} meta_args text ctxt = let (*val pos = Input.pos_of text; val _ = Context_Position.reports ctxt [(pos, Markup.language_document (Input.is_delimited text)), (pos, Markup.plain_text)];*) fun markup xml = let val m = if body then Markup.latex_body else Markup.latex_heading in [XML.Elem (m (Latex.output_name name), xml)] end; in document_output {markdown = markdown, markup = markup} meta_args text ctxt end; (* document output commands *) fun document_command (name, pos) descr mark cmd = Outer_Syntax.command (name, pos) descr (ODL_Meta_Args_Parser.attributes -- Parse.document_source >> (fn (meta_args, text) => Toplevel.theory' (fn _ => cmd meta_args) (Toplevel.presentation_context #> document_output_reports name mark meta_args text #> SOME))); (* Core Command Definitions *) val _ = Outer_Syntax.command \<^command_keyword>\open_monitor*\ "open a document reference monitor" (ODL_Meta_Args_Parser.attributes >> (Toplevel.theory o open_monitor_command)); val _ = Outer_Syntax.command \<^command_keyword>\close_monitor*\ "close a document reference monitor" (ODL_Meta_Args_Parser.attributes_upd >> (Toplevel.theory o close_monitor_command)); val _ = Outer_Syntax.command \<^command_keyword>\update_instance*\ "update meta-attributes of an instance of a document class" (ODL_Meta_Args_Parser.attributes_upd >> (Toplevel.theory o update_instance_command)); val _ = document_command \<^command_keyword>\text*\ "formal comment (primary style)" {markdown = true, body = true} (gen_enriched_document_cmd {inline=true} I I); (* This is just a stub at present *) val _ = document_command \<^command_keyword>\text-macro*\ "formal comment macro" {markdown = true, body = true} (gen_enriched_document_cmd {inline=false} (* declare as macro *) I I); val _ = Outer_Syntax.command \<^command_keyword>\declare_reference*\ "declare document reference" (ODL_Meta_Args_Parser.attributes >> (fn (((oid, pos),cid_pos),doc_attrs) => (Toplevel.theory (Value_Command.Docitem_Parser.create_and_check_docitem {is_monitor = false} {is_inline=true} {define = false} oid pos (cid_pos) (doc_attrs))))); end (* structure Monitor_Command_Parser *) \ ML\ fun print_doc_classes b ctxt = let val classes = Name_Space.dest_table (DOF_core.get_onto_classes ctxt) val _ = writeln "====================================="; fun print_attr (n, ty, NONE) = (Binding.print n) | print_attr (n, ty, SOME t)= (Binding.print n^"("^Syntax.string_of_term ctxt t^")") fun print_inv ((lab,pos),trm) = (lab ^"::"^Syntax.string_of_term ctxt trm) fun print_virtual {virtual} = Bool.toString virtual fun print_class (n, DOF_core.Onto_Class {attribute_decl, name, inherits_from, virtual , params, rejectS, rex, invs}) = (case inherits_from of NONE => writeln ("docclass: "^n) | SOME(_,nn) => writeln ("docclass: "^n^" = "^nn^" + "); writeln (" name: "^(Binding.print name)); writeln (" virtual: "^(print_virtual virtual)); writeln (" attrs: "^commas (map print_attr attribute_decl)); writeln (" invs: "^commas (map print_inv invs)) ); in map print_class classes; writeln "=====================================\n\n\n" end; val _ = Outer_Syntax.command \<^command_keyword>\print_doc_classes\ "print document classes" (Parse.opt_bang >> (fn b => Toplevel.keep (print_doc_classes b o Toplevel.context_of))); fun print_docclass_template cid ctxt = let (* takes class synonyms into account *) val cid_long = DOF_core.get_onto_class_name_global' cid (Proof_Context.theory_of ctxt) val brute_hierarchy = (DOF_core.get_attributes_local cid_long ctxt) val flatten_hrchy = flat o (map(fn(lname, attrS) => map (fn (s,_,_)=>(lname,(Binding.name_of s))) attrS)) fun filter_overrides [] = [] |filter_overrides ((ln,s)::S) = (ln,s):: filter_overrides(filter(fn(_,s')=> s<>s')S) val hierarchy = map (fn(ln,s)=>ln^"."^s)(filter_overrides(flatten_hrchy brute_hierarchy)) val args = String.concatWith "=%\n , " (" label=,type":: hierarchy); val template = "\\newisadof{"^cid_long^"}%\n["^args^"=%\n][1]\n{%\n#1%\n}\n\n"; in writeln template end; val _ = Outer_Syntax.command \<^command_keyword>\print_doc_class_template\ "print document class latex template" (Parse.string >> (fn b => Toplevel.keep (print_docclass_template b o Toplevel.context_of))); fun print_doc_items b ctxt = let val x = DOF_core.get_instances ctxt val _ = writeln "====================================="; fun dfg true = "true" |dfg false= "false" fun print_item (n, DOF_core.Instance {defined,cid,vcid, inline, input_term, value}) = ((if defined then writeln ("docitem: "^n) else writeln ("forward reference for docitem: "^n)); writeln (" defined: "^dfg defined); writeln (" type: "^cid); case vcid of NONE => () | SOME (s) => writeln (" virtual type: "^ s); writeln (" inline: "^dfg inline); (if Config.get ctxt DOF_core.object_value_debug then writeln (" input_term: "^ (Syntax.string_of_term ctxt input_term)) else ()); writeln (" value: "^ (Syntax.string_of_term ctxt value)) ) in map print_item (Name_Space.dest_table x); writeln "=====================================\n\n\n" end; val _ = Outer_Syntax.command \<^command_keyword>\print_doc_items\ "print document items" (Parse.opt_bang >> (fn b => Toplevel.keep (print_doc_items b o Toplevel.context_of))); fun check_doc_global (strict_checking : bool) ctxt = let val S = ctxt |> DOF_core.get_instances |> Name_Space.dest_table |> filter (fn (_, DOF_core.Instance {defined,...}) => (not defined)) |> map #1 val T = map fst (Name_Space.dest_table (DOF_core.get_monitor_infos ctxt)) in if null S then if null T then () else error("Global consistency error - there are open monitors: " ^ String.concatWith "," T) else error("Global consistency error - Unresolved forward references: " ^ String.concatWith "," S) end val _ = Outer_Syntax.command \<^command_keyword>\check_doc_global\ "check global document consistency" (Parse.opt_bang >> (fn b => Toplevel.keep (check_doc_global b o Toplevel.context_of))); \ \ \c.f. \<^file>\~~/src/Pure/Isar/outer_syntax.ML\\ (* The ML* generates an "ontology-aware" version of the SML code-execution command. *) ML\ structure ML_star_Command = struct fun meta_args_exec (meta_args as (((oid, pos),cid_pos), doc_attrs) : ODL_Meta_Args_Parser.meta_args_t) thy = thy |> (if meta_args = Value_Command.empty_meta_args then (K thy) else Context.map_theory (Value_Command.Docitem_Parser.create_and_check_docitem {is_monitor = false} {is_inline = false} {define = true} oid pos (I cid_pos) (I doc_attrs)) ) val attributes_opt = Scan.option ODL_Meta_Args_Parser.attributes val _ = Outer_Syntax.command ("ML*", \<^here>) "ODL annotated ML text within theory or local theory" ((ODL_Meta_Args_Parser.attributes -- Parse.ML_source) >> (fn (meta_args_opt, source) => Toplevel.generic_theory ((meta_args_exec meta_args_opt) #> (ML_Context.exec (fn () => (ML_Context.eval_source (ML_Compiler.verbose true ML_Compiler.flags) source)) #> Local_Theory.propagate_ml_env)))); end \ ML\ structure ODL_LTX_Converter = struct fun meta_args_2_string thy ((((lab, pos), cid_opt), attr_list) : ODL_Meta_Args_Parser.meta_args_t) = (* for the moment naive, i.e. without textual normalization of attribute names and adapted term printing *) let val l = "label = "^ (enclose "{" "}" lab) (* val _ = writeln("meta_args_2_string lab:"^ lab ^":"^ (@{make_string } cid_opt) ) *) val cid_long = case cid_opt of NONE => let val DOF_core.Instance cid = DOF_core.get_instance_global lab thy in cid |> #cid end | SOME(cid,_) => DOF_core.get_onto_class_name_global cid thy (* val _ = writeln("meta_args_2_string cid_long:"^ cid_long ) *) val cid_txt = "type = " ^ (enclose "{" "}" cid_long); fun ltx_of_term _ _ (c as \<^Const_>\Cons \<^Type>\char\ for _ _\) = HOLogic.dest_string c | ltx_of_term _ _ \<^Const_>\Nil _\ = "" | ltx_of_term _ _ \<^Const_>\numeral _ for t\ = Int.toString(HOLogic.dest_numeral t) | ltx_of_term ctx encl \<^Const_>\Cons _ for t1 t2\ = let val inner = (case t2 of \<^Const_>\Nil _\ => ltx_of_term ctx true t1 | _ => ((ltx_of_term ctx false t1)^", " ^(ltx_of_term ctx false t2))) in if encl then enclose "{" "}" inner else inner end | ltx_of_term _ _ \<^Const_>\None _\ = "" | ltx_of_term ctxt _ \<^Const_>\Some _ for t\ = ltx_of_term ctxt true t | ltx_of_term ctxt _ t = ""^(Sledgehammer_Util.hackish_string_of_term ctxt t) fun ltx_of_term_dbg ctx encl term = let val t_str = ML_Syntax.print_term term handle (TERM _) => "Exception TERM in ltx_of_term_dbg (print_term)" val ltx = ltx_of_term ctx encl term val _ = writeln(""^(Sledgehammer_Util.hackish_string_of_term ctx term)^"") val _ = writeln(""^ltx^"") val _ = writeln(""^t_str^"") in ltx end fun markup2string s = String.concat (List.filter (fn c => c <> Symbol.DEL) (Symbol.explode (YXML.content_of s))) fun ltx_of_markup ctxt s = let val term = (Syntax.check_term ctxt o Syntax.parse_term ctxt) s val str_of_term = ltx_of_term ctxt true term handle _ => "Exception in ltx_of_term" in str_of_term end fun toLong n = #long_name(the(DOF_core.get_attribute_info cid_long (markup2string n) thy)) val ctxt = Proof_Context.init_global thy val actual_args = map (fn ((lhs,_),rhs) => (toLong lhs, ltx_of_markup ctxt rhs)) attr_list val default_args = map (fn (b,_,t) => (toLong (Long_Name.base_name ( Sign.full_name thy b)), ltx_of_term ctxt true t)) (DOF_core.get_attribute_defaults cid_long thy) val default_args_filtered = filter (fn (a,_) => not (exists (fn b => b = a) (map (fn (c,_) => c) actual_args))) default_args val str_args = map (fn (lhs,rhs) => lhs^" = "^(enclose "{" "}" rhs)) (actual_args@default_args_filtered) val label_and_type = String.concat [ l, ",", cid_txt] val str_args = label_and_type::str_args in (enclose "[" "]" (String.concat [ label_and_type, ", args={", (commas str_args), "}"])) end end \ section\ Syntax for Ontological Antiquotations (the '' View'' Part II) \ ML\ structure OntoLinkParser = struct val basic_entity = Document_Output.antiquotation_pretty_source : binding -> 'a context_parser -> (Proof.context -> 'a -> Pretty.T) -> theory -> theory; fun check_and_mark ctxt cid_decl (str:{strict_checking: bool}) {inline=inline_req} pos name = let val thy = Proof_Context.theory_of ctxt; val DOF_core.Instance {cid,inline,...} = DOF_core.get_instance_global name thy val _ = if not inline_req then if inline then () else error("referred text-element is macro! (try option display)") else if not inline then () else error("referred text-element is no macro!") val instances = DOF_core.get_instances ctxt val name' = DOF_core.get_instance_name_global name thy val markup = name' |> Name_Space.markup (Name_Space.space_of_table instances) val _ = Context_Position.report ctxt pos markup; val ns = instances |> Name_Space.space_of_table val {pos=pos', ...} = Name_Space.the_entry ns name' (* this sends a report for a ref application to the PIDE interface ... *) val _ = if not(DOF_core.is_subclass ctxt cid cid_decl) then error("reference ontologically inconsistent: "^cid ^" must be subclass of "^cid_decl^ Position.here pos') else () in () end val _ = check_and_mark : Proof.context -> string -> {strict_checking: bool} -> {inline:bool} -> Position.T -> Symtab.key -> unit (* generic syntax for doc_class links. *) val defineN = "define" val uncheckedN = "unchecked" val docitem_modes = Scan.optional (Args.parens (Args.$$$ defineN || Args.$$$ uncheckedN) >> (fn str => if str = defineN then {unchecked = false, define= true} else {unchecked = true, define= false})) {unchecked = false, define= false} (* default *); val docitem_antiquotation_parser = (Scan.lift (docitem_modes -- Parse.embedded_input)) : ({define:bool,unchecked:bool} * Input.source) context_parser; fun pretty_docitem_antiquotation_generic cid_decl ctxt ({unchecked, define}, src ) = let val (str,pos) = Input.source_content src val inline = Config.get ctxt Document_Antiquotation.thy_output_display val _ = check_and_mark ctxt cid_decl {strict_checking = not unchecked} {inline = inline} pos str in (case (define,inline) of (true,false) => XML.enclose("\\csname isaDof.label\\endcsname[type={"^cid_decl^"}] {")"}" |(false,false)=> XML.enclose("\\csname isaDof.ref\\endcsname[type={"^cid_decl^"}] {")"}" |(true,true) => XML.enclose("\\csname isaDof.macroDef\\endcsname[type={"^cid_decl^"}]{")"}" |(false,true) => XML.enclose("\\csname isaDof.macroExp\\endcsname[type={"^cid_decl^"}]{")"}" ) (Latex.text (Input.source_content src)) end fun docitem_antiquotation bind cid = Document_Output.antiquotation_raw bind docitem_antiquotation_parser (pretty_docitem_antiquotation_generic cid) fun check_and_mark_term ctxt oid = let val thy = Context.theory_of ctxt; val ctxt' = Context.proof_of ctxt val DOF_core.Instance {cid,value,...} = DOF_core.get_instance_global oid thy val instances = DOF_core.get_instances ctxt' val ns = instances |> Name_Space.space_of_table val {pos, ...} = Name_Space.the_entry ns oid val markup = DOF_core.get_instance_name_global oid thy |> Name_Space.markup (Name_Space.space_of_table instances) val _ = Context_Position.report ctxt' pos markup; (* this sends a report for a ref application to the PIDE interface ... *) val _ = if cid = DOF_core.default_cid then error("anonymous "^ DOF_core.default_cid ^ " class has no value" ) else () in value end fun ML_antiquotation_docitem_value (ctxt, toks) = (Scan.lift (Args.cartouche_input) >> (fn inp => (ML_Syntax.atomic o ML_Syntax.print_term) ((check_and_mark_term ctxt o fst o Input.source_content) inp))) (ctxt, toks) (* Setup for general docitems of the global DOF_core.default_cid - class ("text")*) val _ = Theory.setup (docitem_antiquotation \<^binding>\docitem\ DOF_core.default_cid #> ML_Antiquotation.inline \<^binding>\docitem_value\ ML_antiquotation_docitem_value) end (* struct *) \ ML\ structure AttributeAccess = struct val basic_entity = Document_Output.antiquotation_pretty_source : binding -> 'a context_parser -> (Proof.context -> 'a -> Pretty.T) -> theory -> theory; fun compute_trace_ML ctxt oid pos_opt pos' = (* grabs attribute, and converts its HOL-term into (textual) ML representation *) let val term = ISA_core.compute_attr_access ctxt "trace" oid pos_opt pos' fun conv (\<^Const>\Pair \<^typ>\doc_class rexp\ \<^typ>\string\\ $ (\<^Const>\Atom \<^typ>\doc_class\\ $ (\<^Const>\mk\ $ s)) $ S) = let val s' = DOF_core.get_onto_class_name_global (HOLogic.dest_string s) (Context.theory_of ctxt) in (s', HOLogic.dest_string S) end in map conv (HOLogic.dest_list term) end val parse_oid = Scan.lift(Parse.position Args.name) val parse_cid = Scan.lift(Parse.position Args.name) val parse_oid' = Term_Style.parse -- parse_oid val parse_cid' = Term_Style.parse -- parse_cid val parse_attribute_access = (parse_oid --| (Scan.lift @{keyword "::"}) -- Scan.lift (Parse.position Args.name)) : ((string *Position.T) * (string * Position.T)) context_parser val parse_attribute_access' = Term_Style.parse -- parse_attribute_access : ((term -> term) * ((string * Position.T) * (string * Position.T))) context_parser fun attr_2_ML ctxt ((attr:string,pos),(oid:string,pos')) = (ML_Syntax.atomic o ML_Syntax.print_term) (ISA_core.compute_attr_access ctxt attr oid (SOME pos) pos') fun get_instance_value_2_ML ctxt (oid:string,pos) = let val ctxt' = Context.the_proof ctxt val value = DOF_core.get_value_local oid ctxt' val instances = DOF_core.get_instances ctxt' val markup = DOF_core.get_instance_name_global oid (Proof_Context.theory_of ctxt') |> Name_Space.markup (Name_Space.space_of_table instances) val _ = Context_Position.report ctxt' pos markup; in ML_Syntax.print_term value end fun get_instance_name_2_ML ctxt (oid:string,pos) = let val ctxt' = Context.the_proof ctxt val instances = DOF_core.get_instances ctxt' val markup = DOF_core.get_instance_name_global oid (Proof_Context.theory_of ctxt') |> Name_Space.markup (Name_Space.space_of_table instances) val _ = Context_Position.report ctxt' pos markup; in "\"" ^ oid ^ "\"" end fun trace_attr_2_ML ctxt (oid:string,pos) = let val print_string_pair = ML_Syntax.print_pair ML_Syntax.print_string ML_Syntax.print_string val toML = (ML_Syntax.atomic o (ML_Syntax.print_list print_string_pair)) in toML (compute_trace_ML ctxt oid NONE pos) end fun compute_cid_repr ctxt cid pos = let val _ = DOF_core.get_onto_class_name_global cid (Proof_Context.theory_of ctxt) in Const(cid,dummyT) end fun compute_name_repr ctxt oid pos = let val instances = DOF_core.get_instances ctxt val markup = DOF_core.get_instance_name_global oid (Proof_Context.theory_of ctxt) |> Name_Space.markup (Name_Space.space_of_table instances) val _ = Context_Position.report ctxt pos markup; in HOLogic.mk_string oid end local fun pretty_attr_access_style ctxt (style, ((attr,pos),(oid,pos'))) = Document_Output.pretty_term ctxt (style (ISA_core.compute_attr_access (Context.Proof ctxt) attr oid (SOME pos) pos')); fun pretty_trace_style ctxt (style, (oid,pos)) = Document_Output.pretty_term ctxt (style (ISA_core.compute_attr_access (Context.Proof ctxt) "trace" oid NONE pos)); fun pretty_name_style ctxt (style, (oid,pos)) = Document_Output.pretty_term ctxt (style (compute_name_repr ctxt oid pos)) fun pretty_cid_style ctxt (style, (cid,pos)) = Document_Output.pretty_term ctxt (style (compute_cid_repr ctxt cid pos)); (* NEW VERSION: PLEASE INTEGRATE ALL OVER : *) fun context_position_parser parse_con (ctxt, toks) = let val pos = case toks of a :: _ => Token.pos_of a | _ => @{here} \ \a real hack !\ val (res, (ctxt', toks')) = parse_con (ctxt, toks) in ((res,pos),(ctxt', toks')) end val parse_cid = (context_position_parser Args.typ_abbrev) >> (fn (Type(ss,_),pos) => (pos,ss) |( _,pos) => ISA_core.err "Undefined Class Id" pos); val parse_cid' = Term_Style.parse -- parse_cid fun pretty_cid_style ctxt (style,(pos,cid)) = (*reconversion to term in order to have access to term print options like: names_short etc...) *) Document_Output.pretty_term ctxt ((compute_cid_repr ctxt cid pos)); in val _ = Theory.setup (ML_Antiquotation.inline \<^binding>\docitem\ (fn (ctxt,toks) => (parse_oid >> get_instance_value_2_ML ctxt) (ctxt, toks)) #> ML_Antiquotation.inline \<^binding>\docitem_attribute\ (fn (ctxt,toks) => (parse_attribute_access >> attr_2_ML ctxt) (ctxt, toks)) #> ML_Antiquotation.inline \<^binding>\trace_attribute\ (fn (ctxt,toks) => (parse_oid >> trace_attr_2_ML ctxt) (ctxt, toks)) #> ML_Antiquotation.inline \<^binding>\docitem_name\ (fn (ctxt,toks) => (parse_oid >> get_instance_name_2_ML ctxt) (ctxt, toks)) #> basic_entity \<^binding>\trace_attribute\ parse_oid' pretty_trace_style #> basic_entity \<^binding>\doc_class\ parse_cid' pretty_cid_style #> basic_entity \<^binding>\onto_class\ parse_cid' pretty_cid_style #> basic_entity \<^binding>\docitem_attribute\ parse_attribute_access' pretty_attr_access_style #> basic_entity \<^binding>\docitem_name\ parse_oid' pretty_name_style ) end end \ text\ Note that the functions \<^verbatim>\basic_entities\ and \<^verbatim>\basic_entity\ in @{ML_structure AttributeAccess} are copied from @{file "$ISABELLE_HOME/src/Pure/Thy/document_output.ML"} \ section\ Syntax for Ontologies (the '' View'' Part III) \ ML\ structure OntoParser = struct fun read_parent NONE ctxt = (NONE, ctxt) | read_parent (SOME raw_T) ctxt = (case Proof_Context.read_typ_abbrev ctxt raw_T of Type (name, Ts) => (SOME (Ts, name), fold Variable.declare_typ Ts ctxt) | T => error ("Bad parent record specification: " ^ Syntax.string_of_typ ctxt T)); fun read_fields raw_fields ctxt = let val Ts = Syntax.read_typs ctxt (map (fn ((_, raw_T, _),_) => raw_T) raw_fields); val terms = map ((map_option (Syntax.read_term ctxt)) o snd) raw_fields fun test t1 t2 = Sign.typ_instance (Proof_Context.theory_of ctxt) (t1, Value_Command.Docitem_Parser.generalize_typ 0 t2) fun check_default (ty,SOME trm) = let val ty' = (type_of trm) in if test ty ty' then () else error("type mismatch:"^ (Syntax.string_of_typ ctxt ty')^":"^ (Syntax.string_of_typ ctxt ty)) end (* BAD STYLE : better would be catching exn. *) |check_default (_,_) = () val fields = map2 (fn ((x, _, mx),_) => fn T => (x, T, mx)) raw_fields Ts; val _ = map check_default (Ts ~~ terms) (* checking types conform to defaults *) val ctxt' = fold Variable.declare_typ Ts ctxt; in (fields, terms, ctxt') end; val trace_attr = ((\<^binding>\trace\, "(doc_class rexp \ string) list",Mixfix.NoSyn), SOME "[]"): ((binding * string * mixfix) * string option) fun def_cmd (decl, spec, prems, params) lthy = let val ((lhs as Free (x, T), _), lthy') = Specification.definition decl params prems spec lthy; val lhs' = Morphism.term (Local_Theory.target_morphism lthy') lhs; val _ = Proof_Display.print_consts true (Position.thread_data ()) lthy' (Frees.defined (Frees.build (Frees.add_frees lhs'))) [(x, T)] in lthy' end fun mk_meta_eq (t, u) = \<^Const>\Pure.eq \fastype_of t\ for t u\; fun define_cond binding f_sty cond_suffix read_cond (ctxt:local_theory) = let val bdg = Binding.suffix_name cond_suffix binding val eq = mk_meta_eq(Free(Binding.name_of bdg, f_sty),read_cond) val args = (SOME(bdg,NONE,NoSyn), (Binding.empty_atts,eq),[],[]) in def_cmd args ctxt end fun define_inv cid_long ((lbl, pos), inv) thy = let val bdg = Binding.make (lbl,pos) val inv_term = Syntax.read_term (Proof_Context.init_global thy) inv (* Rewrite selectors types to allow invariants on attributes of the superclasses using the polymorphic type of the class *) fun update_attribute_type thy class_scheme_ty cid_long (Const (s, Type (st,[ty, ty'])) $ t) = let val cid = Long_Name.qualifier s in case Name_Space.lookup (DOF_core.get_onto_classes (Proof_Context.init_global thy)) cid of NONE => Const (s, Type(st,[ty, ty'])) $ (update_attribute_type thy class_scheme_ty cid_long t) | SOME _ => if DOF_core.is_subclass_global thy cid_long cid then let val Type(st', tys') = ty in if tys' = [\<^typ>\unit\] then Const (s, Type(st,[ty, ty'])) $ (update_attribute_type thy class_scheme_ty cid_long t) else Const(s, Type(st,[class_scheme_ty, ty'])) $ (update_attribute_type thy class_scheme_ty cid_long t) end else Const (s, Type(st,[ty, ty'])) $ (update_attribute_type thy class_scheme_ty cid_long t) end | update_attribute_type thy class_scheme_ty cid_long (t $ t') = (update_attribute_type thy class_scheme_ty cid_long t) $ (update_attribute_type thy class_scheme_ty cid_long t') | update_attribute_type thy class_scheme_ty cid_long (Abs(s, ty, t)) = Abs(s, ty, update_attribute_type thy class_scheme_ty cid_long t) | update_attribute_type _ class_scheme_ty _ (Free(s, ty)) = if s = instance_placeholderN then Free (s, class_scheme_ty) else Free (s, ty) | update_attribute_type _ _ _ t = t val inv_ty = Syntax.read_typ (Proof_Context.init_global thy) (Name.aT ^ " " ^ cid_long ^ schemeN) (* Update the type of each attribute update function to match the type of the current class. *) val inv_term' = update_attribute_type thy inv_ty cid_long inv_term val eq_inv_ty = inv_ty --> HOLogic.boolT val abs_term = Term.lambda (Free (instance_placeholderN, inv_ty)) inv_term' in thy |> Named_Target.theory_map (define_cond bdg eq_inv_ty invariant_suffixN abs_term) end fun add_doc_class_cmd overloaded (raw_params, binding) raw_parent raw_fieldsNdefaults reject_Atoms regexps invariants thy = let val ctxt = Proof_Context.init_global thy; val params = map (apsnd (Typedecl.read_constraint ctxt)) raw_params; val ctxt1 = fold (Variable.declare_typ o TFree) params ctxt; fun cid thy = (* takes class synonyms into account *) DOF_core.get_onto_class_name_global' (Binding.name_of binding) thy val (parent, ctxt2) = read_parent raw_parent ctxt1; val parent_cid_long = map_optional snd DOF_core.default_cid parent; (* takes class synonyms into account *) val parent' = map_option (map_snd (K (DOF_core.get_onto_class_name_super_class_global thy parent_cid_long))) parent val parent'_cid_long = map_optional snd DOF_core.default_cid parent'; val raw_fieldsNdefaults' = filter (fn((bi,_,_),_) => Binding.name_of bi <> "trace") raw_fieldsNdefaults val _ = if length raw_fieldsNdefaults' <> length raw_fieldsNdefaults then warning("re-declaration of trace attribute in monitor --- ignored") else () val raw_fieldsNdefaults'' = if null regexps then raw_fieldsNdefaults' else trace_attr::raw_fieldsNdefaults' val (fields, terms, ctxt3) = read_fields raw_fieldsNdefaults'' ctxt2; val fieldsNterms = (map (fn (a,b,_) => (a,b)) fields) ~~ terms val fieldsNterms' = map (fn ((x,y),z) => (x,y,z)) fieldsNterms val params' = map (Proof_Context.check_tfree ctxt3) params; fun check_n_filter thy (bind,ty,mf) = case DOF_core.get_attribute_info parent'_cid_long (Binding.name_of bind) thy of NONE => SOME(bind,ty,mf) | SOME{def_occurrence,long_name,typ,...} => if ty = typ then (warning("overriding attribute:" ^ long_name ^ " in doc class:" ^ def_occurrence); NONE) else error("no overloading allowed.") val record_fields = map_filter (check_n_filter thy) fields (* adding const symbol representing doc-class for Monitor-RegExps.*) val constant_typ = \<^typ>\doc_class rexp\ val constant_term = \<^Const>\Atom \<^typ>\doc_class\\ $ (\<^Const>\mk\ $ HOLogic.mk_string (Binding.name_of binding)) val eq = mk_meta_eq(Free(Binding.name_of binding, constant_typ), constant_term) val args = (SOME(binding,NONE,NoSyn), (Binding.empty_atts,eq),[],[]) in thy |> Named_Target.theory_map (def_cmd args) |> ( case parent' of NONE => Record.add_record overloaded (params', binding) parent' (DOF_core.tag_attr::record_fields) #> DOF_core.define_doc_class_global (params', binding) parent fieldsNterms' regexps reject_Atoms invariants {virtual=false} | SOME _ => if (not o null) record_fields then Record.add_record overloaded (params', binding) parent' (record_fields) #> DOF_core.define_doc_class_global (params', binding) parent fieldsNterms' regexps reject_Atoms invariants {virtual=false} else Record.add_record overloaded (params', binding) parent' ([DOF_core.tag_attr]) #> DOF_core.define_doc_class_global (params', binding) parent fieldsNterms' regexps reject_Atoms invariants {virtual=true} ) |> (fn thy => OntoLinkParser.docitem_antiquotation binding (cid thy) thy) (* defines the ontology-checked text antiquotation to this document class *) |> (fn thy => fold(define_inv (cid thy)) (invariants) thy) (* The function declare_ISA_class_accessor_and_check_instance uses a prefix because the class name is already bound to "doc_class Regular_Exp.rexp" constant by add_doc_class_cmd function *) |> ISA_core.declare_ISA_class_accessor_and_check_instance binding |> (fn thy => (ISA_core.declare_class_instances_annotation thy binding) thy) end; (* repackaging argument list *) fun add_doc_class_cmd' (((overloaded, hdr), (parent, attrs)),((rejects,accept_rex),invars)) = (add_doc_class_cmd {overloaded = overloaded} hdr parent attrs rejects accept_rex invars) val parse_invariants = Parse.and_list (Args.name_position --| Parse.$$$ "::" -- Parse.term) val parse_doc_class = (Parse_Spec.overloaded -- (Parse.type_args_constrained -- Parse.binding) -- (\<^keyword>\=\ |-- Scan.option (Parse.typ --| \<^keyword>\+\) -- Scan.repeat1 (Parse.const_binding -- Scan.option (\<^keyword>\<=\ |-- Parse.term)) ) -- ( Scan.optional (\<^keyword>\rejects\ |-- Parse.enum1 "," Parse.term) [] -- Scan.repeats (\<^keyword>\accepts\ |-- (Parse.and_list Parse.term)) -- Scan.repeats ((\<^keyword>\invariant\) |-- parse_invariants)) ) val _ = Outer_Syntax.command \<^command_keyword>\doc_class\ "define document class" (parse_doc_class >> (Toplevel.theory o add_doc_class_cmd')); (*just an alternative syntax*) val _ = Outer_Syntax.command \<^command_keyword>\onto_class\ "define ontological class" (parse_doc_class >> (Toplevel.theory o add_doc_class_cmd')); end (* struct *) \ section\Shortcuts, Macros, Environments\ text\The features described in this section are actually \<^emph>\not\ real ISADOF features, rather a slightly more abstract layer over somewhat buried standard features of the Isabelle document generator ... (Thanks to Makarius) Conceptually, they are \<^emph>\sub-text-elements\. \ text\This module provides mechanisms to define front-end checked: \<^enum> \<^emph>\shortcuts\, i.e. machine-checked abbreviations without arguments that were mapped to user-defined LaTeX code (Example: \<^verbatim>\\ie\) \<^enum> \<^emph>\macros\ with one argument that were mapped to user-defined code. Example: \<^verbatim>\\myurl{bla}\. The argument can be potentially checked and reports can be sent to PIDE; if no such checking is desired, this can be expressed by setting the \<^theory_text>\reportNtest\-parameter to \<^theory_text>\K(K())\. \<^enum> \<^emph>\macros\ with two arguments, potentially independently checked. See above. Example: \<^verbatim>\\myurl[ding]{dong}\, \<^enum> \<^emph>\boxes\ which are more complex sub-text-elements in the line of the \<^verbatim>\verbatim\ or \<^verbatim>\theory_text\ environments. Note that we deliberately refrained from a code-template definition mechanism for simplicity, so the patterns were just described by strings. No additional ado with quoting/unquoting mechanisms ... \ ML\ structure DOF_lib = struct fun define_shortcut name latexshcut = Document_Output.antiquotation_raw name (Scan.succeed ()) (fn _ => fn () => Latex.string latexshcut) (* This is a generalization of the Isabelle2020 function "control_antiquotation" from document_antiquotations.ML. (Thanks Makarius!) *) fun define_macro name s1 s2 reportNtest = Document_Output.antiquotation_raw_embedded name (Scan.lift Args.cartouche_input) (fn ctxt => fn src => let val () = reportNtest ctxt src in src |> XML.enclose s1 s2 o Document_Output.output_document ctxt {markdown = false} end); local (* hide away really strange local construction *) fun enclose_body2 front body1 middle body2 post = (if front = "" then [] else Latex.string front) @ body1 @ (if middle = "" then [] else Latex.string middle) @ body2 @ (if post = "" then [] else Latex.string post); in fun define_macro2 name front middle post reportNtest1 reportNtest2 = Document_Output.antiquotation_raw_embedded name (Scan.lift ( Args.cartouche_input -- Args.cartouche_input)) (fn ctxt => fn (src1,src2) => let val () = reportNtest1 ctxt src1 val () = reportNtest2 ctxt src2 val T1 = Document_Output.output_document ctxt {markdown = false} src1 val T2 = Document_Output.output_document ctxt {markdown = false} src2 in enclose_body2 front T1 middle T2 post end); end fun report_text ctxt text = let val pos = Input.pos_of text in Context_Position.reports ctxt [(pos, Markup.language_text (Input.is_delimited text)), (pos, Markup.raw_text)] end; fun report_theory_text ctxt text = let val keywords = Thy_Header.get_keywords' ctxt; val _ = report_text ctxt text; val _ = Input.source_explode text |> Token.tokenize keywords {strict = true} |> maps (Token.reports keywords) |> Context_Position.reports_text ctxt; in () end fun prepare_text ctxt = Input.source_content #> #1 #> Document_Antiquotation.prepare_lines ctxt; (* This also produces indent-expansion and changes space to "\_" and the introduction of "\newline", I believe. Otherwise its in Thy_Output.output_source, the compiler from string to LaTeX.text. *) fun string_2_text_antiquotation ctxt text = prepare_text ctxt text |> Document_Output.output_source ctxt |> Document_Output.isabelle ctxt fun string_2_theory_text_antiquotation ctxt text = let val keywords = Thy_Header.get_keywords' ctxt; in prepare_text ctxt text |> Token.explode0 keywords |> maps (Document_Output.output_token ctxt) |> Document_Output.isabelle ctxt end fun gen_text_antiquotation name reportNcheck compile = Document_Output.antiquotation_raw_embedded name (Scan.lift Parse.embedded_input) (fn ctxt => fn text:Input.source => let val _ = reportNcheck ctxt text; in compile ctxt text end); fun std_text_antiquotation name (* redefined in these more abstract terms *) = gen_text_antiquotation name report_text string_2_text_antiquotation (* should be the same as (2020): fun text_antiquotation name = Thy_Output.antiquotation_raw_embedded name (Scan.lift Parse.embedded_input) (fn ctxt => fn text => let val _ = report_text ctxt text; in prepare_text ctxt text |> Thy_Output.output_source ctxt |> Thy_Output.isabelle ctxt end); *) fun std_theory_text_antiquotation name (* redefined in these more abstract terms *) = gen_text_antiquotation name report_theory_text string_2_theory_text_antiquotation (* should be the same as (2020): fun theory_text_antiquotation name = Thy_Output.antiquotation_raw_embedded name (Scan.lift Parse.embedded_input) (fn ctxt => fn text => let val keywords = Thy_Header.get_keywords' ctxt; val _ = report_text ctxt text; val _ = Input.source_explode text |> Token.tokenize keywords {strict = true} |> maps (Token.reports keywords) |> Context_Position.reports_text ctxt; in prepare_text ctxt text |> Token.explode0 keywords |> maps (Thy_Output.output_token ctxt) |> Thy_Output.isabelle ctxt |> enclose_env ctxt "isarbox" end); *) fun environment_delim name = ("%\n\\begin{" ^ Latex.output_name name ^ "}\n", "\n\\end{" ^ Latex.output_name name ^ "}"); fun environment_block name = environment_delim name |-> XML.enclose; fun enclose_env verbatim ctxt block_env body = if Config.get ctxt Document_Antiquotation.thy_output_display then if verbatim then environment_block block_env body else Latex.environment block_env body else XML.enclose ("\\inline"^block_env ^"{") "}" body; end \ ML\ local val parse_literal = Parse.alt_string || Parse.cartouche val parse_define_shortcut = Parse.binding -- ((\<^keyword>\\\ || \<^keyword>\==\) |-- parse_literal) val define_shortcuts = fold(uncurry DOF_lib.define_shortcut) in val _ = Outer_Syntax.command \<^command_keyword>\define_shortcut*\ "define LaTeX shortcut" (Scan.repeat1 parse_define_shortcut >> (Toplevel.theory o define_shortcuts)); end \ ML\ val parse_literal = Parse.alt_string || Parse.cartouche val parse_define_shortcut = Parse.binding -- ((\<^keyword>\\\ || \<^keyword>\==\) |-- parse_literal) --|Parse.underscore -- parse_literal -- (Scan.option (\<^keyword>\(\ |-- Parse.ML_source --|\<^keyword>\)\)) fun define_macro (X,NONE) = (uncurry(uncurry(uncurry DOF_lib.define_macro)))(X,K(K())) |define_macro (X,SOME(src:Input.source)) = let val check_code = K(K()) (* hack *) val _ = warning "Checker code support Not Yet Implemented - use ML" in (uncurry(uncurry(uncurry DOF_lib.define_macro)))(X,check_code) end; val _ = Outer_Syntax.command \<^command_keyword>\define_macro*\ "define LaTeX shortcut" (Scan.repeat1 parse_define_shortcut >> (Toplevel.theory o (fold define_macro))); \ section \Document context: template and ontology\ ML \ signature DOCUMENT_CONTEXT = sig val template_space: Context.generic -> Name_Space.T val ontology_space: Context.generic -> Name_Space.T val print_template: Context.generic -> string -> string val print_ontology: Context.generic -> string -> string val check_template: Context.generic -> xstring * Position.T -> string * string val check_ontology: Context.generic -> xstring * Position.T -> string * string val define_template: binding * string -> theory -> string * theory val define_ontology: binding * string -> theory -> string * theory val use_template: Context.generic -> xstring * Position.T -> unit val use_ontology: Context.generic -> (xstring * Position.T) list -> unit val list_ontologies: Context.generic -> unit val list_templates: Context.generic -> unit end; structure Document_Context: DOCUMENT_CONTEXT = struct (* theory data *) local structure Data = Theory_Data ( type T = string Name_Space.table * string Name_Space.table; val empty : T = (Name_Space.empty_table "document_template", Name_Space.empty_table "document_ontology"); fun merge ((templates1, ontologies1), (templates2, ontologies2)) = (Name_Space.merge_tables (templates1, templates2), Name_Space.merge_tables (ontologies1, ontologies2)); ); fun naming_context thy = Proof_Context.init_global thy |> Proof_Context.map_naming (Name_Space.root_path #> Name_Space.add_path "Isabelle_DOF") |> Context.Proof; fun get_space which = Name_Space.space_of_table o which o Data.get o Context.theory_of; fun print which context = Name_Space.markup_extern (Context.proof_of context) (get_space which context) #> uncurry Markup.markup; fun check which context arg = Name_Space.check context (which (Data.get (Context.theory_of context))) arg; fun define (get, ap) (binding, arg) thy = let val (name, table') = Data.get thy |> get |> Name_Space.define (naming_context thy) true (binding, arg); val thy' = (Data.map o ap) (K table') thy; in (name, thy') end; fun strip prfx sffx (path, pos) = (case try (unprefix prfx) (Path.file_name path) of NONE => error ("File name needs to have prefix " ^ quote prfx ^ Position.here pos) | SOME a => (case try (unsuffix sffx) a of NONE => error ("File name needs to have suffix " ^ quote sffx ^ Position.here pos) | SOME b => b)); in val template_space = get_space fst; val ontology_space = get_space snd; val print_template = print fst; val print_ontology = print snd; val check_template = check fst; val check_ontology = check snd; val define_template = define (fst, apfst); val define_ontology = define (snd, apsnd); fun use_template context arg = let val xml = arg |> check_template context |> snd |> XML.string in Export.export (Context.theory_of context) \<^path_binding>\dof/use_template\ xml end; fun use_ontology context args = let val xml = args |> map (check_ontology context #> fst) |> cat_lines |> XML.string; in Export.export (Context.theory_of context) \<^path_binding>\dof/use_ontology\ xml end; val strip_template = strip "root-" ".tex"; val strip_ontology = strip "DOF-" ".sty"; fun list_ontologies context = let val names = ((Name_Space.get_names o ontology_space) context) val fq_names = map (fn n => ((Long_Name.base_name o Long_Name.qualifier) n)^"."^(Long_Name.base_name n)) names val _ = map writeln fq_names in () end fun list_templates context = let val full_names = ((Name_Space.get_names o template_space) context) val _ = map (writeln o Long_Name.base_name) full_names in () end end; (* Isar commands *) val _ = Outer_Syntax.command \<^command_keyword>\use_template\ "use DOF document template (as defined within theory context)" (Parse.position Parse.name >> (fn arg => Toplevel.theory (fn thy => (use_template (Context.Theory thy) arg; thy)))); val _ = Outer_Syntax.command \<^command_keyword>\use_ontology\ "use DOF document ontologies (as defined within theory context)" (Parse.and_list1 (Parse.position Parse.name) >> (fn args => Toplevel.theory (fn thy => (use_ontology (Context.Theory thy) args; thy)))); val _ = Outer_Syntax.command \<^command_keyword>\define_template\ "define DOF document template (via LaTeX root file)" (Parse.position Resources.provide_parse_file >> (fn (get_file, pos) => Toplevel.theory (fn thy => let val (file, thy') = get_file thy; val binding = Binding.make (strip_template (#src_path file, pos), pos); val text = cat_lines (#lines file); in #2 (define_template (binding, text) thy') end))); val _ = Outer_Syntax.command \<^command_keyword>\define_ontology\ "define DOF document ontology (via LaTeX style file)" (Parse.position Resources.provide_parse_file >> (fn (get_file, pos) => Toplevel.theory (fn thy => let val (file, thy') = get_file thy; val binding = Binding.qualify false (Long_Name.qualifier (Context.theory_long_name thy')) (Binding.make (strip_ontology (#src_path file, pos), pos)); val text = cat_lines (#lines file); in #2 (define_ontology (binding, text) thy') end))); val _ = Outer_Syntax.command \<^command_keyword>\list_templates\ "list available DOF document templates (as defined within theory context)" (Scan.succeed (Toplevel.theory (fn thy => (list_templates (Context.Theory thy); thy)))); val _ = Outer_Syntax.command \<^command_keyword>\list_ontologies\ "list available DOF document ontologies (as defined within theory context)" (Scan.succeed (Toplevel.theory (fn thy => (list_ontologies (Context.Theory thy); thy)))); end; \ define_template "../latex/document-templates/root-lncs.tex" define_template "../latex/document-templates/root-scrartcl.tex" define_template "../latex/document-templates/root-scrreprt-modern.tex" define_template "../latex/document-templates/root-scrreprt.tex" section \Isabelle/Scala module within session context\ external_file "../etc/build.props" external_file "../scala/dof_document_build.scala" scala_build_generated_files external_files "build.props" (in "../etc") and "scala/dof.scala" "scala/dof_document_build.scala" (in "../") (* ML\ Pretty.text; Pretty.str; Pretty.block_enclose; theory_text_antiquotation in Document_Antiquotations (not exported) \ ML\Pretty.text_fold; Pretty.unformatted_string_of\ ML\ (String.concatWith ","); Token.content_of\ ML\ Document.state; Session.get_keywords(); Parse.command; Parse.tags; \ ML\ Outer_Syntax.print_commands @{theory}; Outer_Syntax.parse_spans; Parse.!!!; \ *) end