package zelus

You can search for identifiers within the package.

in-package search v0.2.0

A synchronous language with ODEs

Install

dune-project

Dependency

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

Authors

Maintainers

M

Marc Pouzet <marc.pouzet@ens.fr>

Sources

2.2.tar.gz

md5=437ae922f1fda392efca3e37e8b8bb4c

sha512=d591cdbeedb8f3a7f568d6d4994de572093822cb354b112886326219174311715a71a35de57a4c2070eae349f65f0c8f3d6c2f6a5a79a8187bbffc687cd108a6

doc/zelus.zlcompilerlibs/Dependences/index.html

Module `Dependences`

type 'a collection =

| And of 'a collection list
| Before of 'a collection list
| Leaf of 'a

val read : Zelus.eq -> Zident.S.t * Zident.S.t

Read/writes of an equation.

val def : Zelus.eq -> Zident.S.t

val init : Zelus.eq -> bool

Initialization equations init x = e and

val nodep : Zelus.eq -> bool

val index : Zelus.eq -> int

val unsafe : Zelus.eq -> bool

val fresh : int -> Zelus.eq collection -> Zelus.eq collection * int

val name_to_index : 
  (Graph.S.t Zident.Env.t
   * Graph.S.t Zident.Env.t
   * (int * Zelus.eq * Zident.S.t * Zident.S.t * Zident.S.t) list) ->
  Zelus.eq collection ->
  Graph.S.t Zident.Env.t
  * Graph.S.t Zident.Env.t
  * (int * Zelus.eq * Zident.S.t * Zident.S.t * Zident.S.t) list

val make_read_write : 
  Graph.S.t Zident.Env.t ->
  Graph.S.t Zident.Env.t ->
  (Graph.E.key * 'a * Zident.S.t * Zident.S.t * Zident.S.t) list ->
  'a Graph.graph

val make_unsafes : 
  'a ->
  'b ->
  'c Graph.graph ->
  Zelus.eq collection ->
  'c Graph.graph

val make : Zelus.eq collection -> Zelus.eq Graph.graph

val print : Format.formatter -> Zelus.eq Graph.graph -> unit