src/Tools/isac/BridgeJEdit/VSCode_Example.thy
author wneuper <Walther.Neuper@jku.at>
Wed, 20 Jul 2022 11:56:45 +0200
changeset 60485 c14f2538095c
parent 60480 51f6113384db
child 60486 17690ea5da8e
permissions -rw-r--r--
question about Outer_Syntax.command \<^command_keyword>?Example?
     1 (*  Title:      src/Tools/isac/BridgeJEdit/VSCode_Example.thy
     2     Author:     Walther Neuper, JKU Linz
     3     (c) due to copyright terms
     4 
     5 Runnig example for developing Isabelle/Isac via Isabelle/PIDE in BridgeJEdit.
     6 File will go to test/Tools/isac/BridgeJEdit/VSCode_Example.thy
     7 compare         test/Tools/isac/BridgeJEdit/vscode-example.sml
     8 *)
     9 
    10 theory VSCode_Example 
    11   imports Calculation
    12 begin
    13 
    14 section \<open>Boilerplate, the example for Isabelle Workshop 2022\<close>
    15 
    16 subsection \<open>Specification Phase\<close>
    17 text \<open>Goal for Isabelle Workshop 2022: this part of the example should be ready for demonstration:
    18   1. The keyword \<open>Example\<close> inserts the template underneath
    19   2. The template is filled from a (hidden) formalisation with the following items in the
    20     2.1. \<open>Model\<close>:
    21         * Constants _  ("_" indicates some kind of place holder for input)
    22         * the complete Where-field (the pre-condition), items marked as True | False
    23         * Maximum _, AdditionalValues _
    24         * Extremum _, SideCondition _
    25     2.2 \<open>References\<close>:
    26         * place holders "_" for input
    27         * The toggle switch before \<open>Problem_Ref\<close> | \<open>Method_Ref\<close> is set to \<open>Problem_Ref\<close>
    28           This might be postponed after the Isabelle Workshop.
    29   3. Input to 2.1 is 
    30     * type checked and marked as Type-Error
    31     * marked as Correct | Superfluous | Incomplete | Unknown (compare Specify/p-model.sml)
    32   4. Input to 2.2 by selection from a list / tree
    33   5. On update of \<open>Problem_Ref\<close> (in the root problem) also \<open>Problem\<close> is updated;
    34      The argument of \<open>Problem\<close> comes with the template and is read-only.
    35 
    36 The specific representation of the Demo_Example demonstrate different situations
    37 in educational settings.
    38 \<close>
    39 
    40 subsubsection \<open>Complete Specification\<close>
    41 text \<open>
    42 * This is one correct result of interactive Specification.
    43 * Or this might be presented to the student in one go in order to start Solution immediately
    44   (and nevertheless make the Specification explicit)
    45 Note that \<open>Problem "univariate_calculus/Optimisation"\<close> and 
    46 \<open>Problem_Ref: "univariate_calculus/Optimisation"\<close> are redundant; the latter is for input,
    47 the former is given initially and needs to be updated in accordance to \<open>Problem_Ref\<close>.
    48 \<close>
    49 text \<open> (*.. remove as soon as this works as Isabelle/Isar commands ..*)
    50 
    51 Example "Diff_App/No.123 a"
    52   Problem "univariate_calculus/Optimisation"
    53     Specification:
    54       Model:
    55         Given: \<open>Constants r = 7\<close>
    56         Where: \<open>0 < r\<close>
    57         Find:  \<open>Maximum A\<close> \<open>AdditionalValues u, v\<close>
    58         Relate: \<open>Extremum A = 2 \<sqdot> u \<sqdot> v − u \<up> 2\<close> \<open>SideCondition (u / 2) \<up> 2 + (2 / v) \<up> 2 = r \<up> 2\<close>
    59       References:
    60          Theory_Ref: "Diff_App"
    61       \<Otimes> Problem_Ref: "univariate_calculus/Optimisation"
    62       \<Odot> Method_Ref: "Optimisation/by_univariate_calculus"
    63     Solution:
    64 
    65        (* remove as soon as this ^^^ works as Isabelle/Isar commands ..*) \<close>
    66 
    67 subsubsection \<open>Empty Specification\<close>
    68 text \<open>
    69   This is presented to the student in one go in order to start interactive Specification.
    70 \<close>
    71 text \<open> (*.. remove as soon as this works as Isabelle/Isar commands ..*)
    72 
    73 Example "Diff_App/No.123 a"
    74   Problem "univariate_calculus/Optimisation"
    75     Specification:
    76       Model:
    77         Given: \<open>Constants _\<close>
    78         Where: \<open>0 < r\<close>
    79         Find:  \<open>Maximum _\<close> \<open>AdditionalValues _\<close>
    80         Relate: \<open>Extremum _\<close> \<open>SideCondition _\<close>
    81       References:
    82          Theory_Ref: "_"
    83       \<Otimes> Problem_Ref: "_"
    84       \<Odot> Method_Ref: "_"
    85     Solution:
    86 
    87        (* remove as soon as this ^^^ works as Isabelle/Isar commands ..*) \<close>
    88 
    89 subsubsection \<open>Plain Example\<close>
    90 text \<open>
    91   This can occur in between text offering to start an interactive Calculation by using
    92   "Diff_App/No.123 a" as a link.
    93 \<close>
    94 text \<open> (*.. remove as soon as this works as Isabelle/Isar commands ..*)
    95 
    96 Example "Diff_App/No.123 a"
    97 
    98        (* remove as soon as this ^^^ works as Isabelle/Isar commands ..*) \<close>
    99 
   100 subsubsection \<open>Immediate Start of Interactive Solving\<close>
   101 text \<open>
   102   This 
   103 \<close>
   104 text \<open> (*.. remove as soon as this works as Isabelle/Isar commands ..*)
   105 
   106 Example "Diff_App/No.123 a"
   107   Problem "univariate_calculus/Optimisation"
   108     Specification:
   109     Solution:
   110 
   111        (* remove as soon as this ^^^ works as Isabelle/Isar commands ..*) \<close>
   112 
   113 subsubsection \<open>Show the Model associated to Method_Ref\<close>
   114 text \<open>
   115   The Model of a method usually comprises more items than the model of a Problem: all these
   116   are required to run the program such that it automatically generates a Solution. For instance,
   117   compare \<open>problem pbl_bieg\<close> and \<open>method met_biege_2\<close> in \<open>Biegelinie.thy\<close>
   118   (TODO: method/program for \<open>Problem "univariate_calculus/Optimisation"\<close>)
   119   The Model of a method is usually called a guard.
   120 \<close>
   121 text \<open> (*.. remove as soon as this works as Isabelle/Isar commands ..*)
   122 
   123 Example "Diff_App/No.123 a"
   124   Problem "univariate_calculus/Optimisation"
   125     Specification:
   126       Model:
   127         Given: \<open>Constants r = 7\<close>
   128         Where: \<open>0 < r\<close>
   129         Find:  \<open>Maximum A\<close> \<open>AdditionalValues u, v\<close>
   130         Relate: \<open>Extremum A = 2 \<sqdot> u \<sqdot> v − u \<up> 2\<close> \<open>SideCondition (u / 2) \<up> 2 + (2 / v) \<up> 2 = r \<up> 2\<close>
   131       References:
   132          Theory_Ref: "Diff_App"
   133       \<Odot> Problem_Ref: "univariate_calculus/Optimisation"
   134       \<Otimes> Method_Ref: "Optimisation/by_univariate_calculus"
   135     Solution:
   136 
   137        (* remove as soon as this ^^^ works as Isabelle/Isar commands ..*) \<close>
   138 
   139 
   140 section \<open>Stepwise Development\<close>
   141 
   142 subsection \<open>preparing VSCode_Example\<close>
   143 ML \<open>
   144 (**** preparing VSCode_Example ########################################################### ****)
   145 "----------- preparing VSCode_Example ----------------------------------------------------------";
   146 "----------- preparing VSCode_Example ----------------------------------------------------------";
   147 \<close> text \<open>
   148 --- maximum example with Step.specify_do_next --- from test/../step.sml
   149 val fmz = [
   150 (*Problem model:*)
   151   "fixedValues [r=Arbfix]", "maximum A",
   152   "valuesFor [a,b::real]",
   153   "relations [A=a*(b::real), (a/2) \<up> 2 + (b/2) \<up> 2 = (r::real) \<up> 2]",
   154   "relations [A=a*(b::real), (a/2) \<up> 2 + (b/2) \<up> 2 = (r::real) \<up> 2]",
   155   "relations [A=a*(b::real), a/2=r*sin alpha, b/2 = (r::real)*cos (alpha::real)]",
   156 (*MethodC model:*)
   157   "boundVariable a", "boundVariable b", "boundVariable alpha",
   158   "interval {x::real. 0 <= x & x <= 2*r}",
   159   "interval {x::real. 0 <= x & x <= 2*r}",
   160   "interval {x::real. 0 <= x & x <= pi}",
   161   "errorBound (eps=(0::real))"];
   162 val (dI',pI',mI') = 
   163 ("Diff_App", ["maximum_of", "function"], ["Diff_App", "max_by_calculus"]);
   164 \<close> text \<open>
   165 from paper "Towards Accessible Formal Mathematics with ISAC and Isabelle/VSCode"
   166 
   167 F_I \<equiv> [ [r = 7], [A, [u, v]], [A = 2 * u * v - u \<up> 2 , ( 2 / u ) \<up> 2 + ( 2 / v ) \<up> 2 = r \<up> 2], {0 <..< r} ]
   168 --- type conflict ^^ ----------^^
   169 F_II \<equiv> [ [r = 7], [A, \<alpha>], [A = 2 * u * v - u \<up> 2 , u / 2 = r * sin \<alpha>, 2 / v = r * cos \<alpha>], {0 <..< \<pi> / 2} ]
   170 \<close> ML \<open>
   171 val fmz = [
   172 (*Problem model:*)
   173   "Constants [r = (7::real)]", "Maximum A", "AdditionalValues [u, v]",
   174   "Extremum (A = 2 * u * v - u \<up> 2)",
   175   "SideConditions [((u::real) / 2) \<up> 2 + (2 / v) \<up> 2 = r \<up> 2]",
   176   "SideConditions [((u::real) / 2) \<up> 2 + (2 / v) \<up> 2 = r \<up> 2]",
   177   "SideConditions [(u::real) / 2 = r * sin \<alpha>, 2 / v = r * cos \<alpha>]",
   178 (*MethodC model:*)
   179   "FunctionVariable a", "FunctionVariable b", "FunctionVariable \<alpha>",
   180   "Domain {0 <..< r}",
   181   "Domain {0 <..< r}",
   182   "Domain {0 <..< \<pi> / 2}",
   183   "ErrorBound (\<epsilon> = (0::real))"
   184 ]: TermC.as_string list;
   185 val refs = 
   186 ("Diff_App", ["univariate_calculus", "Optimisation"], ["Optimisation", "by_univariate_calculus"]);
   187 \<close> ML \<open>
   188 \<close>
   189 
   190 subsection \<open>Specification Phase\<close>
   191 text \<open> 
   192   Stepwise development of \<open>Outer_Syntax.command \<^command_keyword>\<open>Example\<close>\<close> begins with 
   193   the changeset https://hg.risc.uni-linz.ac.at/wneuper/isa/rev/9d98791b4080
   194   in the repository.
   195 
   196   The intermediate steps below will be deleted as soon as all above representations 
   197   of \<open>Example "Diff_App/No.123 a"\<close> work out.
   198 \<close>
   199 
   200 Example "Diff_App/No.123 a"
   201   Problem "univariate_calculus/Optimisation"
   202     Specification:
   203       Model:
   204         Given: \<open>Constants [r = 7]\<close>
   205         Where: \<open>0 < r\<close>
   206         Find:  \<open>Maximum A\<close> \<open>AdditionalValues [u, v]\<close>
   207         Relate: \<open>Extremum A = 2 * u * v - u \<up> 2\<close> 
   208           \<open>SideConditions [((u::real) / 2) \<up> 2 + (2 / v) \<up> 2 = r \<up> 2]\<close>
   209       References:
   210 (**  )
   211          Theory_Ref: "Diff_App"
   212   (*\<Odot>*) Problem_Ref: "univariate_calculus/Optimisation"
   213   (*\<Otimes>*) Method_Ref: "Optimisation/by_univariate_calculus"
   214 (  **)
   215 ML \<open>
   216 val state = the_data @{theory};
   217 \<close> ML \<open>
   218 val (o_model, refs, _) = Ctree.get_obj Ctree.g_origin state []
   219 val problem_model = Ctree.get_obj Ctree.g_pbl state []
   220 val method_model = Ctree.get_obj Ctree.g_met state []
   221 \<close> ML \<open>
   222 if length o_model = 12  andalso refs = 
   223   ("Diff_App", ["univariate_calculus", "Optimisation"], ["Optimisation", "by_univariate_calculus"])
   224   andalso length problem_model = 5 andalso length method_model = 8
   225 then () else error "initialised state CHANGED";
   226 \<close> ML \<open>
   227 \<close> ML \<open>
   228 \<close>
   229 
   230 end
   231 
   232 
   233