1
1
mirror of https://github.com/anoma/juvix.git synced 2024-12-14 08:27:03 +03:00
juvix/tests/positive/Reachability/M.juvix
Łukasz Czajka 4c5fee3e95
Compute name dependency graph and filter unreachable definitions (#1408)
* Compute name dependency graph and filter unreachable declarations

* bugfix: recurse into type signatures

* positive tests

* make ormolu happy

* get starting nodes from ExportInfo

* make ormolu happy

* cosmetic refactoring of DependencyInfo

* fix tests & style
2022-07-25 18:38:44 +02:00

19 lines
267 B
Plaintext

module M;
open import Data.Nat;
open import Data.Maybe;
open import Data.Product;
open import Data.Bool;
open import Data.Ord;
f : Bool -> Bool;
f x := x;
g : {A : Type} -> A -> Bool -> Bool;
g x y := f y;
h : {A : Type} -> A -> Maybe Bool;
h x := nothing;
end;