term

reco

package reco

Visibility
  1. Public
  2. All

Type Members

  1. type ELP = List[((), ELIR, List[()])]

    Definition Classes
    package

  2. type ERCH = (IES, ITRS, ITRS, H)

    Definition Classes
    package

  3. type H = HashMap[Int, ()]

    Definition Classes
    package

  4. type HE = (Term, (), Term, (), Term)

    Definition Classes
    package

  5. type IE = (Int, E)

    Definition Classes
    package

  6. type IES = HashMap[Int, E]

    Definition Classes
    package

  7. type IH = (Int, ())

    Definition Classes
    package

  8. type IOverlap = ((), Pos, ())

    Definition Classes
    package

  9. type IR = (Int, R)

    Definition Classes
    package

  10. type ITRS = HashMap[Int, R]

    Definition Classes
    package

  11. type J = (Term, (), Term)

    Definition Classes
    package

  12. type JS = List[()]

    Definition Classes
    package

  13. type Line = ((), ELIR, List[()])

    Definition Classes
    package

  14. type O = (Int, Rel)

    Definition Classes
    package

  15. case class ProofTree (equation: (), rule: ELIR, offspring: List[ProofTree]) extends Product with Serializable

Value Members

  1. object ELIR extends Enumeration

  2. object Rel extends Enumeration

  3. def application (e: E, es: IES): Boolean

    Definition Classes
    package

  4. def application2 (e: E, es: IES): Int

    Definition Classes
    package

  5. def atPos (r: E, s: Term, t: Term): Option[Pos]

    Definition Classes
    package

  6. def collapse (is: List[Int], erch: ()): ()

    Definition Classes
    package

  7. def compose (is: List[Int], erch: ()): ()

    Definition Classes
    package

  8. def composeToNF (is: List[Int], erch: ()): ()

    Definition Classes
    package

  9. def cps_history (itrs1: ITRS, itrs2: ITRS, ies: IES): H

    Definition Classes
    package

  10. def cps_history (itrs: ITRS, ies: IES): H

    Definition Classes
    package

  11. def cps_history (xs: List[Int], itrs: ITRS, ies: IES): H

    Definition Classes
    package

  12. def crit_pair (ol: ()): (Term, Int, Pos, Int, Term)

    Definition Classes
    package

  13. def critical_pairs (itrs: ITRS): List[(Term, Int, Pos, Int, Term)]

    Definition Classes
    package

  14. def deduce (is: List[Int], erch: ()): ()

    Definition Classes
    package

  15. def deduceE (is: List[Int], erch: ()): ()

    Definition Classes
    package

  16. def deduceS (is: List[Int], erch: ()): ()

    Definition Classes
    package

  17. def delete (is: List[Int], erch: ()): ()

    Definition Classes
    package

  18. def getPosAndSubst (t: Term, s: Term, u: Term, v: Term): (Option[Pos], Option[Subst])

    Definition Classes
    package

  19. def hToIES (h: H): IES

    Definition Classes
    package

  20. def hToITRS (h: H): ITRS

    Definition Classes
    package

  21. def heToE (he: ()): E

    Definition Classes
    package

  22. def heToR (he: ()): R

    Definition Classes
    package

  23. def hist_entry (ol: ()): ()

    Definition Classes
    package

  24. def initHistory (ies: IES): H

    Definition Classes
    package

  25. def ioverlaps (itrs1: List[()], itrs2: List[()]): List[()]

    Definition Classes
    package

  26. def ioverlaps (itrs: List[()]): List[()]

    Definition Classes
    package

  27. def ioverlaps (ir1: (), itrs: List[()]): List[()]

    Definition Classes
    package

  28. def ioverlaps (ir1: (), ir2: ()): List[()]

    Definition Classes
    package

  29. def joiningSequence (s: Term, t: Term, itrs: ITRS): Option[JS]

    Definition Classes
    package

  30. def m (ies: IES, itrs: ITRS): Int

    Returns a new fresh index which is greater then all indices used in ies and itrs.

    Returns a new fresh index which is greater then all indices used in ies and itrs.

    Definition Classes
    package

  31. def orient (is: List[Int], erch: (), tm: TM): ()

    Definition Classes
    package

  32. def orientL (is: List[Int], erch: (), tm: TM): ()

    Definition Classes
    package

  33. def orientR (is: List[Int], erch: (), tm: TM): ()

    Definition Classes
    package

  34. def partition [K, V] (is: List[Int], hm: HashMap[K, V]): (HashMap[K, V], HashMap[K, V])

    Definition Classes
    package

  35. def plant (s: Term, t: Term, js: JS): ProofTree

    Definition Classes
    package

  36. def printHE (he: ()): Unit

    Definition Classes
    package

  37. def printHEs (h: List[()]): Unit

    Definition Classes
    package

  38. def printIOverlap (io: ()): Unit

    Definition Classes
    package

  39. def printIOverlaps (ios: List[()]): Unit

    Definition Classes
    package

  40. def recall (s1: Term, s2: Term, e0: IES, r: ITRS, h: H): JS

    Definition Classes
    package

  41. def shorten (js: JS): JS

    Definition Classes
    package

  42. def simplifyL (is: List[Int], erch: ()): ()

    Definition Classes
    package

  43. def simplifyLToNF (is: List[Int], erch: ()): ()

    Definition Classes
    package

  44. def simplifyR (is: List[Int], erch: ()): ()

    Definition Classes
    package

  45. def simplifyRToNF (is: List[Int], erch: ()): ()

    Definition Classes
    package

  46. def simplifyToNF (is: List[Int], erch: ()): ()

    Definition Classes
    package