mirror of
https://github.com/CatalaLang/catala.git
synced 2024-09-19 16:28:12 +03:00
b9156bb60e
Previously we had some heuristics in the backends trying to achieve this with a lot of holes ; this should be much more solid, relying on `Bindlib` to do the correct renamings. **Note1**: it's not plugged into the backends other than OCaml at the moment. **Note2**: the related, obsolete heuristics haven't been cleaned out yet **Note3**: we conservatively suppose a single namespace at the moment. This is required for e.g. Python, but it forces vars named like struct fields to be renamed, which is more verbose in e.g. OCaml. The renaming engine could be improved to support different namespaces, with a way to select how to route the different kinds of identifiers into them. Similarly, customisation for what needs to be uppercase or lowercase is not available yet. **Note4**: besides excluding keywords, we should also be careful to exclude (or namespace): - the idents used in the runtime (e.g. `o_add_int_int`) - the dynamically generated idents (e.g. `embed_*`) **Note5**: module names themselves aren't handled yet. The reason is that they must be discoverable by the user, and even need to match the filenames, etc. In other words, imagine that `Mod` is a keyword in the target language. You can't rename a module called `Mod` to `Mod1` without knowing the whole module context, because that would destroy the mapping for a module already called `Mod1`. A reliable solution would be to translate all module names to e.g. `CatalaModule_*`, which we can assume will never conflict with any built-in, and forbid idents starting with that prefix. We may also want to restrict their names to ASCII ? Currently we use a projection, but what if I have two modules called `Là` and `La` ?
96 lines
3.0 KiB
OCaml
96 lines
3.0 KiB
OCaml
(* This file is part of the Catala compiler, a specification language for tax
|
|
and social benefits computation rules. Copyright (C) 2020-2022 Inria,
|
|
contributor: Louis Gesbert <louis.gesbert@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. *)
|
|
|
|
(** Bound lists are non-empty linked lists where each element is a binder onto
|
|
the next. They are useful for ordered program definitions, like nested
|
|
let-ins.
|
|
|
|
[let a = e1 in e2] is thus represented as [Cons (e1, {a. Last e2})].
|
|
|
|
The following provides a few utility functions for their traversal and
|
|
manipulation. In particular, [map] functions take care of unbinding, then
|
|
properly rebinding the variables. *)
|
|
|
|
open Definitions
|
|
|
|
type ('e, 'elt, 'last) t = ('e, 'elt, 'last) bound_list =
|
|
| Last of 'last
|
|
| Cons of 'elt * ('e, ('e, 'elt, 'last) t) binder
|
|
|
|
val to_seq : (((_, _) gexpr as 'e), 'elt, _) t -> ('e Var.t * 'elt) Seq.t
|
|
(** Note that the boundlist terminator is ignored in the resulting sequence *)
|
|
|
|
val last : (_, _, 'a) t -> 'a
|
|
val iter : f:('e Var.t -> 'elt -> unit) -> ('e, 'elt, 'last) t -> 'last
|
|
val find : f:('elt -> 'a option) -> (_, 'elt, _) t -> 'a
|
|
|
|
val fold_left :
|
|
f:('acc -> 'elt -> 'e Var.t -> 'acc) ->
|
|
init:'acc ->
|
|
('e, 'elt, 'last) t ->
|
|
'acc * 'last
|
|
|
|
val fold_left2 :
|
|
f:('acc -> 'elt1 -> 'elt2 -> 'e Var.t -> 'acc) ->
|
|
init:'acc ->
|
|
('e, 'elt1, 'last1) t ->
|
|
('e, 'elt2, 'last2) t ->
|
|
'acc * ('last1 * 'last2)
|
|
|
|
val fold_right :
|
|
f:('elt -> 'e Var.t -> 'acc -> 'acc) ->
|
|
init:('last -> 'acc) ->
|
|
('e, 'elt, 'last) t ->
|
|
'acc
|
|
|
|
val fold_lr :
|
|
top:'dacc ->
|
|
down:('e Var.t -> 'elt -> 'dacc -> 'dacc) ->
|
|
bottom:('last -> 'dacc -> 'uacc) ->
|
|
up:('e Var.t -> 'elt -> 'uacc -> 'uacc) ->
|
|
('e, 'elt, 'last) t ->
|
|
'uacc
|
|
(** Bi-directional fold: [down] accumulates downwards, starting from [top]; upon
|
|
reaching [last], [bottom] is called; then [up] accumulates on the way back
|
|
up *)
|
|
|
|
val map :
|
|
f:('e1 Var.t -> 'elt1 -> 'e2 Var.t * 'elt2 Bindlib.box) ->
|
|
last:('last1 -> 'last2 Bindlib.box) ->
|
|
('e1, 'elt1, 'last1) t ->
|
|
('e2, 'elt2, 'last2) t Bindlib.box
|
|
|
|
val fold_map :
|
|
f:('ctx -> 'e1 Var.t -> 'elt1 -> 'ctx * 'e2 Var.t * 'elt2 Bindlib.box) ->
|
|
last:('ctx -> 'last1 -> 'ret * 'last2 Bindlib.box) ->
|
|
init:'ctx ->
|
|
('e1, 'elt1, 'last1) t ->
|
|
'ret * ('e2, 'elt2, 'last2) t Bindlib.box
|
|
|
|
val equal :
|
|
f:('elt -> 'elt -> bool) ->
|
|
last:('last -> 'last -> bool) ->
|
|
(('e, 'elt, 'last) t as 'l) ->
|
|
'l ->
|
|
bool
|
|
|
|
val compare :
|
|
f:('elt -> 'elt -> int) ->
|
|
last:('last -> 'last -> int) ->
|
|
(('e, 'elt, 'last) t as 'l) ->
|
|
'l ->
|
|
int
|