object Solver
- Alphabetic
- By Inheritance
- Solver
- AnyRef
- Any
- Hide All
- Show All
- 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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- def breakAfter(id: Int): Unit
-
def
check(controller: Controller, stack: Stack, tm: Term, expectedType: Option[(Context, Term)] = None, rulesOpt: Option[RuleSet] = None): Union[(Term, Term), Solver]
type reconstruction: checks a single term against a partially known type
type reconstruction: checks a single term against a partially known type
- tm
the term (as a ParseResult)
- expectedType
the expected type and the unknowns that additionally occur in it; if omitted a fresh unknown is generated for the type
- rulesOpt
the typing rules if known (to avoid computing them again)
- returns
Left(term, type) if successful, Right(solver) otherwise; in the latter case, use e.g. solver.logState to print the typing errors
-
var
checkId: Int
counter for debugging
-
def
checkType(controller: Controller, context: Context, tm: Term, tp: Term): Option[Solver]
checks a term without unknowns against a type, returns the solver if not successful
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
findSolvableVariable[A <: SolutionRule](rules: Iterable[A], unknowns: Context, t: Term): Option[(List[A], LocalName)]
tests a term for the occurrence of an unknown variables that can be isolated by applying solution rules
tests a term for the occurrence of an unknown variables that can be isolated by applying solution rules
- rules
the solution rules to test with
- unknowns
the list of variables to try to isolate
- t
the term in which to test
- returns
a pair (rs, n) such that applying rs to t (head first) has a chance of isolating n
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
infer(controller: Controller, context: Context, tm: Term, rulesOpt: Option[RuleSet]): Option[Term]
infers the type of a term that is known to be well-formed
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
makeUnknown(name: LocalName, args: List[LocalName]): Term
create an unknown whose solution may contain certain variables
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
val
propertyURI: URI
base for client property keys
-
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( ... ) @native()