at
.
logic
.
gapt
.
algorithms
.
rewriting
NameReplacement
Related Doc:
package rewriting
object
NameReplacement
performs renaming of constants, functions and predicate symbols
Linear Supertypes
AnyRef
,
Any
Ordering
Alphabetic
By inheritance
Inherited
NameReplacement
AnyRef
Any
Hide All
Show all
Visibility
Public
All
Type Members
type
OccMap
=
Map
[
FormulaOccurrence
,
FormulaOccurrence
]
type
ProofMap
=
Map
[
RobinsonResolutionProof
, (
OccMap
,
RobinsonResolutionProof
)]
type
SymbolMap
=
Map
[
String
, (
Int
,
String
)]
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
add_pmap
(
pmap:
ProofMap
,
parent:
RobinsonResolutionProof
)
: (
ProofMap
,
OccMap
,
RobinsonResolutionProof
)
def
apply
(
expTree:
ExpansionTree
,
map:
SymbolMap
)
:
ExpansionTree
def
apply
(
expSequent:
ExpansionSequent
,
map:
SymbolMap
)
(
implicit
dummyImplicit:
DummyImplicit
,
dummyImplicit2:
DummyImplicit
)
:
ExpansionSequent
def
apply
(
p:
RobinsonResolutionProof
,
map:
SymbolMap
)
:
RobinsonResolutionProof
def
apply
(
cls:
HOLClause
,
map:
SymbolMap
)
(
implicit
dummyImplicit:
DummyImplicit
)
:
HOLClause
def
apply
(
fs:
HOLSequent
,
map:
SymbolMap
)
:
Sequent
[
HOLFormula
]
def
apply
(
exp:
FOLTerm
,
map:
SymbolMap
)
:
FOLTerm
def
apply
(
exp:
FOLFormula
,
map:
SymbolMap
)
:
FOLFormula
def
apply
(
exp:
HOLFormula
,
map:
SymbolMap
)
:
HOLFormula
def
apply
(
exp:
FOLExpression
,
map:
SymbolMap
)
:
FOLExpression
def
apply
(
exp:
LambdaExpression
,
map:
SymbolMap
)
:
LambdaExpression
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
val
emptyProofMap
:
Map
[
RobinsonResolutionProof
, (
Map
[
FormulaOccurrence
,
FormulaOccurrence
],
RobinsonResolutionProof
)]
val
emptySymbolMap
:
Map
[
String
, (
Int
,
String
)]
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
extendw_pmap
(
index:
RobinsonResolutionProof
,
p:
ProofMap
,
o:
OccMap
,
i:
RobinsonResolutionProof
)
: (
Map
[
RobinsonResolutionProof
, (
OccMap
,
RobinsonResolutionProof
)],
OccMap
,
RobinsonResolutionProof
)
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
def
find_matching
[
A
,
B
]
(
objects:
List
[
A
]
,
targets:
List
[
B
]
,
matches: (
A
,
B
) ⇒
Boolean
)
:
Map
[
A
,
B
]
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
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
renameHOLSequent
(
fs:
HOLSequent
,
map:
SymbolMap
)
:
Sequent
[
HOLFormula
]
def
renameSymbols
(
exp:
FOLFormula
,
map:
SymbolMap
)
:
FOLFormula
def
renameSymbols
(
exp:
HOLFormula
,
map:
SymbolMap
)
:
HOLFormula
def
renameSymbols
(
exp:
FOLExpression
,
map:
SymbolMap
)
:
FOLExpression
def
renameSymbols
(
exp:
LambdaExpression
,
map:
SymbolMap
)
:
LambdaExpression
def
rename_resproof
(
p:
RobinsonResolutionProof
,
smap:
SymbolMap
,
pmap:
ProofMap
)
: (
ProofMap
,
OccMap
,
RobinsonResolutionProof
)
def
rename_resproof
(
p:
RobinsonResolutionProof
,
smap:
SymbolMap
)
: (
OccMap
,
RobinsonResolutionProof
)
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
AnyRef
Inherited from
Any
Ungrouped
performs renaming of constants, functions and predicate symbols