X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fmatita%2Fcore_notation.ma;h=680ebb7b5ac858a028708a4dbb4896bbe8175800;hb=13fab17e3d3dee05df676985c065ae54a5766870;hp=486e921b5d4ba717bb317976e8ec8736c48def1d;hpb=84c9131c30a4a991c595f61620794b1b75a5a16d;p=helm.git diff --git a/helm/matita/core_notation.ma b/helm/matita/core_notation.ma index 486e921b5..680ebb7b5 100644 --- a/helm/matita/core_notation.ma +++ b/helm/matita/core_notation.ma @@ -2,6 +2,10 @@ notation "hvbox(a break \to b)" right associative with precedence 20 for @{ \forall $_:$a.$b }. +notation < "hvbox(a break \to b)" + right associative with precedence 20 +for @{ \Pi $_:$a.$b }. + notation "hvbox(a break = b)" non associative with precedence 45 for @{ 'eq $a $b }. @@ -91,6 +95,13 @@ interpretation "real unary minus" 'uminus x = (cic:/Coq/Reals/Rdefinitions/Ropp. interpretation "binary integer negative sign" 'uminus x = (cic:/Coq/ZArith/BinInt/Z.ind#xpointer(1/1/3) x). interpretation "binary integer unary minus" 'uminus x = (cic:/Coq/ZArith/BinInt/Zopp.con x). +(* logical operators *) + +interpretation "logical and" 'and x y = (cic:/Coq/Init/Logic/and.ind#xpointer(1/1) x y). +interpretation "logical or" 'or x y = (cic:/Coq/Init/Logic/or.ind#xpointer(1/1) x y). +interpretation "logical not" 'not x = (cic:/Coq/Init/Logic/not.con x). +interpretation "exists" 'exists x y = (cic:/Coq/Init/Logic/ex.ind#xpointer(1/1) x y). + (* relational operators *) interpretation "natural 'less or equal to'" 'leq x y = (cic:/Coq/Init/Peano/le.ind#xpointer(1/1) x y). @@ -105,22 +116,3 @@ interpretation "real 'greater than'" 'gt x y = (cic:/Coq/Reals/Rdefinitions/Rgt. interpretation "leibnitz's equality" 'eq x y = (cic:/Coq/Init/Logic/eq.ind#xpointer(1/1) _ x y). interpretation "not equal to (leibnitz)" 'neq x y = (cic:/Coq/Init/Logic/not.con (cic:/Coq/Init/Logic/eq.ind#xpointer(1/1) _ x y)). -(* logical operators *) - -interpretation "logical and" 'and x y = (cic:/Coq/Init/Logic/and.ind#xpointer(1/1) x y). -interpretation "logical or" 'or x y = (cic:/Coq/Init/Logic/or.ind#xpointer(1/1) x y). -interpretation "logical not" 'not x = (cic:/Coq/Init/Logic/not.con x). -interpretation "exists" 'exists x y = (cic:/Coq/Init/Logic/ex.ind#xpointer(1/1) x y). - -(* - add_symbol_choice "cast" - ("type cast", - (fun env _ args -> - let t1, t2 = - match args with - | [t1; t2] -> t1, t2 - | _ -> raise Invalid_choice - in - Cic.Cast (t1, t2))); -*) -