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.scopelang/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 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177
(* 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. *) (** Abstract syntax tree of the scope language *) module Pos = Utils.Pos module Uid = Utils.Uid (** {1 Identifiers} *) module ScopeName : Uid.Id with type info = Uid.MarkedString.info = Uid.Make (Uid.MarkedString) () module ScopeNameSet : Set.S with type elt = ScopeName.t = Set.Make (ScopeName) module ScopeMap : Map.S with type key = ScopeName.t = Map.Make (ScopeName) module SubScopeName : Uid.Id with type info = Uid.MarkedString.info = Uid.Make (Uid.MarkedString) () module SubScopeNameSet : Set.S with type elt = SubScopeName.t = Set.Make (SubScopeName) module SubScopeMap : Map.S with type key = SubScopeName.t = Map.Make (SubScopeName) module ScopeVar : Uid.Id with type info = Uid.MarkedString.info = Uid.Make (Uid.MarkedString) () module ScopeVarSet : Set.S with type elt = ScopeVar.t = Set.Make (ScopeVar) module ScopeVarMap : Map.S with type key = ScopeVar.t = Map.Make (ScopeVar) module StructName : Uid.Id with type info = Uid.MarkedString.info = Uid.Make (Uid.MarkedString) () module StructMap : Map.S with type key = StructName.t = Map.Make (StructName) module StructFieldName : Uid.Id with type info = Uid.MarkedString.info = Uid.Make (Uid.MarkedString) () module StructFieldMap : Map.S with type key = StructFieldName.t = Map.Make (StructFieldName) module EnumName : Uid.Id with type info = Uid.MarkedString.info = Uid.Make (Uid.MarkedString) () module EnumMap : Map.S with type key = EnumName.t = Map.Make (EnumName) module EnumConstructor : Uid.Id with type info = Uid.MarkedString.info = Uid.Make (Uid.MarkedString) () module EnumConstructorMap : Map.S with type key = EnumConstructor.t = Map.Make (EnumConstructor) type location = | ScopeVar of ScopeVar.t Pos.marked | SubScopeVar of ScopeName.t * SubScopeName.t Pos.marked * ScopeVar.t Pos.marked module LocationSet : Set.S with type elt = location Pos.marked = Set.Make (struct type t = location Pos.marked let compare x y = match (Pos.unmark x, Pos.unmark y) with | ScopeVar (vx, _), ScopeVar (vy, _) -> ScopeVar.compare vx vy | SubScopeVar (_, (xsubindex, _), (xsubvar, _)), SubScopeVar (_, (ysubindex, _), (ysubvar, _)) -> let c = SubScopeName.compare xsubindex ysubindex in if c = 0 then ScopeVar.compare xsubvar ysubvar else c | ScopeVar _, SubScopeVar _ -> -1 | SubScopeVar _, ScopeVar _ -> 1 end) (** {1 Abstract syntax tree} *) type typ = | TLit of Dcalc.Ast.typ_lit | TStruct of StructName.t | TEnum of EnumName.t | TArrow of typ Pos.marked * typ Pos.marked (** The expressions use the {{:https://lepigre.fr/ocaml-bindlib/} Bindlib} library, based on higher-order abstract syntax*) type expr = | ELocation of location | EVar of expr Bindlib.var Pos.marked | EStruct of StructName.t * expr Pos.marked StructFieldMap.t | EStructAccess of expr Pos.marked * StructFieldName.t * StructName.t | EEnumInj of expr Pos.marked * EnumConstructor.t * EnumName.t | EMatch of expr Pos.marked * EnumName.t * expr Pos.marked EnumConstructorMap.t | ELit of Dcalc.Ast.lit | EAbs of Pos.t * (expr, expr Pos.marked) Bindlib.mbinder * typ Pos.marked list | EApp of expr Pos.marked * expr Pos.marked list | EOp of Dcalc.Ast.operator | EDefault of expr Pos.marked list * expr Pos.marked * expr Pos.marked | EIfThenElse of expr Pos.marked * expr Pos.marked * expr Pos.marked let rec locations_used (e : expr Pos.marked) : LocationSet.t = match Pos.unmark e with | ELocation l -> LocationSet.singleton (l, Pos.get_position e) | EVar _ | ELit _ | EOp _ -> LocationSet.empty | EAbs (_, binder, _) -> let _, body = Bindlib.unmbind binder in locations_used body | EStruct (_, es) -> StructFieldMap.fold (fun _ e' acc -> LocationSet.union acc (locations_used e')) es LocationSet.empty | EStructAccess (e1, _, _) -> locations_used e1 | EEnumInj (e1, _, _) -> locations_used e1 | EMatch (e1, _, es) -> EnumConstructorMap.fold (fun _ e' acc -> LocationSet.union acc (locations_used e')) es (locations_used e1) | EApp (e1, args) -> List.fold_left (fun acc arg -> LocationSet.union (locations_used arg) acc) (locations_used e1) args | EIfThenElse (e1, e2, e3) -> LocationSet.union (locations_used e1) (LocationSet.union (locations_used e2) (locations_used e3)) | EDefault (excepts, just, cons) -> List.fold_left (fun acc except -> LocationSet.union (locations_used except) acc) (LocationSet.union (locations_used just) (locations_used cons)) excepts type rule = | Definition of location Pos.marked * typ Pos.marked * expr Pos.marked | Assertion of expr Pos.marked | Call of ScopeName.t * SubScopeName.t type scope_decl = { scope_decl_name : ScopeName.t; scope_sig : typ Pos.marked ScopeVarMap.t; scope_decl_rules : rule list; } type struct_ctx = (StructFieldName.t * typ Pos.marked) list StructMap.t type enum_ctx = (EnumConstructor.t * typ Pos.marked) list EnumMap.t type program = { program_scopes : scope_decl ScopeMap.t; program_enums : enum_ctx; program_structs : struct_ctx; } (** {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 type vars = expr Bindlib.mvar let make_var ((x, pos) : Var.t Pos.marked) : expr Pos.marked Bindlib.box = Bindlib.box_apply (fun v -> (v, 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) module VarMap = Map.Make (Var)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>