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.1.tar.gz

sha256=cb0f7bacc33a4bb425683e2def67359fcf6d402545a32f7f953c4822a9a01862

md5=83fb886e4b14ce286e7a6eb59248be4b

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 -> Ident.S.t * Ident.S.t

Read/writes of an equation.

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

val init : Zelus.eq -> bool

Initialization equations init x = e and reset init x = e... every ...]

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 Ident.Env.t
   * Graph.S.t Ident.Env.t
   * (int * Zelus.eq * Ident.S.t * Ident.S.t * Ident.S.t) list) ->
  Zelus.eq collection ->
  Graph.S.t Ident.Env.t
  * Graph.S.t Ident.Env.t
  * (int * Zelus.eq * Ident.S.t * Ident.S.t * Ident.S.t) list

val make_read_write : 
  Graph.S.t Ident.Env.t ->
  Graph.S.t Ident.Env.t ->
  (Graph.E.key * 'a * Ident.S.t * Ident.S.t * Ident.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