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 scalahott
    Definition Classes
    provingground
  • object ScalaUniv extends Serializable
    Definition Classes
    scalahott
  • DepFunc
  • FineSymbTyp
  • FineUniv
  • FuncTypUniv
  • HigherUniv
  • PiTypUniv

object DepFunc

Companion to dependent functions

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DepFunc
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. def apply[W <: Term with Subs[W], U <: Term with Subs[U]](func: (Term) => U, dom: Typ[W])(implicit su: ScalaUniv[U]): DepFuncDefn[W, U]