Alba compiler
type t
val context : t -> Gamma.t

The current context with holes.

val base_context : t -> Gamma.t

The initial context without holes.

val count : t -> int

The size of the context.

val count_base : t -> int

The size of the base context.

val count_bounds : t -> int

The number of bound variables which have been entered.

val count_entries : t -> int

The number of holes and bound variables which have been entered.

val is_valid_index : int -> t -> bool
val name_of_index : int -> t -> string
val index_of_level : int -> t -> int
val adapted_level : int -> t -> int
val definition_term : int -> t -> Term.t option
val is_hole : int -> t -> bool

Is the variable a hole?

val is_bound : int -> t -> bool

Is the variable a bound variable?

val bound_number : int -> t -> int

bound_number idx gh

Return the number of the bound variable at idx.


is_bound idx gh
val variable_of_bound : int -> t -> Term.t

variable_of_bound i gh

Compute the variable corresponding to the ith bound variable.


i < count_bounds gh
val has_value : int -> t -> bool

Has the variable a value i.e. is it a hole with value.

val value : int -> t -> Term.t option

The optional value of the hole.

val unfilled_holes : int -> Term.t -> t -> Fmlib.Common.Int_set.t

unfilled_holes cnt0 term gh

List of unfilled holes in term starting at level cnt0.

The returned list contains the De Bruijn levels of the unfilled holes.


cnt0 <= count gh
val expand : Term.t -> t -> Term.t

expand term gh Replace all holes in term with its values, if available.

val is_expanded : Term.t -> t -> bool

is_expanded term gh Is the term term expanded i.e. does it not contain any filled holes?

val term_of_term_n : Term.t_n -> t -> Term.t

term_of_term_n tn gh

Lift the term tn into the context and expand it.

val fill_hole0 : int -> Term.t -> bool -> t -> t

fill_hole0 idx value beta_reduce gh

Fill the hole at idx with value. In case that value is a function abstraction appearing in a function position and the flag beta_reduce is set, do a beta reduction.


is_unfilled idx gh
val fill_hole : int -> Term.t -> t -> t

fill_hole idx value gh Fill the hole at idx with value.


is_unfilled idx gh
val fold_entries : ( int -> int -> string -> Term.typ -> bool -> Term.t option -> 'a -> 'a ) -> t -> 'a -> 'a

fold_entries f gh a fold all entries with the folding function f.

f is called with the following arguments:

f level idx name typ is_hole value_opt a

val push_named_hole : string -> Term.typ -> t -> t

push_hole name typ gh Add a hole with name name of type typ to gh.

val push_hole : Term.typ -> t -> t

push_hole typ gh Add a hole of type typ to gh.

val push_bound : string -> bool -> Term.typ -> t -> t

push_bound name is_typed gh adds a bound variable to the context. The bound variable can be later used to construct binders like Pi (arg_tp, res_tp, info or Lambda (arg_tp, exp, info. is_typed is used to construct the binder.

val remove_bounds : int -> t -> t

remove_bounds n gh

Remove the n last bound variables.

val pop_bound : t -> t

pop_bound gh is equivalent to remove_bounds 1 gh

val push_local : string -> Term.typ -> t -> t

push_local name typ gh is synonym for push_bound name true gh

val name_at_level : int -> t -> string
val type_at_level : int -> t -> Term.typ
val type_of_variable : int -> t -> Term.typ

type_of_variable idx gh

Return the expanded type of the variable idx.

val type_of_literal : Value.t -> t -> Term.typ
val pi : int -> Term.typ -> t -> Term.typ

pi nbounds result_tp gh

Compute a product type with result_tp using the last nbounds bound variables.

all (a: A) (b: B) ... : RT


nbounds <=  count_bounds gh
val lambda : int -> Term.t -> t -> Term.t

lambda nbounds exp gh

Compute a function term with the inner expression exp using the last nbounds bound variables.

\ (a: A) (b: B) ... := exp


nbounds <= count_bounds gh
val make : Gamma.t -> t