at
.
logic
.
gapt
.
cli
.
GAPScalaInteractiveShellLibrary
mapProof
Related Doc:
package GAPScalaInteractiveShellLibrary
object
mapProof
extends
map_proof
Linear Supertypes
map_proof
,
AnyRef
,
Any
Ordering
Alphabetic
By inheritance
Inherited
mapProof
map_proof
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
(
proof:
LKProof
,
fun: (
LambdaExpression
) ⇒
LambdaExpression
)
: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
Definition Classes
map_proof
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
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
(
new_parent_1: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
,
new_parent_2: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
,
a1:
FormulaOccurrence
,
a2:
FormulaOccurrence
,
old_parent_1:
LKProof
,
old_parent_2:
LKProof
,
old_proof:
LKProof
,
constructor: (
LKProof
,
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
) ⇒
LKProof
)
: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
Definition Classes
map_proof
def
handleContraction
(
new_parent: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
,
old_parent:
LKProof
,
old_proof:
LKProof
,
a1:
FormulaOccurrence
,
a2:
FormulaOccurrence
,
constructor: (
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
) ⇒
LKProof
)
: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
Definition Classes
map_proof
def
handleEquationRule
(
constructor: (
LKProof
,
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
,
HOLFormula
) ⇒
LKProof
,
p1:
LKProof
,
p2:
LKProof
,
old_proof:
LKProof
,
new_p1: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
,
new_p2: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
,
s:
OccSequent
,
a1:
FormulaOccurrence
,
a2:
FormulaOccurrence
,
m:
HOLFormula
)
: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
Definition Classes
map_proof
def
handleRule
(
proof:
LKProof
,
new_parents:
List
[(
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])]
,
fun: (
LambdaExpression
) ⇒
LambdaExpression
)
: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
Definition Classes
map_proof
def
handleWeakening
(
new_parent: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
,
fun: (
LambdaExpression
) ⇒
LambdaExpression
,
old_parent:
LKProof
,
old_proof:
LKProof
,
constructor: (
LKProof
,
HOLFormula
) ⇒
LKProof
with
PrincipalFormulas
,
m:
FormulaOccurrence
)
: (
LKProof
with
PrincipalFormulas
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
Definition Classes
map_proof
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
val
help
:
String
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
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
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
map_proof
Inherited from
AnyRef
Inherited from
Any
Ungrouped