package catala
Compiler and library for the literate programming language for tax code specification
Install
Dune Dependency
Authors
Maintainers
Sources
0.6.0.tar.gz
md5=b22e238d5d5c8452067109e9c7c0f427
sha512=ccc8c557c67c2f9d1bed4b957b2367f0f6afc0ef9b8b83237cf2a2912b3e8829b7e8af78ea7fe00b20ecf28b436ad04b591e5fff4f82fd08725d40a18c9924d0
doc/src/catala.lcalc/compile_with_exceptions.ml.html
Source file compile_with_exceptions.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
(* 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. *) open Utils module D = Dcalc.Ast module A = Ast type ctx = A.expr Pos.marked Bindlib.box D.VarMap.t (** This environment contains a mapping between the variables in Dcalc and their correspondance in Lcalc. *) let translate_lit (l : D.lit) : A.expr = match l with | D.LBool l -> A.ELit (A.LBool l) | D.LInt i -> A.ELit (A.LInt i) | D.LRat r -> A.ELit (A.LRat r) | D.LMoney m -> A.ELit (A.LMoney m) | D.LUnit -> A.ELit A.LUnit | D.LDate d -> A.ELit (A.LDate d) | D.LDuration d -> A.ELit (A.LDuration d) | D.LEmptyError -> A.ERaise A.EmptyError let thunk_expr (e : A.expr Pos.marked Bindlib.box) (pos : Pos.t) : A.expr Pos.marked Bindlib.box = let dummy_var = A.Var.make ("_", pos) in A.make_abs [| dummy_var |] e pos [ (D.TAny, pos) ] pos let rec translate_default (ctx : ctx) (exceptions : D.expr Pos.marked list) (just : D.expr Pos.marked) (cons : D.expr Pos.marked) (pos_default : Pos.t) : A.expr Pos.marked Bindlib.box = let exceptions = List.map (fun except -> thunk_expr (translate_expr ctx except) pos_default) exceptions in let exceptions = A.make_app (A.make_var (A.handle_default, pos_default)) [ Bindlib.box_apply (fun exceptions -> (A.EArray exceptions, pos_default)) (Bindlib.box_list exceptions); thunk_expr (translate_expr ctx just) pos_default; thunk_expr (translate_expr ctx cons) pos_default; ] pos_default in exceptions and translate_expr (ctx : ctx) (e : D.expr Pos.marked) : A.expr Pos.marked Bindlib.box = match Pos.unmark e with | D.EVar v -> D.VarMap.find (Pos.unmark v) ctx | D.ETuple (args, s) -> Bindlib.box_apply (fun args -> Pos.same_pos_as (A.ETuple (args, s)) e) (Bindlib.box_list (List.map (translate_expr ctx) args)) | D.ETupleAccess (e1, i, s, ts) -> Bindlib.box_apply (fun e1 -> Pos.same_pos_as (A.ETupleAccess (e1, i, s, ts)) e) (translate_expr ctx e1) | D.EInj (e1, i, en, ts) -> Bindlib.box_apply (fun e1 -> Pos.same_pos_as (A.EInj (e1, i, en, ts)) e) (translate_expr ctx e1) | D.EMatch (e1, cases, en) -> Bindlib.box_apply2 (fun e1 cases -> Pos.same_pos_as (A.EMatch (e1, cases, en)) e) (translate_expr ctx e1) (Bindlib.box_list (List.map (translate_expr ctx) cases)) | D.EArray es -> Bindlib.box_apply (fun es -> Pos.same_pos_as (A.EArray es) e) (Bindlib.box_list (List.map (translate_expr ctx) es)) | D.ELit l -> Bindlib.box (Pos.same_pos_as (translate_lit l) e) | D.EOp op -> Bindlib.box (Pos.same_pos_as (A.EOp op) e) | D.EIfThenElse (e1, e2, e3) -> Bindlib.box_apply3 (fun e1 e2 e3 -> Pos.same_pos_as (A.EIfThenElse (e1, e2, e3)) e) (translate_expr ctx e1) (translate_expr ctx e2) (translate_expr ctx e3) | D.EAssert e1 -> Bindlib.box_apply (fun e1 -> Pos.same_pos_as (A.EAssert e1) e) (translate_expr ctx e1) | D.ErrorOnEmpty arg -> Bindlib.box_apply (fun arg -> Pos.same_pos_as (A.ECatch (arg, A.EmptyError, Pos.same_pos_as (A.ERaise A.NoValueProvided) e)) e) (translate_expr ctx arg) | D.EApp (e1, args) -> Bindlib.box_apply2 (fun e1 args -> Pos.same_pos_as (A.EApp (e1, args)) e) (translate_expr ctx e1) (Bindlib.box_list (List.map (translate_expr ctx) args)) | D.EAbs ((binder, pos_binder), ts) -> let vars, body = Bindlib.unmbind binder in let ctx, lc_vars = Array.fold_right (fun var (ctx, lc_vars) -> let lc_var = A.Var.make (Bindlib.name_of var, pos_binder) in let lc_var_expr = A.make_var (lc_var, pos_binder) in (D.VarMap.add var lc_var_expr ctx, lc_var :: lc_vars)) vars (ctx, []) in let lc_vars = Array.of_list lc_vars in let new_body = translate_expr ctx body in let new_binder = Bindlib.bind_mvar lc_vars new_body in Bindlib.box_apply (fun new_binder -> Pos.same_pos_as (A.EAbs ((new_binder, pos_binder), ts)) e) new_binder | D.EDefault ([ exn ], just, cons) when !Cli.optimize_flag -> Bindlib.box_apply3 (fun exn just cons -> Pos.same_pos_as (A.ECatch ( exn, A.EmptyError, Pos.same_pos_as (A.EIfThenElse (just, cons, Pos.same_pos_as (A.ERaise A.EmptyError) e)) e )) e) (translate_expr ctx exn) (translate_expr ctx just) (translate_expr ctx cons) | D.EDefault (exceptions, just, cons) -> translate_default ctx exceptions just cons (Pos.get_position e) let translate_program (prgm : D.program) : A.program = { scopes = (let acc, _ = List.fold_left (fun ((acc, ctx) : _ * A.Var.t D.VarMap.t) (scope_name, n, e) -> let new_n = A.Var.make (Bindlib.name_of n, Pos.no_pos) in let new_acc = { Ast.scope_body_name = scope_name; scope_body_var = new_n; scope_body_expr = Bindlib.unbox (translate_expr (D.VarMap.map (fun v -> A.make_var (v, Pos.no_pos)) ctx) (Bindlib.unbox (D.build_whole_scope_expr prgm.decl_ctx e (Pos.get_position (Dcalc.Ast.ScopeName.get_info scope_name))))); } :: acc in let new_ctx = D.VarMap.add n new_n ctx in (new_acc, new_ctx)) ([], D.VarMap.empty) prgm.scopes in List.rev acc); decl_ctx = prgm.decl_ctx; }
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>