at
.
logic
.
gapt
.
proofs
.
lksk
eliminateDefinitions
Related Doc:
package lksk
object
eliminateDefinitions
Linear Supertypes
AnyRef
,
Any
Ordering
Alphabetic
By inheritance
Inherited
eliminateDefinitions
AnyRef
Any
Hide All
Show all
Visibility
Public
All
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
(
p:
LKProof
)
:
LKProof
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
computeMap
(
occs:
Seq
[
LabelledFormulaOccurrence
]
,
old_proof:
LKProof
,
new_proof:
LKProof
,
old_map:
Map
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
]
)
:
HashMap
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
]
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
handleBinaryProp
(
r:
BinaryLKProof
with
AuxiliaryFormulas
,
p1:
LKProof
,
p2:
LKProof
,
a1:
LabelledFormulaOccurrence
,
a2:
LabelledFormulaOccurrence
,
constructor: (
LKProof
,
LKProof
,
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
) ⇒
BinaryLKProof
with
AuxiliaryFormulas
)
: (
BinaryLKProof
with
AuxiliaryFormulas
,
Map
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
])
def
handleContraction
(
new_parent: (
LKProof
,
Map
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
])
,
old_parent:
LKProof
,
old_proof:
LKProof
,
a1:
LabelledFormulaOccurrence
,
a2:
LabelledFormulaOccurrence
,
constructor: (
LKProof
,
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
) ⇒
LKProof
)
: (
LKProof
,
HashMap
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
])
def
handleDefinition
(
r:
LKProof
,
p:
LKProof
)
: (
LKProof
,
HashMap
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
])
def
handleEquational
(
r:
BinaryLKProof
with
AuxiliaryFormulas
,
p1:
LKProof
,
p2:
LKProof
,
a1:
LabelledFormulaOccurrence
,
a2:
LabelledFormulaOccurrence
,
m:
HOLFormula
,
constructor: (
LKProof
,
LKProof
,
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
,
HOLFormula
) ⇒
BinaryLKProof
with
AuxiliaryFormulas
)
: (
BinaryLKProof
with
AuxiliaryFormulas
,
Map
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
])
def
handleWeakening
(
new_parent: (
LKProof
,
Map
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
])
,
old_parent:
LKProof
,
old_proof:
LKProof
,
constructor: (
LKProof
,
HOLFormula
,
Label
) ⇒
LKProof
with
PrincipalFormulas
,
m:
LabelledFormulaOccurrence
)
: (
LKProof
with
PrincipalFormulas
,
Map
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
])
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
rec
(
proof:
LKProof
)
: (
LKProof
,
Map
[
LabelledFormulaOccurrence
,
LabelledFormulaOccurrence
])
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
toLabelledSequent
(
so:
OccSequent
)
:
LabelledOccSequent
def
toString
()
:
String
Definition Classes
AnyRef → Any
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
(
...
)
Inherited from
AnyRef
Inherited from
Any
Ungrouped