mirror of
https://github.com/anoma/juvix.git
synced 2024-12-12 14:28:08 +03:00
4c5fee3e95
* 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
33 lines
633 B
Haskell
33 lines
633 B
Haskell
module Main (main) where
|
|
|
|
import Arity qualified
|
|
import BackendC qualified
|
|
import Base
|
|
import MonoJuvix qualified
|
|
import Reachability qualified
|
|
import Scope qualified
|
|
import Termination qualified
|
|
import TypeCheck qualified
|
|
|
|
slowTests :: TestTree
|
|
slowTests =
|
|
testGroup
|
|
"Juvix slow tests"
|
|
[BackendC.allTests]
|
|
|
|
fastTests :: TestTree
|
|
fastTests =
|
|
testGroup
|
|
"Juvix fast tests"
|
|
[ Scope.allTests,
|
|
Termination.allTests,
|
|
Arity.allTests,
|
|
TypeCheck.allTests,
|
|
Reachability.allTests,
|
|
MonoJuvix.allTests
|
|
]
|
|
|
|
main :: IO ()
|
|
main = do
|
|
defaultMain (testGroup "Juvix tests" [fastTests, slowTests])
|