at
.
logic
.
gapt
.
algorithms
.
rewriting
DefinitionElimination
Related Docs:
class DefinitionElimination
|
package rewriting
object
DefinitionElimination
extends
DefinitionElimination
Linear Supertypes
DefinitionElimination
,
Logger
,
AnyRef
,
Any
Ordering
Alphabetic
By inheritance
Inherited
DefinitionElimination
DefinitionElimination
Logger
AnyRef
Any
Hide All
Show all
Visibility
Public
All
Type Members
type
DefinitionsMap
=
Map
[
LambdaExpression
,
LambdaExpression
]
Definition Classes
DefinitionElimination
type
ProcessedDefinitionsMap
=
Map
[
SymbolA
, (
List
[
Var
],
HOLFormula
)]
Definition Classes
DefinitionElimination
Value Members
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
final
def
##
()
:
Int
Definition Classes
AnyRef → Any
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
apply
(
dmap:
DefinitionsMap
,
p:
LKProof
)
:
LKProof
Definition Classes
DefinitionElimination
def
apply
(
dmap:
DefinitionsMap
,
f:
LambdaExpression
)
:
LambdaExpression
Definition Classes
DefinitionElimination
def
apply
(
dmap:
DefinitionsMap
,
f:
HOLFormula
)
:
HOLFormula
Definition Classes
DefinitionElimination
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
debug
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
def
eliminate_in_proof
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
proof:
LKProof
)
:
LKProof
Definition Classes
DefinitionElimination
def
eliminate_in_proof_
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
proof:
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
error
(
msg: ⇒
String
,
e:
Throwable
)
:
Nothing
Attributes
protected
Definition Classes
Logger
def
error
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
def
expand_dmap
(
dmap:
DefinitionsMap
)
:
DefinitionsMap
Definition Classes
DefinitionElimination
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
def
fixedpoint_seq
[
A
]
(
f: (
A
) ⇒
A
,
l:
Seq
[
A
]
)
:
Seq
[
A
]
Definition Classes
DefinitionElimination
def
fixedpoint_val
[
A
]
(
f: (
A
) ⇒
A
,
l:
A
)
:
A
Definition Classes
DefinitionElimination
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
handleBinaryLogicalRule
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
uproof1:
LKProof
,
uproof2:
LKProof
,
root:
OccSequent
,
aux1:
FormulaOccurrence
,
aux2:
FormulaOccurrence
,
prin:
FormulaOccurrence
,
createRule: (
LKProof
,
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
) ⇒
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
def
handleContractionRule
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
uproof:
LKProof
,
root:
OccSequent
,
aux1:
FormulaOccurrence
,
aux2:
FormulaOccurrence
,
createRule: (
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
) ⇒
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
def
handleDefinitionRule
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
uproof:
LKProof
,
root:
OccSequent
,
aux:
FormulaOccurrence
,
prin:
FormulaOccurrence
,
createRule: (
LKProof
,
FormulaOccurrence
,
HOLFormula
) ⇒
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
def
handleEquationalRule
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
uproof1:
LKProof
,
uproof2:
LKProof
,
root:
OccSequent
,
aux1:
FormulaOccurrence
,
aux2:
FormulaOccurrence
,
prin:
FormulaOccurrence
,
createRule: (
LKProof
,
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
,
HOLFormula
) ⇒
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
def
handleNegationRule
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
uproof:
LKProof
,
root:
OccSequent
,
aux:
FormulaOccurrence
,
createRule: (
LKProof
,
FormulaOccurrence
) ⇒
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
def
handleStrongQuantifierRule
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
uproof:
LKProof
,
root:
OccSequent
,
aux:
FormulaOccurrence
,
prin:
FormulaOccurrence
,
eigenvar:
Var
,
createRule: (
LKProof
,
FormulaOccurrence
,
HOLFormula
,
Var
) ⇒
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
def
handleUnaryLogicalRule
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
uproof:
LKProof
,
root:
OccSequent
,
aux:
FormulaOccurrence
,
weakened_formula:
HOLFormula
,
createRule: (
LKProof
,
FormulaOccurrence
,
HOLFormula
) ⇒
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
def
handleWeakQuantifierRule
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
uproof:
LKProof
,
root:
OccSequent
,
aux:
FormulaOccurrence
,
prin:
FormulaOccurrence
,
substituted_term:
LambdaExpression
,
createRule: (
LKProof
,
FormulaOccurrence
,
HOLFormula
,
LambdaExpression
) ⇒
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
def
handleWeakeningRule
(
rewrite: (
LambdaExpression
) ⇒
LambdaExpression
,
uproof:
LKProof
,
root:
OccSequent
,
prin:
FormulaOccurrence
,
createRule: (
LKProof
,
HOLFormula
) ⇒
LKProof
)
: (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
LKProof
)
Definition Classes
DefinitionElimination
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
def
info
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
val
log
:
Logger
Attributes
protected
Definition Classes
Logger
def
loggerName
:
String
Attributes
protected
Definition Classes
Logger
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
replaceAll_in
(
dmap:
DefinitionsMap
,
e:
LambdaExpression
)
:
LambdaExpression
Definition Classes
DefinitionElimination
def
replaceAll_informula
(
dmap:
DefinitionsMap
,
e:
HOLFormula
)
:
HOLFormula
Definition Classes
DefinitionElimination
def
switchargs
[
A
,
B
,
C
,
D
]
(
f: (
A
,
B
,
C
) ⇒
D
)
: (
A
,
C
,
B
) ⇒
D
Definition Classes
DefinitionElimination
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
toString
()
:
String
Definition Classes
AnyRef → Any
def
trace
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
def
try_to_match
(
dmap:
DefinitionsMap
,
e:
LambdaExpression
)
:
LambdaExpression
Definition Classes
DefinitionElimination
def
try_to_matchformula
(
dmap:
DefinitionsMap
,
e:
LambdaExpression
)
:
HOLFormula
Definition Classes
DefinitionElimination
final
def
wait
()
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
,
arg1:
Int
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
warn
(
msg: ⇒
String
,
e:
Throwable
)
:
Unit
Attributes
protected
Definition Classes
Logger
def
warn
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
Inherited from
DefinitionElimination
Inherited from
Logger
Inherited from
AnyRef
Inherited from
Any
Ungrouped