package zelus

  1. Overview
  2. Docs
A synchronous language with ODEs

Install 

dune-project
 Dependency

zelus.di.ens.fr Readme Edit opam file Versions (2)

Authors

  1. T
    Timothy Bourke <timothy.bourke@inria.fr>
  2. M
    Marc Pouzet <marc.pouzet@ens.fr>

Maintainers

  1. M
    Marc Pouzet <marc.pouzet@ens.fr>

Sources

2.1.tar.gz
sha256=cb0f7bacc33a4bb425683e2def67359fcf6d402545a32f7f953c4822a9a01862
md5=83fb886e4b14ce286e7a6eb59248be4b

doc/zelus.zlcompilerlibs/Types/index.html

Module Types

val make : 'a -> 'a Deftypes.loc
val funtype_list : Deftypes.kind -> (Ident.t option * Deftypes.typ) list -> Deftypes.typ -> Deftypes.typ

Make size expressions. Apply simple simplification rules

val const : int -> Deftypes.size
val name : Ident.t -> Deftypes.size
val new_discrete_var : unit -> Deftypes.typ_desc Deftypes.loc
val new_var : unit -> Deftypes.typ_desc Deftypes.loc
val new_generic_var : unit -> Deftypes.typ_desc Deftypes.loc
val new_var_list : int -> Deftypes.typ_desc Deftypes.loc list

Set of free size variables in a type

val fv_size : Ident.S.t -> Deftypes.size -> Ident.S.t
val remove_dependences : Deftypes.typ -> Deftypes.typ

Remove dependences from a type

exception Unify
val less_than : Deftypes.kind -> Deftypes.kind -> unit
val kind : 'a -> Deftypes.typ -> unit
val fully_applied : Deftypes.typ -> bool

context. bool otherwise.

val on_type : Deftypes.kind -> Deftypes.kind
val is_combinatorial_kind : Deftypes.kind -> bool
val is_discrete_kind : Deftypes.kind -> bool
val is_continuous_kind : Deftypes.kind -> bool
val is_statefull_kind : Deftypes.kind -> bool
val lift_to_discrete : Deftypes.kind -> Deftypes.kind

Make a discrete sort.

val typ_repr : Deftypes.typ -> Deftypes.typ
val occur_check : int -> Deftypes.typ -> Deftypes.typ -> unit
val list_of_typ_vars : Deftypes.typ list ref
val gen_ty : bool -> Deftypes.typ -> int
val gen : bool -> Deftypes.typ -> Deftypes.typ_scheme
val s : Deftypes.typ list ref
val save : Deftypes.typ -> unit
val cleanup : unit -> unit
val size_of : Deftypes.typ -> Deftypes.size list

Compute the size of an array type t.

val instance_of_type : Deftypes.typ_scheme -> Deftypes.typ
val instance_and_vars_of_type : Deftypes.typ_scheme -> Deftypes.typ_instance * Deftypes.typ
val constr_instance : Global.constr_desc -> Global.constr_desc
val label_instance : Global.label_desc -> Global.label_desc
val same_types : 'a -> 'a -> bool
val unify : Deftypes.typ -> Deftypes.typ -> unit
val equal_sizes : Deftypes.size -> Deftypes.size -> unit
val filter_product : int -> Deftypes.typ -> Deftypes.typ list
val filter_actual_arrow : Deftypes.typ -> Deftypes.kind * Ident.t option * Deftypes.typ * Deftypes.typ
val split_arguments : Deftypes.typ -> 'a list -> 'a list * 'a list * Deftypes.typ
val type_of_combine : unit -> Deftypes.typ_desc Deftypes.loc

All the function below are pure. They do not modify the internal

representation of types. This is mandatory for them to be used once

static typing is performed

val is_a_signal : Deftypes.typ -> Deftypes.typ option

or nothing.

val is_combinatorial : int -> Deftypes.typ -> bool

Is-it a combinatorial function?

val res_type : int -> Deftypes.typ -> Deftypes.typ
val is_hybrid : int -> Deftypes.typ -> bool
val is_probabilistic : int -> Deftypes.typ -> bool
val is_a_node_name : Lident.t -> bool

Is-it a node ?

val is_a_function_name : Lident.t -> bool

Is-it a function?

val is_a_hybrid_node_name : Lident.t -> bool

Is-it a hybrid function?

val kind_of_funtype : Deftypes.typ -> Deftypes.kind
val kind_of_node_name : Lident.t -> Deftypes.kind
val noparameters : Deftypes.typ_scheme -> bool
val nopolymorphism : Deftypes.typ_scheme -> bool