package catala
Low-level language for tax code specification
Install
Dune Dependency
Authors
Maintainers
Sources
0.2.0.tar.gz
md5=4c6f725ef4d21c5ff91f60d74b454ef7
sha512=98806e03daa6f33740b80a0f78a37320fb70ebea8cb927ea8fed022673459189c32e2389ccba0fa25d93f754b0fa0128a5ee28e1bb9abefa330deb4be8cc7d95
doc/src/catala.dcalc/ast.ml.html
Source file ast.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
(* This file is part of the Catala compiler, a specification language for tax and social benefits computation rules. Copyright (C) 2020 Inria, contributor: Denis Merigoux <denis.merigoux@inria.fr> Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. *) module Pos = Utils.Pos module Uid = Utils.Uid (** Abstract syntax tree for the default calculus *) (** {1 Abstract syntax tree} *) type typ_lit = TBool | TUnit | TInt | TRat | TMoney | TDate | TDuration type typ = | TLit of typ_lit | TTuple of typ Pos.marked list | TEnum of typ Pos.marked list | TArrow of typ Pos.marked * typ Pos.marked type date = ODate.Unix.t type duration = Z.t type lit = | LBool of bool | LEmptyError | LInt of Z.t | LRat of Q.t | LMoney of Z.t | LUnit | LDate of date | LDuration of duration type op_kind = | KInt | KRat | KMoney | KDate | KDuration (** All ops don't have a Kdate and KDuration *) type binop = | And | Or | Add of op_kind | Sub of op_kind | Mult of op_kind | Div of op_kind | Lt of op_kind | Lte of op_kind | Gt of op_kind | Gte of op_kind | Eq | Neq type log_entry = VarDef | BeginCall | EndCall type unop = | Not | Minus of op_kind | ErrorOnEmpty | Log of log_entry * Utils.Uid.MarkedString.info list type operator = Binop of binop | Unop of unop (** The expressions use the {{:https://lepigre.fr/ocaml-bindlib/} Bindlib} library, based on higher-order abstract syntax*) type expr = | EVar of expr Bindlib.var Pos.marked | ETuple of (expr Pos.marked * Uid.MarkedString.info option) list (** The [MarkedString.info] is the former struct field name*) | ETupleAccess of expr Pos.marked * int * Uid.MarkedString.info option (** The [MarkedString.info] is the former struct field name*) | EInj of expr Pos.marked * int * Uid.MarkedString.info * typ Pos.marked list (** The [MarkedString.info] is the former enum case name *) | EMatch of expr Pos.marked * (expr Pos.marked * Uid.MarkedString.info) list (** The [MarkedString.info] is the former enum case name *) | ELit of lit | EAbs of Pos.t * (expr, expr Pos.marked) Bindlib.mbinder * typ Pos.marked list | EApp of expr Pos.marked * expr Pos.marked list | EAssert of expr Pos.marked | EOp of operator | EDefault of expr Pos.marked list * expr Pos.marked * expr Pos.marked | EIfThenElse of expr Pos.marked * expr Pos.marked * expr Pos.marked (** {1 Variable helpers} *) module Var = struct type t = expr Bindlib.var let make (s : string Pos.marked) : t = Bindlib.new_var (fun (x : expr Bindlib.var) : expr -> EVar (x, Pos.get_position s)) (Pos.unmark s) let compare x y = Bindlib.compare_vars x y end module VarMap = Map.Make (Var) type vars = expr Bindlib.mvar let make_var ((x, pos) : Var.t Pos.marked) : expr Pos.marked Bindlib.box = Bindlib.box_apply (fun x -> (x, pos)) (Bindlib.box_var x) let make_abs (xs : vars) (e : expr Pos.marked Bindlib.box) (pos_binder : Pos.t) (taus : typ Pos.marked list) (pos : Pos.t) : expr Pos.marked Bindlib.box = Bindlib.box_apply (fun b -> (EAbs (pos_binder, b, taus), pos)) (Bindlib.bind_mvar xs e) let make_app (e : expr Pos.marked Bindlib.box) (u : expr Pos.marked Bindlib.box list) (pos : Pos.t) : expr Pos.marked Bindlib.box = Bindlib.box_apply2 (fun e u -> (EApp (e, u), pos)) e (Bindlib.box_list u) let make_let_in (x : Var.t) (tau : typ Pos.marked) (e1 : expr Pos.marked Bindlib.box) (e2 : expr Pos.marked Bindlib.box) : expr Pos.marked Bindlib.box = Bindlib.box_apply2 (fun e u -> (EApp (e, u), Pos.get_position (Bindlib.unbox e2))) (make_abs (Array.of_list [ x ]) e2 (Pos.get_position (Bindlib.unbox e2)) [ tau ] (Pos.get_position (Bindlib.unbox e2))) (Bindlib.box_list [ e1 ]) type binder = (expr, expr Pos.marked) Bindlib.binder
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>