2021-02-12 19:20:14 +03:00
|
|
|
(* This file is part of the Catala compiler, a specification language for tax
|
|
|
|
and social benefits computation rules. Copyright (C) 2020 Inria, contributor:
|
|
|
|
Nicolas Chataing <nicolas.chataing@ens.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 desugared representation *)
|
|
|
|
|
2022-11-21 12:46:17 +03:00
|
|
|
open Catala_utils
|
2022-08-12 23:42:39 +03:00
|
|
|
open Shared_ast
|
2021-02-12 19:20:14 +03:00
|
|
|
|
2024-03-28 19:05:12 +03:00
|
|
|
(** Inside a scope, a definition can refer to a variable (possibly an intermediate state thereof) or an input of a subscope. *)
|
2021-02-12 19:20:14 +03:00
|
|
|
module ScopeDef : sig
|
2024-03-28 19:05:12 +03:00
|
|
|
type kind =
|
|
|
|
| Var of StateName.t option
|
|
|
|
| SubScope of { name: ScopeName.t; var_within_origin_scope: ScopeVar.t }
|
|
|
|
|
2024-03-29 20:39:20 +03:00
|
|
|
val equal_kind : kind -> kind -> bool
|
|
|
|
val compare_kind : kind -> kind -> int
|
|
|
|
val format_kind : Format.formatter -> kind -> unit
|
|
|
|
val hash_kind : kind -> int
|
|
|
|
|
2024-03-28 19:05:12 +03:00
|
|
|
type t = ScopeVar.t Mark.pos * kind
|
2021-02-12 20:16:06 +03:00
|
|
|
|
2024-03-29 20:39:20 +03:00
|
|
|
val equal : t -> t -> bool
|
2021-02-12 19:20:14 +03:00
|
|
|
val compare : t -> t -> int
|
|
|
|
val get_position : t -> Pos.t
|
2023-07-12 12:48:46 +03:00
|
|
|
val format : Format.formatter -> t -> unit
|
2021-02-12 19:20:14 +03:00
|
|
|
val hash : t -> int
|
|
|
|
|
2023-04-18 11:31:44 +03:00
|
|
|
module Map : Map.S with type key = t
|
|
|
|
module Set : Set.S with type elt = t
|
|
|
|
end
|
2021-02-12 19:20:14 +03:00
|
|
|
|
2023-04-28 15:15:43 +03:00
|
|
|
module AssertionName : Uid.Id with type info = Uid.MarkedString.info
|
|
|
|
|
2021-02-12 19:20:14 +03:00
|
|
|
(** {1 AST} *)
|
|
|
|
|
2022-08-25 17:08:08 +03:00
|
|
|
(** {2 Expressions} *)
|
2022-02-28 19:19:06 +03:00
|
|
|
|
2023-05-17 17:15:00 +03:00
|
|
|
type expr = (desugared, untyped) gexpr
|
2022-08-25 17:31:32 +03:00
|
|
|
(** See {!type:Shared_ast.naked_gexpr} for the complete definition *)
|
2022-02-28 20:34:32 +03:00
|
|
|
|
2022-08-25 17:08:08 +03:00
|
|
|
type location = desugared glocation
|
2022-02-28 20:34:32 +03:00
|
|
|
|
2023-05-17 16:44:57 +03:00
|
|
|
module LocationSet : Set.S with type elt = location Mark.pos
|
2022-08-25 17:35:08 +03:00
|
|
|
module ExprMap : Map.S with type key = expr
|
2022-02-28 20:34:32 +03:00
|
|
|
|
|
|
|
(** {2 Rules and scopes}*)
|
|
|
|
|
2022-07-13 16:00:57 +03:00
|
|
|
type exception_situation =
|
|
|
|
| BaseCase
|
2023-05-17 16:44:57 +03:00
|
|
|
| ExceptionToLabel of LabelName.t Mark.pos
|
|
|
|
| ExceptionToRule of RuleName.t Mark.pos
|
2022-07-13 16:00:57 +03:00
|
|
|
|
2023-05-17 16:44:57 +03:00
|
|
|
type label_situation = ExplicitlyLabeled of LabelName.t Mark.pos | Unlabeled
|
2022-07-13 16:00:57 +03:00
|
|
|
|
2021-02-11 20:48:59 +03:00
|
|
|
type rule = {
|
2022-01-04 20:19:15 +03:00
|
|
|
rule_id : RuleName.t;
|
Swap boxing and annotations in expressions
This was the only reasonable solution I found to the issue raised
[here](https://github.com/CatalaLang/catala/pull/334#discussion_r987175884).
This was a pretty tedious rewrite, but it should now ensure we are doing things
correctly. As a bonus, the "smart" expression constructors are now used
everywhere to build expressions (so another refactoring like this one should be
much easier) and this makes the code overall feel more
straightforward (`Bindlib.box_apply` or `let+` no longer need to be visible!)
---
Basically, we were using values of type `gexpr box = naked_gexpr marked box`
throughout when (re-)building expressions. This was done 99% of the time by
using `Bindlib.box_apply add_mark naked_e` right after building `naked_e`. In
lots of places, we needed to recover the annotation of this expression later on,
typically to build its parent term (to inherit the position, or build the type).
Since it wasn't always possible to wrap these uses within `box_apply` (esp. as
bindlib boxes aren't a monad), here and there we had to call `Bindlib.unbox`,
just to recover the position or type. This had the very unpleasant effect of
forcing the resolution of the whole box (including applying any stored closures)
to reach the top-level annotation which isn't even dependant on specific
variable bindings. Then, generally, throwing away the result.
Therefore, the change proposed here transforms
- `naked_gexpr marked Bindlib.box` into
- `naked_gexpr Bindlib.box marked` (aliased to `boxed_gexpr` or `gexpr boxed` for
convenience)
This means only
1. not fitting the mark into the box right away when building, and
2. accessing the top-level mark directly without unboxing
The functions for building terms from module `Shared_ast.Expr` could be changed
easily. But then they needed to be consistently used throughout, without
manually building terms through `Bindlib.apply_box` -- which covers most of the
changes in this patch.
`Expr.Box.inj` is provided to swap back to a box, before binding for example.
Additionally, this gives a 40% speedup on `make -C examples pass_all_tests`,
which hints at the amount of unnecessary work we were doing --'
2022-10-06 20:13:45 +03:00
|
|
|
rule_just : expr boxed;
|
|
|
|
rule_cons : expr boxed;
|
2023-05-17 16:44:57 +03:00
|
|
|
rule_parameter : (expr Var.t Mark.pos * typ) list Mark.pos option;
|
2022-07-13 16:00:57 +03:00
|
|
|
rule_exception : exception_situation;
|
|
|
|
rule_label : label_situation;
|
2021-02-11 20:48:59 +03:00
|
|
|
}
|
2021-02-12 19:20:14 +03:00
|
|
|
|
2022-05-25 15:41:04 +03:00
|
|
|
module Rule : Set.OrderedType with type t = rule
|
|
|
|
|
2023-02-28 16:40:05 +03:00
|
|
|
val empty_rule :
|
2023-05-17 16:44:57 +03:00
|
|
|
Pos.t -> (Uid.MarkedString.info * typ) list Mark.pos option -> rule
|
2023-02-27 11:50:42 +03:00
|
|
|
|
|
|
|
val always_false_rule :
|
2023-05-17 16:44:57 +03:00
|
|
|
Pos.t -> (Uid.MarkedString.info * typ) list Mark.pos option -> rule
|
2021-02-12 19:20:14 +03:00
|
|
|
|
Swap boxing and annotations in expressions
This was the only reasonable solution I found to the issue raised
[here](https://github.com/CatalaLang/catala/pull/334#discussion_r987175884).
This was a pretty tedious rewrite, but it should now ensure we are doing things
correctly. As a bonus, the "smart" expression constructors are now used
everywhere to build expressions (so another refactoring like this one should be
much easier) and this makes the code overall feel more
straightforward (`Bindlib.box_apply` or `let+` no longer need to be visible!)
---
Basically, we were using values of type `gexpr box = naked_gexpr marked box`
throughout when (re-)building expressions. This was done 99% of the time by
using `Bindlib.box_apply add_mark naked_e` right after building `naked_e`. In
lots of places, we needed to recover the annotation of this expression later on,
typically to build its parent term (to inherit the position, or build the type).
Since it wasn't always possible to wrap these uses within `box_apply` (esp. as
bindlib boxes aren't a monad), here and there we had to call `Bindlib.unbox`,
just to recover the position or type. This had the very unpleasant effect of
forcing the resolution of the whole box (including applying any stored closures)
to reach the top-level annotation which isn't even dependant on specific
variable bindings. Then, generally, throwing away the result.
Therefore, the change proposed here transforms
- `naked_gexpr marked Bindlib.box` into
- `naked_gexpr Bindlib.box marked` (aliased to `boxed_gexpr` or `gexpr boxed` for
convenience)
This means only
1. not fitting the mark into the box right away when building, and
2. accessing the top-level mark directly without unboxing
The functions for building terms from module `Shared_ast.Expr` could be changed
easily. But then they needed to be consistently used throughout, without
manually building terms through `Bindlib.apply_box` -- which covers most of the
changes in this patch.
`Expr.Box.inj` is provided to swap back to a box, before binding for example.
Additionally, this gives a 40% speedup on `make -C examples pass_all_tests`,
which hints at the amount of unnecessary work we were doing --'
2022-10-06 20:13:45 +03:00
|
|
|
type assertion = expr boxed
|
2021-02-11 20:48:59 +03:00
|
|
|
type variation_typ = Increasing | Decreasing
|
|
|
|
type reference_typ = Decree | Law
|
2023-01-20 20:18:53 +03:00
|
|
|
type catala_option = DateRounding of variation_typ
|
2021-02-12 19:20:14 +03:00
|
|
|
|
2021-02-11 20:48:59 +03:00
|
|
|
type meta_assertion =
|
2023-05-17 16:44:57 +03:00
|
|
|
| FixedBy of reference_typ Mark.pos
|
|
|
|
| VariesWith of unit * variation_typ Mark.pos option
|
2021-02-12 19:20:14 +03:00
|
|
|
|
2022-11-07 15:50:28 +03:00
|
|
|
type io = {
|
2023-05-17 16:44:57 +03:00
|
|
|
io_output : bool Mark.pos;
|
2022-11-07 15:50:28 +03:00
|
|
|
(** [true] is present in the output of the scope. *)
|
2023-05-26 17:54:52 +03:00
|
|
|
io_input : Runtime.io_input Mark.pos;
|
2022-11-07 15:50:28 +03:00
|
|
|
}
|
|
|
|
(** Characterization of the input/output status of a scope variable. *)
|
|
|
|
|
2022-01-04 20:19:15 +03:00
|
|
|
type scope_def = {
|
2022-11-21 12:12:45 +03:00
|
|
|
scope_def_rules : rule RuleName.Map.t;
|
2023-12-01 01:53:38 +03:00
|
|
|
(** empty outside of the root module *)
|
2022-08-25 18:29:00 +03:00
|
|
|
scope_def_typ : typ;
|
2023-02-28 16:40:05 +03:00
|
|
|
scope_def_parameters :
|
2023-05-17 16:44:57 +03:00
|
|
|
(Uid.MarkedString.info * Shared_ast.typ) list Mark.pos option;
|
2022-01-04 20:19:15 +03:00
|
|
|
scope_def_is_condition : bool;
|
2022-11-07 15:50:28 +03:00
|
|
|
scope_def_io : io;
|
2022-01-04 20:19:15 +03:00
|
|
|
}
|
|
|
|
|
2022-02-28 19:19:06 +03:00
|
|
|
type var_or_states = WholeVar | States of StateName.t list
|
|
|
|
|
2021-02-11 20:48:59 +03:00
|
|
|
type scope = {
|
2022-11-21 12:12:45 +03:00
|
|
|
scope_vars : var_or_states ScopeVar.Map.t;
|
2024-03-21 18:59:12 +03:00
|
|
|
scope_sub_scopes : ScopeName.t ScopeVar.Map.t;
|
2022-08-12 23:42:39 +03:00
|
|
|
scope_uid : ScopeName.t;
|
2023-04-18 11:31:44 +03:00
|
|
|
scope_defs : scope_def ScopeDef.Map.t;
|
2023-04-28 15:15:43 +03:00
|
|
|
scope_assertions : assertion AssertionName.Map.t;
|
2023-12-01 01:53:38 +03:00
|
|
|
(** empty outside of the root module *)
|
2023-05-17 16:44:57 +03:00
|
|
|
scope_options : catala_option Mark.pos list;
|
2021-02-11 20:48:59 +03:00
|
|
|
scope_meta_assertions : meta_assertion list;
|
|
|
|
}
|
2021-02-12 19:20:14 +03:00
|
|
|
|
2023-11-20 18:01:06 +03:00
|
|
|
type modul = {
|
|
|
|
module_scopes : scope ScopeName.Map.t;
|
|
|
|
module_topdefs : (expr option * typ) TopdefName.Map.t;
|
2023-12-01 01:53:38 +03:00
|
|
|
(** the expr is [None] outside of the root module *)
|
2023-11-20 18:01:06 +03:00
|
|
|
}
|
|
|
|
|
2022-11-21 12:12:45 +03:00
|
|
|
type program = {
|
2023-11-20 18:01:06 +03:00
|
|
|
program_module_name : Ident.t Mark.pos option;
|
2022-11-21 12:12:45 +03:00
|
|
|
program_ctx : decl_ctx;
|
2023-12-01 01:53:38 +03:00
|
|
|
program_modules : modul ModuleName.Map.t;
|
|
|
|
(** Contains all submodules of the program, in a flattened structure *)
|
2023-11-20 18:01:06 +03:00
|
|
|
program_root : modul;
|
2024-03-15 16:23:30 +03:00
|
|
|
program_lang : Global.backend_lang;
|
2022-11-21 12:12:45 +03:00
|
|
|
}
|
2021-02-12 19:20:14 +03:00
|
|
|
|
|
|
|
(** {1 Helpers} *)
|
|
|
|
|
2022-08-25 18:29:00 +03:00
|
|
|
val locations_used : expr -> LocationSet.t
|
2023-04-18 11:31:44 +03:00
|
|
|
val free_variables : rule RuleName.Map.t -> Pos.t ScopeDef.Map.t
|
2023-03-30 19:52:29 +03:00
|
|
|
|
|
|
|
val fold_exprs : f:('a -> expr -> 'a) -> init:'a -> program -> 'a
|
|
|
|
(** Usage: [fold_exprs ~f ~init program] applies ~f to all the expressions
|
|
|
|
inside rules (justifications and consequences), expressions and top-level
|
|
|
|
definitions of the program. Note that there may be free variables in these
|
|
|
|
expressions. *)
|