catala 0.2.0 · OCaml Package

module Pos = Utils.Pos

module Uid = Utils.Uid

Abstract syntax tree for the default calculus

Abstract syntax tree

type typ_lit =

type typ =

type date = ODate.Unix.t

type duration = Z.t

type lit =

type op_kind =

type binop =

type log_entry =

type unop =

type operator =

type expr =

| EVar of expr Bindlib.var Pos.marked
| ETuple of (expr Pos.marked * Uid.MarkedString.info option) list
(*
The MarkedString.info is the former struct field name
*)
| ETupleAccess of expr Pos.marked * int * Uid.MarkedString.info option
(*
The MarkedString.info is the former struct field name
*)
| EInj of expr Pos.marked * int * Uid.MarkedString.info * typ Pos.marked list
(*
The MarkedString.info is the former enum case name
*)
| EMatch of expr Pos.marked * (expr Pos.marked * Uid.MarkedString.info) list
(*
The MarkedString.info is the former enum case name
*)
| ELit of lit
| EAbs of Pos.t * (expr, expr Pos.marked) Bindlib.mbinder * typ Pos.marked list
| EApp of expr Pos.marked * expr Pos.marked list
| EAssert of expr Pos.marked
| EOp of operator
| EDefault of expr Pos.marked list * expr Pos.marked * expr Pos.marked
| EIfThenElse of expr Pos.marked * expr Pos.marked * expr Pos.marked

The expressions use the Bindlib library, based on higher-order abstract syntax

module Var : sig ... end

module VarMap : sig ... end

type vars = expr Bindlib.mvar

val make_var : Var.t Pos.marked -> expr Pos.marked Bindlib.box

val make_abs : 
  vars ->
  expr Pos.marked Bindlib.box ->
  Pos.t ->
  typ Pos.marked list ->
  Pos.t ->
  expr Pos.marked Bindlib.box

val make_app : 
  expr Pos.marked Bindlib.box ->
  expr Pos.marked Bindlib.box list ->
  Pos.t ->
  expr Pos.marked Bindlib.box

val make_let_in : 
  Var.t ->
  typ Pos.marked ->
  expr Pos.marked Bindlib.box ->
  expr Pos.marked Bindlib.box ->
  expr Pos.marked Bindlib.box

type binder = (expr, expr Pos.marked) Bindlib.binder