Packages

  • package root
    Definition Classes
    root
  • package provingground

    This is work towards automated theorem proving based on learning, using homotopy type theory (HoTT) as foundations and natural language processing.

    This is work towards automated theorem proving based on learning, using homotopy type theory (HoTT) as foundations and natural language processing.

    The implementation of homotopy type theory is split into:

    • the object HoTT with terms, types, functions and dependent functions, pairs etc
    • the package induction with general inductive types and recursion/induction on these.

    The learning package has the code for learning.

    Scala code, including the spire library, is integrated with homotopy type theory in the scalahott package

    We have implemented a functor based approach to translation in the translation package, used for nlp as well as serialization and parsing.

    The library package is contains basic structures implemented in HoTT.

    Definition Classes
    root
  • package andrewscurtis
    Definition Classes
    provingground
  • package examples
    Definition Classes
    provingground
  • package induction

    Much of the richness of HoTT is in the definitions of Inductive types (and their indexed counterparts) and of (dependent) functions on these by recursion and induction These are implemented using several layers of recursive definitions and diagonals (i.e., fixed points).

    Much of the richness of HoTT is in the definitions of Inductive types (and their indexed counterparts) and of (dependent) functions on these by recursion and induction These are implemented using several layers of recursive definitions and diagonals (i.e., fixed points). In HoTT, recursion and induction are applications of (dependent) functions rec_W,X and ind_W, Xs to the definition data.

    It is useful to capture information regarding inductive types and the recursion and induction functions in scala types. Our implementation is designed to do this.

    Inductive Type Definitions

    Inductive types are specified by introduction rules. Each introduction rule is specified in ConstructorShape (without specifying the type) and ConstructorTL including the specific type. The full definition is in ConstructorSeqTL.

    Recursion and Induction functions

    These are defined recursively, first for each introduction rule and then for the inductive type as a whole. A subtlety is that the scala type of the rec_W,X and induc_W, Xs functions depends on the scala type of the codomain X (or family Xs). To make these types visible, some type level calculations using implicits are done, giving traits ConstructorPatternMap and ConstructorSeqMap that have recursive definition of the recursion and induction functions, the former for the case of a single introduction rule. Traits ConstructorSeqMapper and ConstructorPatternMapper provide the lifts.

    Indexed Versions

    There are indexed versions of all these definitions, to work with indexed inductive type families.

    Definition Classes
    provingground
  • package interface
    Definition Classes
    provingground
  • package learning
    Definition Classes
    provingground
  • package library
    Definition Classes
    provingground
  • package scalahott
    Definition Classes
    provingground
  • package scratch
    Definition Classes
    provingground
  • package translation

    Translation primarily using a functorial framework - see Translator$, for natural language processing as well as serialization, formatted output, parsing, interface with formal languages etc.

    Translation primarily using a functorial framework - see Translator$, for natural language processing as well as serialization, formatted output, parsing, interface with formal languages etc.

    Besides the Translator framework and helper typeclasses is Functors, several structures for concrete languages including our implementation of HoTT are in this package.

    Definition Classes
    provingground
  • Base
  • Context
  • FiniteDistribution
  • Frankl
  • HoTT
  • JvmUtils
  • LinearStructure
  • MereProposition
  • PickledWeighted
  • ProbabilityDistribution
  • Subst
  • SubstImplicits
  • TermList
  • TermListImplicits
  • Utils
  • Weighted

sealed trait Context extends AnyRef

Linear Supertypes
AnyRef, Any
Known Subclasses
AppendConstant, AppendDefn, AppendIndDef, AppendTerm, AppendVariable, Empty
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Context
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract val constants: Vector[Term]
  2. abstract val definitions: Vector[Defn[Term]]
  3. abstract def export(t: Term): Term
  4. abstract def exportStrict(t: Term): Term
  5. abstract def exportTyp(typ: Typ[Term]): Typ[Term]
  6. abstract def exportTypStrict(typ: Typ[Term]): Typ[Term]
  7. abstract val exportVariables: Vector[Term]
  8. abstract def importOpt(t: Term): Option[Term]
  9. abstract def importTypOpt(t: Typ[Term]): Option[Typ[Term]]
  10. abstract val inductiveDefns: Vector[ExstInducStrucs]
  11. abstract val statements: Vector[String]
  12. abstract def subs(x: Term, y: Term): Context
  13. abstract val terms: Vector[Term]
  14. abstract val valueOpt: Option[Term]
  15. abstract val variables: Vector[Term]

Concrete Value Members

  1. def ++(that: Context): Context
  2. def addConstant[U <: Term with Subs[U]](const: U): AppendConstant[U]
  3. def addVariable[U <: Term with Subs[U]](variable: U): AppendVariable[U]
  4. def apply(kvs: (String, Term)*): Context
  5. def assert(tp: Typ[Term]): AppendTerm[Typ[Term]]
  6. def assume(tp: Typ[Term], text: String = "assumption"): AppendConstant[Term]
  7. def consider(ts: Term*): Context
  8. def define[U <: Term with Subs[U]](name: Term, value: U): AppendDefn[U]
  9. def defineInduc(ind: ExstInducStrucs): AppendIndDef
  10. def defineSym[U <: Term with Subs[U]](name: AnySym, value: U): AppendDefn[U]
  11. def given[U <: Term with Subs[U]](v: Term): Context
  12. lazy val inducStruct: ExstInducStrucs
  13. def introduce[U <: Term with Subs[U]](t: U, role: Role = Consider): AppendTerm[U]
  14. def let[U <: Term with Subs[U]](name: Term, value: U): AppendDefn[U]
  15. lazy val namedTerms: Map[String, Term]
  16. def toString(): String
    Definition Classes
    Context → AnyRef → Any