Packages

package root

Definition Classes: root

package info

Definition Classes: root

package kwarc

Definition Classes: info

package mmt

Definition Classes: kwarc

package api

This is the main package of the MMT API.

It holds subpackages for all data structures, data containers, and the central algorithms and services.

Classes directly defined in the package

Some minor classes that are used throughout MMT are defined in this package, in particular:

MMT URIs in the class Path and Namespace
processing and content errors in the class Error

The package also contains root classes for certain types that are subclassed throughout the package. Most importantly:

StructuralElement: structure-level (= named) parts in the data structures for the MMT language: documents, theories, constants, ...
MMTTask: tasks for a single object: parsing, checking, ...
Rule: object-level part of the MMT language that is written in Scala

Subpackages

Data structures for the MMT language

The data structures for the MMT languages are defined in 4 packages corresponding to the 4 levels: - documents: Documents and all other NarrativeElements - modules: Modules (= the toplevel declarations), in particular Theorys and Views - symbols: all Declarations inside modules, in particular Constants - objects: all anonymous Objects (e.g., formulas, functions, etc.), in particular Contexts and Terms

The former 3 levels are jointly called 'structural' levels. All elements subclass StructuralElement, have an MMT URI, and carry an MMT URI referring to their parent in the MMT abstract syntax tree.

Structural elements are extensible (via DerivedModules and DerivedDeclarations), and the package patterns defines declaration patterns as a built-in extension.

All structural elements are mutable and implement the ContainerElement interface for changing their children. Objects, by contrast, are represented as immutable inductive types.(except for carrying metadata.Metadata and objects.ClientProperties). The boundary between structural elements and objects is mediated by ComponentContainers: these are mutable, owned by structural elements, and maintain objects.

A few auxiliary data structures shifted to separate packages: - opaque: external (i.e., informal, computation) content - informal: partially outdated informal data structures - metadata: metadata annotations to all structural elements or objects

The MMT main class and its internal state

The package frontend contains the class Controller, which owns all state relevant for running MMT. Typically, each application creates a single instance of this class. The package also defines several other essential classes, most importantly MMT's extension (=plug-in, add-on) interfaces via the Extension class.

The package libraries maintains the instances of MMT language data structures, in particular the Library class. Controller owns a Library, which stores all structural elements that have been loaded into memory.

User interfaces

The package frontend also contains the main executable classes, in particular the Shell class.

The package gui collects all classes for building graphical user interfaces. This includes auxiliary classes for use in IDE plugins.

The package web collects all classes for the HTTP interface of MMT.

Physical storage of the MMT language files

The package archives defines MMT Archives (= projects) as well as classes for building and working with archives. The latter include in particular the BuildManager and BuildTarget. Build targets include Importers and [Exporter]]s that translate between MMT and other formats.

The package backend defines classes for maintaining archives and translating between the MMT URIs of structural elements and their physical storage locations.

The central algorithms for processing MMT content

The processing model of MMT consists of several major algorithms. - parser: read strings into MMT data structures - checking: check and refine MMT data structures - uom: pure computation on MMT data structures - proving: theorem proving on MMT data structures (in very early state)) - execution: imperative computation (in very, very early state) - presentation: rendering MMT data structures in user-facing formats (including HTML+presentation MathML)

All algorithms are defined in Extensions coupled with default implementations. Moreover, all algorithms are split into two separate levels, one for structural elements and objects. See LeveledExtension.

The package notations maintains the common code for parsing and presentation.

The package valuebases maintains mathematical databases as a part of MMT.

Other algorithms on the MMT data structures

The package ontology contains a relational, semantic web-style ontology and query engine for it.

The package moc contains change management.

The package refactoring contains refactoring principles.

General purpose utility functions

The package utils defines general purpose APIs for files, URIs, HTML building, etc.

Definition Classes: mmt

package objects

MMT objects are

Terms
Contexts, which are lists of VarDecl
Substitutions, which are lists of Sub

AnonymousDiagram, AnonymousTheory, and AnonymousMorphism represent anonymous counterparts to libraries.Library modules.Module}.

This package also contains various auxiliary classes: - Position defines paths within objects - SubstitutionApplier is the main interface for substitution strategies. - Matcher is a simple matcher.

Definition Classes: api

AnonymousBody

AnonymousDiagram

AnonymousDiagramCombinator

AnonymousMorphism

AnonymousMorphismCombinator

AnonymousTheory

AnonymousTheoryCombinator

Appendage

BinaryObjJudgement

ComplexMorphism

ComplexTerm

ComplexTheory

CongruenceClosure

Context

Conversions

DerivedOMLFeature

DerivedVarDeclFeature

DiagramArrow

DiagramElement

DiagramNode

DomainElement

Equality

EqualityContext

Formal

Free

FreeOrAny

IncludeOML

IncludeSub

IncludeVarDecl

Inhabitable

Inhabited

IsContext

IsMorphism

IsRealization

IsTheory

Judgement

MatchFail

MatchResult

MatchSuccess

Matcher

MemoizedSubstitutionApplier

ModExp

Morph

MorphType

OMA

OMATTR

OMATTRMany

OMAorAny

OMBIND

OMBINDC

OMCOMP

OMFOREIGN

OMID

OMIDENT

OMINST

OML

OMLIT

OMLITTrait

OMLList

OMM

OMMOD

OMPMOD

OMS

OMSemiFormal

OMStructuralInclude

OMV

Obj

PlainSubstitutionApplier

Position

RealizeOML

SemiFormalObject

SemiFormalObjectList

ShortURIPrinter

SmartSubstitutionApplier

Stack

StatelessTraverser

StructureOML

StructureSharingSubstitutionApplier

StructureSub

StructureVarDecl

Sub

Substitution

SubstitutionApplier

Subtyping

TUnion

Term

Text

TheoryExp

TheoryType

ThisTypeTrait

TorsoForm

TorsoNormalForm

Traverser

Typing

UnaryObjJudgement

Universe

UnknownOMLIT

VarDecl

WFJudgement

XMLNode

info.kwarc.mmt.api.objects

Inhabited

case class Inhabited(stack: Stack, tp: Term) extends UnaryObjJudgement with Product with Serializable

A term tp is inhabited if it occurs on the right side of a Typing judgement. Via Curry-Howard, such terms can be thought of as provable propositions. Therefore, this judgement is usually undecidable.

Source: Judgements.scala

Linear Supertypes

Serializable, Serializable, Product, Equals, UnaryObjJudgement, Judgement, HistoryEntry, HashEquality[Judgement], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

Inhabited
Serializable
Serializable
Product
Equals
UnaryObjJudgement
Judgement
HistoryEntry
HashEquality
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Instance Constructors

new Inhabited(stack: Stack, tp: Term)

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 clone(): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( ... ) @native()
def context: Context

Definition Classes
Judgement
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
lazy val freeVars: HashSet[LocalName]
returns
the set of names of the meta-variables occurring in this judgment Constraints must come with a Context binding all object variables occurring freely in any expressions; therefore, the remaining free variables are meta-variables

Definition Classes
UnaryObjJudgement → Judgement
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@native()
lazy val hash: Int
the hash code
the hash code

Definition Classes
HashEquality
def hasheq(that: HashEquality[Judgement]): Boolean
this hasheq that is the same as this == that, but fails immediately if false
this hasheq that is the same as this == that, but fails immediately if false

Definition Classes
HashEquality
def hashneq(that: HashEquality[Judgement]): Boolean
this hasheq that is the same as this == that, but fails immediately if false
this hasheq that is the same as this == that, but fails immediately if false

Definition Classes
HashEquality
def implies(that: Judgement): Boolean
true if that is guaranteed if this holds
true if that is guaranteed if this holds

Definition Classes
Judgement
def indentation(level: Int): String

Definition Classes
HistoryEntry
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
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()
def present(implicit cont: (Obj) ⇒ String): String
a toString method that may call a continuation on its objects
a toString method that may call a continuation on its objects

Definition Classes
Judgement → HistoryEntry
def presentAntecedent(implicit cont: (Obj) ⇒ String): String

Definition Classes
Judgement
def presentSucceedent(implicit cont: (Obj) ⇒ String): String

Definition Classes
UnaryObjJudgement → Judgement
def removeWrappers: HistoryEntry
this history entry but without any wrappers like for indentation
this history entry but without any wrappers like for indentation

Definition Classes
HistoryEntry
val stack: Stack

Definition Classes
Inhabited → Judgement
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val tp: Term
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()

Packages

Classes directly defined in the package

Subpackages

Data structures for the MMT language

The MMT main class and its internal state

User interfaces

Physical storage of the MMT language files

The central algorithms for processing MMT content

Other algorithms on the MMT data structures

General purpose utility functions

Inhabited

case class Inhabited(stack: Stack, tp: Term) extends UnaryObjJudgement with Product with Serializable

Instance Constructors

Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from UnaryObjJudgement

Inherited from Judgement

Inherited from HistoryEntry

Inherited from HashEquality[Judgement]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

Classes directly defined in the package

Subpackages

Data structures for the MMT language

The MMT main class and its internal state

User interfaces

Physical storage of the MMT language files

The central algorithms for processing MMT content

Other algorithms on the MMT data structures

General purpose utility functions

Inhabited 

case class Inhabited(stack: Stack, tp: Term) extends UnaryObjJudgement with Product with Serializable

Instance Constructors

Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from UnaryObjJudgement

Inherited from Judgement

Inherited from HistoryEntry

Inherited from HashEquality[Judgement]

Inherited from AnyRef

Inherited from Any

Ungrouped

Inhabited