| java.lang.Object de.uka.ilkd.key.proof.decproc.smtlib.Formula de.uka.ilkd.key.proof.decproc.smtlib.LetFormula
LetFormula | public class LetFormula extends Formula (Code) | | Represents a 'let'-construct formula as defined in the SMT-Lib specification,
and specialized in the (QF_)AUFLIA sublogic.
Thereby a 'let'-construct consists of a formula f, a term variable termVar contained in f,
and a term t. It is semantically equivalent to the formula obtained by replacing every free
occurence of termVar in f by the term t.
LetFormula are immutable; their values cannot be changed after they are created
author: akuwertz version: 1.4, 12/12/2005 (Adjustments to superclass V1.5; further comments) |
LetFormula | public LetFormula(TermVariable tVar, Term t, Formula f)(Code) | | Creates a new LetFormula using the 'let'-construct.
Parameters: tVar - the TermVariable which is to be semantically replaced Parameters: t - the Term which will be semantically inserted into f at every occurence of termVar Parameters: f - the Formula in which termVar will be semantically replaced by t throws: NullPointerException - if one of the specified arguments is null throws: IllegalArgumentException - if termVar is not contained in f |
containsFormula | public boolean containsFormula(Formula form)(Code) | | Returns true if this LetFormula contains form as a subformula.
In a 'let'-construct, the formula obtained by replacing every free occurence of its
TermVariable termVar in its Formula f by its
Term t, is checked for containing the specified Formula
form.
Parameters: form - the Formula be checked for containment in this LetFormula true if this LetFormula contains form |
containsTerm | public boolean containsTerm(Term term)(Code) | | Returns true if this LetFormula contains the Term term.
In a 'let'-construct, the formula obtained by replacing every free occurence of its
TermVariable termVar in its Formula f by its
Term t, is checked for containing the specified Term term.
Parameters: term - the Term be checked for containment in this LetFormula true if this LetFormula contains term |
equalsReplacedForm | public boolean equalsReplacedForm(Formula form)(Code) | | Returns true if the specified Formula form equals the Formula
obtained from this LetFormula by replacing every free occurence of its
TermVariable termVar by its Term t.
Parameters: form - the Formula to be compared with the replaced Formula ofthis LetFormula true if the specified Formula equals the replaced Formulaof this LetFormula |
getFormulaF | public Formula getFormulaF()(Code) | | Returns the Formula f of this LetFormula
the Formula f of this LetFormula |
getTermT | public Term getTermT()(Code) | | Returns the replacement term t of this LetFormula
the term variable of this LetFormula |
getTermVar | public TermVariable getTermVar()(Code) | | Returns the term variable of this LetFormula
the term variable of this LetFormula |
hashCode | public int hashCode()(Code) | | |
hashCodeReplacedForm | public int hashCodeReplacedForm()(Code) | | Returns the hash code of the Formula obtained from this LetFormula
by replacing every free occurence of its TermVariable termVar
by its Term t.
the hash code of the replaced Formula of this LetFormula |
|
|