object
undoHol2Fol extends Logger
Type Members
-
type
Signature = (Map[String, Set[Const]], Map[String, Set[Var]])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
backtranslate(e: LambdaExpression, sig_vars: Map[String, List[Var]], sig_consts: Map[String, List[Const]], abssymbol_map: Map[String, LambdaExpression], expected_type: Option[Ty]): LambdaExpression
-
def
backtranslate(e: LambdaExpression, sig_vars: Map[String, List[Var]], sig_consts: Map[String, List[Const]], abssymbol_map: Map[String, LambdaExpression]): HOLFormula
-
def
clone(): AnyRef
-
def
debug(msg: ⇒ String): Unit
-
-
-
def
error(msg: ⇒ String, e: Throwable): Nothing
-
def
error(msg: ⇒ String): Unit
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
getSignature(e: LambdaExpression, csig: Map[String, Set[Const]], vsig: Map[String, Set[Var]]): (Map[String, Set[Const]], Map[String, Set[Var]])
-
-
-
def
hashCode(): Int
-
def
info(msg: ⇒ String): Unit
-
final
def
isInstanceOf[T0]: Boolean
-
val
ivy_varname: Regex
-
val
log: Logger
-
def
loggerName: String
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
trace(msg: ⇒ String): Unit
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
warn(msg: ⇒ String, e: Throwable): Unit
-
def
warn(msg: ⇒ String): Unit
This is implements some heuristics to convert a fol formula obtained by at.logic.gapt.expr.fol.replaceAbstractions and at.logic.gapt.expr.fol.reduceHolToFol back to its original signature. Sometimes, types have to be guessed and the code is poorly tested, so it is unclear how general it is. It works (and is necessary) during the acnf creation of the n-tape proof.
To extract a signature, use the undoHol2Fol.getSignature, to to the back translation use undoHol2Fol.backtranslate.