package catala

You can search for identifiers within the package.

in-package search v0.2.0

Compiler and library for the literate programming language for tax code specification

Install

Dune Dependency

github.com Readme Edit opam file Versions (8)

Authors

Maintainers

C

contact@catala-lang.org

Sources

0.10.0.tar.gz

md5=5abd76e8c51a47670645e91b21b57fc5

sha512=9c6fbe50c0b5a60566e877eeddadca0a339e2ce35deb5c1beceb03bc40eb6af2d519313e71859d88645b53fad591d4fa5288c633b185c9d765603da0f5b7dd7b

doc/catala.shared_ast/Shared_ast/BoundList/index.html

Module `Shared_ast.BoundList`Source

Bound lists are non-empty linked lists where each element is a binder onto the next. They are useful for ordered program definitions, like nested let-ins.

let a = e1 in e2 is thus represented as Cons (e1, {a. Last e2}).

The following provides a few utility functions for their traversal and manipulation. In particular, map functions take care of unbinding, then properly rebinding the variables.

Sourcetype ('e, 'elt, 'last) t =

| Last of 'last
| Cons of 'elt * ('e, ('e, 'elt, 'last) t) Shared_ast__.Definitions.binder

Sourceval last : (_, _, 'a) t -> 'a

Sourceval iter : f:('e Var.t -> 'elt -> unit) -> ('e, 'elt, 'last) t -> 'last

Sourceval find : f:('elt -> 'a option) -> (_, 'elt, _) t -> 'a

Source

val fold_left : 
  f:('acc -> 'elt -> 'e Var.t -> 'acc) ->
  init:'acc ->
  ('e, 'elt, 'last) t ->
  'acc * 'last

Source

val fold_left2 : 
  f:('acc -> 'elt1 -> 'elt2 -> 'e Var.t -> 'acc) ->
  init:'acc ->
  ('e, 'elt1, 'last1) t ->
  ('e, 'elt2, 'last2) t ->
  'acc * ('last1 * 'last2)

Source

val fold_right : 
  f:('elt -> 'e Var.t -> 'acc -> 'acc) ->
  init:('last -> 'acc) ->
  ('e, 'elt, 'last) t ->
  'acc

Source

val fold_lr : 
  top:'dacc ->
  down:('e Var.t -> 'elt -> 'dacc -> 'dacc) ->
  bottom:('last -> 'dacc -> 'uacc) ->
  up:('e Var.t -> 'elt -> 'uacc -> 'uacc) ->
  ('e, 'elt, 'last) t ->
  'uacc

Bi-directional fold: down accumulates downwards, starting from top; upon reaching last, bottom is called; then up accumulates on the way back up

Source

val map : 
  f:('e1 Var.t -> 'elt1 -> 'e2 Var.t * 'elt2 Bindlib.box) ->
  last:('last1 -> 'last2 Bindlib.box) ->
  ('e1, 'elt1, 'last1) t ->
  ('e2, 'elt2, 'last2) t Bindlib.box

Source

val fold_map : 
  f:('ctx -> 'e1 Var.t -> 'elt1 -> 'ctx * 'e2 Var.t * 'elt2 Bindlib.box) ->
  last:('ctx -> 'last1 -> 'ret * 'last2 Bindlib.box) ->
  init:'ctx ->
  ('e1, 'elt1, 'last1) t ->
  'ret * ('e2, 'elt2, 'last2) t Bindlib.box

Source

val equal : 
  f:('elt -> 'elt -> bool) ->
  last:('last -> 'last -> bool) ->
  ('e, 'elt, 'last) t as 'l ->
  'l ->
  bool

Source

val compare : 
  f:('elt -> 'elt -> int) ->
  last:('last -> 'last -> int) ->
  ('e, 'elt, 'last) t as 'l ->
  'l ->
  int

package catala

Install

Dune Dependency

Authors

Maintainers

Sources

doc/catala.shared_ast/Shared_ast/BoundList/index.html

Module Shared_ast.BoundListSource

Module `Shared_ast.BoundList`Source