object SipRecSchem extends RecSchemTemplate
- Source
- recursionSchemes.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- SipRecSchem
- RecSchemTemplate
- Serializable
- Serializable
- Product
- Equals
- 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
- val A: String
- val G: String
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
val
canonicalArgs: Map[Const, List[Var]]
- Definition Classes
- RecSchemTemplate
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
val
constraintEvaluators: Map[(Const, Const), (Seq[LambdaExpression], Seq[LambdaExpression]) ⇒ Boolean]
- Definition Classes
- RecSchemTemplate
-
val
constraints: Map[(Const, Const), HOLFormula]
- Definition Classes
- RecSchemTemplate
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
findMinimalCover(targets: Set[(LambdaExpression, LambdaExpression)], solver: MaxSATSolver = bestAvailableMaxSatSolver, weight: (Rule) ⇒ Int = _ => 1): RecursionScheme
- Definition Classes
- RecSchemTemplate
-
def
findMinimalCoverViaInst(targets: Set[(LambdaExpression, LambdaExpression)], solver: MaxSATSolver = bestAvailableMaxSatSolver, weight: (Rule) ⇒ Int = _ => 1): RecursionScheme
- Definition Classes
- RecSchemTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isSubterm(v: LambdaExpression, t: LambdaExpression): HOLFormula
- Definition Classes
- RecSchemTemplate
-
val
isSubtermC: String
- Definition Classes
- RecSchemTemplate
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
val
nonTerminals: Set[Const]
- Definition Classes
- RecSchemTemplate
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- def stableRecSchem(instanceLanguages: Seq[InstanceLanguage]): RecursionScheme
-
def
stableRecSchem(targets: Set[(LambdaExpression, LambdaExpression)]): RecursionScheme
- Definition Classes
- RecSchemTemplate
-
val
startSymbol: Const
- Definition Classes
- RecSchemTemplate
-
val
states: Iterable[LambdaExpression]
- Definition Classes
- RecSchemTemplate
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
val
targetFilter: Type
- Definition Classes
- RecSchemTemplate
-
val
template: Set[(LambdaExpression, LambdaExpression)]
- Definition Classes
- RecSchemTemplate
- def toSipGrammar(recSchem: RecursionScheme): SipGrammar
- def toTargets(instanceLanguages: Seq[InstanceLanguage]): Seq[(LambdaExpression, LambdaExpression)]
-
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( ... )