package catala

You can search for identifiers within the package.

in-package search v0.2.0

Low-level language for tax code specification

Install

md5=4c6f725ef4d21c5ff91f60d74b454ef7

sha512=98806e03daa6f33740b80a0f78a37320fb70ebea8cb927ea8fed022673459189c32e2389ccba0fa25d93f754b0fa0128a5ee28e1bb9abefa330deb4be8cc7d95

Graph representation of the dependencies between scopes in the Catala program. Vertices are functions, x -> y if x is used in the definition of y.

Sourcemodule Pos = Utils.Pos

Sourcemodule Errors = Utils.Errors

Sourcemodule SVertex : sig ... end

Sourcemodule SEdge : sig ... end

On the edges, the label is the expression responsible for the use of the function

Sourcemodule SDependencies : sig ... end

Sourcemodule STopologicalTraversal : sig ... end

Sourcemodule SSCC : sig ... end

Tarjan's stongly connected components algorithm, provided by OCamlGraph

Sourceval build_program_dep_graph : Ast.program -> SDependencies.t

Sourceval check_for_cycle_in_scope : SDependencies.t -> unit

Sourceval get_scope_ordering : SDependencies.t -> Ast.ScopeName.t list

Sourcemodule TVertex : sig ... end

Sourcemodule TVertexSet : sig ... end

Sourcemodule TEdge : sig ... end

On the edges, the label is the expression responsible for the use of the function

Sourcemodule TDependencies : sig ... end

Sourcemodule TTopologicalTraversal : sig ... end

Sourcemodule TSCC : sig ... end

Tarjan's stongly connected components algorithm, provided by OCamlGraph

Sourceval get_structs_or_enums_in_type : Ast.typ Pos.marked -> TVertexSet.t

Sourceval build_type_graph : Ast.struct_ctx -> Ast.enum_ctx -> TDependencies.t

Sourceval check_type_cycles : Ast.struct_ctx -> Ast.enum_ctx -> unit