HOME


Mini Shell 1.0
DIR: /lib/python3/dist-packages/pygments/lexers/__pycache__/
Upload File :
Current File : //lib/python3/dist-packages/pygments/lexers/__pycache__/theorem.cpython-312.pyc
�

|�eA���dZddlZddlmZmZmZmZddlmZm	Z	m
Z
mZmZm
Z
mZmZmZmZddlmZddgZGd�de�ZGd	�de�Zy)
a
    pygments.lexers.theorem
    ~~~~~~~~~~~~~~~~~~~~~~~

    Lexers for theorem-proving languages.

    See also :mod:`pygments.lexers.lean`

    :copyright: Copyright 2006-2023 by the Pygments team, see AUTHORS.
    :license: BSD, see LICENSE for details.
�N)�
RegexLexer�default�words�include)
�Text�Comment�Operator�Keyword�Name�String�Number�Punctuation�Generic�
Whitespace)�	LeanLexer�CoqLexer�
IsabelleLexerc���eZdZdZdZdZdgZdgZdgZdZ	dZ
d	Zd
ZdZ
dZd
ZdZdZdZdZdefdej,j.fdedfdefdej4fdej4fee
dd��ej4feedd��efeedd��ej8fee
dd��efeedd��ej.feedd��ej:fdefddj=eddd��zefd e�de�d!e��efd"efd#e jBfd$e jDfd%e jFfd&e jHfd'e jJfd(e&jNfd)e&jNfd*efd+e&jPd,fd-efd.ej,j.fgd/efded0fd1ed2fd3efgd4e&jPfd5e&jPfd+e&jPd2fgdefd6e)fd7ej4fd8ejTd2fd9ed2fe+d2�gd:�Z,d;�Z-y)<rz@
    For the Coq theorem prover.

    .. versionadded:: 1.5
    �Coqzhttp://coq.inria.fr/�coqz*.vz
text/x-coqr)Z�Section�Module�End�Require�Import�Export�Variable�	Variables�	Parameter�
Parameters�Axiom�Axioms�
Hypothesis�
Hypotheses�Notation�Local�Tactic�Reserved�Scope�Open�Close�Bind�Delimit�
Definition�Example�Let�Ltac�Fixpoint�
CoFixpoint�Morphism�Relation�Implicit�	Arguments�Types�Unset�
Contextual�Strict�Prenex�	Implicits�	Inductive�CoInductive�Record�	Structure�Variant�	Canonical�Coercion�Theorem�Lemma�Fact�Remark�	Corollary�Proposition�Property�Goal�Proof�Restart�Save�Qed�Defined�Abort�Admitted�Hint�Resolve�Rewrite�View�Search�Compute�Eval�Show�Print�Printing�All�Graph�Projections�inside�outside�Check�Global�Instance�Class�Existing�Universe�Polymorphic�Monomorphic�Context�Scheme�From�Undo�Fail�Function)�forall�exists�exists2�fun�fix�cofix�struct�match�end�in�return�let�if�is�then�else�for�of�nosimpl�with�as)�Type�Prop�SProp�Set)C�pose�set�move�case�elim�apply�clear�hnf�intro�intros�
generalize�rename�pattern�after�destruct�	induction�using�refine�	inversion�	injection�rewrite�congr�unlock�compute�ring�field�replace�fold�unfold�change�
cutrewrite�simpl�have�suff�wlog�suffices�without�loss�nat_norm�assert�cut�trivial�revert�
bool_congr�	nat_congr�symmetry�transitivity�auto�split�left�right�autorewrite�tauto�setoid_rewrite�	intuition�eauto�eapply�econstructor�
etransitivity�constructor�erewrite�red�cbv�lazy�
vm_compute�native_compute�subst)�by�now�done�exact�reflexivityr��romega�omega�lia�nia�lra�nra�psatz�
assumption�solve�
contradiction�discriminate�
congruence�admit)�do�last�first�try�idtac�repeat):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\|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\??z"\bSet(?=[ \t]+[A-Z][a-z][^\n]*?\.)�\b��prefix�suffixz\b([A-Z][\w\']*)z(%s)�|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\S�[^(*)]+�#push�\*\)�#pop�[(*)]z[^"]+z""r�z[A-Z][\w\']*(?=\s*\.)z[A-Z][\w\']*z[a-z][a-z0-9_\']*)�rootr�r�dottedc��d|vrd|vryyy)NrPrM��)�texts �9/usr/lib/python3/dist-packages/pygments/lexers/theorem.py�analyse_textzCoqLexer.analyse_text�s���D�=�W��_��-�=�).�__name__�
__module__�__qualname__�__doc__�name�url�aliases�	filenames�	mimetypes�flags�	keywords1�	keywords2�	keywords3�	keywords4�	keywords5�	keywords6�keyopts�	operators�prefix_syms�
infix_symsrr�Builtin�Pseudorr
�	Namespacerr�r(�joinr	r
�Integer�Hex�Oct�Bin�Floatr�Char�Doublerrfr�tokensrrrrrrs�����D�
 �C��g�G���I���I�
�E��I�$�I��I�
�I��I��I��G�)�I��K�$�J��T�N�
$�d�l�l�&9�&9�:�
�g�y�)�
7��>�
 �'�"3�"3�4�
2�G�4E�4E�F�
�9�U�5�
9�7�;L�;L�M�
�9�U�5�
9�7�C�
�9�U�5�
9�7�<�<�H�
�9�U�5�
9�7�C�
�9�U�5�
9�7�>�>�J�
�9�U�5�
9�7�;K�;K�L�
 �$�'�
�s�x�x���"��
�.�
.��9�(�+�y�
A�8�L�
�t�$�
�&�.�.�)�
+�V�Z�Z�8�
!�6�:�:�.�
����,�
8�&�,�,�G�
G����U�
�V�[�[�!�
�7�O�
�6�=�=�(�+�
!�4�(�
�D�L�L�'�'�(�G$
�L��!�
�g�w�'�
�g�v�&�
�w��	
��v�}�}�%�
�F�M�M�"�
�6�=�=�&�)�
��T�N�
�K� �
%�t�~�~�6�
�d�j�j�&�1�
!�4��0��F�O�

�c9�F�vrc�T�eZdZdZdZdZdgZdgZdgZdZ	dZ
d	Zd
ZdZ
dZd
ZdZdZdZdZdZdZdZdZdZdZdZdZgdef�dedf�dej>df�dedf�e e�e!f�e e�e!jDf�e e	d d �!�e#jHf�e e
d d �!�e#jJf�e ed d �!�e#f�e ed d �!�e#f�e ed d �!�e&jNf�e e
d d �!�e&jPf�e ed d �!�e#jRf�e ed d �!�e#jRf�e ed d �!�e&jTf�e ed d �!�e#f�e ed d �!�e#f�e ed d �!�e#f�e ed d �!�e#f�e ed d �!�e#f�e ed d �!�e#f�e ed d �!�e#f�e ed d �!�e#jHf�d"e+j>f�d#e,jJf�d$e-j\f�d%e-j^f�d&e-j`f�d'ed(f�d)ejbd*f�d+e,f�d,efded-fd.ed/fd0efgd1efdej>d-fded-fd2ej>d/fd3ed/fd"ej>fd4efgd5efd"ej>fd6efd7efd'ed/fgd8ejbfd"ej>fd9ejbfd7ejbfd)ejbd/fgd:�Z2y;)<rzF
    For the Isabelle proof assistant.

    .. versionadded:: 2.0
    �Isabellezhttps://isabelle.in.tum.de/�isabellez*.thyztext/x-isabelle)2�and�assumes�attach�avoids�binder�checking�class_instance�class_relation�code_module�congs�constant�
constrains�	datatypes�defines�file�fixesr��	functions�hints�
identifierr}�importsrz�includes�infix�infixl�infixrr~�keywordsr��module_name�monos�	morphisms�
no_discs_sels�notes�obtains�open�output�
overloaded�
parametric�
permissive�	pervasive�
rep_compat�shows�	structure�
type_class�type_constructor�	unchecked�unsafe�where)L�
ML_command�ML_val�
class_deps�	code_deps�	code_thms�display_drafts�find_consts�
find_theorems�find_unused_assms�full_prf�help�locale_deps�nitpick�pr�prf�
print_abbrevs�print_antiquotations�print_attributes�print_binds�
print_bnfs�
print_bundles�print_case_translations�print_cases�print_claset�
print_classes�print_codeproc�print_codesetup�print_coercions�print_commands�
print_context�print_defn_rules�print_dependencies�print_facts�print_induct_rules�print_inductives�
print_interps�print_locale�
print_locales�
print_methods�
print_options�print_orders�print_quot_maps�print_quotconsts�print_quotients�print_quotientsQ3�print_quotmapsQ3�print_rules�
print_simpset�print_state�print_statement�print_syntax�print_theorems�print_theory�print_trans_rules�prop�pwd�
quickcheck�refute�sledgehammer�
smt_status�solve_direct�spark_status�term�thm�thm_deps�thy_depsr��try0�typ�unused_thms�value�values�welcome�print_ML_antiquotations�print_term_bindings�
values_prolog)�theory�beginry)�header�chapter)�section�
subsection�
subsubsection�sect�subsect�
subsubsect)��ML�ML_file�abbreviation�adhoc_overloading�arities�	atom_decl�attribute_setup�axiomatization�bundle�
case_of_simps�class�classes�classrel�
codatatype�
code_abort�
code_class�
code_const�
code_datatype�code_identifier�code_include�
code_instance�code_modulename�
code_monad�
code_printing�code_reflect�
code_reserved�	code_type�coinductive�coinductive_set�consts�context�datatype�datatype_new�datatype_new_compat�declaration�declare�default_sort�defer_recdef�
definition�defs�domain�domain_isomorphism�	domaindef�equivariance�export_code�extract�extract_type�fixrecrt�	fun_cases�
hide_class�
hide_const�	hide_fact�	hide_type�import_const_map�import_file�import_tptp�import_type_map�	inductive�
inductive_set�
instantiation�judgment�lemmas�lifting_forget�lifting_update�local_setup�locale�method_setup�nitpick_params�no_adhoc_overloading�no_notation�	no_syntax�no_translations�no_type_notation�nominal_datatype�nonterminal�notation�notepad�oracle�overloading�parse_ast_translation�parse_translation�partial_function�	primcorec�primrec�primrec_new�print_ast_translation�print_translation�quickcheck_generator�quickcheck_params�
realizability�	realizers�recdef�record�
refute_params�setup�
setup_lifting�
simproc_setup�
simps_of_case�sledgehammer_params�	spark_end�
spark_open�spark_open_siv�spark_open_vcg�spark_proof_functions�spark_types�
statespace�syntax�syntax_declarationr�text_raw�theorems�translations�
type_notation�type_synonym�typed_print_translation�typedecl�
hoarestate�install_C_file�install_C_types�	wpc_setup�c_defs�c_types�memsafe�
SML_export�SML_file�
SML_import�approximate�bnf_axiomatization�	cartouche�datatype_compat�free_constructors�functor�nominal_function�nominal_termination�permanent_interpretation�binds�defining�smt2_status�term_cartouche�boogie_file�text_cartouche)�inductive_cases�inductive_simps)!�ax_specification�bnf�	code_pred�	corollary�cpodef�crunch�
crunch_ignore�
enriched_type�function�instance�interpretation�lemma�lift_definition�nominal_inductive�nominal_inductive2�nominal_primrec�pcpodef�primcorecursive�quotient_definition�
quotient_type�	recdef_tc�rep_datatype�schematic_corollary�schematic_lemma�schematic_theorem�spark_vc�
specification�subclass�	sublocale�termination�theorem�typedef�wrap_free_constructors)r�r��qed)�sorry�oops)r��hence�	interpret)�next�proof)�finally�fromr�
ultimatelyr�)�ML_prf�alsor�	includingr|�moreover�note�txt�txt_raw�	unfoldingr��write)�assumer��defru�presume)�guess�obtain�show�thus)r��	apply_end�apply_trace�back�defer�prefer)r�r�r��)�[r�r�r�r�r��+r��!�?)�{�}�.z..r�r�r�z\\<open>r7u\{\*|‹r�r�z\\<(\w|\^)*>z'[^\W\d][.\w']*r�rrrrr��factz/[^\s:|\[\]\-()=,+!?{}._][^\s:|\[\]\-()=,+!?{}]*rrrrr	u[^{*}\\‹›]+z	\\<close>u\*\}|›z[{*}\\]z[^"\\]+z\\"z\\z[^`\\]+z\\`)r
r�r7rr�N)3rrrrrrrrr�
keyword_minor�keyword_diag�keyword_thy�keyword_section�keyword_subsection�keyword_theory_decl�keyword_theory_script�keyword_theory_goal�keyword_qed�keyword_abandon_proof�keyword_proof_goal�keyword_proof_block�keyword_proof_chain�keyword_proof_decl�keyword_proof_asm�keyword_proof_asm_goal�keyword_proof_scriptr$�proof_operatorsrrr�Symbolrr	�Wordr
r(r�r�Heading�
Subheadingr)�Errorrrr
r,r-r.�Otherr2rrrrr�s�����D�
'�C��l�G��	�I�"�#�I�
�M��L�,-�K�+�O���
$��LC��
��(�K�-��7��+������
D��@�����I�
,�O�.
�
�Z� �.
�
�g�y�)�.
��&�-�-��5�.
��&�+�.�	.
��9�
�x�(�
.
��?�
#�X�]�]�3�.
��=��u�
=�w�~�~�N�.
��<��e�
<�g�l�l�K�.
��;�u�U�
;�W�E�.
��&�u�U�
C�W�M�.
� �?�5��
?����Q�!.
�"�%�e�E�
B�G�DV�DV�W�#.
�&�&�u�U�
C�W�EV�EV�W�'.
�(�(��u�
E�w�GX�GX�Y�).
�,�(��u�
E�w�}�}�U�-.
�0�;�u�U�
;�W�E�1.
�2�%�e�E�
B�G�L�3.
�4�&�u�U�
C�W�M�5.
�6�%�e�E�
B�G�L�7.
�:�&�u�U�
C�W�M�;.
�<�$�U�5�
A�7�K�=.
�>�)�%��
F��P�?.
�B�'��e�
D�g�n�n�U�C.
�F�d�k�k�*�G.
�J ����+�K.
�N,�V�Z�Z�8�O.
�P"�6�:�:�.�Q.
�R ����,�S.
�V�6�8�$�W.
�X�6�<�<��(�Y.
�Z@��F�[.
�`��!�
�g�w�'�
�g�v�&�
�w��	
� ��(�
�&�-�-��1�
�&�'�*�
�6�=�=�&�1�
�&�&�)�
�f�m�m�,�
�� �
��� �
�f�m�m�,�
�V��
�F�O�
�6�6�"�
�����&�
�f�m�m�,�
�V�\�\�"�
�F�L�L�!�
�6�<�<��(�
�MM�Fr)r�re�pygments.lexerrrrr�pygments.tokenrrr	r
rrr
rrr�pygments.lexers.leanr�__all__rrrrr�<module>r�sN��
�
�>�>�-�-�-�*���
'��U�z�U�pX�J�Xr