2020-11-23 13:42:29 +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:
|
|
|
|
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. *)
|
|
|
|
|
2022-11-21 12:46:17 +03:00
|
|
|
open Catala_utils
|
2022-08-12 23:42:39 +03:00
|
|
|
open Shared_ast
|
2022-03-01 22:41:01 +03:00
|
|
|
|
2022-08-25 13:09:51 +03:00
|
|
|
type location = scopelang glocation
|
2020-11-23 18:12:45 +03:00
|
|
|
|
2023-05-17 16:44:57 +03:00
|
|
|
module LocationSet : Set.S with type elt = location Mark.pos = Set.Make (struct
|
|
|
|
type t = location Mark.pos
|
2020-12-03 23:02:28 +03:00
|
|
|
|
2022-08-25 17:08:08 +03:00
|
|
|
let compare = Expr.compare_location
|
2020-12-03 23:02:28 +03:00
|
|
|
end)
|
|
|
|
|
2022-09-23 18:43:48 +03:00
|
|
|
type 'm expr = (scopelang, 'm mark) gexpr
|
2022-06-03 17:40:03 +03:00
|
|
|
|
2022-09-23 18:43:48 +03:00
|
|
|
let rec locations_used (e : 'm expr) : LocationSet.t =
|
2022-10-10 16:15:36 +03:00
|
|
|
match e with
|
|
|
|
| ELocation l, pos -> LocationSet.singleton (l, Expr.mark_pos pos)
|
2022-11-17 19:13:35 +03:00
|
|
|
| EAbs { binder; _ }, _ ->
|
2020-11-25 13:53:56 +03:00
|
|
|
let _, body = Bindlib.unmbind binder in
|
|
|
|
locations_used body
|
2022-10-10 16:15:36 +03:00
|
|
|
| e ->
|
|
|
|
Expr.shallow_fold
|
|
|
|
(fun e -> LocationSet.union (locations_used e))
|
|
|
|
e LocationSet.empty
|
2020-11-25 13:53:56 +03:00
|
|
|
|
2022-09-23 18:43:48 +03:00
|
|
|
type 'm rule =
|
2023-05-17 16:44:57 +03:00
|
|
|
| Definition of location Mark.pos * typ * Desugared.Ast.io * 'm expr
|
2022-09-23 18:43:48 +03:00
|
|
|
| Assertion of 'm expr
|
2022-09-30 17:52:35 +03:00
|
|
|
| Call of ScopeName.t * SubScopeName.t * 'm mark
|
2020-12-14 19:00:42 +03:00
|
|
|
|
2022-09-23 18:43:48 +03:00
|
|
|
type 'm scope_decl = {
|
2020-12-14 19:00:42 +03:00
|
|
|
scope_decl_name : ScopeName.t;
|
2022-11-21 12:12:45 +03:00
|
|
|
scope_sig : (typ * Desugared.Ast.io) ScopeVar.Map.t;
|
2022-09-23 18:43:48 +03:00
|
|
|
scope_decl_rules : 'm rule list;
|
2022-09-30 17:40:10 +03:00
|
|
|
scope_mark : 'm mark;
|
2023-05-17 16:44:57 +03:00
|
|
|
scope_options : Desugared.Ast.catala_option Mark.pos list;
|
2020-12-14 19:00:42 +03:00
|
|
|
}
|
|
|
|
|
2022-09-23 18:43:48 +03:00
|
|
|
type 'm program = {
|
2022-11-21 12:12:45 +03:00
|
|
|
program_scopes : 'm scope_decl ScopeName.Map.t;
|
2023-02-13 17:00:23 +03:00
|
|
|
program_topdefs : ('m expr * typ) TopdefName.Map.t;
|
2022-08-25 13:09:51 +03:00
|
|
|
program_ctx : decl_ctx;
|
2020-12-14 19:00:42 +03:00
|
|
|
}
|
2022-09-23 18:43:48 +03:00
|
|
|
|
2022-09-26 17:32:02 +03:00
|
|
|
let type_rule decl_ctx env = function
|
|
|
|
| Definition (loc, typ, io, expr) ->
|
2022-12-13 18:06:36 +03:00
|
|
|
let expr' = Typing.expr ~leave_unresolved:false decl_ctx ~env ~typ expr in
|
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
|
|
|
Definition (loc, typ, io, Expr.unbox expr')
|
2022-09-26 17:32:02 +03:00
|
|
|
| Assertion expr ->
|
2023-05-17 16:44:57 +03:00
|
|
|
let typ = Mark.add (Expr.pos expr) (TLit TBool) in
|
2022-12-13 18:06:36 +03:00
|
|
|
let expr' = Typing.expr ~leave_unresolved:false decl_ctx ~env ~typ expr in
|
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
|
|
|
Assertion (Expr.unbox expr')
|
2022-09-30 17:52:35 +03:00
|
|
|
| Call (sc_name, ssc_name, m) ->
|
|
|
|
let pos = Expr.mark_pos m in
|
2023-05-17 16:44:57 +03:00
|
|
|
Call (sc_name, ssc_name, Typed { pos; ty = Mark.add pos TAny })
|
2022-09-26 17:32:02 +03:00
|
|
|
|
|
|
|
let type_program (prg : 'm program) : typed program =
|
2023-01-23 14:19:36 +03:00
|
|
|
let typing_env =
|
|
|
|
TopdefName.Map.fold
|
2023-02-13 17:00:23 +03:00
|
|
|
(fun name (_, ty) -> Typing.Env.add_toplevel_var name ty)
|
2023-03-21 14:14:10 +03:00
|
|
|
prg.program_topdefs
|
|
|
|
(Typing.Env.empty prg.program_ctx)
|
2023-01-23 14:19:36 +03:00
|
|
|
in
|
2023-02-13 17:00:23 +03:00
|
|
|
let program_topdefs =
|
2023-01-23 14:19:36 +03:00
|
|
|
TopdefName.Map.map
|
|
|
|
(fun (expr, typ) ->
|
2023-03-21 14:14:10 +03:00
|
|
|
( Expr.unbox
|
|
|
|
(Typing.expr prg.program_ctx ~leave_unresolved:false ~env:typing_env
|
|
|
|
~typ expr),
|
|
|
|
typ ))
|
2023-02-13 17:00:23 +03:00
|
|
|
prg.program_topdefs
|
2023-01-23 14:19:36 +03:00
|
|
|
in
|
2022-09-26 17:32:02 +03:00
|
|
|
let typing_env =
|
2022-11-21 12:12:45 +03:00
|
|
|
ScopeName.Map.fold
|
2022-09-26 17:32:02 +03:00
|
|
|
(fun scope_name scope_decl ->
|
2022-11-21 12:12:45 +03:00
|
|
|
let vars = ScopeVar.Map.map fst scope_decl.scope_sig in
|
2022-10-25 15:03:35 +03:00
|
|
|
Typing.Env.add_scope scope_name ~vars)
|
2023-01-23 14:19:36 +03:00
|
|
|
prg.program_scopes typing_env
|
2022-09-26 17:32:02 +03:00
|
|
|
in
|
|
|
|
let program_scopes =
|
2022-11-21 12:12:45 +03:00
|
|
|
ScopeName.Map.map
|
2022-09-26 17:32:02 +03:00
|
|
|
(fun scope_decl ->
|
|
|
|
let typing_env =
|
2022-11-21 12:12:45 +03:00
|
|
|
ScopeVar.Map.fold
|
2022-09-26 17:32:02 +03:00
|
|
|
(fun svar (typ, _) env -> Typing.Env.add_scope_var svar typ env)
|
|
|
|
scope_decl.scope_sig typing_env
|
|
|
|
in
|
|
|
|
let scope_decl_rules =
|
|
|
|
List.map
|
|
|
|
(type_rule prg.program_ctx typing_env)
|
|
|
|
scope_decl.scope_decl_rules
|
|
|
|
in
|
2022-09-30 17:40:10 +03:00
|
|
|
let scope_mark =
|
2023-05-17 16:44:57 +03:00
|
|
|
let pos = Mark.get (ScopeName.get_info scope_decl.scope_decl_name) in
|
|
|
|
Typed { pos; ty = Mark.add pos TAny }
|
2022-09-30 17:40:10 +03:00
|
|
|
in
|
|
|
|
{ scope_decl with scope_decl_rules; scope_mark })
|
2022-09-26 17:32:02 +03:00
|
|
|
prg.program_scopes
|
|
|
|
in
|
2023-02-13 17:00:23 +03:00
|
|
|
{ prg with program_topdefs; program_scopes }
|