Impressum vect2D.prf
Sprache: Lisp
(vect2D
(vect2D_0 0
(vect2D_0-1 nil 3322906575 ("" (grind) nil nil )
((vect2 const-decl "Vect2" vect2D nil )) shostak))
(vect2D_1 0
(vect2D_1-1 nil 3322906579 ("" (grind) nil nil )
((vect2 const-decl "Vect2" vect2D nil )) shostak))
(Eq2D 0
(Eq2D-2 nil 3322906618
("" (skolem 1 ("u" "v" ))
(("" (expand "eq2D?" )
(("" (ground)
(("" (decompose-equality 1)
(("" (name-replace "X" "x!1" )
(("" (typepred "X" )
(("" (case "X=0 OR X=1" )
(("1" (split -1)
(("1" (replace -1) (("1" (propax) nil nil )) nil )
("2" (replace -1) (("2" (propax) nil nil )) nil ))
nil )
("2" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((eq2D? const-decl "bool" vect2D nil )
(Vect2 type-eq-decl nil vect2D nil )
(Index type-eq-decl nil vectors nil )
(< const-decl "bool" reals nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans nil )
(int nonempty-type-eq-decl nil integers nil )
(integer_pred const-decl "[rational -> boolean]" integers nil )
(rational nonempty-type-from-decl nil rationals nil )
(rational_pred const-decl "[real -> boolean]" rationals nil )
(real nonempty-type-from-decl nil reals nil )
(real_pred const-decl "[number_field -> boolean]" reals nil )
(number_field nonempty-type-from-decl nil number_fields nil )
(number_field_pred const-decl "[number -> boolean]" number_fields
nil )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil )
(OR const-decl "[bool, bool -> bool]" booleans nil )
(= const-decl "[T, T -> boolean]" equalities nil ))
nil )
(Eq2D-1 nil 3322906584
("" (grind)
(("" (decompose-equality)
(("" (grind) (("" (postpone) nil nil )) nil )) nil ))
nil )
nil shostak)))
quality 100%
¤ Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.0.18Bemerkung:
(vorverarbeitet)
¤
*Bot Zugriff
2026-03-28