Type Members

1.  class BoundedCombinatoryLogic extends AnyRef

   Type inhabitation for bounded combinatory logic (BCL).

2.  class FiniteCombinatoryLogic extends AnyRef

   Type inhabitation for finite combinatory logic (FCL)

3.  type InhabitationAlgorithm = (FiniteSubstitutionSpace, SubtypeEnvironment, Repository) ⇒ (Seq[Type]) ⇒ TreeGrammar

   For a finitite substitution space, a subtype environment and a repository Gamma, an inhabitation algorithm takes a sequence of types and returns a tree grammar, describing all inhabitants of these types.

   For a finitite substitution space, a subtype environment and a repository Gamma, an inhabitation algorithm takes a sequence of types and returns a tree grammar, describing all inhabitants of these types. We have for all i ≤ k: Gamma |- M : tau_i iff M is a word of the language of the grammar returned by the algorithm applied to Seq(tau_1, tau_2, ..., tau_k).

4.  type Repository = Map[String, Type]

   Repositories map combinator names to types

5.  case class Tree(name: String, arguments: Tree*) extends Product with Serializable

   A combinator expression.

   A combinator expression.

   name

   the name of the combinator in head position.

   arguments

   arguments of the combinator.

6.  type TreeGrammar = Map[Type, Set[(String, Seq[Type])]]

   Tree Grammars map types to sets of combinators and recursive targets, such that the combinator, when applied to arguments of the recursive target types, returns a value of the type on the left hand side

7.  trait TreeGrammarEnumeration extends AnyRef

   Enumeration of all combinatory expressions derivable from a TreeGrammar.

   Enumeration of all combinatory expressions derivable from a TreeGrammar. Use TreeGrammarEnumeration.apply to obtain an enumeration for any given TreeGrammar.