mirror of
https://github.com/CatalaLang/catala.git
synced 2024-11-09 22:16:10 +03:00
209be6b758
Two interdependent changes here:
1. Enforce all instances of Shared_ast.gexpr to use the generic type for marks.
This makes the interfaces a tad simpler to manipulate: you now write
`('a, 'm) gexpr` rather than `('a, 'm mark) gexpr`.
2. Define a polymorphic `Custom` mark case for use by pass-specific annotations.
And leverage this in the typing module
74 lines
3.0 KiB
OCaml
74 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 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. *)
|
|
|
|
(** Typing for the default calculus. Because of the error terms, we perform type
|
|
inference using the classical W algorithm with union-find unification. *)
|
|
|
|
open Definitions
|
|
|
|
module Env : sig
|
|
type 'e t
|
|
|
|
val empty : decl_ctx -> 'e t
|
|
val add_var : 'e Var.t -> typ -> 'e t -> 'e t
|
|
val add_toplevel_var : TopdefName.t -> typ -> 'e t -> 'e t
|
|
val add_scope_var : ScopeVar.t -> typ -> 'e t -> 'e t
|
|
val add_scope : ScopeName.t -> vars:typ ScopeVar.Map.t -> 'e t -> 'e t
|
|
val open_scope : ScopeName.t -> 'e t -> 'e t
|
|
end
|
|
|
|
(** In the following functions, the [~leave_unresolved] labeled parameter
|
|
controls the behavior of the typer in the case where polymorphic expressions
|
|
are still found after typing: if set to [true], it allows them (giving them
|
|
[TAny] and losing typing information), if set to [false], it aborts. *)
|
|
|
|
val expr :
|
|
leave_unresolved:bool ->
|
|
decl_ctx ->
|
|
?env:'e Env.t ->
|
|
?typ:typ ->
|
|
(('a, 'm) gexpr as 'e) ->
|
|
('a, typed) boxed_gexpr
|
|
(** Infers and marks the types for the given expression. If [typ] is provided,
|
|
it is assumed to be the outer type and used for inference top-down.
|
|
|
|
If the input expression already has type annotations, the full inference is
|
|
still done, but with unification with the existing annotations at every
|
|
step. This can be used for double-checking after AST transformations and
|
|
filling the gaps ([TAny]) if any. Use [Expr.untype] first if this is not
|
|
what you want. *)
|
|
|
|
val check_expr :
|
|
leave_unresolved:bool ->
|
|
decl_ctx ->
|
|
?env:'e Env.t ->
|
|
?typ:typ ->
|
|
(('a, 'm) gexpr as 'e) ->
|
|
('a, untyped) boxed_gexpr
|
|
(** Same as [expr], but doesn't annotate the returned expression. Equivalent to
|
|
[Typing.expr |> Expr.untype], but more efficient. This can be useful for
|
|
type-checking and disambiguation (some AST nodes are updated with missing
|
|
information, e.g. any [TAny] appearing in the AST is replaced) *)
|
|
|
|
val program :
|
|
leave_unresolved:bool -> ('a, 'm) gexpr program -> ('a, typed) gexpr program
|
|
(** Typing on whole programs (as defined in Shared_ast.program, i.e. for the
|
|
later dcalc/lcalc stages.
|
|
|
|
Any existing type annotations are checked for unification. Use
|
|
[Program.untype] to remove them beforehand if this is not the desired
|
|
behaviour. *)
|