inhabitation

Type Members

1. final case class Apply(target: Type, functionType: Type, argumentType: Type) extends Rule with Product with Serializable

   

   Represents the application of a term of type functionType to a term of type argumentType to obtain type target.

2. class BoundedCombinatoryLogic extends AnyRef

   

   Type inhabitation for bounded combinatory logic (BCL).

3. final case class Combinator(target: Type, combinator: String) extends Rule with Product with Serializable

   

   Represents types inhabited by a combinator without arguments.

4. final case class Failed(target: Type) extends Rule with Product with Serializable

   

   Represents uninhabited types.

5. class FiniteCombinatoryLogic extends LazyLogging

   

   Type inhabitation for finite combinatory logic (FCL)

6. type InhabitationAlgorithm = (FiniteSubstitutionSpace, SubtypeEnvironment, Repository) ⇒ (Seq[Type]) ⇒ Set[Rule]

   

   For a finitite substitution space, a subtype environment and a repository Gamma, an inhabitation algorithm takes a sequence of types and returns a set of rules for 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 set of rules for 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).

7. type Repository = Map[String, Type]

   

   Repositories map combinator names to types.

8. sealed trait Rule extends AnyRef

   

   Rules describe how to form inhabitants from combinators.

9. case class Tree(name: String, target: Type, 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.

10. trait TreeGrammarEnumeration extends AnyRef

    

    Enumeration of all combinator expressions derivable from a tree grammar.

    Enumeration of all combinator expressions derivable from a tree grammar. Use TreeGrammarEnumeration.apply to obtain an enumeration for any given tree grammar.