Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix dependency analysis for refinement types #1094

Merged
merged 1 commit into from
Aug 29, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/lustre/lustreAstDependencies.ml
Original file line number Diff line number Diff line change
Expand Up @@ -303,7 +303,7 @@ let rec mk_graph_type: LA.lustre_type -> dependency_analysis_data = function
| History _ -> empty_dependency_analysis_data
| TArr (_, aty, rty) -> union_dependency_analysis_data (mk_graph_type aty) (mk_graph_type rty)
(* Circular dependencies in refinement type predicates are allowed *)
| RefinementType (_, (_, _, ty), _) -> mk_graph_type ty
| RefinementType (_, (_, _, ty), e) -> union_dependency_analysis_data (mk_graph_type ty) (mk_graph_expr e)
(** This graph is useful for analyzing top level constant and type declarations *)

and mk_graph_expr ?(only_modes = false)
Expand Down
10 changes: 10 additions & 0 deletions tests/regression/success/ref_type_dep.lus
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
type Pos = subrange [1,*] of int;

const N: Pos;

type I = subtype { i:int | i < N };

node M() returns (y: I);
let
y = N-1;
tel