K iEdZddlmZmZmZmZddlmZmZm Z m Z m Z m Z m Z mZmZmZddlmZddgZGddeZGddeZy ) a pygments.lexers.theorem ~~~~~~~~~~~~~~~~~~~~~~~ Lexers for theorem-proving languages. See also :mod:`pygments.lexers.lean` :copyright: Copyright 2006-2025 by the Pygments team, see AUTHORS. :license: BSD, see LICENSE for details. ) RegexLexerbygroupsdefaultwords) TextCommentOperatorKeywordNameStringNumber PunctuationGeneric Whitespace) LeanLexerCoqLexer IsabelleLexerc eZdZdZdZdZdgZdgZdgZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdefdej.j0fdedfdefdej6fdeej6eej6fdej6dfdej6dfee ddej6fee ddefee ddej<feeddefeeddej0feeddej>fd efd!jAd"jCed#d#d$e"fd%ed"ed&ee"fd'efd(e#jHfd)e#jJfd*e#jLfd+e#jNfd,e#jPfd-e)jTfd.e)jTfd/efd0e)jVd1fd2efd3ej.j0fgdefd4ej6fd0e)jVd1fd5e#jHfd6e,d7fgdefd8efd9e"fd:efd(e#jHfd)e#jJfdedfd6e,d7fgd;efdedefgd?e)jVfd@e)jVfd0e)jVd7fgdefd6e,fdAej6fdBejZd7fdCed7fe.d7gdDZ/dEZ0y#)Frz% For the Coq theorem prover. Coqzhttp://coq.inria.fr/coqz*.vz text/x-coqz1.5r)cSectionModuleEndRequireImportExportIncludeVariable Variables Parameter ParametersAxiomAxioms Hypothesis HypothesesNotationLocalTacticReservedScopeOpenCloseBindDeclareDelimit DefinitionExampleLetLtacLtac2Fixpoint CoFixpointMorphismRelationImplicit ArgumentsTypes ContextualStrictPrenex Implicits Inductive CoInductiveRecord StructureVariant CanonicalCoercionTheoremLemmaFactRemark Corollary PropositionPropertyGoalProofRestartSaveQedDefinedAbortAdmittedHintResolveRewriteViewSearchComputeEvalShowPrintPrintingAllGraph ProjectionsinsideoutsideCheckGlobalInstanceClassExistingUniverse Polymorphic MonomorphicContextSchemeFromUndoFailFunctionProgramElpiExtractOpaque TransparentUnshelvezNext Obligation)forallexistsexists2funfixcofixstructmatchendinreturnletifisthenelseforofnosimplwithas)TypePropSPropSet)Cposesetmovecaseelimapplyclearhnfintrointros generalizerenamepatternafterdestruct inductionusingrefine inversion injectionrewritecongrunlockcomputeringfieldreplacefoldunfoldchange cutrewritesimplhavesuffwlogsufficeswithoutlossnat_normassertcuttrivialrevert bool_congr nat_congrsymmetry transitivityautosplitleftright autorewritetautosetoid_rewrite intuitioneautoeapply econstructor etransitivity constructorerewriteredcbvlazy vm_computenative_computesubst)bynowdoneexact reflexivityrromegaomegalianialranrapsatz assumptionsolve contradiction discriminate congruenceadmit)dolastfirsttryidtacrepeat);z!=#&z&&z\(z\)z\*z\+,-z-\.z->\.z\.\.:::z:=z:>;z;;=>z>]z>\}z\?z\?\?z\[z\[z\[\|]_`z\{z\{z/\\z\\/z\{\|z\|\}uλ¬u∧u∨u∀u∃u→u↔u≠u≤u≥z[!$%&*+\./:<=>?@^|~-]z[!?~]z[=<>@^|&+\*/$%-]\s+zfalse|true|\(\)|\[\]\(\*commentz'\b(?:[^\W\d][\w\']*\.)+[^\W\d][\w\']*\bz\bEquations\b\??zM\b(Elpi)(\s+)(Program|Query|Accumulate|Command|Typecheck|Db|Export|Tactic)?\bz,\bUnset\b|\bSet(?=[ \t]+[A-Z][a-z][^\n]*?\.) set-optionsz\b(?:String|Number)\s+Notation sn-notation\bprefixsuffixz\b([A-Z][\w\']*)z({})|N(z)?z [^\W\d][\w']*z\d[\d_]*0[xX][\da-fA-F][\da-fA-F_]*0[oO][0-7][0-7_]*0[bB][01][01_]*z(-?\d[\d_]*(.[\d_]*)?([eE][+\-]?\d[\d_]*)z7'(?:(\\[\\\"'ntbr ])|(\\[0-9]{3})|(\\x[0-9a-fA-F]{2}))'z'.''"stringz[~?][a-z][\w\']*:z\Sz[A-Z]\w*z\d+r#popz*\b(?:via|mapping|abstract|warning|after)\bz =>|[()\[\]:,]z'\b[^\W\d][\w\']*(?:\.[^\W\d][\w\']*)*\bz([^(*)]+|\*+(?!\)))+#push\*\)[(*)]z[^"]+z""z[A-Z][\w\']*(?=\s*\.)z [A-Z][\w\']*z[a-z][a-z0-9_\']*)rootrrrrdottedcd|vrd|vryyy)NrRrO)texts ]/mnt/ssd/data/python-lab/Trading/venv/lib/python3.12/site-packages/pygments/lexers/theorem.py analyse_textzCoqLexer.analyse_texts D=W_-=)1__name__ __module__ __qualname____doc__nameurlaliases filenames mimetypes version_addedflags keywords1 keywords2 keywords3 keywords4 keywords5 keywords6keyopts operators prefix_syms infix_symsrr BuiltinPseudorr Namespacerrrr)formatjoinr r IntegerHexOctBinFloatr CharDoublerrhrtokensrrrrrrs D CgGIIM EI&I I IIIG)IK$JTN $dll&9&9 : gy ) 7 > '"3"3 4 ]_ghohyhyz~@G@Q@Q`R S O>OQ^ _ .0A0A= Q 9U5 97;L;L M 9U5 97 C 9U5 97<< H 9U5 97 C 9U5 97>> J 9U5 97;K;K L $ ' ^^CHHWTrT]3 4h ?*Q{m2i[ 98 D t $ &.. ) +VZZ 8 !6:: .  , 8&,, G G U V[[ ! 7O 6==( + !4 ( DLL'' (K& PTN '++ , 6==( + V^^ $ K (  TN :G D x ( 7 > &.. ) +VZZ 8 gy ) K (  %g . gw ' gv & w   v}} % FMM " 6==& ) TN K %t~~ 6 djj& 1 !4 0 FO  MNF`rc XeZdZdZdZdZdgZdgZdgZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZdZdZdZdZgdefdedfdej@dfd edfe!ee"fe!ee"jFfe!e d!d!"e$jJfe!e d!d!"e$jLfe!e d!d!"e$fe!ed!d!"e$fe!e d!d!"e'jPfe!ed!d!"e'jRfe!ed!d!"e$jTfe!ed!d!"e$jTfe!ed!d!"e'jVfe!ed!d!"e$fe!ed!d!"e$fe!ed!d!"e$fe!ed!d!"e$fe!ed!d!"e$fe!ed!d!"e$fe!ed!d!"e$fe!ed!d!"e$jJfd#e,j@fd$e-jLfd%e.j^fd&e.j`fd'e.jbfd(ed)fd*ejdd+fd,e-fd-efded.fd/ed0fd1efgd2efdej@d.fd ed.fd3ej@d0fd4ed0fd#ej@fd5efgd6efd#ej@fd7efd8efd(ed0fgd9ejdfd#ej@fd:ejdfd8ejdfd*ejdd0fgd;Z3y<)=rz+ For the Isabelle proof assistant. Isabellezhttps://isabelle.in.tum.de/isabellez*.thyztext/x-isabellez2.0)2andassumesattachavoidsbindercheckingclass_instanceclass_relation code_modulecongsconstant constrains datatypesdefinesfilefixesr functionshints identifierrimportsrincludesinfixinfixlinfixrrkeywordsr module_namemonos morphisms no_discs_selsnotesobtainsopenoutput overloaded parametric permissive pervasive rep_compatshows structure type_classtype_constructor uncheckedunsafewhere)L ML_commandML_val class_deps code_deps code_thmsdisplay_drafts find_consts find_theoremsfind_unused_assmsfull_prfhelp locale_depsnitpickprprf print_abbrevsprint_antiquotationsprint_attributes print_binds print_bnfs print_bundlesprint_case_translations print_cases print_claset print_classesprint_codeprocprint_codesetupprint_coercionsprint_commands print_contextprint_defn_rulesprint_dependencies print_factsprint_induct_rulesprint_inductives print_interps print_locale print_locales print_methods print_options print_ordersprint_quot_mapsprint_quotconstsprint_quotientsprint_quotientsQ3print_quotmapsQ3 print_rules print_simpset print_stateprint_statement print_syntaxprint_theorems print_theoryprint_trans_rulesproppwd quickcheckrefute sledgehammer smt_status solve_direct spark_statustermthmthm_depsthy_depsrtry0typ unused_thmsvaluevalueswelcomeprint_ML_antiquotationsprint_term_bindings values_prolog)theorybeginr)headerchapter)section subsection subsubsectionsectsubsect subsubsect)MLML_file abbreviationadhoc_overloadingarities atom_declattribute_setupaxiomatizationbundle case_of_simpsclassclassesclassrel codatatype code_abort code_class code_const code_datatypecode_identifier code_include code_instancecode_modulename code_monad code_printing code_reflect code_reserved code_type coinductivecoinductive_setconstscontextdatatype datatype_newdatatype_new_compat declarationdeclare default_sort defer_recdef definitiondefsdomaindomain_isomorphism domaindef equivariance export_codeextract extract_typefixrecr| fun_cases hide_class hide_const hide_fact hide_typeimport_const_map import_file import_tptpimport_type_map inductive inductive_set instantiationjudgmentlemmaslifting_forgetlifting_update local_setuplocale method_setupnitpick_paramsno_adhoc_overloading no_notation no_syntaxno_translationsno_type_notationnominal_datatype nonterminalnotationnotepadoracle overloadingparse_ast_translationparse_translationpartial_function primcorecprimrec primrec_newprint_ast_translationprint_translationquickcheck_generatorquickcheck_params realizability realizersrecdefrecord refute_paramssetup setup_lifting simproc_setup simps_of_casesledgehammer_params spark_end spark_openspark_open_sivspark_open_vcgspark_proof_functions spark_types statespacesyntaxsyntax_declarationrtext_rawtheorems translations type_notation type_synonymtyped_print_translationtypedecl hoarestateinstall_C_fileinstall_C_types wpc_setupc_defsc_typesmemsafe SML_exportSML_file SML_import approximatebnf_axiomatization cartouchedatatype_compatfree_constructorsfunctornominal_functionnominal_terminationpermanent_interpretationbindsdefining smt2_statusterm_cartouche boogie_filetext_cartouche)inductive_casesinductive_simps)!ax_specificationbnf code_pred corollarycpodefcrunch crunch_ignore enriched_typefunctioninstanceinterpretationlemmalift_definitionnominal_inductivenominal_inductive2nominal_primrecpcpodefprimcorecursivequotient_definition quotient_type recdef_tc rep_datatypeschematic_corollaryschematic_lemmaschematic_theoremspark_vc specificationsubclass sublocale terminationtheoremtypedefwrap_free_constructors)rrqed)sorryoops)rhence interpret)nextproof)finallyfromr ultimatelyr) ML_prfalsoinclude includingrmoreovernotetxttxt_raw unfoldingrwrite)assumerdefr}presume)guessobtainshowthus)r apply_end apply_tracebackdeferprefer)rrr)[rrrrr+r!?){}.z..rrrz\\rBu\{\*|‹rrz \\<(\w|\^)*>z'[^\W\d][.\w']*r r r r rrfactz/[^\s:|\[\]\-()=,+!?{}._][^\s:|\[\]\-()=,+!?{}]*z[^(*)]+rrrru[^{*}\\‹›]+z \\u\*\}|›z[{*}\\]z[^"\\]+z\\"z\\z[^`\\]+z\\`)rrrBrrN)4rrrrr r!r"r#r$r% keyword_minor keyword_diag keyword_thykeyword_sectionkeyword_subsectionkeyword_theory_declkeyword_theory_scriptkeyword_theory_goal keyword_qedkeyword_abandon_proofkeyword_proof_goalkeyword_proof_blockkeyword_proof_chainkeyword_proof_declkeyword_proof_asmkeyword_proof_asm_goalkeyword_proof_scriptr.proof_operatorsrrr Symbolrr Wordr r2rrHeading Subheadingr3Errorrr r r7r8r9Otherr=rrrrrs D 'ClG I"#IM ML,-K+O $LC (K-7+ D@I ,O. Z . gy ). &-- 5. &+ . . 9 x ( . ? #X]] 3. =u =w~~ N. <e )% F P?. B'e Dgnn UC. Fdkk *G. J  +K. N,VZZ 8O. P"6:: .Q. R  ,S. V68 $W. X6<< (Y. Z@ F[. ` ! gw ' gv & w     ( &-- 1 &' * 6==& 1 && ) fmm ,    fmm , V  FO 66 "   & fmm , V\\ " FLL ! 6<< (  MMFrN)rpygments.lexerrrrrpygments.tokenrrr r r r r rrrpygments.lexers.leanr__all__rrrrrrsN @?---+  'jzjZWJWr