git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
swap
355eb9b1537 ahead, 0 behind
416 files changed+2707−26689
since splitsnapshots
unifiedsplit
.gitignore+6−1 .travis.yml−80 CONTRIBUTING.md−44 CONTRIBUTORS.md−61 ChangeLog.md+3 INSTALL.md−57 LICENSE+24−1962 README-go.md+48 README.md+32−19 Setup.hs−4 app/Main.hs+250 bundle/.gitignore−3 bundle/README−21 bundle/build.sh−46 bundle/winbuild.sh−43 core-tests/.gitignore−2 core-tests/test-everything.sh−77 core-tests/tests/generic-deriving/Main.purs−23 default.nix+23 examples/.gitignore−1 examples/failing/1071.purs−8 examples/failing/1310.purs−18 examples/failing/365.purs−14 examples/failing/438.purs−15 examples/failing/881.purs−13 examples/failing/ArrayType.purs−14 examples/failing/Arrays.purs−8 examples/failing/CaseDoesNotMatchAllConstructorArgs.purs−15 examples/failing/Do.purs−12 examples/failing/DoNotSuggestComposition.purs−13 examples/failing/DoNotSuggestComposition2.purs−7 examples/failing/DuplicateDeclarationsInLet.purs−12 examples/failing/DuplicateProperties1.purs−12 examples/failing/DuplicateProperties2.purs−12 examples/failing/DuplicateTypeVars.purs−6 examples/failing/Eff.purs−13 examples/failing/EmptyCase.purs−4 examples/failing/EmptyDo.purs−6 examples/failing/ExtraRecordField.purs−10 examples/failing/Foldable.purs−17 examples/failing/ImportHidingModule.purs−10 examples/failing/InfiniteKind.purs−5 examples/failing/InfiniteType.purs−5 examples/failing/InstanceExport.purs−19 examples/failing/KindError.purs−6 examples/failing/KindStar.purs−8 examples/failing/LeadingZeros1.purs−6 examples/failing/LeadingZeros2.purs−6 examples/failing/Let.purs−6 examples/failing/MPTCs.purs−10 examples/failing/MissingClassExport.purs−7 examples/failing/MissingClassMemberExport.purs−7 examples/failing/MissingRecordField.purs−11 examples/failing/MultipleErrors.purs−13 examples/failing/MultipleErrors2.purs−9 examples/failing/MutRec.purs−8 examples/failing/MutRec2.purs−6 examples/failing/NewtypeMultiArgs.purs−6 examples/failing/NewtypeMultiCtor.purs−6 examples/failing/NullaryAbs.purs−6 examples/failing/Object.purs−8 examples/failing/OrphanInstance.purs−12 examples/failing/OverlappingArguments.purs−6 examples/failing/OverlappingBinders.purs−9 examples/failing/OverlappingReExport.purs−10 examples/failing/OverlappingVars.purs−15 examples/failing/Rank2Types.purs−8 examples/failing/Reserved.purs−7 examples/failing/RowConstructors1.purs−9 examples/failing/RowConstructors2.purs−9 examples/failing/RowConstructors3.purs−9 examples/failing/SkolemEscape.purs−8 examples/failing/SkolemEscape2.purs−10 examples/failing/SuggestComposition.purs−7 examples/failing/Superclasses1.purs−14 examples/failing/Superclasses2.purs−13 examples/failing/Superclasses3.purs−8 examples/failing/Superclasses5.purs−25 examples/failing/TopLevelCaseNoArgs.purs−8 examples/failing/TransitiveDctorExport.purs−5 examples/failing/TransitiveSynonymExport.purs−5 examples/failing/TypeClassInstances.purs−11 examples/failing/TypeClasses2.purs−9 examples/failing/TypeError.purs−6 examples/failing/TypeSynonyms.purs−8 examples/failing/TypeSynonyms2.purs−12 examples/failing/TypeSynonyms3.purs−12 examples/failing/TypeSynonyms4.purs−11 examples/failing/TypeSynonyms5.purs−6 examples/failing/TypeWildcards1.purs−7 examples/failing/TypeWildcards2.purs−7 examples/failing/TypeWildcards3.purs−10 examples/failing/TypedBinders.purs−10 examples/failing/TypedBinders2.purs−9 examples/failing/TypedBinders3.purs−12 examples/failing/UnderscoreModuleName.purs−6 examples/failing/UnifyInTypeInstanceLookup.purs−22 examples/failing/UnknownType.purs−7 examples/manual/QualifiedNames.purs−13 examples/manual/failing/ArgLengthMismatch.purs−6 examples/manual/failing/ExportExplicit.purs−7 examples/manual/failing/ExportExplicit1.purs−14 examples/manual/failing/ExportExplicit2.purs−7 examples/manual/failing/ExportExplicit3.purs−13 examples/manual/failing/ImportExplicit.purs−7 examples/manual/failing/ImportExplicit2.purs−7 examples/manual/failing/ImportModule.purs−7 examples/manual/failing/OrphanTypeDecl.purs−3 examples/manual/failing/RedefinedFixity.purs−8 examples/manual/failing/RequiredHiddenType.purs−8 examples/manual/passing/ExportExplicit.purs−20 examples/manual/passing/ExportExplicit2.purs−15 examples/manual/passing/ExportedInstanceDeclarations.purs−43 examples/manual/passing/Import.purs−19 examples/manual/passing/ImportExplicit.purs−14 examples/manual/passing/ImportQualified.purs−12 examples/manual/passing/Module.purs−28 examples/manual/passing/ModuleDeps.purs−17 examples/manual/passing/RedefinedFixity.purs−24 examples/manual/passing/ShadowedName.purs−10 examples/manual/passing/TransitiveImport.purs−24 examples/manual/passing/WildcardType.purs−13 examples/passing/652.purs−17 examples/passing/810.purs−13 examples/passing/862.purs−8 examples/passing/922.purs−20 examples/passing/Applicative.purs−16 examples/passing/ArrayType.purs−11 examples/passing/Auto.purs−15 examples/passing/AutoPrelude.purs−9 examples/passing/AutoPrelude2.purs−10 examples/passing/BindersInFunctions.purs−11 examples/passing/BindingGroups.purs−10 examples/passing/BlockString.purs−8 examples/passing/CaseInDo.purs−19 examples/passing/CaseStatement.purs−21 examples/passing/CheckFunction.purs−7 examples/passing/CheckSynonymBug.purs−12 examples/passing/CheckTypeClass.purs−18 examples/passing/Church.purs−18 examples/passing/Collatz.purs−18 examples/passing/Comparisons.purs−15 examples/passing/Conditional.purs−9 examples/passing/Console.purs−13 examples/passing/DataAndType.purs−9 examples/passing/DeepArrayBinder.purs−16 examples/passing/DeepCase.purs−15 examples/passing/Do.purs−67 examples/passing/Dollar.purs−16 examples/passing/Eff.purs−25 examples/passing/EmptyDataDecls.purs−19 examples/passing/EmptyRow.purs−10 examples/passing/EmptyTypeClass.purs−12 examples/passing/EqOrd.purs−15 examples/passing/ExplicitImportReExport.purs−16 examples/passing/ExtendedInfixOperators.purs−14 examples/passing/Fib.purs−15 examples/passing/FinalTagless.purs−22 examples/passing/FunctionScope.purs−12 examples/passing/Functions.purs−15 examples/passing/Functions2.purs−12 examples/passing/Guards.purs−29 examples/passing/HoistError.purs−12 examples/passing/IfThenElseMaybe.purs−11 examples/passing/ImplicitEmptyImport.purs−8 examples/passing/ImportHiding.purs−18 examples/passing/InferRecFunWithConstrainedArgument.purs−8 examples/passing/InstanceBeforeClass.purs−11 examples/passing/IntAndChar.purs−18 examples/passing/JSReserved.purs−12 examples/passing/KindedType.purs−33 examples/passing/LargeSumType.purs−33 examples/passing/Let.purs−53 examples/passing/Let2.purs−17 examples/passing/LetInInstance.purs−14 examples/passing/LiberalTypeSynonyms.purs−21 examples/passing/MPTCs.purs−20 examples/passing/Match.purs−9 examples/passing/ModuleExport.purs−9 examples/passing/ModuleExportDupes.purs−19 examples/passing/ModuleExportExcluded.purs−14 examples/passing/ModuleExportQualified.purs−9 examples/passing/ModuleExportSelf.purs−14 examples/passing/Monad.purs−32 examples/passing/MonadState.purs−48 examples/passing/MultiArgFunctions.purs−27 examples/passing/MutRec.purs−19 examples/passing/MutRec2.purs−19 examples/passing/MutRec3.purs−19 examples/passing/NakedConstraint.purs−12 examples/passing/NamedPatterns.purs−9 examples/passing/NegativeBinder.purs−9 examples/passing/Nested.purs−9 examples/passing/NestedTypeSynonyms.purs−11 examples/passing/NestedWhere.purs−12 examples/passing/Newtype.purs−23 examples/passing/NewtypeEff.purs−29 examples/passing/NewtypeWithRecordUpdate.purs−16 examples/passing/ObjectGetter.purs−13 examples/passing/ObjectSynonym.purs−15 examples/passing/ObjectUpdate.purs−20 examples/passing/ObjectUpdate2.purs−17 examples/passing/ObjectUpdater.purs−24 examples/passing/ObjectWildcards.purs−20 examples/passing/Objects.purs−35 examples/passing/OneConstructor.purs−9 examples/passing/OperatorAssociativity.purs−25 examples/passing/OperatorInlining.purs−47 examples/passing/OperatorSections.purs−11 examples/passing/Operators.purs−99 examples/passing/OptimizerBug.purs−9 examples/passing/OptionalQualified.purs−13 examples/passing/OverlappingInstances.purs−13 examples/passing/OverlappingInstances2.purs−23 examples/passing/OverlappingInstances3.purs−16 examples/passing/PartialFunction.purs−10 examples/passing/Patterns.purs−22 examples/passing/Person.purs−11 examples/passing/QualifiedQualifiedImports.purs−6 examples/passing/Rank2Data.purs−29 examples/passing/Rank2Object.purs−11 examples/passing/Rank2TypeSynonym.purs−16 examples/passing/Rank2Types.purs−11 examples/passing/ReExportQualified.purs−16 examples/passing/RebindableSyntax.purs−39 examples/passing/Recursion.purs−10 examples/passing/ReservedWords.purs−15 examples/passing/RowConstructors.purs−42 examples/passing/RowPolyInstanceContext.purs−22 examples/passing/RuntimeScopeIssue.purs−19 examples/passing/ScopedTypeVariables.purs−36 examples/passing/Sequence.purs−15 examples/passing/SequenceDesugared.purs−37 examples/passing/ShadowedRename.purs−14 examples/passing/ShadowedTCO.purs−18 examples/passing/ShadowedTCOLet.purs−9 examples/passing/SignedNumericLiterals.purs−17 examples/passing/Superclasses1.purs−20 examples/passing/Superclasses3.purs−41 examples/passing/TCOCase.purs−12 examples/passing/TailCall.purs−17 examples/passing/Tick.purs−7 examples/passing/TopLevelCase.purs−18 examples/passing/TypeClassMemberOrderChange.purs−13 examples/passing/TypeClasses.purs−69 examples/passing/TypeClassesInOrder.purs−11 examples/passing/TypeClassesWithOverlappingTypeVariables.purs−11 examples/passing/TypeDecl.purs−12 examples/passing/TypeSynonymInData.purs−11 examples/passing/TypeSynonyms.purs−27 examples/passing/TypeWildcards.purs−15 examples/passing/TypeWildcardsRecordExtension.purs−8 examples/passing/TypedBinders.purs−62 examples/passing/TypedWhere.purs−17 examples/passing/UTF8Sourcefile.purs−10 examples/passing/UnderscoreIdent.purs−11 examples/passing/Unit.purs−6 examples/passing/UnknownInTypeClassLookup.purs−14 examples/passing/Where.purs−49 examples/passing/iota.purs−9 examples/passing/s.purs−7 hierarchy/Main.hs−114 license-generator/generate−47 license-generator/header.txt−23 license-generator/tmp/.gitkeep logo.png package.yaml+86 psc-bundle/Main.hs−138 psc-bundle/README.md−18 psc-docs/Ctags.hs−13 psc-docs/Etags.hs−15 psc-docs/Main.hs−251 psc-docs/Tags.hs−18 psc-publish/Main.hs−38 psc-publish/tests/Test.hs−79 psc/Main.hs−192 psci/Completion.hs−233 psci/Directive.hs−115 psci/IO.hs−21 psci/PSCi.hs−604 psci/Parser.hs−143 psci/Types.hs−181 psci/main/Main.hs−6 psci/tests/Main.hs−163 psci/tests/data/Sample.purs psgo.cabal+145 purescript.cabal−277 src/CodeGen/IL.hs+321 src/CodeGen/IL/Common.hs+196 src/CodeGen/IL/Optimizer.hs+81 src/CodeGen/IL/Optimizer/Common.hs+18 src/CodeGen/IL/Optimizer/Inliner.hs+435 src/CodeGen/IL/Optimizer/MagicDo.hs+146 src/CodeGen/IL/Optimizer/TCO.hs+141 src/CodeGen/IL/Printer.hs+527 src/Control/Monad/Supply.hs−46 src/Control/Monad/Supply/Class.hs−36 src/Control/Monad/Unify.hs−160 src/Language/PureScript.hs−49 src/Language/PureScript/AST.hs−24 src/Language/PureScript/AST/Binders.hs−92 src/Language/PureScript/AST/Declarations.hs−438 src/Language/PureScript/AST/Exported.hs−136 src/Language/PureScript/AST/Operators.hs−60 src/Language/PureScript/AST/SourcePos.hs−98 src/Language/PureScript/AST/Traversals.hs−415 src/Language/PureScript/Bundle.hs−552 src/Language/PureScript/CodeGen.hs−20 src/Language/PureScript/CodeGen/JS.hs−363 src/Language/PureScript/CodeGen/JS/AST.hs−349 src/Language/PureScript/CodeGen/JS/Common.hs−181 src/Language/PureScript/CodeGen/JS/Optimizer.hs−92 src/Language/PureScript/CodeGen/JS/Optimizer/Blocks.hs−42 src/Language/PureScript/CodeGen/JS/Optimizer/Common.hs−77 src/Language/PureScript/CodeGen/JS/Optimizer/Inliner.hs−318 src/Language/PureScript/CodeGen/JS/Optimizer/MagicDo.hs−165 src/Language/PureScript/CodeGen/JS/Optimizer/TCO.hs−128 src/Language/PureScript/CodeGen/JS/Optimizer/Unused.hs−46 src/Language/PureScript/Comments.hs−29 src/Language/PureScript/Constants.hs−292 src/Language/PureScript/CoreFn.hs−26 src/Language/PureScript/CoreFn/Ann.hs−37 src/Language/PureScript/CoreFn/Binders.hs−48 src/Language/PureScript/CoreFn/Desugar.hs−265 src/Language/PureScript/CoreFn/Expr.hs−134 src/Language/PureScript/CoreFn/Literals.hs−50 src/Language/PureScript/CoreFn/Meta.hs−55 src/Language/PureScript/CoreFn/Module.hs−31 src/Language/PureScript/CoreFn/Traversals.hs−85 src/Language/PureScript/Docs.hs−14 src/Language/PureScript/Docs/AsMarkdown.hs−124 src/Language/PureScript/Docs/Convert.hs−226 src/Language/PureScript/Docs/ParseAndDesugar.hs−146 src/Language/PureScript/Docs/Render.hs−128 src/Language/PureScript/Docs/RenderedCode.hs−11 src/Language/PureScript/Docs/RenderedCode/Render.hs−184 src/Language/PureScript/Docs/RenderedCode/Types.hs−194 src/Language/PureScript/Docs/Types.hs−513 src/Language/PureScript/Docs/Utils/MonoidExtras.hs−9 src/Language/PureScript/Environment.hs−272 src/Language/PureScript/Errors.hs−967 src/Language/PureScript/Externs.hs−216 src/Language/PureScript/Kinds.hs−75 src/Language/PureScript/Linter.hs−119 src/Language/PureScript/Linter/Exhaustive.hs−310 src/Language/PureScript/Make.hs−387 src/Language/PureScript/ModuleDependencies.hs−79 src/Language/PureScript/Names.hs−120 src/Language/PureScript/Options.hs−49 src/Language/PureScript/Parser.hs−36 src/Language/PureScript/Parser/Common.hs−139 src/Language/PureScript/Parser/Declarations.hs−568 src/Language/PureScript/Parser/JS.hs−62 src/Language/PureScript/Parser/Kinds.hs−49 src/Language/PureScript/Parser/Lexer.hs−520 src/Language/PureScript/Parser/State.hs−30 src/Language/PureScript/Parser/Types.hs−137 src/Language/PureScript/Pretty.hs−32 src/Language/PureScript/Pretty/Common.hs−80 src/Language/PureScript/Pretty/JS.hs−306 src/Language/PureScript/Pretty/Kinds.hs−58 src/Language/PureScript/Pretty/Types.hs−150 src/Language/PureScript/Pretty/Values.hs−168 src/Language/PureScript/Publish.hs−366 src/Language/PureScript/Publish/BoxesHelpers.hs−38 src/Language/PureScript/Publish/ErrorsWarnings.hs−395 src/Language/PureScript/Publish/Utils.hs−38 src/Language/PureScript/Renamer.hs−200 src/Language/PureScript/Sugar.hs−79 src/Language/PureScript/Sugar/BindingGroups.hs−208 src/Language/PureScript/Sugar/CaseDeclarations.hs−186 src/Language/PureScript/Sugar/DoNotation.hs−77 src/Language/PureScript/Sugar/Names.hs−283 src/Language/PureScript/Sugar/Names/Env.hs−191 src/Language/PureScript/Sugar/Names/Exports.hs−235 src/Language/PureScript/Sugar/Names/Imports.hs−210 src/Language/PureScript/Sugar/ObjectWildcards.hs−68 src/Language/PureScript/Sugar/Operators.hs−177 src/Language/PureScript/Sugar/TypeClasses.hs−309 src/Language/PureScript/Sugar/TypeClasses/Deriving.hs−232 src/Language/PureScript/Sugar/TypeDeclarations.hs−70 src/Language/PureScript/Traversals.hs−45 src/Language/PureScript/TypeChecker.hs−365 src/Language/PureScript/TypeChecker/Entailment.hs−178 src/Language/PureScript/TypeChecker/Kinds.hs−223 src/Language/PureScript/TypeChecker/Monad.hs−278 src/Language/PureScript/TypeChecker/Rows.hs−66 src/Language/PureScript/TypeChecker/Skolems.hs−118 src/Language/PureScript/TypeChecker/Subsumption.hs−88 src/Language/PureScript/TypeChecker/Synonyms.hs−64 src/Language/PureScript/TypeChecker/Types.hs−675 src/Language/PureScript/TypeChecker/Unify.hs−194 src/Language/PureScript/TypeClassDictionaries.hs−62 src/Language/PureScript/Types.hs−315 src/System/IO/UTF8.hs−9 src/Tests.hs+141 stack-lts-2.yaml−9 stack-lts-3.yaml−5 stack-nightly.yaml−5 stack.nix+23 stack.yaml+24−1 support/ffi-loader.go+30 support/go.mod.ffi-loader+2 support/go.mod.output+2 support/go.mod.working+1 test/Spec.hs+2 tests/Main.hs−221 tests/common/TestsSetup.hs−48 tests/support/.gitignore−2 tests/support/bower.json−11 tests/support/package.json−7 tests/support/setup-win.cmd−3 tests/support/setup.js−22 travis/after.sh−25 travis/configure.sh−17 travis/test-install.sh−18
.gitignore+6−1
@@ -14,5 +14,10 @@ bower_components/
1414node_modules
1515tmp/
1616.stack-work/
17−tests/support/flattened/
17+stack.yaml.lock
1818output
19+examples/docs/docs/
20+core-tests/full-core-docs.md
21+.psc-ide-port
22+.vscode/
23+result
.travis.ymldeleted−80
@@ -1,80 +0,0 @@
1−language: c
2−sudo: false
3−matrix:
4− include:
5− - env: GHCVER=7.8.4 COVERAGE_SUITE=tests
6− compiler: ": #GHC 7.8.4 - tests"
7− # ^ HACK before https://github.com/travis-ci/travis-ci/issues/4393 is resolved
8− addons: {apt: {packages: [cabal-install-1.22,ghc-7.8.4,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
9− - env: GHCVER=7.8.4 COVERAGE_SUITE=psci-tests
10− compiler: ": #GHC 7.8.4 - psci-tests"
11− addons: {apt: {packages: [cabal-install-1.22,ghc-7.8.4,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
12− - env: GHCVER=7.8.4 STACKAGE=lts-2.22
13− compiler: ": #GHC 7.8.4 - lts-2.22-1"
14− addons: {apt: {packages: [cabal-install-1.22,ghc-7.8.4,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
15− - env: GHCVER=7.6.3
16− compiler: ": #GHC 7.6.3"
17− addons: {apt: {packages: [cabal-install-1.22,ghc-7.6.3,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
18− - env: GHCVER=7.10.1 DEPLOY=yes
19− compiler: ": #GHC 7.10.1"
20− addons: {apt: {packages: [cabal-install-1.22,ghc-7.10.1,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
21− - env: GHCVER=7.10.2 STACKAGE=lts=3.6 RUNSDISTTESTS=YES
22− compiler: ": #GHC 7.10.2 lts-3.6"
23− addons: {apt: {packages: [cabal-install-1.22,ghc-7.10.2,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
24− - env: GHCVER=7.10.2 STACKAGE=nightly-2015-09-29
25− compiler: ": #GHC 7.10.2 nightly-2015-09-29"
26− addons: {apt: {packages: [cabal-install-1.22,ghc-7.10.2,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
27−before_install:
28− - unset CC
29− - export PATH="/opt/ghc/$GHCVER/bin:$PATH"
30− - export PATH="/opt/cabal/1.22/bin:$PATH"
31− - export PATH="$HOME/.cabal/bin:$PATH"
32− - export PATH="/opt/happy/1.19.5/bin:/$PATH"
33− - export PATH="/opt/alex/3.1.4/bin:/$PATH"
34−install:
35− - cabal --version
36− - echo "$(ghc --version) [$(ghc --print-project-git-commit-id 2> /dev/null || echo '?')]"
37− - travis_retry cabal update
38− # Run sequentially
39− # Travis container infrastructure seems to expose all host CPUs (16?), thus
40− # cabal and ghc tries to use them all. Which is bad idea on a shared box.
41− # See also: https://ghc.haskell.org/trac/ghc/ticket/9221
42− - sed -i 's/^jobs:/-- jobs:/' ${HOME}/.cabal/config
43− # Cache sandboxes in ~/cabal-sandboxes
44− # Move right sandbox to .cabal-sandbox if exists
45− - if [ -d ~/cabal-sandboxes/$GHCVER-${STACKAGE:-none} ]; then
46− mv ~/cabal-sandboxes/$GHCVER-${STACKAGE:-none} .cabal-sandbox;
47− fi
48− - mkdir -p .cabal-sandbox
49− - cabal sandbox init --sandbox .cabal-sandbox
50− # Download stackage cabal.config, not sure whether filtering is necessary
51− - if [ -n "$STACKAGE" ]; then curl http://www.stackage.org/$STACKAGE/cabal.config | grep -v purescript > cabal.config; fi
52− - cabal install --only-dependencies --enable-tests
53− - cabal install hpc-coveralls
54− # Snapshot state of the sandbox now, so we don't need to make new one for test install
55− - rm -rf ~/cabal-sandboxes/$GHCVER-${STACKAGE:-none}
56− - cp -r .cabal-sandbox ~/cabal-sandboxes/$GHCVER-${STACKAGE:-none}
57−script:
58− - ./travis/configure.sh
59− - cabal build --ghc-options="-Werror"
60− - cabal test
61− - ./travis/test-install.sh
62−after_script:
63− - ./travis/after.sh
64−notifications:
65− email: true
66−before_deploy: "./bundle/build.sh linux64"
67−deploy:
68− provider: releases
69− api_key: $RELEASE_KEY
70− file:
71− - bundle/linux64.tar.gz
72− - bundle/linux64.sha
73− skip_cleanup: true
74− on:
75− all_branches: true
76− tags: true
77− condition: "$DEPLOY = yes"
78−cache:
79− directories:
80− - ~/cabal-sandboxes
CONTRIBUTING.mddeleted−44
@@ -1,44 +0,0 @@
1−An introductory overview of the compiler is available [here](https://www.youtube.com/watch?v=Y3P1dxqwFiE).
2−
3−Pull requests are encouraged.
4−
5−## Finding Issues to Work On
6−
7−If you would like to contribute, please consider the issues in the current milestone first. If you are a new contributor, you may want to have a go at the ["easy" issues](https://github.com/purescript/purescript/labels/easy) to get started.
8−
9−## Pull Requests
10−
11−Please follow the following guidelines:
12−
13−- Add at least a test to `examples/passing/` and possibly to `examples/failing`.
14−- Build the binaries and libs with `cabal build`
15−- Install the binaries and libs with `cabal install`.
16−- Run `cabal configure --enable-tests && cabal build && cabal test` to build the test suite. You will need `npm` and `node` on your PATH to run the tests.
17−- Build the core libraries by running the script in `core-tests`.
18−
19−## Code Review
20−
21−To prevent core libraries from getting broken, every change must be reviewed. A pull request will be merged as long as one other team member has verified the changes.
22−
23−## Adding Dependencies
24−
25−Because the PureScript compiler is distributed in binary form, we include
26−the licenses of all dependencies, including transitive ones, in the LICENSE
27−file. Therefore, whenever the dependencies change, the LICENSE file should be
28−updated.
29−
30−You can automate this (if you have bash):
31−
32−- get a copy of [cabal-dependency-licenses][]
33−- run at the command line: `./license/generate > LICENSE`
34−
35−[cabal-dependency-licenses]: https://github.com/jaspervdj/cabal-dependency-licenses
36−
37−## Writing Issues
38−
39−- If the issue is actually a question, please consider asking on Reddit, Stack Overflow or IRC first.
40−- Please include a minimal, repeatable test case with any bug report.
41−
42−## Copyright and Licensing
43−
44−For any code change, please append a copyright and licensing notice to the [CONTRIBUTORS.md](CONTRIBUTORS.md) file.
CONTRIBUTORS.mddeleted−61
@@ -1,61 +0,0 @@
1−## Contributors
2−
3−This file lists the contributors to the PureScript compiler project, and the terms under which their code is licensed.
4−
5−### Individuals
6−
7−- [@5outh](https://github.com/5outh) (Benjamin Kovach) - My existing contributions and all future contributions until further notice are Copyright Benjamin Kovach, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
8−- [@andyarvanitis](https://github.com/andyarvanitis) (Andy Arvanitis) My existing contributions and all future contributions until further notice are Copyright Andy Arvanitis, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
9−- [@anthok88](https://github.com/anthoq88) - My existing contributions and all future contributions until further notice are Copyright anthoq88, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license
10−- [@ardumont](https://github.com/ardumont) (Antoine R. Dumont) My existing contributions and all future contributions until further notice are Copyright Antoine R. Dumont, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
11−- [@aspidites](https://github.com/aspidites) (Edwin Marshall) My existing contributions and all future contributions until further notice are Copyright Edwin Marshall, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
12−- [@balajirrao](https://github.com/balajirrao) (Balaji Rao) - My existing contributions and all future contributions until further notice are Copyright Balaji Rao, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
13−- [@bergmark](https://github.com/bergmark) (Adam Bergmark) - My existing contributions and all future contributions until further notice are Copyright Adam Bergmark, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
14−- [@Bogdanp](https://github.com/Bogdanp) (Bogdan Paul Popa) My existing contributions and all future contributions until further notice are Copyright Bogdan Paul Popa, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
15−- [@davidchambers](https://github.com/davidchambers) (David Chambers) My existing contributions and all future contributions until further notice are Copyright David Chambers, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
16−- [@dckc](https://github.com/dckc) (Dan Connolly) My existing contributions and all future contributions until further notice are Copyright Dan Connolly, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
17−- [@dylex](https://github.com/dylex) (Dylan Simon) My existing and all future contributions to the PureScript compiler until further notice are Copyright Dylan Simon, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
18−- [@eamelink](https://github.com/eamelink) (Erik Bakker) - My existing contributions and all future contributions until further notice are Copyright Erik Bakker, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
19−- [@epost](https://github.com/epost) (Erik Post) - My existing contributions and all future contributions until further notice are Copyright Erik Post, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license
20−- [@erdeszt](https://github.com/erdeszt) (Tibor Erdesz) My existing contributions and all future contributions until further notice are Copyright Tibor Erdesz, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
21−- [@etrepum](https://github.com/etrepum) (Bob Ippolito) My existing contributions and all future contributions until further notice are Copyright Bob Ippolito, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
22−- [@garyb](https://github.com/garyb) (Gary Burgess) My existing contributions and all future contributions until further notice are Copyright Gary Burgess, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
23−- [@hdgarrood](https://github.com/hdgarrood) (Harry Garrood) My existing contributions and all future contributions until further notice are Copyright Harry Garrood, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
24−- [@jacereda](https://github.com/jacereda) (Jorge Acereda) My existing contributions and all future contributions until further notice are Copyright Jorge Acereda, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
25−- [@japesinator](https://github.com/japesinator) (JP Smith) My existing contributions and all future contributions until further notice are Copyright JP Smith, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
26−- [@joneshf](https://github.com/joneshf) (Hardy Jones) - My existing contributions and all future contributions until further notice are Copyright Hardy Jones, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
27−- [@kRITZCREEK](https://github.com/kRITZCREEK) (Christoph Hegemann) - My existing contributions and all future contributions until further notice are Copyright Christoph Hegemann, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
28−- [@L8D](https://github.com/L8D) (Tenor Biel) My existing contributions and all future contributions until further notice are Copyright Tenor Biel, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
29−- [@lukerandall](https://github.com/lukerandall) (Luke Randall) My existing contributions and all future contributions until further notice are Copyright Luke Randall, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
30−- [@michaelficarra](https://github.com/michaelficarra) (Michael Ficarra) My existing contributions and all future contributions until further notice are Copyright Michael Ficarra, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
31−- [@MichaelXavier](https://github.com/MichaelXavier) (Michael Xavier) - My existing contributions and all future contributions until further notice are Copyright Michael Xavier, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
32−- [@mjgpy3](https://github.com/mjgpy3) (Michael Gilliland) My existing contributions and all future contributions until further notice are Copyright Michael Gilliland, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
33−- [@mpietrzak](https://github.com/mpietrzak) (Maciej Pietrzak) My existing contributions and all future contributions until further notice are Copyright Maciej Pietrzak, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
34−- [@mrhania](https://github.com/mrhania) (Łukasz Hanuszczak) - My existing contributions and all future contributions until further notice are Copyright Łukasz Hanuszczak, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
35−- [@nagisa](https://github.com/nagisa) I hereby release my [only contribution](https://github.com/purescript/purescript/commit/80287a5d0de619862d3b4cda9c1ee276d18fdcd8) into public domain.
36−- [@natefaubion](https://github.com/natefaubion) (Nathan Faubion) My existing contributions and all future contributions until further notice are Copyright Nathan Faubion, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
37−- [@nicodelpiano](https://github.com/nicodelpiano) (Nicolas Del Piano) My existing contributions and all future contributions until further notice are Copyright Nicolas Del Piano, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
38−- [@nullobject](https://github.com/nullobject) (Josh Bassett) My existing contributions and all future contributions until further notice are Copyright Josh Bassett, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
39−- [@osa1](https://github.com/osa1) (Ömer Sinan Ağacan) - My existing contributions and all future contributions until further notice are Copyright Ömer Sinan Ağacan, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
40−- [@paf31](https://github.com/paf31) (Phil Freeman) My existing contributions and all future contributions until further notice are Copyright Phil Freeman, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
41−- [@paulyoung](https://github.com/paulyoung) (Paul Young) My existing contributions and all future contributions until further notice are Copyright Paul Young, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
42−- [@pelotom](https://github.com/pelotom) (Thomas Crockett) My existing contributions and all future contributions until further notice are Copyright Thomas Crockett, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
43−- [@phadej](https://github.com/phadej) (Oleg Grenrus) My existing contributions and all future contributions until further notice are Copyright Oleg Grenrus, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
44−- [@philopon](https://github.com/philopon) (Hirotomo Moriwaki) - My existing contributions and all future contributions until further notice are Copyright Hirotomo Moriwaki, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
45−- [@pseudonom](https://github.com/pseudonom) (Eric Easley) My existing contributions and all future contributions until further notice are Copyright Eric Easley, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
46−- [@puffnfresh](https://github.com/puffnfresh) (Brian McKenna) All contributions I made during June 2015 were during employment at [SlamData, Inc.](#companies) who owns the copyright. I assign copyright of all my personal contributions before June 2015 to the owners of the PureScript compiler.
47−- [@robdaemon](https://github.com/robdaemon) (Robert Roland) My existing contributions and all future contributions until further notice are Copyright Robert Roland, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
48−- [@RossMeikleham](https://github.com/RossMeikleham) (Ross Meikleham) My existing contributions and all future contributions until further notice are Copyright Ross Meikleham, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
49−- [@sebastiaanvisser](https://github.com/sebastiaanvisser) (Sebastiaan Visser) - My existing contributions and all future contributions until further notice are Copyright Sebastiaan Visser, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
50−- [@sztupi](https://github.com/sztupi) (Attila Sztupak) My existing contributions and all future contributions until further notice are Copyright Attila Sztupak, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
51−- [@taku0](https://github.com/taku0) - My existing contributions and all future contributions until further notice are Copyright taku0, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
52−- [@trofi](https://github.com/trofi) (Sergei Trofimovich) My existing contributions and all future contributions until further notice are Copyright Sergei Trofimovich, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
53−- [@utkarshkukreti](https://github.com/utkarshkukreti) (Utkarsh Kukreti) My existing contributions and all future contributions until further notice are Copyright Utkarsh Kukreti, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
54−- [@vkorablin](https://github.com/vkorablin) (Vladimir Korablin) - My existing contributions and all future contributions until further notice are Copyright Vladimir Korablin, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
55−- [@zudov](https://github.com/zudov) (Konstantin Zudov) My existing contributions and all future contributions until further notice are Copyright Konstantin Zudov, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
56−- [@senju](https://github.com/senju) - My existing contributions and all future contributions until further notice are Copyright senju, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
57−<http://opensource.org/licenses/MIT>.
58−
59−### Companies
60−
61−- [@slamdata](https://github.com/slamdata) (SlamData, Inc.) Speaking on behalf of SlamData for SlamData employees, our existing contributions and all future contributions to the PureScript compiler are, until further notice, Copyright SlamData Inc., and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT). - @jdegoes
ChangeLog.mdnew file+3
@@ -0,0 +1,3 @@
1+# Changelog for pscpp
2+
3+## Unreleased changes
INSTALL.mddeleted−57
@@ -1,57 +0,0 @@
1−# Installation information
2−
3−If you are having difficulty installing the PureScript compiler, feel free to
4−ask for help! A good place is the #purescript IRC channel on Freenode, or
5−alternatively Stack Overflow.
6−
7−## Using prebuilt binaries
8−
9−The prebuilt binaries are compiled with GHC 7.8.4, and therefore they should
10−run on any operating system supported by GHC 7.8.4, such as:
11−
12−* Windows 2000 or later,
13−* OS X 10.7 or later,
14−* Linux ??? (we're not sure what the minimum version is).
15−
16−This list is not exhaustive. If your OS is too old or not listed, or if the
17−binaries fail to run, you may be able to install the compiler by building it
18−from source; see below.
19−
20−It's probably safe to assume that other prebuilt distributions (eg, Homebrew,
21−Chocolatey, AUR, npm) use the same binaries, and therefore have the same
22−requirements.
23−
24−## Compiling from source
25−
26−GHC 7.6.1 or newer is required to compile from source. The easiest way is to
27−use stack:
28−
29−```
30−$ stack install purescript
31−```
32−
33−This will then copy the compiler and utilities into `~/.local/bin`.
34−
35−
36−If you don't have stack installed yet there are install instructions
37−[here](https://github.com/commercialhaskell/stack/blob/master/doc/install_and_upgrade.md).
38−
39−If you don't have ghc installed yet, stack will prompt you to run `stack setup`
40−which will install ghc for you.
41−
42−The PureScript compiler has been known to run on OS X 10.6 when built with GHC
43−7.6.
44−
45−
46−## The "curses" library
47−
48−`psci` depends on the `curses` library (via the Haskell package `terminfo`). If
49−you are having difficulty running the compiler, it may be because the `curses`
50−library is missing.
51−
52−On Linux, you will probably need to install `ncurses` manually. On Ubuntu, for
53−example, this can be done by running:
54−
55−```
56−$ sudo apt-get install libncurses5-dev
57−```
LICENSE+24−1962
@@ -1,1968 +1,30 @@
1−The MIT License (MIT)
1+Copyright Andy Arvanitis (c) 2018
22
3−Copyright (c) 2013-15 Phil Freeman, (c) 2014-2015 Gary Burgess, and other
4−contributors
3+All rights reserved.
54
6−Permission is hereby granted, free of charge, to any person obtaining a copy of
7−this software and associated documentation files (the "Software"), to deal in
8−the Software without restriction, including without limitation the rights to
9−use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
10−the Software, and to permit persons to whom the Software is furnished to do so,
11−subject to the following conditions:
5+Redistribution and use in source and binary forms, with or without
6+modification, are permitted provided that the following conditions are met:
127
13−The above copyright notice and this permission notice shall be included in all
14−copies or substantial portions of the Software.
15−
16−THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17−IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
18−FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
19−COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
20−IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
21−CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
22−
23−PureScript uses the following Haskell library packages. Their license files follow.
24−
25− Glob
26− HUnit
27− aeson
28− aeson-better-errors
29− ansi-terminal
30− ansi-wl-pprint
31− array
32− attoparsec
33− base
34− binary
35− blaze-builder
36− bower-json
37− boxes
38− bytestring
39− containers
40− deepseq
41− directory
42− dlist
43− filepath
44− ghc-prim
45− hashable
46− haskeline
47− integer-gmp
48− language-javascript
49− lifted-base
50− monad-control
51− mtl
52− nats
53− optparse-applicative
54− parsec
55− pattern-arrows
56− pretty
57− primitive
58− process
59− rts
60− safe
61− scientific
62− semigroups
63− split
64− stm
65− syb
66− template-haskell
67− terminfo
68− text
69− time
70− transformers
71− transformers-base
72− transformers-compat
73− unix
74− unordered-containers
75− utf8-string
76− vector
77− void
78−
79−Glob LICENSE file:
80−
81− The code in Glob is released under the license below. Copyrights to parts of
82− the code are held by whoever wrote the code in question: see CREDITS.txt for a
83− list of authors.
84−
85− Copyright (c) 2008-2012 <authors>
86− All rights reserved.
87−
88− Redistribution and use in source and binary forms, with or without
89− modification, are permitted provided that the following conditions are met:
90− * Redistributions of source code must retain the above copyright
91− notice, this list of conditions and the following disclaimer.
92− * Redistributions in binary form must reproduce the above copyright
93− notice, this list of conditions and the following disclaimer in the
94− documentation and/or other materials provided with the distribution.
95− * Neither the name of the project nor the names of its contributors may be
96− used to endorse or promote products derived from this software without
97− specific prior written permission.
98−
99− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR IMPLIED
100− WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
101− MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
102− EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
103− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
104− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
105− PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
106− LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
107− OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
108− ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
109−
110−HUnit LICENSE file:
111−
112− HUnit is Copyright (c) Dean Herington, 2002, all rights reserved,
113− and is distributed as free software under the following license.
114−
115− Redistribution and use in source and binary forms, with or without
116− modification, are permitted provided that the following conditions
117− are met:
118−
119− - Redistributions of source code must retain the above copyright
120− notice, this list of conditions, and the following disclaimer.
121−
122− - Redistributions in binary form must reproduce the above copyright
123− notice, this list of conditions, and the following disclaimer in the
124− documentation and/or other materials provided with the distribution.
125−
126− - The names of the copyright holders may not be used to endorse or
127− promote products derived from this software without specific prior
128− written permission.
129−
130− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS "AS IS" AND ANY
131− EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
132− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
133− PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS BE
134− LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
135− CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
136− SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
137− BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
138− WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
139− OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
140− IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
141−
142−aeson LICENSE file:
143−
144− Copyright (c) 2011, MailRank, Inc.
145−
146− All rights reserved.
147−
148− Redistribution and use in source and binary forms, with or without
149− modification, are permitted provided that the following conditions
150− are met:
151−
152− 1. Redistributions of source code must retain the above copyright
153− notice, this list of conditions and the following disclaimer.
154−
155− 2. Redistributions in binary form must reproduce the above copyright
156− notice, this list of conditions and the following disclaimer in the
157− documentation and/or other materials provided with the distribution.
158−
159− 3. Neither the name of the author nor the names of his contributors
160− may be used to endorse or promote products derived from this software
161− without specific prior written permission.
162−
163− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
164− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
165− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
166− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
167− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
168− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
169− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
170− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
171− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
172− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
173− POSSIBILITY OF SUCH DAMAGE.
174−
175−aeson-better-errors LICENSE file:
176−
177− Copyright (c) 2015 Harry Garrood
178−
179− Permission is hereby granted, free of charge, to any person obtaining
180− a copy of this software and associated documentation files (the
181− "Software"), to deal in the Software without restriction, including
182− without limitation the rights to use, copy, modify, merge, publish,
183− distribute, sublicense, and/or sell copies of the Software, and to
184− permit persons to whom the Software is furnished to do so, subject to
185− the following conditions:
186−
187− The above copyright notice and this permission notice shall be included
188− in all copies or substantial portions of the Software.
189−
190− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
191− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
192− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
193− IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
194− CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
195− TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
196− SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
197−
198−ansi-terminal LICENSE file:
199−
200− Copyright (c) 2008, Maximilian Bolingbroke
201− All rights reserved.
202−
203− Redistribution and use in source and binary forms, with or without modification, are permitted
204− provided that the following conditions are met:
205−
206− * Redistributions of source code must retain the above copyright notice, this list of
207− conditions and the following disclaimer.
208− * Redistributions in binary form must reproduce the above copyright notice, this list of
209− conditions and the following disclaimer in the documentation and/or other materials
210− provided with the distribution.
211− * Neither the name of Maximilian Bolingbroke nor the names of other contributors may be used to
212− endorse or promote products derived from this software without specific prior written permission.
213−
214− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
215− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
216− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
217− CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
218− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
219− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
220− IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
221− OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
222−
223−ansi-wl-pprint LICENSE file:
224−
225− Copyright 2008, Daan Leijen and Max Bolingbroke. All rights reserved.
226−
227− Redistribution and use in source and binary forms, with or without
228− modification, are permitted provided that the following conditions are
229− met:
230−
2318 * Redistributions of source code must retain the above copyright
2329 notice, this list of conditions and the following disclaimer.
233−
234− * Redistributions in binary form must reproduce the above copyright
235− notice, this list of conditions and the following disclaimer in
236− the documentation and/or other materials provided with the
237− distribution.
238−
239− This software is provided by the copyright holders "as is" and any
240− express or implied warranties, including, but not limited to, the
241− implied warranties of merchantability and fitness for a particular
242− purpose are disclaimed. In no event shall the copyright holders be
243− liable for any direct, indirect, incidental, special, exemplary, or
244− consequential damages (including, but not limited to, procurement of
245− substitute goods or services; loss of use, data, or profits; or
246− business interruption) however caused and on any theory of liability,
247− whether in contract, strict liability, or tort (including negligence
248− or otherwise) arising in any way out of the use of this software, even
249− if advised of the possibility of such damage.
250−
251−array LICENSE file:
252−
253− This library (libraries/base) is derived from code from several
254− sources:
255−
256− * Code from the GHC project which is largely (c) The University of
257− Glasgow, and distributable under a BSD-style license (see below),
258−
259− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
260− and freely redistributable (but see the full license for
261− restrictions).
262−
263− * Code from the Haskell Foreign Function Interface specification,
264− which is (c) Manuel M. T. Chakravarty and freely redistributable
265− (but see the full license for restrictions).
266−
267− The full text of these licenses is reproduced below. All of the
268− licenses are BSD-style or compatible.
269−
270− -----------------------------------------------------------------------------
271−
272− The Glasgow Haskell Compiler License
273−
274− Copyright 2004, The University Court of the University of Glasgow.
275− All rights reserved.
276−
277− Redistribution and use in source and binary forms, with or without
278− modification, are permitted provided that the following conditions are met:
279−
280− - Redistributions of source code must retain the above copyright notice,
281− this list of conditions and the following disclaimer.
282−
283− - Redistributions in binary form must reproduce the above copyright notice,
284− this list of conditions and the following disclaimer in the documentation
285− and/or other materials provided with the distribution.
286−
287− - Neither name of the University nor the names of its contributors may be
288− used to endorse or promote products derived from this software without
289− specific prior written permission.
290−
291− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
292− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
293− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
294− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
295− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
296− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
297− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
298− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
299− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
300− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
301− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
302− DAMAGE.
303−
304− -----------------------------------------------------------------------------
305−
306− Code derived from the document "Report on the Programming Language
307− Haskell 98", is distributed under the following license:
308−
309− Copyright (c) 2002 Simon Peyton Jones
310−
311− The authors intend this Report to belong to the entire Haskell
312− community, and so we grant permission to copy and distribute it for
313− any purpose, provided that it is reproduced in its entirety,
314− including this Notice. Modified versions of this Report may also be
315− copied and distributed for any purpose, provided that the modified
316− version is clearly presented as such, and that it does not claim to
317− be a definition of the Haskell 98 Language.
318−
319− -----------------------------------------------------------------------------
320−
321− Code derived from the document "The Haskell 98 Foreign Function
322− Interface, An Addendum to the Haskell 98 Report" is distributed under
323− the following license:
324−
325− Copyright (c) 2002 Manuel M. T. Chakravarty
326−
327− The authors intend this Report to belong to the entire Haskell
328− community, and so we grant permission to copy and distribute it for
329− any purpose, provided that it is reproduced in its entirety,
330− including this Notice. Modified versions of this Report may also be
331− copied and distributed for any purpose, provided that the modified
332− version is clearly presented as such, and that it does not claim to
333− be a definition of the Haskell 98 Foreign Function Interface.
334−
335− -----------------------------------------------------------------------------
336−
337−attoparsec LICENSE file:
338−
339− Copyright (c) Lennart Kolmodin
340−
341− All rights reserved.
342−
343− Redistribution and use in source and binary forms, with or without
344− modification, are permitted provided that the following conditions
345− are met:
346−
347− 1. Redistributions of source code must retain the above copyright
348− notice, this list of conditions and the following disclaimer.
349−
350− 2. Redistributions in binary form must reproduce the above copyright
351− notice, this list of conditions and the following disclaimer in the
352− documentation and/or other materials provided with the distribution.
353−
354− 3. Neither the name of the author nor the names of his contributors
355− may be used to endorse or promote products derived from this software
356− without specific prior written permission.
357−
358− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
359− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
360− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
361− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
362− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
363− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
364− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
365− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
366− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
367− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
368− POSSIBILITY OF SUCH DAMAGE.
369−
370−base LICENSE file:
371−
372− This library (libraries/base) is derived from code from several
373− sources:
374−
375− * Code from the GHC project which is largely (c) The University of
376− Glasgow, and distributable under a BSD-style license (see below),
377−
378− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
379− and freely redistributable (but see the full license for
380− restrictions).
381−
382− * Code from the Haskell Foreign Function Interface specification,
383− which is (c) Manuel M. T. Chakravarty and freely redistributable
384− (but see the full license for restrictions).
385−
386− The full text of these licenses is reproduced below. All of the
387− licenses are BSD-style or compatible.
388−
389− -----------------------------------------------------------------------------
390−
391− The Glasgow Haskell Compiler License
392−
393− Copyright 2004, The University Court of the University of Glasgow.
394− All rights reserved.
395−
396− Redistribution and use in source and binary forms, with or without
397− modification, are permitted provided that the following conditions are met:
398−
399− - Redistributions of source code must retain the above copyright notice,
400− this list of conditions and the following disclaimer.
401−
402− - Redistributions in binary form must reproduce the above copyright notice,
403− this list of conditions and the following disclaimer in the documentation
404− and/or other materials provided with the distribution.
405−
406− - Neither name of the University nor the names of its contributors may be
407− used to endorse or promote products derived from this software without
408− specific prior written permission.
409−
410− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
411− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
412− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
413− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
414− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
415− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
416− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
417− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
418− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
419− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
420− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
421− DAMAGE.
422−
423− -----------------------------------------------------------------------------
424−
425− Code derived from the document "Report on the Programming Language
426− Haskell 98", is distributed under the following license:
427−
428− Copyright (c) 2002 Simon Peyton Jones
429−
430− The authors intend this Report to belong to the entire Haskell
431− community, and so we grant permission to copy and distribute it for
432− any purpose, provided that it is reproduced in its entirety,
433− including this Notice. Modified versions of this Report may also be
434− copied and distributed for any purpose, provided that the modified
435− version is clearly presented as such, and that it does not claim to
436− be a definition of the Haskell 98 Language.
437−
438− -----------------------------------------------------------------------------
439−
440− Code derived from the document "The Haskell 98 Foreign Function
441− Interface, An Addendum to the Haskell 98 Report" is distributed under
442− the following license:
443−
444− Copyright (c) 2002 Manuel M. T. Chakravarty
445−
446− The authors intend this Report to belong to the entire Haskell
447− community, and so we grant permission to copy and distribute it for
448− any purpose, provided that it is reproduced in its entirety,
449− including this Notice. Modified versions of this Report may also be
450− copied and distributed for any purpose, provided that the modified
451− version is clearly presented as such, and that it does not claim to
452− be a definition of the Haskell 98 Foreign Function Interface.
453−
454− -----------------------------------------------------------------------------
455−
456−binary LICENSE file:
457−
458− Copyright (c) Lennart Kolmodin
459−
460− All rights reserved.
461−
462− Redistribution and use in source and binary forms, with or without
463− modification, are permitted provided that the following conditions
464− are met:
465−
466− 1. Redistributions of source code must retain the above copyright
467− notice, this list of conditions and the following disclaimer.
468−
469− 2. Redistributions in binary form must reproduce the above copyright
470− notice, this list of conditions and the following disclaimer in the
471− documentation and/or other materials provided with the distribution.
472−
473− 3. Neither the name of the author nor the names of his contributors
474− may be used to endorse or promote products derived from this software
475− without specific prior written permission.
476−
477− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
478− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
479− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
480− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
481− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
482− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
483− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
484− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
485− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
486− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
487− POSSIBILITY OF SUCH DAMAGE.
488−
489−blaze-builder LICENSE file:
490−
491− Copyright Jasper Van der Jeugt 2010, Simon Meier 2010 & 2011
492−
493− All rights reserved.
494−
495− Redistribution and use in source and binary forms, with or without
496− modification, are permitted provided that the following conditions are met:
497−
498− * Redistributions of source code must retain the above copyright
499− notice, this list of conditions and the following disclaimer.
500−
501− * Redistributions in binary form must reproduce the above
502− copyright notice, this list of conditions and the following
503− disclaimer in the documentation and/or other materials provided
504− with the distribution.
505−
506− * Neither the name of Jasper Van der Jeugt nor the names of other
507− contributors may be used to endorse or promote products derived
508− from this software without specific prior written permission.
509−
510− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
511− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
512− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
513− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
514− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
515− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
516− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
517− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
518− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
519− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
520− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
521−
522−bower-json LICENSE file:
523−
524− Copyright (c) 2015 Harry Garrood
525−
526− Permission is hereby granted, free of charge, to any person obtaining
527− a copy of this software and associated documentation files (the
528− "Software"), to deal in the Software without restriction, including
529− without limitation the rights to use, copy, modify, merge, publish,
530− distribute, sublicense, and/or sell copies of the Software, and to
531− permit persons to whom the Software is furnished to do so, subject to
532− the following conditions:
533−
534− The above copyright notice and this permission notice shall be included
535− in all copies or substantial portions of the Software.
536−
537− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
538− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
539− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
540− IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
541− CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
542− TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
543− SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
544−
545−boxes LICENSE file:
546−
547− Copyright (c) Brent Yorgey 2008
548−
549− Redistribution and use in source and binary forms, with or without
550− modification, are permitted provided that the following conditions
551− are met:
552− 1. Redistributions of source code must retain the above copyright
553− notice, this list of conditions and the following disclaimer.
554− 2. Redistributions in binary form must reproduce the above copyright
555− notice, this list of conditions and the following disclaimer in the
556− documentation and/or other materials provided with the distribution.
557− 3. Neither the name of the author nor the names of other contributors
558− may be used to endorse or promote products derived from this software
559− without specific prior written permission.
560−
561− All other rights are reserved.
562−
563− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND
564− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
565− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
566− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
567− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
568− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
569− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
570− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
571− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
572− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
573− SUCH DAMAGE.
574−
575−bytestring LICENSE file:
576−
577− Copyright (c) Don Stewart 2005-2009
578− (c) Duncan Coutts 2006-2015
579− (c) David Roundy 2003-2005
580− (c) Simon Meier 2010-2011
581−
582− All rights reserved.
583−
584− Redistribution and use in source and binary forms, with or without
585− modification, are permitted provided that the following conditions
586− are met:
587− 1. Redistributions of source code must retain the above copyright
588− notice, this list of conditions and the following disclaimer.
589− 2. Redistributions in binary form must reproduce the above copyright
590− notice, this list of conditions and the following disclaimer in the
591− documentation and/or other materials provided with the distribution.
592− 3. Neither the name of the author nor the names of his contributors
593− may be used to endorse or promote products derived from this software
594− without specific prior written permission.
595−
596− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
597− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
598− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
599− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
600− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
601− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
602− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
603− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
604− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
605− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
606− SUCH DAMAGE.
607−
608−containers LICENSE file:
609−
610− The Glasgow Haskell Compiler License
611−
612− Copyright 2004, The University Court of the University of Glasgow.
613− All rights reserved.
614−
615− Redistribution and use in source and binary forms, with or without
616− modification, are permitted provided that the following conditions are met:
617−
618− - Redistributions of source code must retain the above copyright notice,
619− this list of conditions and the following disclaimer.
620−
621− - Redistributions in binary form must reproduce the above copyright notice,
622− this list of conditions and the following disclaimer in the documentation
623− and/or other materials provided with the distribution.
624−
625− - Neither name of the University nor the names of its contributors may be
626− used to endorse or promote products derived from this software without
627− specific prior written permission.
628−
629− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
630− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
631− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
632− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
633− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
634− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
635− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
636− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
637− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
638− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
639− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
640− DAMAGE.
641−
642−deepseq LICENSE file:
643−
644− This library (deepseq) is derived from code from the GHC project which
645− is largely (c) The University of Glasgow, and distributable under a
646− BSD-style license (see below).
647−
648− -----------------------------------------------------------------------------
649−
650− The Glasgow Haskell Compiler License
651−
652− Copyright 2001-2009, The University Court of the University of Glasgow.
653− All rights reserved.
654−
655− Redistribution and use in source and binary forms, with or without
656− modification, are permitted provided that the following conditions are met:
657−
658− - Redistributions of source code must retain the above copyright notice,
659− this list of conditions and the following disclaimer.
660−
661− - Redistributions in binary form must reproduce the above copyright notice,
662− this list of conditions and the following disclaimer in the documentation
663− and/or other materials provided with the distribution.
664−
665− - Neither name of the University nor the names of its contributors may be
666− used to endorse or promote products derived from this software without
667− specific prior written permission.
668−
669− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
670− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
671− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
672− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
673− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
674− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
675− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
676− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
677− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
678− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
679− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
680− DAMAGE.
681−
682− -----------------------------------------------------------------------------
683−
684−directory LICENSE file:
685−
686− This library (libraries/base) is derived from code from two
687− sources:
688−
689− * Code from the GHC project which is largely (c) The University of
690− Glasgow, and distributable under a BSD-style license (see below),
691−
692− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
693− and freely redistributable (but see the full license for
694− restrictions).
695−
696− The full text of these licenses is reproduced below. Both of the
697− licenses are BSD-style or compatible.
698−
699− -----------------------------------------------------------------------------
700−
701− The Glasgow Haskell Compiler License
702−
703− Copyright 2004, The University Court of the University of Glasgow.
704− All rights reserved.
705−
706− Redistribution and use in source and binary forms, with or without
707− modification, are permitted provided that the following conditions are met:
708−
709− - Redistributions of source code must retain the above copyright notice,
710− this list of conditions and the following disclaimer.
711−
712− - Redistributions in binary form must reproduce the above copyright notice,
713− this list of conditions and the following disclaimer in the documentation
714− and/or other materials provided with the distribution.
715−
716− - Neither name of the University nor the names of its contributors may be
717− used to endorse or promote products derived from this software without
718− specific prior written permission.
719−
720− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
721− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
722− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
723− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
724− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
725− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
726− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
727− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
728− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
729− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
730− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
731− DAMAGE.
732−
733− -----------------------------------------------------------------------------
734−
735− Code derived from the document "Report on the Programming Language
736− Haskell 98", is distributed under the following license:
737−
738− Copyright (c) 2002 Simon Peyton Jones
739−
740− The authors intend this Report to belong to the entire Haskell
741− community, and so we grant permission to copy and distribute it for
742− any purpose, provided that it is reproduced in its entirety,
743− including this Notice. Modified versions of this Report may also be
744− copied and distributed for any purpose, provided that the modified
745− version is clearly presented as such, and that it does not claim to
746− be a definition of the Haskell 98 Language.
747−
748− -----------------------------------------------------------------------------
749−
750−dlist LICENSE file:
751−
752− Copyright (c) 2006-2009 Don Stewart, 2013-2014 Sean Leather
753−
754− All rights reserved.
755−
756− Redistribution and use in source and binary forms, with or without
757− modification, are permitted provided that the following conditions are
758− met:
759−
760− * Redistributions of source code must retain the above copyright
761− notice, this list of conditions and the following disclaimer.
762−
763− * Redistributions in binary form must reproduce the above
764− copyright notice, this list of conditions and the following
765− disclaimer in the documentation and/or other materials provided
766− with the distribution.
767−
768− * Neither the name of Don Stewart nor the names of other
769− contributors may be used to endorse or promote products derived
770− from this software without specific prior written permission.
771−
772− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
773− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
774− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
775− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
776− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
777− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
778− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
779− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
780− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
781− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
782− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
783−
784−filepath LICENSE file:
785−
786− Copyright Neil Mitchell 2005-2015.
787− All rights reserved.
788−
789− Redistribution and use in source and binary forms, with or without
790− modification, are permitted provided that the following conditions are
791− met:
792−
793− * Redistributions of source code must retain the above copyright
794− notice, this list of conditions and the following disclaimer.
795−
796− * Redistributions in binary form must reproduce the above
797− copyright notice, this list of conditions and the following
798− disclaimer in the documentation and/or other materials provided
799− with the distribution.
800−
801− * Neither the name of Neil Mitchell nor the names of other
802− contributors may be used to endorse or promote products derived
803− from this software without specific prior written permission.
804−
805− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
806− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
807− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
808− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
809− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
810− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
811− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
812− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
813− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
814− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
815− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
816−
817−ghc-prim LICENSE file:
818−
819− This library (libraries/ghc-prim) is derived from code from several
820− sources:
821−
822− * Code from the GHC project which is largely (c) The University of
823− Glasgow, and distributable under a BSD-style license (see below),
824−
825− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
826− and freely redistributable (but see the full license for
827− restrictions).
828−
829− The full text of these licenses is reproduced below. All of the
830− licenses are BSD-style or compatible.
831−
832− -----------------------------------------------------------------------------
833−
834− The Glasgow Haskell Compiler License
835−
836− Copyright 2004, The University Court of the University of Glasgow.
837− All rights reserved.
838−
839− Redistribution and use in source and binary forms, with or without
840− modification, are permitted provided that the following conditions are met:
841−
842− - Redistributions of source code must retain the above copyright notice,
843− this list of conditions and the following disclaimer.
844−
845− - Redistributions in binary form must reproduce the above copyright notice,
846− this list of conditions and the following disclaimer in the documentation
847− and/or other materials provided with the distribution.
848−
849− - Neither name of the University nor the names of its contributors may be
850− used to endorse or promote products derived from this software without
851− specific prior written permission.
852−
853− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
854− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
855− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
856− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
857− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
858− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
859− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
860− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
861− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
862− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
863− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
864− DAMAGE.
865−
866− -----------------------------------------------------------------------------
867−
868− Code derived from the document "Report on the Programming Language
869− Haskell 98", is distributed under the following license:
870−
871− Copyright (c) 2002 Simon Peyton Jones
872−
873− The authors intend this Report to belong to the entire Haskell
874− community, and so we grant permission to copy and distribute it for
875− any purpose, provided that it is reproduced in its entirety,
876− including this Notice. Modified versions of this Report may also be
877− copied and distributed for any purpose, provided that the modified
878− version is clearly presented as such, and that it does not claim to
879− be a definition of the Haskell 98 Language.
880−
881−
882−hashable LICENSE file:
883−
884− Copyright Milan Straka 2010
885−
886− All rights reserved.
887−
888− Redistribution and use in source and binary forms, with or without
889− modification, are permitted provided that the following conditions are met:
890−
891− * Redistributions of source code must retain the above copyright
892− notice, this list of conditions and the following disclaimer.
893−
894− * Redistributions in binary form must reproduce the above
895− copyright notice, this list of conditions and the following
896− disclaimer in the documentation and/or other materials provided
897− with the distribution.
898−
899− * Neither the name of Milan Straka nor the names of other
900− contributors may be used to endorse or promote products derived
901− from this software without specific prior written permission.
902−
903− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
904− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
905− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
906− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
907− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
908− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
909− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
910− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
911− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
912− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
913− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
914−
915−haskeline LICENSE file:
916−
917− Copyright 2007-2009, Judah Jacobson.
918− All Rights Reserved.
919−
920− Redistribution and use in source and binary forms, with or without
921− modification, are permitted provided that the following conditions are met:
922−
923− - Redistribution of source code must retain the above copyright notice,
924− this list of conditions and the following disclaimer.
925−
926− - Redistribution in binary form must reproduce the above copyright notice,
927− this list of conditions and the following disclaimer in the documentation
928− and/or other materials provided with the distribution.
929−
930− THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY
931− EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
932− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
933− DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR THE CONTRIBUTORS BE LIABLE
934− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
935− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
936− SERVICES; LOSS OF USE, DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
937− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
938− OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
939− USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
940−
941−integer-gmp LICENSE file:
942−
943− Copyright (c) 2014, Herbert Valerio Riedel
944−
945− All rights reserved.
946−
947− Redistribution and use in source and binary forms, with or without
948− modification, are permitted provided that the following conditions are met:
949−
950− * Redistributions of source code must retain the above copyright
951− notice, this list of conditions and the following disclaimer.
952−
953− * Redistributions in binary form must reproduce the above
954− copyright notice, this list of conditions and the following
955− disclaimer in the documentation and/or other materials provided
956− with the distribution.
957−
958− * Neither the name of Herbert Valerio Riedel nor the names of other
959− contributors may be used to endorse or promote products derived
960− from this software without specific prior written permission.
961−
962− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
963− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
964− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
965− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
966− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
967− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
968− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
969− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
970− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
971− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
972− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
973−
974−language-javascript LICENSE file:
975−
976− Copyright (c)2010, Alan Zimmerman
977−
978− All rights reserved.
979−
980− Redistribution and use in source and binary forms, with or without
981− modification, are permitted provided that the following conditions are met:
982−
983− * Redistributions of source code must retain the above copyright
984− notice, this list of conditions and the following disclaimer.
985−
986− * Redistributions in binary form must reproduce the above
987− copyright notice, this list of conditions and the following
988− disclaimer in the documentation and/or other materials provided
989− with the distribution.
990−
991− * Neither the name of Alan Zimmerman nor the names of other
992− contributors may be used to endorse or promote products derived
993− from this software without specific prior written permission.
994−
995− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
996− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
997− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
998− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
999− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1000− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1001− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1002− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1003− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1004− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1005− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1006−
1007−lifted-base LICENSE file:
1008−
1009− Copyright © 2010-2012, Bas van Dijk, Anders Kaseorg
1010− All rights reserved.
1011−
1012− Redistribution and use in source and binary forms, with or without
1013− modification, are permitted provided that the following conditions are
1014− met:
1015−
1016− • Redistributions of source code must retain the above copyright
1017− notice, this list of conditions and the following disclaimer.
1018−
1019− • Redistributions in binary form must reproduce the above copyright
1020− notice, this list of conditions and the following disclaimer in the
1021− documentation and/or other materials provided with the distribution.
1022−
1023− • Neither the name of the author nor the names of other contributors
1024− may be used to endorse or promote products derived from this
1025− software without specific prior written permission.
1026−
1027− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1028− “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1029− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1030− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1031− HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1032− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1033− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1034− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1035− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1036− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1037− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1038−
1039−monad-control LICENSE file:
1040−
1041− Copyright © 2010, Bas van Dijk, Anders Kaseorg
1042− All rights reserved.
1043−
1044− Redistribution and use in source and binary forms, with or without
1045− modification, are permitted provided that the following conditions are
1046− met:
1047−
1048− • Redistributions of source code must retain the above copyright
1049− notice, this list of conditions and the following disclaimer.
1050−
1051− • Redistributions in binary form must reproduce the above copyright
1052− notice, this list of conditions and the following disclaimer in the
1053− documentation and/or other materials provided with the distribution.
1054−
1055− • Neither the name of the author nor the names of other contributors
1056− may be used to endorse or promote products derived from this
1057− software without specific prior written permission.
1058−
1059− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1060− “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1061− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1062− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1063− HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1064− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1065− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1066− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1067− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1068− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1069− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1070−
1071−mtl LICENSE file:
1072−
1073− The Glasgow Haskell Compiler License
1074−
1075− Copyright 2004, The University Court of the University of Glasgow.
1076− All rights reserved.
1077−
1078− Redistribution and use in source and binary forms, with or without
1079− modification, are permitted provided that the following conditions are met:
1080−
1081− - Redistributions of source code must retain the above copyright notice,
1082− this list of conditions and the following disclaimer.
1083−
1084− - Redistributions in binary form must reproduce the above copyright notice,
1085− this list of conditions and the following disclaimer in the documentation
1086− and/or other materials provided with the distribution.
1087−
1088− - Neither name of the University nor the names of its contributors may be
1089− used to endorse or promote products derived from this software without
1090− specific prior written permission.
1091−
1092− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1093− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1094− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1095− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1096− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1097− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1098− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1099− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1100− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1101− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1102− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1103− DAMAGE.
1104−
1105−nats LICENSE file:
1106−
1107− Copyright 2011-2014 Edward Kmett
1108−
1109− All rights reserved.
1110−
1111− Redistribution and use in source and binary forms, with or without
1112− modification, are permitted provided that the following conditions
1113− are met:
1114−
1115− 1. Redistributions of source code must retain the above copyright
1116− notice, this list of conditions and the following disclaimer.
1117−
1118− 2. Redistributions in binary form must reproduce the above copyright
1119− notice, this list of conditions and the following disclaimer in the
1120− documentation and/or other materials provided with the distribution.
1121−
1122− 3. Neither the name of the author nor the names of his contributors
1123− may be used to endorse or promote products derived from this software
1124− without specific prior written permission.
1125−
1126− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1127− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1128− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1129− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1130− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1131− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1132− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1133− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1134− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1135− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1136− POSSIBILITY OF SUCH DAMAGE.
1137−
1138−optparse-applicative LICENSE file:
1139−
1140− Copyright (c) 2012, Paolo Capriotti
1141−
1142− All rights reserved.
1143−
1144− Redistribution and use in source and binary forms, with or without
1145− modification, are permitted provided that the following conditions are met:
1146−
1147− * Redistributions of source code must retain the above copyright
1148− notice, this list of conditions and the following disclaimer.
1149−
1150− * Redistributions in binary form must reproduce the above
1151− copyright notice, this list of conditions and the following
1152− disclaimer in the documentation and/or other materials provided
1153− with the distribution.
1154−
1155− * Neither the name of Paolo Capriotti nor the names of other
1156− contributors may be used to endorse or promote products derived
1157− from this software without specific prior written permission.
1158−
1159− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1160− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1161− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1162− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1163− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1164− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1165− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1166− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1167− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1168− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1169− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1170−
1171−parsec LICENSE file:
1172−
1173− Copyright 1999-2000, Daan Leijen; 2007, Paolo Martini. All rights reserved.
1174−
1175− Redistribution and use in source and binary forms, with or without
1176− modification, are permitted provided that the following conditions are met:
1177−
1178− * Redistributions of source code must retain the above copyright notice,
1179− this list of conditions and the following disclaimer.
1180− * Redistributions in binary form must reproduce the above copyright
1181− notice, this list of conditions and the following disclaimer in the
1182− documentation and/or other materials provided with the distribution.
1183−
1184− This software is provided by the copyright holders "as is" and any express or
1185− implied warranties, including, but not limited to, the implied warranties of
1186− merchantability and fitness for a particular purpose are disclaimed. In no
1187− event shall the copyright holders be liable for any direct, indirect,
1188− incidental, special, exemplary, or consequential damages (including, but not
1189− limited to, procurement of substitute goods or services; loss of use, data,
1190− or profits; or business interruption) however caused and on any theory of
1191− liability, whether in contract, strict liability, or tort (including
1192− negligence or otherwise) arising in any way out of the use of this software,
1193− even if advised of the possibility of such damage.
1194−
1195−pattern-arrows LICENSE file:
1196−
1197− The MIT License (MIT)
1198−
1199− Copyright (c) 2013 Phil Freeman
1200−
1201− Permission is hereby granted, free of charge, to any person obtaining a copy of
1202− this software and associated documentation files (the "Software"), to deal in
1203− the Software without restriction, including without limitation the rights to
1204− use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
1205− the Software, and to permit persons to whom the Software is furnished to do so,
1206− subject to the following conditions:
1207−
1208− The above copyright notice and this permission notice shall be included in all
1209− copies or substantial portions of the Software.
1210−
1211− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
1212− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
1213− FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
1214− COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
1215− IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
1216− CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1217−
1218−pretty LICENSE file:
1219−
1220− This library (libraries/pretty) is derived from code from
1221− the GHC project which is largely (c) The University of
1222− Glasgow, and distributable under a BSD-style license (see below).
1223−
1224− -----------------------------------------------------------------------------
1225−
1226− The Glasgow Haskell Compiler License
1227−
1228− Copyright 2004, The University Court of the University of Glasgow.
1229− All rights reserved.
1230−
1231− Redistribution and use in source and binary forms, with or without
1232− modification, are permitted provided that the following conditions are met:
1233−
1234− - Redistributions of source code must retain the above copyright notice,
1235− this list of conditions and the following disclaimer.
1236−
1237− - Redistributions in binary form must reproduce the above copyright notice,
1238− this list of conditions and the following disclaimer in the documentation
1239− and/or other materials provided with the distribution.
1240−
1241− - Neither name of the University nor the names of its contributors may be
1242− used to endorse or promote products derived from this software without
1243− specific prior written permission.
1244−
1245− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1246− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1247− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1248− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1249− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1250− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1251− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1252− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1253− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1254− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1255− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1256− DAMAGE.
1257−
1258− -----------------------------------------------------------------------------
1259−
1260−primitive LICENSE file:
1261−
1262− Copyright (c) 2008-2009, Roman Leshchinskiy
1263− All rights reserved.
1264−
1265− Redistribution and use in source and binary forms, with or without
1266− modification, are permitted provided that the following conditions are met:
1267−
1268− - Redistributions of source code must retain the above copyright notice,
1269− this list of conditions and the following disclaimer.
1270−
1271− - Redistributions in binary form must reproduce the above copyright notice,
1272− this list of conditions and the following disclaimer in the documentation
1273− and/or other materials provided with the distribution.
1274−
1275− - Neither name of the University nor the names of its contributors may be
1276− used to endorse or promote products derived from this software without
1277− specific prior written permission.
1278−
1279− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1280− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1281− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1282− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1283− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1284− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1285− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1286− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1287− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1288− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1289− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1290− DAMAGE.
1291−
1292−
1293−process LICENSE file:
1294−
1295− This library (libraries/process) is derived from code from two
1296− sources:
1297−
1298− * Code from the GHC project which is largely (c) The University of
1299− Glasgow, and distributable under a BSD-style license (see below),
1300−
1301− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
1302− and freely redistributable (but see the full license for
1303− restrictions).
1304−
1305− The full text of these licenses is reproduced below. Both of the
1306− licenses are BSD-style or compatible.
1307−
1308− -----------------------------------------------------------------------------
1309−
1310− The Glasgow Haskell Compiler License
1311−
1312− Copyright 2004, The University Court of the University of Glasgow.
1313− All rights reserved.
1314−
1315− Redistribution and use in source and binary forms, with or without
1316− modification, are permitted provided that the following conditions are met:
1317−
1318− - Redistributions of source code must retain the above copyright notice,
1319− this list of conditions and the following disclaimer.
1320−
1321− - Redistributions in binary form must reproduce the above copyright notice,
1322− this list of conditions and the following disclaimer in the documentation
1323− and/or other materials provided with the distribution.
1324−
1325− - Neither name of the University nor the names of its contributors may be
1326− used to endorse or promote products derived from this software without
1327− specific prior written permission.
1328−
1329− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1330− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1331− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1332− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1333− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1334− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1335− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1336− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1337− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1338− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1339− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1340− DAMAGE.
1341−
1342− -----------------------------------------------------------------------------
1343−
1344− Code derived from the document "Report on the Programming Language
1345− Haskell 98", is distributed under the following license:
1346−
1347− Copyright (c) 2002 Simon Peyton Jones
1348−
1349− The authors intend this Report to belong to the entire Haskell
1350− community, and so we grant permission to copy and distribute it for
1351− any purpose, provided that it is reproduced in its entirety,
1352− including this Notice. Modified versions of this Report may also be
1353− copied and distributed for any purpose, provided that the modified
1354− version is clearly presented as such, and that it does not claim to
1355− be a definition of the Haskell 98 Language.
1356−
1357− -----------------------------------------------------------------------------
1358−
1359−rts LICENSE file:
1360−
1361− Package not found: No such package in package index
1362−
1363−safe LICENSE file:
1364−
1365− Copyright Neil Mitchell 2007-2015.
1366− All rights reserved.
1367−
1368− Redistribution and use in source and binary forms, with or without
1369− modification, are permitted provided that the following conditions are
1370− met:
1371−
1372− * Redistributions of source code must retain the above copyright
1373− notice, this list of conditions and the following disclaimer.
1374−
1375− * Redistributions in binary form must reproduce the above
1376− copyright notice, this list of conditions and the following
1377− disclaimer in the documentation and/or other materials provided
1378− with the distribution.
1379−
1380− * Neither the name of Neil Mitchell nor the names of other
1381− contributors may be used to endorse or promote products derived
1382− from this software without specific prior written permission.
1383−
1384− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1385− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1386− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1387− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1388− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1389− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1390− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1391− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1392− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1393− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1394− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1395−
1396−scientific LICENSE file:
1397−
1398− Copyright (c) 2013, Bas van Dijk
1399−
1400− All rights reserved.
1401−
1402− Redistribution and use in source and binary forms, with or without
1403− modification, are permitted provided that the following conditions are met:
1404−
1405− * Redistributions of source code must retain the above copyright
1406− notice, this list of conditions and the following disclaimer.
1407−
1408− * Redistributions in binary form must reproduce the above
1409− copyright notice, this list of conditions and the following
1410− disclaimer in the documentation and/or other materials provided
1411− with the distribution.
1412−
1413− * Neither the name of Bas van Dijk nor the names of other
1414− contributors may be used to endorse or promote products derived
1415− from this software without specific prior written permission.
1416−
1417− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1418− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1419− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1420− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1421− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1422− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1423− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1424− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1425− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1426− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1427− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1428−
1429−semigroups LICENSE file:
1430−
1431− Copyright 2011-2015 Edward Kmett
1432−
1433− All rights reserved.
1434−
1435− Redistribution and use in source and binary forms, with or without
1436− modification, are permitted provided that the following conditions
1437− are met:
1438−
1439− 1. Redistributions of source code must retain the above copyright
1440− notice, this list of conditions and the following disclaimer.
1441−
1442− 2. Redistributions in binary form must reproduce the above copyright
1443− notice, this list of conditions and the following disclaimer in the
1444− documentation and/or other materials provided with the distribution.
1445−
1446− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1447− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1448− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1449− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1450− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1451− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1452− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1453− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1454− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1455− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1456− POSSIBILITY OF SUCH DAMAGE.
1457−
1458−split LICENSE file:
1459−
1460− Copyright (c) 2008 Brent Yorgey, Louis Wasserman
1461−
1462− All rights reserved.
1463−
1464− Redistribution and use in source and binary forms, with or without
1465− modification, are permitted provided that the following conditions
1466− are met:
1467− 1. Redistributions of source code must retain the above copyright
1468− notice, this list of conditions and the following disclaimer.
1469− 2. Redistributions in binary form must reproduce the above copyright
1470− notice, this list of conditions and the following disclaimer in the
1471− documentation and/or other materials provided with the distribution.
1472− 3. Neither the name of the author nor the names of other contributors
1473− may be used to endorse or promote products derived from this software
1474− without specific prior written permission.
1475−
1476− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND
1477− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1478− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1479− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1480− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1481− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1482− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1483− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1484− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1485− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1486− SUCH DAMAGE.
1487−
1488−stm LICENSE file:
1489−
1490− The Glasgow Haskell Compiler License
1491−
1492− Copyright 2004, The University Court of the University of Glasgow.
1493− All rights reserved.
1494−
1495− Redistribution and use in source and binary forms, with or without
1496− modification, are permitted provided that the following conditions are met:
1497−
1498− - Redistributions of source code must retain the above copyright notice,
1499− this list of conditions and the following disclaimer.
1500−
1501− - Redistributions in binary form must reproduce the above copyright notice,
1502− this list of conditions and the following disclaimer in the documentation
1503− and/or other materials provided with the distribution.
1504−
1505− - Neither name of the University nor the names of its contributors may be
1506− used to endorse or promote products derived from this software without
1507− specific prior written permission.
1508−
1509− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1510− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1511− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1512− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1513− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1514− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1515− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1516− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1517− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1518− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1519− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1520− DAMAGE.
1521−
1522−syb LICENSE file:
1523−
1524− This library (libraries/syb) is derived from code from several
1525− sources:
1526−
1527− * Code from the GHC project which is largely (c) The University of
1528− Glasgow, and distributable under a BSD-style license (see below),
1529−
1530− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
1531− and freely redistributable (but see the full license for
1532− restrictions).
1533−
1534− * Code from the Haskell Foreign Function Interface specification,
1535− which is (c) Manuel M. T. Chakravarty and freely redistributable
1536− (but see the full license for restrictions).
1537−
1538− The full text of these licenses is reproduced below. All of the
1539− licenses are BSD-style or compatible.
1540−
1541− -----------------------------------------------------------------------------
1542−
1543− The Glasgow Haskell Compiler License
1544−
1545− Copyright 2004, The University Court of the University of Glasgow.
1546− All rights reserved.
1547−
1548− Redistribution and use in source and binary forms, with or without
1549− modification, are permitted provided that the following conditions are met:
1550−
1551− - Redistributions of source code must retain the above copyright notice,
1552− this list of conditions and the following disclaimer.
1553−
1554− - Redistributions in binary form must reproduce the above copyright notice,
1555− this list of conditions and the following disclaimer in the documentation
1556− and/or other materials provided with the distribution.
1557−
1558− - Neither name of the University nor the names of its contributors may be
1559− used to endorse or promote products derived from this software without
1560− specific prior written permission.
1561−
1562− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1563− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1564− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1565− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1566− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1567− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1568− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1569− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1570− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1571− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1572− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1573− DAMAGE.
1574−
1575− -----------------------------------------------------------------------------
1576−
1577− Code derived from the document "Report on the Programming Language
1578− Haskell 98", is distributed under the following license:
1579−
1580− Copyright (c) 2002 Simon Peyton Jones
1581−
1582− The authors intend this Report to belong to the entire Haskell
1583− community, and so we grant permission to copy and distribute it for
1584− any purpose, provided that it is reproduced in its entirety,
1585− including this Notice. Modified versions of this Report may also be
1586− copied and distributed for any purpose, provided that the modified
1587− version is clearly presented as such, and that it does not claim to
1588− be a definition of the Haskell 98 Language.
1589−
1590− -----------------------------------------------------------------------------
1591−
1592− Code derived from the document "The Haskell 98 Foreign Function
1593− Interface, An Addendum to the Haskell 98 Report" is distributed under
1594− the following license:
1595−
1596− Copyright (c) 2002 Manuel M. T. Chakravarty
1597−
1598− The authors intend this Report to belong to the entire Haskell
1599− community, and so we grant permission to copy and distribute it for
1600− any purpose, provided that it is reproduced in its entirety,
1601− including this Notice. Modified versions of this Report may also be
1602− copied and distributed for any purpose, provided that the modified
1603− version is clearly presented as such, and that it does not claim to
1604− be a definition of the Haskell 98 Foreign Function Interface.
1605−
1606− -----------------------------------------------------------------------------
1607−
1608−template-haskell LICENSE file:
1609−
1610−
1611− The Glasgow Haskell Compiler License
1612−
1613− Copyright 2002-2007, The University Court of the University of Glasgow.
1614− All rights reserved.
1615−
1616− Redistribution and use in source and binary forms, with or without
1617− modification, are permitted provided that the following conditions are met:
1618−
1619− - Redistributions of source code must retain the above copyright notice,
1620− this list of conditions and the following disclaimer.
1621−
1622− - Redistributions in binary form must reproduce the above copyright notice,
1623− this list of conditions and the following disclaimer in the documentation
1624− and/or other materials provided with the distribution.
1625−
1626− - Neither name of the University nor the names of its contributors may be
1627− used to endorse or promote products derived from this software without
1628− specific prior written permission.
1629−
1630− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1631− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1632− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1633− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1634− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1635− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1636− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1637− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1638− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1639− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1640− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1641− DAMAGE.
1642−
1643−
1644−terminfo LICENSE file:
1645−
1646− Copyright 2007, Judah Jacobson.
1647− All Rights Reserved.
1648−
1649− Redistribution and use in source and binary forms, with or without
1650− modification, are permitted provided that the following conditions are met:
1651−
1652− - Redistribution of source code must retain the above copyright notice,
1653− this list of conditions and the following disclamer.
1654−
1655− - Redistribution in binary form must reproduce the above copyright notice,
1656− this list of conditions and the following disclamer in the documentation
1657− and/or other materials provided with the distribution.
1658−
1659− THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY
1660− EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1661− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1662− DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR THE CONTRIBUTORS BE LIABLE
1663− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1664− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1665− SERVICES; LOSS OF USE, DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1666− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
1667− OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
1668− USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1669−
1670−text LICENSE file:
1671−
1672− Copyright (c) 2008-2009, Tom Harper
1673− All rights reserved.
1674−
1675− Redistribution and use in source and binary forms, with or without
1676− modification, are permitted provided that the following conditions
1677− are met:
1678−
1679− * Redistributions of source code must retain the above copyright
1680− notice, this list of conditions and the following disclaimer.
1681−
1682− * Redistributions in binary form must reproduce the above
1683− copyright notice, this list of conditions and the following
1684− disclaimer in the documentation and/or other materials provided
1685− with the distribution.
1686−
1687− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1688− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1689− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1690− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1691− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1692− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1693− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1694− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1695− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1696− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1697− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1698−
1699−time LICENSE file:
1700−
1701− TimeLib is Copyright (c) Ashley Yakeley, 2004-2014. All rights reserved.
1702− Certain sections are Copyright 2004, The University Court of the University of Glasgow. All rights reserved.
1703−
1704− Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1705−
1706− - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
1707−
1708− - Neither name of the copyright holders nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
1709−
1710− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1711−
1712−transformers LICENSE file:
1713−
1714− The Glasgow Haskell Compiler License
1715−
1716− Copyright 2004, The University Court of the University of Glasgow.
1717− All rights reserved.
1718−
1719− Redistribution and use in source and binary forms, with or without
1720− modification, are permitted provided that the following conditions are met:
1721−
1722− - Redistributions of source code must retain the above copyright notice,
1723− this list of conditions and the following disclaimer.
1724−
1725− - Redistributions in binary form must reproduce the above copyright notice,
1726− this list of conditions and the following disclaimer in the documentation
1727− and/or other materials provided with the distribution.
1728−
1729− - Neither name of the University nor the names of its contributors may be
1730− used to endorse or promote products derived from this software without
1731− specific prior written permission.
1732−
1733− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1734− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1735− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1736− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1737− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1738− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1739− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1740− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1741− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1742− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1743− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1744− DAMAGE.
1745−
1746−transformers-base LICENSE file:
1747−
1748− Copyright (c) 2011, Mikhail Vorozhtsov, Bas van Dijk
1749− All rights reserved.
1750−
1751− Redistribution and use in source and binary forms, with or without
1752− modification, are permitted provided that the following conditions are met:
1753−
1754− - Redistributions of source code must retain the above copyright notice,
1755− this list of conditions and the following disclaimer.
1756− - Redistributions in binary form must reproduce the above copyright
1757− notice, this list of conditions and the following disclaimer in the
1758− documentation and/or other materials provided with the distribution.
1759− - Neither the names of the copyright owners nor the names of the
1760− contributors may be used to endorse or promote products derived
1761− from this software without specific prior written permission.
1762−
1763− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1764− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1765− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1766− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1767− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1768− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1769− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1770− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1771− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1772− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1773− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1774−
1775−
1776−transformers-compat LICENSE file:
1777−
1778− Copyright 2012 Edward Kmett
1779−
1780− All rights reserved.
1781−
1782− Redistribution and use in source and binary forms, with or without
1783− modification, are permitted provided that the following conditions
1784− are met:
1785−
1786− 1. Redistributions of source code must retain the above copyright
1787− notice, this list of conditions and the following disclaimer.
1788−
1789− 2. Redistributions in binary form must reproduce the above copyright
1790− notice, this list of conditions and the following disclaimer in the
1791− documentation and/or other materials provided with the distribution.
1792−
1793− 3. Neither the name of the author nor the names of his contributors
1794− may be used to endorse or promote products derived from this software
1795− without specific prior written permission.
1796−
1797− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1798− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1799− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1800− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1801− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1802− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1803− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1804− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1805− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1806− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1807− POSSIBILITY OF SUCH DAMAGE.
1808−
1809−unix LICENSE file:
1810−
1811− The Glasgow Haskell Compiler License
1812−
1813− Copyright 2004, The University Court of the University of Glasgow.
1814− All rights reserved.
1815−
1816− Redistribution and use in source and binary forms, with or without
1817− modification, are permitted provided that the following conditions are met:
1818−
1819− - Redistributions of source code must retain the above copyright notice,
1820− this list of conditions and the following disclaimer.
1821−
1822− - Redistributions in binary form must reproduce the above copyright notice,
1823− this list of conditions and the following disclaimer in the documentation
1824− and/or other materials provided with the distribution.
1825−
1826− - Neither name of the University nor the names of its contributors may be
1827− used to endorse or promote products derived from this software without
1828− specific prior written permission.
1829−
1830− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1831− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1832− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1833− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1834− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1835− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1836− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1837− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1838− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1839− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1840− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1841− DAMAGE.
1842−
1843−unordered-containers LICENSE file:
1844−
1845− Copyright (c) 2010, Johan Tibell
1846−
1847− All rights reserved.
1848−
1849− Redistribution and use in source and binary forms, with or without
1850− modification, are permitted provided that the following conditions are met:
1851−
1852− * Redistributions of source code must retain the above copyright
1853− notice, this list of conditions and the following disclaimer.
1854−
1855− * Redistributions in binary form must reproduce the above
1856− copyright notice, this list of conditions and the following
1857− disclaimer in the documentation and/or other materials provided
1858− with the distribution.
1859−
1860− * Neither the name of Johan Tibell nor the names of other
1861− contributors may be used to endorse or promote products derived
1862− from this software without specific prior written permission.
1863−
1864− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1865− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1866− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1867− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1868− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1869− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1870− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1871− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1872− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1873− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1874− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1875−
1876−utf8-string LICENSE file:
1877−
1878− * Copyright (c) 2007, Galois Inc.
1879− * All rights reserved.
1880− *
1881− * Redistribution and use in source and binary forms, with or without
1882− * modification, are permitted provided that the following conditions are met:
1883− * * Redistributions of source code must retain the above copyright
1884− * notice, this list of conditions and the following disclaimer.
1885− * * Redistributions in binary form must reproduce the above copyright
1886− * notice, this list of conditions and the following disclaimer in the
1887− * documentation and/or other materials provided with the distribution.
1888− * * Neither the name of Galois Inc. nor the
1889− * names of its contributors may be used to endorse or promote products
1890− * derived from this software without specific prior written permission.
1891− *
1892− * THIS SOFTWARE IS PROVIDED BY Galois Inc. ``AS IS'' AND ANY
1893− * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1894− * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1895− * DISCLAIMED. IN NO EVENT SHALL Galois Inc. BE LIABLE FOR ANY
1896− * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
1897− * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
1898− * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
1899− * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1900− * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
1901− * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1902−
1903−vector LICENSE file:
1904−
1905− Copyright (c) 2008-2012, Roman Leshchinskiy
1906− All rights reserved.
1907−
1908− Redistribution and use in source and binary forms, with or without
1909− modification, are permitted provided that the following conditions are met:
1910−
1911− - Redistributions of source code must retain the above copyright notice,
1912− this list of conditions and the following disclaimer.
1913−
1914− - Redistributions in binary form must reproduce the above copyright notice,
1915− this list of conditions and the following disclaimer in the documentation
1916− and/or other materials provided with the distribution.
1917−
1918− - Neither name of the University nor the names of its contributors may be
1919− used to endorse or promote products derived from this software without
1920− specific prior written permission.
1921−
1922− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1923− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1924− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1925− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1926− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1927− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1928− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1929− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1930− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1931− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1932− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1933− DAMAGE.
1934−
1935−
1936−void LICENSE file:
1937−
1938− Copyright 2015 Edward Kmett
1939−
1940− All rights reserved.
1941−
1942− Redistribution and use in source and binary forms, with or without
1943− modification, are permitted provided that the following conditions
1944− are met:
1945−
1946− 1. Redistributions of source code must retain the above copyright
1947− notice, this list of conditions and the following disclaimer.
1948−
1949− 2. Redistributions in binary form must reproduce the above copyright
1950− notice, this list of conditions and the following disclaimer in the
1951− documentation and/or other materials provided with the distribution.
1952−
1953− 3. Neither the name of the author nor the names of his contributors
1954− may be used to endorse or promote products derived from this software
1955− without specific prior written permission.
1956−
1957− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1958− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1959− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1960− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1961− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1962− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1963− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1964− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1965− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1966− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1967− POSSIBILITY OF SUCH DAMAGE.
196810
11+ * Redistributions in binary form must reproduce the above
12+ copyright notice, this list of conditions and the following
13+ disclaimer in the documentation and/or other materials provided
14+ with the distribution.
15+
16+ * Neither the name of Author name here nor the names of other
17+ contributors may be used to endorse or promote products derived
18+ from this software without specific prior written permission.
19+
20+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
23+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
24+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
25+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
26+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
30+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
README-go.mdnew file+48
@@ -0,0 +1,48 @@
1+
2+### psgo
3+
4+#### Performance
5+
6+* No runtime system beyond some support types and functions
7+* Uses PureScript's normal tail call optimization techniques for generated Go code
8+
9+#### Differences from PureScript:
10+
11+* Foreign imports/exports are Go instead of JavaScript – see [standard library foreign implementations](https://github.com/andyarvanitis/purescript-native-go-ffi)
12+* No Go-specific REPL
13+
14+#### Other notes:
15+
16+* The provided `Any` type is just an alias for `interface{}`
17+* PureScript types are represented in Go with:
18+
19+ | PureScript | Go |
20+ |------------|----|
21+ |`Array` | `[]Any`|
22+ |`String` | `string`|
23+ |`Number` | `float64`|
24+ |`Int` | `int`|
25+ |`Char` | `string` (single UTF-8 entity)|
26+ |`Boolean` | `bool`|
27+ |Records | `map[string]Any`|
28+
29+#### Future ideas:
30+
31+* Nice facilities (modules) for concurrency/parallelism, using goroutines
32+
33+
34+#### Getting Started
35+This assumes you are running macOS (OS X) or a Unix-like system (Linux, *BSD, etc.).
36+
37+1. Choose a working directory wherever you like. Then create a `src` subdirectory under it, which will be where you will place your own PureScript source files.
38+
39+1. Initialize your project with `spago init`, and install any dependencies with `spago install` (please see their instructions if you haven't used it before).
40+
41+1. Add the `backend = "psgo"` option to your `spago.dhall` file. That way `spago` will use the psgo backend when compiling.
42+
43+1. You should now be ready to build a PureScript program:
44+ * As stated above, place your source file(s) in the working directory's `src` subdirectory and execute `spago build`.
45+
46+ * This will generate the Go source tree for your program and then build an executable binary. The resulting executable will be in your working directory and will be named `Main`. The generated source files will be under `output/`.
47+
48+---
README.md+32−19
@@ -1,28 +1,41 @@
1−[![PureScript](logo.png)](http://purescript.org)
1+[![PureScript](https://raw.githubusercontent.com/purescript/purescript/master/logo.png)](http://purescript.org)
22
3−A small strongly typed programming language with expressive types that compiles to Javascript, written in and inspired by Haskell.
3+This is a platform-native compiler backend for [PureScript](https://github.com/purescript/purescript). It attempts to generate "sane", debuggable, and portable [C++11](https://isocpp.org/wiki/faq/cpp11) (or later) or [Go](https://golang.org/) code as an intermediate language, which is then compiled to a native executable binary. This also enables easy interoperability with existing C/C++ or Go frameworks and libraries on a number of platforms.
44
5−[![Hackage](https://img.shields.io/hackage/v/purescript.svg)](http://hackage.haskell.org/package/purescript) [![Build Status](https://api.travis-ci.org/purescript/purescript.svg?branch=master)](http://travis-ci.org/purescript/purescript)
5+There are two utilities in the purescript-native "suite": `pscpp` and `psgo`. The source code in this branch is for `psgo`, the purescript-to-Go transpiler. For the source code of the `pscpp` purescript-to-C++ transpiler, please see the [cpp branch](https://github.com/andyarvanitis/purescript-native/tree/cpp).
66
7−[![Stackage LTS 2](http://stackage.org/package/purescript/badge/lts-2)](http://stackage.org/lts-2/package/purescript)
8−[![Stackage LTS 3](http://stackage.org/package/purescript/badge/lts-3)](http://stackage.org/lts-3/package/purescript)
9−[![Stackage Nightly](http://stackage.org/package/purescript/badge/nightly)](http://stackage.org/nightly/package/purescript)
7+#### Platforms
8+* Although purescript-native should work on any platform supporting PureScript and modern C++ or Go, the generated code and resulting binary executables have been tested on:
9+ * macOS Mojave 10.14.5 – full test suite
10+ * For C++, Xcode 10.2.1's `clang` was used
11+ * For Go, `go` version 1.12.7 was used
12+ * Windows 10 x64 – full test suite
13+ * C++: Visual Studio 2017 and `clang`
14+ * Go: `go` version 1.12.7
15+ * Linux Debian 9.5 amd64 – full test suite (C++)
16+ * Default versions of `clang` and `gcc`
17+ * Linux Debian 10 amd64 – full test suite (Go)
18+ * Default version of `go`
19+ * Raspberry Pi 3 B+ Raspbian official build (ARM), default versions of `clang` and `gcc`
1020
11−## Language info
1221
13−- [PureScript home](http://purescript.org)
14−- [Releases & changelog](https://github.com/purescript/purescript/releases)
15−- [Contributing to PureScript](https://github.com/purescript/purescript/blob/master/CONTRIBUTING.md)
22+#### Requirements for building `pscpp` and `psgo`
1623
17−## Resources
24+* [Haskell Stack](https://docs.haskellstack.org/en/stable/README/) (if you're running macOS 10.14.5+, you can use pre-built binaries from [here](https://github.com/andyarvanitis/purescript-native/releases/))
1825
19−- [PureScript book](https://leanpub.com/purescript/read)
20−- [Wiki](http://wiki.purescript.org)
21−- [Try PureScript](http://try.purescript.org)
22−- [Pursuit Package Index](http://pursuit.purescript.org/)
26+#### Requirements for using PureScript + purescript-native
2327
24−## Help!
28+* A recent version (0.13+) of [purescript](https://github.com/purescript/purescript/releases).
2529
26−- [#purescript IRC @ FreeNode](http://webchat.freenode.net/?channels=purescript)
27−- [PureScript on StackOverflow](http://stackoverflow.com/questions/tagged/purescript)
28−- [Google Group](https://groups.google.com/forum/#!forum/purescript)
30+* For `pscpp`, a C++11-capable toolchain, e.g. recent versions of clang, gcc, Microsoft Visual Studio
31+ * GNU Make + `psc-package` is the default supported build tool, but you should be able to use your favorite package manager, C++ build system, tools, debuggers, etc.
32+* For `psgo`, the [Go toolchain](https://golang.org) for your system
33+ * You can use your favorite PureScript package manager and build tools – but for simplicity, [`spago`](https://github.com/spacchetti/spago) is recommended.
34+
35+
36+#### For more information and a Getting Started guide, please see
37+* [`pscpp`](https://github.com/andyarvanitis/purescript-native/blob/cpp/README-cpp.md)
38+* [`psgo`](https://github.com/andyarvanitis/purescript-native/blob/golang/README-go.md)
39+
40+
41+---
Setup.hs−4
@@ -1,6 +1,2 @@
1−module Main where
2−
31import Distribution.Simple
4−
5−main :: IO ()
62main = defaultMain
app/Main.hsnew file+250
@@ -0,0 +1,250 @@
1+{-# LANGUAGE OverloadedStrings #-}
2+{-# LANGUAGE RankNTypes #-}
3+{-# LANGUAGE TemplateHaskell #-}
4+
5+module Main where
6+
7+import Control.Monad (when)
8+import qualified Control.Monad.Parallel as Par
9+import Data.Aeson
10+import Data.Aeson.Types
11+import Data.Char
12+import Data.FileEmbed (embedFile)
13+import Data.List (delete, intercalate, isPrefixOf, nub, partition, (\\))
14+import Data.Maybe
15+import Data.Monoid ((<>))
16+import Data.Version
17+import Control.Monad.Supply
18+import Control.Monad.Supply.Class
19+import Text.Printf
20+
21+import System.Environment
22+import System.Directory (createDirectoryIfMissing, doesDirectoryExist, doesFileExist, getCurrentDirectory, getModificationTime)
23+import System.FilePath ((</>), joinPath, splitDirectories, takeDirectory)
24+import System.FilePath.Find
25+import System.Process
26+
27+import Data.Text (Text)
28+import qualified Data.Text as T
29+import qualified Data.Text.Encoding as T
30+import qualified Data.Text.Lazy as L
31+import qualified Data.Text.Lazy.Encoding as L
32+import qualified Data.ByteString as B
33+
34+import Development.GitRev
35+
36+import Language.PureScript.AST.Literals
37+import Language.PureScript.CoreFn
38+import Language.PureScript.CoreFn.FromJSON
39+
40+import CodeGen.IL
41+import CodeGen.IL.Common
42+import CodeGen.IL.Printer
43+
44+import Tests
45+
46+data Command = Build | Run (Maybe String)
47+
48+parseJson :: Text -> Value
49+parseJson text
50+ | Just fileJson <- decode . L.encodeUtf8 $ L.fromStrict text = fileJson
51+ | otherwise = error "Bad json"
52+
53+jsonToModule :: Value -> Module Ann
54+jsonToModule value =
55+ case parse moduleFromJSON value of
56+ Success (_, r) -> r
57+ _ -> error "Failed parsing corefn. Psgo currently supports purescript <= 0.13.8"
58+
59+splitArgs :: [String] -> ([String], Maybe String, [String])
60+splitArgs args =
61+ let (opts, files) = partition (isPrefixOf "--") args
62+ opts' = (map . map) toLower opts
63+ (moduleName, files') =
64+ if null files
65+ then (Nothing, files)
66+ else
67+ if "--run" `elem` opts' && length (files) >= 1
68+ then do
69+ let file0 = head files
70+ files' = tail files
71+ case file0 of
72+ "Main.main" -> (Just "Main", files')
73+ "Test.Main.main" -> (Just "Test.Main", files')
74+ _ -> (Nothing, files)
75+ else (Nothing, files)
76+ in (opts, moduleName, files')
77+
78+main :: IO ()
79+main = do
80+ args <- getArgs
81+ -- let (opts, files) = partition (isPrefixOf "--") args
82+ let (opts, moduleName, files) = splitArgs args
83+ opts' = (map . map) toLower opts
84+ if "--tests" `elem` opts'
85+ then runTests
86+ else do
87+ if "--help" `elem` opts' || "--version" `elem` opts'
88+ then do
89+ when ("--help" `elem` opts') $ do
90+ putStrLn help
91+ when ("--version" `elem` opts') $ do
92+ let branch = $(gitBranch)
93+ details | branch == "golang" = "master, commit " ++ $(gitHash)
94+ | otherwise = branch
95+ putStrLn $ details ++ if $(gitDirty) then " (DIRTY)" else ""
96+ else do
97+ if null files
98+ then do
99+ currentDir <- getCurrentDirectory
100+ processFiles opts' [currentDir]
101+ else
102+ processFiles opts' files
103+ if "--run" `elem` opts
104+ then runBuildTool $ Run moduleName
105+ else when ("--no-build" `notElem` opts) $
106+ runBuildTool Build
107+ return ()
108+ where
109+ processFiles :: [String] -> [FilePath] -> IO ()
110+ processFiles opts [file] = do
111+ isDir <- doesDirectoryExist file
112+ if isDir then do
113+ files <- find always (fileName ==? corefn) file
114+ if null files
115+ then errorNoCorefnFiles
116+ else generateFiles opts files
117+ else generateFiles opts [file]
118+ processFiles opts files = do
119+ generateFiles opts files
120+ basePath :: [FilePath] -> FilePath
121+ basePath files =
122+ let filepath = takeDirectory (head files) in
123+ joinPath $ (init $ splitDirectories filepath)
124+ generateFiles :: [String] -> [FilePath] -> IO ()
125+ generateFiles opts files = do
126+ let baseOutpath = basePath files
127+ writeSupportFiles baseOutpath
128+ Par.mapM (generateCode opts baseOutpath) files
129+ return ()
130+ runBuildTool :: Command -> IO ()
131+ runBuildTool cmd = do
132+ project <- projectEnv
133+ case cmd of
134+ Build -> do
135+ callProcess "go" ["build", T.unpack project </> modPrefix' </> "Main"]
136+ Run moduleName -> do
137+ callProcess "go" ["run", T.unpack project </> modPrefix' </> fromMaybe "Main" moduleName]
138+ return ()
139+
140+generateCode :: [String] -> FilePath -> FilePath -> IO ()
141+generateCode opts baseOutpath jsonFile = do
142+ jsonModTime <- getModificationTime jsonFile
143+ let filepath = takeDirectory jsonFile
144+ dirparts = splitDirectories $ filepath
145+ mname = last dirparts
146+ basedir = joinPath $ init dirparts
147+ mname' = T.pack mname
148+ possibleFileName = basedir </> (T.unpack mname') </> implFileName mname'
149+ exists <- doesFileExist possibleFileName
150+ if exists
151+ then do
152+ modTime <- getModificationTime possibleFileName
153+ when (modTime < jsonModTime) $
154+ transpile opts baseOutpath jsonFile
155+ else transpile opts baseOutpath jsonFile
156+
157+transpile :: [String] -> FilePath -> FilePath -> IO ()
158+transpile opts baseOutpath jsonFile = do
159+ jsonText <- T.decodeUtf8 <$> B.readFile jsonFile
160+ project <- projectEnv
161+ let module' = jsonToModule $ parseJson jsonText
162+ ((_, foreigns, asts, implHeader, implFooter), _) <- runSupplyT 5 (moduleToIL module' project)
163+ let mn = moduleNameToIL' $ moduleName module'
164+ implementation = prettyPrintIL asts
165+ outpath = joinPath [baseOutpath, T.unpack mn]
166+ implPath = outpath </> implFileName mn
167+ createDirectoryIfMissing True outpath
168+ putStrLn implPath
169+ B.writeFile implPath $ T.encodeUtf8 (implHeader <> implementation <> implFooter)
170+
171+writeSupportFiles :: FilePath -> IO ()
172+writeSupportFiles baseOutpath = do
173+ currentDir <- getCurrentDirectory
174+ let outputdir = T.pack $ baseOutpath \\ currentDir
175+ ffiOutpath = currentDir </> subdir
176+ createDirectoryIfMissing True baseOutpath
177+ createDirectoryIfMissing True ffiOutpath
178+ writeModuleFile outputdir currentDir $(embedFile "support/go.mod.working")
179+ writeModuleFile outputdir baseOutpath $(embedFile "support/go.mod.output")
180+ writeModuleFile outputdir ffiOutpath $(embedFile "support/go.mod.ffi-loader")
181+ writeLoaderFile ffiOutpath $(embedFile "support/ffi-loader.go")
182+ where
183+ writeModuleFile :: Text -> FilePath -> B.ByteString -> IO ()
184+ writeModuleFile outputdir path modText = do
185+ let goModSource = path </> "go.mod"
186+ goModSourceExists <- doesFileExist goModSource
187+ when (not goModSourceExists) $ do
188+ project <- projectEnv
189+ let project' = T.unpack project
190+ outputdir' = tail $ T.unpack outputdir
191+ modText' = T.replace "$PROJECT" project $ T.decodeUtf8 modText
192+ replaceLoader = project' </> ffiLoader' <> "=." </> subdir
193+ replaceOutput = project' </> modPrefix' <> "=." </> outputdir'
194+ B.writeFile goModSource $ T.encodeUtf8 modText'
195+ callProcess "go" ["mod", "edit", "-replace", replaceLoader]
196+ callProcess "go" ["mod", "edit", "-replace", replaceOutput]
197+ callProcess "go" ["clean", "-modcache"]
198+ writeLoaderFile :: FilePath -> B.ByteString -> IO ()
199+ writeLoaderFile ffiOutpath loaderText = do
200+ let loaderSource = ffiOutpath </> "ffi_loader.go"
201+ loaderSourceExists <- doesFileExist loaderSource
202+ when (not loaderSourceExists) $ do
203+ B.writeFile loaderSource loaderText
204+
205+implFileName :: Text -> FilePath
206+implFileName mn = ((\c -> if c == '.' then '_' else c) <$> T.unpack mn) <> ".go"
207+
208+projectEnv :: IO Text
209+projectEnv = do
210+ T.pack . fromMaybe defaultProject <$> lookupEnv goproject
211+
212+help :: String
213+help = "Usage: psgo OPTIONS COREFN-FILES\n\
214+ \ PureScript to native (via go) compiler\n\n\
215+ \Available options:\n\
216+ \ --help Show this help text\n\n\
217+ \ --version Show the version number\n\n\
218+ \ --run Run the generated go code directly, without building an\n\
219+ \ executable\n\
220+ \ --no-build Generate go source files, but do not build an executable\n\
221+ \ --tests Run test cases (under construction)\n\n\
222+ \See also:\n\
223+ \ purs compile --help\n"
224+
225+corefn :: String
226+corefn = "corefn.json"
227+
228+goSrc :: String
229+goSrc = ".go"
230+
231+goproject :: String
232+goproject = "GOPROJECT"
233+
234+defaultProject :: String
235+defaultProject = "project.localhost"
236+
237+modPrefix' :: String
238+modPrefix' = T.unpack modPrefix
239+
240+ffiLoader' :: String
241+ffiLoader' = T.unpack ffiLoader
242+
243+subdir :: String
244+subdir = T.unpack modLabel
245+
246+errorNoCorefnFiles :: IO ()
247+errorNoCorefnFiles = do
248+ ioError . userError $ "no compiled purescript '" <> corefn <> "' files found –\n" <>
249+ " make sure to use the '--codegen corefn' option with your purs\n" <>
250+ " project build tool"
bundle/.gitignoredeleted−3
@@ -1,3 +0,0 @@
1−build/
2−*.tar.gz
3−*.sha
bundle/READMEdeleted−21
@@ -1,21 +0,0 @@
1− ____ ____ _ _
2−| _ \ _ _ _ __ ___/ ___| ___ _ __(_)_ __ | |_
3−| |_) | | | | '__/ _ \___ \ / __| '__| | '_ \| __|
4−| __/| |_| | | | __/___) | (__| | | | |_) | |_
5−|_| \__,_|_| \___|____/ \___|_| |_| .__/ \__|
6− |_|
7−
8−Installation Instructions
9−-------------------------
10−
11−This bundle contains the following executables:
12−
13−- psc The PureScript compiler
14−- psci The PureScript interactive REPL (requires NodeJS)
15−- psc-docs A Markdown documentation generator for PureScript code
16−- psc-bundle Bundles together CommonJS modules produced by `psc` into a
17− single JavaScript file; useful for running in the browser.
18−- psc-publish Generates documentation packages for uploading to Pursuit
19−
20−Copy these files anywhere on your PATH.
21−
bundle/build.shdeleted−46
@@ -1,46 +0,0 @@
1−set -e
2−
3−SCRIPTPATH=$( cd "$(dirname "$0")" ; pwd -P )
4−
5−OS=$1
6−
7−if [ -z $OS ]
8−then
9− echo "Usage: build.sh osname"
10− exit 1
11−fi
12−
13−pushd ${SCRIPTPATH} > /dev/null
14−
15−# Make the staging directory
16−mkdir -p build/purescript/
17−
18−# Strip the binaries
19−strip ../dist/build/psc/psc
20−strip ../dist/build/psci/psci
21−strip ../dist/build/psc-docs/psc-docs
22−strip ../dist/build/psc-publish/psc-publish
23−strip ../dist/build/psc-bundle/psc-bundle
24−
25−# Copy files to staging directory
26−cp ../dist/build/psc/psc build/purescript/
27−cp ../dist/build/psci/psci build/purescript/
28−cp ../dist/build/psc-docs/psc-docs build/purescript/
29−cp ../dist/build/psc-publish/psc-publish build/purescript/
30−cp ../dist/build/psc-bundle/psc-bundle build/purescript/
31−cp README build/purescript/
32−cp ../LICENSE build/purescript/
33−cp ../INSTALL.md build/purescript/
34−
35−# Make the binary bundle
36−pushd build > /dev/null
37−tar -zcvf ../$OS.tar.gz purescript
38−popd > /dev/null
39−
40−# Calculate the SHA hash
41−shasum $OS.tar.gz > $OS.sha
42−
43−# Remove the staging directory
44−rm -rf build/
45−
46−popd > /dev/null
bundle/winbuild.shdeleted−43
@@ -1,43 +0,0 @@
1−## This Windows-specific version of build.sh can be run in an msys environment
2−## to create a .tar.gz bundle for Windows users.
3−## msysgit contains all of the pieces needed to run this script.
4−
5−set -e
6−
7−SCRIPTPATH=$( cd "$(dirname "$0")" ; pwd -P )
8−
9−pushd ${SCRIPTPATH}
10−
11−# Make the staging directory
12−mkdir -p build/purescript/
13−
14−# Strip the binaries
15−strip ../dist/build/psc/psc.exe
16−strip ../dist/build/psci/psci.exe
17−strip ../dist/build/psc-docs/psc-docs.exe
18−strip ../dist/build/psc-publish/psc-publish.exe
19−strip ../dist/build/psc-bundle/psc-bundle.exe
20−
21−# Copy files to staging directory
22−cp ../dist/build/psc/psc.exe build/purescript/
23−cp ../dist/build/psci/psci.exe build/purescript/
24−cp ../dist/build/psc-docs/psc-docs.exe build/purescript/
25−cp ../dist/build/psc-publish/psc-publish.exe build/purescript/
26−cp ../dist/build/psc-bundle/psc-bundle.exe build/purescript/
27−cp README build/purescript/
28−cp ../LICENSE build/purescript/
29−cp ../INSTALL.md build/purescript/
30−
31−# Make the binary bundle
32−pushd build
33−tar -zcvf ../win64.tar.gz purescript
34−popd
35−
36−# Calculate the MD5 hash
37−md5sum win64.tar.gz > win64.md5
38−
39−# Remove the staging directory
40−rm -rf build/
41−
42−popd
43−
core-tests/.gitignoredeleted−2
@@ -1,2 +0,0 @@
1−bower_components/
2−output/
core-tests/test-everything.shdeleted−77
@@ -1,77 +0,0 @@
1−#!/bin/bash
2−
3−set -e
4−
5−force_recompile='false'
6−force_reinstall='false'
7−
8−while getopts 'ci' flag; do
9− case "${flag}" in
10− c) force_recompile='true' ;;
11− i) force_reinstall='true' ;;
12− *) error "Unexpected option ${flag}" ;;
13− esac
14−done
15−
16−if [ "$force_reinstall" = "true" ] && [ -d "bower_components" ]; then
17− echo "Reinstalling core packages..."
18− rm -r bower_components
19−fi
20−
21−npm install bower
22−
23−node_modules/.bin/bower i \
24− purescript-prelude \
25− purescript-eff \
26− purescript-st \
27− purescript-integers \
28− purescript-functions \
29− purescript-console \
30− purescript-profunctor \
31− purescript-contravariant \
32− purescript-parallel \
33− purescript-control \
34− purescript-tailrec \
35− purescript-maps \
36− purescript-free \
37− purescript-transformers \
38− purescript-exists \
39− purescript-monoid \
40− purescript-either \
41− purescript-maybe \
42− purescript-inject \
43− purescript-graphs \
44− purescript-enums \
45− purescript-unfoldable \
46− purescript-coproducts \
47− purescript-lazy \
48− purescript-distributive \
49− purescript-identity \
50− purescript-bifunctors \
51− purescript-const \
52− purescript-sets \
53− purescript-quickcheck \
54− purescript-foreign \
55− purescript-foldable-traversable \
56− purescript-tuples \
57− purescript-strings \
58− purescript-arrays \
59− purescript-random \
60− purescript-refs \
61− purescript-globals \
62− purescript-exceptions \
63− purescript-validation \
64− purescript-parallel \
65− purescript-proxy \
66− purescript-semirings \
67− purescript-math \
68− purescript-generics
69−
70−if [ "$force_recompile" = "true" ] && [ -d "output" ]; then
71− echo "Recompiling..."
72− rm -r output
73−fi
74−
75−../dist/build/psc/psc tests/*/*.purs \
76− 'bower_components/purescript-*/src/**/*.purs' \
77− --ffi 'bower_components/purescript-*/src/**/*.js'
core-tests/tests/generic-deriving/Main.pursdeleted−23
@@ -1,23 +0,0 @@
1−module GenericDeriving where
2−
3−import Prelude
4−
5−import Control.Monad.Eff (Eff())
6−import Control.Monad.Eff.Console (CONSOLE())
7−import Data.Generic
8−
9−data Void
10−
11−derive instance genericVoid :: Generic Void
12−
13−data A a
14− = A Number String
15− | B Int
16− | C (Array (A a))
17− | D { a :: a }
18− | E Void
19−
20−derive instance genericA :: (Generic a) => Generic (A a)
21−
22−main :: forall eff. Eff (console :: CONSOLE | eff) Unit
23−main = Control.Monad.Eff.Console.log (gShow (D { a: C [ A 1.0 "test", B 42, D { a: true } ] }))
default.nixnew file+23
@@ -0,0 +1,23 @@
1+let
2+ haskellNix = import (builtins.fetchTarball https://github.com/input-output-hk/haskell.nix/archive/master.tar.gz) {};
3+ nixpkgsSrc = haskellNix.sources.nixpkgs-1903; # has hsc2hs-0.68.4
4+
5+ hsc2hsOverlay = self: super: {
6+ buildPackages = super.buildPackages // {
7+ hsc2hs = super.haskellPackages.hsc2hs;
8+ };
9+ };
10+
11+ nixpkgsArgs = haskellNix.nixpkgsArgs // {
12+ overlays = haskellNix.nixpkgsArgs.overlays ++ [ hsc2hsOverlay ];
13+ };
14+in
15+{ pkgs ? import nixpkgsSrc nixpkgsArgs
16+}:
17+
18+pkgs.haskell-nix.stackProject {
19+ src = pkgs.haskell-nix.haskellLib.cleanGit {
20+ name = "purescript-native";
21+ src = ./.;
22+ };
23+}
examples/.gitignoredeleted−1
@@ -1 +0,0 @@
1−shelltest/tests
examples/failing/1071.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith KindsDoNotUnify
2−module Main where
3−
4−class Foo a b where
5− foo :: a -> b
6−
7−bar :: forall a. (Foo a) => a -> a
8−bar a = a
examples/failing/1310.pursdeleted−18
@@ -1,18 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−
3−module Issue1310 where
4−
5−import Prelude
6−import Control.Monad.Eff
7−import Control.Monad.Eff.Console
8−
9−class Inject f g where
10− inj :: forall a. f a -> g a
11−
12−instance inject :: Inject f f where
13− inj x = x
14−
15−foreign import data Oops :: !
16−
17−main :: forall eff. Eff (oops :: Oops | eff) Unit
18−main = inj (log "Oops")
examples/failing/365.pursdeleted−14
@@ -1,14 +0,0 @@
1−-- @shouldFailWith CycleInDeclaration
2−module Main where
3−
4−import Prelude
5−
6−class C a where
7− f :: a -> a
8− g :: a -> a
9−
10−instance cS :: C String where
11− f s = s
12− g = f
13−
14−main = g "Done"
examples/failing/438.pursdeleted−15
@@ -1,15 +0,0 @@
1−-- @shouldFailWith PossiblyInfiniteInstance
2−
3−-- See issue 438 for details: this test is mainly here to test that code like
4−-- this doesn't cause the compiler to loop.
5−
6−module Main where
7−
8−import Prelude
9−
10−data Fix f = In (f (Fix f))
11−
12−instance eqFix :: (Eq (f (Fix f))) => Eq (Fix f) where
13− eq (In f) (In g) = f == g
14−
15−example = In [] == In []
examples/failing/881.pursdeleted−13
@@ -1,13 +0,0 @@
1−-- @shouldFailWith DuplicateValueDeclaration
2−module Main where
3−
4−data X = X | Y
5−
6−class Foo a where
7− foo :: a -> a
8− bar :: a
9−
10−instance fooX :: Foo X where
11− foo X = X
12− bar = X
13− foo Y = Y
examples/failing/ArrayType.pursdeleted−14
@@ -1,14 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−
3−module Main where
4−
5−import Prelude
6−import Control.Monad.Eff.Console
7−
8−bar :: Number -> Number -> Number
9−bar n m = n + m
10−
11−foo = x `bar` y
12− where
13− x = 1
14− y = []
examples/failing/Arrays.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−foreign import (!!) :: forall a. Array a -> Int -> a
7−
8−test = \arr -> arr !! (0 !! 0)
examples/failing/CaseDoesNotMatchAllConstructorArgs.pursdeleted−15
@@ -1,15 +0,0 @@
1−-- @shouldFailWith IncorrectConstructorArity
2−module Main where
3−
4−import Prelude
5−
6−data Person = Person String Int
7−
8−data TwoPeople = Two Person Person
9−
10−getName p = case p of
11− (Two (Person n) (Person n2 a2)) -> n
12− _ -> "Unknown"
13−
14−
15−name = getName (Two (Person "Jimmy" 20) (Person "" 1))
examples/failing/Do.pursdeleted−12
@@ -1,12 +0,0 @@
1−-- @shouldFailWith InvalidDoBind
2−-- @shouldFailWith InvalidDoLet
3−module Main where
4−
5−import Prelude
6−
7−test1 = do let x = 1
8−
9−test2 y = do x <- y
10−
11−test3 = do return 1
12− return 2
examples/failing/DoNotSuggestComposition.pursdeleted−13
@@ -1,13 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−-- TODO: Check that this does not produce a "function composition is (<<<)"
3−-- suggestion.
4−module DoNotSuggestComposition where
5−
6−import Prelude
7−
8−x = { y: 3 }
9−
10−foo :: String -> String
11−foo y = y
12−
13−bar = foo x
examples/failing/DoNotSuggestComposition2.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith CannotApplyFunction
2−-- TODO: Check that this does not produce a "function composition is (<<<)"
3−-- suggestion.
4−
5−module DoNotSuggestComposition2 where
6−
7−foo = let x = { y: 3 } in x 2
examples/failing/DuplicateDeclarationsInLet.pursdeleted−12
@@ -1,12 +0,0 @@
1−-- @shouldFailWith OverlappingNamesInLet
2−module Main where
3−
4−import Prelude
5−
6−foo = a
7− where
8− a :: Number
9− a = 1
10−
11− a :: Number
12− a = 2
examples/failing/DuplicateProperties1.pursdeleted−12
@@ -1,12 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module DuplicateProperties where
3−
4−import Prelude
5−
6−foreign import data Test :: # * -> *
7−
8−foreign import subtractX :: forall r. Test (x :: Unit | r) -> Test r
9−
10−foreign import hasX :: Test (x :: Unit, y :: Unit)
11−
12−baz = subtractX (subtractX hasX)
examples/failing/DuplicateProperties2.pursdeleted−12
@@ -1,12 +0,0 @@
1−-- @shouldFailWith DuplicateLabel
2−module DuplicateProperties where
3−
4−import Prelude
5−
6−foreign import data Test :: # * -> *
7−
8−foreign import subtractX :: forall r. Test (x :: Unit | r) -> Test r
9−
10−foreign import hasX :: forall r. Test (x :: Unit, y :: Unit | r)
11−
12−baz = subtractX (subtractX hasX)
examples/failing/DuplicateTypeVars.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith DuplicateTypeArgument
2−module Main where
3−
4−import Prelude
5−
6−type Foo a a = a
examples/failing/Eff.pursdeleted−13
@@ -1,13 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−import Prelude
5−import Control.Monad.Eff
6−import Control.Monad.ST
7−import Control.Monad.Eff.Console
8−
9−test = pureST (do
10− ref <- newSTRef 0
11− log "ST"
12− modifySTRef ref $ \n -> n + 1
13− readSTRef ref)
examples/failing/EmptyCase.pursdeleted−4
@@ -1,4 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Main where
3−
4−error err = case err of \_ -> 1
examples/failing/EmptyDo.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−
3−module Main where
4−
5−main = do
6−
examples/failing/ExtraRecordField.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith PropertyIsMissing
2−-- TODO: Make this fail with a new error ExtraProperty instead.
3−module ExtraRecordField where
4−
5−import Prelude ((<>))
6−
7−full :: { first :: String, last :: String } -> String
8−full p = p.first <> " " <> p.last
9−
10−oops = full { first: "Jane", last: "Smith", age: 29 }
examples/failing/Foldable.pursdeleted−17
@@ -1,17 +0,0 @@
1−-- @shouldFailWith CycleInDeclaration
2−module Main where
3−
4−import Prelude
5−
6−class Foldable f where
7− fold :: forall a b. (a -> b -> b) -> b -> f a -> b
8− size :: forall a. f a -> Number
9−
10−data L a = C a (L a) | N
11−
12−instance foldableL :: Foldable L where
13− fold _ z N = z
14− fold f z (C x xs) = x `f` (fold f z xs)
15− size = fold (const ((+) 1.0)) 0.0
16−
17−x = size (C 1 (C 2 (C 3 N)))
examples/failing/ImportHidingModule.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith ImportHidingModule
2−module A where
3− x = 1
4−
5−module B (module B, module A) where
6− import A
7− y = 1
8−
9−module C where
10− import B hiding (module A)
examples/failing/InfiniteKind.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith InfiniteKind
2−
3−module Main where
4−
5−data F a = F (a a)
examples/failing/InfiniteType.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith InfiniteType
2−
3−module Main where
4−
5−f a = a a
examples/failing/InstanceExport.pursdeleted−19
@@ -1,19 +0,0 @@
1−-- @shouldFailWith TransitiveExportError
2−module InstanceExport (S(..), f) where
3−
4−import Prelude
5−
6−newtype S = S String
7−
8−class F a where
9− f :: a -> String
10−
11−instance fs :: F S where
12− f (S s) = s
13−
14−module Test where
15−
16−import InstanceExport
17−import Prelude
18−
19−test = f $ S "Test"
examples/failing/KindError.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith KindsDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−data KindError f a = One f | Two (f a)
examples/failing/KindStar.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith ExpectedType
2−
3−module X where
4−
5−data List a = Nil | Cons a (List a)
6−
7−test :: List
8−test = Nil
examples/failing/LeadingZeros1.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Main where
3−
4−import Prelude
5−
6−x = 01
examples/failing/LeadingZeros2.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Main where
3−
4−import Prelude
5−
6−x = 00.1
examples/failing/Let.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith CycleInDeclaration
2−module Main where
3−
4−import Prelude
5−
6−test = let x = x in x
examples/failing/MPTCs.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith KindsDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−class Foo a where
7− f :: a -> a
8−
9−instance fooStringString :: Foo String String where
10− f a = a
examples/failing/MissingClassExport.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith TransitiveExportError
2−module Test (bar) where
3−
4−import Prelude
5−
6−class Foo a where
7− bar :: a -> a
examples/failing/MissingClassMemberExport.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith TransitiveExportError
2−module Test (Foo) where
3−
4−import Prelude
5−
6−class Foo a where
7− bar :: a -> a
examples/failing/MissingRecordField.pursdeleted−11
@@ -1,11 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−-- TODO: Update type checker to make this fail with PropertyIsMissing instead.
3−module MissingRecordField where
4−
5−import Prelude ((>))
6−
7−john = { first: "John", last: "Smith" }
8−
9−isOver50 p = p.age > 50.0
10−
11−result = isOver50 john
examples/failing/MultipleErrors.pursdeleted−13
@@ -1,13 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−-- @shouldFailWith TypesDoNotUnify
3−module MultipleErrors where
4−
5−import Prelude
6−
7−foo :: Int -> Int
8−foo 0 = "Test"
9−foo n = bar (n - 1)
10−
11−bar :: Int -> Int
12−bar 0 = "Test"
13−bar n = foo (n - 1)
examples/failing/MultipleErrors2.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith UnknownValue
2−-- @shouldFailWith UnknownValue
3−module MultipleErrors2 where
4−
5−import Prelude
6−
7−foo = itDoesntExist
8−
9−bar = neitherDoesThis
examples/failing/MutRec.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith CycleInDeclaration
2−module MutRec where
3−
4−import Prelude
5−
6−x = y
7−
8−y = x
examples/failing/MutRec2.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith CycleInDeclaration
2−module Main where
3−
4−import Prelude
5−
6−x = x
examples/failing/NewtypeMultiArgs.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith InvalidNewtype
2−module Main where
3−
4−import Prelude
5−
6−newtype Thing = Thing String Boolean
examples/failing/NewtypeMultiCtor.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith InvalidNewtype
2−module Main where
3−
4−import Prelude
5−
6−newtype Thing = Thing String | Other
examples/failing/NullaryAbs.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Main where
3−
4−import Prelude
5−
6−func = \ -> "no"
examples/failing/Object.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith PropertyIsMissing
2−module Main where
3−
4−import Prelude
5−
6−test o = o.foo
7−
8−test1 = test {}
examples/failing/OrphanInstance.pursdeleted−12
@@ -1,12 +0,0 @@
1−-- @shouldFailWith OrphanInstance
2−module Class where
3−
4− class C a where
5− op :: a -> a
6−
7−module Test where
8−
9− import Class
10−
11− instance cBoolean :: C Boolean where
12− op a = a
examples/failing/OverlappingArguments.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith OverlappingArgNames
2−module OverlappingArguments where
3−
4−import Prelude
5−
6−f x x = x
examples/failing/OverlappingBinders.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith OverlappingArgNames
2−module OverlappingBinders where
3−
4−import Prelude
5−
6−data S a = S a (S a)
7−
8−f x = case x of
9− (S y (S y@(S z zs))) -> y
examples/failing/OverlappingReExport.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith DuplicateValueExport
2−module A where
3− x = true
4−
5−module B where
6− x = false
7−
8−module C (module A, module M2) where
9− import A
10− import qualified B as M2
examples/failing/OverlappingVars.pursdeleted−15
@@ -1,15 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−module Main where
3−
4−import Prelude
5−
6−class OverlappingVars a where
7− f :: a -> a
8−
9−data Foo a b = Foo a b
10−
11−instance overlappingVarsFoo :: OverlappingVars (Foo a a) where
12− f a = a
13−
14−test = f (Foo "" 0)
15−
examples/failing/Rank2Types.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−foreign import test :: (forall a. a -> a) -> Number
7−
8−test1 = test (\n -> n + 1)
examples/failing/Reserved.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Main where
3−
4−import Prelude
5−
6−(<) :: Number -> Number -> Number
7−(<) a b = !(a >= b)
examples/failing/RowConstructors1.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith KindsDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−data Foo = Bar
7−type Baz = { | Foo }
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/failing/RowConstructors2.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith KindsDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−type Foo r = (x :: Number | r)
7−type Bar = { | Foo }
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/failing/RowConstructors3.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith KindsDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−type Foo = { x :: Number }
7−type Bar = { | Foo }
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/failing/SkolemEscape.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith EscapedSkolem
2−module Main where
3−
4−import Prelude
5−
6−foreign import foo :: (forall a. a -> a) -> Number
7−
8−test = \x -> foo x
examples/failing/SkolemEscape2.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith EscapedSkolem
2−module Main where
3−
4−import Prelude
5−import Control.Monad.Eff
6−import Control.Monad.ST
7−
8−test _ = do
9− r <- runST (newSTRef 0)
10− return 0
examples/failing/SuggestComposition.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−-- TODO: Ensure the correct suggestion is produced.
3−module SuggestComposition where
4−
5−import Prelude
6−
7−f = g . g where g = (+1)
examples/failing/Superclasses1.pursdeleted−14
@@ -1,14 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−module Main where
3−
4−import Prelude
5−
6−class Su a where
7− su :: a -> a
8−
9−class (Su a) <= Cl a where
10− cl :: a -> a -> a
11−
12−instance clNumber :: Cl Number where
13− cl n m = n + m
14−
examples/failing/Superclasses2.pursdeleted−13
@@ -1,13 +0,0 @@
1−-- @shouldFailWith CycleInTypeSynonym
2−-- TODO: Should this have its own error, perhaps CycleInTypeClassDeclaration?
3−module CycleInSuperclasses where
4−
5−import Prelude
6−
7−class (Foo a) <= Bar a
8−
9−class (Bar a) <= Foo a
10−
11−instance barString :: Bar String
12−
13−instance fooString :: Foo String
examples/failing/Superclasses3.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith UndefinedTypeVariable
2−module UnknownSuperclassTypeVar where
3−
4−import Prelude
5−
6−class Foo a
7−
8−class (Foo b) <= Bar a
examples/failing/Superclasses5.pursdeleted−25
@@ -1,25 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−
3−module Main where
4−
5−import Prelude
6−
7−class Su a where
8− su :: a -> a
9−
10−class (Su (Array a)) <= Cl a where
11− cl :: a -> a -> a
12−
13−instance suNumber :: Su Number where
14− su n = n + 1.0
15−
16−instance suArray :: (Su a) => Su (Array a) where
17− su [x] = [su x]
18−
19−instance clNumber :: Cl Number where
20− cl n m = n + m
21−
22−test :: forall a. (Cl a) => a -> Array a
23−test x = su [cl x x]
24−
25−main = Control.Monad.Eff.Console.print $ test 10.0
examples/failing/TopLevelCaseNoArgs.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith DuplicateValueDeclaration
2−module Main where
3−
4−import Prelude
5−
6−foo :: Number
7−foo = 1
8−foo = 2
examples/failing/TransitiveDctorExport.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith TransitiveExportError
2−module Main (Y(..)) where
3−
4−type X = Int
5−data Y = Y X
examples/failing/TransitiveSynonymExport.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith TransitiveExportError
2−module Main (Y()) where
3−
4−type X = Int
5−type Y = X
examples/failing/TypeClassInstances.pursdeleted−11
@@ -1,11 +0,0 @@
1−-- @shouldFailWith MissingClassMember
2−module Main where
3−
4−import Prelude
5−
6−class A a where
7− a :: a -> String
8− b :: a -> Number
9−
10−instance aString :: A String where
11− a s = s
examples/failing/TypeClasses2.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−module Main where
3−
4−import Prelude ()
5−
6−class Show a where
7− show :: a -> String
8−
9−test = show "testing"
examples/failing/TypeError.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−test = 1 ++ "A"
examples/failing/TypeSynonyms.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith CycleInTypeSynonym
2−module Main where
3−
4−import Prelude
5−
6−type T1 = Array T2
7−
8−type T2 = T1
examples/failing/TypeSynonyms2.pursdeleted−12
@@ -1,12 +0,0 @@
1−-- @shouldFailWith TypeSynonymInstance
2−module Main where
3−
4−import Prelude
5−
6−class Foo a where
7− foo :: a -> String
8−
9−type Bar = String
10−
11−instance fooBar :: Foo Bar where
12− foo s = s
examples/failing/TypeSynonyms3.pursdeleted−12
@@ -1,12 +0,0 @@
1−-- @shouldFailWith TypeSynonymInstance
2−module Main where
3−
4−import Prelude
5−
6−class Foo a where
7− foo :: a -> String
8−
9−type Bar = String
10−
11−instance fooBar :: Foo Bar where
12− foo s = s
examples/failing/TypeSynonyms4.pursdeleted−11
@@ -1,11 +0,0 @@
1−-- @shouldFailWith PartiallyAppliedSynonym
2−module TypeSynonyms4 where
3−
4−import Prelude
5−
6−type F x y = x -> y
7−
8−type G x = F x
9−
10−f :: G String String -> String
11−f k = k "Done"
examples/failing/TypeSynonyms5.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith CycleInTypeSynonym
2−module Main where
3−
4−import Prelude
5−
6−type T = T
examples/failing/TypeWildcards1.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module TypeWildcards where
3−
4−import Prelude
5−
6−type Test = _
7−
examples/failing/TypeWildcards2.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module TypeWildcards where
3−
4−import Prelude
5−
6−data Test = Test _
7−
examples/failing/TypeWildcards3.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module TypeWildcards where
3−
4−import Prelude
5−
6−data Foo a = Foo
7−
8−instance showFoo :: Show (Foo _) where
9− show Foo = "Foo"
10−
examples/failing/TypedBinders.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Main where
3−
4−import Prelude
5−
6−test = (\f :: Int -> Int -> f 10) id
7−
8−main = do
9− let t1 = test
10− Control.Monad.Eff.Console.log "Done"
examples/failing/TypedBinders2.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−main = do
7− s :: String <- Control.Monad.Eff.Console.log "Foo"
8− Control.Monad.Eff.Console.log "Done"
9−
examples/failing/TypedBinders3.pursdeleted−12
@@ -1,12 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−test = case 1 of
7− (0 :: String) -> true
8− _ -> false
9−
10−main = do
11− let t = test
12− Control.Monad.Eff.Console.log "Done"
examples/failing/UnderscoreModuleName.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Bad_Module where
3−
4−import Prelude
5−
6−main = Control.Monad.Eff.Console.log "Done"
examples/failing/UnifyInTypeInstanceLookup.pursdeleted−22
@@ -1,22 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−-- See issue #390.
3−-- TODO: Improve this error.
4−module Main where
5−
6−import Prelude
7−
8−data Z = Z
9−data S n = S n
10−
11−data T
12−data F
13−
14−class EQ x y b
15−instance eqT :: EQ x x T
16−instance eqF :: EQ x y F
17−
18−foreign import test :: forall a b. (EQ a b T) => a -> b -> a
19−
20−foreign import anyNat :: forall a. a
21−
22−test1 = test anyNat (S Z)
examples/failing/UnknownType.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith UnknownType
2−module Main where
3−
4−import Prelude
5−
6−test :: Number -> Something
7−test = {}
examples/manual/QualifiedNames.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Data.Either where
2−
3−import Prelude
4−
5−data Either a b = Left a | Right b
6−
7−module Main where
8−
9−either :: forall a b c. (a -> c) -> (b -> c) -> Data.Either.Either a b -> c
10−either f _ (Data.Either.Left x) = f x
11−either _ g (Data.Either.Right y) = g y
12−
13−main = Control.Monad.Eff.Console.log (either id id (Data.Either.Left "Done"))
examples/manual/failing/ArgLengthMismatch.pursdeleted−6
@@ -1,6 +0,0 @@
1−module ArgLengthMismatch where
2−
3−import Prelude
4−
5−f x y = true
6−f = false
examples/manual/failing/ExportExplicit.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- should fail as z does not exist in the module
2−module M1 (x, y, z) where
3−
4−import Prelude
5−
6−x = 1
7−y = 2
examples/manual/failing/ExportExplicit1.pursdeleted−14
@@ -1,14 +0,0 @@
1−module M1 (X(X)) where
2−
3− data X = X | Y
4−
5−module Main where
6−
7− import M1
8−
9− testX = X
10−
11− -- should fail as Y constructor is not exported from M1
12− testY = Y
13−
14− main = Control.Monad.Eff.Console.log "Done"
examples/manual/failing/ExportExplicit2.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- should fail as Y is not a data constructor for X
2−module M1 (X(Y)) where
3−
4−import Prelude
5−
6−data X = X
7−data Y = Y
examples/manual/failing/ExportExplicit3.pursdeleted−13
@@ -1,13 +0,0 @@
1−module M1 (X(..)) where
2−
3− data X = X | Y
4− data Z = Z
5−
6−module Main where
7−
8− import M1
9−
10− -- should fail as Z is not exported from M1
11− testZ = M1.Z
12−
13− main = Control.Monad.Eff.Console.log "Done"
examples/manual/failing/ImportExplicit.pursdeleted−7
@@ -1,7 +0,0 @@
1−module M1 where
2−
3− foo = "foo"
4−
5−module Main where
6−
7− import M1 (X(..))
examples/manual/failing/ImportExplicit2.pursdeleted−7
@@ -1,7 +0,0 @@
1−module M1 where
2−
3− data X = Y
4−
5−module Main where
6−
7− import M1 (X(Z, Q))
examples/manual/failing/ImportModule.pursdeleted−7
@@ -1,7 +0,0 @@
1−module M2 where
2−
3− data X = X
4−
5−module Main where
6−
7− import M1
examples/manual/failing/OrphanTypeDecl.pursdeleted−3
@@ -1,3 +0,0 @@
1−module OrphanTypeDecl where
2−
3−fn :: Number -> Boolean
examples/manual/failing/RedefinedFixity.pursdeleted−8
@@ -1,8 +0,0 @@
1−module RedefinedFixity where
2−
3−import Prelude
4−
5−(!?) x y = x + y
6−
7−infix 2 !?
8−infix 2 !?
examples/manual/failing/RequiredHiddenType.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- exporting `a` should fail as `A` is hidden
2−module Foo (B(..), a, b) where
3−
4−data A = A
5−data B = B
6−
7−a = A
8−b = B
examples/manual/passing/ExportExplicit.pursdeleted−20
@@ -1,20 +0,0 @@
1−module M1 (X(X), Z(..), foo) where
2−
3− data X = X | Y
4− data Z = Z
5−
6− foo :: Number
7− foo = 0
8−
9− bar :: Number
10− bar = 1
11−
12−module Main where
13−
14− import M1
15−
16− testX = X
17− testZ = Z
18− testFoo = foo
19−
20− main = Control.Monad.Eff.Console.log "Done"
examples/manual/passing/ExportExplicit2.pursdeleted−15
@@ -1,15 +0,0 @@
1−module M1 (bar) where
2−
3− foo :: Number
4− foo = 0
5−
6− bar :: Number
7− bar = foo
8−
9−module Main where
10−
11− import M1
12−
13− testBar = bar
14−
15− main = Control.Monad.Eff.Console.log "Done"
examples/manual/passing/ExportedInstanceDeclarations.pursdeleted−43
@@ -1,43 +0,0 @@
1−
2−-- Tests that instances for non-exported classes / types do not appear in the
3−-- result of `exportedDeclarations`.
4−
5−module ExportedInstanceDeclarations
6− ( Const(..)
7− , Foo
8− , foo
9− ) where
10−
11−import Prelude
12−
13−data Const a b = Const a
14−
15−class Foo a where
16− foo :: a
17−
18−data NonexportedType = NonexportedType
19−
20−class NonexportedClass a where
21− notExported :: a
22−
23−-- There are three places that a nonexported type or type class can occur,
24−-- leading an instance to count as non-exported:
25−-- * Constraints
26−-- * The type class itself
27−-- * The instance types
28−
29−-- Case 1: constraints
30−instance nonExportedFoo :: (NonexportedClass a) => Foo a where
31− foo = notExported
32−
33−-- Another instance of case 1:
34−instance nonExportedFoo2 :: (Foo NonexportedType) => Foo (a -> a) where
35− foo = id
36−
37−-- Case 2: type class
38−instance nonExportedNonexportedType :: NonexportedClass (Const Number a) where
39− notExported = Const 0
40−
41−-- Case 3: instance types
42−instance constFoo :: Foo (Const NonexportedType b) where
43− foo = Const NonexportedType
examples/manual/passing/Import.pursdeleted−19
@@ -1,19 +0,0 @@
1−module M1 where
2−
3− import Prelude ()
4−
5− id :: forall a. a -> a
6− id = \x -> x
7−
8− foo = id
9−
10−module M2 where
11−
12− import Prelude ()
13− import M1
14−
15− main = \_ -> foo 42
16−
17−module Main where
18−
19−main = Control.Monad.Eff.Console.log "Done"
examples/manual/passing/ImportExplicit.pursdeleted−14
@@ -1,14 +0,0 @@
1−module M1 where
2−
3− data X = X | Y
4− data Z = Z
5−
6−module Main where
7−
8− import M1 (X(..))
9−
10− testX :: X
11− testX = X
12− testY = Y
13−
14− main = Control.Monad.Eff.Console.log "Done"
examples/manual/passing/ImportQualified.pursdeleted−12
@@ -1,12 +0,0 @@
1−module M1 where
2−
3− log x = x
4−
5−module Main where
6−
7− import Prelude
8− import Control.Monad.Eff
9− import M1
10− import qualified Control.Monad.Eff.Console as C
11−
12− main = C.log (log "Done")
examples/manual/passing/Module.pursdeleted−28
@@ -1,28 +0,0 @@
1−module M1 where
2−
3− import Prelude
4−
5− data Foo = Foo String
6−
7− foo :: M1.Foo -> String
8− foo = \f -> case f of Foo s -> s ++ "foo"
9−
10− bar :: Foo -> String
11− bar = foo
12−
13− incr :: Number -> Number
14− incr x = x + 1
15−
16−module M2 where
17−
18− import Prelude
19−
20− baz :: M1.Foo -> String
21− baz = M1.foo
22−
23− match :: M1.Foo -> String
24− match = \f -> case f of M1.Foo s -> s ++ "foo"
25−
26−module Main where
27−
28−main = Control.Monad.Eff.Console.log "Done"
examples/manual/passing/ModuleDeps.pursdeleted−17
@@ -1,17 +0,0 @@
1−module M1 where
2−
3−import M2
4−
5−foo = M3.baz
6−
7−module M2 where
8−
9−bar = M3.baz
10−
11−module M3 where
12−
13−baz = 1
14−
15−module Main where
16−
17−main = Control.Monad.Eff.Console.log "Done"
examples/manual/passing/RedefinedFixity.pursdeleted−24
@@ -1,24 +0,0 @@
1−module M1 where
2−
3−import Prelude ()
4−
5−($) f a = f a
6−
7−infixr 1000 $
8−
9−module M2 where
10−
11−import Prelude ()
12−
13−import M1
14−
15−module M3 where
16−
17−import Prelude ()
18−
19−import M1
20−import M2
21−
22−module Main where
23−
24−main = Control.Monad.Eff.Console.log "Done"
examples/manual/passing/ShadowedName.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−done :: String
7−done = let str = "Not yet done" in
8− let str = "Done" in str
9−
10−main = Control.Monad.Eff.Console.log done
examples/manual/passing/TransitiveImport.pursdeleted−24
@@ -1,24 +0,0 @@
1−module Test where
2−
3− import Prelude
4−
5− class TestCls a where
6− test :: a -> a
7−
8− instance unitTestCls :: TestCls Unit where
9− test _ = unit
10−
11−module Middle where
12−
13− middle = Test.test
14−
15−module Main where
16−
17− import Prelude
18− import Middle
19− import Control.Monad.Eff.Console
20−
21− main = do
22− print (middle unit)
23− trace "Done"
24− return unit
examples/manual/passing/WildcardType.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−f1 :: (_ -> _) -> _
7−f1 g = g 1
8−
9−f2 :: _ -> _
10−f2 _ = "Done"
11−
12−main = Control.Monad.Eff.Console.log $ f1 f2
13−
examples/passing/652.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class Foo a b
6−
7−class Bar a c
8−
9−class (Foo a b, Bar a c) <= Baz a b c
10−
11−instance foo :: Foo (a -> b) a
12−
13−instance bar :: Bar (a -> b) b
14−
15−instance baz :: (Eq a) => Baz (a -> b) a b
16−
17−main = Control.Monad.Eff.Console.log "Done"
examples/passing/810.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Maybe a = Nothing | Just a
6−
7−test :: forall a. Maybe a -> Maybe a
8−test m = o.x
9− where
10− o = case m of Nothing -> { x : Nothing }
11− Just a -> { x : Just a }
12−
13−main = Control.Monad.Eff.Console.log "Done"
examples/passing/862.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−id' = (\x -> x) <$> \y -> y
7−
8−main = log (id' "Done")
examples/passing/922.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−import Control.Monad.Eff.Console
6−
7−class Default a where
8− def :: a
9−
10−instance defaultString :: Default String where
11− def = "Done"
12−
13−data I a = I a
14−
15−instance defaultI :: (Default a) => Default (I a) where
16− def = I def
17−
18−main = do
19− case def of
20− I s -> log s
examples/passing/Applicative.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude ()
4−
5−class Applicative f where
6− pure :: forall a. a -> f a
7− apply :: forall a b. f (a -> b) -> f a -> f b
8−
9−data Maybe a = Nothing | Just a
10−
11−instance applicativeMaybe :: Applicative Maybe where
12− pure = Just
13− apply (Just f) (Just a) = Just (f a)
14− apply _ _ = Nothing
15−
16−main = Control.Monad.Eff.Console.log "Done"
examples/passing/ArrayType.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class Pointed p where
6− point :: forall a. a -> p a
7−
8−instance pointedArray :: Pointed Array where
9− point a = [a]
10−
11−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Auto.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Auto s i o = Auto { state :: s, step :: s -> i -> o }
6−
7−type SomeAuto i o = forall r. (forall s. Auto s i o -> r) -> r
8−
9−exists :: forall s i o. s -> (s -> i -> o) -> SomeAuto i o
10−exists = \state step f -> f (Auto { state: state, step: step })
11−
12−run :: forall i o. SomeAuto i o -> i -> o
13−run = \s i -> s (\a -> case a of Auto a -> a.step a.state i)
14−
15−main = Control.Monad.Eff.Console.log "Done"
examples/passing/AutoPrelude.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−f x = x * 10.0
7−g y = y - 10.0
8−
9−main = log $ show $ (f <<< g) 100.0
examples/passing/AutoPrelude2.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import qualified Prelude as P
5−import Control.Monad.Eff.Console
6−
7−f :: forall a. a -> a
8−f = P.id
9−
10−main = P.($) log ((f P.<<< f) "Done")
examples/passing/BindersInFunctions.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Test.Assert
5−
6−snd = \[_, y] -> y
7−
8−main = do
9− let ts = snd [1.0, 2.0]
10− assert' "Incorrect result from 'snd'." (ts == 2.0)
11− Control.Monad.Eff.Console.log "Done"
examples/passing/BindingGroups.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−foo = bar
6− where bar r = r + 1.0
7−
8−r = foo 2.0
9−
10−main = Control.Monad.Eff.Console.log "Done"
examples/passing/BlockString.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−foo :: String
6−foo = """foo"""
7−
8−main = Control.Monad.Eff.Console.log "Done"
examples/passing/CaseInDo.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−import Control.Monad.Eff
6−
7−doIt :: forall eff. Eff eff Boolean
8−doIt = return true
9−
10−set = do
11− log "Testing..."
12− case 0 of
13− 0 -> doIt
14− _ -> return false
15−
16−main = do
17− b <- set
18− case b of
19− true -> log "Done"
examples/passing/CaseStatement.pursdeleted−21
@@ -1,21 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data A = A | B | C
6−
7−f a _ A = a
8−f _ a B = a
9−f _ _ C = "Done"
10−
11−g a _ A = a
12−g _ b B = b
13−g _ _ C = C
14−
15−data M a = N | J a
16−
17−h f N a = a
18−h f a N = a
19−h f (J a) (J b) = J (f a b)
20−
21−main = Control.Monad.Eff.Console.log $ f "Done" "Failed" A
examples/passing/CheckFunction.pursdeleted−7
@@ -1,7 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test = ((\x -> x+1.0) >>> (\x -> x*2.0)) 4.0
6−
7−main = Control.Monad.Eff.Console.log "Done"
examples/passing/CheckSynonymBug.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−length :: forall a. Array a -> Int
6−length _ = 0
7−
8−type Foo a = Array a
9−
10−foo _ = length ([] :: Foo Number)
11−
12−main = Control.Monad.Eff.Console.log "Done"
examples/passing/CheckTypeClass.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Bar a = Bar
6−data Baz
7−
8−class Foo a where
9− foo :: Bar a -> Baz
10−
11−foo_ :: forall a. (Foo a) => a -> Baz
12−foo_ x = foo ((mkBar :: forall a. (Foo a) => a -> Bar a) x)
13−
14−mkBar :: forall a. a -> Bar a
15−mkBar _ = Bar
16−
17−main = Control.Monad.Eff.Console.log "Done"
18−
examples/passing/Church.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude ()
4−
5−type List a = forall r. r -> (a -> r -> r) -> r
6−
7−empty :: forall a. List a
8−empty = \r f -> r
9−
10−cons :: forall a. a -> List a -> List a
11−cons = \a l r f -> f a (l r f)
12−
13−append :: forall a. List a -> List a -> List a
14−append = \l1 l2 r f -> l2 (l1 r f) f
15−
16−test = append (cons 1 empty) (cons 2 empty)
17−
18−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Collatz.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.ST
6−
7−collatz :: Int -> Int
8−collatz n = runPure (runST (do
9− r <- newSTRef n
10− count <- newSTRef 0
11− untilE $ do
12− modifySTRef count $ (+) 1
13− m <- readSTRef r
14− writeSTRef r $ if m `mod` 2 == 0 then m / 2 else 3 * m + 1
15− return $ m == 1
16− readSTRef count))
17−
18−main = Control.Monad.Eff.Console.print $ collatz 1000
examples/passing/Comparisons.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−import Test.Assert
7−
8−main = do
9− assert (1.0 < 2.0)
10− assert (2.0 == 2.0)
11− assert (3.0 > 1.0)
12− assert ("a" < "b")
13− assert ("a" == "a")
14− assert ("z" > "a")
15− log "Done!"
examples/passing/Conditional.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude ()
4−
5−fns = \f -> if f true then f else \x -> x
6−
7−not = \x -> if x then false else true
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Console.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−
7−replicateM_ :: forall m a. (Monad m) => Number -> m a -> m {}
8−replicateM_ 0.0 _ = return {}
9−replicateM_ n act = do
10− act
11− replicateM_ (n - 1.0) act
12−
13−main = replicateM_ 10.0 (log "Hello World!")
examples/passing/DataAndType.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data A = A B
6−
7−type B = A
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/passing/DeepArrayBinder.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Test.Assert
6−
7−data List a = Cons a (List a) | Nil
8−
9−match2 :: List Number -> Number
10−match2 (Cons x (Cons y xs)) = x * y + match2 xs
11−match2 _ = 0.0
12−
13−main = do
14− let result = match2 (Cons 1.0 (Cons 2.0 (Cons 3.0 (Cons 4.0 (Cons 5.0 (Cons 6.0 (Cons 7.0 (Cons 8.0 (Cons 9.0 Nil)))))))))
15− assert' "Incorrect result!" (result == 100.0)
16− Control.Monad.Eff.Console.log "Done"
examples/passing/DeepCase.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−import Control.Monad.Eff
6−import Control.Monad.ST
7−
8−f x y =
9− let
10− g = case y of
11− 0.0 -> x
12− x -> 1.0 + x * x
13− in g + x + y
14−
15−main = print $ f 1.0 10.0
examples/passing/Do.pursdeleted−67
@@ -1,67 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Maybe a = Nothing | Just a
6−
7−instance functorMaybe :: Functor Maybe where
8− map f Nothing = Nothing
9− map f (Just x) = Just (f x)
10−
11−instance applyMaybe :: Apply Maybe where
12− apply (Just f) (Just x) = Just (f x)
13− apply _ _ = Nothing
14−
15−instance applicativeMaybe :: Applicative Maybe where
16− pure = Just
17−
18−instance bindMaybe :: Bind Maybe where
19− bind Nothing _ = Nothing
20− bind (Just a) f = f a
21−
22−instance monadMaybe :: Prelude.Monad Maybe
23−
24−test1 = \_ -> do
25− Just "abc"
26−
27−test2 = \_ -> do
28− x <- Just 1.0
29− y <- Just 2.0
30− Just (x + y)
31−
32−test3 = \_ -> do
33− Just 1.0
34− Nothing :: Maybe Number
35− Just 2.0
36−
37−test4 mx my = do
38− x <- mx
39− y <- my
40− Just (x + y + 1.0)
41−
42−test5 mx my mz = do
43− x <- mx
44− y <- my
45− let sum = x + y
46− z <- mz
47− Just (z + sum + 1.0)
48−
49−test6 mx = \_ -> do
50− let
51− f :: forall a. Maybe a -> a
52− f (Just x) = x
53− Just (f mx)
54−
55−test8 = \_ -> do
56− Just (do
57− Just 1.0)
58−
59−test9 = \_ -> (+) <$> Just 1.0 <*> Just 2.0
60−
61−test10 _ = do
62− let
63− f x = g x * 3.0
64− g x = f x / 2.0
65− Just (f 10.0)
66−
67−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Dollar.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude ()
4−
5−($) :: forall a b. (a -> b) -> a -> b
6−($) f x = f x
7−
8−infixr 1000 $
9−
10−id x = x
11−
12−test1 x = id $ id $ id $ id $ x
13−
14−test2 x = id id $ id x
15−
16−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Eff.pursdeleted−25
@@ -1,25 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.ST
6−import Control.Monad.Eff.Console
7−
8−test1 = do
9− log "Line 1"
10− log "Line 2"
11−
12−test2 = runPure (runST (do
13− ref <- newSTRef 0.0
14− modifySTRef ref $ \n -> n + 1.0
15− readSTRef ref))
16−
17−test3 = pureST (do
18− ref <- newSTRef 0.0
19− modifySTRef ref $ \n -> n + 1.0
20− readSTRef ref)
21−
22−main = do
23− test1
24− Control.Monad.Eff.Console.print test2
25− Control.Monad.Eff.Console.print test3
examples/passing/EmptyDataDecls.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Test.Assert
5−
6−data Z
7−data S n
8−
9−data ArrayBox n a = ArrayBox (Array a)
10−
11−nil :: forall a. ArrayBox Z a
12−nil = ArrayBox []
13−
14−cons' :: forall a n. a -> ArrayBox n a -> ArrayBox (S n) a
15−cons' x (ArrayBox xs) = ArrayBox $ append [x] xs
16−
17−main = case cons' 1 $ cons' 2 $ cons' 3 nil of
18− ArrayBox [1, 2, 3] -> Control.Monad.Eff.Console.log "Done"
19− _ -> assert' "Failed" false
examples/passing/EmptyRow.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Foo r = Foo { | r }
6−
7−test :: Foo ()
8−test = Foo {}
9−
10−main = Control.Monad.Eff.Console.log "Done"
examples/passing/EmptyTypeClass.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class Partial
6−
7−head :: forall a. (Partial) => Array a -> a
8−head [x] = x
9−
10−instance allowPartials :: Partial
11−
12−main = Control.Monad.Eff.Console.log $ head ["Done"]
examples/passing/EqOrd.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Pair a b = Pair a b
6−
7−instance ordPair :: (Ord a, Ord b) => Ord (Pair a b) where
8− compare (Pair a1 b1) (Pair a2 b2) = case compare a1 a2 of
9− EQ -> compare b1 b2
10− r -> r
11−
12−instance eqPair :: (Eq a, Eq b) => Eq (Pair a b) where
13− eq (Pair a1 b1) (Pair a2 b2) = a1 == a2 && b1 == b2
14−
15−main = Control.Monad.Eff.Console.print $ Pair 1.0 2.0 == Pair 1.0 2.0
examples/passing/ExplicitImportReExport.pursdeleted−16
@@ -1,16 +0,0 @@
1−-- from #1244
2−module Foo where
3−
4− foo :: Int
5− foo = 3
6−
7−module Bar (module Foo) where
8−
9− import Foo
10−
11−module Baz where
12−
13− import Bar (foo)
14−
15− baz :: Int
16− baz = foo
examples/passing/ExtendedInfixOperators.pursdeleted−14
@@ -1,14 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−comparing :: forall a b. (Ord b) => (a -> b) -> a -> a -> Ordering
6−comparing f = compare `Data.Function.on` f
7−
8−null [] = true
9−null _ = false
10−
11−test = [1.0, 2.0, 3.0] `comparing null` [4.0, 5.0, 6.0]
12−
13−main = do
14− Control.Monad.Eff.Console.print test
examples/passing/Fib.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.ST
6−
7−main = runST (do
8− n1 <- newSTRef 1.0
9− n2 <- newSTRef 1.0
10− whileE ((>) 1000.0 <$> readSTRef n1) $ do
11− n1' <- readSTRef n1
12− n2' <- readSTRef n2
13− writeSTRef n2 $ n1' + n2'
14− writeSTRef n1 n2'
15− Control.Monad.Eff.Console.print n2')
examples/passing/FinalTagless.pursdeleted−22
@@ -1,22 +0,0 @@
1−module Main where
2−
3−import Prelude hiding (add)
4−
5−class E e where
6− num :: Number -> e Number
7− add :: e Number -> e Number -> e Number
8−
9−type Expr a = forall e. (E e) => e a
10−
11−data Id a = Id a
12−
13−instance exprId :: E Id where
14− num = Id
15− add (Id n) (Id m) = Id (n + m)
16−
17−runId (Id a) = a
18−
19−three :: Expr Number
20−three = add (num 1.0) (num 2.0)
21−
22−main = Control.Monad.Eff.Console.print $ runId three
examples/passing/FunctionScope.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Test.Assert
5−
6−mkValue :: Number -> Number
7−mkValue id = id
8−
9−main = do
10− let value = mkValue 1.0
11− assert $ value == 1.0
12− Control.Monad.Eff.Console.log "Done"
examples/passing/Functions.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test1 = \_ -> 0.0
6−
7−test2 = \a b -> a + b + 1.0
8−
9−test3 = \a -> a
10−
11−test4 = \(%%) -> 1.0 %% 2.0
12−
13−test5 = \(+++) (***) -> 1.0 +++ 2.0 *** 3.0
14−
15−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Functions2.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Test.Assert
5−
6−test :: forall a b. a -> b -> a
7−test = \const _ -> const
8−
9−main = do
10− let value = test "Done" {}
11− assert' "Not done" $ value == "Done"
12− Control.Monad.Eff.Console.log "Done"
examples/passing/Guards.pursdeleted−29
@@ -1,29 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−collatz = \x -> case x of
6− y | y `mod` 2.0 == 0.0 -> y / 2.0
7− y -> y * 3.0 + 1.0
8−
9−-- Guards have access to current scope
10−collatz2 = \x y -> case x of
11− z | y > 0.0 -> z / 2.0
12− z -> z * 3.0 + 1.0
13−
14−min :: forall a. (Ord a) => a -> a -> a
15−min n m | n < m = n
16− | otherwise = m
17−
18−max :: forall a. (Ord a) => a -> a -> a
19−max n m = case unit of
20− _ | m < n -> n
21− | otherwise -> m
22−
23−testIndentation :: Number -> Number -> Number
24−testIndentation x y | x > 0.0
25− = x + y
26− | otherwise
27− = y - x
28−
29−main = Control.Monad.Eff.Console.log $ min "Done" "ZZZZ"
examples/passing/HoistError.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−import Test.Assert
7−
8−main = do
9− let x = 0.0
10− assert $ x == 0.0
11− let x = 1.0 + 1.0
12− log "Done"
examples/passing/IfThenElseMaybe.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Maybe a = Nothing | Just a
6−
7−test1 = if true then Just 10 else Nothing
8−
9−test2 = if true then Nothing else Just 10
10−
11−main = Control.Monad.Eff.Console.log "Done"
examples/passing/ImplicitEmptyImport.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−main = do
6− Control.Monad.Eff.Console.log "Hello"
7− Control.Monad.Eff.Console.log "Goodbye"
8− Control.Monad.Eff.Console.log "Done"
examples/passing/ImportHiding.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console
4−import Prelude hiding (
5− show, -- a value
6− Show, -- a type class
7− Unit(..) -- a constructor
8− )
9−
10−show = 1.0
11−
12−class Show a where
13− noshow :: a -> a
14−
15−data Unit = X | Y
16−
17−main = do
18− print show
examples/passing/InferRecFunWithConstrainedArgument.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test 100.0 = 100.0
6−test n = test(1.0 + n)
7−
8−main = Control.Monad.Eff.Console.print $ test 0.0
examples/passing/InstanceBeforeClass.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−instance fooNumber :: Foo Number where
6− foo = 0.0
7−
8−class Foo a where
9− foo :: a
10−
11−main = Control.Monad.Eff.Console.log "Done"
examples/passing/IntAndChar.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Test.Assert
6−
7−f 1 = 1
8−f _ = 0
9−
10−g 'a' = 'a'
11−g _ = 'b'
12−
13−main = do
14− assert $ f 1 == 1
15− assert $ f 0 == 0
16− assert $ g 'a' == 'a'
17− assert $ g 'b' == 'b'
18− Control.Monad.Eff.Console.log "Done"
examples/passing/JSReserved.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−yield = 0
6−member = 1
7−
8−public = \return -> return
9−
10−this catch = catch
11−
12−main = Control.Monad.Eff.Console.log "Done"
examples/passing/KindedType.pursdeleted−33
@@ -1,33 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−type Star2Star f = f :: * -> *
6−
7−type Star t = t :: *
8−
9−test1 :: Star2Star Array String
10−test1 = ["test"]
11−
12−f :: Star (String -> String)
13−f s = s
14−
15−test2 = f "test"
16−
17−data Proxy (f :: * -> *) = Proxy
18−
19−test3 :: Proxy Array
20−test3 = Proxy
21−
22−type Test (f :: * -> *) = f String
23−
24−test4 :: Test Array
25−test4 = ["test"]
26−
27−class Clazz (a :: *) where
28− def :: a
29−
30−instance clazzString :: Clazz String where
31− def = "test"
32−
33−main = Control.Monad.Eff.Console.log "Done"
examples/passing/LargeSumType.pursdeleted−33
@@ -1,33 +0,0 @@
1−module Main where
2−
3−data Large = A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
4−
5−explode A A = "A"
6−explode B B = "B"
7−explode C C = "C"
8−explode D D = "D"
9−explode E E = "E"
10−explode F F = "F"
11−explode G G = "G"
12−explode H H = "H"
13−explode I I = "I"
14−explode J J = "J"
15−explode K K = "K"
16−explode L L = "L"
17−explode M M = "M"
18−explode N N = "N"
19−explode O O = "O"
20−explode P P = "P"
21−explode Q Q = "Q"
22−explode R R = "R"
23−explode S S = "S"
24−explode T T = "T"
25−explode U U = "U"
26−explode V V = "V"
27−explode W W = "W"
28−explode X X = "X"
29−explode Y Y = "Y"
30−explode Z Z = "Z"
31−explode _ _ = ""
32−
33−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Let.pursdeleted−53
@@ -1,53 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.ST
6−
7−test1 x = let
8− y :: Number
9− y = x + 1.0
10− in y
11−
12−test2 x y =
13− let x' = x + 1.0 in
14− let y' = y + 1.0 in
15− x' + y'
16−
17−test3 = let f x y z = x + y + z in
18− f 1.0 2.0 3.0
19−
20−test4 = let f x [y, z] = x y z in
21− f (+) [1.0, 2.0]
22−
23−test5 = let
24− f x | x > 0.0 = g (x / 2.0) + 1.0
25− f x = 0.0
26− g x = f (x - 1.0) + 1.0
27− in f 10.0
28−
29−test7 = let
30− f :: forall a. a -> a
31− f x = x
32− in if f true then f 1.0 else f 2.0
33−
34−test8 :: Number -> Number
35−test8 x = let
36− go y | (x - 0.1 < y * y) && (y * y < x + 0.1) = y
37− go y = go $ (y + x / y) / 2.0
38− in go x
39−
40−test10 _ =
41− let
42− f x = g x * 3.0
43− g x = f x / 2.0
44− in f 10.0
45−
46−main = do
47− Control.Monad.Eff.Console.print (test1 1.0)
48− Control.Monad.Eff.Console.print (test2 1.0 2.0)
49− Control.Monad.Eff.Console.print test3
50− Control.Monad.Eff.Console.print test4
51− Control.Monad.Eff.Console.print test5
52− Control.Monad.Eff.Console.print test7
53− Control.Monad.Eff.Console.print (test8 100.0)
examples/passing/Let2.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test =
6− let f :: Number -> Boolean
7− f 0.0 = false
8− f n = g (n - 1.0)
9−
10− g :: Number -> Boolean
11− g 0.0 = true
12− g n = f (n - 1.0)
13−
14− x = f 1.0
15− in not x
16−
17−main = Control.Monad.Eff.Console.print test
examples/passing/LetInInstance.pursdeleted−14
@@ -1,14 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class Foo a where
6− foo :: a -> String
7−
8−instance fooString :: Foo String where
9− foo = go
10− where
11− go :: String -> String
12− go s = s
13−
14−main = Control.Monad.Eff.Console.log "Done"
examples/passing/LiberalTypeSynonyms.pursdeleted−21
@@ -1,21 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−type Reader = (->) String
6−
7−foo :: Reader String
8−foo s = s
9−
10−type AndFoo r = (foo :: String | r)
11−
12−getFoo :: forall r. Prim.Object (AndFoo r) -> String
13−getFoo o = o.foo
14−
15−type F r = { | r } -> { | r }
16−
17−f :: (forall r. F r) -> String
18−f g = case g { x: "Hello" } of
19− { x = x } -> x
20−
21−main = Control.Monad.Eff.Console.log "Done"
examples/passing/MPTCs.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class NullaryTypeClass where
6− greeting :: String
7−
8−instance nullaryTypeClass :: NullaryTypeClass where
9− greeting = "Hello, World!"
10−
11−class Coerce a b where
12− coerce :: a -> b
13−
14−instance coerceRefl :: Coerce a a where
15− coerce a = a
16−
17−instance coerceShow :: (Prelude.Show a) => Coerce a String where
18− coerce = show
19−
20−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Match.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Foo a = Foo
6−
7−foo = \f -> case f of Foo -> "foo"
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/passing/ModuleExport.pursdeleted−9
@@ -1,9 +0,0 @@
1−module A (module Prelude) where
2− import Prelude
3−
4−module Main where
5− import Control.Monad.Eff.Console
6− import A
7−
8− main = do
9− print (show 1.0)
examples/passing/ModuleExportDupes.pursdeleted−19
@@ -1,19 +0,0 @@
1−module A (module Prelude) where
2− import Prelude
3−
4−module B (module Prelude) where
5− import Prelude
6−
7−module C (module Prelude, module A) where
8− import Prelude
9− import A
10−
11−module Main where
12− import Control.Monad.Eff.Console
13− import A
14− import B
15− import C
16− import Prelude
17−
18− main = do
19− print (show 1.0)
examples/passing/ModuleExportExcluded.pursdeleted−14
@@ -1,14 +0,0 @@
1−module A (module Prelude, foo) where
2− import Prelude
3−
4− foo :: Number -> Number
5− foo _ = 0.0
6−
7−module Main where
8− import Control.Monad.Eff.Console
9− import A (foo)
10−
11− otherwise = false
12−
13− main = do
14− print "1.0"
examples/passing/ModuleExportQualified.pursdeleted−9
@@ -1,9 +0,0 @@
1−module A (module Prelude) where
2− import Prelude
3−
4−module Main where
5− import Control.Monad.Eff.Console
6− import qualified A as B
7−
8− main = do
9− print (B.show 1.0)
examples/passing/ModuleExportSelf.pursdeleted−14
@@ -1,14 +0,0 @@
1−module A (module A, module Prelude) where
2− import Prelude
3−
4− type Foo = Boolean
5−
6−module Main where
7− import Control.Monad.Eff.Console
8− import A
9−
10− bar :: Foo
11− bar = true
12−
13− main = do
14− print (show bar)
examples/passing/Monad.pursdeleted−32
@@ -1,32 +0,0 @@
1−module Main where
2−
3−import Prelude ()
4−
5−type Monad m = { return :: forall a. a -> m a
6− , bind :: forall a b. m a -> (a -> m b) -> m b }
7−
8−data Id a = Id a
9−
10−id :: Monad Id
11−id = { return : Id
12− , bind : \ma f -> case ma of Id a -> f a }
13−
14−data Maybe a = Nothing | Just a
15−
16−maybe :: Monad Maybe
17−maybe = { return : Just
18− , bind : \ma f -> case ma of
19− Nothing -> Nothing
20− Just a -> f a
21− }
22−
23−test :: forall m. Monad m -> m Number
24−test = \m -> m.bind (m.return 1.0) (\n1 ->
25− m.bind (m.return "Test") (\n2 ->
26− m.return n1))
27−
28−test1 = test id
29−
30−test2 = test maybe
31−
32−main = Control.Monad.Eff.Console.log "Done"
examples/passing/MonadState.pursdeleted−48
@@ -1,48 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Tuple a b = Tuple a b
6−
7−class MonadState s m where
8− get :: m s
9− put :: s -> m {}
10−
11−data State s a = State (s -> Tuple s a)
12−
13−runState s (State f) = f s
14−
15−instance functorState :: Functor (State s) where
16− map = liftM1
17−
18−instance applyState :: Apply (State s) where
19− apply = ap
20−
21−instance applicativeState :: Applicative (State s) where
22− pure a = State $ \s -> Tuple s a
23−
24−instance bindState :: Bind (State s) where
25− bind f g = State $ \s -> case runState s f of
26− Tuple s1 a -> runState s1 (g a)
27−
28−instance monadState :: Monad (State s)
29−
30−instance monadStateState :: MonadState s (State s) where
31− get = State (\s -> Tuple s s)
32− put s = State (\_ -> Tuple s {})
33−
34−modify :: forall m s. (Prelude.Monad m, MonadState s m) => (s -> s) -> m {}
35−modify f = do
36− s <- get
37− put (f s)
38−
39−test :: Tuple String String
40−test = runState "" $ do
41− modify $ (++) "World!"
42− modify $ (++) "Hello, "
43− get
44−
45−main = do
46− let t1 = test
47− Control.Monad.Eff.Console.log "Done"
48−
examples/passing/MultiArgFunctions.pursdeleted−27
@@ -1,27 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Data.Function
5−import Control.Monad.Eff
6−import Control.Monad.Eff.Console
7−
8−f = mkFn2 $ \a b -> runFn2 g a b + runFn2 g b a
9−
10−g = mkFn2 $ \a b -> case {} of
11− _ | a <= 0.0 || b <= 0.0 -> b
12− _ -> runFn2 f (a - 0.0) (b - 0.0)
13−
14−main = do
15− runFn0 (mkFn0 $ \_ -> log $ show 0.0)
16− runFn1 (mkFn1 $ \a -> log $ show a) 0.0
17− runFn2 (mkFn2 $ \a b -> log $ show [a, b]) 0.0 0.0
18− runFn3 (mkFn3 $ \a b c -> log $ show [a, b, c]) 0.0 0.0 0.0
19− runFn4 (mkFn4 $ \a b c d -> log $ show [a, b, c, d]) 0.0 0.0 0.0 0.0
20− runFn5 (mkFn5 $ \a b c d e -> log $ show [a, b, c, d, e]) 0.0 0.0 0.0 0.0 0.0
21− runFn6 (mkFn6 $ \a b c d e f -> log $ show [a, b, c, d, e, f]) 0.0 0.0 0.0 0.0 0.0 0.0
22− runFn7 (mkFn7 $ \a b c d e f g -> log $ show [a, b, c, d, e, f, g]) 0.0 0.0 0.0 0.0 0.0 0.0 0.0
23− runFn8 (mkFn8 $ \a b c d e f g h -> log $ show [a, b, c, d, e, f, g, h]) 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
24− runFn9 (mkFn9 $ \a b c d e f g h i -> log $ show [a, b, c, d, e, f, g, h, i]) 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
25− runFn10 (mkFn10 $ \a b c d e f g h i j-> log $ show [a, b, c, d, e, f, g, h, i, j]) 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
26− print $ runFn2 g 0.0 0.0
27− log "Done!"
examples/passing/MutRec.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−f 0.0 = 0.0
6−f x = g x + 0.0
7−
8−g x = f (x / 0.0)
9−
10−data Even = Zero | Even Odd
11−
12−data Odd = Odd Even
13−
14−evenToNumber Zero = 0.0
15−evenToNumber (Even n) = oddToNumber n + 0.0
16−
17−oddToNumber (Odd n) = evenToNumber n + 0.0
18−
19−main = Control.Monad.Eff.Console.log "Done"
examples/passing/MutRec2.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data A = A B
6−
7−data B = B A
8−
9−foreign import data S :: *
10−
11−f :: A -> S
12−f a = case a of A b -> g b
13−
14−g b = case b of B a -> f a
15−
16−showN :: A -> S
17−showN a = f a
18−
19−main = Control.Monad.Eff.Console.log "Done"
examples/passing/MutRec3.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data A = A B
6−
7−data B = B A
8−
9−foreign import data S :: *
10−
11−f a = case a of A b -> g b
12−
13−g :: B -> S
14−g b = case b of B a -> f a
15−
16−showN :: A -> S
17−showN a = f a
18−
19−main = Control.Monad.Eff.Console.log "Done"
examples/passing/NakedConstraint.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console
4−
5−class Partial where
6−
7−data List a = Nil | Cons a (List a)
8−
9−head :: (Partial) => List Int -> Int
10−head (Cons x _) = x
11−
12−main = log "Done"
examples/passing/NamedPatterns.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−foo = \x -> case x of
6− y@{ foo = "Foo" } -> y
7− y -> y
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/passing/NegativeBinder.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test :: Number -> Boolean
6−test -1.0 = false
7−test _ = true
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Nested.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Extend r a = Extend { prev :: r a, next :: a }
6−
7−data Matrix r a = Square (r (r a)) | Bigger (Matrix (Extend r) a)
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/passing/NestedTypeSynonyms.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−type X = String
6−type Y = X -> X
7−
8−fn :: Y
9−fn a = a
10−
11−main = Control.Monad.Eff.Console.print (fn "Done")
examples/passing/NestedWhere.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−f x = g x
6− where
7− g x = go x
8− where
9− go x = go1 (x - 1.0)
10− go1 x = go x
11−
12−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Newtype.pursdeleted−23
@@ -1,23 +0,0 @@
1−module Main where
2−
3−import Prelude hiding (apply)
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−
7−newtype Thing = Thing String
8−
9−instance showThing :: Show Thing where
10− show (Thing x) = "Thing " ++ show x
11−
12−newtype Box a = Box a
13−
14−instance showBox :: (Show a) => Show (Box a) where
15− show (Box x) = "Box " ++ show x
16−
17−apply f x = f x
18−
19−main = do
20− print $ Thing "hello"
21− print $ Box 42.0
22− print $ apply Box 9000.0
23− log "Done"
examples/passing/NewtypeEff.pursdeleted−29
@@ -1,29 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−import Control.Monad.Eff
6−
7−newtype T a = T (Eff (console :: CONSOLE) a)
8−
9−runT :: forall a. T a -> Eff (console :: CONSOLE) a
10−runT (T t) = t
11−
12−instance functorT :: Functor T where
13− map f (T t) = T (f <$> t)
14−
15−instance applyT :: Apply T where
16− apply (T f) (T x) = T (f <*> x)
17−
18−instance applicativeT :: Applicative T where
19− pure t = T (pure t)
20−
21−instance bindT :: Bind T where
22− bind (T t) f = T (t >>= \x -> runT (f x))
23−
24−instance monadT :: Monad T
25−
26−main = runT do
27− T $ log "Done"
28− T $ log "Done"
29− T $ log "Done"
examples/passing/NewtypeWithRecordUpdate.pursdeleted−16
@@ -1,16 +0,0 @@
1−-- https://github.com/purescript/purescript/issues/812.0
2−
3−module Main where
4−
5−import Prelude
6−import Control.Monad.Eff.Console
7−
8−newtype NewType a = NewType (Object a)
9−
10−rec1 :: Object (a :: Number, b :: Number, c:: Number)
11−rec1 = { a: 0.0, b: 0.0, c: 0.0 }
12−
13−rec2 :: NewType (a :: Number, b :: Number, c :: Number)
14−rec2 = NewType (rec1 { a = 1.0 })
15−
16−main = log "Done"
examples/passing/ObjectGetter.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−getX = _.x
6−
7−point = { x: 1.0, y: 0.0 }
8−
9−main = do
10− Control.Monad.Eff.Console.print $ getX point
11− Control.Monad.Eff.Console.log $ _." 123 string Prop Name " { " 123 string Prop Name ": "OK" }
12− Control.Monad.Eff.Console.log $ (_.x >>> _.y) { x: { y: "Nested" } }
13− Control.Monad.Eff.Console.log $ _.value { value: "Done!" }
examples/passing/ObjectSynonym.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−type Inner = Number
6−
7−inner :: Inner
8−inner = 0.0
9−
10−type Outer = { inner :: Inner }
11−
12−outer :: Outer
13−outer = { inner: inner }
14−
15−main = Control.Monad.Eff.Console.log "Done"
examples/passing/ObjectUpdate.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−update1 = \o -> o { foo = "Foo" }
6−
7−update2 :: forall r. { foo :: String | r } -> { foo :: String | r }
8−update2 = \o -> o { foo = "Foo" }
9−
10−replace = \o -> case o of
11− { foo = "Foo" } -> o { foo = "Bar" }
12− { foo = "Bar" } -> o { bar = "Baz" }
13− o -> o
14−
15−polyUpdate :: forall a r. { foo :: a | r } -> { foo :: String | r }
16−polyUpdate = \o -> o { foo = "Foo" }
17−
18−inferPolyUpdate = \o -> o { foo = "Foo" }
19−
20−main = Control.Monad.Eff.Console.log ((update1 {foo: ""}).foo)
examples/passing/ObjectUpdate2.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−type X r = { | r }
6−
7−x :: X (baz :: String)
8−x = { baz: "baz" }
9−
10−blah :: forall r. X r -> X r
11−blah x = x
12−
13−test = blah x
14− { baz = "blah"
15− }
16−
17−main = Control.Monad.Eff.Console.log "Done"
examples/passing/ObjectUpdater.pursdeleted−24
@@ -1,24 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−import Test.Assert
7−
8−getValue :: forall e. Eff (| e) Boolean
9−getValue = return true
10−
11−main = do
12− let record = { value: false }
13− record' <- record { value = _ } <$> getValue
14− assert $ record'.value == true
15−
16− let point = { x: 1.0, y: 1.0 }
17− x = 10.0
18− point' = (point { x = _, y = x }) 100.0
19−
20− assert $ point'.x == 100.0
21− assert $ point'.y == 10.0
22−
23− let record2 = (_ { x = _ }) { x: 0.0 } 10.0
24− assert $ record2.x == 10.0
examples/passing/ObjectWildcards.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−import Test.Assert
7−
8−mkRecord = { foo: _, bar: _, baz: "baz" }
9−
10−getValue :: forall e. Eff (| e) Boolean
11−getValue = return true
12−
13−main = do
14− obj <- { value: _ } <$> getValue
15− print obj.value
16− let x = 1.0
17− point <- { x: _, y: x } <$> return 2.0
18− assert $ point.x == 2.0
19− assert $ point.y == 1.0
20− log (mkRecord 1.0 "Done!").bar
examples/passing/Objects.pursdeleted−35
@@ -1,35 +0,0 @@
1−module Main where
2−
3−import Prelude hiding (append)
4−
5−test = \x -> x.foo + x.bar + 1.0
6−
7−append = \o -> { foo: o.foo, bar: 1.0 }
8−
9−apTest = append({foo : "Foo", baz: "Baz"})
10−
11−f = (\a -> a.b.c) { b: { c: 1.0, d: "Hello" }, e: "World" }
12−
13−g = (\a -> a.f { x: 1.0, y: "y" }) { f: \o -> o.x + 1.0 }
14−
15−typed :: { foo :: Number }
16−typed = { foo: 0.0 }
17−
18−test2 = \x -> x."!@#"
19−
20−test3 = typed."foo"
21−
22−test4 = test2 weirdObj
23− where
24− weirdObj :: { "!@#" :: Number }
25− weirdObj = { "!@#": 1.0 }
26−
27−test5 = case { "***": 1.0 } of
28− { "***" = n } -> n
29−
30−test6 = case { "***": 1.0 } of
31− { "***": n } -> n
32−
33−test7 {a: snoog , b : blah } = blah
34−
35−main = Control.Monad.Eff.Console.log "Done"
examples/passing/OneConstructor.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data One a = One a
6−
7−one' (One a) = a
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/passing/OperatorAssociativity.pursdeleted−25
@@ -1,25 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−import Test.Assert
7−
8−bug :: Number -> Number -> Number
9−bug a b = 0.0 - (a - b)
10−
11−main = do
12− assert (bug 0.0 2.0 == 2.0)
13− assert (0.0 - (0.0 - 2.0) == 2.0)
14− assert (0.0 - (0.0 + 2.0) == -2.0)
15− assert (6.0 / (3.0 * 2.0) == 1.0)
16− assert ((6.0 / 3.0) * 2.0 == 4.0)
17− assert (not (1.0 < 0.0) == true)
18− assert (not ((negate 1.0) < 0.0) == false)
19− assert (negate (1.0 + 10.0) == -11.0)
20− assert (2.0 * 3.0 / 4.0 == 1.5)
21− assert (1.0 * 2.0 * 3.0 * 4.0 * 5.0 / 6.0 == 20.0)
22− assert (1.0 + 10.0 - 5.0 == 6.0)
23− assert (1.0 + 10.0 * 5.0 == 51.0)
24− assert (10.0 * 5.0 - 1.0 == 49.0)
25− log "Success!"
examples/passing/OperatorInlining.pursdeleted−47
@@ -1,47 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−main = do
7−
8− -- semiringNumber
9− print (1.0 + 2.0)
10− print (1.0 * 2.0)
11−
12− -- ringNumber
13− print (1.0 - 2.0)
14− print (negate 1.0)
15−
16− -- moduleSemiringNumber
17− print (1.0 / 2.0)
18−
19− -- ordNumber
20− print (1.0 > 2.0)
21− print (1.0 < 2.0)
22− print (1.0 <= 2.0)
23− print (1.0 >= 2.0)
24− print (1.0 == 2.0)
25−
26− -- eqNumber
27− print (1.0 == 2.0)
28− print (1.0 /= 2.0)
29−
30− -- eqString
31− print ("foo" == "bar")
32− print ("foo" /= "bar")
33−
34− -- eqBoolean
35− print (true == false)
36− print (true /= false)
37−
38− -- semigroupString
39− print ("foo" ++ "bar")
40− print ("foo" <> "bar")
41−
42− -- latticeBoolean
43− print (top && true)
44− print (bottom || false)
45−
46− -- complementedLatticeBoolean
47− print (not true)
examples/passing/OperatorSections.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Test.Assert
5−
6−main = do
7− assert $ (/ 2.0) 4.0 == 2.0
8− assert $ (2.0 /) 4.0 == 0.5
9− assert $ (`const` 1.0) 2.0 == 2.0
10− assert $ (1.0 `const`) 2.0 == 1.0
11− Control.Monad.Eff.Console.log "Done!"
examples/passing/Operators.pursdeleted−99
@@ -1,99 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−
7−(?!) :: forall a. a -> a -> a
8−(?!) x _ = x
9−
10−bar :: String -> String -> String
11−bar = \s1 s2 -> s1 ++ s2
12−
13−test1 :: forall n. (Num n) => n -> n -> (n -> n -> n) -> n
14−test1 x y z = x * y + z x y
15−
16−test2 = (\x -> x.foo false) { foo : \_ -> 1.0 }
17−
18−test3 = (\x y -> x)(1.0 + 2.0 * (1.0 + 2.0)) (true && (false || false))
19−
20−k = \x -> \y -> x
21−
22−test4 = 1 `k` 2
23−
24−infixl 5 %%
25−
26−(%%) :: Number -> Number -> Number
27−(%%) x y = x * y + y
28−
29−test5 = 1.0 %% 2.0 %% 3.0
30−
31−test6 = ((\x -> x) `k` 2.0) 3.0
32−
33−(<+>) :: String -> String -> String
34−(<+>) = \s1 s2 -> s1 ++ s2
35−
36−test7 = "Hello" <+> "World!"
37−
38−(@@) :: forall a b. (a -> b) -> a -> b
39−(@@) = \f x -> f x
40−
41−foo :: String -> String
42−foo = \s -> s
43−
44−test8 = foo @@ "Hello World"
45−
46−test9 = Main.foo @@ "Hello World"
47−
48−test10 = "Hello" `Main.bar` "World"
49−
50−(...) :: forall a. Array a -> Array a -> Array a
51−(...) = \as -> \bs -> as
52−
53−test11 = [1.0, 2.0, 0.0] ... [4.0, 5.0, 6.0]
54−
55−test12 (<%>) a b = a <%> b
56−
57−test13 = \(<%>) a b -> a <%> b
58−
59−test14 :: Number -> Number -> Boolean
60−test14 a b = a < b
61−
62−test15 :: Number -> Number -> Boolean
63−test15 a b = const false $ a `test14` b
64−
65−test17 :: Number
66−test17 = negate (-1.0)
67−
68−test18 :: Number
69−test18 = negate $ negate 1.0
70−
71−test19 :: Number
72−test19 = negate $ negate (-1.0)
73−
74−test20 :: Number
75−test20 = 1.0 @ 2.0
76− where
77− (@) x y = x + y * y
78−
79−main = do
80− let t1 = test1 1.0 2.0 (\x y -> x + y)
81− let t2 = test2
82− let t3 = test3
83− let t4 = test4
84− let t5 = test5
85− let t6 = test6
86− let t7 = test7
87− let t8 = test8
88− let t9 = test9
89− let t10 = test10
90− let t11 = test11
91− let t12 = test12 k 1.0 2.0
92− let t13 = test13 k 1.0 2.0
93− let t14 = test14 1.0 2.0
94− let t15 = test15 1.0 2.0
95− let t17 = test17
96− let t18 = test18
97− let t19 = test19
98− let t20 = test20
99− log "Done"
examples/passing/OptimizerBug.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−x a = 1.0 + y a
6−
7−y a = x a
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/passing/OptionalQualified.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−-- qualified import with the "qualified" keyword
4−import qualified Prelude as P
5−
6−-- qualified import without the "qualified" keyword
7−import Control.Monad.Eff.Console as Console
8−
9−bind = P.bind
10−
11−main = do
12− message <- P.return "success!"
13− Console.log message
examples/passing/OverlappingInstances.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data A = A
6−
7−instance showA1 :: Show A where
8− show A = "Instance 1"
9−
10−instance showA2 :: Show A where
11− show A = "Instance 2"
12−
13−main = Test.Assert.assert $ show A == "Instance 1"
examples/passing/OverlappingInstances2.pursdeleted−23
@@ -1,23 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data A = A | B
6−
7−instance eqA1 :: Eq A where
8− eq A A = true
9− eq B B = true
10− eq _ _ = false
11−
12−instance eqA2 :: Eq A where
13− eq _ _ = true
14−
15−instance ordA :: Ord A where
16− compare A B = LT
17− compare B A = GT
18− compare _ _ = EQ
19−
20−test :: forall a. (Ord a) => a -> a -> String
21−test x y = show $ x == y
22−
23−main = Test.Assert.assert $ test A B == "false"
examples/passing/OverlappingInstances3.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class Foo a
6−
7−instance foo1 :: Foo Number
8−
9−instance foo2 :: Foo Number
10−
11−test :: forall a. (Foo a) => a -> a
12−test a = a
13−
14−test1 = test 0.0
15−
16−main = Test.Assert.assert (test1 == 0.0)
examples/passing/PartialFunction.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Test.Assert
5−
6−fn :: Number -> Number
7−fn 0.0 = 0.0
8−fn 1.0 = 2.0
9−
10−main = assertThrows $ \_ -> fn 2.0
examples/passing/Patterns.pursdeleted−22
@@ -1,22 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test = \x -> case x of
6− { str = "Foo", bool = true } -> true
7− { str = "Bar", bool = b } -> b
8− _ -> false
9−
10−f = \o -> case o of
11− { foo = "Foo" } -> o.bar
12− _ -> 0
13−
14−h = \o -> case o of
15− a@[_,_,_] -> a
16− _ -> []
17−
18−isDesc :: Array Number -> Boolean
19−isDesc [x, y] | x > y = true
20−isDesc _ = false
21−
22−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Person.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Person = Person { name :: String, age :: Number }
6−
7−showPerson :: Person -> String
8−showPerson = \p -> case p of
9− Person o -> o.name ++ ", aged " ++ show o.age
10−
11−main = Control.Monad.Eff.Console.log "Done"
examples/passing/QualifiedQualifiedImports.pursdeleted−6
@@ -1,6 +0,0 @@
1−module Main where
2−
3−-- qualified import with qualified imported names
4−import qualified Control.Monad.Eff.Console (log) as Console
5−
6−main = Console.log "Success!"
examples/passing/Rank2Data.pursdeleted−29
@@ -1,29 +0,0 @@
1−module Main where
2−
3−import Prelude hiding (add)
4−
5−data Id = Id forall a. a -> a
6−
7−runId = \id a -> case id of
8− Id f -> f a
9−
10−data Nat = Nat forall r. r -> (r -> r) -> r
11−
12−runNat = \nat -> case nat of
13− Nat f -> f 0.0 (\n -> n + 1.0)
14−
15−zero' = Nat (\zero' _ -> zero')
16−
17−succ = \n -> case n of
18− Nat f -> Nat (\zero' succ -> succ (f zero' succ))
19−
20−add = \n m -> case n of
21− Nat f -> case m of
22− Nat g -> Nat (\zero' succ -> g (f zero' succ) succ)
23−
24−one' = succ zero'
25−two = succ zero'
26−four = add two two
27−fourNumber = runNat four
28−
29−main = Control.Monad.Eff.Console.log "Done'"
examples/passing/Rank2Object.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−data Foo = Foo { id :: forall a. a -> a }
7−
8−foo :: Foo -> Number
9−foo (Foo { id = f }) = f 0.0
10−
11−main = log "Done"
examples/passing/Rank2TypeSynonym.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−
6−type Foo a = forall f. (Monad f) => f a
7−
8−foo :: forall a. a -> Foo a
9−foo x = pure x
10−
11−bar :: Foo Number
12−bar = foo 3.0
13−
14−main = do
15− x <- bar
16− Control.Monad.Eff.Console.print x
examples/passing/Rank2Types.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test1 :: (forall a. (a -> a)) -> Number
6−test1 = \f -> f 0.0
7−
8−forever :: forall m a b. (forall a b. m a -> (a -> m b) -> m b) -> m a -> m b
9−forever = \bind action -> bind action $ \_ -> forever bind action
10−
11−main = Control.Monad.Eff.Console.log "Done"
examples/passing/ReExportQualified.pursdeleted−16
@@ -1,16 +0,0 @@
1−module A where
2− x = "Do"
3−
4−module B where
5− y = "ne"
6−
7−module C (module A, module M2) where
8− import A
9− import qualified B as M2
10−
11−module Main where
12−
13− import Prelude
14− import C
15−
16− main = Control.Monad.Eff.Console.log (x ++ y)
examples/passing/RebindableSyntax.pursdeleted−39
@@ -1,39 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−example1 :: String
6−example1 = do
7− "Do"
8− " notation"
9− " for"
10− " Semigroup"
11− where
12− bind x f = x <> f unit
13−
14−(*>) :: forall f a b. (Apply f) => f a -> f b -> f b
15−(*>) fa fb = const id <$> fa <*> fb
16−
17−newtype Const a b = Const a
18−
19−runConst :: forall a b. Const a b -> a
20−runConst (Const a) = a
21−
22−instance functorConst :: Functor (Const a) where
23− map _ (Const a) = Const a
24−
25−instance applyConst :: (Semigroup a) => Apply (Const a) where
26− apply (Const a1) (Const a2) = Const (a1 <> a2)
27−
28−example2 :: Const String Unit
29−example2 = do
30− Const "Do"
31− Const " notation"
32− Const " for"
33− Const " Apply"
34− where
35− bind x f = x *> f unit
36−
37−main = do
38− Control.Monad.Eff.Console.log example1
39− Control.Monad.Eff.Console.log $ runConst example2
examples/passing/Recursion.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−fib = \n -> case n of
6− 0.0 -> 1.0
7− 1.0 -> 1.0
8− n -> fib (n - 1.0) + fib (n - 2.0)
9−
10−main = Control.Monad.Eff.Console.log "Done"
examples/passing/ReservedWords.pursdeleted−15
@@ -1,15 +0,0 @@
1−-- See https://github.com/purescript/purescript/issues/606
2−module Main where
3−
4−import Prelude
5−
6−o :: { type :: String }
7−o = { type: "o" }
8−
9−p :: { type :: String }
10−p = o { type = "p" }
11−
12−f :: forall r. { type :: String | r } -> String
13−f { type = "p" } = "Done"
14−
15−main = Control.Monad.Eff.Console.log $ f { type: p.type, foo: "bar" }
examples/passing/RowConstructors.pursdeleted−42
@@ -1,42 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−type Foo = (x :: Number | (y :: Number | (z :: Number)))
6−type Bar = (x :: Number, y :: Number, z :: Number)
7−type Baz = { w :: Number | Bar }
8−
9−foo :: { | Foo }
10−foo = { x: 0.0, y: 0.0, z: 0.0 }
11−
12−bar :: { | Bar }
13−bar = { x: 0.0, y: 0.0, z: 0.0 }
14−
15−id' :: Object Foo -> Object Bar
16−id' = id
17−
18−foo' :: { | Foo }
19−foo' = id' foo
20−
21−bar' :: { | Bar }
22−bar' = id' bar
23−
24−baz :: Baz
25−baz = { x: 0.0, y: 0.0, z: 0.0, w: 0.0 }
26−
27−type Quux r = (q :: Number | r)
28−type Norf r = (q' :: Number | Quux r)
29−
30−quux :: { f :: { | Foo } | Quux Bar }
31−quux = { f: foo', x: 0.0, y: 0.0, z: 0.0, q: 0.0 }
32−
33−quux' :: { | Norf Bar }
34−quux' = { x: 0.0, y: 0.0, z: 0.0, q: 0.0, q': 0.0 }
35−
36−wildcard :: { w :: Number | _ } -> Baz
37−wildcard { w: w } = { x: w, y: w, z: w, w: w }
38−
39−wildcard' :: { | Quux _ } -> Number
40−wildcard' { q: q } = q
41−
42−main = Control.Monad.Eff.Console.log "Done"
examples/passing/RowPolyInstanceContext.pursdeleted−22
@@ -1,22 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class T s m where
6− state :: (s -> s) -> m Unit
7−
8−data S s a = S (s -> { new :: s, ret :: a })
9−
10−instance st :: T s (S s) where
11− state f = S $ \s -> { new: f s, ret: unit }
12−
13−test1 :: forall r . S { foo :: String | r } Unit
14−test1 = state $ \o -> o { foo = o.foo ++ "!" }
15−
16−test2 :: forall m r . (T { foo :: String | r } m) => m Unit
17−test2 = state $ \o -> o { foo = o.foo ++ "!" }
18−
19−main = do
20− let t1 = test1
21− let t2 = test2
22− Control.Monad.Eff.Console.log "Done"
examples/passing/RuntimeScopeIssue.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class A a where
6− a :: a -> Boolean
7−
8−class B a where
9− b :: a -> Boolean
10−
11−instance aNumber :: A Number where
12− a 0.0 = true
13− a n = b (n - 1.0)
14−
15−instance bNumber :: B Number where
16− b 0.0 = false
17− b n = a (n - 1.0)
18−
19−main = Control.Monad.Eff.Console.print $ a 10.0
examples/passing/ScopedTypeVariables.pursdeleted−36
@@ -1,36 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test1 :: forall a. (a -> a) -> a -> a
6−test1 f x = g (g x)
7− where
8− g :: a -> a
9− g y = f (f y)
10−
11−test2 :: forall a. (a -> a) -> a -> a
12−test2 = h
13− where
14− h :: forall b. (b -> b) -> b -> b
15− h f x = g (g x)
16− where
17− g :: b -> b
18− g y = f (f y)
19−
20−test3 :: Number
21−test3 = ((\b -> b :: b) :: forall b. b -> b) 0.0
22−
23−test4 :: forall a. (a -> a) -> a -> a
24−test4 = h
25− where
26− h :: forall b. (b -> b) -> b -> b
27− h f x = g (g x)
28− where
29− g :: b -> b
30− g y = j (f (f y))
31− where
32− j :: forall b. b -> b
33− j x = x
34−
35−
36−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Sequence.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−
6−data List a = Cons a (List a) | Nil
7−
8−class Sequence t where
9− sequence :: forall m a. (Monad m) => t (m a) -> m (t a)
10−
11−instance sequenceList :: Sequence List where
12− sequence Nil = pure Nil
13− sequence (Cons x xs) = Cons <$> x <*> sequence xs
14−
15−main = sequence $ Cons (Control.Monad.Eff.Console.log "Done") Nil
examples/passing/SequenceDesugared.pursdeleted−37
@@ -1,37 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−
6−data List a = Cons a (List a) | Nil
7−
8−data Sequence t = Sequence (forall m a. (Monad m) => t (m a) -> m (t a))
9−
10−sequence :: forall t. Sequence t -> (forall m a. (Monad m) => t (m a) -> m (t a))
11−sequence (Sequence s) = s
12−
13−sequenceListSeq :: forall m a. (Monad m) => List (m a) -> m (List a)
14−sequenceListSeq Nil = pure Nil
15−sequenceListSeq (Cons x xs) = Cons <$> x <*> sequenceListSeq xs
16−
17−sequenceList :: Sequence List
18−sequenceList = Sequence (sequenceListSeq)
19−
20−sequenceList' :: Sequence List
21−sequenceList' = Sequence ((\val -> case val of
22− Nil -> pure Nil
23− Cons x xs -> Cons <$> x <*> sequence sequenceList' xs))
24−
25−sequenceList'' :: Sequence List
26−sequenceList'' = Sequence (sequenceListSeq :: forall m a. (Monad m) => List (m a) -> m (List a))
27−
28−sequenceList''' :: Sequence List
29−sequenceList''' = Sequence ((\val -> case val of
30− Nil -> pure Nil
31− Cons x xs -> Cons <$> x <*> sequence sequenceList''' xs) :: forall m a. (Monad m) => List (m a) -> m (List a))
32−
33−main = do
34− sequence sequenceList $ Cons (Control.Monad.Eff.Console.log "Done") Nil
35− sequence sequenceList' $ Cons (Control.Monad.Eff.Console.log "Done") Nil
36− sequence sequenceList'' $ Cons (Control.Monad.Eff.Console.log "Done") Nil
37− sequence sequenceList''' $ Cons (Control.Monad.Eff.Console.log "Done") Nil
examples/passing/ShadowedRename.pursdeleted−14
@@ -1,14 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−import Test.Assert
7−
8−foo foo = let foo_1 = \_ -> foo
9− foo_2 = foo_1 unit + 1.0
10− in foo_2
11−
12−main = do
13− assert $ foo 1.0 == 2.0
14− log "Done"
examples/passing/ShadowedTCO.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude hiding (add)
4−
5−runNat f = f 0.0 (\n -> n + 1.0)
6−
7−zero' z _ = z
8−
9−succ f zero' succ = succ (f zero' succ)
10−
11−add f g zero' succ = g (f zero' succ) succ
12−
13−one' = succ zero'
14−two = succ one'
15−four = add two two
16−fourNumber = runNat four
17−
18−main = Control.Monad.Eff.Console.log $ show fourNumber
examples/passing/ShadowedTCOLet.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−f x y z =
6− let f 1.0 2.0 3.0 = 1.0
7− in f x z y
8−
9−main = Control.Monad.Eff.Console.log $ show $ f 1.0 3.0 2.0
examples/passing/SignedNumericLiterals.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−p = 0.5
6−q = 1.0
7−x = -1.0
8−y = -0.5
9−z = 0.5
10−w = 1.0
11−
12−f :: Number -> Number
13−f x = -x
14−
15−test1 = 2.0 - 1.0
16−
17−main = Control.Monad.Eff.Console.log "Done"
examples/passing/Superclasses1.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class Su a where
6− su :: a -> a
7−
8−class (Su a) <= Cl a where
9− cl :: a -> a -> a
10−
11−instance suNumber :: Su Number where
12− su n = n + 1.0
13−
14−instance clNumber :: Cl Number where
15− cl n m = n + m
16−
17−test :: forall a. (Cl a) => a -> a
18−test a = su (cl a a)
19−
20−main = Control.Monad.Eff.Console.print $ test 10.0
examples/passing/Superclasses3.pursdeleted−41
@@ -1,41 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−import Control.Monad.Eff
6−
7−class (Monad m) <= MonadWriter w m where
8− tell :: w -> m Unit
9−
10−testFunctor :: forall m. (Monad m) => m Number -> m Number
11−testFunctor n = (+) 1.0 <$> n
12−
13−test :: forall w m. (Monad m, MonadWriter w m) => w -> m Unit
14−test w = do
15− tell w
16− tell w
17− tell w
18−
19−data MTrace a = MTrace (Eff (console :: CONSOLE) a)
20−
21−runMTrace :: forall a. MTrace a -> Eff (console :: CONSOLE) a
22−runMTrace (MTrace a) = a
23−
24−instance functorMTrace :: Functor MTrace where
25− map = liftM1
26−
27−instance applyMTrace :: Apply MTrace where
28− apply = ap
29−
30−instance applicativeMTrace :: Applicative MTrace where
31− pure = MTrace <<< return
32−
33−instance bindMTrace :: Bind MTrace where
34− bind m f = MTrace (runMTrace m >>= (runMTrace <<< f))
35−
36−instance monadMTrace :: Monad MTrace
37−
38−instance writerMTrace :: MonadWriter String MTrace where
39− tell s = MTrace (log s)
40−
41−main = runMTrace $ test "Done"
examples/passing/TCOCase.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Data = One | More Data
6−
7−main = Control.Monad.Eff.Console.log (from (to 10000.0 One))
8− where
9− to 0.0 a = a
10− to n a = to (n - 1.0) (More a)
11− from One = "Done"
12− from (More d) = from d
examples/passing/TailCall.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data L a = C a (L a) | N
6−
7−test :: Number -> L Number -> Number
8−test n N = n
9−test n (C x xs) = test (n + x) xs
10−
11−loop :: forall a. Number -> a
12−loop x = loop (x + 1.0)
13−
14−notATailCall = \x ->
15− (\notATailCall -> notATailCall x) (\x -> x)
16−
17−main = Control.Monad.Eff.Console.print (test 0.0 (1.0 `C` (2.0 `C` (3.0 `C` N))))
examples/passing/Tick.pursdeleted−7
@@ -1,7 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test' x = x
6−
7−main = Control.Monad.Eff.Console.log "Done"
examples/passing/TopLevelCase.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−gcd :: Number -> Number -> Number
6−gcd 0.0 x = x
7−gcd x 0.0 = x
8−gcd x y | x > y = gcd (x `mod` y) y
9−gcd x y = gcd (y `mod` x) x
10−
11−guardsTest [x] | x > 0.0 = []
12−guardsTest xs = xs
13−
14−data A = A
15−
16−parseTest A 0.0 = 0.0
17−
18−main = Control.Monad.Eff.Console.log "Done"
examples/passing/TypeClassMemberOrderChange.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class Test a where
6− fn :: a -> a -> a
7− val :: a
8−
9−instance testBoolean :: Test Boolean where
10− val = true
11− fn x y = y
12−
13−main = Control.Monad.Eff.Console.log (show (fn true val))
examples/passing/TypeClasses.pursdeleted−69
@@ -1,69 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−test1 = \_ -> show "testing"
6−
7−f :: forall a. (Prelude.Show a) => a -> String
8−f x = show x
9−
10−test2 = \_ -> f "testing"
11−
12−test7 :: forall a. (Prelude.Show a) => a -> String
13−test7 = show
14−
15−test8 = \_ -> show $ "testing"
16−
17−data Data a = Data a
18−
19−instance showData :: (Prelude.Show a) => Prelude.Show (Data a) where
20− show (Data a) = "Data (" ++ show a ++ ")"
21−
22−test3 = \_ -> show (Data "testing")
23−
24−instance functorData :: Functor Data where
25− map = liftM1
26−
27−instance applyData :: Apply Data where
28− apply = ap
29−
30−instance applicativeData :: Applicative Data where
31− pure = Data
32−
33−instance bindData :: Bind Data where
34− bind (Data a) f = f a
35−
36−instance monadData :: Monad Data
37−
38−data Maybe a = Nothing | Just a
39−
40−instance functorMaybe :: Functor Maybe where
41− map = liftM1
42−
43−instance applyMaybe :: Apply Maybe where
44− apply = ap
45−
46−instance applicativeMaybe :: Applicative Maybe where
47− pure = Just
48−
49−instance bindMaybe :: Bind Maybe where
50− bind Nothing _ = Nothing
51− bind (Just a) f = f a
52−
53−instance monadMaybe :: Monad Maybe
54−
55−test4 :: forall a m. (Monad m) => a -> m Number
56−test4 = \_ -> return 1.0
57−
58−test5 = \_ -> Just 1.0 >>= \n -> return (n + 1.0)
59−
60−ask r = r
61−
62−runReader r f = f r
63−
64−test9 _ = runReader 0.0 $ do
65− n <- ask
66− return $ n + 1.0
67−
68−main = Control.Monad.Eff.Console.log (test7 "Done")
69−
examples/passing/TypeClassesInOrder.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class Foo a where
6− foo :: a -> String
7−
8−instance fooString :: Foo String where
9− foo s = s
10−
11−main = Control.Monad.Eff.Console.log $ foo "Done"
examples/passing/TypeClassesWithOverlappingTypeVariables.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Either a b = Left a | Right b
6−
7−instance functorEither :: Prelude.Functor (Either a) where
8− map _ (Left x) = Left x
9− map f (Right y) = Right (f y)
10−
11−main = Control.Monad.Eff.Console.log "Done"
examples/passing/TypeDecl.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−k :: String -> Number -> String
6−k x y = x
7−
8−iterate :: forall a. Number -> (a -> a) -> a -> a
9−iterate 0.0 f a = a
10−iterate n f a = iterate (n - 1.0) f (f a)
11−
12−main = Control.Monad.Eff.Console.log "Done"
examples/passing/TypeSynonymInData.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−type A a = Array a
6−
7−data Foo a = Foo (A a) | Bar
8−
9−foo (Foo []) = Bar
10−
11−main = Control.Monad.Eff.Console.log "Done"
examples/passing/TypeSynonyms.pursdeleted−27
@@ -1,27 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−type Lens a b =
6− { get :: a -> b
7− , set :: a -> b -> a
8− }
9−
10−composeLenses :: forall a b c. Lens a b -> Lens b c -> Lens a c
11−composeLenses = \l1 -> \l2 ->
12− { get: \a -> l2.get (l1.get a)
13− , set: \a c -> l1.set a (l2.set (l1.get a) c)
14− }
15−
16−type Pair a b = { fst :: a, snd :: b }
17−
18−fst :: forall a b. Lens (Pair a b) a
19−fst =
20− { get: \p -> p.fst
21− , set: \p a -> { fst: a, snd: p.snd }
22− }
23−
24−test1 :: forall a b c. Lens (Pair (Pair a b) c) a
25−test1 = composeLenses fst fst
26−
27−main = Control.Monad.Eff.Console.log "Done"
examples/passing/TypeWildcards.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−testTopLevel :: _ -> _
6−testTopLevel n = n + 1.0
7−
8−test :: forall a. (Eq a) => (a -> a) -> a -> a
9−test f a = go (f a) a
10− where
11− go :: _ -> _ -> _
12− go a1 a2 | a1 == a2 = a1
13− go a1 _ = go (f a1) a1
14−
15−main = Control.Monad.Eff.Console.log "Done"
examples/passing/TypeWildcardsRecordExtension.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−foo :: forall a. {b :: Number | a} -> {b :: Number | _}
6−foo f = f
7−
8−main = Control.Monad.Eff.Console.log "Done"
examples/passing/TypedBinders.pursdeleted−62
@@ -1,62 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Tuple a b = Tuple a b
6−
7−class MonadState s m where
8− get :: m s
9− put :: s -> m {}
10−
11−data State s a = State (s -> Tuple s a)
12−
13−runState s (State f) = f s
14−
15−instance functorState :: Functor (State s) where
16− map = liftM1
17−
18−instance applyState :: Apply (State s) where
19− apply = ap
20−
21−instance applicativeState :: Applicative (State s) where
22− pure a = State $ \s -> Tuple s a
23−
24−instance bindState :: Bind (State s) where
25− bind f g = State $ \s -> case runState s f of
26− Tuple s1 a -> runState s1 (g a)
27−
28−instance monadState :: Monad (State s)
29−
30−instance monadStateState :: MonadState s (State s) where
31− get = State (\s -> Tuple s s)
32− put s = State (\_ -> Tuple s {})
33−
34−modify :: forall m s. (Prelude.Monad m, MonadState s m) => (s -> s) -> m {}
35−modify f = do
36− s <- get
37− put (f s)
38−
39−test :: Tuple String String
40−test = runState "" $ do
41− modify $ (++) "World!"
42− modify $ (++) "Hello, "
43− str :: String <- get
44− return str
45−
46−test2 :: (Int -> Int) -> Int
47−test2 = (\(f :: Int -> Int) -> f 10)
48−
49−test3 :: Int -> Boolean
50−test3 n = case n of
51− (0 :: Int) -> true
52− _ -> false
53−
54−test4 :: Tuple Int Int -> Tuple Int Int
55−test4 = (\(Tuple a b :: Tuple Int Int) -> Tuple b a)
56−
57−main = do
58− let t1 = test
59− t2 = test2 id
60− t3 = test3 1
61− t4 = test4 (Tuple 1 0)
62− Control.Monad.Eff.Console.log "Done"
examples/passing/TypedWhere.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data E a b = L a | R b
6−
7−data L a = C a (L a) | N
8−
9−lefts :: forall a b. L (E a b) -> L a
10−lefts = go N
11− where
12− go :: forall a b. L a -> L (E a b) -> L a
13− go ls N = ls
14− go ls (C (L a) rest) = go (C a ls) rest
15− go ls (C _ rest) = go ls rest
16−
17−main = Control.Monad.Eff.Console.log "Done"
examples/passing/UTF8Sourcefile.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console
4−
5−-- '→' is multibyte sequence \u2192.
6−utf8multibyte = "Hello λ→ world!!"
7−
8−main = do
9− log "done"
10−
examples/passing/UnderscoreIdent.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−data Data_type = Con_Structor | Con_2 String
6−
7−type Type_name = Data_type
8−
9−done (Con_2 s) = s
10−
11−main = Control.Monad.Eff.Console.log (done (Con_2 "Done"))
examples/passing/Unit.pursdeleted−6
@@ -1,6 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−main = print (const unit $ "Hello world")
examples/passing/UnknownInTypeClassLookup.pursdeleted−14
@@ -1,14 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−class EQ a b
6−
7−instance eqAA :: EQ a a
8−
9−test :: forall a b. (EQ a b) => a -> b -> String
10−test _ _ = "Done"
11−
12−runTest a = test a a
13−
14−main = Control.Monad.Eff.Console.log $ runTest 0.0
examples/passing/Where.pursdeleted−49
@@ -1,49 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.ST
6−
7−test1 x = y
8− where
9− y :: Number
10− y = x + 1.0
11−
12−test2 x y = x' + y'
13− where
14− x' = x + 1.0
15− y' = y + 1.0
16−
17−
18−test3 = f 1.0 2.0 3.0
19− where f x y z = x + y + z
20−
21−
22−test4 = f (+) [1.0, 2.0]
23− where f x [y, z] = x y z
24−
25−
26−test5 = g 10.0
27− where
28− f x | x > 0.0 = g (x / 2.0) + 1.0
29− f x = 0.0
30− g x = f (x - 1.0) + 1.0
31−
32−test6 = if f true then f 1.0 else f 2.0
33− where f :: forall a. a -> a
34− f x = x
35−
36−test7 :: Number -> Number
37−test7 x = go x
38− where
39− go y | (x - 0.1 < y * y) && (y * y < x + 0.1) = y
40− go y = go $ (y + x / y) / 2.0
41−
42−main = do
43− Control.Monad.Eff.Console.print (test1 1.0)
44− Control.Monad.Eff.Console.print (test2 1.0 2.0)
45− Control.Monad.Eff.Console.print test3
46− Control.Monad.Eff.Console.print test4
47− Control.Monad.Eff.Console.print test5
48− Control.Monad.Eff.Console.print test6
49− Control.Monad.Eff.Console.print (test7 100.0)
examples/passing/iota.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−s = \x -> \y -> \z -> x z (y z)
4−
5−k = \x -> \y -> x
6−
7−iota = \x -> x s k
8−
9−main = Control.Monad.Eff.Console.log "Done"
examples/passing/s.pursdeleted−7
@@ -1,7 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−s = \x y z -> x z (y z)
6−
7−main = Control.Monad.Eff.Console.log "Done"
hierarchy/Main.hsdeleted−114
@@ -1,114 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Main
4−-- Copyright : (c) Hardy Jones 2014
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Hardy Jones <jones3.hardy@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Generate Directed Graphs of PureScript TypeClasses
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE TupleSections #-}
17−
18−module Main where
19−
20−import Control.Monad (unless)
21−
22−import Data.List (intercalate,nub,sort)
23−import Data.Foldable (for_)
24−import Data.Version (showVersion)
25−
26−import Options.Applicative
27−import System.Directory (createDirectoryIfMissing)
28−import System.FilePath ((</>))
29−import System.FilePath.Glob (glob)
30−import System.Exit (exitFailure, exitSuccess)
31−import System.IO (hPutStr, stderr)
32−
33−import qualified Language.PureScript as P
34−import qualified Paths_purescript as Paths
35−
36−data HierarchyOptions = HierarchyOptions
37− { hierachyInput :: FilePath
38− , hierarchyOutput :: Maybe FilePath
39− }
40−
41−newtype SuperMap = SuperMap { unSuperMap :: Either P.ProperName (P.ProperName, P.ProperName) }
42− deriving Eq
43−
44−instance Show SuperMap where
45− show (SuperMap (Left sub)) = show sub
46− show (SuperMap (Right (super, sub))) = show super ++ " -> " ++ show sub
47−
48−instance Ord SuperMap where
49− compare (SuperMap s) (SuperMap s') = getCls s `compare` getCls s'
50− where
51− getCls = either id snd
52−
53−runModuleName :: P.ModuleName -> String
54−runModuleName (P.ModuleName pns) = intercalate "_" (P.runProperName `map` pns)
55−
56−readInput :: [FilePath] -> IO (Either P.MultipleErrors [P.Module])
57−readInput paths = do
58− content <- mapM (\path -> (path, ) <$> readFile path) paths
59− return $ map snd <$> P.parseModulesFromFiles id content
60−
61−compile :: HierarchyOptions -> IO ()
62−compile (HierarchyOptions inputGlob mOutput) = do
63− input <- glob inputGlob
64− modules <- readInput input
65− case modules of
66− Left errs -> hPutStr stderr (P.prettyPrintMultipleErrors False errs) >> exitFailure
67− Right ms -> do
68− for_ ms $ \(P.Module _ _ moduleName decls _) ->
69− let name = runModuleName moduleName
70− tcs = filter P.isTypeClassDeclaration decls
71− supers = sort . nub . filter (not . null) $ fmap superClasses tcs
72− prologue = "digraph " ++ name ++ " {\n"
73− body = intercalate "\n" (concatMap (fmap (\s -> " " ++ show s ++ ";")) supers)
74− epilogue = "\n}"
75− hier = prologue ++ body ++ epilogue
76− in unless (null supers) $ case mOutput of
77− Just output -> do
78− createDirectoryIfMissing True output
79− writeFile (output </> name) hier
80− Nothing -> putStrLn hier
81− exitSuccess
82−
83−superClasses :: P.Declaration -> [SuperMap]
84−superClasses (P.TypeClassDeclaration sub _ supers@(_:_) _) =
85− fmap (\(P.Qualified _ super, _) -> SuperMap (Right (super, sub))) supers
86−superClasses (P.TypeClassDeclaration sub _ _ _) = [SuperMap (Left sub)]
87−superClasses (P.PositionedDeclaration _ _ decl) = superClasses decl
88−superClasses _ = []
89−
90−inputFile :: Parser FilePath
91−inputFile = strArgument $
92− metavar "FILE"
93− <> value "main.purs"
94− <> showDefault
95− <> help "The input file to generate a hierarchy from"
96−
97−outputFile :: Parser (Maybe FilePath)
98−outputFile = optional . strOption $
99− short 'o'
100− <> long "output"
101− <> help "The output directory"
102−
103−pscOptions :: Parser HierarchyOptions
104−pscOptions = HierarchyOptions <$> inputFile
105− <*> outputFile
106−
107−main :: IO ()
108−main = execParser opts >>= compile
109− where
110− opts = info (helper <*> pscOptions) infoModList
111− infoModList = fullDesc <> headerInfo <> footerInfo
112− headerInfo = header "hierarchy - Creates a GraphViz directed graph of PureScript TypeClasses"
113− footerInfo = footer $ "hierarchy " ++ showVersion Paths.version
114−
license-generator/generatedeleted−47
@@ -1,47 +0,0 @@
1−#!/bin/bash
2−# Generates the LICENSE file and prints it to standard output.
3−# Example use:
4−#
5−# ./license/generate > LICENSE
6−#
7−
8−set -e # exit on error
9−set -u # exit on undefined variable
10−set -o pipefail # propagate nonzero exit codes through pipelines
11−
12−export LC_CTYPE=C
13−export LANG=C
14−
15−if ! which cabal-dependency-licenses >/dev/null; then
16− echo "$0: the program 'cabal-dependency-licenses' is required." >&2
17− echo "$0: see Hackage: https://hackage.haskell.org/package/cabal-dependency-licenses" >&2
18− exit 1
19−fi
20−
21−echo_header() {
22− cat license-generator/header.txt
23−}
24−
25−echo_deps_names() {
26− cabal-dependency-licenses \
27− | grep '^- ' | sed 's/^..//' | gsort -h
28−}
29−
30−echo_deps_licenses() {
31− while read dep; do
32− echo "fetching LICENSE for: ${dep}" >&2
33− echo "${dep} LICENSE file:"
34− echo ""
35− curl --silent "https://hackage.haskell.org/package/${dep}/src/LICENSE" \
36− | sed 's/^/ /g' # indent by 2 characters
37− echo ""
38− done
39−}
40−
41−echo_deps_names > license-generator/tmp/deps.txt
42−
43−echo_header
44−echo ""
45−sed <license-generator/tmp/deps.txt 's/^/ /'
46−echo ""
47−echo_deps_licenses <license-generator/tmp/deps.txt
license-generator/header.txtdeleted−23
@@ -1,23 +0,0 @@
1−The MIT License (MIT)
2−
3−Copyright (c) 2013-15 Phil Freeman, (c) 2014-2015 Gary Burgess, and other
4−contributors
5−
6−Permission is hereby granted, free of charge, to any person obtaining a copy of
7−this software and associated documentation files (the "Software"), to deal in
8−the Software without restriction, including without limitation the rights to
9−use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
10−the Software, and to permit persons to whom the Software is furnished to do so,
11−subject to the following conditions:
12−
13−The above copyright notice and this permission notice shall be included in all
14−copies or substantial portions of the Software.
15−
16−THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17−IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
18−FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
19−COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
20−IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
21−CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
22−
23−PureScript uses the following Haskell library packages. Their license files follow.
license-generator/tmp/.gitkeepdeleted

No changes to the content.

logo.pngdeleted

Binary file not shown.

package.yamlnew file+86
@@ -0,0 +1,86 @@
1+name: psgo
2+version: 0.1.0.0
3+github: "andyarvanitis/purescript-native"
4+license: BSD3
5+author: "Andy Arvanitis"
6+maintainer: "example@example.com"
7+copyright: "2018 Andy Arvanitis"
8+
9+extra-source-files:
10+- README.md
11+- ChangeLog.md
12+- stack.yaml
13+- support/*
14+
15+# Metadata used when publishing your package
16+# synopsis: Short description of your package
17+# category: Web
18+
19+# To avoid duplicated efforts in documentation and dealing with the
20+# complications of embedding Haddock markup inside cabal files, it is
21+# common to point users to the README.md file.
22+description: Please see the README on Github at <https://github.com/andyarvanitis/purescript-native#readme>
23+
24+dependencies:
25+- base >= 4.7 && < 5
26+- bytestring >= 0.10.8.2 && < 0.11
27+- purescript
28+- base-compat >=0.6.0
29+- protolude >=0.1.6
30+- text
31+- containers
32+- filepath
33+- monad-parallel >= 0.7.2.2 && <0.8
34+- pattern-arrows >=0.0.2 && <0.1
35+- safe >=0.3.9 && <0.4
36+- transformers >=0.3.0 && <0.6
37+- mtl >=2.1.0 && <2.3.0
38+- aeson >=1.0 && <1.5
39+- directory
40+- process
41+- file-embed
42+- filemanip
43+- gitrev
44+
45+library:
46+ source-dirs: src
47+ default-extensions:
48+ - ConstraintKinds
49+ - DataKinds
50+ - DeriveFunctor
51+ - EmptyDataDecls
52+ - FlexibleContexts
53+ - KindSignatures
54+ - LambdaCase
55+ - MultiParamTypeClasses
56+ - NoImplicitPrelude
57+ - PatternGuards
58+ - PatternSynonyms
59+ - RankNTypes
60+ - RecordWildCards
61+ - OverloadedStrings
62+ - ScopedTypeVariables
63+ - TupleSections
64+ - ViewPatterns
65+
66+executables:
67+ psgo:
68+ main: Main.hs
69+ source-dirs: app
70+ ghc-options:
71+ - -threaded
72+ - -rtsopts
73+ - -with-rtsopts=-N
74+ dependencies:
75+ - psgo
76+
77+tests:
78+ psgo-test:
79+ main: Spec.hs
80+ source-dirs: test
81+ ghc-options:
82+ - -threaded
83+ - -rtsopts
84+ - -with-rtsopts=-N
85+ dependencies:
86+ - psgo
psc-bundle/Main.hsdeleted−138
@@ -1,138 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : psc-bundle
4−-- Copyright : (c) Phil Freeman 2015
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Bundles compiled PureScript modules for the browser.
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE PatternGuards #-}
16−{-# LANGUAGE FlexibleContexts #-}
17−{-# LANGUAGE ScopedTypeVariables #-}
18−{-# LANGUAGE TupleSections #-}
19−{-# LANGUAGE RecordWildCards #-}
20−
21−module Main (main) where
22−
23−import Data.Traversable (for)
24−import Data.Version (showVersion)
25−
26−import Control.Applicative
27−import Control.Monad
28−import Control.Monad.Error.Class
29−import Control.Monad.Trans.Except
30−import Control.Monad.IO.Class
31−
32−import System.FilePath (takeFileName, takeDirectory)
33−import System.FilePath.Glob (glob)
34−import System.Exit (exitFailure)
35−import System.IO (stderr, hPutStrLn)
36−import System.Directory (createDirectoryIfMissing)
37−
38−import Language.PureScript.Bundle
39−
40−import Options.Applicative as Opts
41−
42−import qualified Paths_purescript as Paths
43−
44−-- | Command line options.
45−data Options = Options
46− { optionsInputFiles :: [FilePath]
47− , optionsOutputFile :: Maybe FilePath
48− , optionsEntryPoints :: [String]
49− , optionsMainModule :: Maybe String
50− , optionsNamespace :: String
51− } deriving Show
52−
53−-- | Given a filename, assuming it is in the correct place on disk, infer a ModuleIdentifier.
54−guessModuleIdentifier :: (Applicative m, MonadError ErrorMessage m) => FilePath -> m ModuleIdentifier
55−guessModuleIdentifier filename = ModuleIdentifier (takeFileName (takeDirectory filename)) <$> (guessModuleType (takeFileName filename))
56− where
57− guessModuleType "index.js" = pure Regular
58− guessModuleType "foreign.js" = pure Foreign
59− guessModuleType name = throwError $ UnsupportedModulePath name
60−
61−-- | The main application function.
62−-- This function parses the input files, performs dead code elimination, filters empty modules
63−-- and generates and prints the final Javascript bundle.
64−app :: forall m. (Applicative m, MonadError ErrorMessage m, MonadIO m) => Options -> m String
65−app Options{..} = do
66− inputFiles <- concat <$> mapM (liftIO . glob) optionsInputFiles
67− when (null inputFiles) . liftIO $ do
68− hPutStrLn stderr "psc-bundle: No input files."
69− exitFailure
70− input <- for inputFiles $ \filename -> do
71− js <- liftIO (readFile filename)
72− mid <- guessModuleIdentifier filename
73− return (mid, js)
74−
75− let entryIds = (map (`ModuleIdentifier` Regular) optionsEntryPoints)
76−
77− bundle input entryIds optionsMainModule optionsNamespace
78−
79−-- | Command line options parser.
80−options :: Parser Options
81−options = Options <$> some inputFile
82− <*> optional outputFile
83− <*> many entryPoint
84− <*> optional mainModule
85− <*> namespace
86− where
87− inputFile :: Parser FilePath
88− inputFile = strArgument $
89− metavar "FILE"
90− <> help "The input .js file(s)"
91−
92− outputFile :: Parser FilePath
93− outputFile = strOption $
94− short 'o'
95− <> long "output"
96− <> help "The output .js file"
97−
98− entryPoint :: Parser String
99− entryPoint = strOption $
100− short 'm'
101− <> long "module"
102− <> help "Entry point module name(s). All code which is not a transitive dependency of an entry point module will be removed."
103−
104− mainModule :: Parser String
105− mainModule = strOption $
106− long "main"
107− <> help "Generate code to run the main method in the specified module."
108−
109− namespace :: Parser String
110− namespace = strOption $
111− short 'n'
112− <> long "namespace"
113− <> Opts.value "PS"
114− <> showDefault
115− <> help "Specify the namespace that PureScript modules will be exported to when running in the browser."
116−
117−-- | Make it go.
118−main :: IO ()
119−main = do
120− opts <- execParser (info (version <*> helper <*> options) infoModList)
121− output <- runExceptT (app opts)
122− case output of
123− Left err -> do
124− hPutStrLn stderr (unlines (printErrorMessage err))
125− exitFailure
126− Right js ->
127− case optionsOutputFile opts of
128− Just outputFile -> do
129− createDirectoryIfMissing True (takeDirectory outputFile)
130− writeFile outputFile js
131− Nothing -> putStrLn js
132− where
133− infoModList = fullDesc <> headerInfo <> footerInfo
134− headerInfo = header "psc-bundle - Bundles compiled PureScript modules for the browser"
135− footerInfo = footer $ "psc-bundle " ++ showVersion Paths.version
136−
137− version :: Parser (a -> a)
138− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
psc-bundle/README.mddeleted−18
@@ -1,18 +0,0 @@
1−# psc-bundle
2−
3−A dead code elimination tool for PureScript-style CommonJS modules. This can be used as an alternative to Browserify.
4−
5−## Usage
6−
7− psc-bundle FILE (-m|--module ARG) [--main ARG] [--namespace ARG]
8−
9−Options:
10−
11−- The input .js file(s)
12−- Entry point module name(s) are specified with `-m` or `--module`. All code which is not a transitive dependency of an entry point module will be removed.
13−- The main module is (optionally) specified using `--main`. If specified, this will generate code to run the main method in the specified module.
14−- The browser namespace defaults to `PS`, and can be overridden with `--namespace`.
15−
16−For example, to bundle the modules in the `output` directory, with main module `Main`:
17−
18− psc-bundle output/**/*.js -m Main --main Main
psc-docs/Ctags.hsdeleted−13
@@ -1,13 +0,0 @@
1−module Ctags (dumpCtags) where
2−
3−import qualified Language.PureScript as P
4−import Tags
5−import Data.List (sort)
6−
7−dumpCtags :: [(String, P.Module)] -> [String]
8−dumpCtags = sort . concat . (map renderModCtags)
9−
10−renderModCtags :: (String, P.Module) -> [String]
11−renderModCtags (path, mdl) = sort tagLines
12− where tagLines = map tagLine $ tags mdl
13− tagLine (name, line) = name ++ "\t" ++ path ++ "\t" ++ show line
psc-docs/Etags.hsdeleted−15
@@ -1,15 +0,0 @@
1−module Etags (dumpEtags) where
2−
3−import qualified Language.PureScript as P
4−import Tags
5−
6−dumpEtags :: [(String, P.Module)] -> [String]
7−dumpEtags = concat . (map renderModEtags)
8−
9−renderModEtags :: (String, P.Module) -> [String]
10−renderModEtags (path, mdl) = ["\x0c", path ++ "," ++ show tagsLen] ++ tagLines
11− where tagsLen = sum $ map length tagLines
12− tagLines = map tagLine $ tags mdl
13− tagLine (name, line) = "\x7f" ++ name ++ "\x01" ++ show line ++ ","
14−
15−
psc-docs/Main.hsdeleted−251
@@ -1,251 +0,0 @@
1−{-# LANGUAGE TupleSections #-}
2−----------------------------------------------------------------------------
3−--
4−-- Module : Main
5−-- Copyright : (c) Phil Freeman 2013
6−-- License : MIT
7−--
8−-- Maintainer : Phil Freeman <paf31@cantab.net>
9−-- Stability : experimental
10−-- Portability :
11−--
12−-- |
13−--
14−-----------------------------------------------------------------------------
15−
16−module Main where
17−
18−import Control.Applicative
19−import Control.Arrow (first, second)
20−import Control.Category ((>>>))
21−import Control.Monad.Writer
22−import Data.Function (on)
23−import Data.List
24−import Data.Maybe (fromMaybe)
25−import Data.Tuple (swap)
26−import Data.Version (showVersion)
27−
28−import Options.Applicative
29−import qualified Text.PrettyPrint.ANSI.Leijen as PP
30−
31−import qualified Language.PureScript as P
32−import qualified Paths_purescript as Paths
33−import System.Exit (exitFailure)
34−import System.IO (hPutStrLn, stderr)
35−import System.Directory (createDirectoryIfMissing)
36−import System.FilePath (takeDirectory)
37−import System.FilePath.Glob (glob)
38−
39−import Etags
40−import Ctags
41−import qualified Language.PureScript.Docs as D
42−import qualified Language.PureScript.Docs.AsMarkdown as D
43−
44−-- Available output formats
45−data Format = Markdown -- Output documentation in Markdown format
46− | Ctags -- Output ctags symbol index suitable for use with vi
47− | Etags -- Output etags symbol index suitable for use with emacs
48− deriving (Show, Eq, Ord)
49−
50−-- | Available methods of outputting Markdown documentation
51−data DocgenOutput
52− = EverythingToStdOut
53− | ToStdOut [P.ModuleName]
54− | ToFiles [(P.ModuleName, FilePath)]
55− deriving (Show)
56−
57−data PSCDocsOptions = PSCDocsOptions
58− { pscdFormat :: Format
59− , pscdInputFiles :: [FilePath]
60− , pscdDocgen :: DocgenOutput
61− }
62− deriving (Show)
63−
64−docgen :: PSCDocsOptions -> IO ()
65−docgen (PSCDocsOptions fmt inputGlob output) = do
66− input <- concat <$> mapM glob inputGlob
67− case fmt of
68− Etags -> dumpTags input dumpEtags
69− Ctags -> dumpTags input dumpCtags
70− Markdown -> do
71− e <- D.parseAndDesugar input [] (\_ ms -> return ms)
72− case e of
73− Left (D.ParseError err) -> do
74− hPutStrLn stderr $ show err
75− exitFailure
76− Left (D.SortModulesError err) -> do
77− hPutStrLn stderr $ P.prettyPrintMultipleErrors False err
78− exitFailure
79− Left (D.DesugarError err) -> do
80− hPutStrLn stderr $ P.prettyPrintMultipleErrors False err
81− exitFailure
82− Right ms' ->
83− case output of
84− EverythingToStdOut ->
85− putStrLn (D.renderModulesAsMarkdown ms')
86− ToStdOut names -> do
87− let (ms, missing) = takeModulesByName ms' names
88− guardMissing missing
89− putStrLn (D.renderModulesAsMarkdown ms)
90− ToFiles names -> do
91− let (ms, missing) = takeModulesByName' ms' names
92− guardMissing missing
93− let ms'' = groupBy ((==) `on` fst) . sortBy (compare `on` fst) $ map swap ms
94− forM_ ms'' $ \grp -> do
95− let fp = fst (head grp)
96− createDirectoryIfMissing True (takeDirectory fp)
97− writeFile fp (D.renderModulesAsMarkdown $ snd `map` grp)
98− where
99− guardMissing [] = return ()
100− guardMissing [mn] = do
101− hPutStrLn stderr ("psc-docs: error: unknown module \"" ++ show mn ++ "\"")
102− exitFailure
103− guardMissing mns = do
104− hPutStrLn stderr "psc-docs: error: unknown modules:"
105− forM_ mns $ \mn ->
106− hPutStrLn stderr (" * " ++ show mn)
107− exitFailure
108−
109−-- |
110−-- Given a list of module names and a list of modules, return a list of modules
111−-- whose names appeared in the given name list, together with a list of names
112−-- for which no module could be found in the module list.
113−--
114−takeModulesByName :: [P.Module] -> [P.ModuleName] -> ([P.Module], [P.ModuleName])
115−takeModulesByName modules names =
116− first (map fst) (takeModulesByName' modules (map (,()) names))
117−
118−-- |
119−-- Like takeModulesByName but also keeps some extra data with the module.
120−--
121−takeModulesByName' :: [P.Module] -> [(P.ModuleName, a)] -> ([(P.Module, a)], [P.ModuleName])
122−takeModulesByName' modules = foldl go ([], [])
123− where
124− go (ms, missing) (name, x) =
125− case find ((== name) . P.getModuleName) modules of
126− Just m -> ((m, x) : ms, missing)
127− Nothing -> (ms, name : missing)
128−
129−dumpTags :: [FilePath] -> ([(String, P.Module)] -> [String]) -> IO ()
130−dumpTags input renderTags = do
131− e <- P.parseModulesFromFiles (fromMaybe "") <$> mapM (fmap (first Just) . parseFile) (nub input)
132− case e of
133− Left err -> do
134− hPutStrLn stderr (show err)
135− exitFailure
136− Right ms ->
137− ldump (renderTags (pairs ms))
138−
139− where
140− pairs :: [(Maybe String, m)] -> [(String, m)]
141− pairs = map (first (fromMaybe ""))
142−
143− ldump :: [String] -> IO ()
144− ldump = mapM_ putStrLn
145−
146−parseFile :: FilePath -> IO (FilePath, String)
147−parseFile input = (,) input <$> readFile input
148−
149−inputFile :: Parser FilePath
150−inputFile = strArgument $
151− metavar "FILE"
152− <> help "The input .purs file(s)"
153−
154−instance Read Format where
155− readsPrec _ "etags" = [(Etags, "")]
156− readsPrec _ "ctags" = [(Ctags, "")]
157− readsPrec _ "markdown" = [(Markdown, "")]
158− readsPrec _ _ = []
159−
160−format :: Parser Format
161−format = option auto $ value Markdown
162− <> long "format"
163− <> metavar "FORMAT"
164− <> help "Set output FORMAT (markdown | etags | ctags)"
165−
166−docgenModule :: Parser String
167−docgenModule = strOption $
168− long "docgen"
169− <> help "A list of module names which should appear in the output. This can optionally include file paths to write individual modules to, by separating with a colon ':'. For example, Prelude:docs/Prelude.md. This option may be specified multiple times."
170−
171−pscDocsOptions :: Parser (Format, [FilePath], [String])
172−pscDocsOptions = (,,) <$> format <*> many inputFile <*> many docgenModule
173−
174−parseDocgen :: [String] -> Either String DocgenOutput
175−parseDocgen [] = Right EverythingToStdOut
176−parseDocgen xs = go xs
177− where
178− go = intersperse " "
179− >>> concat
180− >>> words
181− >>> map parseItem
182− >>> combine
183−
184−data DocgenOutputItem
185− = IToStdOut P.ModuleName
186− | IToFile (P.ModuleName, FilePath)
187−
188−parseItem :: String -> DocgenOutputItem
189−parseItem s = case elemIndex ':' s of
190− Just i ->
191− s # splitAt i
192− >>> first P.moduleNameFromString
193− >>> second (drop 1)
194− >>> IToFile
195− Nothing ->
196− IToStdOut (P.moduleNameFromString s)
197−
198− where
199− infixr 1 #
200− (#) = flip ($)
201−
202−combine :: [DocgenOutputItem] -> Either String DocgenOutput
203−combine [] = Right EverythingToStdOut
204−combine (x:xs) = foldM go (initial x) xs
205− where
206− initial (IToStdOut m) = ToStdOut [m]
207− initial (IToFile m) = ToFiles [m]
208−
209− go (ToStdOut ms) (IToStdOut m) = Right (ToStdOut (m:ms))
210− go (ToFiles ms) (IToFile m) = Right (ToFiles (m:ms))
211− go _ _ = Left "Can't mix module names and module name/file path pairs in the same invocation."
212−
213−buildOptions :: (Format, [FilePath], [String]) -> IO PSCDocsOptions
214−buildOptions (fmt, input, mapping) =
215− case parseDocgen mapping of
216− Right mapping' -> return (PSCDocsOptions fmt input mapping')
217− Left err -> do
218− hPutStrLn stderr "psc-docs: error in --docgen option:"
219− hPutStrLn stderr (" " ++ err)
220− exitFailure
221−
222−main :: IO ()
223−main = execParser opts >>= buildOptions >>= docgen
224− where
225− opts = info (version <*> helper <*> pscDocsOptions) infoModList
226− infoModList = fullDesc <> headerInfo <> footerInfo
227− headerInfo = header "psc-docs - Generate Markdown documentation from PureScript source files"
228− footerInfo = footerDoc $ Just $ PP.vcat
229− [ examples, PP.empty, PP.text ("psc-docs " ++ showVersion Paths.version) ]
230−
231− version :: Parser (a -> a)
232− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
233−
234−examples :: PP.Doc
235−examples =
236− PP.vcat $ map PP.text
237− [ "Examples:"
238− , " print documentation for Data.List to stdout:"
239− , " psc-docs src/**/*.purs bower_components/*/src/**/*.purs \\"
240− , " --docgen Data.List"
241− , ""
242− , " write documentation for Data.List to docs/Data.List.md:"
243− , " psc-docs src/**/*.purs bower_components/*/src/**/*.purs \\"
244− , " --docgen Data.List:docs/Data.List.md"
245− , ""
246− , " write documentation for Data.List to docs/Data.List.md, and"
247− , " documentation for Data.List.Lazy to docs/Data.List.Lazy.md:"
248− , " psc-docs src/**/*.purs bower_components/*/src/**/*.purs \\"
249− , " --docgen Data.List:docs/Data.List.md \\"
250− , " --docgen Data.List.Lazy:docs/Data.List.Lazy.md"
251− ]
psc-docs/Tags.hsdeleted−18
@@ -1,18 +0,0 @@
1−module Tags where
2−
3−import qualified Language.PureScript as P
4−
5−tags :: P.Module -> [(String, Int)]
6−tags = concatMap dtags . P.exportedDeclarations
7− where dtags (P.PositionedDeclaration sp _ d) = map tag $ names d
8− where tag name = (name, line)
9− line = P.sourcePosLine $ P.spanStart sp
10− dtags _ = []
11− names (P.DataDeclaration _ name _ dcons) = P.runProperName name : consNames
12− where consNames = map (\(cname, _) -> P.runProperName cname) dcons
13− names (P.TypeDeclaration ident _) = [show ident]
14− names (P.ExternDeclaration ident _) = [show ident]
15− names (P.TypeSynonymDeclaration name _ _) = [P.runProperName name]
16− names (P.TypeClassDeclaration name _ _ _) = [P.runProperName name]
17− names (P.TypeInstanceDeclaration name _ _ _ _) = [show name]
18− names _ = []
psc-publish/Main.hsdeleted−38
@@ -1,38 +0,0 @@
1−
2−module Main where
3−
4−import Data.Version (Version(..), showVersion)
5−import qualified Data.Aeson as A
6−import qualified Data.ByteString.Lazy.Char8 as BL
7−
8−import Options.Applicative hiding (str)
9−
10−import qualified Paths_purescript as Paths
11−import Language.PureScript.Publish
12−
13−dryRun :: Parser Bool
14−dryRun = switch $
15− long "dry-run"
16− <> help "Produce no output, and don't require a tagged version to be checked out."
17−
18−main :: IO ()
19−main = execParser opts >>= publish
20− where
21− opts = info (version <*> helper <*> dryRun) infoModList
22− infoModList = fullDesc <> headerInfo <> footerInfo
23− headerInfo = header "psc-publish - Generates documentation packages for upload to http://pursuit.purescript.org"
24− footerInfo = footer $ "psc-publish " ++ showVersion Paths.version
25−
26− version :: Parser (a -> a)
27− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
28−
29−publish :: Bool -> IO ()
30−publish isDryRun =
31− if isDryRun
32− then do
33− let dummyVersion = ("0.0.0", Version [0,0,0] [])
34− _ <- preparePackage $ defaultPublishOptions { publishGetVersion = return dummyVersion }
35− putStrLn "Dry run completed, no errors."
36− else do
37− pkg <- preparePackage defaultPublishOptions
38− BL.putStrLn (A.encode pkg)
psc-publish/tests/Test.hsdeleted−79
@@ -1,79 +0,0 @@
1−{-# OPTIONS_GHC -fno-warn-missing-signatures #-}
2−{-# OPTIONS_GHC -fno-warn-unused-imports #-}
3−{-# LANGUAGE ScopedTypeVariables #-}
4−
5−-- | To run these tests:
6−--
7−-- * `cabal repl psc-publish`
8−-- * `:l psc-publish/tests/Test.hs`
9−-- * `test`
10−
11−module Test where
12−
13−import Control.Monad
14−import Control.Applicative
15−import Control.Exception
16−import System.Process
17−import System.Directory
18−import qualified Data.ByteString.Lazy as BL
19−import Data.ByteString.Lazy (ByteString)
20−import qualified Data.Aeson as A
21−import Data.Aeson.BetterErrors
22−
23−import Main
24−import Language.PureScript.Docs
25−
26−pkgName = "purescript-prelude"
27−packageUrl = "https://github.com/purescript/" ++ pkgName
28−packageDir = "tmp/" ++ pkgName
29−
30−pushd :: forall a. FilePath -> IO a -> IO a
31−pushd dir act = do
32− original <- getCurrentDirectory
33− setCurrentDirectory dir
34− result <- try act :: IO (Either IOException a)
35− setCurrentDirectory original
36− either throwIO return result
37−
38−clonePackage :: IO ()
39−clonePackage = do
40− createDirectoryIfMissing True packageDir
41− pushd packageDir $ do
42− exists <- doesDirectoryExist ".git"
43− unless exists $ do
44− putStrLn ("Cloning " ++ pkgName ++ " into " ++ packageDir ++ "...")
45− readProcess "git" ["clone", packageUrl, "."] "" >>= putStr
46− readProcess "git" ["tag", "v999.0.0"] "" >>= putStr
47−
48−bowerInstall :: IO ()
49−bowerInstall = do
50− pushd packageDir $ do
51− readProcess "bower" ["install"] "" >>= putStr
52−
53−getPackage :: IO UploadedPackage
54−getPackage = do
55− clonePackage
56− bowerInstall
57− pushd packageDir preparePackage
58−
59−data TestResult
60− = ParseFailed String
61− | Mismatch ByteString ByteString -- ^ encoding before, encoding after
62− | Pass ByteString
63− deriving (Show, Read)
64−
65−-- | Test JSON encoding/decoding; parse the package, roundtrip to/from JSON,
66−-- and check we get the same string.
67−test :: IO TestResult
68−test = roundTrip <$> getPackage
69−
70−roundTrip :: UploadedPackage -> TestResult
71−roundTrip pkg =
72− let before = A.encode pkg
73− in case A.eitherDecode before of
74− Left err -> ParseFailed err
75− Right parsed -> do
76− let after = A.encode (parsed :: UploadedPackage)
77− if before == after
78− then Pass before
79− else Mismatch before after
psc/Main.hsdeleted−192
@@ -1,192 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Main
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DataKinds #-}
16−{-# LANGUAGE FlexibleContexts #-}
17−{-# LANGUAGE RecordWildCards #-}
18−{-# LANGUAGE TupleSections #-}
19−
20−module Main where
21−
22−import Control.Applicative
23−import Control.Monad
24−import Control.Monad.Error.Class (MonadError(..))
25−import Control.Monad.Writer.Strict
26−
27−import Data.List (isSuffixOf, partition)
28−import Data.Version (showVersion)
29−import qualified Data.Map as M
30−
31−import Options.Applicative as Opts
32−
33−import System.Exit (exitSuccess, exitFailure)
34−import System.IO (hPutStrLn, stderr)
35−import System.IO.UTF8
36−import System.FilePath.Glob (glob)
37−
38−import qualified Language.PureScript as P
39−import qualified Paths_purescript as Paths
40−
41−import Language.PureScript.Make
42−
43−data PSCMakeOptions = PSCMakeOptions
44− { pscmInput :: [FilePath]
45− , pscmForeignInput :: [FilePath]
46− , pscmOutputDir :: FilePath
47− , pscmOpts :: P.Options
48− , pscmUsePrefix :: Bool
49− }
50−
51−data InputOptions = InputOptions
52− { ioInputFiles :: [FilePath]
53− }
54−
55−compile :: PSCMakeOptions -> IO ()
56−compile (PSCMakeOptions inputGlob inputForeignGlob outputDir opts usePrefix) = do
57− input <- globWarningOnMisses warnFileTypeNotFound inputGlob
58− when (null input) $ do
59− hPutStrLn stderr "psc: No input files."
60− exitFailure
61− let (jsFiles, pursFiles) = partition (isSuffixOf ".js") input
62− moduleFiles <- readInput (InputOptions pursFiles)
63− inputForeign <- globWarningOnMisses warnFileTypeNotFound inputForeignGlob
64− foreignFiles <- forM (inputForeign ++ jsFiles) (\inFile -> (inFile,) <$> readUTF8File inFile)
65− case runWriterT (parseInputs moduleFiles foreignFiles) of
66− Left errs -> do
67− hPutStrLn stderr (P.prettyPrintMultipleErrors (P.optionsVerboseErrors opts) errs)
68− exitFailure
69− Right ((ms, foreigns), warnings) -> do
70− when (P.nonEmpty warnings) $
71− hPutStrLn stderr (P.prettyPrintMultipleWarnings (P.optionsVerboseErrors opts) warnings)
72− let filePathMap = M.fromList $ map (\(fp, P.Module _ _ mn _ _) -> (mn, fp)) ms
73− makeActions = buildMakeActions outputDir filePathMap foreigns usePrefix
74− e <- runMake opts $ P.make makeActions (map snd ms)
75− case e of
76− Left errs -> do
77− hPutStrLn stderr (P.prettyPrintMultipleErrors (P.optionsVerboseErrors opts) errs)
78− exitFailure
79− Right (_, warnings') -> do
80− when (P.nonEmpty warnings') $
81− hPutStrLn stderr (P.prettyPrintMultipleWarnings (P.optionsVerboseErrors opts) warnings')
82− exitSuccess
83−
84−warnFileTypeNotFound :: String -> IO ()
85−warnFileTypeNotFound = hPutStrLn stderr . ("psc: No files found using pattern: " ++)
86−
87−globWarningOnMisses :: (String -> IO ()) -> [FilePath] -> IO [FilePath]
88−globWarningOnMisses warn = concatMapM globWithWarning
89− where
90− globWithWarning pattern = do
91− paths <- glob pattern
92− when (null paths) $ warn pattern
93− return paths
94− concatMapM f = liftM concat . mapM f
95−
96−readInput :: InputOptions -> IO [(Either P.RebuildPolicy FilePath, String)]
97−readInput InputOptions{..} = forM ioInputFiles $ \inFile -> (Right inFile, ) <$> readUTF8File inFile
98−
99−parseInputs :: (Functor m, Applicative m, MonadError P.MultipleErrors m, MonadWriter P.MultipleErrors m)
100− => [(Either P.RebuildPolicy FilePath, String)]
101− -> [(FilePath, P.ForeignJS)]
102− -> m ([(Either P.RebuildPolicy FilePath, P.Module)], M.Map P.ModuleName FilePath)
103−parseInputs modules foreigns =
104− (,) <$> P.parseModulesFromFiles (either (const "") id) modules
105− <*> P.parseForeignModulesFromFiles foreigns
106−
107−inputFile :: Parser FilePath
108−inputFile = strArgument $
109− metavar "FILE"
110− <> help "The input .purs file(s)"
111−
112−inputForeignFile :: Parser FilePath
113−inputForeignFile = strOption $
114− short 'f'
115− <> long "ffi"
116− <> help "The input .js file(s) providing foreign import implementations"
117−
118−outputDirectory :: Parser FilePath
119−outputDirectory = strOption $
120− short 'o'
121− <> long "output"
122− <> Opts.value "output"
123− <> showDefault
124− <> help "The output directory"
125−
126−requirePath :: Parser (Maybe FilePath)
127−requirePath = optional $ strOption $
128− short 'r'
129− <> long "require-path"
130− <> help "The path prefix to use for require() calls in the generated JavaScript"
131−
132−noTco :: Parser Bool
133−noTco = switch $
134− long "no-tco"
135− <> help "Disable tail call optimizations"
136−
137−noMagicDo :: Parser Bool
138−noMagicDo = switch $
139− long "no-magic-do"
140− <> help "Disable the optimization that overloads the do keyword to generate efficient code specifically for the Eff monad"
141−
142−noOpts :: Parser Bool
143−noOpts = switch $
144− long "no-opts"
145− <> help "Skip the optimization phase"
146−
147−comments :: Parser Bool
148−comments = switch $
149− short 'c'
150− <> long "comments"
151− <> help "Include comments in the generated code"
152−
153−verboseErrors :: Parser Bool
154−verboseErrors = switch $
155− short 'v'
156− <> long "verbose-errors"
157− <> help "Display verbose error messages"
158−
159−noPrefix :: Parser Bool
160−noPrefix = switch $
161− short 'p'
162− <> long "no-prefix"
163− <> help "Do not include comment header"
164−
165−
166−options :: Parser P.Options
167−options = P.Options <$> noTco
168− <*> noMagicDo
169− <*> pure Nothing
170− <*> noOpts
171− <*> verboseErrors
172− <*> (not <$> comments)
173− <*> requirePath
174−
175−pscMakeOptions :: Parser PSCMakeOptions
176−pscMakeOptions = PSCMakeOptions <$> many inputFile
177− <*> many inputForeignFile
178− <*> outputDirectory
179− <*> options
180− <*> (not <$> noPrefix)
181−
182−
183−main :: IO ()
184−main = execParser opts >>= compile
185− where
186− opts = info (version <*> helper <*> pscMakeOptions) infoModList
187− infoModList = fullDesc <> headerInfo <> footerInfo
188− headerInfo = header "psc - Compiles PureScript to Javascript"
189− footerInfo = footer $ "psc " ++ showVersion Paths.version
190−
191− version :: Parser (a -> a)
192− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
psci/Completion.hsdeleted−233
@@ -1,233 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−
3−module Completion where
4−
5−import Data.Maybe (mapMaybe)
6−import Data.List (nub, nubBy, sortBy, isPrefixOf, stripPrefix)
7−import Data.Char (isUpper)
8−import Data.Function (on)
9−#if __GLASGOW_HASKELL__ < 710
10−import Data.Traversable (traverse)
11−#endif
12−
13−import Control.Arrow (second)
14−#if __GLASGOW_HASKELL__ < 710
15−import Control.Applicative ((<$>), (<*>))
16−#endif
17−import Control.Monad.Trans.Reader (asks, runReaderT, ReaderT)
18−import Control.Monad.Trans.State.Strict
19−
20−import System.Console.Haskeline
21−
22−import qualified Language.PureScript as P
23−import qualified Language.PureScript.Names as N
24−
25−import qualified Directive as D
26−import Types
27−
28−-- Completions may read the state, but not modify it.
29−type CompletionM = ReaderT PSCiState IO
30−
31−-- Lift a `CompletionM` action to a `StateT PSCiState IO` one.
32−liftCompletionM :: CompletionM a -> StateT PSCiState IO a
33−liftCompletionM act = StateT (\s -> (\a -> (a, s)) <$> runReaderT act s)
34−
35−-- Haskeline completions
36−
37−data CompletionContext
38− = CtxDirective String
39− | CtxFilePath String
40− | CtxModule
41− | CtxIdentifier
42− | CtxType
43− | CtxFixed String
44− deriving (Show, Read)
45−
46−-- |
47−-- Loads module, function, and file completions.
48−--
49−completion :: CompletionFunc (StateT PSCiState IO)
50−completion = liftCompletionM . completion'
51−
52−completion' :: CompletionFunc CompletionM
53−completion' = completeWordWithPrev Nothing " \t\n\r" findCompletions
54−
55−-- |
56−-- Decide what kind of completion we need based on input. This function expects
57−-- a list of complete words (to the left of the cursor) as the first argument,
58−-- and the current word as the second argument.
59−completionContext :: [String] -> String -> [CompletionContext]
60−completionContext [] _ = [CtxDirective "", CtxIdentifier, CtxFixed "import"]
61−completionContext ws w | headSatisfies (":" `isPrefixOf`) ws = completeDirective ws w
62−completionContext ws w | headSatisfies (== "import") ws = completeImport ws w
63−completionContext _ _ = [CtxIdentifier]
64−
65−completeDirective :: [String] -> String -> [CompletionContext]
66−completeDirective ws w =
67− case ws of
68− [] -> [CtxDirective w]
69− [dir] -> case D.directivesFor <$> stripPrefix ":" dir of
70− -- only offer completions if the directive is unambiguous
71− Just [dir'] -> directiveArg w dir'
72− _ -> []
73−
74− -- All directives take exactly one argument. If we haven't yet matched,
75− -- that means one argument has already been supplied. So don't complete
76− -- any others.
77− _ -> []
78−
79−directiveArg :: String -> Directive -> [CompletionContext]
80−directiveArg _ Browse = [CtxModule]
81−directiveArg w Load = [CtxFilePath w]
82−directiveArg w Foreign = [CtxFilePath w]
83−directiveArg _ Quit = []
84−directiveArg _ Reset = []
85−directiveArg _ Help = []
86−directiveArg _ Show = map CtxFixed replQueryStrings
87−directiveArg _ Type = [CtxIdentifier]
88−directiveArg _ Kind = [CtxType]
89−
90−completeImport :: [String] -> String -> [CompletionContext]
91−completeImport ws w' =
92− case (ws, w') of
93− (["import"], w) | headSatisfies isUpper w -> [CtxModule]
94− (["import"], _) -> [CtxModule, CtxFixed "qualified"]
95− (["import", "qualified"], _) -> [CtxModule]
96− _ -> []
97−
98−headSatisfies :: (a -> Bool) -> [a] -> Bool
99−headSatisfies p str =
100− case str of
101− (c:_) -> p c
102− _ -> False
103−
104−-- | Callback for Haskeline's `completeWordWithPrev`.
105−-- Expects:
106−-- * Line contents to the left of the word, reversed
107−-- * Word to be completed
108−findCompletions :: String -> String -> CompletionM [Completion]
109−findCompletions prev word = do
110− let ctx = completionContext (words (reverse prev)) word
111− completions <- concat <$> traverse getCompletions ctx
112− return $ sortBy directivesFirst completions
113− where
114− getCompletions :: CompletionContext -> CompletionM [Completion]
115− getCompletions = fmap (mapMaybe (either (prefixedBy word) Just)) . getCompletion
116−
117− prefixedBy :: String -> String -> Maybe Completion
118− prefixedBy w cand = if w `isPrefixOf` cand
119− then Just (simpleCompletion cand)
120− else Nothing
121−
122−getCompletion :: CompletionContext -> CompletionM [Either String Completion]
123−getCompletion ctx =
124− case ctx of
125− CtxFilePath f -> map Right <$> listFiles f
126− CtxModule -> map Left <$> getModuleNames
127− CtxIdentifier -> map Left <$> ((++) <$> getIdentNames <*> getDctorNames)
128− CtxType -> map Left <$> getTypeNames
129− CtxFixed str -> return [Left str]
130− CtxDirective d -> return (map Left (completeDirectives d))
131−
132− where
133− completeDirectives :: String -> [String]
134− completeDirectives = map (':' :) . D.directiveStringsFor
135−
136−
137−getLoadedModules :: CompletionM [P.Module]
138−getLoadedModules = asks (map snd . psciLoadedModules)
139−
140−getImportedModules :: CompletionM [ImportedModule]
141−getImportedModules = asks psciImportedModules
142−
143−getModuleNames :: CompletionM [String]
144−getModuleNames = moduleNames <$> getLoadedModules
145−
146−mapLoadedModulesAndQualify :: (a -> String) -> (P.Module -> [(a, P.Declaration)]) -> CompletionM [String]
147−mapLoadedModulesAndQualify sho f = do
148− ms <- getLoadedModules
149− let argPairs = do m <- ms
150− fm <- f m
151− return (m, fm)
152− concat <$> traverse (uncurry (getAllQualifications sho)) argPairs
153−
154−getIdentNames :: CompletionM [String]
155−getIdentNames = mapLoadedModulesAndQualify P.showIdent identNames
156−
157−getDctorNames :: CompletionM [String]
158−getDctorNames = mapLoadedModulesAndQualify P.runProperName dctorNames
159−
160−getTypeNames :: CompletionM [String]
161−getTypeNames = mapLoadedModulesAndQualify P.runProperName typeDecls
162−
163−-- | Given a module and a declaration in that module, return all possible ways
164−-- it could have been referenced given the current PSCiState - including fully
165−-- qualified, qualified using an alias, and unqualified.
166−getAllQualifications :: (a -> String) -> P.Module -> (a, P.Declaration) -> CompletionM [String]
167−getAllQualifications sho m (declName, decl) = do
168− imports <- getAllImportsOf m
169− let fullyQualified = qualifyWith (Just (P.getModuleName m))
170− let otherQuals = nub (concatMap qualificationsUsing imports)
171− return $ fullyQualified : otherQuals
172− where
173− qualifyWith mMod = P.showQualified sho (P.Qualified mMod declName)
174− referencedBy refs = P.isExported (Just refs) decl
175−
176− qualificationsUsing (_, importType, asQ') =
177− let q = qualifyWith asQ'
178− in case importType of
179− P.Implicit -> [q]
180− P.Explicit refs -> if referencedBy refs
181− then [q]
182− else []
183− P.Hiding refs -> if referencedBy refs
184− then []
185− else [q]
186−
187−
188−-- | Returns all the ImportedModule values referring to imports of a particular
189−-- module.
190−getAllImportsOf :: P.Module -> CompletionM [ImportedModule]
191−getAllImportsOf = asks . allImportsOf
192−
193−nubOnFst :: Eq a => [(a, b)] -> [(a, b)]
194−nubOnFst = nubBy ((==) `on` fst)
195−
196−typeDecls :: P.Module -> [(N.ProperName, P.Declaration)]
197−typeDecls = mapMaybe getTypeName . filter P.isDataDecl . P.exportedDeclarations
198− where
199− getTypeName :: P.Declaration -> Maybe (N.ProperName, P.Declaration)
200− getTypeName d@(P.TypeSynonymDeclaration name _ _) = Just (name, d)
201− getTypeName d@(P.DataDeclaration _ name _ _) = Just (name, d)
202− getTypeName (P.PositionedDeclaration _ _ d) = getTypeName d
203− getTypeName _ = Nothing
204−
205−identNames :: P.Module -> [(N.Ident, P.Declaration)]
206−identNames = nubOnFst . concatMap getDeclNames . P.exportedDeclarations
207− where
208− getDeclNames :: P.Declaration -> [(P.Ident, P.Declaration)]
209− getDeclNames d@(P.ValueDeclaration ident _ _ _) = [(ident, d)]
210− getDeclNames d@(P.TypeDeclaration ident _ ) = [(ident, d)]
211− getDeclNames d@(P.ExternDeclaration ident _) = [(ident, d)]
212− getDeclNames d@(P.TypeClassDeclaration _ _ _ ds) = map (second (const d)) $ concatMap getDeclNames ds
213− getDeclNames (P.PositionedDeclaration _ _ d) = getDeclNames d
214− getDeclNames _ = []
215−
216−dctorNames :: P.Module -> [(N.ProperName, P.Declaration)]
217−dctorNames = nubOnFst . concatMap go . P.exportedDeclarations
218− where
219− go :: P.Declaration -> [(N.ProperName, P.Declaration)]
220− go decl@(P.DataDeclaration _ _ _ ctors) = map (\n -> (n, decl)) (map fst ctors)
221− go (P.PositionedDeclaration _ _ d) = go d
222− go _ = []
223−
224−moduleNames :: [P.Module] -> [String]
225−moduleNames ms = nub [P.runModuleName moduleName | P.Module _ _ moduleName _ _ <- ms]
226−
227−directivesFirst :: Completion -> Completion -> Ordering
228−directivesFirst (Completion _ d1 _) (Completion _ d2 _) = go d1 d2
229− where
230− go (':' : xs) (':' : ys) = compare xs ys
231− go (':' : _) _ = LT
232− go _ (':' : _) = GT
233− go xs ys = compare xs ys
psci/Directive.hsdeleted−115
@@ -1,115 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Directive
4−-- Copyright :
5−-- License : MIT
6−--
7−-- Maintainer :
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Directives for PSCI.
13−--
14−-----------------------------------------------------------------------------
15−
16−module Directive where
17−
18−import Data.Maybe (fromJust, listToMaybe)
19−import Data.List (isPrefixOf)
20−import Data.Tuple (swap)
21−
22−import Types
23−
24−-- |
25−-- List of all avaliable directives.
26−--
27−directives :: [Directive]
28−directives = map fst directiveStrings
29−
30−-- |
31−-- A mapping of directives to the different strings that can be used to invoke
32−-- them.
33−--
34−directiveStrings :: [(Directive, [String])]
35−directiveStrings =
36− [ (Help , ["?", "help"])
37− , (Quit , ["quit"])
38− , (Reset , ["reset"])
39− , (Browse , ["browse"])
40− , (Load , ["load", "module"])
41− , (Foreign, ["foreign"])
42− , (Type , ["type"])
43− , (Kind , ["kind"])
44− , (Show , ["show"])
45− ]
46−
47−-- |
48−-- Like directiveStrings, but the other way around.
49−--
50−directiveStrings' :: [(String, Directive)]
51−directiveStrings' = concatMap go directiveStrings
52− where
53− go (dir, strs) = map (\s -> (s, dir)) strs
54−
55−-- |
56−-- List of all directive strings.
57−--
58−strings :: [String]
59−strings = concatMap snd directiveStrings
60−
61−-- |
62−-- Returns all possible string representations of a directive.
63−--
64−stringsFor :: Directive -> [String]
65−stringsFor d = fromJust (lookup d directiveStrings)
66−
67−-- |
68−-- Returns the default string representation of a directive.
69−--
70−stringFor :: Directive -> String
71−stringFor = head . stringsFor
72−
73−-- |
74−-- Returns the list of directives which could be expanded from the string
75−-- argument, together with the string alias that matched.
76−--
77−directivesFor' :: String -> [(Directive, String)]
78−directivesFor' str = go directiveStrings'
79− where
80− go = map swap . filter ((str `isPrefixOf`) . fst)
81−
82−directivesFor :: String -> [Directive]
83−directivesFor = map fst . directivesFor'
84−
85−directiveStringsFor :: String -> [String]
86−directiveStringsFor = map snd . directivesFor'
87−
88−parseDirective :: String -> Maybe Directive
89−parseDirective = listToMaybe . directivesFor
90−
91−-- |
92−-- True if the given directive takes an argument, false otherwise.
93−hasArgument :: Directive -> Bool
94−hasArgument Help = False
95−hasArgument Quit = False
96−hasArgument Reset = False
97−hasArgument _ = True
98−
99−-- |
100−-- The help menu.
101−--
102−help :: [(Directive, String, String)]
103−help =
104− [ (Help, "", "Show this help menu")
105− , (Quit, "", "Quit PSCi")
106− , (Reset, "", "Discard all imported modules and declared bindings")
107− , (Browse, "<module>", "See all functions in <module>")
108− , (Load, "<file>", "Load <file> for importing")
109− , (Foreign, "<file>", "Load foreign module <file>")
110− , (Type, "<expr>", "Show the type of <expr>")
111− , (Kind, "<type>", "Show the kind of <type>")
112− , (Show, "import", "Show all imported modules")
113− , (Show, "loaded", "Show all loaded modules")
114− ]
115−
psci/IO.hsdeleted−21
@@ -1,21 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : IO
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module IO where
16−
17−import System.Directory (createDirectoryIfMissing)
18−import System.FilePath (takeDirectory)
19−
20−mkdirp :: FilePath -> IO ()
21−mkdirp = createDirectoryIfMissing True . takeDirectory
psci/PSCi.hsdeleted−604
@@ -1,604 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : PSCi
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- PureScript Compiler Interactive.
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE DoAndIfThenElse #-}
17−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
18−{-# LANGUAGE RecordWildCards #-}
19−{-# LANGUAGE TupleSections #-}
20−{-# LANGUAGE CPP #-}
21−
22−module PSCi where
23−
24−import Data.Foldable (traverse_)
25−import Data.List (intercalate, nub, sort)
26−#if __GLASGOW_HASKELL__ < 710
27−import Data.Traversable (traverse)
28−#endif
29−import Data.Tuple (swap)
30−import Data.Version (showVersion)
31−import qualified Data.Map as M
32−
33−import Control.Applicative
34−import Control.Arrow (first)
35−import Control.Monad
36−import Control.Monad.Error.Class (MonadError(..))
37−import Control.Monad.Trans.Class
38−import Control.Monad.Trans.Except (runExceptT)
39−import Control.Monad.Trans.Maybe (MaybeT(..), runMaybeT)
40−import Control.Monad.Trans.State.Strict
41−import Control.Monad.IO.Class (liftIO)
42−import Control.Monad.Writer.Strict (runWriter)
43−import qualified Control.Monad.Trans.State.Lazy as L
44−
45−import Options.Applicative as Opts
46−
47−import System.Console.Haskeline
48−import System.Directory (doesFileExist, findExecutable, getHomeDirectory, getCurrentDirectory)
49−import System.Exit
50−import System.FilePath (pathSeparator, (</>), isPathSeparator)
51−import System.FilePath.Glob (glob)
52−import System.Process (readProcessWithExitCode)
53−import System.IO.Error (tryIOError)
54−
55−import qualified Language.PureScript as P
56−import qualified Language.PureScript.Names as N
57−import qualified Paths_purescript as Paths
58−
59−import qualified Directive as D
60−import Completion (completion)
61−import IO (mkdirp)
62−import Parser (parseCommand)
63−import Types
64−
65−-- | The name of the PSCI support module
66−supportModuleName :: P.ModuleName
67−supportModuleName = P.ModuleName [P.ProperName "$PSCI", P.ProperName "Support"]
68−
69−-- | Support module, contains code to evaluate terms
70−supportModule :: P.Module
71−supportModule =
72− case P.parseModulesFromFiles id [("", code)] of
73− Right [(_, P.Module ss cs _ ds exps)] -> P.Module ss cs supportModuleName ds exps
74− _ -> error "Support module could not be parsed"
75− where
76− code :: String
77− code = unlines
78− [ "module S where"
79− , ""
80− , "import Prelude"
81− , "import Control.Monad.Eff"
82− , "import Control.Monad.Eff.Console"
83− , "import Control.Monad.Eff.Unsafe"
84− , ""
85− , "class Eval a where"
86− , " eval :: a -> Eff (console :: CONSOLE) Unit"
87− , ""
88− , "instance evalShow :: (Show a) => Eval a where"
89− , " eval = print"
90− , ""
91− , "instance evalEff :: (Eval a) => Eval (Eff eff a) where"
92− , " eval x = unsafeInterleaveEff x >>= eval"
93− ]
94−
95−-- File helpers
96−
97−onFirstFileMatching :: Monad m => (b -> m (Maybe a)) -> [b] -> m (Maybe a)
98−onFirstFileMatching f pathVariants = runMaybeT . msum $ map (MaybeT . f) pathVariants
99−
100−-- |
101−-- Locates the node executable.
102−-- Checks for either @nodejs@ or @node@.
103−--
104−findNodeProcess :: IO (Maybe String)
105−findNodeProcess = onFirstFileMatching findExecutable names
106− where names = ["nodejs", "node"]
107−
108−-- |
109−-- Grabs the filename where the history is stored.
110−--
111−getHistoryFilename :: IO FilePath
112−getHistoryFilename = do
113− home <- getHomeDirectory
114− let filename = home </> ".purescript" </> "psci_history"
115− mkdirp filename
116− return filename
117−
118−-- |
119−-- Loads a file for use with imports.
120−--
121−loadModule :: FilePath -> IO (Either String [P.Module])
122−loadModule filename = do
123− content <- readFile filename
124− return $ either (Left . P.prettyPrintMultipleErrors False) (Right . map snd) $ P.parseModulesFromFiles id [(filename, content)]
125−
126−-- |
127−-- Load all modules.
128−--
129−loadAllModules :: [FilePath] -> IO (Either P.MultipleErrors [(Either P.RebuildPolicy FilePath, P.Module)])
130−loadAllModules files = do
131− filesAndContent <- forM files $ \filename -> do
132− content <- readFile filename
133− return (Right filename, content)
134− return $ P.parseModulesFromFiles (either (const "") id) filesAndContent
135−
136−-- |
137−-- Load all modules, updating the application state
138−--
139−loadAllImportedModules :: PSCI ()
140−loadAllImportedModules = do
141− files <- PSCI . lift $ fmap psciImportedFilenames get
142− modulesOrFirstError <- psciIO $ loadAllModules files
143− case modulesOrFirstError of
144− Left errs -> printErrors errs
145− Right modules -> PSCI . lift . modify $ \st -> st { psciLoadedModules = modules }
146−
147−-- |
148−-- Expands tilde in path.
149−--
150−expandTilde :: FilePath -> IO FilePath
151−expandTilde ('~':p:rest) | isPathSeparator p = (</> rest) <$> getHomeDirectory
152−expandTilde p = return p
153−
154−-- Messages
155−
156−-- |
157−-- The help message.
158−--
159−helpMessage :: String
160−helpMessage = "The following commands are available:\n\n " ++
161− intercalate "\n " (map line D.help) ++
162− "\n\n" ++ extraHelp
163− where
164− line :: (Directive, String, String) -> String
165− line (dir, arg, desc) =
166− let cmd = ':' : D.stringFor dir
167− in unwords [ cmd
168− , replicate (11 - length cmd) ' '
169− , arg
170− , replicate (11 - length arg) ' '
171− , desc
172− ]
173−
174− extraHelp =
175− "Further information is available on the PureScript wiki:\n" ++
176− " --> https://github.com/purescript/purescript/wiki/psci"
177−
178−
179−-- |
180−-- The welcome prologue.
181−--
182−prologueMessage :: String
183−prologueMessage = intercalate "\n"
184− [ " ____ ____ _ _ "
185− , "| _ \\ _ _ _ __ ___/ ___| ___ _ __(_)_ __ | |_ "
186− , "| |_) | | | | '__/ _ \\___ \\ / __| '__| | '_ \\| __|"
187− , "| __/| |_| | | | __/___) | (__| | | | |_) | |_ "
188− , "|_| \\__,_|_| \\___|____/ \\___|_| |_| .__/ \\__|"
189− , " |_| "
190− , ""
191− , ":? shows help"
192− ]
193−
194−-- |
195−-- The quit message.
196−--
197−quitMessage :: String
198−quitMessage = "See ya!"
199−
200−-- |
201−-- PSCI monad
202−--
203−newtype PSCI a = PSCI { runPSCI :: InputT (StateT PSCiState IO) a } deriving (Functor, Applicative, Monad)
204−
205−psciIO :: IO a -> PSCI a
206−psciIO io = PSCI . lift $ lift io
207−
208−-- |
209−-- Makes a volatile module to execute the current expression.
210−--
211−createTemporaryModule :: Bool -> PSCiState -> P.Expr -> P.Module
212−createTemporaryModule exec PSCiState{psciImportedModules = imports, psciLetBindings = lets} val =
213− let
214− moduleName = P.ModuleName [P.ProperName "$PSCI"]
215− trace = P.Var (P.Qualified (Just supportModuleName) (P.Ident "eval"))
216− mainValue = P.App trace (P.Var (P.Qualified Nothing (P.Ident "it")))
217− itDecl = P.ValueDeclaration (P.Ident "it") P.Public [] $ Right val
218− mainDecl = P.ValueDeclaration (P.Ident "main") P.Public [] $ Right mainValue
219− decls = if exec then [itDecl, mainDecl] else [itDecl]
220− in
221− P.Module (P.internalModuleSourceSpan "<internal>") [] moduleName ((importDecl `map` imports) ++ lets ++ decls) Nothing
222−
223−
224−-- |
225−-- Makes a volatile module to hold a non-qualified type synonym for a fully-qualified data type declaration.
226−--
227−createTemporaryModuleForKind :: PSCiState -> P.Type -> P.Module
228−createTemporaryModuleForKind PSCiState{psciImportedModules = imports, psciLetBindings = lets} typ =
229− let
230− moduleName = P.ModuleName [P.ProperName "$PSCI"]
231− itDecl = P.TypeSynonymDeclaration (P.ProperName "IT") [] typ
232− in
233− P.Module (P.internalModuleSourceSpan "<internal>") [] moduleName ((importDecl `map` imports) ++ lets ++ [itDecl]) Nothing
234−
235−-- |
236−-- Makes a volatile module to execute the current imports.
237−--
238−createTemporaryModuleForImports :: PSCiState -> P.Module
239−createTemporaryModuleForImports PSCiState{psciImportedModules = imports} =
240− let
241− moduleName = P.ModuleName [P.ProperName "$PSCI"]
242− in
243− P.Module (P.internalModuleSourceSpan "<internal>") [] moduleName (importDecl `map` imports) Nothing
244−
245−importDecl :: ImportedModule -> P.Declaration
246−importDecl (mn, declType, asQ) = P.ImportDeclaration mn declType asQ
247−
248−indexFile :: FilePath
249−indexFile = ".psci_modules" ++ pathSeparator : "index.js"
250−
251−modulesDir :: FilePath
252−modulesDir = ".psci_modules" ++ pathSeparator : "node_modules"
253−
254−-- | This is different than the runMake in 'Language.PureScript.Make' in that it specifies the
255−-- options and ignores the warning messages.
256−runMake :: P.Make a -> IO (Either P.MultipleErrors a)
257−runMake mk = fmap (fmap fst) $ P.runMake P.defaultOptions mk
258−
259−makeIO :: (IOError -> P.ErrorMessage) -> IO a -> P.Make a
260−makeIO f io = do
261− e <- liftIO $ tryIOError io
262− either (throwError . P.singleError . f) return e
263−
264−make :: PSCiState -> [(Either P.RebuildPolicy FilePath, P.Module)] -> P.Make P.Environment
265−make PSCiState{..} ms = P.make actions' (map snd (psciLoadedModules ++ ms))
266− where
267− filePathMap = M.fromList $ (first P.getModuleName . swap) `map` (psciLoadedModules ++ ms)
268− actions = P.buildMakeActions modulesDir filePathMap psciForeignFiles False
269− actions' = actions { P.progress = const (return ()) }
270−
271−-- |
272−-- Takes a value declaration and evaluates it with the current state.
273−--
274−handleDeclaration :: P.Expr -> PSCI ()
275−handleDeclaration val = do
276− st <- PSCI $ lift get
277− let m = createTemporaryModule True st val
278− let nodeArgs = psciNodeFlags st ++ [indexFile]
279− e <- psciIO . runMake $ make st [(Left P.RebuildAlways, supportModule), (Left P.RebuildAlways, m)]
280− case e of
281− Left errs -> printErrors errs
282− Right _ -> do
283− psciIO $ writeFile indexFile "require('$PSCI').main();"
284− process <- psciIO findNodeProcess
285− result <- psciIO $ traverse (\node -> readProcessWithExitCode node nodeArgs "") process
286− case result of
287− Just (ExitSuccess, out, _) -> PSCI $ outputStrLn out
288− Just (ExitFailure _, _, err) -> PSCI $ outputStrLn err
289− Nothing -> PSCI $ outputStrLn "Couldn't find node.js"
290−
291−-- |
292−-- Takes a list of declarations and updates the environment, then run a make. If the declaration fails,
293−-- restore the original environment.
294−--
295−handleDecls :: [P.Declaration] -> PSCI ()
296−handleDecls ds = do
297− st <- PSCI $ lift get
298− let st' = updateLets ds st
299− let m = createTemporaryModule False st' (P.ObjectLiteral [])
300− e <- psciIO . runMake $ make st' [(Left P.RebuildAlways, m)]
301− case e of
302− Left err -> printErrors err
303− Right _ -> PSCI $ lift (put st')
304−
305−-- |
306−-- Show actual loaded modules in psci.
307−--
308−handleShowLoadedModules :: PSCI ()
309−handleShowLoadedModules = do
310− PSCiState { psciLoadedModules = loadedModules } <- PSCI $ lift get
311− psciIO $ readModules loadedModules >>= putStrLn
312− return ()
313− where readModules = return . unlines . sort . nub . map toModuleName
314− toModuleName = N.runModuleName . (\ (P.Module _ _ mdName _ _) -> mdName) . snd
315−
316−-- |
317−-- Show the imported modules in psci.
318−--
319−handleShowImportedModules :: PSCI ()
320−handleShowImportedModules = do
321− PSCiState { psciImportedModules = importedModules } <- PSCI $ lift get
322− psciIO $ showModules importedModules >>= putStrLn
323− return ()
324− where
325− showModules = return . unlines . sort . map showModule
326− showModule (mn, declType, asQ) =
327− "import " ++ case asQ of
328− Just mn' -> "qualified " ++ N.runModuleName mn ++ " as " ++ N.runModuleName mn'
329− Nothing -> N.runModuleName mn ++ " " ++ showDeclType declType
330−
331− showDeclType P.Implicit = ""
332− showDeclType (P.Explicit refs) = refsList refs
333− showDeclType (P.Hiding refs) = "hiding " ++ refsList refs
334− refsList refs = "(" ++ commaList (map showRef refs) ++ ")"
335−
336− showRef :: P.DeclarationRef -> String
337− showRef (P.TypeRef pn dctors) = show pn ++ "(" ++ maybe ".." (commaList . map N.runProperName) dctors ++ ")"
338− showRef (P.ValueRef ident) = show ident
339− showRef (P.TypeClassRef pn) = show pn
340− showRef (P.TypeInstanceRef ident) = show ident
341− showRef (P.ModuleRef name) = "module " ++ show name
342− showRef (P.PositionedDeclarationRef _ _ ref) = showRef ref
343−
344− commaList :: [String] -> String
345− commaList = intercalate ", "
346−
347−-- |
348−-- Imports a module, preserving the initial state on failure.
349−--
350−handleImport :: ImportedModule -> PSCI ()
351−handleImport im = do
352− st <- updateImportedModules im <$> PSCI (lift get)
353− let m = createTemporaryModuleForImports st
354− e <- psciIO . runMake $ make st [(Left P.RebuildAlways, m)]
355− case e of
356− Left errs -> printErrors errs
357− Right _ -> do
358− PSCI $ lift $ put st
359− return ()
360−
361−-- |
362−-- Takes a value and prints its type
363−--
364−handleTypeOf :: P.Expr -> PSCI ()
365−handleTypeOf val = do
366− st <- PSCI $ lift get
367− let m = createTemporaryModule False st val
368− e <- psciIO . runMake $ make st [(Left P.RebuildAlways, m)]
369− case e of
370− Left errs -> printErrors errs
371− Right env' ->
372− case M.lookup (P.ModuleName [P.ProperName "$PSCI"], P.Ident "it") (P.names env') of
373− Just (ty, _, _) -> PSCI . outputStrLn . P.prettyPrintType $ ty
374− Nothing -> PSCI $ outputStrLn "Could not find type"
375−
376−-- |
377−-- Pretty print a module's signatures
378−--
379−printModuleSignatures :: P.ModuleName -> P.Environment -> PSCI ()
380−printModuleSignatures moduleName env =
381− PSCI $ let namesEnv = P.names env
382− moduleNamesIdent = (filter ((== moduleName) . fst) . M.keys) namesEnv
383− in case moduleNamesIdent of
384− [] -> outputStrLn $ "This module '"++ P.runModuleName moduleName ++"' does not export functions."
385− _ -> ( outputStrLn
386− . unlines
387− . sort
388− . map (showType . findType namesEnv)) moduleNamesIdent
389− where findType :: M.Map (P.ModuleName, P.Ident) (P.Type, P.NameKind, P.NameVisibility) -> (P.ModuleName, P.Ident) -> (P.Ident, Maybe (P.Type, P.NameKind, P.NameVisibility))
390− findType envNames m@(_, mIdent) = (mIdent, M.lookup m envNames)
391− showType :: (P.Ident, Maybe (P.Type, P.NameKind, P.NameVisibility)) -> String
392− showType (mIdent, Just (mType, _, _)) = show mIdent ++ " :: " ++ P.prettyPrintType mType
393− showType _ = error "The impossible happened in printModuleSignatures."
394−
395−-- |
396−-- Browse a module and displays its signature (if module exists).
397−--
398−handleBrowse :: P.ModuleName -> PSCI ()
399−handleBrowse moduleName = do
400− st <- PSCI $ lift get
401− env <- psciIO . runMake $ make st []
402− case env of
403− Left errs -> printErrors errs
404− Right env' ->
405− if moduleName `notElem` (nub . map ((\ (P.Module _ _ modName _ _ ) -> modName) . snd)) (psciLoadedModules st)
406− then PSCI $ outputStrLn $ "Module '" ++ N.runModuleName moduleName ++ "' is not valid."
407− else printModuleSignatures moduleName env'
408−
409−-- | Pretty-print errors
410−printErrors :: P.MultipleErrors -> PSCI ()
411−printErrors = PSCI . outputStrLn . P.prettyPrintMultipleErrors False
412−
413−-- |
414−-- Takes a value and prints its kind
415−--
416−handleKindOf :: P.Type -> PSCI ()
417−handleKindOf typ = do
418− st <- PSCI $ lift get
419− let m = createTemporaryModuleForKind st typ
420− mName = P.ModuleName [P.ProperName "$PSCI"]
421− e <- psciIO . runMake $ make st [(Left P.RebuildAlways, m)]
422− case e of
423− Left errs -> printErrors errs
424− Right env' ->
425− case M.lookup (P.Qualified (Just mName) $ P.ProperName "IT") (P.typeSynonyms env') of
426− Just (_, typ') -> do
427− let chk = P.CheckState env' 0 0 (Just mName)
428− k = fst . runWriter . runExceptT $ L.runStateT (P.unCheck (P.kindOf mName typ')) chk
429− case k of
430− Left errStack -> PSCI . outputStrLn . P.prettyPrintMultipleErrors False $ errStack
431− Right (kind, _) -> PSCI . outputStrLn . P.prettyPrintKind $ kind
432− Nothing -> PSCI $ outputStrLn "Could not find kind"
433−
434−-- Commands
435−
436−-- |
437−-- Parses the input and returns either a Metacommand, or an error as a string.
438−--
439−getCommand :: Bool -> InputT (StateT PSCiState IO) (Either String (Maybe Command))
440−getCommand singleLineMode = handleInterrupt (return (Right Nothing)) $ do
441− firstLine <- withInterrupt $ getInputLine "> "
442− case firstLine of
443− Nothing -> return (Right (Just QuitPSCi)) -- Ctrl-D when input is empty
444− Just "" -> return (Right Nothing)
445− Just s | singleLineMode || head s == ':' -> return . either Left (Right . Just) $ parseCommand s
446− Just s -> either Left (Right . Just) . parseCommand <$> go [s]
447− where
448− go :: [String] -> InputT (StateT PSCiState IO) String
449− go ls = maybe (return . unlines $ reverse ls) (go . (:ls)) =<< getInputLine " "
450−
451−-- |
452−-- Performs an action for each meta-command given, and also for expressions.
453−--
454−handleCommand :: Command -> PSCI ()
455−handleCommand (Expression val) = handleDeclaration val
456−handleCommand ShowHelp = PSCI $ outputStrLn helpMessage
457−handleCommand (Import im) = handleImport im
458−handleCommand (Decls l) = handleDecls l
459−handleCommand (LoadFile filePath) = whenFileExists filePath $ \absPath -> do
460− PSCI . lift $ modify (updateImportedFiles absPath)
461− m <- psciIO $ loadModule absPath
462− case m of
463− Left err -> PSCI $ outputStrLn err
464− Right mods -> PSCI . lift $ modify (updateModules (map ((,) (Right absPath)) mods))
465−handleCommand (LoadForeign filePath) = whenFileExists filePath $ \absPath -> do
466− foreignsOrError <- psciIO . runMake $ do
467− foreignFile <- makeIO (const (P.ErrorMessage [] $ P.CannotReadFile absPath)) (readFile absPath)
468− P.parseForeignModulesFromFiles [(absPath, foreignFile)]
469− case foreignsOrError of
470− Left err -> PSCI $ outputStrLn $ P.prettyPrintMultipleErrors False err
471− Right foreigns -> PSCI . lift $ modify (updateForeignFiles foreigns)
472−handleCommand ResetState = do
473− files <- psciImportedFilenames <$> PSCI (lift get)
474− PSCI . lift . modify $ \st -> st
475− { psciImportedFilenames = files
476− , psciImportedModules = []
477− , psciLetBindings = []
478− }
479− loadAllImportedModules
480−handleCommand (TypeOf val) = handleTypeOf val
481−handleCommand (KindOf typ) = handleKindOf typ
482−handleCommand (BrowseModule moduleName) = handleBrowse moduleName
483−handleCommand (ShowInfo QueryLoaded) = handleShowLoadedModules
484−handleCommand (ShowInfo QueryImport) = handleShowImportedModules
485−handleCommand QuitPSCi = error "`handleCommand QuitPSCi` was called. This is a bug."
486−
487−whenFileExists :: FilePath -> (FilePath -> PSCI ()) -> PSCI ()
488−whenFileExists filePath f = do
489− absPath <- psciIO $ expandTilde filePath
490− exists <- psciIO $ doesFileExist absPath
491− if exists
492− then f absPath
493− else PSCI . outputStrLn $ "Couldn't locate: " ++ filePath
494−
495−-- |
496−-- Attempts to read initial commands from '.psci' in the present working
497−-- directory then the user's home
498−--
499−loadUserConfig :: IO (Maybe [Command])
500−loadUserConfig = onFirstFileMatching readCommands pathGetters
501− where
502− pathGetters = [getCurrentDirectory, getHomeDirectory]
503− readCommands :: IO FilePath -> IO (Maybe [Command])
504− readCommands path = do
505− configFile <- (</> ".psci") <$> path
506− exists <- doesFileExist configFile
507− if exists
508− then do
509− ls <- lines <$> readFile configFile
510− case mapM parseCommand ls of
511− Left err -> print err >> exitFailure
512− Right cs -> return $ Just cs
513− else
514− return Nothing
515−
516−
517−-- | Checks if the Console module is defined
518−consoleIsDefined :: [P.Module] -> Bool
519−consoleIsDefined = any ((== P.ModuleName (map P.ProperName [ "Control", "Monad", "Eff", "Console" ])) . P.getModuleName)
520−
521−-- |
522−-- The PSCI main loop.
523−--
524−loop :: PSCiOptions -> IO ()
525−loop PSCiOptions{..} = do
526− config <- loadUserConfig
527− inputFiles <- concat <$> mapM glob psciInputFile
528− foreignFiles <- concat <$> mapM glob psciForeignInputFiles
529− modulesOrFirstError <- loadAllModules inputFiles
530− case modulesOrFirstError of
531− Left errs -> putStrLn (P.prettyPrintMultipleErrors False errs) >> exitFailure
532− Right modules -> do
533− historyFilename <- getHistoryFilename
534− let settings = defaultSettings { historyFile = Just historyFilename }
535− foreignsOrError <- runMake $ do
536− foreignFilesContent <- forM foreignFiles (\inFile -> (inFile,) <$> makeIO (const (P.ErrorMessage [] $ P.CannotReadFile inFile)) (readFile inFile))
537− P.parseForeignModulesFromFiles foreignFilesContent
538− case foreignsOrError of
539− Left errs -> putStrLn (P.prettyPrintMultipleErrors False errs) >> exitFailure
540− Right foreigns ->
541− flip evalStateT (PSCiState inputFiles [] modules foreigns [] psciInputNodeFlags) . runInputT (setComplete completion settings) $ do
542− outputStrLn prologueMessage
543− traverse_ (mapM_ (runPSCI . handleCommand)) config
544− modules' <- lift $ gets psciLoadedModules
545− unless (consoleIsDefined (map snd modules')) . outputStrLn $ unlines
546− [ "PSCi requires the purescript-console module to be installed."
547− , "For help getting started, visit http://wiki.purescript.org/PSCi"
548− ]
549− go
550− where
551− go :: InputT (StateT PSCiState IO) ()
552− go = do
553− c <- getCommand (not psciMultiLineMode)
554− case c of
555− Left err -> outputStrLn err >> go
556− Right Nothing -> go
557− Right (Just QuitPSCi) -> outputStrLn quitMessage
558− Right (Just c') -> do
559− handleInterrupt (outputStrLn "Interrupted.")
560− (withInterrupt (runPSCI (loadAllImportedModules >> handleCommand c')))
561− go
562−
563−multiLineMode :: Parser Bool
564−multiLineMode = switch $
565− long "multi-line-mode"
566− <> short 'm'
567− <> Opts.help "Run in multi-line mode (use ^D to terminate commands)"
568−
569−inputFile :: Parser FilePath
570−inputFile = strArgument $
571− metavar "FILE"
572− <> Opts.help "Optional .purs files to load on start"
573−
574−inputForeignFile :: Parser FilePath
575−inputForeignFile = strOption $
576− short 'f'
577− <> long "ffi"
578− <> help "The input .js file(s) providing foreign import implementations"
579−
580−nodeFlagsFlag :: Parser [String]
581−nodeFlagsFlag = option parser $
582− long "node-opts"
583− <> metavar "NODE_OPTS"
584− <> value []
585− <> Opts.help "Flags to pass to node, separated by spaces"
586− where
587− parser = words <$> str
588−
589−psciOptions :: Parser PSCiOptions
590−psciOptions = PSCiOptions <$> multiLineMode
591− <*> many inputFile
592− <*> many inputForeignFile
593− <*> nodeFlagsFlag
594−
595−runPSCi :: IO ()
596−runPSCi = execParser opts >>= loop
597− where
598− opts = info (version <*> helper <*> psciOptions) infoModList
599− infoModList = fullDesc <> headerInfo <> footerInfo
600− headerInfo = header "psci - Interactive mode for PureScript"
601− footerInfo = footer $ "psci " ++ showVersion Paths.version
602−
603− version :: Parser (a -> a)
604− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> Opts.help "Show the version number" <> hidden
psci/Parser.hsdeleted−143
@@ -1,143 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Parser
4−-- Copyright : (c) Phil Freeman 2014
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Parser for PSCI.
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE CPP #-}
17−
18−module Parser
19− ( parseCommand
20− ) where
21−
22−import Prelude hiding (lex)
23−
24−import Data.Char (isSpace)
25−import Data.List (intercalate)
26−
27−#if __GLASGOW_HASKELL__ < 710
28−import Control.Applicative hiding (many)
29−#endif
30−
31−import Text.Parsec hiding ((<|>))
32−
33−import qualified Language.PureScript as P
34−import Language.PureScript.Parser.Common (mark, same)
35−
36−import qualified Directive as D
37−import Types
38−
39−-- |
40−-- Parses PSCI metacommands or expressions input from the user.
41−--
42−parseCommand :: String -> Either String Command
43−parseCommand cmdString =
44− case cmdString of
45− (':' : cmd) -> parseDirective cmd
46− _ -> parseRest psciCommand cmdString
47−
48−parseRest :: P.TokenParser a -> String -> Either String a
49−parseRest p s = either (Left . show) Right $ do
50− ts <- P.lex "" s
51− P.runTokenParser "" (p <* eof) ts
52−
53−psciCommand :: P.TokenParser Command
54−psciCommand = choice (map try parsers)
55− where
56− parsers =
57− [ psciLet
58− , psciImport
59− , psciOtherDeclaration
60− , psciExpression
61− ]
62−
63−trim :: String -> String
64−trim = trimEnd . trimStart
65−
66−trimStart :: String -> String
67−trimStart = dropWhile isSpace
68−
69−trimEnd :: String -> String
70−trimEnd = reverse . trimStart . reverse
71−
72−parseDirective :: String -> Either String Command
73−parseDirective cmd =
74− case D.directivesFor' dstr of
75− [(d, _)] -> commandFor d
76− [] -> Left "Unrecognized directive. Type :? for help."
77− ds -> Left ("Ambiguous directive. Possible matches: " ++
78− intercalate ", " (map snd ds) ++ ". Type :? for help.")
79− where
80− (dstr, arg) = break isSpace cmd
81−
82− commandFor d = case d of
83− Help -> return ShowHelp
84− Quit -> return QuitPSCi
85− Reset -> return ResetState
86− Browse -> BrowseModule <$> parseRest P.moduleName arg
87− Load -> return $ LoadFile (trim arg)
88− Foreign -> return $ LoadForeign (trim arg)
89− Show -> ShowInfo <$> parseReplQuery' (trim arg)
90− Type -> TypeOf <$> parseRest P.parseValue arg
91− Kind -> KindOf <$> parseRest P.parseType arg
92−
93−-- |
94−-- Parses expressions entered at the PSCI repl.
95−--
96−psciExpression :: P.TokenParser Command
97−psciExpression = Expression <$> P.parseValue
98−
99−-- |
100−-- PSCI version of @let@.
101−-- This is essentially let from do-notation.
102−-- However, since we don't support the @Eff@ monad,
103−-- we actually want the normal @let@.
104−--
105−psciLet :: P.TokenParser Command
106−psciLet = Decls <$> (P.reserved "let" *> P.indented *> manyDecls)
107− where
108− manyDecls :: P.TokenParser [P.Declaration]
109− manyDecls = mark (many1 (same *> P.parseLocalDeclaration))
110−
111−-- | Imports must be handled separately from other declarations, so that
112−-- :show import works, for example.
113−psciImport :: P.TokenParser Command
114−psciImport = Import <$> P.parseImportDeclaration'
115−
116−-- | Any other declaration that we don't need a 'special case' parser for
117−-- (like let or import declarations).
118−psciOtherDeclaration :: P.TokenParser Command
119−psciOtherDeclaration = Decls . (:[]) <$> do
120− decl <- discardPositionInfo <$> P.parseDeclaration
121− if acceptable decl
122− then return decl
123− else fail "this kind of declaration is not supported in psci"
124−
125−discardPositionInfo :: P.Declaration -> P.Declaration
126−discardPositionInfo (P.PositionedDeclaration _ _ d) = d
127−discardPositionInfo d = d
128−
129−acceptable :: P.Declaration -> Bool
130−acceptable P.DataDeclaration{} = True
131−acceptable P.TypeSynonymDeclaration{} = True
132−acceptable P.ExternDeclaration{} = True
133−acceptable P.ExternDataDeclaration{} = True
134−acceptable P.TypeClassDeclaration{} = True
135−acceptable P.TypeInstanceDeclaration{} = True
136−acceptable _ = False
137−
138−parseReplQuery' :: String -> Either String ReplQuery
139−parseReplQuery' str =
140− case parseReplQuery str of
141− Nothing -> Left ("Don't know how to show " ++ str ++ ". Try one of: " ++
142− intercalate ", " replQueryStrings ++ ".")
143− Just query -> Right query
psci/Types.hsdeleted−181
@@ -1,181 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Types
4−-- Copyright : (c) Phil Freeman 2014
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Type declarations and associated basic functions for PSCI.
13−--
14−-----------------------------------------------------------------------------
15−
16−module Types where
17−
18−import qualified Data.Map as M
19−import qualified Language.PureScript as P
20−
21−data PSCiOptions = PSCiOptions
22− { psciMultiLineMode :: Bool
23− , psciInputFile :: [FilePath]
24− , psciForeignInputFiles :: [FilePath]
25− , psciInputNodeFlags :: [String]
26− }
27−
28−-- |
29−-- The PSCI state.
30−-- Holds a list of imported modules, loaded files, and partial let bindings.
31−-- The let bindings are partial,
32−-- because it makes more sense to apply the binding to the final evaluated expression.
33−--
34−data PSCiState = PSCiState
35− { psciImportedFilenames :: [FilePath]
36− , psciImportedModules :: [ImportedModule]
37− , psciLoadedModules :: [(Either P.RebuildPolicy FilePath, P.Module)]
38− , psciForeignFiles :: M.Map P.ModuleName FilePath
39− , psciLetBindings :: [P.Declaration]
40− , psciNodeFlags :: [String]
41− }
42−
43−-- | All of the data that is contained by an ImportDeclaration in the AST.
44−-- That is:
45−--
46−-- * A module name, the name of the module which is being imported
47−-- * An ImportDeclarationType which specifies whether there is an explicit
48−-- import list, a hiding list, or neither.
49−-- * If the module is imported qualified, its qualified name in the importing
50−-- module. Otherwise, Nothing.
51−--
52−type ImportedModule = (P.ModuleName, P.ImportDeclarationType, Maybe P.ModuleName)
53−
54−psciImportedModuleNames :: PSCiState -> [P.ModuleName]
55−psciImportedModuleNames (PSCiState{psciImportedModules = is}) =
56− map (\(mn, _, _) -> mn) is
57−
58−allImportsOf :: P.Module -> PSCiState -> [ImportedModule]
59−allImportsOf m (PSCiState{psciImportedModules = is}) =
60− filter isImportOfThis is
61− where
62− name = P.getModuleName m
63− isImportOfThis (name', _, _) = name == name'
64−
65−-- State helpers
66−
67−-- |
68−-- Updates the state to have more imported modules.
69−--
70−updateImportedFiles :: FilePath -> PSCiState -> PSCiState
71−updateImportedFiles filename st = st { psciImportedFilenames = filename : psciImportedFilenames st }
72−
73−-- |
74−-- Updates the state to have more imported modules.
75−--
76−updateImportedModules :: ImportedModule -> PSCiState -> PSCiState
77−updateImportedModules im st = st { psciImportedModules = im : psciImportedModules st }
78−
79−-- |
80−-- Updates the state to have more loaded files.
81−--
82−updateModules :: [(Either P.RebuildPolicy FilePath, P.Module)] -> PSCiState -> PSCiState
83−updateModules modules st = st { psciLoadedModules = psciLoadedModules st ++ modules }
84−
85−-- |
86−-- Updates the state to have more let bindings.
87−--
88−updateLets :: [P.Declaration] -> PSCiState -> PSCiState
89−updateLets ds st = st { psciLetBindings = psciLetBindings st ++ ds }
90−
91−-- |
92−-- Updates the state to have more let bindings.
93−--
94−updateForeignFiles :: M.Map P.ModuleName FilePath -> PSCiState -> PSCiState
95−updateForeignFiles fs st = st { psciForeignFiles = psciForeignFiles st `M.union` fs }
96−
97−-- |
98−-- Valid Meta-commands for PSCI
99−--
100−data Command
101− -- |
102− -- A purescript expression
103− --
104− = Expression P.Expr
105− -- |
106− -- Show the help (ie, list of directives)
107− --
108− | ShowHelp
109− -- |
110− -- Import a module from a loaded file
111− --
112− | Import ImportedModule
113− -- |
114− -- Browse a module
115− --
116− | BrowseModule P.ModuleName
117− -- |
118− -- Load a file for use with importing
119− --
120− | LoadFile FilePath
121− -- |
122− -- Load a foreign module
123− --
124− | LoadForeign FilePath
125− -- |
126− -- Exit PSCI
127− --
128− | QuitPSCi
129− -- |
130− -- Reset the state of the REPL
131− --
132− | ResetState
133− -- |
134− -- Add some declarations to the current evaluation context.
135− --
136− | Decls [P.Declaration]
137− -- |
138− -- Find the type of an expression
139− --
140− | TypeOf P.Expr
141− -- |
142− -- Find the kind of an expression
143− --
144− | KindOf P.Type
145− -- |
146− -- Shows information about the current state of the REPL
147− --
148− | ShowInfo ReplQuery
149−
150−data ReplQuery
151− = QueryLoaded
152− | QueryImport
153− deriving (Eq, Show)
154−
155−-- | A list of all ReplQuery values.
156−replQueries :: [ReplQuery]
157−replQueries = [QueryLoaded, QueryImport]
158−
159−replQueryStrings :: [String]
160−replQueryStrings = map showReplQuery replQueries
161−
162−showReplQuery :: ReplQuery -> String
163−showReplQuery QueryLoaded = "loaded"
164−showReplQuery QueryImport = "import"
165−
166−parseReplQuery :: String -> Maybe ReplQuery
167−parseReplQuery "loaded" = Just QueryLoaded
168−parseReplQuery "import" = Just QueryImport
169−parseReplQuery _ = Nothing
170−
171−data Directive
172− = Help
173− | Quit
174− | Reset
175− | Browse
176− | Load
177− | Foreign
178− | Type
179− | Kind
180− | Show
181− deriving (Eq, Show)
psci/main/Main.hsdeleted−6
@@ -1,6 +0,0 @@
1−module Main where
2−
3−import PSCi
4−
5−main :: IO ()
6−main = runPSCi
psci/tests/Main.hsdeleted−163
@@ -1,163 +0,0 @@
1−{-# LANGUAGE RecordWildCards #-}
2−{-# LANGUAGE TupleSections #-}
3−{-# LANGUAGE CPP #-}
4−
5−module Main where
6−
7−import Control.Monad.Trans.State.Strict (runStateT)
8−import Control.Monad (when, forM)
9−#if __GLASGOW_HASKELL__ < 710
10−import Control.Applicative
11−#endif
12−import Control.Monad.Writer.Strict (runWriterT)
13−import Control.Monad.Trans.Except (runExceptT)
14−
15−import Data.List (sort)
16−
17−import System.Exit (exitFailure)
18−import System.Console.Haskeline
19−import System.FilePath ((</>))
20−import System.Directory (getCurrentDirectory)
21−import qualified System.FilePath.Glob as Glob
22−
23−import Test.HUnit
24−
25−import qualified Language.PureScript as P
26−
27−import PSCi
28−import Completion
29−import Types
30−
31−import TestsSetup
32−
33−main :: IO ()
34−main = do
35− fetchSupportCode
36− Counts{..} <- runTestTT allTests
37− when (errors + failures > 0) exitFailure
38−
39−allTests :: Test
40−allTests = completionTests
41−
42−completionTests :: Test
43−completionTests =
44− TestLabel "completionTests"
45− (TestList (map (TestCase . assertCompletedOk) completionTestData))
46−
47−-- If the cursor is at the right end of the line, with the 1st element of the
48−-- pair as the text in the line, then pressing tab should offer all the
49−-- elements of the list (which is the 2nd element) as completions.
50−completionTestData :: [(String, [String])]
51−completionTestData =
52− -- basic directives
53− [ (":h", [":help"])
54− , (":re", [":reset"])
55− , (":q", [":quit"])
56− , (":mo", [":module"])
57− , (":b", [":browse"])
58−
59− -- :browse should complete module names
60− , (":b Control.Monad.E", map (":b Control.Monad.Eff" ++) ["", ".Unsafe", ".Class", ".Console"])
61− , (":b Control.Monad.Eff.", map (":b Control.Monad.Eff" ++) [".Unsafe", ".Class", ".Console"])
62−
63− -- import should complete module names
64− , ("import Control.Monad.E", map ("import Control.Monad.Eff" ++) ["", ".Unsafe", ".Class", ".Console"])
65− , ("import Control.Monad.Eff.", map ("import Control.Monad.Eff" ++) [".Unsafe", ".Class", ".Console"])
66− , ("import qualified Control.Monad.Eff.", map ("import qualified Control.Monad.Eff" ++) [".Unsafe", ".Class", ".Console"])
67−
68− -- :load, :module should complete file paths
69− , (":l psci/tests/data/", [":l psci/tests/data/Sample.purs"])
70− , (":module psci/tests/data/", [":module psci/tests/data/Sample.purs"])
71−
72− -- :quit, :help, :reset should not complete
73− , (":help ", [])
74− , (":quit ", [])
75− , (":reset ", [])
76−
77− -- :show should complete to "loaded" and "import"
78− , (":show ", [":show import", ":show loaded"])
79− , (":show a", [])
80−
81− -- :type should complete values and data constructors in scope
82− , (":type Control.Monad.Eff.Console.lo", [":type Control.Monad.Eff.Console.log"])
83− , (":type uni", [":type unit"])
84− , (":type E", [":type EQ"])
85−
86− -- :kind should complete types in scope
87− , (":kind C", [":kind Control.Monad.Eff.Pure"])
88− , (":kind O", [":kind Ordering"])
89−
90− -- Only one argument for directives should be completed
91− , (":show import ", [])
92− , (":type EQ ", [])
93− , (":kind Ordering ", [])
94−
95− -- a few other import tests
96− , ("impor", ["import"])
97− , ("import q", ["import qualified"])
98− , ("import ", map ("import " ++) supportModules ++ ["import qualified"])
99− , ("import Prelude ", [])
100−
101− -- String and number literals should not be completed
102− , ("\"hi", [])
103− , ("34", [])
104−
105− -- Identifiers and data constructors should be completed
106− , ("uni", ["unit"])
107− , ("Control.Monad.Eff.Class.", ["Control.Monad.Eff.Class.liftEff"])
108− , ("G", ["GT"])
109− , ("Prelude.L", ["Prelude.LT"])
110−
111− -- if a module is imported qualified, values should complete under the
112− -- qualified name, as well as the original name.
113− , ("ST.new", ["ST.newSTRef"])
114− , ("Control.Monad.ST.new", ["Control.Monad.ST.newSTRef"])
115− ]
116− where
117−
118−assertCompletedOk :: (String, [String]) -> Assertion
119−assertCompletedOk (line, expecteds) = do
120− (unusedR, completions) <- runCM (completion' (reverse line, ""))
121− let unused = reverse unusedR
122− let actuals = map ((unused ++) . replacement) completions
123− sort expecteds @=? sort actuals
124−
125−runCM :: CompletionM a -> IO a
126−runCM act = do
127− psciState <- getPSCiState
128− fmap fst (runStateT (liftCompletionM act) psciState)
129−
130−getPSCiState :: IO PSCiState
131−getPSCiState = do
132− cwd <- getCurrentDirectory
133− let supportDir = cwd </> "tests" </> "support" </> "flattened"
134− let supportFiles ext = Glob.globDir1 (Glob.compile ("*." ++ ext)) supportDir
135− pursFiles <- supportFiles "purs"
136− jsFiles <- supportFiles "js"
137−
138− modulesOrFirstError <- loadAllModules pursFiles
139− foreignFiles <- forM jsFiles (\f -> (f,) <$> readFile f)
140− Right (foreigns, _) <- runExceptT $ runWriterT $ P.parseForeignModulesFromFiles foreignFiles
141− case modulesOrFirstError of
142− Left err ->
143− print err >> exitFailure
144− Right modules ->
145− let imports = [controlMonadSTasST, (P.ModuleName [P.ProperName "Prelude"], P.Implicit, Nothing)]
146− in return (PSCiState [] imports modules foreigns [] [])
147−
148−controlMonadSTasST :: ImportedModule
149−controlMonadSTasST = (s "Control.Monad.ST", P.Implicit, Just (s "ST"))
150− where
151− s = P.moduleNameFromString
152−
153−supportModules :: [String]
154−supportModules =
155− [ "Control.Monad.Eff.Class"
156− , "Control.Monad.Eff.Console"
157− , "Control.Monad.Eff"
158− , "Control.Monad.Eff.Unsafe"
159− , "Control.Monad.ST"
160− , "Data.Function"
161− , "Prelude"
162− , "Test.Assert"
163− ]
psci/tests/data/Sample.pursdeleted

No changes to the content.

psgo.cabalnew file+145
@@ -0,0 +1,145 @@
1+cabal-version: 1.12
2+
3+-- This file has been generated from package.yaml by hpack version 0.35.0.
4+--
5+-- see: https://github.com/sol/hpack
6+
7+name: psgo
8+version: 0.1.0.0
9+description: Please see the README on Github at <https://github.com/andyarvanitis/purescript-native#readme>
10+homepage: https://github.com/andyarvanitis/purescript-native#readme
11+bug-reports: https://github.com/andyarvanitis/purescript-native/issues
12+author: Andy Arvanitis
13+maintainer: example@example.com
14+copyright: 2018 Andy Arvanitis
15+license: BSD3
16+license-file: LICENSE
17+build-type: Simple
18+extra-source-files:
19+ README.md
20+ ChangeLog.md
21+ stack.yaml
22+ support/ffi-loader.go
23+ support/go.mod.ffi-loader
24+ support/go.mod.output
25+ support/go.mod.working
26+
27+source-repository head
28+ type: git
29+ location: https://github.com/andyarvanitis/purescript-native
30+
31+library
32+ exposed-modules:
33+ CodeGen.IL
34+ CodeGen.IL.Common
35+ CodeGen.IL.Optimizer
36+ CodeGen.IL.Optimizer.Common
37+ CodeGen.IL.Optimizer.Inliner
38+ CodeGen.IL.Optimizer.MagicDo
39+ CodeGen.IL.Optimizer.TCO
40+ CodeGen.IL.Printer
41+ Tests
42+ other-modules:
43+ Paths_psgo
44+ hs-source-dirs:
45+ src
46+ default-extensions:
47+ ConstraintKinds
48+ DataKinds
49+ DeriveFunctor
50+ EmptyDataDecls
51+ FlexibleContexts
52+ KindSignatures
53+ LambdaCase
54+ MultiParamTypeClasses
55+ NoImplicitPrelude
56+ PatternGuards
57+ PatternSynonyms
58+ RankNTypes
59+ RecordWildCards
60+ OverloadedStrings
61+ ScopedTypeVariables
62+ TupleSections
63+ ViewPatterns
64+ build-depends:
65+ aeson >=1.0 && <1.5
66+ , base >=4.7 && <5
67+ , base-compat >=0.6.0
68+ , bytestring >=0.10.8.2 && <0.11
69+ , containers
70+ , directory
71+ , file-embed
72+ , filemanip
73+ , filepath
74+ , gitrev
75+ , monad-parallel >=0.7.2.2 && <0.8
76+ , mtl >=2.1.0 && <2.3.0
77+ , pattern-arrows >=0.0.2 && <0.1
78+ , process
79+ , protolude >=0.1.6
80+ , purescript
81+ , safe >=0.3.9 && <0.4
82+ , text
83+ , transformers >=0.3.0 && <0.6
84+ default-language: Haskell2010
85+
86+executable psgo
87+ main-is: Main.hs
88+ other-modules:
89+ Paths_psgo
90+ hs-source-dirs:
91+ app
92+ ghc-options: -threaded -rtsopts -with-rtsopts=-N
93+ build-depends:
94+ aeson >=1.0 && <1.5
95+ , base >=4.7 && <5
96+ , base-compat >=0.6.0
97+ , bytestring >=0.10.8.2 && <0.11
98+ , containers
99+ , directory
100+ , file-embed
101+ , filemanip
102+ , filepath
103+ , gitrev
104+ , monad-parallel >=0.7.2.2 && <0.8
105+ , mtl >=2.1.0 && <2.3.0
106+ , pattern-arrows >=0.0.2 && <0.1
107+ , process
108+ , protolude >=0.1.6
109+ , psgo
110+ , purescript
111+ , safe >=0.3.9 && <0.4
112+ , text
113+ , transformers >=0.3.0 && <0.6
114+ default-language: Haskell2010
115+
116+test-suite psgo-test
117+ type: exitcode-stdio-1.0
118+ main-is: Spec.hs
119+ other-modules:
120+ Paths_psgo
121+ hs-source-dirs:
122+ test
123+ ghc-options: -threaded -rtsopts -with-rtsopts=-N
124+ build-depends:
125+ aeson >=1.0 && <1.5
126+ , base >=4.7 && <5
127+ , base-compat >=0.6.0
128+ , bytestring >=0.10.8.2 && <0.11
129+ , containers
130+ , directory
131+ , file-embed
132+ , filemanip
133+ , filepath
134+ , gitrev
135+ , monad-parallel >=0.7.2.2 && <0.8
136+ , mtl >=2.1.0 && <2.3.0
137+ , pattern-arrows >=0.0.2 && <0.1
138+ , process
139+ , protolude >=0.1.6
140+ , psgo
141+ , purescript
142+ , safe >=0.3.9 && <0.4
143+ , text
144+ , transformers >=0.3.0 && <0.6
145+ default-language: Haskell2010
purescript.cabaldeleted−277
@@ -1,277 +0,0 @@
1−name: purescript
2−version: 0.7.5
3−cabal-version: >=1.8
4−build-type: Simple
5−license: MIT
6−license-file: LICENSE
7−copyright: (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
8−maintainer: Phil Freeman <paf31@cantab.net>
9−stability: experimental
10−synopsis: PureScript Programming Language Compiler
11−description: A small strongly, statically typed programming language with expressive types, inspired by Haskell and compiling to Javascript.
12−category: Language
13−Homepage: http://www.purescript.org/
14−author: Phil Freeman <paf31@cantab.net>,
15− Gary Burgess <gary.burgess@gmail.com>,
16− Hardy Jones <jones3.hardy@gmail.com>,
17− Harry Garrood <harry@garrood.me>
18−
19−tested-with: GHC==7.8
20−
21−extra-source-files: examples/passing/*.purs
22− , examples/failing/*.purs
23− , tests/support/setup.js
24− , tests/support/package.json
25− , tests/support/bower.json
26− , tests/support/setup-win.cmd
27− , psci/tests/data/Sample.purs
28− , stack.yaml
29− , stack-lts-2.yaml
30− , stack-lts-3.yaml
31− , stack-nightly.yaml
32− , README.md
33− , INSTALL.md
34− , CONTRIBUTORS.md
35− , CONTRIBUTING.md
36−
37−source-repository head
38− type: git
39− location: https://github.com/purescript/purescript.git
40−
41−library
42− build-depends: base >=4.6 && <5,
43− lifted-base >= 0.2.3 && < 0.2.4,
44− monad-control >= 1.0.0.0 && < 1.1,
45− transformers-base >= 0.4.0 && < 0.5,
46− containers -any,
47− unordered-containers -any,
48− dlist -any,
49− directory >= 1.2,
50− filepath -any,
51− mtl >= 2.1.0 && < 2.3.0,
52− parsec -any,
53− transformers >= 0.3.0 && < 0.5,
54− transformers-compat >= 0.3.0,
55− utf8-string >= 1 && < 2,
56− pattern-arrows >= 0.0.2 && < 0.1,
57− time -any,
58− boxes >= 0.1.4 && < 0.2.0,
59− aeson >= 0.8 && < 0.11,
60− vector -any,
61− bower-json >= 0.7,
62− aeson-better-errors >= 0.8,
63− bytestring -any,
64− text -any,
65− split -any,
66− language-javascript == 0.5.*,
67− syb -any,
68− Glob >= 0.7 && < 0.8,
69− process >= 1.2.0 && < 1.4,
70− safe >= 0.3.9 && < 0.4,
71− semigroups >= 0.16.2 && < 0.18
72−
73− exposed-modules: Language.PureScript
74− Language.PureScript.AST
75− Language.PureScript.AST.Binders
76− Language.PureScript.AST.Declarations
77− Language.PureScript.AST.Operators
78− Language.PureScript.AST.SourcePos
79− Language.PureScript.AST.Traversals
80− Language.PureScript.AST.Exported
81− Language.PureScript.Bundle
82− Language.PureScript.Externs
83− Language.PureScript.CodeGen
84− Language.PureScript.CodeGen.JS
85− Language.PureScript.CodeGen.JS.AST
86− Language.PureScript.CodeGen.JS.Common
87− Language.PureScript.CodeGen.JS.Optimizer
88− Language.PureScript.CodeGen.JS.Optimizer.Blocks
89− Language.PureScript.CodeGen.JS.Optimizer.Common
90− Language.PureScript.CodeGen.JS.Optimizer.Inliner
91− Language.PureScript.CodeGen.JS.Optimizer.MagicDo
92− Language.PureScript.CodeGen.JS.Optimizer.TCO
93− Language.PureScript.CodeGen.JS.Optimizer.Unused
94− Language.PureScript.Constants
95− Language.PureScript.CoreFn
96− Language.PureScript.CoreFn.Ann
97− Language.PureScript.CoreFn.Binders
98− Language.PureScript.CoreFn.Desugar
99− Language.PureScript.CoreFn.Expr
100− Language.PureScript.CoreFn.Literals
101− Language.PureScript.CoreFn.Meta
102− Language.PureScript.CoreFn.Module
103− Language.PureScript.CoreFn.Traversals
104− Language.PureScript.Comments
105− Language.PureScript.Environment
106− Language.PureScript.Errors
107− Language.PureScript.Kinds
108− Language.PureScript.Linter
109− Language.PureScript.Linter.Exhaustive
110− Language.PureScript.Make
111− Language.PureScript.ModuleDependencies
112− Language.PureScript.Names
113− Language.PureScript.Options
114− Language.PureScript.Parser
115− Language.PureScript.Parser.Lexer
116− Language.PureScript.Parser.Common
117− Language.PureScript.Parser.Declarations
118− Language.PureScript.Parser.JS
119− Language.PureScript.Parser.Kinds
120− Language.PureScript.Parser.State
121− Language.PureScript.Parser.Types
122− Language.PureScript.Pretty
123− Language.PureScript.Pretty.Common
124− Language.PureScript.Pretty.JS
125− Language.PureScript.Pretty.Kinds
126− Language.PureScript.Pretty.Types
127− Language.PureScript.Pretty.Values
128− Language.PureScript.Renamer
129− Language.PureScript.Sugar
130− Language.PureScript.Sugar.BindingGroups
131− Language.PureScript.Sugar.CaseDeclarations
132− Language.PureScript.Sugar.DoNotation
133− Language.PureScript.Sugar.Names
134− Language.PureScript.Sugar.Names.Env
135− Language.PureScript.Sugar.Names.Imports
136− Language.PureScript.Sugar.Names.Exports
137− Language.PureScript.Sugar.ObjectWildcards
138− Language.PureScript.Sugar.Operators
139− Language.PureScript.Sugar.TypeClasses
140− Language.PureScript.Sugar.TypeClasses.Deriving
141− Language.PureScript.Sugar.TypeDeclarations
142− Language.PureScript.Traversals
143− Language.PureScript.TypeChecker
144− Language.PureScript.TypeChecker.Entailment
145− Language.PureScript.TypeChecker.Kinds
146− Language.PureScript.TypeChecker.Monad
147− Language.PureScript.TypeChecker.Rows
148− Language.PureScript.TypeChecker.Skolems
149− Language.PureScript.TypeChecker.Subsumption
150− Language.PureScript.TypeChecker.Synonyms
151− Language.PureScript.TypeChecker.Types
152− Language.PureScript.TypeChecker.Unify
153− Language.PureScript.TypeClassDictionaries
154− Language.PureScript.Types
155−
156− Language.PureScript.Docs
157− Language.PureScript.Docs.Convert
158− Language.PureScript.Docs.Render
159− Language.PureScript.Docs.Types
160− Language.PureScript.Docs.RenderedCode
161− Language.PureScript.Docs.RenderedCode.Types
162− Language.PureScript.Docs.RenderedCode.Render
163− Language.PureScript.Docs.AsMarkdown
164− Language.PureScript.Docs.ParseAndDesugar
165− Language.PureScript.Docs.Utils.MonoidExtras
166−
167− Language.PureScript.Publish
168− Language.PureScript.Publish.Utils
169− Language.PureScript.Publish.ErrorsWarnings
170− Language.PureScript.Publish.BoxesHelpers
171−
172− Control.Monad.Unify
173− Control.Monad.Supply
174− Control.Monad.Supply.Class
175−
176− System.IO.UTF8
177− exposed: True
178− buildable: True
179− hs-source-dirs: src
180− other-modules: Paths_purescript
181− ghc-options: -Wall -O2
182−
183−executable psc
184− build-depends: base >=4 && <5, containers -any, directory -any, filepath -any,
185− mtl -any, optparse-applicative >= 0.10.0, parsec -any, purescript -any,
186− time -any, transformers -any, transformers-compat -any, Glob >= 0.7 && < 0.8
187− main-is: Main.hs
188− buildable: True
189− hs-source-dirs: psc
190− ghc-options: -Wall -O2 -fno-warn-unused-do-bind -threaded -rtsopts "-with-rtsopts=-N"
191−
192−executable psci
193− build-depends: base >=4 && <5, containers -any, directory -any, filepath -any,
194− mtl -any, optparse-applicative >= 0.10.0, parsec -any,
195− haskeline >= 0.7.0.0, purescript -any, transformers -any,
196− transformers-compat -any, process -any, time -any, Glob -any
197−
198− main-is: Main.hs
199− buildable: True
200− hs-source-dirs: psci psci/main
201− other-modules: Types
202− Parser
203− Directive
204− Completion
205− PSCi
206− IO
207− ghc-options: -Wall -O2
208−
209−executable psc-docs
210− build-depends: base >=4 && <5, purescript -any,
211− optparse-applicative >= 0.10.0, process -any, mtl -any,
212− split -any, ansi-wl-pprint -any, directory -any,
213− filepath -any, Glob -any
214− main-is: Main.hs
215− buildable: True
216− hs-source-dirs: psc-docs
217− other-modules: Ctags
218− Etags
219− Tags
220− ghc-options: -Wall -O2
221−
222−executable psc-publish
223− build-depends: base >=4 && <5, purescript -any, bytestring -any, aeson -any, optparse-applicative -any
224− main-is: Main.hs
225− buildable: True
226− hs-source-dirs: psc-publish
227− ghc-options: -Wall -O2
228−
229−executable psc-hierarchy
230− build-depends: base >=4 && <5, purescript -any, optparse-applicative >= 0.10.0,
231− process -any, mtl -any, parsec -any, filepath -any, directory -any,
232− Glob -any
233− main-is: Main.hs
234− buildable: True
235− hs-source-dirs: hierarchy
236− other-modules:
237− ghc-options: -Wall -O2
238−
239−executable psc-bundle
240− main-is: Main.hs
241− other-modules:
242− other-extensions:
243− build-depends: base >=4 && <5,
244− purescript -any,
245− filepath -any,
246− directory -any,
247− mtl -any,
248− transformers -any,
249− transformers-compat -any,
250− optparse-applicative >= 0.10.0,
251− Glob -any
252− ghc-options: -Wall -O2
253− hs-source-dirs: psc-bundle
254−
255−test-suite tests
256− build-depends: base >=4 && <5, containers -any, directory -any,
257− filepath -any, mtl -any, parsec -any, purescript -any,
258− transformers -any, process -any, transformers-compat -any, time -any,
259− Glob -any
260− type: exitcode-stdio-1.0
261− main-is: Main.hs
262− other-modules: TestsSetup
263− buildable: True
264− hs-source-dirs: tests tests/common
265−
266−test-suite psci-tests
267− build-depends: base >=4 && <5, containers -any, directory -any, filepath -any,
268− mtl -any, optparse-applicative >= 0.10.0, parsec -any,
269− haskeline >= 0.7.0.0, purescript -any, transformers -any,
270− transformers-compat -any, process -any, HUnit -any, time -any,
271− Glob -any
272− type: exitcode-stdio-1.0
273− main-is: Main.hs
274− other-modules: TestsSetup
275− buildable: True
276− hs-source-dirs: psci psci/tests tests/common
277− ghc-options: -Wall
src/CodeGen/IL.hsnew file+321
@@ -0,0 +1,321 @@
1+-- | This module generates code in the core imperative representation from
2+-- elaborated PureScript code.
3+module CodeGen.IL
4+ ( module AST
5+ , module Common
6+ , moduleToIL
7+ ) where
8+
9+import Prelude.Compat
10+import Protolude (ordNub)
11+
12+import Control.Arrow ((&&&))
13+import Control.Monad (forM, liftM, replicateM, void)
14+import Control.Monad.Supply.Class
15+
16+import Data.List ((\\), delete, intersect, nub)
17+import qualified Data.Foldable as F
18+import qualified Data.Map as M
19+import Data.Maybe (fromMaybe, isNothing, mapMaybe)
20+import Data.Monoid ((<>))
21+import Data.String (fromString)
22+import Data.Text (Text)
23+import qualified Data.Text as T
24+
25+import Language.PureScript.AST.SourcePos
26+import Language.PureScript.CoreImp.AST (AST)
27+import qualified Language.PureScript.CoreImp.AST as AST
28+import Language.PureScript.CoreFn
29+import Language.PureScript.Crash
30+import Language.PureScript.Names
31+import Language.PureScript.Options
32+import Language.PureScript.PSString (PSString, mkString)
33+import Language.PureScript.Traversals (sndM)
34+import qualified Language.PureScript.Constants as C
35+
36+import System.FilePath.Posix ((</>))
37+
38+import CodeGen.IL.Common as Common
39+import CodeGen.IL.Optimizer
40+import CodeGen.IL.Printer
41+
42+data DeclType = ModuleDecl | LetDecl | RecLetDecl deriving (Eq)
43+
44+-- | Generate code in the simplified intermediate representation for all declarations in a
45+-- module.
46+moduleToIL
47+ :: forall m
48+ -- . (Monad m, MonadReader Options m, MonadSupply m, MonadError MultipleErrors m)
49+ . (Monad m, MonadSupply m)
50+ => Module Ann
51+ -> Text
52+ -> m (Text, [Text], [AST], Text, Text)
53+moduleToIL (Module _ coms mn _ imps _ foreigns decls) project =
54+ do
55+ ilDecls <- mapM (bindToIL ModuleDecl) decls
56+ optimized <- traverse (traverse (optimize modName')) ilDecls
57+ let optimized' = concat optimized
58+ values = annotValue <$> optimized'
59+ foreigns' = moduleIdentToIL <$> foreigns
60+ interface = interfaceSource modName values foreigns
61+ imports = nub . concat $ importToIL <$> optimized'
62+ implHeader = implHeaderSource modName imports project
63+ implFooter = implFooterSource (runModuleName mn) foreigns
64+ return $ (interface, foreigns', optimized', implHeader, implFooter)
65+ where
66+ modName = moduleNameToIL mn
67+ modName' = AST.Var Nothing modName
68+
69+ annotValue :: AST -> (Text, Bool)
70+ annotValue (AST.Function _ (Just name) [] (AST.Block _ [AST.Return _ ret]))
71+ | isLiteral ret = (name, True)
72+ annotValue (AST.Function _ (Just name) [] _) = (name, False)
73+ annotValue _ = error "Unexpected top-level value form"
74+
75+ -- | Extracts all declaration names from a binding group.
76+ getNames :: Bind Ann -> [Ident]
77+ getNames (NonRec _ ident _) = [ident]
78+ getNames (Rec vals) = map (snd . fst) vals
79+
80+ -- | Generates IL code for a module import
81+ --
82+ importToIL :: AST -> [Text]
83+ importToIL = AST.everything (++) modRef
84+ where
85+ modRef (AST.Indexer _ (AST.Var _ _) (AST.Var _ mname))
86+ | not $ T.null mname = [extract mname]
87+ modRef _ = []
88+ extract :: Text -> Text
89+ extract = T.replace "_" "." . T.dropWhileEnd (=='_')
90+
91+ -- |
92+ -- Generate code in the simplified intermediate representation for a declaration
93+ --
94+ bindToIL :: DeclType -> Bind Ann -> m [AST]
95+ bindToIL dt (NonRec ann ident val) = return <$> nonRecToIL dt ann ident val
96+ bindToIL dt (Rec vals) = forM vals (uncurry . uncurry $ nonRecToIL dt')
97+ where
98+ dt' = if dt == LetDecl then RecLetDecl else dt
99+
100+ -- | Generate code in the simplified intermediate representation for a single non-recursive
101+ -- declaration.
102+ --
103+ -- The main purpose of this function is to handle code generation for comments.
104+ nonRecToIL :: DeclType -> Ann -> Ident -> Expr Ann -> m AST
105+ nonRecToIL dt a i e@(extractAnn -> (_, com, _, _)) | not (null com) = do
106+ -- withoutComment <- asks optionsNoComments
107+ let withoutComment = False
108+ if withoutComment
109+ then nonRecToIL dt a i (modifyAnn removeComments e)
110+ else AST.Comment Nothing com <$> nonRecToIL dt a i (modifyAnn removeComments e)
111+ nonRecToIL ModuleDecl (ss, _, _, _) ident val = do
112+ il <- valueToIL val
113+ pure $ AST.Function Nothing (Just $ moduleIdentToIL ident) [] (AST.Block Nothing [AST.Return Nothing il])
114+ nonRecToIL RecLetDecl (ss, _, _, _) ident val = do
115+ ilExpr <- valueToIL val
116+ pure $ AST.Assignment Nothing (AST.Var Nothing $ identToIL ident) ilExpr
117+ nonRecToIL _ (ss, _, _, _) ident val = do
118+ il <- valueToIL val
119+ pure $ AST.VariableIntroduction Nothing (identToIL ident) (Just il)
120+
121+ -- | Generate code in the simplified intermediate representation for a variable based on a
122+ -- PureScript identifier.
123+ var :: Ident -> AST
124+ var = AST.Var Nothing . identToIL
125+
126+ accessorString :: PSString -> AST -> AST
127+ accessorString prop = AST.Indexer Nothing (AST.StringLiteral Nothing prop)
128+
129+ -- | Generate code in the simplified intermediate representation for a value or expression.
130+
131+ valueToIL :: Expr Ann -> m AST
132+ valueToIL (Literal (pos, _, _, _) l) = literalToValueIL pos l
133+ valueToIL (Accessor _ prop val) =
134+ accessorString prop <$> valueToIL val
135+ valueToIL (ObjectUpdate _ o ps) = do
136+ obj <- valueToIL o
137+ updates <- mapM (sndM valueToIL) ps
138+ obj' <- freshName'
139+ let objVar = AST.Var Nothing obj'
140+ copy = AST.VariableIntroduction Nothing obj' (Just $ copyDict obj)
141+ assign (k, v) = AST.Assignment Nothing (accessorString k objVar) v
142+ sts = copy : (assign <$> updates) ++ [AST.Return Nothing objVar]
143+ return $ AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing sts)) []
144+ valueToIL (Abs _ arg val) = do
145+ ret <- valueToIL val
146+ let ilArg = case arg of
147+ UnusedIdent -> []
148+ _ -> [identToIL arg]
149+ return $ AST.Function Nothing Nothing ilArg (AST.Block Nothing [AST.Return Nothing ret])
150+ valueToIL e@App{} = do
151+ let (f, args) = unApp e []
152+ args' <- mapM valueToIL args
153+ fn <- valueToIL f
154+ case f of
155+ Var (_, _, _, Just IsNewtype) _ -> return (head args')
156+ _ -> flip (foldl (\fn a -> AST.App Nothing fn [a])) args' <$> valueToIL f
157+ where
158+ unApp :: Expr Ann -> [Expr Ann] -> (Expr Ann, [Expr Ann])
159+ unApp (App _ val arg) args = unApp val (arg : args)
160+ unApp other args = (other, args)
161+ valueToIL (Var _ ident) = return $ varToIL ident
162+ valueToIL (Case (ss, _, _, _) values binders) = do
163+ vals <- mapM valueToIL values
164+ bindersToIL ss binders vals
165+ valueToIL (Let _ ds val) = do
166+ let recurs = concatMap getNames $ filter isRec ds
167+ recurDs = (\v -> AST.VariableIntroduction Nothing (identToIL v) Nothing) <$> recurs
168+ ds' <- concat <$> mapM (bindToIL LetDecl) ds
169+ ret <- valueToIL val
170+ return $ AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing (recurDs ++ ds' ++ [AST.Return Nothing ret]))) []
171+ where
172+ isRec :: Bind Ann -> Bool
173+ isRec (Rec _) = True
174+ isRec _ = False
175+ valueToIL (Constructor (_, _, _, Just IsNewtype) _ (ProperName ctor) _) = error "IsNewtype"
176+ valueToIL (Constructor _ _ (ProperName ctor) fields) =
177+ let body = AST.ObjectLiteral Nothing $ (mkString ctor, AST.BooleanLiteral Nothing True) :
178+ ((\field -> (mkString (identToIL field), var field)) `map` fields)
179+ fn = foldr (\f inner -> AST.Function Nothing Nothing [identToIL f] (AST.Block Nothing [AST.Return Nothing inner])) body fields
180+ in return fn
181+
182+
183+ iife :: Text -> [AST] -> AST
184+ iife v exprs = AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing $ exprs ++ [AST.Return Nothing $ AST.Var Nothing v])) []
185+
186+ literalToValueIL :: SourceSpan -> Literal (Expr Ann) -> m AST
187+ literalToValueIL ss (NumericLiteral (Left i)) = return $ AST.NumericLiteral (Just ss) (Left i)
188+ literalToValueIL ss (NumericLiteral (Right n)) = return $ AST.NumericLiteral (Just ss) (Right n)
189+ literalToValueIL ss (StringLiteral s) = return $ AST.StringLiteral (Just ss) s
190+ literalToValueIL ss (CharLiteral c) = return $ AST.StringLiteral (Just ss) (fromString [c])
191+ literalToValueIL ss (BooleanLiteral b) = return $ AST.BooleanLiteral (Just ss) b
192+ literalToValueIL ss (ArrayLiteral xs) = AST.ArrayLiteral (Just ss) <$> mapM valueToIL xs
193+ literalToValueIL ss (ObjectLiteral ps) = AST.ObjectLiteral (Just ss) <$> mapM (sndM valueToIL) ps
194+
195+ -- | Generate code in the simplified intermediate representation for a reference to a
196+ -- variable.
197+ varToIL :: Qualified Ident -> AST
198+ varToIL (Qualified Nothing ident) = var ident
199+ varToIL qual = qualifiedToIL id qual
200+
201+ -- | Generate code in the simplified intermediate representation for a reference to a
202+ -- variable that may have a qualified name.
203+ qualifiedToIL :: (a -> Ident) -> Qualified a -> AST
204+ qualifiedToIL f (Qualified (Just (ModuleName mn')) a) | mn' == C.prim = AST.Var Nothing . moduleIdentToIL $ f a
205+ qualifiedToIL f (Qualified (Just mn') a) | mn /= mn' = AST.Indexer Nothing (AST.Var Nothing . moduleIdentToIL $ f a) (AST.Var Nothing (moduleNameToIL mn'))
206+ qualifiedToIL f (Qualified _ a) = AST.Indexer Nothing (AST.Var Nothing . moduleIdentToIL $ f a) (AST.Var Nothing "")
207+
208+ -- foreignIdent :: Ident -> AST
209+ -- foreignIdent ident = accessorString (mkString $ runIdent ident) (AST.Var Nothing "$foreign")
210+
211+ -- | Generate code in the simplified intermediate representation for pattern match binders
212+ -- and guards.
213+ bindersToIL :: SourceSpan -> [CaseAlternative Ann] -> [AST] -> m AST
214+ bindersToIL ss binders vals = do
215+ valNames <- replicateM (length vals) freshName'
216+ let assignments = zipWith (AST.VariableIntroduction Nothing) valNames (map Just vals)
217+ ils <- forM binders $ \(CaseAlternative bs result) -> do
218+ ret <- guardsToIL result
219+ go valNames ret bs
220+ return $ AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing (assignments ++ concat ils ++ [AST.Throw Nothing (AST.StringLiteral Nothing $ mkString failedPatternMessage)])))
221+ []
222+ where
223+ go :: [Text] -> [AST] -> [Binder Ann] -> m [AST]
224+ go _ done [] = return done
225+ go (v:vs) done' (b:bs) = do
226+ done'' <- go vs done' bs
227+ binderToIL v done'' b
228+ go _ _ _ = internalError "Invalid arguments to bindersToIL"
229+
230+ failedPatternMessage :: Text
231+ failedPatternMessage = "Failed pattern match at " <> runModuleName mn <> " " <> displayStartEndPos ss
232+
233+ guardsToIL :: Either [(Guard Ann, Expr Ann)] (Expr Ann) -> m [AST]
234+ guardsToIL (Left gs) = traverse genGuard gs where
235+ genGuard (cond, val) = do
236+ cond' <- valueToIL cond
237+ val' <- valueToIL val
238+ return
239+ (AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo cond' (AST.BooleanLiteral Nothing True))
240+ (AST.Block Nothing [AST.Return Nothing val']) Nothing)
241+
242+ guardsToIL (Right v) = return . AST.Return Nothing <$> valueToIL v
243+
244+ -- | Generate code in the simplified intermediate representation for a pattern match
245+ -- binder.
246+ binderToIL :: Text -> [AST] -> Binder Ann -> m [AST]
247+ binderToIL _ done NullBinder{} = return done
248+ binderToIL varName done (LiteralBinder _ l) =
249+ literalToBinderIL varName done l
250+ binderToIL varName done (VarBinder _ ident) =
251+ return (AST.VariableIntroduction Nothing (identToIL ident) (Just (AST.Var Nothing varName)) : done)
252+ binderToIL varName done (ConstructorBinder (_, _, _, Just IsNewtype) _ _ [b]) =
253+ binderToIL varName done b
254+ binderToIL varName done (ConstructorBinder (_, _, _, Just (IsConstructor ctorType fields)) _ (Qualified _ (ProperName ctor)) bs) = do
255+ il <- go (zip fields bs) done
256+ return $ case ctorType of
257+ ProductType -> il
258+ SumType ->
259+ [AST.IfElse Nothing (AST.InstanceOf Nothing (AST.Var Nothing varName) (AST.StringLiteral Nothing (mkString ctor)))
260+ (AST.Block Nothing il)
261+ Nothing]
262+ where
263+ go :: [(Ident, Binder Ann)] -> [AST] -> m [AST]
264+ go [] done' = return done'
265+ go ((field, binder) : remain) done' = do
266+ argVar <- freshName'
267+ done'' <- go remain done'
268+ il <- binderToIL argVar done'' binder
269+ return (AST.VariableIntroduction Nothing argVar (Just $ accessorString (mkString $ identToIL field) $ AST.Var Nothing varName) : il)
270+
271+ binderToIL _ _ ConstructorBinder{} =
272+ internalError "binderToIL: Invalid ConstructorBinder in binderToIL"
273+ binderToIL varName done (NamedBinder _ ident binder) = do
274+ il <- binderToIL varName done binder
275+ return (AST.VariableIntroduction Nothing (identToIL ident) (Just (AST.Var Nothing varName)) : il)
276+
277+ literalToBinderIL :: Text -> [AST] -> Literal (Binder Ann) -> m [AST]
278+ literalToBinderIL varName done (NumericLiteral num) =
279+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.NumericLiteral Nothing num)) (AST.Block Nothing done) Nothing]
280+ literalToBinderIL varName done (CharLiteral c) =
281+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.StringLiteral Nothing (fromString [c]))) (AST.Block Nothing done) Nothing]
282+ literalToBinderIL varName done (StringLiteral str) =
283+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.StringLiteral Nothing str)) (AST.Block Nothing done) Nothing]
284+ literalToBinderIL varName done (BooleanLiteral True) =
285+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.BooleanLiteral Nothing True)) (AST.Block Nothing done) Nothing]
286+ literalToBinderIL varName done (BooleanLiteral False) =
287+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.BooleanLiteral Nothing False)) (AST.Block Nothing done) Nothing]
288+ -- return [AST.IfElse Nothing (AST.Unary Nothing AST.Not (AST.Var Nothing varName)) (AST.Block Nothing done) Nothing]
289+ literalToBinderIL varName done (ObjectLiteral bs) = go done bs
290+ where
291+ go :: [AST] -> [(PSString, Binder Ann)] -> m [AST]
292+ go done' [] = return done'
293+ go done' ((prop, binder):bs') = do
294+ propVar <- freshName'
295+ done'' <- go done' bs'
296+ il <- binderToIL propVar done'' binder
297+ return (AST.VariableIntroduction Nothing propVar (Just (accessorString prop (AST.Var Nothing varName))) : il)
298+ literalToBinderIL varName done (ArrayLiteral bs) = do
299+ il <- go done 0 bs
300+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo
301+ (arrayLength $ AST.Var Nothing varName)
302+ (AST.NumericLiteral Nothing (Left (fromIntegral $ length bs))))
303+ (AST.Block Nothing il) Nothing]
304+ where
305+ go :: [AST] -> Integer -> [Binder Ann] -> m [AST]
306+ go done' _ [] = return done'
307+ go done' index (binder:bs') = do
308+ elVar <- freshName'
309+ done'' <- go done' (index + 1) bs'
310+ il <- binderToIL elVar done'' binder
311+ return (AST.VariableIntroduction Nothing elVar (Just (AST.Indexer Nothing (AST.NumericLiteral Nothing (Left index)) (AST.Var Nothing varName))) : il)
312+
313+emptyAnn :: Ann
314+emptyAnn = (SourceSpan "" (SourcePos 0 0) (SourcePos 0 0), [], Nothing, Nothing)
315+
316+arrayLength :: AST -> AST
317+arrayLength a = AST.App Nothing (AST.Var Nothing arrayLengthFn) [a]
318+-- arrayLength a = AST.Var Nothing (arrayLengthFn <> "(" <> prettyPrintIL1 a <> ")")
319+
320+copyDict :: AST -> AST
321+copyDict a = AST.App Nothing (AST.Var Nothing copyDictFn) [a]
src/CodeGen/IL/Common.hsnew file+196
@@ -0,0 +1,196 @@
1+-- | Common code generation utility functions
2+module CodeGen.IL.Common where
3+
4+import Prelude.Compat
5+
6+import Control.Monad.Supply.Class (MonadSupply, freshName)
7+import Data.Char
8+import Data.Maybe (maybe)
9+import Data.Monoid ((<>))
10+import Data.Text (Text)
11+import qualified Data.Text as T
12+
13+import Language.PureScript.Crash
14+import Language.PureScript.Names
15+
16+import qualified Language.PureScript.Constants as C
17+
18+moduleNameToIL :: ModuleName -> Text
19+moduleNameToIL (ModuleName mn) =
20+ let name = T.replace "." "_" mn
21+ in if nameIsILBuiltIn name then (name <> moduleRenamerMarker) else name
22+
23+moduleNameToIL' :: ModuleName -> Text
24+moduleNameToIL' (ModuleName mn) = T.replace "_" "." mn
25+
26+-- | Convert an 'Ident' into a valid IL identifier:
27+--
28+-- * Alphanumeric characters are kept unmodified.
29+--
30+-- * Reserved IL identifiers are wrapped with '_'.
31+--
32+identToIL :: Ident -> Text
33+identToIL UnusedIdent = unusedName
34+identToIL (Ident "$__unused") = unusedName
35+identToIL (Ident name) | name == C.undefined = undefinedName -- Note: done in Printer.hs too
36+identToIL (Ident name) = properToIL name
37+identToIL (GenIdent _ _) = internalError "GenIdent in identToIL"
38+
39+moduleIdentToIL :: Ident -> Text
40+moduleIdentToIL UnusedIdent = unusedName
41+moduleIdentToIL (Ident name) | name == C.undefined = undefinedName
42+moduleIdentToIL (Ident name) = moduleProperToIL name
43+moduleIdentToIL (GenIdent _ _) = internalError "GenIdent in identToIL"
44+
45+undefinedName :: Text
46+undefinedName = "Undefined"
47+
48+unusedName :: Text
49+unusedName = "_"
50+
51+properToIL :: Text -> Text
52+properToIL name
53+ | nameIsILReserved name = "ˉ" <> name
54+ | otherwise = T.concatMap identCharToText name
55+
56+-- | Attempts to find a human-readable name for a symbol, if none has been specified returns the
57+-- ordinal value.
58+identCharToText :: Char -> Text
59+identCharToText 'ṩ' = "_ṩ"
60+identCharToText c | isAlphaNum c = T.singleton c
61+identCharToText '_' = "_"
62+identCharToText '\'' = "ꞌ" -- lowercase saltillo
63+identCharToText c = error (show (ord c)) -- TODO: should never occur now(?)
64+
65+moduleProperToIL :: Text -> Text
66+moduleProperToIL = T.concatMap identCharToText
67+
68+-- | Checks whether an identifier name is reserved in IL.
69+nameIsILReserved :: Text -> Bool
70+nameIsILReserved name =
71+ name `elem` ilAnyReserved
72+
73+-- | Checks whether a name matches a built-in value in IL.
74+nameIsILBuiltIn :: Text -> Bool
75+nameIsILBuiltIn name =
76+ name `elem`
77+ [ "Any"
78+ , "Apply"
79+ , "Contains"
80+ , "CopyDict"
81+ , "Dict"
82+ , "EffFn"
83+ , "Fn"
84+ , "Foreign"
85+ , "Get"
86+ , "Index"
87+ , "Is"
88+ , "Length"
89+ , "Once"
90+ , "Run"
91+ , "Undefined"
92+ ]
93+
94+ilAnyReserved :: [Text]
95+ilAnyReserved =
96+ concat
97+ [ ilKeywords
98+ , ilLiterals
99+ ]
100+
101+ilKeywords :: [Text]
102+ilKeywords =
103+ [ "break"
104+ , "case"
105+ , "chan"
106+ , "const"
107+ , "continue"
108+ , "default"
109+ , "defer"
110+ , "else"
111+ , "fallthrough"
112+ , "for"
113+ , "func"
114+ , "go"
115+ , "goto"
116+ , "if"
117+ , "import"
118+ , "interface"
119+ , "map"
120+ , "package"
121+ , "range"
122+ , "return"
123+ , "select"
124+ , "struct"
125+ , "switch"
126+ , "type"
127+ , "var"
128+ ]
129+
130+ilLiterals :: [Text]
131+ilLiterals =
132+ [ "init"
133+ , "nil"
134+ , "int"
135+ , "int8"
136+ , "int16"
137+ , "int32"
138+ , "int64"
139+ , "uint"
140+ , "uint8"
141+ , "uint16"
142+ , "uint32"
143+ , "uint64"
144+ , "uintptr"
145+ , "float32"
146+ , "float64"
147+ , "complex64"
148+ , "complex128"
149+ , "byte"
150+ , "rune"
151+ , "string"
152+ ]
153+
154+withPrefix :: Text -> Text
155+withPrefix s = "Ꞌ" <> s -- uppercase saltillo
156+
157+anyType :: Text
158+anyType = "Any"
159+
160+dictType :: Text
161+dictType = "Dict"
162+
163+arrayType :: Text
164+arrayType = "[]" <> anyType
165+
166+uncurriedFnType :: Int -> Text
167+uncurriedFnType i = "Fn" <> (T.pack . show $ i)
168+
169+int :: Text
170+int = "int"
171+
172+float :: Text
173+float = "float64"
174+
175+bool :: Text
176+bool = "bool"
177+
178+string :: Text
179+string = "string"
180+
181+arrayLengthFn :: Text
182+arrayLengthFn = "Length"
183+
184+indexFn :: Text
185+indexFn = "Index"
186+
187+copyDictFn :: Text
188+copyDictFn = "CopyDict"
189+
190+freshName' :: MonadSupply m => m Text
191+freshName' = do
192+ name <- freshName
193+ return $ T.replace "$" "ṩ" name
194+
195+moduleRenamerMarker :: Text
196+moduleRenamerMarker = "__"
src/CodeGen/IL/Optimizer.hsnew file+81
@@ -0,0 +1,81 @@
1+-- | This module optimizes code in the intermediate representation.
2+module CodeGen.IL.Optimizer (optimize) where
3+
4+import Prelude.Compat
5+
6+import Control.Monad.Supply.Class (MonadSupply)
7+import Data.Text (Text)
8+import Language.PureScript.CoreImp.AST
9+import Language.PureScript.CoreImp.Optimizer.Blocks
10+import Language.PureScript.CoreImp.Optimizer.Common hiding (isDict)
11+import Language.PureScript.CoreImp.Optimizer.Inliner (etaConvert, evaluateIifes, inlineVariables, unThunk)
12+import Language.PureScript.CoreImp.Optimizer.Unused
13+
14+import CodeGen.IL.Common (unusedName)
15+import CodeGen.IL.Optimizer.Inliner
16+import CodeGen.IL.Optimizer.MagicDo
17+import CodeGen.IL.Optimizer.TCO
18+
19+import qualified Language.PureScript.Constants as C
20+
21+-- | Apply a series of optimizer passes to simplified IL code
22+optimize :: MonadSupply m => AST -> AST -> m AST
23+optimize mn il = do
24+ il' <- untilFixedPoint (inlineFnComposition . inlineUnsafeCoerce . inlineUnsafePartial . tidyUp) il
25+ il'' <- untilFixedPoint (return . ignoreUnusedResults . inlineCommonValues . inlineCommonOperators . tidyUp) . tco mn . inlineST
26+ =<< untilFixedPoint (return . magicDoST)
27+ =<< untilFixedPoint (return . magicDoEff)
28+ =<< untilFixedPoint (return . magicDoEffect) il'
29+ untilFixedPoint (return . collapseVarDeclarations) il''
30+ where
31+ tidyUp :: AST -> AST
32+ tidyUp = applyAll
33+ [ collapseNestedBlocks
34+ , collapseNestedIfs
35+ , collapseIfChecks
36+ , removeCodeAfterReturnStatements
37+ , unThunk
38+ , etaConvert
39+ , evaluateIifes
40+ , inlineVariables
41+ ]
42+
43+untilFixedPoint :: (Monad m, Eq a) => (a -> m a) -> a -> m a
44+untilFixedPoint f = go
45+ where
46+ go a = do
47+ a' <- f a
48+ if a' == a then return a' else go a'
49+
50+collapseIfChecks :: AST -> AST
51+collapseIfChecks = everywhere collapse where
52+ collapse :: AST -> AST
53+ collapse (IfElse _ (Binary _ EqualTo (BooleanLiteral _ True) (BooleanLiteral _ True)) (Block _ [exprs]) _) = exprs
54+ collapse (IfElse _ (Binary _ EqualTo (Indexer _ (Var _ prop) (Var _ val)) (BooleanLiteral _ True)) (Block _ [exprs]) _)
55+ | prop == "otherwise" && val == "Data_Boolean" = exprs
56+ collapse exprs = exprs
57+
58+collapseVarDeclarations :: AST -> AST
59+collapseVarDeclarations = everywhere collapse where
60+ collapse :: AST -> AST
61+ collapse (Block ss sts) = Block ss (go Nothing sts)
62+ collapse s = s
63+
64+ go :: Maybe Text -> [AST] -> [AST]
65+ go _ [] = []
66+ go Nothing (decl@(VariableIntroduction _ var (Just _)) : sts) = decl : go (Just var) (go Nothing sts)
67+ go (Just var') ((VariableIntroduction ss var (Just val)) : sts)
68+ | var == var' = (Assignment ss (Var Nothing var) val) : go (Just var') sts
69+ go var' (s:sts) = s : go var' sts
70+
71+ignoreUnusedResults :: AST -> AST
72+ignoreUnusedResults = everywhere $ removeFromBlock go
73+ where
74+ go :: [AST] -> [AST]
75+ go [] = []
76+ go (VariableIntroduction ss var (Just s) : sts)
77+ | not $ any (everything (||) (isUsed var)) sts = sts'
78+ where
79+ sts' | App{} <- s = s : (go sts)
80+ | otherwise = go sts
81+ go (s:sts) = s : go sts
src/CodeGen/IL/Optimizer/Common.hsnew file+18
@@ -0,0 +1,18 @@
1+-- | Common functions used by the various optimizer phases
2+module CodeGen.IL.Optimizer.Common where
3+
4+import Prelude.Compat
5+
6+import Data.Text (Text)
7+
8+import Language.PureScript.CoreImp.AST
9+import Language.PureScript.PSString (PSString, decodeString)
10+
11+isDict :: (Text, PSString) -> AST -> Bool
12+isDict (moduleName, dictName) (Indexer _ (Var _ x) (Var _ y)) =
13+ Just x == decodeString dictName && y == moduleName
14+isDict _ _ = False
15+
16+isDict' :: [(Text, PSString)] -> AST -> Bool
17+isDict' xs il = any (`isDict` il) xs
18+
src/CodeGen/IL/Optimizer/Inliner.hsnew file+435
@@ -0,0 +1,435 @@
1+-- | This module performs basic inlining of known functions
2+module CodeGen.IL.Optimizer.Inliner
3+ ( inlineCommonValues
4+ , inlineCommonOperators
5+ , inlineFnComposition
6+ , inlineUnsafeCoerce
7+ , inlineUnsafePartial
8+ ) where
9+
10+import Prelude.Compat
11+
12+import Control.Monad.Supply.Class (MonadSupply)
13+
14+import Data.Either (rights)
15+import Data.Maybe (fromMaybe)
16+import Data.String (IsString, fromString)
17+import Data.Text (Text)
18+import qualified Data.Text as T
19+
20+import Language.PureScript.PSString (PSString, decodeString, mkString)
21+import Language.PureScript.CoreImp.AST
22+import Language.PureScript.CoreImp.Optimizer.Common hiding (isDict, isDict')
23+import Language.PureScript.AST (SourceSpan(..))
24+import qualified Language.PureScript.Constants as C
25+
26+import CodeGen.IL.Common
27+import CodeGen.IL.Optimizer.Common
28+
29+-- TODO: Potential bug:
30+-- Shouldn't just inline this case: { var x = 0; x.toFixed(10); }
31+-- Needs to be: { 0..toFixed(10); }
32+-- Probably needs to be fixed in pretty-printer instead.
33+shouldInline :: AST -> Bool
34+shouldInline (Var _ _) = True
35+shouldInline (NumericLiteral _ _) = True
36+shouldInline (StringLiteral _ _) = True
37+shouldInline (BooleanLiteral _ _) = True
38+shouldInline (Indexer _ index val) = shouldInline index && shouldInline val
39+shouldInline _ = False
40+
41+inlineCommonValues :: AST -> AST
42+inlineCommonValues = everywhere convert
43+ where
44+ convert :: AST -> AST
45+ convert (App ss fn [dict])
46+ | isDict' [semiringNumber, semiringInt] dict && isDict fnZero fn = NumericLiteral ss (Left 0)
47+ | isDict' [semiringNumber, semiringInt] dict && isDict fnOne fn = NumericLiteral ss (Left 1)
48+ | isDict boundedBoolean dict && isDict fnBottom fn = BooleanLiteral ss False
49+ | isDict boundedBoolean dict && isDict fnTop fn = BooleanLiteral ss True
50+ convert (App ss (App _ fn [dict]) [x])
51+ | isDict ringInt dict && isDict fnNegate fn = Unary ss Negate (unbox x $ snd ringInt)
52+ convert (App ss (App _ (App _ fn [dict]) [x]) [y])
53+ | isDict semiringInt dict && isDict fnAdd fn = intOp ss Add semiringInt x y
54+ | isDict semiringInt dict && isDict fnMultiply fn = intOp ss Multiply semiringInt x y
55+ | isDict ringInt dict && isDict fnSubtract fn = intOp ss Subtract ringInt x y
56+ convert other = other
57+ fnZero = (C.dataSemiring, C.zero)
58+ fnOne = (C.dataSemiring, C.one)
59+ fnBottom = (C.dataBounded, C.bottom)
60+ fnTop = (C.dataBounded, C.top)
61+ fnAdd = (C.dataSemiring, C.add)
62+ fnMultiply = (C.dataSemiring, C.mul)
63+ fnSubtract = (C.dataRing, C.sub)
64+ fnNegate = (C.dataRing, C.negate)
65+ intOp ss op (_, d) x y = Binary ss op (unbox x d) (unbox y d)
66+
67+inlineCommonOperators :: AST -> AST
68+inlineCommonOperators = everywhereTopDown $ applyAll $
69+ [ binary semiringNumber opAdd Add
70+ , binary semiringNumber opMul Multiply
71+
72+ , binary ringNumber opSub Subtract
73+ , unary ringNumber opNegate Negate
74+
75+ , binary euclideanRingNumber opDiv Divide
76+
77+ -- , binary eqNumber opEq EqualTo
78+ -- , binary eqNumber opNotEq NotEqualTo
79+ , binary eqInt opEq EqualTo
80+ , binary eqInt opNotEq NotEqualTo
81+ , binary eqString opEq EqualTo
82+ , binary eqString opNotEq NotEqualTo
83+ , binary eqChar opEq EqualTo
84+ , binary eqChar opNotEq NotEqualTo
85+ , binary eqBoolean opEq EqualTo
86+ , binary eqBoolean opNotEq NotEqualTo
87+
88+ , binary ordBoolean opLessThan LessThan
89+ , binary ordBoolean opLessThanOrEq LessThanOrEqualTo
90+ , binary ordBoolean opGreaterThan GreaterThan
91+ , binary ordBoolean opGreaterThanOrEq GreaterThanOrEqualTo
92+ , binary ordChar opLessThan LessThan
93+ , binary ordChar opLessThanOrEq LessThanOrEqualTo
94+ , binary ordChar opGreaterThan GreaterThan
95+ , binary ordChar opGreaterThanOrEq GreaterThanOrEqualTo
96+ , binary ordInt opLessThan LessThan
97+ , binary ordInt opLessThanOrEq LessThanOrEqualTo
98+ , binary ordInt opGreaterThan GreaterThan
99+ , binary ordInt opGreaterThanOrEq GreaterThanOrEqualTo
100+ , binary ordNumber opLessThan LessThan
101+ , binary ordNumber opLessThanOrEq LessThanOrEqualTo
102+ , binary ordNumber opGreaterThan GreaterThan
103+ , binary ordNumber opGreaterThanOrEq GreaterThanOrEqualTo
104+ , binary ordString opLessThan LessThan
105+ , binary ordString opLessThanOrEq LessThanOrEqualTo
106+ , binary ordString opGreaterThan GreaterThan
107+ , binary ordString opGreaterThanOrEq GreaterThanOrEqualTo
108+
109+ , binary semigroupString opAppend Add
110+
111+ , binary heytingAlgebraBoolean opConj And
112+ , binary heytingAlgebraBoolean opDisj Or
113+ , unary heytingAlgebraBoolean opNot Not
114+
115+ , binary' C.dataIntBits C.or BitwiseOr
116+ , binary' C.dataIntBits C.and BitwiseAnd
117+ , binary' C.dataIntBits C.xor BitwiseXor
118+ , binary' C.dataIntBits C.shl ShiftLeft
119+ , binary' C.dataIntBits C.shr ShiftRight
120+ , unary' C.dataIntBits C.complement BitwiseNot
121+
122+ , inlineNonClassFunction (isModFn (C.dataFunction, C.apply)) $ \f x -> App Nothing f [x]
123+ , inlineNonClassFunction (isModFn (C.dataFunction, C.applyFlipped)) $ \x f -> App Nothing f [x]
124+ , inlineUnsafeIndex (isModFnWithDict (C.dataArray, C.unsafeIndex)) $ flip (Indexer Nothing)
125+ ] ++
126+ [ fn | i <- [0..10], fn <- [ mkFn i, runFn i ] ] ++
127+ [ fn | i <- [0..10], fn <- [ mkEffFn C.controlMonadEffUncurried C.mkEffFn i, runEffFn C.controlMonadEffUncurried C.runEffFn i ] ] ++
128+ [ fn | i <- [0..10], fn <- [ mkEffFn C.effectUncurried C.mkEffectFn i, runEffFn C.effectUncurried C.runEffectFn i ] ]
129+ where
130+ binary :: (Text, PSString) -> (Text, PSString) -> BinaryOperator -> AST -> AST
131+ binary dict@(_, d) fns op = convert where
132+ convert :: AST -> AST
133+ convert (App ss (App _ (App _ fn [dict']) [x]) [y])
134+ | isDict dict dict' && isDict fns fn = Binary ss op (unbox x d) (unbox y d)
135+ convert other = other
136+ binary' :: Text -> PSString -> BinaryOperator -> AST -> AST
137+ binary' moduleName opString op = convert where
138+ convert :: AST -> AST
139+ convert (App ss (App _ fn [x]) [y]) | isDict (moduleName, opString) fn = Binary ss op (unbox x mn) (unbox y mn)
140+ convert other = other
141+ mn :: PSString
142+ mn = mkString moduleName
143+ unary :: (Text, PSString) -> (Text, PSString) -> UnaryOperator -> AST -> AST
144+ unary dicts@(_, d) fns op = convert where
145+ convert :: AST -> AST
146+ convert (App ss (App _ fn [dict']) [x]) | isDict dicts dict' && isDict fns fn = Unary ss op (unbox x d)
147+ convert other = other
148+ unary' :: Text -> PSString -> UnaryOperator -> AST -> AST
149+ unary' moduleName fnName op = convert where
150+ convert :: AST -> AST
151+ convert (App ss fn [x]) | isDict (moduleName, fnName) fn = Unary ss op (unbox x fnName)
152+ convert other = other
153+
154+ mkFn :: Int -> AST -> AST
155+ mkFn = mkFn' C.dataFunctionUncurried C.mkFn $ \ss1 ss2 ss3 args il ->
156+ Function ss1 Nothing args (Block ss2 [Return ss3 il])
157+
158+ mkEffFn :: Text -> Text -> Int -> AST -> AST
159+ mkEffFn modName fnName = mkFn' modName fnName $ \ss1 ss2 ss3 args il ->
160+ Function ss1 Nothing args (Block ss2 [Return ss3 (App ss3 il [])])
161+
162+ mkFn' :: Text -> Text -> (Maybe SourceSpan -> Maybe SourceSpan -> Maybe SourceSpan -> [Text] -> AST -> AST) -> Int -> AST -> AST
163+ mkFn' modName fnName res 0 = convert where
164+ convert :: AST -> AST
165+ convert (App _ mkFnN [Function s1 Nothing [_] (Block s2 [Return s3 il])]) | isNFn modName fnName 0 mkFnN =
166+ res s1 s2 s3 [] il
167+ convert other = other
168+ mkFn' modName fnName res n = convert where
169+ convert :: AST -> AST
170+ convert orig@(App ss mkFnN [fn]) | isNFn modName fnName n mkFnN =
171+ case collectArgs n [] fn of
172+ Just (args, [Return ss' ret]) -> res ss ss ss' args ret
173+ _ -> orig
174+ convert other = other
175+ collectArgs :: Int -> [Text] -> AST -> Maybe ([Text], [AST])
176+ collectArgs 1 acc (Function _ Nothing [oneArg] (Block _ il)) | length acc == n - 1 = Just (reverse (oneArg : acc), il)
177+ collectArgs m acc (Function _ Nothing [oneArg] (Block _ [Return _ ret])) = collectArgs (m - 1) (oneArg : acc) ret
178+ collectArgs _ _ _ = Nothing
179+
180+ isNFn :: Text -> Text -> Int -> AST -> Bool
181+ isNFn expectMod prefix n (Indexer _ (Var _ name) (Var _ modName)) | modName == expectMod =
182+ name == fromString (T.unpack prefix <> show n)
183+ isNFn _ _ _ _ = False
184+
185+ runFn :: Int -> AST -> AST
186+ runFn = runFn' C.dataFunctionUncurried C.runFn (\ss f args ->
187+ let len = length args
188+ typ = mkString $ uncurriedFnType len in
189+ if len > 0
190+ then App ss (App Nothing (StringLiteral Nothing typ) [f]) args
191+ else App ss f args)
192+ runEffFn :: Text -> Text -> Int -> AST -> AST
193+ runEffFn modName fnName = runFn' modName fnName $ \ss fn acc ->
194+ let typ = mkString . uncurriedFnType $ length acc in
195+ Function ss Nothing [] (Block ss [Return ss (App ss (App Nothing (StringLiteral Nothing typ) [fn]) acc)])
196+
197+ runFn' :: Text -> Text -> (Maybe SourceSpan -> AST -> [AST] -> AST) -> Int -> AST -> AST
198+ runFn' modName runFnName res n = convert where
199+ convert :: AST -> AST
200+ convert il = fromMaybe il $ go n [] il
201+
202+ go :: Int -> [AST] -> AST -> Maybe AST
203+ go 0 acc (App ss runFnN [fn]) | isNFn modName runFnName n runFnN && length acc == n =
204+ Just $ res ss fn acc
205+ go m acc (App _ lhs [arg]) = go (m - 1) (arg : acc) lhs
206+ go _ _ _ = Nothing
207+
208+ inlineNonClassFunction :: (AST -> Bool) -> (AST -> AST -> AST) -> AST -> AST
209+ inlineNonClassFunction p f = convert where
210+ convert :: AST -> AST
211+ convert (App _ (App _ op' [x]) [y]) | p op' = f x y
212+ convert other = other
213+
214+ inlineUnsafeIndex :: (AST -> Bool) -> (AST -> AST -> AST) -> AST -> AST
215+ inlineUnsafeIndex p _ = convert where
216+ convert :: AST -> AST
217+ convert (App _ (App ss op' [x]) [y@NumericLiteral{}])
218+ | p op' = Indexer ss y x
219+ convert (App _ (App ss op' [x]) [y])
220+ | p op' = App ss (Var Nothing indexFn) [x, y]
221+ convert other = other
222+
223+ isModFn :: (Text, PSString) -> AST -> Bool
224+ isModFn (m, op) (Indexer _ (Var _ op') (Var _ m')) =
225+ m == m' && decodeString op == Just op'
226+ isModFn _ _ = False
227+
228+ isModFnWithDict :: (Text, PSString) -> AST -> Bool
229+ isModFnWithDict (m, op) (App _ (Indexer _ (Var _ op') (Var _ m')) [Var _ _]) =
230+ m == m' && decodeString op == Just op'
231+ isModFnWithDict _ _ = False
232+
233+-- (f <<< g $ x) = f (g x)
234+-- (f <<< g) = \x -> f (g x)
235+inlineFnComposition :: forall m. MonadSupply m => AST -> m AST
236+inlineFnComposition = everywhereTopDownM convert where
237+ convert :: AST -> m AST
238+ convert (App s1 (App s2 (App _ (App _ fn [dict']) [x]) [y]) [z])
239+ | isFnCompose dict' fn = return $ App s1 x [App s2 y [z]]
240+ | isFnComposeFlipped dict' fn = return $ App s2 y [App s1 x [z]]
241+ convert app@(App ss (App _ (App _ fn [dict']) _) _)
242+ | isFnCompose dict' fn || isFnComposeFlipped dict' fn = mkApps ss <$> goApps app <*> freshName'
243+ convert other = return other
244+
245+ mkApps :: Maybe SourceSpan -> [Either AST (Text, AST)] -> Text -> AST
246+ mkApps ss fns a = App ss (Function ss Nothing [] (Block ss $ vars <> [Return Nothing comp])) []
247+ where
248+ vars = uncurry (VariableIntroduction ss) . fmap Just <$> rights fns
249+ comp = Function ss Nothing [a] (Block ss [Return Nothing apps])
250+ apps = foldr (\fn acc -> App ss (mkApp fn) [acc]) (Var ss a) fns
251+
252+ mkApp :: Either AST (Text, AST) -> AST
253+ mkApp = either id $ \(name, arg) -> Var (getSourceSpan arg) name
254+
255+ goApps :: AST -> m [Either AST (Text, AST)]
256+ goApps (App _ (App _ (App _ fn [dict']) [x]) [y])
257+ | isFnCompose dict' fn = mappend <$> goApps x <*> goApps y
258+ | isFnComposeFlipped dict' fn = mappend <$> goApps y <*> goApps x
259+ goApps app@(App {}) = pure . Right . (,app) <$> freshName'
260+ goApps other = pure [Left other]
261+
262+ isFnCompose :: AST -> AST -> Bool
263+ isFnCompose dict' fn = isDict semigroupoidFn dict' && isDict fnCompose fn
264+
265+ isFnComposeFlipped :: AST -> AST -> Bool
266+ isFnComposeFlipped dict' fn = isDict semigroupoidFn dict' && isDict fnComposeFlipped fn
267+
268+ fnCompose :: forall a b. (IsString a, IsString b) => (a, b)
269+ fnCompose = (C.controlSemigroupoid, C.compose)
270+
271+ fnComposeFlipped :: forall a b. (IsString a, IsString b) => (a, b)
272+ fnComposeFlipped = (C.controlSemigroupoid, C.composeFlipped)
273+
274+inlineUnsafeCoerce :: AST -> AST
275+inlineUnsafeCoerce = everywhereTopDown convert where
276+ convert (App _ (Indexer _ (Var _ unsafeCoerceFn) (Var _ unsafeCoerce)) [ comp ])
277+ | unsafeCoerceFn == C.unsafeCoerceFn && unsafeCoerce == C.unsafeCoerce
278+ = comp
279+ convert other = other
280+
281+inlineUnsafePartial :: AST -> AST
282+inlineUnsafePartial = everywhereTopDown convert where
283+ convert (App ss fn [ comp ])
284+ | isDict fnUnsafePartial fn
285+ = App ss comp []
286+ where
287+ fnUnsafePartial :: forall a b. (IsString a, IsString b) => (a, b)
288+ fnUnsafePartial = (C.partialUnsafe, C.unsafePartial)
289+ convert other = other
290+
291+semiringNumber :: forall a b. (IsString a, IsString b) => (a, b)
292+semiringNumber = (C.dataSemiring, C.semiringNumber)
293+
294+semiringInt :: forall a b. (IsString a, IsString b) => (a, b)
295+semiringInt = (C.dataSemiring, C.semiringInt)
296+
297+ringNumber :: forall a b. (IsString a, IsString b) => (a, b)
298+ringNumber = (C.dataRing, C.ringNumber)
299+
300+ringInt :: forall a b. (IsString a, IsString b) => (a, b)
301+ringInt = (C.dataRing, C.ringInt)
302+
303+euclideanRingNumber :: forall a b. (IsString a, IsString b) => (a, b)
304+euclideanRingNumber = (C.dataEuclideanRing, C.euclideanRingNumber)
305+
306+-- eqNumber :: forall a b. (IsString a, IsString b) => (a, b)
307+-- eqNumber = (C.dataEq, C.eqNumber)
308+
309+eqInt :: forall a b. (IsString a, IsString b) => (a, b)
310+eqInt = (C.dataEq, C.eqInt)
311+
312+eqString :: forall a b. (IsString a, IsString b) => (a, b)
313+eqString = (C.dataEq, C.eqString)
314+
315+eqChar :: forall a b. (IsString a, IsString b) => (a, b)
316+eqChar = (C.dataEq, C.eqChar)
317+
318+eqBoolean :: forall a b. (IsString a, IsString b) => (a, b)
319+eqBoolean = (C.dataEq, C.eqBoolean)
320+
321+ordBoolean :: forall a b. (IsString a, IsString b) => (a, b)
322+ordBoolean = (C.dataOrd, C.ordBoolean)
323+
324+ordNumber :: forall a b. (IsString a, IsString b) => (a, b)
325+ordNumber = (C.dataOrd, C.ordNumber)
326+
327+ordInt :: forall a b. (IsString a, IsString b) => (a, b)
328+ordInt = (C.dataOrd, C.ordInt)
329+
330+ordString :: forall a b. (IsString a, IsString b) => (a, b)
331+ordString = (C.dataOrd, C.ordString)
332+
333+ordChar :: forall a b. (IsString a, IsString b) => (a, b)
334+ordChar = (C.dataOrd, C.ordChar)
335+
336+semigroupString :: forall a b. (IsString a, IsString b) => (a, b)
337+semigroupString = (C.dataSemigroup, C.semigroupString)
338+
339+boundedBoolean :: forall a b. (IsString a, IsString b) => (a, b)
340+boundedBoolean = (C.dataBounded, C.boundedBoolean)
341+
342+heytingAlgebraBoolean :: forall a b. (IsString a, IsString b) => (a, b)
343+heytingAlgebraBoolean = (C.dataHeytingAlgebra, C.heytingAlgebraBoolean)
344+
345+semigroupoidFn :: forall a b. (IsString a, IsString b) => (a, b)
346+semigroupoidFn = (C.controlSemigroupoid, C.semigroupoidFn)
347+
348+opAdd :: forall a b. (IsString a, IsString b) => (a, b)
349+opAdd = (C.dataSemiring, C.add)
350+
351+opMul :: forall a b. (IsString a, IsString b) => (a, b)
352+opMul = (C.dataSemiring, C.mul)
353+
354+opEq :: forall a b. (IsString a, IsString b) => (a, b)
355+opEq = (C.dataEq, C.eq)
356+
357+opNotEq :: forall a b. (IsString a, IsString b) => (a, b)
358+opNotEq = (C.dataEq, C.notEq)
359+
360+opLessThan :: forall a b. (IsString a, IsString b) => (a, b)
361+opLessThan = (C.dataOrd, C.lessThan)
362+
363+opLessThanOrEq :: forall a b. (IsString a, IsString b) => (a, b)
364+opLessThanOrEq = (C.dataOrd, C.lessThanOrEq)
365+
366+opGreaterThan :: forall a b. (IsString a, IsString b) => (a, b)
367+opGreaterThan = (C.dataOrd, C.greaterThan)
368+
369+opGreaterThanOrEq :: forall a b. (IsString a, IsString b) => (a, b)
370+opGreaterThanOrEq = (C.dataOrd, C.greaterThanOrEq)
371+
372+opAppend :: forall a b. (IsString a, IsString b) => (a, b)
373+opAppend = (C.dataSemigroup, C.append)
374+
375+opSub :: forall a b. (IsString a, IsString b) => (a, b)
376+opSub = (C.dataRing, C.sub)
377+
378+opNegate :: forall a b. (IsString a, IsString b) => (a, b)
379+opNegate = (C.dataRing, C.negate)
380+
381+opDiv :: forall a b. (IsString a, IsString b) => (a, b)
382+opDiv = (C.dataEuclideanRing, C.div)
383+
384+opConj :: forall a b. (IsString a, IsString b) => (a, b)
385+opConj = (C.dataHeytingAlgebra, C.conj)
386+
387+opDisj :: forall a b. (IsString a, IsString b) => (a, b)
388+opDisj = (C.dataHeytingAlgebra, C.disj)
389+
390+opNot :: forall a b. (IsString a, IsString b) => (a, b)
391+opNot = (C.dataHeytingAlgebra, C.not)
392+
393+unbox :: AST -> PSString -> AST
394+unbox e d = select . inlineCommonValues $ inlineCommonOperators e
395+ where
396+ select :: AST -> AST
397+ select e' =
398+ case e' of
399+ Var{} -> unbox' e'
400+ App{} -> unbox' e'
401+ Indexer{} -> unbox' e'
402+ _ -> e'
403+ unbox' :: AST -> AST
404+ unbox' e' = maybe e' (\t -> App Nothing (StringLiteral Nothing t) [e']) $ unboxType d
405+
406+unboxType :: PSString -> Maybe PSString
407+unboxType s = do
408+ t <- decodeString s
409+ t' <- unboxType' t
410+ return $ mkString t'
411+ where
412+ unboxType' :: Text -> Maybe Text
413+ unboxType' t
414+ | t == C.eqInt ||
415+ t == C.semiringInt ||
416+ t == C.ringInt ||
417+ t == C.ordInt ||
418+ t == C.dataIntBits
419+ = Just int
420+ | t == C.semiringNumber ||
421+ t == C.ringNumber ||
422+ t == C.ordNumber ||
423+ t == C.euclideanRingNumber
424+ = Just float
425+ | t == C.eqBoolean ||
426+ t == C.ordBoolean ||
427+ t == C.heytingAlgebraBoolean
428+ = Just bool
429+ | t == C.eqChar ||
430+ t == C.eqString ||
431+ t == C.ordChar ||
432+ t == C.ordString ||
433+ t == C.semigroupString
434+ = Just string
435+ | otherwise = Nothing
src/CodeGen/IL/Optimizer/MagicDo.hsnew file+146
@@ -0,0 +1,146 @@
1+-- | This module implements the "Magic Do" optimization, which inlines calls to return
2+-- and bind for the Eff monad, as well as some of its actions.
3+module CodeGen.IL.Optimizer.MagicDo (magicDoEffect, magicDoEff, magicDoST, inlineST) where
4+
5+import Prelude.Compat
6+import Protolude (ordNub)
7+
8+import Data.Maybe (fromJust, isJust)
9+import Data.Text (Text)
10+
11+import Language.PureScript.CoreImp.AST
12+import Language.PureScript.CoreImp.Optimizer.Common hiding (isDict)
13+import Language.PureScript.PSString (PSString, decodeString, mkString)
14+import qualified Language.PureScript.Constants as C
15+
16+import CodeGen.IL.Common (undefinedName, unusedName)
17+import CodeGen.IL.Optimizer.Common
18+
19+-- | Inline type class dictionaries for >>= and return for the Eff monad
20+--
21+-- E.g.
22+--
23+-- Prelude[">>="](dict)(m1)(function(x) {
24+-- return ...;
25+-- })
26+--
27+-- becomes
28+--
29+-- function __do {
30+-- var x = m1();
31+-- ...
32+-- }
33+magicDoEff :: AST -> AST
34+magicDoEff = magicDo C.eff C.effDictionaries
35+
36+magicDoEffect :: AST -> AST
37+magicDoEffect = magicDo C.effect C.effectDictionaries
38+
39+magicDoST :: AST -> AST
40+magicDoST = magicDo C.st C.stDictionaries
41+
42+magicDo :: Text -> C.EffectDictionaries -> AST -> AST
43+magicDo effectModule C.EffectDictionaries{..} = everywhereTopDown convert
44+ where
45+ -- Desugar monomorphic calls to >>= and return for the Eff monad
46+ convert :: AST -> AST
47+ -- Desugar pure
48+ convert (App _ (App _ pure' [val]) []) | isPure pure' = val
49+ -- Desugar discard
50+ convert (App _ (App _ bind [m]) [Function s1 Nothing [unused] (Block s2 il)]) | isDiscard bind && unused == unusedName =
51+ Function s1 Nothing [] $ Block s2 (App s2 m [] : map applyReturns il )
52+ -- Desugar bind
53+ convert (App _ (App _ bind [m]) [Function s1 Nothing [arg] (Block s2 il)]) | isBind bind =
54+ Function s1 Nothing [] $ Block s2 (VariableIntroduction s2 arg (Just (App s2 m [])) : map applyReturns il)
55+ -- Desugar untilE
56+ convert (App s1 (App _ f [arg]) []) | isEffFunc edUntil f =
57+ App s1 (Function s1 Nothing [] (Block s1 [ While s1 (Unary s1 Not (App s1 arg [])) (Block s1 []), Return s1 $ ObjectLiteral s1 []])) []
58+ -- Desugar whileE
59+ convert (App _ (App _ (App s1 f [arg1]) [arg2]) []) | isEffFunc edWhile f =
60+ App s1 (Function s1 Nothing [] (Block s1 [ While s1 (App s1 arg1 []) (Block s1 [ App s1 arg2 [] ]), Return s1 $ ObjectLiteral s1 []])) []
61+ -- -- Inline __do returns
62+ -- convert (Return _ (App _ (Function _ (Just ident) [] body) [])) | ident == fnName = body
63+ -- Inline double applications
64+ convert (App _ (App s1 (Function s2 Nothing [] (Block ss body)) []) []) =
65+ App s1 (Function s2 Nothing [] (Block ss (applyReturns `fmap` body))) []
66+ convert other = other
67+ -- Check if an expression represents a monomorphic call to >>= for the Eff monad
68+ isBind (App _ fn [dict]) | isDict (effectModule, edBindDict) dict && isBindPoly fn = True
69+ isBind _ = False
70+ -- Check if an expression represents a call to @discard@
71+ isDiscard (App _ (App _ fn [dict1]) [dict2])
72+ | isDict (C.controlBind, C.discardUnitDictionary) dict1 &&
73+ isDict (effectModule, edBindDict) dict2 &&
74+ isDiscardPoly fn = True
75+ isDiscard _ = False
76+
77+ -- Check if an expression represents a monomorphic call to pure or return for the Eff applicative
78+ isPure (App _ fn [dict]) | isDict (effectModule, edApplicativeDict) dict && isPurePoly fn = True
79+ isPure _ = False
80+ -- Check if an expression represents the polymorphic >>= function
81+ isBindPoly = isDict (C.controlBind, C.bind)
82+ -- Check if an expression represents the polymorphic pure function
83+ isPurePoly = isDict (C.controlApplicative, C.pure')
84+ -- Check if an expression represents the polymorphic discard function
85+ isDiscardPoly = isDict (C.controlBind, C.discard)
86+ -- Check if an expression represents a function in the Effect module
87+ isEffFunc name (Indexer _ (StringLiteral _ name') (Var _ eff)) = eff == effectModule && name == name'
88+ isEffFunc _ _ = False
89+
90+ applyReturns :: AST -> AST
91+ applyReturns (Return ss ret) = Return ss (App ss ret [])
92+ applyReturns (Block ss ils) = Block ss (map applyReturns ils)
93+ applyReturns (While ss cond il) = While ss cond (applyReturns il)
94+ applyReturns (For ss v lo hi il) = For ss v lo hi (applyReturns il)
95+ applyReturns (ForIn ss v xs il) = ForIn ss v xs (applyReturns il)
96+ applyReturns (IfElse ss cond t f) = IfElse ss cond (applyReturns t) (applyReturns `fmap` f)
97+ applyReturns other = other
98+
99+-- | Inline functions in the ST module
100+inlineST :: AST -> AST
101+inlineST = everywhere convertBlock
102+ where
103+ -- Look for runST blocks and inline the STRefs there.
104+ -- If all STRefs are used in the scope of the same runST, only using { read, write, modify }STRef then
105+ -- we can be more aggressive about inlining, and actually turn STRefs into local variables.
106+ convertBlock (App s1 f [arg]) | isSTFunc C.runST f =
107+ let refs = ordNub . findSTRefsIn $ arg
108+ usages = findAllSTUsagesIn arg
109+ allUsagesAreLocalVars = all (\u -> let v = toVar u in isJust v && fromJust v `elem` refs) usages
110+ localVarsDoNotEscape = all (\r -> length (r `appearingIn` arg) == length (filter (\u -> let v = toVar u in v == Just r) usages)) refs
111+ in App s1 (everywhere (convert (allUsagesAreLocalVars && localVarsDoNotEscape)) arg) []
112+ convertBlock other = other
113+ -- Convert a block in a safe way, preserving object wrappers of references,
114+ -- or in a more aggressive way, turning wrappers into local variables depending on the
115+ -- agg(ressive) parameter.
116+ convert agg (App s1 f [arg]) | isSTFunc C.newSTRef f =
117+ Function s1 Nothing [] (Block s1 [Return s1 $ if agg then arg else ObjectLiteral s1 [(mkString C.stRefValue, arg)]])
118+ convert agg (App _ (App s1 f [ref]) []) | isSTFunc C.readSTRef f =
119+ if agg then ref else Indexer s1 (StringLiteral s1 C.stRefValue) ref
120+ convert agg (App _ (App _ (App s1 f [arg]) [ref]) []) | isSTFunc C.writeSTRef f =
121+ if agg then Assignment s1 ref arg else Assignment s1 (Indexer s1 (StringLiteral s1 C.stRefValue) ref) arg
122+ convert agg (App _ (App _ (App s1 f [func]) [ref]) []) | isSTFunc C.modifySTRef f =
123+ if agg then Assignment s1 ref (App s1 func [ref]) else Assignment s1 (Indexer s1 (StringLiteral s1 C.stRefValue) ref) (App s1 func [Indexer s1 (StringLiteral s1 C.stRefValue) ref])
124+ convert _ other = other
125+ -- Check if an expression represents a function in the ST module
126+ isSTFunc name (Indexer _ (StringLiteral _ name') (Var _ st)) = st == C.st && name == name'
127+ isSTFunc _ _ = False
128+ -- Find all ST Refs initialized in this block
129+ findSTRefsIn = everything (++) isSTRef
130+ where
131+ isSTRef (VariableIntroduction _ ident (Just (App _ (App _ f [_]) []))) | isSTFunc C.newSTRef f = [ident]
132+ isSTRef _ = []
133+ -- Find all STRefs used as arguments to readSTRef, writeSTRef, modifySTRef
134+ findAllSTUsagesIn = everything (++) isSTUsage
135+ where
136+ isSTUsage (App _ (App _ f [ref]) []) | isSTFunc C.readSTRef f = [ref]
137+ isSTUsage (App _ (App _ (App _ f [_]) [ref]) []) | isSTFunc C.writeSTRef f || isSTFunc C.modifySTRef f = [ref]
138+ isSTUsage _ = []
139+ -- Find all uses of a variable
140+ appearingIn ref = everything (++) isVar
141+ where
142+ isVar e@(Var _ v) | v == ref = [e]
143+ isVar _ = []
144+ -- Convert a AST value to a String if it is a Var
145+ toVar (Var _ v) = Just v
146+ toVar _ = Nothing
src/CodeGen/IL/Optimizer/TCO.hsnew file+141
@@ -0,0 +1,141 @@
1+module CodeGen.IL.Optimizer.TCO (tco, tcoLoop) where
2+
3+import Prelude.Compat
4+
5+import Data.Text (Text)
6+import Data.Monoid ((<>))
7+import Language.PureScript.CoreImp.AST
8+import Language.PureScript.AST.SourcePos (SourceSpan)
9+import Safe (headDef, tailSafe)
10+import CodeGen.IL.Common
11+
12+import qualified Language.PureScript.Constants as C
13+
14+tcoLoop :: Text
15+tcoLoop = "ṩtco_loop"
16+
17+tco :: AST -> AST -> AST
18+tco mn = everywhere convert where
19+ tcoVar :: Text -> Text
20+ tcoVar arg = "ṩtco_var_" <> arg
21+
22+ copyVar :: Text -> Text
23+ copyVar arg = "ṩcopy_" <> arg
24+
25+ tcoDone :: Text
26+ tcoDone = "ṩtco_done"
27+
28+ tcoResult :: Text
29+ tcoResult = "ṩtco_result"
30+
31+ convert :: AST -> AST
32+ convert fn@(Function ss (Just name) args _)
33+ | isTailRecursive name body'
34+ = replace (toLoop name outerArgs innerArgs body')
35+ where
36+ innerArgs = headDef [] argss
37+ outerArgs = concat . reverse $ tailSafe argss
38+ (argss, body', replace) = collectAllFunctionArgs [] id fn
39+ convert (Assignment ss (Var _ name) fn@(Function _ Nothing _ _))
40+ | isTailRecursive name body'
41+ = Assignment ss (Var ss name) (replace (toLoop name outerArgs innerArgs body'))
42+ where
43+ innerArgs = headDef [] argss
44+ outerArgs = concat . reverse $ tailSafe argss
45+ (argss, body', replace) = collectAllFunctionArgs [] id fn
46+ convert js = js
47+
48+ collectAllFunctionArgs :: [[Text]] -> (AST -> AST) -> AST -> ([[Text]], AST, AST -> AST)
49+ collectAllFunctionArgs allArgs f (Function s1 ident args (Block s2 (body@(Return _ _):_))) =
50+ collectAllFunctionArgs (args : allArgs) (\b -> f (Function s1 ident (map copyVar args) (Block s2 [b]))) body
51+ collectAllFunctionArgs allArgs f (Function ss ident args body@(Block _ _)) =
52+ (args : allArgs, body, f . Function ss ident (map copyVar args))
53+ collectAllFunctionArgs allArgs f (Return s1 (Function s2 ident args (Block s3 [body]))) =
54+ collectAllFunctionArgs (args : allArgs) (\b -> f (Return s1 (Function s2 ident (map copyVar args) (Block s3 [b])))) body
55+ collectAllFunctionArgs allArgs f (Return s1 (Function s2 ident args body@(Block _ _))) =
56+ (args : allArgs, body, f . Return s1 . Function s2 ident (map copyVar args))
57+ collectAllFunctionArgs allArgs f body = (allArgs, body, f)
58+
59+ isTailRecursive :: Text -> AST -> Bool
60+ isTailRecursive ident js = countSelfReferences js > 0 && allInTailPosition js where
61+ countSelfReferences = everything (+) match where
62+ match :: AST -> Int
63+ match (Var _ ident') | ident == ident' = 1
64+ match _ = 0
65+
66+ allInTailPosition (Return _ expr)
67+ | isSelfCall ident expr = countSelfReferences expr == 1
68+ | otherwise = countSelfReferences expr == 0
69+ allInTailPosition (While _ js1 body)
70+ = countSelfReferences js1 == 0 && allInTailPosition body
71+ allInTailPosition (For _ _ js1 js2 body)
72+ = countSelfReferences js1 == 0 && countSelfReferences js2 == 0 && allInTailPosition body
73+ allInTailPosition (ForIn _ _ js1 body)
74+ = countSelfReferences js1 == 0 && allInTailPosition body
75+ allInTailPosition (IfElse _ js1 body el)
76+ = countSelfReferences js1 == 0 && allInTailPosition body && all allInTailPosition el
77+ allInTailPosition (Block _ body)
78+ = all allInTailPosition body
79+ allInTailPosition (Throw _ js1)
80+ = countSelfReferences js1 == 0
81+ allInTailPosition (ReturnNoResult _)
82+ = True
83+ allInTailPosition (VariableIntroduction _ _ js1)
84+ = all ((== 0) . countSelfReferences) js1
85+ allInTailPosition (Assignment _ _ js1)
86+ = countSelfReferences js1 == 0
87+ allInTailPosition (Comment _ _ js1)
88+ = allInTailPosition js1
89+ allInTailPosition _
90+ = False
91+
92+ toLoop :: Text -> [Text] -> [Text] -> AST -> AST
93+ toLoop ident outerArgs innerArgs js =
94+ Block rootSS $
95+ concatMap (\arg -> [ VariableIntroduction rootSS (tcoVar arg) . Just $
96+ Var rootSS (copyVar arg) ]) (outerArgs ++ innerArgs) ++
97+ [ Assignment rootSS (Var rootSS $ "var " <> tcoDone) $ BooleanLiteral Nothing False
98+ , VariableIntroduction rootSS tcoResult Nothing
99+ , Assignment rootSS (Var rootSS $ "var " <> tcoLoop) (Function rootSS (Just tcoLoop) (outerArgs ++ innerArgs) (Block rootSS [loopify js]))
100+ , While rootSS (Unary Nothing Not (Var rootSS tcoDone))
101+ (Block rootSS
102+ [(Assignment rootSS (Var rootSS tcoResult) (App rootSS (Var rootSS tcoLoop) ((map (Var rootSS . tcoVar) outerArgs) ++ (map (Var rootSS . copyVar) innerArgs))))])
103+ , Return rootSS (Var rootSS tcoResult)
104+ ]
105+ where
106+ rootSS = Nothing
107+
108+ loopify :: AST -> AST
109+ loopify (Return ss ret)
110+ | isSelfCall ident ret =
111+ let
112+ allArgumentValues = concat $ collectArgs [] ret
113+ in
114+ Block ss $
115+ zipWith (\val arg ->
116+ Assignment ss (Var ss (tcoVar arg)) val) allArgumentValues outerArgs
117+ ++ zipWith (\val arg ->
118+ Assignment ss (Var ss (copyVar arg)) val) (drop (length outerArgs) allArgumentValues) innerArgs
119+ ++ [ ReturnNoResult ss ]
120+ | otherwise = Block ss [ markDone ss, Return ss ret ]
121+ loopify (ReturnNoResult ss) = Block ss [ markDone ss, ReturnNoResult ss ]
122+ loopify (While ss cond body) = While ss cond (loopify body)
123+ loopify (For ss i js1 js2 body) = For ss i js1 js2 (loopify body)
124+ loopify (ForIn ss i js1 body) = ForIn ss i js1 (loopify body)
125+ loopify (IfElse ss cond body el) = IfElse ss cond (loopify body) (fmap loopify el)
126+ loopify (Block ss body) = Block ss (map loopify body)
127+ loopify other = other
128+
129+ markDone :: Maybe SourceSpan -> AST
130+ markDone ss = Assignment ss (Var ss tcoDone) (BooleanLiteral ss True)
131+
132+ collectArgs :: [[AST]] -> AST -> [[AST]]
133+ collectArgs acc (App _ fn args') = collectArgs (args' : acc) fn
134+ collectArgs acc _ = acc
135+
136+ isSelfCall :: Text -> AST -> Bool
137+ isSelfCall ident (App _ (Var _ ident') _) = ident == ident'
138+ isSelfCall ident (App _ (Indexer _ (Var _ ident') (Var _ mn')) _) = mn' == "" && ident == ident'
139+ isSelfCall ident (App _ (Indexer _ (Var _ ident') mn') _) = mn' == mn && ident == ident'
140+ isSelfCall ident (App _ fn _) = isSelfCall ident fn
141+ isSelfCall _ _ = False
src/CodeGen/IL/Printer.hsnew file+527
@@ -0,0 +1,527 @@
1+-- | Pretty printer for the AST
2+module CodeGen.IL.Printer
3+ ( prettyPrintIL
4+ , prettyPrintIL1
5+ , prettyPrintILWithSourceMaps
6+ , interfaceSource
7+ , implHeaderSource
8+ , implFooterSource
9+ , isLiteral
10+ , modLabel
11+ , modPrefix
12+ , ffiLoader
13+ ) where
14+
15+import Prelude.Compat
16+
17+import Control.Arrow ((<+>))
18+import Control.Monad (forM, mzero)
19+import Control.Monad.State (StateT, evalStateT)
20+import Control.PatternArrows
21+import Data.List (filter, (\\))
22+import qualified Control.Arrow as A
23+
24+import Data.Maybe (fromMaybe)
25+import Data.Monoid ((<>))
26+import Data.Text (Text)
27+import qualified Data.Text as T
28+
29+import Language.PureScript.AST (SourceSpan(..))
30+import Language.PureScript.CoreImp.AST
31+import Language.PureScript.Comments
32+import Language.PureScript.Crash
33+import Language.PureScript.Names (Ident, runIdent)
34+import Language.PureScript.Pretty.Common
35+import Language.PureScript.PSString (PSString, decodeString, mkString)
36+
37+import CodeGen.IL.Common
38+import CodeGen.IL.Optimizer.TCO (tcoLoop)
39+
40+import qualified Language.PureScript.Constants as C
41+
42+-- TODO (Christoph): Get rid of T.unpack / pack
43+
44+literals :: (Emit gen) => Pattern PrinterState AST gen
45+literals = mkPattern' match'
46+ where
47+ match' :: (Emit gen) => AST -> StateT PrinterState Maybe gen
48+ match' il = (addMapping' (getSourceSpan il) <>) <$> match il
49+
50+ match :: (Emit gen) => AST -> StateT PrinterState Maybe gen
51+ match (NumericLiteral _ n) = return $ emit $ T.pack $ either show show n
52+ match (StringLiteral _ s) = return $ emit $ stringLiteral s
53+ match (BooleanLiteral _ True) = return $ emit "true"
54+ match (BooleanLiteral _ False) = return $ emit "false"
55+ match (ArrayLiteral _ xs) = mconcat <$> sequence
56+ [ return . emit $ arrayType <> "{"
57+ , intercalate (emit ", ") <$> forM xs prettyPrintIL'
58+ , return $ emit "}"
59+ ]
60+ -- match (ObjectLiteral _ []) = return $ emit "std::initializer_list<std::pair<const string, boxed>>{}"
61+ match (ObjectLiteral _ ps) = mconcat <$> sequence
62+ [ return . emit $ dictType <> "{"
63+ , withIndent $ do
64+ ils <- forM ps $ \(key, value) -> do
65+ value' <- prettyPrintIL' value
66+ return $ objectPropertyToString key <> value'
67+ return $ intercalate (emit " ") $ map (<> emit ",") ils
68+ , return $ emit "}"
69+ ]
70+ where
71+ objectPropertyToString :: (Emit gen) => PSString -> gen
72+ objectPropertyToString s = emit $ stringLiteral s <> ": "
73+ match (Block _ sts) = mconcat <$> sequence
74+ [ return $ emit "{\n"
75+ , withIndent $ prettyStatements sts
76+ , return $ emit "\n"
77+ , currentIndent
78+ , return $ emit "}"
79+ ]
80+ match (Var _ ident) | ident == C.undefined = return $ emit undefinedName
81+ match (Var _ ident) = return $ emit ident
82+ match (VariableIntroduction _ ident value) = mconcat <$> sequence
83+ [ return . emit $ varDecl <> " " <> ident <> " " <> anyType
84+ , maybe (return mempty) (fmap (emit " = " <>) . prettyPrintIL') value
85+ ]
86+ match (Assignment _ target value) = mconcat <$> sequence
87+ [ prettyPrintIL' target
88+ , return $ emit " = "
89+ , prettyPrintIL' value
90+ ]
91+ match (App _ val []) = mconcat <$> sequence
92+ [ return $ emit "Run("
93+ , prettyPrintIL' val
94+ , return $ emit ")"
95+ ]
96+ match (App _ (StringLiteral _ u) [arg])
97+ | Just ty <- decodeString u = mconcat <$> sequence
98+ [ prettyPrintIL' arg
99+ , return $ emit ".("
100+ , return $ emit ty
101+ , return $ emit ")"
102+ ]
103+ match (App _ (Var _ fn) [arg]) | fn == arrayLengthFn = mconcat <$> sequence
104+ [ return $ emit fn
105+ , return $ emit "("
106+ , prettyPrintIL' arg
107+ , return $ emit ")"
108+ ]
109+ match (App _ (Var _ fn) args) | fn == indexFn = mconcat <$> sequence
110+ [ return $ emit fn
111+ , return $ emit "("
112+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
113+ , return $ emit ")"
114+ ]
115+ match (App _ (Var _ fn) args) | fn == tcoLoop = mconcat <$> sequence
116+ [ return $ emit fn
117+ , return $ emit "("
118+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
119+ , return $ emit ")"
120+ ]
121+ match (App _ (App Nothing (StringLiteral Nothing fnx) [fn@Function{}]) args)
122+ | Just ftype <- decodeString fnx
123+ , "Fn" `T.isPrefixOf` ftype = mconcat <$> sequence
124+ [ prettyPrintIL' fn
125+ , return $ emit "("
126+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
127+ , return $ emit ")"
128+ ]
129+ match (App _ (App Nothing (StringLiteral Nothing fnx) [fn]) args)
130+ | Just ftype <- decodeString fnx
131+ , "Fn" `T.isPrefixOf` ftype = mconcat <$> sequence
132+ [ prettyPrintIL' fn
133+ , return $ emit ".("
134+ , return $ emit ftype
135+ , return $ emit ")("
136+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
137+ , return $ emit ")"
138+ ]
139+ match app@(App{})
140+ | (val, args) <- unApp app []
141+ , length args > 1
142+ = mconcat <$> sequence
143+ [ return $ emit "Apply("
144+ , prettyPrintIL' val
145+ , return $ emit ", "
146+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
147+ , return $ emit ")"
148+ ]
149+ match (App _ val args) = mconcat <$> sequence
150+ [ return $ emit "Apply("
151+ , prettyPrintIL' val
152+ , return $ emit ", "
153+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
154+ , return $ emit ")"
155+ ]
156+ match (Function _ (Just name) [] (Block _ [Return _ ret]))
157+ | isComplexLiteral ret = mconcat <$> sequence
158+ [ return $ emit "\n"
159+ , return . emit $ varDecl <> " " <> initName name <> " Once\n"
160+ , prettyPrintIL' $ VariableIntroduction Nothing (valueName name) Nothing
161+ , return $ emit "\n\n"
162+ , return $ emit "func "
163+ , return . emit $ withPrefix name
164+ , return . emit $ "() " <> anyType <> " "
165+ , return $ emit "{\n"
166+ , withIndent $ do
167+ indentString <- currentIndent
168+ return $ indentString <> (emit $ initName name <> ".Do(func() {\n") <>
169+ indentString <> indentString <> (emit $ valueName name <> " = ")
170+ , withIndent $ do
171+ case ret of
172+ Function _ Nothing args body -> mconcat <$> sequence
173+ [ return $ emit "func("
174+ , return . emit $ intercalate ", " (renderArg anyType <$> args)
175+ , return . emit $ ") " <> anyType <> " "
176+ , prettyPrintIL' body
177+ ]
178+ _ -> do
179+ prettyPrintIL' ret
180+ , return $ emit "\n"
181+ , withIndent $ do
182+ indentString <- currentIndent
183+ return $ indentString <> (emit $ "})\n" <> "return " <> valueName name <>"\n")
184+ , return $ emit "}\n\n"
185+ ]
186+ match (Function _ (Just name) [] ret) = mconcat <$> sequence
187+ [ return $ emit "func "
188+ , return . emit $ withPrefix name
189+ , return . emit $ "() " <> anyType <> " "
190+ , prettyPrintIL' ret
191+ ]
192+ match (Function _ _ args ret) = mconcat <$> sequence
193+ [ return $ emit "func("
194+ , return . emit $ intercalate ", " (renderArg anyType <$> args)
195+ , return . emit $ ") " <> anyType <> " "
196+ , prettyPrintIL' ret
197+ ]
198+ match (Indexer _ (Var _ name) (Var _ "")) = mconcat <$> sequence
199+ [ prettyPrintIL' (Var Nothing $ withPrefix name)
200+ , return $ emit "()"
201+ ]
202+ match (Indexer _ (Var _ name) val) = mconcat <$> sequence
203+ [ prettyPrintIL' val
204+ , return $ emit "."
205+ , prettyPrintIL' (Var Nothing $ withPrefix name)
206+ , return $ emit "()"
207+ ]
208+ match (Indexer _ prop@StringLiteral{} val@ObjectLiteral{}) = mconcat <$> sequence
209+ [ prettyPrintIL' val
210+ , return $ emit "["
211+ , prettyPrintIL' prop
212+ , return $ emit "]"
213+ ]
214+ match (Indexer _ prop@StringLiteral{} val) = mconcat <$> sequence
215+ [ prettyPrintIL' val
216+ , return $ emit ".("
217+ , return $ emit dictType
218+ , return $ emit ")["
219+ , prettyPrintIL' prop
220+ , return $ emit "]"
221+ ]
222+ match (Indexer _ index val@ArrayLiteral{}) = mconcat <$> sequence
223+ [ prettyPrintIL' val
224+ , return $ emit "["
225+ , prettyPrintIL' index
226+ , return $ emit "]"
227+ ]
228+ match (Indexer _ index val) = mconcat <$> sequence
229+ [ prettyPrintIL' val
230+ , return $ emit ".("
231+ , return $ emit arrayType
232+ , return $ emit ")["
233+ , prettyPrintIL' index
234+ , return $ emit "]"
235+ ]
236+ match (InstanceOf _ val ty) = mconcat <$> sequence
237+ [ return $ emit "Is("
238+ , prettyPrintIL' val
239+ , return $ emit ", "
240+ , prettyPrintIL' ty
241+ , return $ emit ")"
242+ ]
243+ match (While _ cond sts) = mconcat <$> sequence
244+ [ return $ emit "for "
245+ , prettyPrintIL' cond
246+ , return $ emit " "
247+ , prettyPrintIL' sts
248+ ]
249+ match (For _ ident start end sts) = mconcat <$> sequence
250+ [ return $ emit $ "for var " <> ident <> " = "
251+ , prettyPrintIL' start
252+ , return $ emit $ "; " <> ident <> " < "
253+ , prettyPrintIL' end
254+ , return $ emit $ "; " <> ident <> "++ "
255+ , prettyPrintIL' sts
256+ ]
257+ match (ForIn _ ident obj sts) = mconcat <$> sequence
258+ [ return $ emit $ "for var " <> ident <> " in "
259+ , prettyPrintIL' obj
260+ , return $ emit " "
261+ , prettyPrintIL' sts
262+ ]
263+ match (IfElse _ (Binary _ EqualTo cond@Binary{} (BooleanLiteral Nothing True)) thens elses) = mconcat <$> sequence
264+ [ return $ emit "if "
265+ , prettyPrintIL' cond
266+ , return $ emit " "
267+ , prettyPrintIL' thens
268+ , maybe (return mempty) (fmap (emit " else " <>) . prettyPrintIL') elses
269+ ]
270+ match (IfElse _ (Binary _ EqualTo cond@Binary{} (BooleanLiteral Nothing False)) thens elses) = mconcat <$> sequence
271+ [ return $ emit "if !("
272+ , prettyPrintIL' cond
273+ , return $ emit ") "
274+ , prettyPrintIL' thens
275+ , maybe (return mempty) (fmap (emit " else " <>) . prettyPrintIL') elses
276+ ]
277+ match (IfElse _ cond thens elses) = mconcat <$> sequence
278+ [ return $ emit "if "
279+ , prettyPrintIL' cond
280+ , return $ emit " "
281+ , prettyPrintIL' thens
282+ , maybe (return mempty) (fmap (emit " else " <>) . prettyPrintIL') elses
283+ ]
284+ match (Return _ value) = mconcat <$> sequence
285+ [ return $ emit "return "
286+ , prettyPrintIL' value
287+ ]
288+ match (ReturnNoResult _) = return . emit $ "return " <> undefinedName
289+ -- match (Throw _ _) = return mempty
290+ match (Throw _ value) = mconcat <$> sequence
291+ [ return $ emit "panic("
292+ , prettyPrintIL' value
293+ , return $ emit ")"
294+ ]
295+ match (Comment _ com il) = mconcat <$> sequence
296+ [ return $ emit "\n"
297+ , mconcat <$> forM com comment
298+ , prettyPrintIL' il
299+ ]
300+ match _ = mzero
301+
302+ comment :: (Emit gen) => Comment -> StateT PrinterState Maybe gen
303+ comment (LineComment com) = fmap mconcat $ sequence $
304+ [ currentIndent
305+ , return $ emit "//" <> emit com <> emit "\n"
306+ ]
307+ comment (BlockComment com) = fmap mconcat $ sequence $
308+ [ currentIndent
309+ , return $ emit "/**\n"
310+ ] ++
311+ map asLine (T.lines com) ++
312+ [ currentIndent
313+ , return $ emit " */\n"
314+ , currentIndent
315+ ]
316+ where
317+ asLine :: (Emit gen) => Text -> StateT PrinterState Maybe gen
318+ asLine s = do
319+ i <- currentIndent
320+ return $ i <> emit " * " <> (emit . removeComments) s <> emit "\n"
321+
322+ removeComments :: Text -> Text
323+ removeComments t =
324+ case T.stripPrefix "*/" t of
325+ Just rest -> removeComments rest
326+ Nothing -> case T.uncons t of
327+ Just (x, xs) -> x `T.cons` removeComments xs
328+ Nothing -> ""
329+
330+unary' :: (Emit gen) => UnaryOperator -> (AST -> Text) -> Operator PrinterState AST gen
331+unary' op mkStr = Wrap match (<>)
332+ where
333+ match :: (Emit gen) => Pattern PrinterState AST (gen, AST)
334+ match = mkPattern match'
335+ where
336+ match' (Unary _ op' val) | op' == op = Just (emit $ mkStr val, val)
337+ match' _ = Nothing
338+
339+unary :: (Emit gen) => UnaryOperator -> Text -> Operator PrinterState AST gen
340+unary op str = unary' op (const str)
341+
342+negateOperator :: (Emit gen) => Operator PrinterState AST gen
343+negateOperator = unary' Negate (\v -> if isNegate v then "- " else "-")
344+ where
345+ isNegate (Unary _ Negate _) = True
346+ isNegate _ = False
347+
348+binary :: (Emit gen) => BinaryOperator -> Text -> Operator PrinterState AST gen
349+binary op str = AssocL match (\v1 v2 -> v1 <> emit (" " <> str <> " ") <> v2)
350+ where
351+ match :: Pattern PrinterState AST (AST, AST)
352+ match = mkPattern match'
353+ where
354+ match' (Binary _ op' v1 v2) | op' == op = Just (v1, v2)
355+ match' _ = Nothing
356+
357+isLiteral :: AST -> Bool
358+isLiteral Function{} = True
359+isLiteral NumericLiteral{} = True
360+isLiteral StringLiteral{} = True
361+isLiteral BooleanLiteral{} = True
362+isLiteral ObjectLiteral{} = True
363+isLiteral ArrayLiteral{} = True
364+isLiteral _ = False
365+
366+isComplexLiteral :: AST -> Bool
367+-- isComplexLiteral Function{} = True
368+isComplexLiteral ObjectLiteral{} = True
369+isComplexLiteral ArrayLiteral{} = True
370+isComplexLiteral _ = False
371+
372+unApp :: AST -> [AST] -> (AST, [AST])
373+unApp (App _ val [arg]) args = unApp val (arg : args)
374+unApp other args = (other, args)
375+
376+prettyStatements :: (Emit gen) => [AST] -> StateT PrinterState Maybe gen
377+prettyStatements sts = do
378+ ils <- forM sts prettyPrintIL'
379+ indentString <- currentIndent
380+ return $ intercalate (emit "\n") $ map (indentString <>) ils
381+
382+-- | Generate a pretty-printed string representing a collection of C++ expressions at the same indentation level
383+prettyPrintILWithSourceMaps :: [AST] -> (Text, [SMap])
384+prettyPrintILWithSourceMaps il =
385+ let StrPos (_, s, mp) = (fromMaybe (internalError "Incomplete pattern") . flip evalStateT (PrinterState 0) . prettyStatements) il
386+ in (s, mp)
387+
388+prettyPrintIL :: [AST] -> Text
389+prettyPrintIL = maybe (internalError "Incomplete pattern") runPlainString . flip evalStateT (PrinterState 0) . prettyStatements
390+
391+-- | Generate an indented, pretty-printed string representing a C++ expression
392+prettyPrintIL' :: (Emit gen) => AST -> StateT PrinterState Maybe gen
393+prettyPrintIL' = A.runKleisli $ runPattern matchValue
394+ where
395+ matchValue :: (Emit gen) => Pattern PrinterState AST gen
396+ matchValue = buildPrettyPrinter operators (literals <+> fmap parensPos matchValue)
397+ operators :: (Emit gen) => OperatorTable PrinterState AST gen
398+ operators =
399+ OperatorTable [ [ unary New "?" ]
400+ , [ unary Not "!"
401+ , unary BitwiseNot "~"
402+ , unary Positive "+"
403+ , negateOperator ]
404+ , [ binary Multiply "*"
405+ , binary Divide "/"
406+ , binary Modulus "%" ]
407+ , [ binary Add "+"
408+ , binary Subtract "-" ]
409+ , [ binary ShiftLeft "<<"
410+ , binary ShiftRight ">>" ]
411+ , [ binary LessThan "<"
412+ , binary LessThanOrEqualTo "<="
413+ , binary GreaterThan ">"
414+ , binary GreaterThanOrEqualTo ">=" ]
415+ , [ binary EqualTo "=="
416+ , binary NotEqualTo "!=" ]
417+ , [ binary BitwiseAnd "&" ]
418+ , [ binary BitwiseXor "^" ]
419+ , [ binary BitwiseOr "|" ]
420+ , [ binary And "&&" ]
421+ , [ binary Or "||" ]
422+ ]
423+
424+prettyPrintIL1 :: AST -> Text
425+prettyPrintIL1 = maybe (internalError "Incomplete pattern") runPlainString . flip evalStateT (PrinterState 0) . prettyPrintIL'
426+
427+stringLiteral :: PSString -> Text
428+stringLiteral pss | Just s <- decodeString pss = stringLiteral' s
429+ where
430+ stringLiteral' :: Text -> Text
431+ stringLiteral' s = "\"" <> T.concatMap encodeChar s <> "\""
432+ encodeChar :: Char -> Text
433+ encodeChar '\0' = "\\x00"
434+ encodeChar '\b' = "\\b"
435+ encodeChar '\t' = "\\t"
436+ encodeChar '\n' = "\\n"
437+ encodeChar '\v' = "\\v"
438+ encodeChar '\f' = "\\f"
439+ encodeChar '\r' = "\\r"
440+ encodeChar '"' = "\\\""
441+ encodeChar '\\' = "\\\\"
442+ encodeChar c = T.singleton $ c
443+stringLiteral _ = "\"\\uFFFD\""
444+
445+interfaceSource :: Text -> [(Text,Bool)] -> [Ident] -> Text
446+interfaceSource _ _ _ = ""
447+
448+implHeaderSource :: Text -> [Text] -> Text -> Text
449+implHeaderSource mn imports otherPrefix =
450+ "// Code generated by psgo. DO NOT EDIT.\n\n" <>
451+ "package " <> (if mn == "Main" || mn == "Test_Main" then "main" else mn) <> "\n\n" <>
452+ "import . \"" <> runtime <> "\"\n" <>
453+ (if mn == "Main" || mn == "Test_Main"
454+ then "import _ \"" <> otherPrefix <> "/" <> ffiLoader <> "\"\n"
455+ else "\n") <>
456+ "import (\n" <>
457+ (T.concat $ formatImport <$> imports) <> ")\n\n" <>
458+ "type _ = Any\n\n"
459+ where
460+ formatImport :: Text -> Text
461+ formatImport s =
462+ "\t\"" <> otherPrefix <> "/" <> modPrefix <> "/" <> moduleRenamer s <> "\"\n"
463+ moduleRenamer :: Text -> Text
464+ moduleRenamer s
465+ | (s', sfx) <- T.breakOn moduleRenamerMarker s,
466+ not $ T.null sfx = s'
467+ moduleRenamer s = s
468+
469+implFooterSource :: Text -> [Ident] -> Text
470+implFooterSource mn foreigns =
471+ "\n\n\n" <>
472+ (if null foreigns
473+ then ""
474+ else ("// Foreign values\n\n" <>
475+ "var " <> foreignDict <> " = "<> foreignMod <> "(\"" <> mn <> "\")\n\n" <>
476+ (T.concat $ (\foreign' ->
477+ let name = moduleIdentToIL foreign' in
478+ varDecl <> " " <> initName name <> " Once\n" <>
479+ varDecl <> " " <> valueName name <> " " <> anyType <> "\n\n" <>
480+ "func " <>
481+ withPrefix name <>
482+ "() Any { \n" <>
483+ " " <> initName name <> ".Do(func() {\n" <>
484+ " " <> valueName name <> " = " <>
485+ "Get(" <> foreignDict <> ", " <>
486+ (stringLiteral . mkString $ runIdent foreign') <> ")\n" <>
487+ " })\n" <>
488+ " return " <> valueName name <> "\n" <>
489+ "}\n\n") <$> foreigns))) <>
490+ if mn == "Main" || mn == "Test.Main" then mainSource else "\n"
491+ where
492+ mainSource :: Text
493+ mainSource = "\
494+ \func main() {\n\
495+ \ Run(Ꞌmain())\n\
496+ \}\n\n\
497+ \"
498+
499+varDecl :: Text
500+varDecl = "var"
501+
502+renderArg :: Text -> Text -> Text
503+renderArg decl arg = arg <> " " <> decl
504+
505+foreignMod :: Text
506+foreignMod = "Foreign"
507+
508+foreignDict :: Text
509+foreignDict = "foreign"
510+
511+modLabel :: Text
512+modLabel = "purescript-native"
513+
514+modPrefix :: Text
515+modPrefix = modLabel <> "/output"
516+
517+runtime :: Text
518+runtime = "github.com/" <> modLabel <> "/go-runtime"
519+
520+ffiLoader :: Text
521+ffiLoader = modLabel <> "/ffi-loader"
522+
523+initName :: Text -> Text
524+initName s = "ᛌ" <> s <> "_once"
525+
526+valueName :: Text -> Text
527+valueName s = "ᛧ" <> s
src/Control/Monad/Supply.hsdeleted−46
@@ -1,46 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Control.Monad.Supply
4−-- Copyright : (c) Phil Freeman 2014
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Fresh variable supply
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
17−{-# LANGUAGE CPP #-}
18−
19−module Control.Monad.Supply where
20−
21−import Data.Functor.Identity
22−
23−#if __GLASGOW_HASKELL__ < 710
24−import Control.Applicative
25−#endif
26−import Control.Monad.State
27−import Control.Monad.Error.Class (MonadError(..))
28−import Control.Monad.Reader
29−import Control.Monad.Writer
30−
31−newtype SupplyT m a = SupplyT { unSupplyT :: StateT Integer m a }
32− deriving (Functor, Applicative, Monad, MonadTrans, MonadError e, MonadWriter w, MonadReader r)
33−
34−runSupplyT :: Integer -> SupplyT m a -> m (a, Integer)
35−runSupplyT n = flip runStateT n . unSupplyT
36−
37−evalSupplyT :: (Functor m) => Integer -> SupplyT m a -> m a
38−evalSupplyT n = fmap fst . runSupplyT n
39−
40−type Supply = SupplyT Identity
41−
42−runSupply :: Integer -> Supply a -> (a, Integer)
43−runSupply n = runIdentity . runSupplyT n
44−
45−evalSupply :: Integer -> Supply a -> a
46−evalSupply n = runIdentity . evalSupplyT n
src/Control/Monad/Supply/Class.hsdeleted−36
@@ -1,36 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Control.Monad.Supply.Class
4−-- Copyright : (c) PureScript 2015
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- A class for monads supporting a supply of fresh names
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE MultiParamTypeClasses #-}
17−
18−module Control.Monad.Supply.Class where
19−
20−import Control.Monad.Supply
21−import Control.Monad.State
22−
23−class (Monad m) => MonadSupply m where
24− fresh :: m Integer
25−
26−instance (Monad m) => MonadSupply (SupplyT m) where
27− fresh = SupplyT $ do
28− n <- get
29− put (n + 1)
30− return n
31−
32−instance (MonadSupply m) => MonadSupply (StateT s m) where
33− fresh = lift fresh
34−
35−freshName :: (MonadSupply m) => m String
36−freshName = liftM (('_' :) . show) fresh
src/Control/Monad/Unify.hsdeleted−160
@@ -1,160 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Control.Monad.Unify
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
17−{-# LANGUAGE FlexibleInstances #-}
18−{-# LANGUAGE FlexibleContexts #-}
19−{-# LANGUAGE DeriveDataTypeable #-}
20−{-# LANGUAGE MultiParamTypeClasses #-}
21−{-# LANGUAGE FunctionalDependencies #-}
22−{-# LANGUAGE UndecidableInstances #-}
23−
24−module Control.Monad.Unify where
25−
26−import Data.Monoid
27−
28−import Control.Applicative
29−import Control.Monad.State
30−import Control.Monad.Error.Class (MonadError(..))
31−import Control.Monad.Writer.Class (MonadWriter(..))
32−
33−import Data.HashMap.Strict as M
34−
35−-- |
36−-- Untyped unification variables
37−--
38−type Unknown = Int
39−
40−-- |
41−-- A type which can contain unification variables
42−--
43−class Partial t where
44− unknown :: Unknown -> t
45− isUnknown :: t -> Maybe Unknown
46− unknowns :: t -> [Unknown]
47− ($?) :: Substitution t -> t -> t
48−
49−-- |
50−-- Identifies types which support unification
51−--
52−class (Partial t) => Unifiable m t | t -> m where
53− (=?=) :: t -> t -> UnifyT t m ()
54−
55−-- |
56−-- A substitution maintains a mapping from unification variables to their values
57−--
58−data Substitution t = Substitution { runSubstitution :: M.HashMap Int t }
59−
60−instance (Partial t) => Monoid (Substitution t) where
61− mempty = Substitution M.empty
62− s1 `mappend` s2 = Substitution $
63− M.map (s2 $?) (runSubstitution s1) `M.union`
64− M.map (s1 $?) (runSubstitution s2)
65−
66−-- |
67−-- State required for type checking
68−--
69−data UnifyState t = UnifyState {
70− -- |
71− -- The next fresh unification variable
72− --
73− unifyNextVar :: Int
74− -- |
75− -- The current substitution
76− --
77− , unifyCurrentSubstitution :: Substitution t
78− }
79−
80−-- |
81−-- An empty @UnifyState@
82−--
83−defaultUnifyState :: (Partial t) => UnifyState t
84−defaultUnifyState = UnifyState 0 mempty
85−
86−-- |
87−-- A class for errors which support unification errors
88−--
89−class UnificationError t e where
90− occursCheckFailed :: t -> e
91−
92−-- |
93−-- The type checking monad, which provides the state of the type checker, and error reporting capabilities
94−--
95−newtype UnifyT t m a = UnifyT { unUnify :: StateT (UnifyState t) m a }
96− deriving (Functor, Monad, Applicative, Alternative, MonadPlus, MonadWriter w)
97−
98−instance (MonadState s m) => MonadState s (UnifyT t m) where
99− get = UnifyT . lift $ get
100− put = UnifyT . lift . put
101−
102−instance (MonadError e m) => MonadError e (UnifyT t m) where
103− throwError = UnifyT . throwError
104− catchError e f = UnifyT $ catchError (unUnify e) (unUnify . f)
105−
106−-- |
107−-- Run a computation in the Unify monad, failing with an error, or succeeding with a return value and the new next unification variable
108−--
109−runUnify :: UnifyState t -> UnifyT t m a -> m (a, UnifyState t)
110−runUnify s = flip runStateT s . unUnify
111−
112−-- |
113−-- Substitute a single unification variable
114−--
115−substituteOne :: (Partial t) => Unknown -> t -> Substitution t
116−substituteOne u t = Substitution $ M.singleton u t
117−
118−-- |
119−-- Replace a unification variable with the specified value in the current substitution
120−--
121−(=:=) :: (UnificationError t e, Monad m, MonadError e m, Unifiable m t) => Unknown -> t -> UnifyT t m ()
122−(=:=) u t' = do
123− st <- UnifyT get
124− let sub = unifyCurrentSubstitution st
125− let t = sub $? t'
126− occursCheck u t
127− let current = sub $? unknown u
128− case isUnknown current of
129− Just u1 | u1 == u -> return ()
130− _ -> current =?= t
131− UnifyT $ modify $ \s -> s { unifyCurrentSubstitution = substituteOne u t <> unifyCurrentSubstitution s }
132−
133−-- |
134−-- Perform the occurs check, to make sure a unification variable does not occur inside a value
135−--
136−occursCheck :: (UnificationError t e, Monad m, MonadError e m, Partial t) => Unknown -> t -> UnifyT t m ()
137−occursCheck u t =
138− case isUnknown t of
139− Nothing -> when (u `elem` unknowns t) $ UnifyT . lift . throwError $ occursCheckFailed t
140− _ -> return ()
141−
142−-- |
143−-- Generate a fresh untyped unification variable
144−--
145−fresh' :: (Monad m) => UnifyT t m Unknown
146−fresh' = do
147− st <- UnifyT get
148− UnifyT $ modify $ \s -> s { unifyNextVar = succ (unifyNextVar s) }
149− return $ unifyNextVar st
150−
151−-- |
152−-- Generate a fresh unification variable at a specific type
153−--
154−fresh :: (Monad m, Partial t) => UnifyT t m t
155−fresh = do
156− u <- fresh'
157− return $ unknown u
158−
159−
160−
src/Language/PureScript.hsdeleted−49
@@ -1,49 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- The main compiler module
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE DataKinds #-}
17−{-# LANGUAGE FlexibleContexts #-}
18−{-# LANGUAGE RecordWildCards #-}
19−{-# LANGUAGE ScopedTypeVariables #-}
20−
21−module Language.PureScript
22− ( module P
23− , version
24− ) where
25−
26−import Data.Version (Version)
27−
28−import Language.PureScript.AST as P
29−import Language.PureScript.Comments as P
30−import Language.PureScript.Environment as P
31−import Language.PureScript.Errors as P hiding (indent)
32−import Language.PureScript.Kinds as P
33−import Language.PureScript.Linter as P
34−import Language.PureScript.Make as P
35−import Language.PureScript.ModuleDependencies as P
36−import Language.PureScript.Names as P
37−import Language.PureScript.Options as P
38−import Language.PureScript.Parser as P
39−import Language.PureScript.Pretty as P
40−import Language.PureScript.Renamer as P
41−import Language.PureScript.Sugar as P
42−import Control.Monad.Supply as P
43−import Language.PureScript.TypeChecker as P
44−import Language.PureScript.Types as P
45−
46−import qualified Paths_purescript as Paths
47−
48−version :: Version
49−version = Paths.version
src/Language/PureScript/AST.hsdeleted−24
@@ -1,24 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.AST
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The initial PureScript AST
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.AST (
16− module AST
17−) where
18−
19−import Language.PureScript.AST.Binders as AST
20−import Language.PureScript.AST.Declarations as AST
21−import Language.PureScript.AST.Operators as AST
22−import Language.PureScript.AST.SourcePos as AST
23−import Language.PureScript.AST.Traversals as AST
24−import Language.PureScript.AST.Exported as AST
src/Language/PureScript/AST/Binders.hsdeleted−92
@@ -1,92 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.AST.Binders
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Case binders
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−
17−module Language.PureScript.AST.Binders where
18−
19−import qualified Data.Data as D
20−
21−import Language.PureScript.AST.SourcePos
22−import Language.PureScript.Names
23−import Language.PureScript.Comments
24−import Language.PureScript.Types
25−
26−-- |
27−-- Data type for binders
28−--
29−data Binder
30− -- |
31− -- Wildcard binder
32− --
33− = NullBinder
34− -- |
35− -- A binder which matches a boolean literal
36− --
37− | BooleanBinder Bool
38− -- |
39− -- A binder which matches a string literal
40− --
41− | StringBinder String
42− -- |
43− -- A binder which matches a character literal
44− --
45− | CharBinder Char
46− -- |
47− -- A binder which matches a numeric literal
48− --
49− | NumberBinder (Either Integer Double)
50− -- |
51− -- A binder which binds an identifier
52− --
53− | VarBinder Ident
54− -- |
55− -- A binder which matches a data constructor
56− --
57− | ConstructorBinder (Qualified ProperName) [Binder]
58− -- |
59− -- A binder which matches a record and binds its properties
60− --
61− | ObjectBinder [(String, Binder)]
62− -- |
63− -- A binder which matches an array and binds its elements
64− --
65− | ArrayBinder [Binder]
66− -- |
67− -- A binder which binds its input to an identifier
68− --
69− | NamedBinder Ident Binder
70− -- |
71− -- A binder with source position information
72− --
73− | PositionedBinder SourceSpan [Comment] Binder
74− -- |
75− -- A binder with a type annotation
76− --
77− | TypedBinder Type Binder deriving (Show, Read, Eq, D.Data, D.Typeable)
78−
79−-- |
80−-- Collect all names introduced in binders in an expression
81−--
82−binderNames :: Binder -> [Ident]
83−binderNames = go []
84− where
85− go ns (VarBinder name) = name : ns
86− go ns (ConstructorBinder _ bs) = foldl go ns bs
87− go ns (ObjectBinder bs) = foldl go ns (map snd bs)
88− go ns (ArrayBinder bs) = foldl go ns bs
89− go ns (NamedBinder name b) = go (name : ns) b
90− go ns (PositionedBinder _ _ b) = go ns b
91− go ns (TypedBinder _ b) = go ns b
92− go ns _ = ns
src/Language/PureScript/AST/Declarations.hsdeleted−438
@@ -1,438 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.AST.Declarations
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Data types for modules and declarations
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−{-# LANGUAGE ScopedTypeVariables #-}
17−{-# LANGUAGE TemplateHaskell #-}
18−{-# LANGUAGE CPP #-}
19−
20−module Language.PureScript.AST.Declarations where
21−
22−import Data.Aeson.TH
23−
24−import qualified Data.Data as D
25−import qualified Data.Map as M
26−
27−import Control.Monad.Identity
28−
29−#if __GLASGOW_HASKELL__ < 710
30−import Control.Applicative
31−#endif
32−
33−import Language.PureScript.AST.Binders
34−import Language.PureScript.AST.Operators
35−import Language.PureScript.AST.SourcePos
36−import Language.PureScript.Types
37−import Language.PureScript.Names
38−import Language.PureScript.Kinds
39−import Language.PureScript.TypeClassDictionaries
40−import Language.PureScript.Comments
41−import Language.PureScript.Environment
42−
43−-- |
44−-- A module declaration, consisting of comments about the module, a module name,
45−-- a list of declarations, and a list of the declarations that are
46−-- explicitly exported. If the export list is Nothing, everything is exported.
47−--
48−data Module = Module SourceSpan [Comment] ModuleName [Declaration] (Maybe [DeclarationRef]) deriving (Show, Read, D.Data, D.Typeable)
49−
50−-- | Return a module's name.
51−getModuleName :: Module -> ModuleName
52−getModuleName (Module _ _ name _ _) = name
53−
54−-- |
55−-- An item in a list of explicit imports or exports
56−--
57−data DeclarationRef
58− -- |
59− -- A type constructor with data constructors
60− --
61− = TypeRef ProperName (Maybe [ProperName])
62− -- |
63− -- A value
64− --
65− | ValueRef Ident
66− -- |
67− -- A type class
68− --
69− | TypeClassRef ProperName
70− -- |
71− -- A type class instance, created during typeclass desugaring (name, class name, instance types)
72− --
73− | TypeInstanceRef Ident
74− -- |
75− -- A module, in its entirety
76− --
77− | ModuleRef ModuleName
78− -- |
79− -- A declaration reference with source position information
80− --
81− | PositionedDeclarationRef SourceSpan [Comment] DeclarationRef
82− deriving (Show, Read, D.Data, D.Typeable)
83−
84−instance Eq DeclarationRef where
85− (TypeRef name dctors) == (TypeRef name' dctors') = name == name' && dctors == dctors'
86− (ValueRef name) == (ValueRef name') = name == name'
87− (TypeClassRef name) == (TypeClassRef name') = name == name'
88− (TypeInstanceRef name) == (TypeInstanceRef name') = name == name'
89− (ModuleRef name) == (ModuleRef name') = name == name'
90− (PositionedDeclarationRef _ _ r) == r' = r == r'
91− r == (PositionedDeclarationRef _ _ r') = r == r'
92− _ == _ = False
93−
94−isModuleRef :: DeclarationRef -> Bool
95−isModuleRef (ModuleRef _) = True
96−isModuleRef _ = False
97−
98−-- |
99−-- The data type which specifies type of import declaration
100−--
101−data ImportDeclarationType
102− -- |
103− -- An import with no explicit list: `import M`
104− --
105− = Implicit
106− -- |
107− -- An import with an explicit list of references to import: `import M (foo)`
108− --
109− | Explicit [DeclarationRef]
110− -- |
111− -- An import with a list of references to hide: `import M hiding (foo)`
112− --
113− | Hiding [DeclarationRef]
114− deriving (Show, Read, D.Data, D.Typeable)
115−
116−-- |
117−-- The data type of declarations
118−--
119−data Declaration
120− -- |
121− -- A data type declaration (data or newtype, name, arguments, data constructors)
122− --
123− = DataDeclaration DataDeclType ProperName [(String, Maybe Kind)] [(ProperName, [Type])]
124− -- |
125− -- A minimal mutually recursive set of data type declarations
126− --
127− | DataBindingGroupDeclaration [Declaration]
128− -- |
129− -- A type synonym declaration (name, arguments, type)
130− --
131− | TypeSynonymDeclaration ProperName [(String, Maybe Kind)] Type
132− -- |
133− -- A type declaration for a value (name, ty)
134− --
135− | TypeDeclaration Ident Type
136− -- |
137− -- A value declaration (name, top-level binders, optional guard, value)
138− --
139− | ValueDeclaration Ident NameKind [Binder] (Either [(Guard, Expr)] Expr)
140− -- |
141− -- A minimal mutually recursive set of value declarations
142− --
143− | BindingGroupDeclaration [(Ident, NameKind, Expr)]
144− -- |
145− -- A foreign import declaration (name, type)
146− --
147− | ExternDeclaration Ident Type
148− -- |
149− -- A data type foreign import (name, kind)
150− --
151− | ExternDataDeclaration ProperName Kind
152− -- |
153− -- A fixity declaration (fixity data, operator name)
154− --
155− | FixityDeclaration Fixity String
156− -- |
157− -- A module import (module name, qualified/unqualified/hiding, optional "qualified as" name)
158− --
159− | ImportDeclaration ModuleName ImportDeclarationType (Maybe ModuleName)
160− -- |
161− -- A type class declaration (name, argument, implies, member declarations)
162− --
163− | TypeClassDeclaration ProperName [(String, Maybe Kind)] [Constraint] [Declaration]
164− -- |
165− -- A type instance declaration (name, dependencies, class name, instance types, member
166− -- declarations)
167− --
168− | TypeInstanceDeclaration Ident [Constraint] (Qualified ProperName) [Type] TypeInstanceBody
169− -- |
170− -- A declaration with source position information
171− --
172− | PositionedDeclaration SourceSpan [Comment] Declaration
173− deriving (Show, Read, D.Data, D.Typeable)
174−
175−-- | The members of a type class instance declaration
176−data TypeInstanceBody
177− -- | This is a derived instance
178− = DerivedInstance
179− -- | This is a regular (explicit) instance
180− | ExplicitInstance [Declaration]
181− deriving (Show, Read, D.Data, D.Typeable)
182−
183−mapTypeInstanceBody :: ([Declaration] -> [Declaration]) -> TypeInstanceBody -> TypeInstanceBody
184−mapTypeInstanceBody f = runIdentity . traverseTypeInstanceBody (Identity . f)
185−
186−-- | A traversal for TypeInstanceBody
187−traverseTypeInstanceBody :: (Applicative f) => ([Declaration] -> f [Declaration]) -> TypeInstanceBody -> f TypeInstanceBody
188−traverseTypeInstanceBody _ DerivedInstance = pure DerivedInstance
189−traverseTypeInstanceBody f (ExplicitInstance ds) = ExplicitInstance <$> f ds
190−
191−-- |
192−-- Test if a declaration is a value declaration
193−--
194−isValueDecl :: Declaration -> Bool
195−isValueDecl ValueDeclaration{} = True
196−isValueDecl (PositionedDeclaration _ _ d) = isValueDecl d
197−isValueDecl _ = False
198−
199−-- |
200−-- Test if a declaration is a data type or type synonym declaration
201−--
202−isDataDecl :: Declaration -> Bool
203−isDataDecl DataDeclaration{} = True
204−isDataDecl TypeSynonymDeclaration{} = True
205−isDataDecl (PositionedDeclaration _ _ d) = isDataDecl d
206−isDataDecl _ = False
207−
208−-- |
209−-- Test if a declaration is a module import
210−--
211−isImportDecl :: Declaration -> Bool
212−isImportDecl ImportDeclaration{} = True
213−isImportDecl (PositionedDeclaration _ _ d) = isImportDecl d
214−isImportDecl _ = False
215−
216−-- |
217−-- Test if a declaration is a data type foreign import
218−--
219−isExternDataDecl :: Declaration -> Bool
220−isExternDataDecl ExternDataDeclaration{} = True
221−isExternDataDecl (PositionedDeclaration _ _ d) = isExternDataDecl d
222−isExternDataDecl _ = False
223−
224−-- |
225−-- Test if a declaration is a fixity declaration
226−--
227−isFixityDecl :: Declaration -> Bool
228−isFixityDecl FixityDeclaration{} = True
229−isFixityDecl (PositionedDeclaration _ _ d) = isFixityDecl d
230−isFixityDecl _ = False
231−
232−-- |
233−-- Test if a declaration is a foreign import
234−--
235−isExternDecl :: Declaration -> Bool
236−isExternDecl ExternDeclaration{} = True
237−isExternDecl (PositionedDeclaration _ _ d) = isExternDecl d
238−isExternDecl _ = False
239−
240−-- |
241−-- Test if a declaration is a type class instance declaration
242−--
243−isTypeClassInstanceDeclaration :: Declaration -> Bool
244−isTypeClassInstanceDeclaration TypeInstanceDeclaration{} = True
245−isTypeClassInstanceDeclaration (PositionedDeclaration _ _ d) = isTypeClassInstanceDeclaration d
246−isTypeClassInstanceDeclaration _ = False
247−
248−-- |
249−-- Test if a declaration is a type class declaration
250−--
251−isTypeClassDeclaration :: Declaration -> Bool
252−isTypeClassDeclaration TypeClassDeclaration{} = True
253−isTypeClassDeclaration (PositionedDeclaration _ _ d) = isTypeClassDeclaration d
254−isTypeClassDeclaration _ = False
255−
256−-- |
257−-- Recursively flatten data binding groups in the list of declarations
258−flattenDecls :: [Declaration] -> [Declaration]
259−flattenDecls = concatMap flattenOne
260− where flattenOne :: Declaration -> [Declaration]
261− flattenOne (DataBindingGroupDeclaration decls) = concatMap flattenOne decls
262− flattenOne d = [d]
263−
264−-- |
265−-- A guard is just a boolean-valued expression that appears alongside a set of binders
266−--
267−type Guard = Expr
268−
269−-- |
270−-- Data type for expressions and terms
271−--
272−data Expr
273− -- |
274− -- A numeric literal
275− --
276− = NumericLiteral (Either Integer Double)
277− -- |
278− -- A string literal
279− --
280− | StringLiteral String
281− -- |
282− -- A character literal
283− --
284− | CharLiteral Char
285− -- |
286− -- A boolean literal
287− --
288− | BooleanLiteral Bool
289− -- |
290− -- A prefix -, will be desugared
291− --
292− | UnaryMinus Expr
293− -- |
294− -- Binary operator application. During the rebracketing phase of desugaring, this data constructor
295− -- will be removed.
296− --
297− | BinaryNoParens Expr Expr Expr
298− -- |
299− -- Explicit parentheses. During the rebracketing phase of desugaring, this data constructor
300− -- will be removed.
301− --
302− | Parens Expr
303− -- |
304− -- Operator section. This will be removed during desugaring and replaced with a partially applied
305− -- operator or lambda to flip the arguments.
306− --
307− | OperatorSection Expr (Either Expr Expr)
308− -- |
309− -- An array literal
310− --
311− | ArrayLiteral [Expr]
312− -- |
313− -- An object literal
314− --
315− | ObjectLiteral [(String, Expr)]
316− -- |
317− -- An object constructor (object literal with underscores). This will be removed during
318− -- desugaring and expanded into a lambda that returns an object literal.
319− --
320− | ObjectConstructor [(String, Maybe Expr)]
321− -- |
322− -- An object property getter (e.g. `_.x`). This will be removed during
323− -- desugaring and expanded into a lambda that reads a property from an object.
324− --
325− | ObjectGetter String
326− -- |
327− -- An record property accessor expression
328− --
329− | Accessor String Expr
330− -- |
331− -- Partial record update
332− --
333− | ObjectUpdate Expr [(String, Expr)]
334− -- |
335− -- Partial record updater. This will be removed during desugaring and
336− -- expanded into a lambda that returns an object update.
337− --
338− | ObjectUpdater (Maybe Expr) [(String, Maybe Expr)]
339− -- |
340− -- Function introduction
341− --
342− | Abs (Either Ident Binder) Expr
343− -- |
344− -- Function application
345− --
346− | App Expr Expr
347− -- |
348− -- Variable
349− --
350− | Var (Qualified Ident)
351− -- |
352− -- Conditional (if-then-else expression)
353− --
354− | IfThenElse Expr Expr Expr
355− -- |
356− -- A data constructor
357− --
358− | Constructor (Qualified ProperName)
359− -- |
360− -- A case expression. During the case expansion phase of desugaring, top-level binders will get
361− -- desugared into case expressions, hence the need for guards and multiple binders per branch here.
362− --
363− | Case [Expr] [CaseAlternative]
364− -- |
365− -- A value with a type annotation
366− --
367− | TypedValue Bool Expr Type
368− -- |
369− -- A let binding
370− --
371− | Let [Declaration] Expr
372− -- |
373− -- A do-notation block
374− --
375− | Do [DoNotationElement]
376− -- |
377− -- An application of a typeclass dictionary constructor. The value should be
378− -- an ObjectLiteral.
379− --
380− | TypeClassDictionaryConstructorApp (Qualified ProperName) Expr
381− -- |
382− -- A placeholder for a type class dictionary to be inserted later. At the end of type checking, these
383− -- placeholders will be replaced with actual expressions representing type classes dictionaries which
384− -- can be evaluated at runtime. The constructor arguments represent (in order): whether or not to look
385− -- at superclass implementations when searching for a dictionary, the type class name and
386− -- instance type, and the type class dictionaries in scope.
387− --
388− | TypeClassDictionary Constraint (M.Map (Maybe ModuleName) (M.Map (Qualified ProperName) (M.Map (Qualified Ident) TypeClassDictionaryInScope)))
389− -- |
390− -- A typeclass dictionary accessor, the implementation is left unspecified until CoreFn desugaring.
391− --
392− | TypeClassDictionaryAccessor (Qualified ProperName) Ident
393− -- |
394− -- A placeholder for a superclass dictionary to be turned into a TypeClassDictionary during typechecking
395− --
396− | SuperClassDictionary (Qualified ProperName) [Type]
397− -- |
398− -- A value with source position information
399− --
400− | PositionedValue SourceSpan [Comment] Expr deriving (Show, Read, D.Data, D.Typeable)
401−
402−-- |
403−-- An alternative in a case statement
404−--
405−data CaseAlternative = CaseAlternative
406− { -- |
407− -- A collection of binders with which to match the inputs
408− --
409− caseAlternativeBinders :: [Binder]
410− -- |
411− -- The result expression or a collect of guarded expressions
412− --
413− , caseAlternativeResult :: Either [(Guard, Expr)] Expr
414− } deriving (Show, Read, D.Data, D.Typeable)
415−
416−-- |
417−-- A statement in a do-notation block
418−--
419−data DoNotationElement
420− -- |
421− -- A monadic value without a binder
422− --
423− = DoNotationValue Expr
424− -- |
425− -- A monadic value with a binder
426− --
427− | DoNotationBind Binder Expr
428− -- |
429− -- A let statement, i.e. a pure value with a binder
430− --
431− | DoNotationLet [Declaration]
432− -- |
433− -- A do notation element with source position information
434− --
435− | PositionedDoNotationElement SourceSpan [Comment] DoNotationElement deriving (Show, Read, D.Data, D.Typeable)
436−
437−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''DeclarationRef)
438−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''ImportDeclarationType)
src/Language/PureScript/AST/Exported.hsdeleted−136
@@ -1,136 +0,0 @@
1−
2−module Language.PureScript.AST.Exported (
3− exportedDeclarations,
4− isExported
5−) where
6−
7−import Control.Category ((>>>))
8−import Data.Maybe (mapMaybe)
9−
10−import Language.PureScript.AST.Declarations
11−import Language.PureScript.Types
12−import Language.PureScript.Names
13−
14−-- |
15−-- Return a list of all declarations which are exported from a module.
16−-- This function descends into data declarations to filter out unexported
17−-- data constructors, and also filters out type instance declarations if
18−-- they refer to classes or types which are not themselves exported.
19−--
20−-- Note that this function assumes that the module has already had its imports
21−-- desugared using 'Language.PureScript.Sugar.Names.desugarImports'. It will
22−-- produce incorrect results if this is not the case - for example, type class
23−-- instances will be incorrectly removed in some cases.
24−--
25−exportedDeclarations :: Module -> [Declaration]
26−exportedDeclarations (Module _ _ _ decls exps) = go decls
27− where
28− go = flattenDecls
29− >>> filter (isExported exps)
30− >>> map (filterDataConstructors exps)
31− >>> filterInstances exps
32−
33−-- |
34−-- Filter out all data constructors from a declaration which are not exported.
35−-- If the supplied declaration is not a data declaration, this function returns
36−-- it unchanged.
37−--
38−filterDataConstructors :: Maybe [DeclarationRef] -> Declaration -> Declaration
39−filterDataConstructors exps (DataDeclaration dType tyName tyArgs dctors) =
40− DataDeclaration dType tyName tyArgs $
41− filter (isDctorExported tyName exps . fst) dctors
42−filterDataConstructors exps (PositionedDeclaration srcSpan coms d) =
43− PositionedDeclaration srcSpan coms (filterDataConstructors exps d)
44−filterDataConstructors _ other = other
45−
46−-- |
47−-- Filter out all the type instances from a list of declarations which
48−-- reference a type or type class which is both local and not exported.
49−--
50−-- Note that this function assumes that the module has already had its imports
51−-- desugared using "Language.PureScript.Sugar.Names.desugarImports". It will
52−-- produce incorrect results if this is not the case - for example, type class
53−-- instances will be incorrectly removed in some cases.
54−--
55−filterInstances :: Maybe [DeclarationRef] -> [Declaration] -> [Declaration]
56−filterInstances Nothing = id
57−filterInstances (Just exps) =
58− let refs = mapMaybe typeName exps ++ mapMaybe typeClassName exps
59− in filter (all (visibleOutside refs) . typeInstanceConstituents)
60− where
61− -- Given a Qualified ProperName, and a list of all exported types and type
62− -- classes, returns whether the supplied Qualified ProperName is visible
63− -- outside this module. This is true if one of the following hold:
64− --
65− -- * the name is defined in the same module and is exported,
66− -- * the name is defined in a different module (and must be exported from
67− -- that module; the code would fail to compile otherwise).
68− visibleOutside _ (Qualified (Just _) _) = True
69− visibleOutside refs (Qualified Nothing n) = n `elem` refs
70−
71− typeName (TypeRef n _) = Just n
72− typeName (PositionedDeclarationRef _ _ r) = typeName r
73− typeName _ = Nothing
74−
75− typeClassName (TypeClassRef n) = Just n
76− typeClassName (PositionedDeclarationRef _ _ r) = typeClassName r
77− typeClassName _ = Nothing
78−
79−-- |
80−-- Get all type and type class names referenced by a type instance declaration.
81−--
82−typeInstanceConstituents :: Declaration -> [Qualified ProperName]
83−typeInstanceConstituents (TypeInstanceDeclaration _ constraints className tys _) =
84− className : (concatMap fromConstraint constraints ++ concatMap fromType tys)
85− where
86−
87− fromConstraint (name, tys') = name : concatMap fromType tys'
88− fromType = everythingOnTypes (++) go
89−
90− -- Note that type synonyms are disallowed in instance declarations, so
91− -- we don't need to handle them here.
92− go (TypeConstructor n) = [n]
93− go (ConstrainedType cs _) = concatMap fromConstraint cs
94− go _ = []
95−
96−typeInstanceConstituents (PositionedDeclaration _ _ d) = typeInstanceConstituents d
97−typeInstanceConstituents _ = []
98−
99−
100−-- |
101−-- Test if a declaration is exported, given a module's export list. Note that
102−-- this function does not account for type instance declarations of
103−-- non-exported types, or non-exported data constructors. Therefore, you should
104−-- prefer 'exportedDeclarations' to this function, where possible.
105−--
106−isExported :: Maybe [DeclarationRef] -> Declaration -> Bool
107−isExported Nothing _ = True
108−isExported _ TypeInstanceDeclaration{} = True
109−isExported exps (PositionedDeclaration _ _ d) = isExported exps d
110−isExported (Just exps) decl = any (matches decl) exps
111− where
112− matches (TypeDeclaration ident _) (ValueRef ident') = ident == ident'
113− matches (ValueDeclaration ident _ _ _) (ValueRef ident') = ident == ident'
114− matches (ExternDeclaration ident _) (ValueRef ident') = ident == ident'
115− matches (FixityDeclaration _ name) (ValueRef ident') = name == runIdent ident'
116− matches (DataDeclaration _ ident _ _) (TypeRef ident' _) = ident == ident'
117− matches (ExternDataDeclaration ident _) (TypeRef ident' _) = ident == ident'
118− matches (TypeSynonymDeclaration ident _ _) (TypeRef ident' _) = ident == ident'
119− matches (TypeClassDeclaration ident _ _ _) (TypeClassRef ident') = ident == ident'
120−
121− matches (PositionedDeclaration _ _ d) r = d `matches` r
122− matches d (PositionedDeclarationRef _ _ r) = d `matches` r
123− matches _ _ = False
124−
125−-- |
126−-- Test if a data constructor for a given type is exported, given a module's
127−-- export list. Prefer 'exportedDeclarations' to this function, where possible.
128−--
129−isDctorExported :: ProperName -> Maybe [DeclarationRef] -> ProperName -> Bool
130−isDctorExported _ Nothing _ = True
131−isDctorExported ident (Just exps) ctor = test `any` exps
132− where
133− test (PositionedDeclarationRef _ _ d) = test d
134− test (TypeRef ident' Nothing) = ident == ident'
135− test (TypeRef ident' (Just ctors)) = ident == ident' && ctor `elem` ctors
136− test _ = False
src/Language/PureScript/AST/Operators.hsdeleted−60
@@ -1,60 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.AST.Operators
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Operators fixity and associativity
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE OverloadedStrings #-}
16−{-# LANGUAGE DeriveDataTypeable #-}
17−
18−module Language.PureScript.AST.Operators where
19−
20−import qualified Data.Data as D
21−import Data.Aeson ((.=))
22−import qualified Data.Aeson as A
23−
24−-- |
25−-- A precedence level for an infix operator
26−--
27−type Precedence = Integer
28−
29−-- |
30−-- Associativity for infix operators
31−--
32−data Associativity = Infixl | Infixr | Infix deriving (Show, Read, Eq, Ord, D.Data, D.Typeable)
33−
34−showAssoc :: Associativity -> String
35−showAssoc Infixl = "infixl"
36−showAssoc Infixr = "infixr"
37−showAssoc Infix = "infix"
38−
39−readAssoc :: String -> Associativity
40−readAssoc "infixl" = Infixl
41−readAssoc "infixr" = Infixr
42−readAssoc "infix" = Infix
43−readAssoc _ = error "readAssoc: no parse"
44−
45−instance A.ToJSON Associativity where
46− toJSON = A.toJSON . showAssoc
47−
48−instance A.FromJSON Associativity where
49− parseJSON = fmap readAssoc . A.parseJSON
50−
51−-- |
52−-- Fixity data for infix operators
53−--
54−data Fixity = Fixity Associativity Precedence deriving (Show, Read, Eq, Ord, D.Data, D.Typeable)
55−
56−instance A.ToJSON Fixity where
57− toJSON (Fixity associativity precedence) =
58− A.object [ "associativity" .= associativity
59− , "precedence" .= precedence
60− ]
src/Language/PureScript/AST/SourcePos.hsdeleted−98
@@ -1,98 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.AST.SourcePos
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Source position information
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE CPP #-}
16−{-# LANGUAGE DeriveDataTypeable #-}
17−{-# LANGUAGE ScopedTypeVariables #-}
18−{-# LANGUAGE RecordWildCards #-}
19−{-# LANGUAGE OverloadedStrings #-}
20−
21−module Language.PureScript.AST.SourcePos where
22−
23−import qualified Data.Data as D
24−import Data.Aeson ((.=), (.:))
25−import qualified Data.Aeson as A
26−
27−#if __GLASGOW_HASKELL__ < 710
28−import Control.Applicative
29−#endif
30−
31−-- |
32−-- Source position information
33−--
34−data SourcePos = SourcePos
35− { -- |
36− -- Line number
37− --
38− sourcePosLine :: Int
39− -- |
40− -- Column number
41− --
42− , sourcePosColumn :: Int
43− } deriving (Show, Read, Eq, Ord, D.Data, D.Typeable)
44−
45−displaySourcePos :: SourcePos -> String
46−displaySourcePos sp =
47− "line " ++ show (sourcePosLine sp) ++
48− ", column " ++ show (sourcePosColumn sp)
49−
50−instance A.ToJSON SourcePos where
51− toJSON SourcePos{..} =
52− A.toJSON [sourcePosLine, sourcePosColumn]
53−
54−instance A.FromJSON SourcePos where
55− parseJSON arr = do
56− [line, col] <- A.parseJSON arr
57− return $ SourcePos line col
58−
59−data SourceSpan = SourceSpan
60− { -- |
61− -- Source name
62− --
63− spanName :: String
64− -- |
65− -- Start of the span
66− --
67− , spanStart :: SourcePos
68− -- End of the span
69− --
70− , spanEnd :: SourcePos
71− } deriving (Show, Read, Eq, Ord, D.Data, D.Typeable)
72−
73−displayStartEndPos :: SourceSpan -> String
74−displayStartEndPos sp =
75− displaySourcePos (spanStart sp) ++ " - " ++
76− displaySourcePos (spanEnd sp)
77−
78−displaySourceSpan :: SourceSpan -> String
79−displaySourceSpan sp =
80− spanName sp ++ " " ++
81− displayStartEndPos sp
82−
83−instance A.ToJSON SourceSpan where
84− toJSON SourceSpan{..} =
85− A.object [ "name" .= spanName
86− , "start" .= spanStart
87− , "end" .= spanEnd
88− ]
89−
90−instance A.FromJSON SourceSpan where
91− parseJSON = A.withObject "SourceSpan" $ \o ->
92− SourceSpan <$>
93− o .: "name" <*>
94− o .: "start" <*>
95− o .: "end"
96−
97−internalModuleSourceSpan :: String -> SourceSpan
98−internalModuleSourceSpan name = SourceSpan name (SourcePos 0 0) (SourcePos 0 0)
src/Language/PureScript/AST/Traversals.hsdeleted−415
@@ -1,415 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.AST.Traversals
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | AST traversal helpers
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE CPP #-}
16−
17−module Language.PureScript.AST.Traversals where
18−
19−#if __GLASGOW_HASKELL__ < 710
20−import Data.Monoid (Monoid(..), mconcat)
21−#endif
22−import Data.Maybe (mapMaybe)
23−#if __GLASGOW_HASKELL__ < 710
24−import Data.Traversable (traverse)
25−#endif
26−
27−#if __GLASGOW_HASKELL__ < 710
28−import Control.Applicative
29−#endif
30−import Control.Monad
31−import Control.Arrow ((***), (+++), second)
32−
33−import Language.PureScript.AST.Binders
34−import Language.PureScript.AST.Declarations
35−import Language.PureScript.Types
36−import Language.PureScript.Traversals
37−
38−everywhereOnValues :: (Declaration -> Declaration) ->
39− (Expr -> Expr) ->
40− (Binder -> Binder) ->
41− (Declaration -> Declaration, Expr -> Expr, Binder -> Binder)
42−everywhereOnValues f g h = (f', g', h')
43− where
44− f' :: Declaration -> Declaration
45− f' (DataBindingGroupDeclaration ds) = f (DataBindingGroupDeclaration (map f' ds))
46− f' (ValueDeclaration name nameKind bs val) = f (ValueDeclaration name nameKind (map h' bs) ((map (g' *** g') +++ g') val))
47− f' (BindingGroupDeclaration ds) = f (BindingGroupDeclaration (map (\(name, nameKind, val) -> (name, nameKind, g' val)) ds))
48− f' (TypeClassDeclaration name args implies ds) = f (TypeClassDeclaration name args implies (map f' ds))
49− f' (TypeInstanceDeclaration name cs className args ds) = f (TypeInstanceDeclaration name cs className args (mapTypeInstanceBody (map f') ds))
50− f' (PositionedDeclaration pos com d) = f (PositionedDeclaration pos com (f' d))
51− f' other = f other
52−
53− g' :: Expr -> Expr
54− g' (UnaryMinus v) = g (UnaryMinus (g' v))
55− g' (BinaryNoParens op v1 v2) = g (BinaryNoParens (g' op) (g' v1) (g' v2))
56− g' (Parens v) = g (Parens (g' v))
57− g' (OperatorSection op (Left v)) = g (OperatorSection (g' op) (Left $ g' v))
58− g' (OperatorSection op (Right v)) = g (OperatorSection (g' op) (Right $ g' v))
59− g' (ArrayLiteral vs) = g (ArrayLiteral (map g' vs))
60− g' (ObjectLiteral vs) = g (ObjectLiteral (map (fmap g') vs))
61− g' (ObjectConstructor vs) = g (ObjectConstructor (map (second (fmap g')) vs))
62− g' (TypeClassDictionaryConstructorApp name v) = g (TypeClassDictionaryConstructorApp name (g' v))
63− g' (Accessor prop v) = g (Accessor prop (g' v))
64− g' (ObjectUpdate obj vs) = g (ObjectUpdate (g' obj) (map (fmap g') vs))
65− g' (ObjectUpdater obj vs) = g (ObjectUpdater (fmap g' obj) (map (second (fmap g')) vs))
66− g' (Abs name v) = g (Abs name (g' v))
67− g' (App v1 v2) = g (App (g' v1) (g' v2))
68− g' (IfThenElse v1 v2 v3) = g (IfThenElse (g' v1) (g' v2) (g' v3))
69− g' (Case vs alts) = g (Case (map g' vs) (map handleCaseAlternative alts))
70− g' (TypedValue check v ty) = g (TypedValue check (g' v) ty)
71− g' (Let ds v) = g (Let (map f' ds) (g' v))
72− g' (Do es) = g (Do (map handleDoNotationElement es))
73− g' (PositionedValue pos com v) = g (PositionedValue pos com (g' v))
74− g' other = g other
75−
76− h' :: Binder -> Binder
77− h' (ConstructorBinder ctor bs) = h (ConstructorBinder ctor (map h' bs))
78− h' (ObjectBinder bs) = h (ObjectBinder (map (fmap h') bs))
79− h' (ArrayBinder bs) = h (ArrayBinder (map h' bs))
80− h' (NamedBinder name b) = h (NamedBinder name (h' b))
81− h' (PositionedBinder pos com b) = h (PositionedBinder pos com (h' b))
82− h' (TypedBinder t b) = h (TypedBinder t (h' b))
83− h' other = h other
84−
85− handleCaseAlternative :: CaseAlternative -> CaseAlternative
86− handleCaseAlternative ca =
87− ca { caseAlternativeBinders = map h' (caseAlternativeBinders ca)
88− , caseAlternativeResult = (map (g' *** g') +++ g') (caseAlternativeResult ca)
89− }
90−
91− handleDoNotationElement :: DoNotationElement -> DoNotationElement
92− handleDoNotationElement (DoNotationValue v) = DoNotationValue (g' v)
93− handleDoNotationElement (DoNotationBind b v) = DoNotationBind (h' b) (g' v)
94− handleDoNotationElement (DoNotationLet ds) = DoNotationLet (map f' ds)
95− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com (handleDoNotationElement e)
96−
97−everywhereOnValuesTopDownM :: (Functor m, Applicative m, Monad m) =>
98− (Declaration -> m Declaration) ->
99− (Expr -> m Expr) ->
100− (Binder -> m Binder) ->
101− (Declaration -> m Declaration, Expr -> m Expr, Binder -> m Binder)
102−everywhereOnValuesTopDownM f g h = (f' <=< f, g' <=< g, h' <=< h)
103− where
104− f' (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> mapM (f' <=< f) ds
105− f' (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> mapM (h' <=< h) bs <*> eitherM (mapM (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
106− f' (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> mapM (\(name, nameKind, val) -> (,,) name nameKind <$> (g val >>= g')) ds
107− f' (TypeClassDeclaration name args implies ds) = TypeClassDeclaration name args implies <$> mapM (f' <=< f) ds
108− f' (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse (f' <=< f)) ds
109− f' (PositionedDeclaration pos com d) = PositionedDeclaration pos com <$> (f d >>= f')
110− f' other = f other
111−
112− g' (UnaryMinus v) = UnaryMinus <$> (g v >>= g')
113− g' (BinaryNoParens op v1 v2) = BinaryNoParens <$> (g op >>= g') <*> (g v1 >>= g') <*> (g v2 >>= g')
114− g' (Parens v) = Parens <$> (g v >>= g')
115− g' (OperatorSection op (Left v)) = OperatorSection <$> (g op >>= g') <*> (Left <$> (g v >>= g'))
116− g' (OperatorSection op (Right v)) = OperatorSection <$> (g op >>= g') <*> (Right <$> (g v >>= g'))
117− g' (ArrayLiteral vs) = ArrayLiteral <$> mapM (g' <=< g) vs
118− g' (ObjectLiteral vs) = ObjectLiteral <$> mapM (sndM (g' <=< g)) vs
119− g' (ObjectConstructor vs) = ObjectConstructor <$> mapM (sndM $ maybeM (g' <=< g)) vs
120− g' (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> (g v >>= g')
121− g' (Accessor prop v) = Accessor prop <$> (g v >>= g')
122− g' (ObjectUpdate obj vs) = ObjectUpdate <$> (g obj >>= g') <*> mapM (sndM (g' <=< g)) vs
123− g' (ObjectUpdater obj vs) = ObjectUpdater <$> (maybeM g obj >>= maybeM g') <*> mapM (sndM $ maybeM (g' <=< g)) vs
124− g' (Abs name v) = Abs name <$> (g v >>= g')
125− g' (App v1 v2) = App <$> (g v1 >>= g') <*> (g v2 >>= g')
126− g' (IfThenElse v1 v2 v3) = IfThenElse <$> (g v1 >>= g') <*> (g v2 >>= g') <*> (g v3 >>= g')
127− g' (Case vs alts) = Case <$> mapM (g' <=< g) vs <*> mapM handleCaseAlternative alts
128− g' (TypedValue check v ty) = TypedValue check <$> (g v >>= g') <*> pure ty
129− g' (Let ds v) = Let <$> mapM (f' <=< f) ds <*> (g v >>= g')
130− g' (Do es) = Do <$> mapM handleDoNotationElement es
131− g' (PositionedValue pos com v) = PositionedValue pos com <$> (g v >>= g')
132− g' other = g other
133−
134− h' (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> mapM (h' <=< h) bs
135− h' (ObjectBinder bs) = ObjectBinder <$> mapM (sndM (h' <=< h)) bs
136− h' (ArrayBinder bs) = ArrayBinder <$> mapM (h' <=< h) bs
137− h' (NamedBinder name b) = NamedBinder name <$> (h b >>= h')
138− h' (PositionedBinder pos com b) = PositionedBinder pos com <$> (h b >>= h')
139− h' (TypedBinder t b) = TypedBinder t <$> (h b >>= h')
140− h' other = h other
141−
142− handleCaseAlternative (CaseAlternative bs val) = CaseAlternative <$> mapM (h' <=< h) bs
143− <*> eitherM (mapM (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
144−
145− handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> (g' <=< g) v
146− handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> (h' <=< h) b <*> (g' <=< g) v
147− handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> mapM (f' <=< f) ds
148− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
149−
150−everywhereOnValuesM :: (Functor m, Applicative m, Monad m) =>
151− (Declaration -> m Declaration) ->
152− (Expr -> m Expr) ->
153− (Binder -> m Binder) ->
154− (Declaration -> m Declaration, Expr -> m Expr, Binder -> m Binder)
155−everywhereOnValuesM f g h = (f', g', h')
156− where
157− f' (DataBindingGroupDeclaration ds) = (DataBindingGroupDeclaration <$> mapM f' ds) >>= f
158− f' (ValueDeclaration name nameKind bs val) = (ValueDeclaration name nameKind <$> mapM h' bs <*> eitherM (mapM (pairM g' g')) g' val) >>= f
159− f' (BindingGroupDeclaration ds) = (BindingGroupDeclaration <$> mapM (\(name, nameKind, val) -> (,,) name nameKind <$> g' val) ds) >>= f
160− f' (TypeClassDeclaration name args implies ds) = (TypeClassDeclaration name args implies <$> mapM f' ds) >>= f
161− f' (TypeInstanceDeclaration name cs className args ds) = (TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (mapM f') ds) >>= f
162− f' (PositionedDeclaration pos com d) = (PositionedDeclaration pos com <$> f' d) >>= f
163− f' other = f other
164−
165− g' (UnaryMinus v) = (UnaryMinus <$> g' v) >>= g
166− g' (BinaryNoParens op v1 v2) = (BinaryNoParens <$> g' op <*> g' v1 <*> g' v2) >>= g
167− g' (Parens v) = (Parens <$> g' v) >>= g
168− g' (OperatorSection op (Left v)) = (OperatorSection <$> g' op <*> (Left <$> g' v)) >>= g
169− g' (OperatorSection op (Right v)) = (OperatorSection <$> g' op <*> (Right <$> g' v)) >>= g
170− g' (ArrayLiteral vs) = (ArrayLiteral <$> mapM g' vs) >>= g
171− g' (ObjectLiteral vs) = (ObjectLiteral <$> mapM (sndM g') vs) >>= g
172− g' (ObjectConstructor vs) = (ObjectConstructor <$> mapM (sndM $ maybeM g') vs) >>= g
173− g' (TypeClassDictionaryConstructorApp name v) = (TypeClassDictionaryConstructorApp name <$> g' v) >>= g
174− g' (Accessor prop v) = (Accessor prop <$> g' v) >>= g
175− g' (ObjectUpdate obj vs) = (ObjectUpdate <$> g' obj <*> mapM (sndM g') vs) >>= g
176− g' (ObjectUpdater obj vs) = (ObjectUpdater <$> maybeM g' obj <*> mapM (sndM $ maybeM g') vs) >>= g
177− g' (Abs name v) = (Abs name <$> g' v) >>= g
178− g' (App v1 v2) = (App <$> g' v1 <*> g' v2) >>= g
179− g' (IfThenElse v1 v2 v3) = (IfThenElse <$> g' v1 <*> g' v2 <*> g' v3) >>= g
180− g' (Case vs alts) = (Case <$> mapM g' vs <*> mapM handleCaseAlternative alts) >>= g
181− g' (TypedValue check v ty) = (TypedValue check <$> g' v <*> pure ty) >>= g
182− g' (Let ds v) = (Let <$> mapM f' ds <*> g' v) >>= g
183− g' (Do es) = (Do <$> mapM handleDoNotationElement es) >>= g
184− g' (PositionedValue pos com v) = (PositionedValue pos com <$> g' v) >>= g
185− g' other = g other
186−
187− h' (ConstructorBinder ctor bs) = (ConstructorBinder ctor <$> mapM h' bs) >>= h
188− h' (ObjectBinder bs) = (ObjectBinder <$> mapM (sndM h') bs) >>= h
189− h' (ArrayBinder bs) = (ArrayBinder <$> mapM h' bs) >>= h
190− h' (NamedBinder name b) = (NamedBinder name <$> h' b) >>= h
191− h' (PositionedBinder pos com b) = (PositionedBinder pos com <$> h' b) >>= h
192− h' (TypedBinder t b) = (TypedBinder t <$> h' b) >>= h
193− h' other = h other
194−
195− handleCaseAlternative (CaseAlternative bs val) = CaseAlternative <$> mapM h' bs
196− <*> eitherM (mapM (pairM g' g')) g' val
197−
198− handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> g' v
199− handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> h' b <*> g' v
200− handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> mapM f' ds
201− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
202−
203−everythingOnValues :: (r -> r -> r) ->
204− (Declaration -> r) ->
205− (Expr -> r) ->
206− (Binder -> r) ->
207− (CaseAlternative -> r) ->
208− (DoNotationElement -> r) ->
209− (Declaration -> r, Expr -> r, Binder -> r, CaseAlternative -> r, DoNotationElement -> r)
210−everythingOnValues (<>) f g h i j = (f', g', h', i', j')
211− where
212− f' d@(DataBindingGroupDeclaration ds) = foldl (<>) (f d) (map f' ds)
213− f' d@(ValueDeclaration _ _ bs (Right val)) = foldl (<>) (f d) (map h' bs) <> g' val
214− f' d@(ValueDeclaration _ _ bs (Left gs)) = foldl (<>) (f d) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
215− f' d@(BindingGroupDeclaration ds) = foldl (<>) (f d) (map (\(_, _, val) -> g' val) ds)
216− f' d@(TypeClassDeclaration _ _ _ ds) = foldl (<>) (f d) (map f' ds)
217− f' d@(TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldl (<>) (f d) (map f' ds)
218− f' d@(PositionedDeclaration _ _ d1) = f d <> f' d1
219− f' d = f d
220−
221− g' v@(UnaryMinus v1) = g v <> g' v1
222− g' v@(BinaryNoParens op v1 v2) = g v <> g' op <> g' v1 <> g' v2
223− g' v@(Parens v1) = g v <> g' v1
224− g' v@(OperatorSection op (Left v1)) = g v <> g' op <> g' v1
225− g' v@(OperatorSection op (Right v1)) = g v <> g' op <> g' v1
226− g' v@(ArrayLiteral vs) = foldl (<>) (g v) (map g' vs)
227− g' v@(ObjectLiteral vs) = foldl (<>) (g v) (map (g' . snd) vs)
228− g' v@(ObjectConstructor vs) = foldl (<>) (g v) (map g' (mapMaybe snd vs))
229− g' v@(TypeClassDictionaryConstructorApp _ v1) = g v <> g' v1
230− g' v@(Accessor _ v1) = g v <> g' v1
231− g' v@(ObjectUpdate obj vs) = foldl (<>) (g v <> g' obj) (map (g' . snd) vs)
232− g' v@(ObjectUpdater obj vs) = foldl (<>) (maybe (g v) (\x -> g v <> g' x) obj) (map g' (mapMaybe snd vs))
233− g' v@(Abs _ v1) = g v <> g' v1
234− g' v@(App v1 v2) = g v <> g' v1 <> g' v2
235− g' v@(IfThenElse v1 v2 v3) = g v <> g' v1 <> g' v2 <> g' v3
236− g' v@(Case vs alts) = foldl (<>) (foldl (<>) (g v) (map g' vs)) (map i' alts)
237− g' v@(TypedValue _ v1 _) = g v <> g' v1
238− g' v@(Let ds v1) = foldl (<>) (g v) (map f' ds) <> g' v1
239− g' v@(Do es) = foldl (<>) (g v) (map j' es)
240− g' v@(PositionedValue _ _ v1) = g v <> g' v1
241− g' v = g v
242−
243− h' b@(ConstructorBinder _ bs) = foldl (<>) (h b) (map h' bs)
244− h' b@(ObjectBinder bs) = foldl (<>) (h b) (map (h' . snd) bs)
245− h' b@(ArrayBinder bs) = foldl (<>) (h b) (map h' bs)
246− h' b@(NamedBinder _ b1) = h b <> h' b1
247− h' b@(PositionedBinder _ _ b1) = h b <> h' b1
248− h' b@(TypedBinder _ b1) = h b <> h' b1
249− h' b = h b
250−
251− i' ca@(CaseAlternative bs (Right val)) = foldl (<>) (i ca) (map h' bs) <> g' val
252− i' ca@(CaseAlternative bs (Left gs)) = foldl (<>) (i ca) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
253−
254− j' e@(DoNotationValue v) = j e <> g' v
255− j' e@(DoNotationBind b v) = j e <> h' b <> g' v
256− j' e@(DoNotationLet ds) = foldl (<>) (j e) (map f' ds)
257− j' e@(PositionedDoNotationElement _ _ e1) = j e <> j' e1
258−
259−everythingWithContextOnValues ::
260− s ->
261− r ->
262− (r -> r -> r) ->
263− (s -> Declaration -> (s, r)) ->
264− (s -> Expr -> (s, r)) ->
265− (s -> Binder -> (s, r)) ->
266− (s -> CaseAlternative -> (s, r)) ->
267− (s -> DoNotationElement -> (s, r)) ->
268− ( Declaration -> r
269− , Expr -> r
270− , Binder -> r
271− , CaseAlternative -> r
272− , DoNotationElement -> r)
273−everythingWithContextOnValues s0 r0 (<>) f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
274− where
275− f'' s d = let (s', r) = f s d in r <> f' s' d
276−
277− f' s (DataBindingGroupDeclaration ds) = foldl (<>) r0 (map (f'' s) ds)
278− f' s (ValueDeclaration _ _ bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
279− f' s (ValueDeclaration _ _ bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
280− f' s (BindingGroupDeclaration ds) = foldl (<>) r0 (map (\(_, _, val) -> g'' s val) ds)
281− f' s (TypeClassDeclaration _ _ _ ds) = foldl (<>) r0 (map (f'' s) ds)
282− f' s (TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldl (<>) r0 (map (f'' s) ds)
283− f' s (PositionedDeclaration _ _ d1) = f'' s d1
284− f' _ _ = r0
285−
286− g'' s v = let (s', r) = g s v in r <> g' s' v
287−
288− g' s (UnaryMinus v1) = g'' s v1
289− g' s (BinaryNoParens op v1 v2) = g'' s op <> g'' s v1 <> g'' s v2
290− g' s (Parens v1) = g'' s v1
291− g' s (OperatorSection op (Left v)) = g'' s op <> g'' s v
292− g' s (OperatorSection op (Right v)) = g'' s op <> g'' s v
293− g' s (ArrayLiteral vs) = foldl (<>) r0 (map (g'' s) vs)
294− g' s (ObjectLiteral vs) = foldl (<>) r0 (map (g'' s . snd) vs)
295− g' s (ObjectConstructor vs) = foldl (<>) r0 (map (g'' s) (mapMaybe snd vs))
296− g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
297− g' s (Accessor _ v1) = g'' s v1
298− g' s (ObjectUpdate obj vs) = foldl (<>) (g'' s obj) (map (g'' s . snd) vs)
299− g' s (ObjectUpdater obj vs) = foldl (<>) (maybe r0 (g'' s) obj) (map (g'' s) (mapMaybe snd vs))
300− g' s (Abs _ v1) = g'' s v1
301− g' s (App v1 v2) = g'' s v1 <> g'' s v2
302− g' s (IfThenElse v1 v2 v3) = g'' s v1 <> g'' s v2 <> g'' s v3
303− g' s (Case vs alts) = foldl (<>) (foldl (<>) r0 (map (g'' s) vs)) (map (i'' s) alts)
304− g' s (TypedValue _ v1 _) = g'' s v1
305− g' s (Let ds v1) = foldl (<>) r0 (map (f'' s) ds) <> g'' s v1
306− g' s (Do es) = foldl (<>) r0 (map (j'' s) es)
307− g' s (PositionedValue _ _ v1) = g'' s v1
308− g' _ _ = r0
309−
310− h'' s b = let (s', r) = h s b in r <> h' s' b
311−
312− h' s (ConstructorBinder _ bs) = foldl (<>) r0 (map (h'' s) bs)
313− h' s (ObjectBinder bs) = foldl (<>) r0 (map (h'' s . snd) bs)
314− h' s (ArrayBinder bs) = foldl (<>) r0 (map (h'' s) bs)
315− h' s (NamedBinder _ b1) = h'' s b1
316− h' s (PositionedBinder _ _ b1) = h'' s b1
317− h' s (TypedBinder _ b1) = h'' s b1
318− h' _ _ = r0
319−
320− i'' s ca = let (s', r) = i s ca in r <> i' s' ca
321−
322− i' s (CaseAlternative bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
323− i' s (CaseAlternative bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
324−
325− j'' s e = let (s', r) = j s e in r <> j' s' e
326−
327− j' s (DoNotationValue v) = g'' s v
328− j' s (DoNotationBind b v) = h'' s b <> g'' s v
329− j' s (DoNotationLet ds) = foldl (<>) r0 (map (f'' s) ds)
330− j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
331−
332−everywhereWithContextOnValuesM :: (Functor m, Applicative m, Monad m) =>
333− s ->
334− (s -> Declaration -> m (s, Declaration)) ->
335− (s -> Expr -> m (s, Expr)) ->
336− (s -> Binder -> m (s, Binder)) ->
337− (s -> CaseAlternative -> m (s, CaseAlternative)) ->
338− (s -> DoNotationElement -> m (s, DoNotationElement)) ->
339− ( Declaration -> m Declaration
340− , Expr -> m Expr
341− , Binder -> m Binder
342− , CaseAlternative -> m CaseAlternative
343− , DoNotationElement -> m DoNotationElement)
344−everywhereWithContextOnValuesM s0 f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
345− where
346− f'' s = uncurry f' <=< f s
347−
348− f' s (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> mapM (f'' s) ds
349− f' s (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> mapM (h'' s) bs <*> eitherM (mapM (pairM (g'' s) (g'' s))) (g'' s) val
350− f' s (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> mapM (thirdM (g'' s)) ds
351− f' s (TypeClassDeclaration name args implies ds) = TypeClassDeclaration name args implies <$> mapM (f'' s) ds
352− f' s (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (mapM (f'' s)) ds
353− f' s (PositionedDeclaration pos com d1) = PositionedDeclaration pos com <$> f'' s d1
354− f' _ other = return other
355−
356− g'' s = uncurry g' <=< g s
357−
358− g' s (UnaryMinus v) = UnaryMinus <$> g'' s v
359− g' s (BinaryNoParens op v1 v2) = BinaryNoParens <$> g'' s op <*> g'' s v1 <*> g'' s v2
360− g' s (Parens v) = Parens <$> g'' s v
361− g' s (OperatorSection op (Left v)) = OperatorSection <$> g'' s op <*> (Left <$> g'' s v)
362− g' s (OperatorSection op (Right v)) = OperatorSection <$> g'' s op <*> (Right <$> g'' s v)
363− g' s (ArrayLiteral vs) = ArrayLiteral <$> mapM (g'' s) vs
364− g' s (ObjectLiteral vs) = ObjectLiteral <$> mapM (sndM (g'' s)) vs
365− g' s (ObjectConstructor vs) = ObjectConstructor <$> mapM (sndM $ maybeM (g'' s)) vs
366− g' s (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> g'' s v
367− g' s (Accessor prop v) = Accessor prop <$> g'' s v
368− g' s (ObjectUpdate obj vs) = ObjectUpdate <$> g'' s obj <*> mapM (sndM (g'' s)) vs
369− g' s (ObjectUpdater obj vs) = ObjectUpdater <$> maybeM (g'' s) obj <*> mapM (sndM $ maybeM (g'' s)) vs
370− g' s (Abs name v) = Abs name <$> g'' s v
371− g' s (App v1 v2) = App <$> g'' s v1 <*> g'' s v2
372− g' s (IfThenElse v1 v2 v3) = IfThenElse <$> g'' s v1 <*> g'' s v2 <*> g'' s v3
373− g' s (Case vs alts) = Case <$> mapM (g'' s) vs <*> mapM (i'' s) alts
374− g' s (TypedValue check v ty) = TypedValue check <$> g'' s v <*> pure ty
375− g' s (Let ds v) = Let <$> mapM (f'' s) ds <*> g'' s v
376− g' s (Do es) = Do <$> mapM (j'' s) es
377− g' s (PositionedValue pos com v) = PositionedValue pos com <$> g'' s v
378− g' _ other = return other
379−
380− h'' s = uncurry h' <=< h s
381−
382− h' s (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> mapM (h'' s) bs
383− h' s (ObjectBinder bs) = ObjectBinder <$> mapM (sndM (h'' s)) bs
384− h' s (ArrayBinder bs) = ArrayBinder <$> mapM (h'' s) bs
385− h' s (NamedBinder name b) = NamedBinder name <$> h'' s b
386− h' s (PositionedBinder pos com b) = PositionedBinder pos com <$> h'' s b
387− h' s (TypedBinder t b) = TypedBinder t <$> h'' s b
388− h' _ other = return other
389−
390− i'' s = uncurry i' <=< i s
391−
392− i' s (CaseAlternative bs val) = CaseAlternative <$> mapM (h'' s) bs <*> eitherM (mapM (pairM (g'' s) (g'' s))) (g'' s) val
393−
394− j'' s = uncurry j' <=< j s
395−
396− j' s (DoNotationValue v) = DoNotationValue <$> g'' s v
397− j' s (DoNotationBind b v) = DoNotationBind <$> h'' s b <*> g'' s v
398− j' s (DoNotationLet ds) = DoNotationLet <$> mapM (f'' s) ds
399− j' s (PositionedDoNotationElement pos com e1) = PositionedDoNotationElement pos com <$> j'' s e1
400−
401−accumTypes :: (Monoid r) => (Type -> r) -> (Declaration -> r, Expr -> r, Binder -> r, CaseAlternative -> r, DoNotationElement -> r)
402−accumTypes f = everythingOnValues mappend forDecls forValues (const mempty) (const mempty) (const mempty)
403− where
404− forDecls (DataDeclaration _ _ _ dctors) = mconcat (concatMap (map f . snd) dctors)
405− forDecls (ExternDeclaration _ ty) = f ty
406− forDecls (TypeClassDeclaration _ _ implies _) = mconcat (concatMap (map f . snd) implies)
407− forDecls (TypeInstanceDeclaration _ cs _ tys _) = mconcat (concatMap (map f . snd) cs) `mappend` mconcat (map f tys)
408− forDecls (TypeSynonymDeclaration _ _ ty) = f ty
409− forDecls (TypeDeclaration _ ty) = f ty
410− forDecls _ = mempty
411−
412− forValues (TypeClassDictionary (_, cs) _) = mconcat (map f cs)
413− forValues (SuperClassDictionary _ tys) = mconcat (map f tys)
414− forValues (TypedValue _ _ ty) = f ty
415− forValues _ = mempty
src/Language/PureScript/Bundle.hsdeleted−552
@@ -1,552 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : psc-bundle
4−-- Copyright : (c) Phil Freeman 2015
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Bundles compiled PureScript modules for the browser.
12−--
13−-- This module takes as input the individual generated modules from 'Language.PureScript.Make' and
14−-- performs dead code elimination, filters empty modules,
15−-- and generates the final Javascript bundle.
16−-----------------------------------------------------------------------------
17−
18−{-# LANGUAGE PatternGuards #-}
19−{-# LANGUAGE FlexibleContexts #-}
20−{-# LANGUAGE ScopedTypeVariables #-}
21−{-# LANGUAGE TupleSections #-}
22−{-# LANGUAGE RecordWildCards #-}
23−{-# LANGUAGE CPP #-}
24−
25−module Language.PureScript.Bundle (
26− bundle
27− , ModuleIdentifier(..)
28− , moduleName
29− , ModuleType(..)
30− , ErrorMessage(..)
31− , printErrorMessage
32−) where
33−
34−import Data.List (nub)
35−import Data.Maybe (mapMaybe, catMaybes)
36−import Data.Generics (everything, everywhere, mkQ, mkT)
37−import Data.Graph
38−import Data.Version (showVersion)
39−
40−import qualified Data.Set as S
41−
42−#if __GLASGOW_HASKELL__ < 710
43−import Control.Applicative
44−#endif
45−import Control.Monad
46−import Control.Monad.Error.Class
47−import Language.JavaScript.Parser
48−
49−import qualified Paths_purescript as Paths
50−
51−-- | The type of error messages. We separate generation and rendering of errors using a data
52−-- type, in case we need to match on error types later.
53−data ErrorMessage
54− = UnsupportedModulePath String
55− | InvalidTopLevel
56− | UnableToParseModule String
57− | UnsupportedExport
58− | ErrorInModule ModuleIdentifier ErrorMessage
59− deriving (Show, Read)
60−
61−-- | Modules are either "regular modules" (i.e. those generated by psc) or foreign modules.
62−data ModuleType
63− = Regular
64− | Foreign
65− deriving (Show, Read, Eq, Ord)
66−
67−showModuleType :: ModuleType -> String
68−showModuleType Regular = "Regular"
69−showModuleType Foreign = "Foreign"
70−
71−-- | A module is identified by its module name and its type.
72−data ModuleIdentifier = ModuleIdentifier String ModuleType deriving (Show, Read, Eq, Ord)
73−
74−moduleName :: ModuleIdentifier -> String
75−moduleName (ModuleIdentifier name _) = name
76−
77−-- | A piece of code is identified by its module and its name. These keys are used to label vertices
78−-- in the dependency graph.
79−type Key = (ModuleIdentifier, String)
80−
81−-- | An export is either a "regular export", which exports a name from the regular module we are in,
82−-- or a reexport of a declaration in the corresponding foreign module.
83−--
84−-- Regular exports are labelled, since they might re-export an operator with another name.
85−data ExportType
86− = RegularExport String
87− | ForeignReexport
88− deriving (Show, Read, Eq, Ord)
89−
90−-- | There are four types of module element we are interested in:
91−--
92−-- 1) Require statements
93−-- 2) Member declarations
94−-- 3) Export lists
95−-- 4) Everything else
96−--
97−-- Each is labelled with the original AST node which generated it, so that we can dump it back
98−-- into the output during codegen.
99−data ModuleElement
100− = Require JSNode String ModuleIdentifier
101− | Member JSNode Bool String [JSNode] [Key]
102− | ExportsList [(ExportType, String, JSNode, [Key])]
103− | Other JSNode
104− deriving (Show, Read)
105−
106−-- | A module is just a list of elements of the types listed above.
107−data Module = Module ModuleIdentifier [ModuleElement] deriving (Show, Read)
108−
109−-- | Prepare an error message for consumption by humans.
110−printErrorMessage :: ErrorMessage -> [String]
111−printErrorMessage (UnsupportedModulePath s) =
112− [ "A CommonJS module has an unsupported name (" ++ show s ++ ")."
113− , "The following file names are supported:"
114− , " 1) index.js (psc native modules)"
115− , " 2) foreign.js (psc foreign modules)"
116− ]
117−printErrorMessage InvalidTopLevel =
118− [ "Expected a list of source elements at the top level." ]
119−printErrorMessage (UnableToParseModule err) =
120− [ "The module could not be parsed:"
121− , err
122− ]
123−printErrorMessage UnsupportedExport =
124− [ "An export was unsupported. Exports can be defined in one of two ways: "
125− , " 1) exports.name = ..."
126− , " 2) exports = { ... }"
127− ]
128−printErrorMessage (ErrorInModule mid e) =
129− ("Error in module " ++ displayIdentifier mid ++ ":")
130− : ""
131− : map (" " ++) (printErrorMessage e)
132− where
133− displayIdentifier (ModuleIdentifier name ty) =
134− name ++ " (" ++ showModuleType ty ++ ")"
135−
136−-- | Unpack the node inside a JSNode. This is useful when pattern matching.
137−node :: JSNode -> Node
138−node (NN n) = n
139−node (NT n _ _) = n
140−
141−-- | Calculate the ModuleIdentifier which a require(...) statement imports.
142−checkImportPath :: String -> ModuleIdentifier -> S.Set String -> Maybe ModuleIdentifier
143−checkImportPath "./foreign" m _ =
144− Just (ModuleIdentifier (moduleName m) Foreign)
145−checkImportPath name _ names
146− | name `S.member` names = Just (ModuleIdentifier name Regular)
147−checkImportPath _ _ _ = Nothing
148−
149−-- | Compute the dependencies of all elements in a module, and add them to the tree.
150−--
151−-- Members and exports can have dependencies. A dependency is of one of the following forms:
152−--
153−-- 1) module.name or member["name"]
154−--
155−-- where module was imported using
156−--
157−-- var module = require("Module.Name");
158−--
159−-- 2) name
160−--
161−-- where name is the name of a member defined in the current module.
162−withDeps :: Module -> Module
163−withDeps (Module modulePath es) = Module modulePath (map expandDeps es)
164− where
165− -- | Collects all modules which are imported, so that we can identify dependencies of the first type.
166− imports :: [(String, ModuleIdentifier)]
167− imports = mapMaybe toImport es
168− where
169− toImport :: ModuleElement -> Maybe (String, ModuleIdentifier)
170− toImport (Require _ nm mid) = Just (nm, mid)
171− toImport _ = Nothing
172−
173− -- | Collects all member names in scope, so that we can identify dependencies of the second type.
174− boundNames :: [String]
175− boundNames = mapMaybe toBoundName es
176− where
177− toBoundName :: ModuleElement -> Maybe String
178− toBoundName (Member _ _ nm _ _) = Just nm
179− toBoundName _ = Nothing
180−
181− -- | Calculate dependencies and add them to the current element.
182− expandDeps :: ModuleElement -> ModuleElement
183− expandDeps (Member n f nm decl _) = Member n f nm decl (nub (concatMap (dependencies modulePath) decl))
184− expandDeps (ExportsList exps) = ExportsList (map expand exps)
185− where
186− expand (ty, nm, n1, _) = (ty, nm, n1, nub (dependencies modulePath n1))
187− expandDeps other = other
188−
189− dependencies :: ModuleIdentifier -> JSNode -> [(ModuleIdentifier, String)]
190− dependencies m = everything (++) (mkQ [] toReference)
191− where
192− toReference :: Node -> [(ModuleIdentifier, String)]
193− toReference (JSMemberDot [ mn ] _ nm)
194− | JSIdentifier mn' <- node mn
195− , JSIdentifier nm' <- node nm
196− , Just mid <- lookup mn' imports
197− = [(mid, nm')]
198− toReference (JSMemberSquare [ mn ] _ nm _)
199− | JSIdentifier mn' <- node mn
200− , JSExpression [ s ] <- node nm
201− , JSStringLiteral _ nm' <- node s
202− , Just mid <- lookup mn' imports
203− = [(mid, nm')]
204− toReference (JSIdentifier nm)
205− | nm `elem` boundNames
206− = [(m, nm)]
207− toReference _ = []
208−
209−-- | Attempt to create a Module from a Javascript AST.
210−--
211−-- Each type of module element is matched using pattern guards, and everything else is bundled into the
212−-- Other constructor.
213−toModule :: forall m. (Applicative m, MonadError ErrorMessage m) => S.Set String -> ModuleIdentifier -> JSNode -> m Module
214−toModule mids mid top
215− | JSSourceElementsTop ns <- node top = Module mid <$> mapM toModuleElement ns
216− | otherwise = err InvalidTopLevel
217− where
218− err = throwError . ErrorInModule mid
219−
220− toModuleElement :: JSNode -> m ModuleElement
221− toModuleElement n
222− | JSVariables var [ varIntro ] _ <- node n
223− , JSLiteral "var" <- node var
224− , JSVarDecl impN [ eq, req, impP ] <- node varIntro
225− , JSIdentifier importName <- node impN
226− , JSLiteral "=" <- node eq
227− , JSIdentifier "require" <- node req
228− , JSArguments _ [ impS ] _ <- node impP
229− , JSStringLiteral _ importPath <- node impS
230− , Just importPath' <- checkImportPath importPath mid mids
231− = pure (Require n importName importPath')
232− toModuleElement n
233− | JSVariables var [ varIntro ] _ <- node n
234− , JSLiteral "var" <- node var
235− , JSVarDecl declN (eq : decl) <- node varIntro
236− , JSIdentifier name <- node declN
237− , JSLiteral "=" <- node eq
238− = pure (Member n False name decl [])
239− toModuleElement n
240− | JSExpression (e : op : decl) <- node n
241− , Just name <- accessor (node e)
242− , JSOperator eq <- node op
243− , JSLiteral "=" <- node eq
244− = pure (Member n True name decl [])
245− where
246− accessor :: Node -> Maybe String
247− accessor (JSMemberDot [ exports ] _ nm)
248− | JSIdentifier "exports" <- node exports
249− , JSIdentifier name <- node nm
250− = Just name
251− accessor (JSMemberSquare [ exports ] _ nm _)
252− | JSIdentifier "exports" <- node exports
253− , JSExpression [e] <- node nm
254− , JSStringLiteral _ name <- node e
255− = Just name
256− accessor _ = Nothing
257− toModuleElement n
258− | JSExpression (mnExp : op : obj: _) <- node n
259− , JSMemberDot [ mn ] _ e <- node mnExp
260− , JSIdentifier "module" <- node mn
261− , JSIdentifier "exports" <- node e
262− , JSOperator eq <- node op
263− , JSLiteral "=" <- node eq
264− , JSObjectLiteral _ props _ <- node obj
265− = ExportsList <$> mapM toExport (filter (not . isSeparator) (map node props))
266− where
267− toExport :: Node -> m (ExportType, String, JSNode, [Key])
268− toExport (JSPropertyNameandValue name _ [val] ) =
269− (,,val,[]) <$> exportType (node val)
270− <*> extractLabel (node name)
271− toExport _ = err UnsupportedExport
272−
273− exportType :: Node -> m ExportType
274− exportType (JSMemberDot [f] _ _)
275− | JSIdentifier "$foreign" <- node f
276− = pure ForeignReexport
277− exportType (JSMemberSquare [f] _ _ _)
278− | JSIdentifier "$foreign" <- node f
279− = pure ForeignReexport
280− exportType (JSIdentifier s) = pure (RegularExport s)
281− exportType _ = err UnsupportedExport
282−
283− extractLabel :: Node -> m String
284− extractLabel (JSStringLiteral _ nm) = pure nm
285− extractLabel (JSIdentifier nm) = pure nm
286− extractLabel _ = err UnsupportedExport
287−
288− isSeparator :: Node -> Bool
289− isSeparator (JSLiteral ",") = True
290− isSeparator _ = False
291− toModuleElement other = pure (Other other)
292−
293−-- | Eliminate unused code based on the specified entry point set.
294−compile :: [Module] -> [ModuleIdentifier] -> [Module]
295−compile modules [] = modules
296−compile modules entryPoints = filteredModules
297− where
298− (graph, _, vertexFor) = graphFromEdges verts
299−
300− -- | The vertex set
301− verts :: [(ModuleElement, Key, [Key])]
302− verts = do
303− Module mid els <- modules
304− concatMap (toVertices mid) els
305− where
306− -- | Create a set of vertices for a module element.
307− --
308− -- Some special cases worth commenting on:
309− --
310− -- 1) Regular exports which simply export their own name do not count as dependencies.
311− -- Regular exports which rename and reexport an operator do count, however.
312− --
313− -- 2) Require statements don't contribute towards dependencies, since they effectively get
314− -- inlined wherever they are used inside other module elements.
315− toVertices :: ModuleIdentifier -> ModuleElement -> [(ModuleElement, Key, [Key])]
316− toVertices p m@(Member _ _ nm _ deps) = [(m, (p, nm), deps)]
317− toVertices p m@(ExportsList exps) = mapMaybe toVertex exps
318− where
319− toVertex (ForeignReexport, nm, _, ks) = Just (m, (p, nm), ks)
320− toVertex (RegularExport nm, nm1, _, ks) | nm /= nm1 = Just (m, (p, nm1), ks)
321− toVertex _ = Nothing
322− toVertices _ _ = []
323−
324− -- | The set of vertices whose connected components we are interested in keeping.
325− entryPointVertices :: [Vertex]
326− entryPointVertices = catMaybes $ do
327− (_, k@(mid, _), _) <- verts
328− guard $ mid `elem` entryPoints
329− return (vertexFor k)
330−
331− -- | The set of vertices reachable from an entry point
332− reachableSet :: S.Set Vertex
333− reachableSet = S.fromList (concatMap (reachable graph) entryPointVertices)
334−
335− filteredModules :: [Module]
336− filteredModules = map filterUsed modules
337− where
338− filterUsed :: Module -> Module
339− filterUsed (Module mid ds) = Module mid (map filterExports (go ds))
340− where
341− go :: [ModuleElement] -> [ModuleElement]
342− go [] = []
343− go (d : Other semi : rest)
344− | JSLiteral ";" <- node semi
345− , not (isDeclUsed d)
346− = go rest
347− go (d : rest)
348− | not (isDeclUsed d) = go rest
349− | otherwise = d : go rest
350−
351− -- | Filter out the exports for members which aren't used.
352− filterExports :: ModuleElement -> ModuleElement
353− filterExports (ExportsList exps) = ExportsList (filter (\(_, nm, _, _) -> isKeyUsed (mid, nm)) exps)
354− filterExports me = me
355−
356− isDeclUsed :: ModuleElement -> Bool
357− isDeclUsed (Member _ _ nm _ _) = isKeyUsed (mid, nm)
358− isDeclUsed _ = True
359−
360− isKeyUsed :: Key -> Bool
361− isKeyUsed k
362− | Just me <- vertexFor k = me `S.member` reachableSet
363− | otherwise = False
364−
365−-- | Topologically sort the module dependency graph, so that when we generate code, modules can be
366−-- defined in the right order.
367−sortModules :: [Module] -> [Module]
368−sortModules modules = map (\v -> case nodeFor v of (n, _, _) -> n) (reverse (topSort graph))
369− where
370− (graph, nodeFor, _) = graphFromEdges $ do
371− m@(Module mid els) <- modules
372− return (m, mid, mapMaybe getKey els)
373−
374− getKey :: ModuleElement -> Maybe ModuleIdentifier
375− getKey (Require _ _ mi) = Just mi
376− getKey _ = Nothing
377−
378−-- | A module is empty if it contains no exported members (in other words,
379−-- if the only things left after dead code elimination are module imports and
380−-- "other" foreign code).
381−--
382−-- If a module is empty, we don't want to generate code for it.
383−isModuleEmpty :: Module -> Bool
384−isModuleEmpty (Module _ els) = all isElementEmpty els
385− where
386− isElementEmpty :: ModuleElement -> Bool
387− isElementEmpty (ExportsList exps) = null exps
388− isElementEmpty Require{} = True
389− isElementEmpty (Other _) = True
390− isElementEmpty _ = False
391−
392−-- | Generate code for a set of modules, including a call to main().
393−--
394−-- Modules get defined on the global PS object, as follows:
395−--
396−-- var PS = { };
397−-- (function(exports) {
398−-- ...
399−-- })(PS["Module.Name"] = PS["Module.Name"] || {});
400−--
401−-- In particular, a module and its foreign imports share the same namespace inside PS.
402−-- This saves us from having to generate unique names for a module and its foreign imports,
403−-- and is safe since a module shares a namespace with its foreign imports in PureScript as well
404−-- (so there is no way to have overlaps in code generated by psc).
405−codeGen :: Maybe String -- ^ main module
406− -> String -- ^ namespace
407− -> [Module] -- ^ input modules
408− -> String
409−codeGen optionsMainModule optionsNamespace ms = renderToString (NN (JSSourceElementsTop (prelude ++ concatMap moduleToJS ms ++ maybe [] runMain optionsMainModule)))
410− where
411− moduleToJS :: Module -> [JSNode]
412− moduleToJS (Module mn ds) = wrap (moduleName mn) (indent (concatMap declToJS ds))
413− where
414− declToJS :: ModuleElement -> [JSNode]
415− declToJS (Member n _ _ _ _) = [n]
416− declToJS (Other n) = [n]
417− declToJS (Require _ nm req) =
418− [ NN (JSVariables (NT (JSLiteral "var") tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n " ])
419− [ NN (JSVarDecl (sp (JSIdentifier nm))
420− [ sp (JSLiteral "=")
421− , moduleReference sp (moduleName req)
422− ])
423− ]
424− (nt (JSLiteral ";"))) ]
425− declToJS (ExportsList exps) = map toExport exps
426−
427− where
428− toExport :: (ExportType, String, JSNode, [Key]) -> JSNode
429− toExport (_, nm, val, _) =
430− NN (JSExpression [ NN (JSMemberSquare [ NT (JSIdentifier "exports") tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n " ] ]
431− (nt (JSLiteral "["))
432− (NN (JSExpression [ nt (JSStringLiteral '"' nm) ]))
433− (nt (JSLiteral "]")))
434− , NN (JSOperator (sp (JSLiteral "=")))
435− , reindent val
436− , nt (JSLiteral ";")
437− ])
438−
439− reindent :: JSNode -> JSNode
440− reindent (NT n _ _) = sp n
441− reindent nn = nn
442−
443− indent :: [JSNode] -> [JSNode]
444− indent = everywhere (mkT squash)
445− where
446− squash (NT n pos ann) = NT n (keepCol pos) (map splat ann)
447− squash nn = nn
448−
449− splat (CommentA pos s) = CommentA (keepCol pos) s
450− splat (WhiteSpace pos w) = WhiteSpace (keepCol pos) w
451− splat ann = ann
452−
453− keepCol (TokenPn _ _ c) = TokenPn 0 0 (c + 2)
454−
455− prelude :: [JSNode]
456− prelude =
457− [ NN (JSVariables (NT (JSLiteral "var") tokenPosnEmpty [ CommentA tokenPosnEmpty ("// Generated by psc-bundle " ++ showVersion Paths.version)
458− , WhiteSpace tokenPosnEmpty "\n"
459− ])
460− [ NN (JSVarDecl (sp (JSIdentifier optionsNamespace))
461− [ sp (JSLiteral "=")
462− , NN (JSObjectLiteral (sp (JSLiteral "{"))
463− []
464− (sp (JSLiteral "}")))
465− ])
466− ]
467− (nt (JSLiteral ";")))
468− , lf
469− ]
470−
471− moduleReference :: (Node -> JSNode) -> String -> JSNode
472− moduleReference f mn =
473− NN (JSMemberSquare [ f (JSIdentifier optionsNamespace) ]
474− (nt (JSLiteral "["))
475− (NN (JSExpression [ nt (JSStringLiteral '"' mn) ]))
476− (nt (JSLiteral "]")))
477−
478− wrap :: String -> [JSNode] -> [JSNode]
479− wrap mn ds =
480− [ NN (JSExpression [ NN (JSExpressionParen (nt (JSLiteral "("))
481− (NN (JSExpression [ NN (JSFunctionExpression (nt (JSLiteral "function"))
482− []
483− (nt (JSLiteral "(") ) [nt (JSIdentifier "exports")] (nt (JSLiteral ")"))
484− (NN (JSBlock [sp (JSLiteral "{")]
485− (lf : ds)
486− [nl (JSLiteral "}")])))]))
487− (nt (JSLiteral ")")))
488− , NN (JSArguments (nt (JSLiteral "("))
489− [ NN (JSExpression [ moduleReference nt mn
490− , NN (JSOperator (sp (JSLiteral "=")))
491− , NN (JSExpressionBinary "||"
492− [ moduleReference sp mn ]
493− (sp (JSLiteral "||"))
494− [ emptyObj ])
495− ])
496− ]
497− (nt (JSLiteral ")")))
498− ])
499− , nt (JSLiteral ";")
500− , lf
501− ]
502− where
503− emptyObj = NN (JSObjectLiteral (sp (JSLiteral "{")) [] (nt (JSLiteral "}")))
504−
505− runMain :: String -> [JSNode]
506− runMain mn =
507− [ NN (JSExpression [ NN (JSMemberDot [ NN (JSMemberSquare [ nl (JSIdentifier optionsNamespace) ]
508− (nt (JSLiteral "["))
509− (NN (JSExpression [ nt (JSStringLiteral '"' mn) ]))
510− (nt (JSLiteral "]")))
511− ]
512− (nt (JSLiteral "."))
513− (nt (JSIdentifier "main")))
514− , NN (JSArguments (nt (JSLiteral "(")) [] (nt (JSLiteral ")")))
515− ])
516− , nt (JSLiteral ";")
517− ]
518−
519− nt :: Node -> JSNode
520− nt n = NT n tokenPosnEmpty []
521−
522− lf :: JSNode
523− lf = NT (JSLiteral "") tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n" ]
524−
525− sp :: Node -> JSNode
526− sp n = NT n tokenPosnEmpty [ WhiteSpace tokenPosnEmpty " " ]
527−
528− nl :: Node -> JSNode
529− nl n = NT n tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n" ]
530−
531−-- | The bundling function.
532−-- This function performs dead code elimination, filters empty modules
533−-- and generates and prints the final Javascript bundle.
534−bundle :: forall m. (Applicative m, MonadError ErrorMessage m)
535− => [(ModuleIdentifier, String)] -- ^ The input modules. Each module should be javascript rendered from 'Language.PureScript.Make' or @psc@.
536− -> [ModuleIdentifier] -- ^ Entry points. These module identifiers are used as the roots for dead-code elimination
537− -> Maybe String -- ^ An optional main module.
538− -> String -- ^ The namespace (e.g. PS).
539− -> m String
540−bundle inputStrs entryPoints mainModule namespace = do
541− input <- forM inputStrs $ \(ident, js) -> do
542− ast <- either (throwError . ErrorInModule ident . UnableToParseModule) pure $ parse js (moduleName ident)
543− return (ident, ast)
544−
545− let mids = S.fromList (map (moduleName . fst) input)
546−
547− modules <- mapM (fmap withDeps . uncurry (toModule mids)) input
548−
549− let compiled = compile modules entryPoints
550− sorted = sortModules (filter (not . isModuleEmpty) compiled)
551−
552− return (codeGen mainModule namespace sorted)
src/Language/PureScript/CodeGen.hsdeleted−20
@@ -1,20 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- A collection of modules related to code generation:
13−--
14−-- [@Language.PureScript.CodeGen.JS@] Code generator for Javascript
15−--
16−-----------------------------------------------------------------------------
17−
18−module Language.PureScript.CodeGen (module C) where
19−
20−import Language.PureScript.CodeGen.JS as C
src/Language/PureScript/CodeGen/JS.hsdeleted−363
@@ -1,363 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- This module generates code in the simplified Javascript intermediate representation from Purescript code
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE GADTs #-}
17−{-# LANGUAGE ViewPatterns #-}
18−{-# LANGUAGE FlexibleContexts #-}
19−{-# LANGUAGE ScopedTypeVariables #-}
20−{-# LANGUAGE CPP #-}
21−
22−module Language.PureScript.CodeGen.JS
23− ( module AST
24− , module Common
25− , moduleToJs
26− , mainCall
27− ) where
28−
29−import Data.List ((\\), delete, intersect)
30−import Data.Maybe (isNothing)
31−import qualified Data.Traversable as T (traverse)
32−
33−#if __GLASGOW_HASKELL__ < 710
34−import Control.Applicative
35−#endif
36−import Control.Arrow ((&&&))
37−import Control.Monad (replicateM, forM)
38−import Control.Monad.Reader (MonadReader, asks)
39−import Control.Monad.Supply.Class
40−
41−import Language.PureScript.AST.SourcePos
42−import Language.PureScript.CodeGen.JS.AST as AST
43−import Language.PureScript.CodeGen.JS.Common as Common
44−import Language.PureScript.CoreFn
45−import Language.PureScript.Names
46−import Language.PureScript.CodeGen.JS.Optimizer
47−import Language.PureScript.Options
48−import Language.PureScript.Traversals (sndM)
49−import qualified Language.PureScript.Constants as C
50−
51−import System.FilePath.Posix ((</>))
52−
53−-- |
54−-- Generate code in the simplified Javascript intermediate representation for all declarations in a
55−-- module.
56−--
57−moduleToJs :: forall m. (Applicative m, Monad m, MonadReader Options m, MonadSupply m)
58− => Module Ann -> Maybe JS -> m [JS]
59−moduleToJs (Module coms mn imps exps foreigns decls) foreign_ = do
60− jsImports <- T.traverse importToJs . delete (ModuleName [ProperName C.prim]) . (\\ [mn]) $ imps
61− jsDecls <- mapM bindToJs decls
62− optimized <- T.traverse (T.traverse optimize) jsDecls
63− comments <- not <$> asks optionsNoComments
64− let strict = JSStringLiteral "use strict"
65− let header = if comments && not (null coms) then JSComment coms strict else strict
66− let foreign' = [JSVariableIntroduction "$foreign" foreign_ | not $ null foreigns || isNothing foreign_]
67− let moduleBody = header : foreign' ++ jsImports ++ concat optimized
68− let foreignExps = exps `intersect` (fst `map` foreigns)
69− let standardExps = exps \\ foreignExps
70− let exps' = JSObjectLiteral $ map (runIdent &&& JSVar . identToJs) standardExps
71− ++ map (runIdent &&& foreignIdent) foreignExps
72− return $ moduleBody ++ [JSAssignment (JSAccessor "exports" (JSVar "module")) exps']
73−
74− where
75−
76− -- |
77− -- Generates Javascript code for a module import.
78− --
79− importToJs :: ModuleName -> m JS
80− importToJs mn' = do
81− path <- asks optionsRequirePath
82− let moduleBody = JSApp (JSVar "require") [JSStringLiteral (maybe id (</>) path $ runModuleName mn')]
83− return $ JSVariableIntroduction (moduleNameToJs mn') (Just moduleBody)
84−
85− -- |
86− -- Generate code in the simplified Javascript intermediate representation for a declaration
87− --
88− bindToJs :: Bind Ann -> m [JS]
89− bindToJs (NonRec ident val) = return <$> nonRecToJS ident val
90− bindToJs (Rec vals) = forM vals (uncurry nonRecToJS)
91−
92− -- |
93− -- Generate code in the simplified Javascript intermediate representation for a single non-recursive
94− -- declaration.
95− --
96− -- The main purpose of this function is to handle code generation for comments.
97− --
98− nonRecToJS :: Ident -> Expr Ann -> m JS
99− nonRecToJS i e@(extractAnn -> (_, com, _, _)) | not (null com) = do
100− withoutComment <- asks optionsNoComments
101− if withoutComment
102− then nonRecToJS i (modifyAnn removeComments e)
103− else JSComment com <$> nonRecToJS i (modifyAnn removeComments e)
104− nonRecToJS ident val = do
105− js <- valueToJs val
106− return $ JSVariableIntroduction (identToJs ident) (Just js)
107−
108− -- |
109− -- Generate code in the simplified Javascript intermediate representation for a variable based on a
110− -- PureScript identifier.
111− --
112− var :: Ident -> JS
113− var = JSVar . identToJs
114−
115− -- |
116− -- Generate code in the simplified Javascript intermediate representation for an accessor based on
117− -- a PureScript identifier. If the name is not valid in Javascript (symbol based, reserved name) an
118− -- indexer is returned.
119− --
120− accessor :: Ident -> JS -> JS
121− accessor (Ident prop) = accessorString prop
122− accessor (Op op) = JSIndexer (JSStringLiteral op)
123−
124− accessorString :: String -> JS -> JS
125− accessorString prop | identNeedsEscaping prop = JSIndexer (JSStringLiteral prop)
126− | otherwise = JSAccessor prop
127−
128− -- |
129− -- Generate code in the simplified Javascript intermediate representation for a value or expression.
130− --
131− valueToJs :: Expr Ann -> m JS
132− valueToJs (Literal _ l) =
133− literalToValueJS l
134− valueToJs (Var (_, _, _, Just (IsConstructor _ [])) name) =
135− return $ JSAccessor "value" $ qualifiedToJS id name
136− valueToJs (Var (_, _, _, Just (IsConstructor _ _)) name) =
137− return $ JSAccessor "create" $ qualifiedToJS id name
138− valueToJs (Accessor _ prop val) =
139− accessorString prop <$> valueToJs val
140− valueToJs (ObjectUpdate _ o ps) = do
141− obj <- valueToJs o
142− sts <- mapM (sndM valueToJs) ps
143− extendObj obj sts
144− valueToJs e@(Abs (_, _, _, Just IsTypeClassConstructor) _ _) =
145− let args = unAbs e
146− in return $ JSFunction Nothing (map identToJs args) (JSBlock $ map assign args)
147− where
148− unAbs :: Expr Ann -> [Ident]
149− unAbs (Abs _ arg val) = arg : unAbs val
150− unAbs _ = []
151− assign :: Ident -> JS
152− assign name = JSAssignment (accessorString (runIdent name) (JSVar "this"))
153− (var name)
154− valueToJs (Abs _ arg val) = do
155− ret <- valueToJs val
156− return $ JSFunction Nothing [identToJs arg] (JSBlock [JSReturn ret])
157− valueToJs e@App{} = do
158− let (f, args) = unApp e []
159− args' <- mapM valueToJs args
160− case f of
161− Var (_, _, _, Just IsNewtype) _ -> return (head args')
162− Var (_, _, _, Just (IsConstructor _ fields)) name | length args == length fields ->
163− return $ JSUnary JSNew $ JSApp (qualifiedToJS id name) args'
164− Var (_, _, _, Just IsTypeClassConstructor) name ->
165− return $ JSUnary JSNew $ JSApp (qualifiedToJS id name) args'
166− _ -> flip (foldl (\fn a -> JSApp fn [a])) args' <$> valueToJs f
167− where
168− unApp :: Expr Ann -> [Expr Ann] -> (Expr Ann, [Expr Ann])
169− unApp (App _ val arg) args = unApp val (arg : args)
170− unApp other args = (other, args)
171− valueToJs (Var (_, _, _, Just IsForeign) qi@(Qualified (Just mn') ident)) =
172− return $ if mn' == mn
173− then foreignIdent ident
174− else varToJs qi
175− valueToJs (Var (_, _, _, Just IsForeign) ident) =
176− error $ "Encountered an unqualified reference to a foreign ident " ++ showQualified showIdent ident
177− valueToJs (Var _ ident) =
178− return $ varToJs ident
179− valueToJs (Case (maybeSpan, _, _, _) values binders) = do
180− vals <- mapM valueToJs values
181− bindersToJs maybeSpan binders vals
182− valueToJs (Let _ ds val) = do
183− ds' <- concat <$> mapM bindToJs ds
184− ret <- valueToJs val
185− return $ JSApp (JSFunction Nothing [] (JSBlock (ds' ++ [JSReturn ret]))) []
186− valueToJs (Constructor (_, _, _, Just IsNewtype) _ (ProperName ctor) _) =
187− return $ JSVariableIntroduction ctor (Just $
188− JSObjectLiteral [("create",
189− JSFunction Nothing ["value"]
190− (JSBlock [JSReturn $ JSVar "value"]))])
191− valueToJs (Constructor _ _ (ProperName ctor) []) =
192− return $ iife ctor [ JSFunction (Just ctor) [] (JSBlock [])
193− , JSAssignment (JSAccessor "value" (JSVar ctor))
194− (JSUnary JSNew $ JSApp (JSVar ctor) []) ]
195− valueToJs (Constructor _ _ (ProperName ctor) fields) =
196− let constructor =
197− let body = [ JSAssignment (JSAccessor (identToJs f) (JSVar "this")) (var f) | f <- fields ]
198− in JSFunction (Just ctor) (identToJs `map` fields) (JSBlock body)
199− createFn =
200− let body = JSUnary JSNew $ JSApp (JSVar ctor) (var `map` fields)
201− in foldr (\f inner -> JSFunction Nothing [identToJs f] (JSBlock [JSReturn inner])) body fields
202− in return $ iife ctor [ constructor
203− , JSAssignment (JSAccessor "create" (JSVar ctor)) createFn
204− ]
205−
206− iife :: String -> [JS] -> JS
207− iife v exprs = JSApp (JSFunction Nothing [] (JSBlock $ exprs ++ [JSReturn $ JSVar v])) []
208−
209− literalToValueJS :: Literal (Expr Ann) -> m JS
210− literalToValueJS (NumericLiteral n) = return $ JSNumericLiteral n
211− literalToValueJS (StringLiteral s) = return $ JSStringLiteral s
212− literalToValueJS (CharLiteral c) = return $ JSStringLiteral [c]
213− literalToValueJS (BooleanLiteral b) = return $ JSBooleanLiteral b
214− literalToValueJS (ArrayLiteral xs) = JSArrayLiteral <$> mapM valueToJs xs
215− literalToValueJS (ObjectLiteral ps) = JSObjectLiteral <$> mapM (sndM valueToJs) ps
216−
217− -- |
218− -- Shallow copy an object.
219− --
220− extendObj :: JS -> [(String, JS)] -> m JS
221− extendObj obj sts = do
222− newObj <- freshName
223− key <- freshName
224− let
225− jsKey = JSVar key
226− jsNewObj = JSVar newObj
227− block = JSBlock (objAssign:copy:extend ++ [JSReturn jsNewObj])
228− objAssign = JSVariableIntroduction newObj (Just $ JSObjectLiteral [])
229− copy = JSForIn key obj $ JSBlock [JSIfElse cond assign Nothing]
230− cond = JSApp (JSAccessor "hasOwnProperty" obj) [jsKey]
231− assign = JSBlock [JSAssignment (JSIndexer jsKey jsNewObj) (JSIndexer jsKey obj)]
232− stToAssign (s, js) = JSAssignment (JSAccessor s jsNewObj) js
233− extend = map stToAssign sts
234− return $ JSApp (JSFunction Nothing [] block) []
235−
236− -- |
237− -- Generate code in the simplified Javascript intermediate representation for a reference to a
238− -- variable.
239− --
240− varToJs :: Qualified Ident -> JS
241− varToJs (Qualified Nothing ident) = var ident
242− varToJs qual = qualifiedToJS id qual
243−
244− -- |
245− -- Generate code in the simplified Javascript intermediate representation for a reference to a
246− -- variable that may have a qualified name.
247− --
248− qualifiedToJS :: (a -> Ident) -> Qualified a -> JS
249− qualifiedToJS f (Qualified (Just (ModuleName [ProperName mn'])) a) | mn' == C.prim = JSVar . runIdent $ f a
250− qualifiedToJS f (Qualified (Just mn') a) | mn /= mn' = accessor (f a) (JSVar (moduleNameToJs mn'))
251− qualifiedToJS f (Qualified _ a) = JSVar $ identToJs (f a)
252−
253− foreignIdent :: Ident -> JS
254− foreignIdent ident = accessorString (runIdent ident) (JSVar "$foreign")
255−
256− -- |
257− -- Generate code in the simplified Javascript intermediate representation for pattern match binders
258− -- and guards.
259− --
260− bindersToJs :: Maybe SourceSpan -> [CaseAlternative Ann] -> [JS] -> m JS
261− bindersToJs maybeSpan binders vals = do
262− valNames <- replicateM (length vals) freshName
263− let assignments = zipWith JSVariableIntroduction valNames (map Just vals)
264− jss <- forM binders $ \(CaseAlternative bs result) -> do
265− ret <- guardsToJs result
266− go valNames ret bs
267− return $ JSApp (JSFunction Nothing [] (JSBlock (assignments ++ concat jss ++ [JSThrow $ failedPatternError valNames])))
268− []
269− where
270− go :: [String] -> [JS] -> [Binder Ann] -> m [JS]
271− go _ done [] = return done
272− go (v:vs) done' (b:bs) = do
273− done'' <- go vs done' bs
274− binderToJs v done'' b
275− go _ _ _ = error "Invalid arguments to bindersToJs"
276−
277− failedPatternError :: [String] -> JS
278− failedPatternError names = JSUnary JSNew $ JSApp (JSVar "Error") [JSBinary Add (JSStringLiteral errorMessage) (JSArrayLiteral $ zipWith valueError names vals)]
279−
280− errorMessage :: String
281− errorMessage = "Failed pattern match" ++ maybe "" (((" at " ++ runModuleName mn ++ " ") ++) . displayStartEndPos) maybeSpan ++ ": "
282−
283− valueError :: String -> JS -> JS
284− valueError _ l@(JSNumericLiteral _) = l
285− valueError _ l@(JSStringLiteral _) = l
286− valueError _ l@(JSBooleanLiteral _) = l
287− valueError s _ = JSAccessor "name" . JSAccessor "constructor" $ JSVar s
288−
289− guardsToJs :: Either [(Guard Ann, Expr Ann)] (Expr Ann) -> m [JS]
290− guardsToJs (Left gs) = forM gs $ \(cond, val) -> do
291− cond' <- valueToJs cond
292− done <- valueToJs val
293− return $ JSIfElse cond' (JSBlock [JSReturn done]) Nothing
294− guardsToJs (Right v) = return . JSReturn <$> valueToJs v
295−
296− -- |
297− -- Generate code in the simplified Javascript intermediate representation for a pattern match
298− -- binder.
299− --
300− binderToJs :: String -> [JS] -> Binder Ann -> m [JS]
301− binderToJs _ done (NullBinder{}) = return done
302− binderToJs varName done (LiteralBinder _ l) =
303− literalToBinderJS varName done l
304− binderToJs varName done (VarBinder _ ident) =
305− return (JSVariableIntroduction (identToJs ident) (Just (JSVar varName)) : done)
306− binderToJs varName done (ConstructorBinder (_, _, _, Just IsNewtype) _ _ [b]) =
307− binderToJs varName done b
308− binderToJs varName done (ConstructorBinder (_, _, _, Just (IsConstructor ctorType fields)) _ ctor bs) = do
309− js <- go (zip fields bs) done
310− return $ case ctorType of
311− ProductType -> js
312− SumType ->
313− [JSIfElse (JSInstanceOf (JSVar varName) (qualifiedToJS (Ident . runProperName) ctor))
314− (JSBlock js)
315− Nothing]
316− where
317− go :: [(Ident, Binder Ann)] -> [JS] -> m [JS]
318− go [] done' = return done'
319− go ((field, binder) : remain) done' = do
320− argVar <- freshName
321− done'' <- go remain done'
322− js <- binderToJs argVar done'' binder
323− return (JSVariableIntroduction argVar (Just (JSAccessor (identToJs field) (JSVar varName))) : js)
324− binderToJs _ _ ConstructorBinder{} =
325− error "binderToJs: Invalid ConstructorBinder in binderToJs"
326− binderToJs varName done (NamedBinder _ ident binder) = do
327− js <- binderToJs varName done binder
328− return (JSVariableIntroduction (identToJs ident) (Just (JSVar varName)) : js)
329−
330− literalToBinderJS :: String -> [JS] -> Literal (Binder Ann) -> m [JS]
331− literalToBinderJS varName done (NumericLiteral num) =
332− return [JSIfElse (JSBinary EqualTo (JSVar varName) (JSNumericLiteral num)) (JSBlock done) Nothing]
333− literalToBinderJS varName done (CharLiteral c) =
334− return [JSIfElse (JSBinary EqualTo (JSVar varName) (JSStringLiteral [c])) (JSBlock done) Nothing]
335− literalToBinderJS varName done (StringLiteral str) =
336− return [JSIfElse (JSBinary EqualTo (JSVar varName) (JSStringLiteral str)) (JSBlock done) Nothing]
337− literalToBinderJS varName done (BooleanLiteral True) =
338− return [JSIfElse (JSVar varName) (JSBlock done) Nothing]
339− literalToBinderJS varName done (BooleanLiteral False) =
340− return [JSIfElse (JSUnary Not (JSVar varName)) (JSBlock done) Nothing]
341− literalToBinderJS varName done (ObjectLiteral bs) = go done bs
342− where
343− go :: [JS] -> [(String, Binder Ann)] -> m [JS]
344− go done' [] = return done'
345− go done' ((prop, binder):bs') = do
346− propVar <- freshName
347− done'' <- go done' bs'
348− js <- binderToJs propVar done'' binder
349− return (JSVariableIntroduction propVar (Just (accessorString prop (JSVar varName))) : js)
350− literalToBinderJS varName done (ArrayLiteral bs) = do
351− js <- go done 0 bs
352− return [JSIfElse (JSBinary EqualTo (JSAccessor "length" (JSVar varName)) (JSNumericLiteral (Left (fromIntegral $ length bs)))) (JSBlock js) Nothing]
353− where
354− go :: [JS] -> Integer -> [Binder Ann] -> m [JS]
355− go done' _ [] = return done'
356− go done' index (binder:bs') = do
357− elVar <- freshName
358− done'' <- go done' (index + 1) bs'
359− js <- binderToJs elVar done'' binder
360− return (JSVariableIntroduction elVar (Just (JSIndexer (JSNumericLiteral (Left index)) (JSVar varName))) : js)
361−
362−mainCall :: ModuleName -> String -> JS
363−mainCall mmi ns = JSApp (JSAccessor C.main (JSAccessor (moduleNameToJs mmi) (JSVar ns))) []
src/Language/PureScript/CodeGen/JS/AST.hsdeleted−349
@@ -1,349 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.AST
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Data types for the intermediate simplified-Javascript AST
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE DeriveDataTypeable #-}
17−{-# LANGUAGE CPP #-}
18−
19−module Language.PureScript.CodeGen.JS.AST where
20−
21−#if __GLASGOW_HASKELL__ < 710
22−import Control.Applicative (Applicative, (<$>), (<*>))
23−#endif
24−import Control.Monad.Identity
25−import Data.Data
26−#if __GLASGOW_HASKELL__ < 710
27−import Data.Traversable (traverse)
28−#endif
29−
30−import Language.PureScript.Comments
31−import Language.PureScript.Traversals
32−
33−-- |
34−-- Built-in unary operators
35−--
36−data UnaryOperator
37− -- |
38− -- Numeric negation
39− --
40− = Negate
41− -- |
42− -- Boolean negation
43− --
44− | Not
45− -- |
46− -- Bitwise negation
47− --
48− | BitwiseNot
49− -- |
50− -- Numeric unary \'plus\'
51− --
52− | Positive
53− -- |
54− -- Constructor
55− --
56− | JSNew deriving (Show, Read, Eq, Data, Typeable)
57−
58−-- |
59−-- Built-in binary operators
60−--
61−data BinaryOperator
62− -- |
63− -- Numeric addition
64− --
65− = Add
66− -- |
67− -- Numeric subtraction
68− --
69− | Subtract
70− -- |
71− -- Numeric multiplication
72− --
73− | Multiply
74− -- |
75− -- Numeric division
76− --
77− | Divide
78− -- |
79− -- Remainder
80− --
81− | Modulus
82− -- |
83− -- Generic equality test
84− --
85− | EqualTo
86− -- |
87− -- Generic inequality test
88− --
89− | NotEqualTo
90− -- |
91− -- Numeric less-than
92− --
93− | LessThan
94− -- |
95− -- Numeric less-than-or-equal
96− --
97− | LessThanOrEqualTo
98− -- |
99− -- Numeric greater-than
100− --
101− | GreaterThan
102− -- |
103− -- Numeric greater-than-or-equal
104− --
105− | GreaterThanOrEqualTo
106− -- |
107− -- Boolean and
108− --
109− | And
110− -- |
111− -- Boolean or
112− --
113− | Or
114− -- |
115− -- Bitwise and
116− --
117− | BitwiseAnd
118− -- |
119− -- Bitwise or
120− --
121− | BitwiseOr
122− -- |
123− -- Bitwise xor
124− --
125− | BitwiseXor
126− -- |
127− -- Bitwise left shift
128− --
129− | ShiftLeft
130− -- |
131− -- Bitwise right shift
132− --
133− | ShiftRight
134− -- |
135− -- Bitwise right shift with zero-fill
136− --
137− | ZeroFillShiftRight deriving (Show, Read, Eq, Data, Typeable)
138−
139−-- |
140−-- Data type for simplified Javascript expressions
141−--
142−data JS
143− -- |
144− -- A numeric literal
145− --
146− = JSNumericLiteral (Either Integer Double)
147− -- |
148− -- A string literal
149− --
150− | JSStringLiteral String
151− -- |
152− -- A boolean literal
153− --
154− | JSBooleanLiteral Bool
155− -- |
156− -- A unary operator application
157− --
158− | JSUnary UnaryOperator JS
159− -- |
160− -- A binary operator application
161− --
162− | JSBinary BinaryOperator JS JS
163− -- |
164− -- An array literal
165− --
166− | JSArrayLiteral [JS]
167− -- |
168− -- An array indexer expression
169− --
170− | JSIndexer JS JS
171− -- |
172− -- An object literal
173− --
174− | JSObjectLiteral [(String, JS)]
175− -- |
176− -- An object property accessor expression
177− --
178− | JSAccessor String JS
179− -- |
180− -- A function introduction (optional name, arguments, body)
181− --
182− | JSFunction (Maybe String) [String] JS
183− -- |
184− -- Function application
185− --
186− | JSApp JS [JS]
187− -- |
188− -- Variable
189− --
190− | JSVar String
191− -- |
192− -- Conditional expression
193− --
194− | JSConditional JS JS JS
195− -- |
196− -- A block of expressions in braces
197− --
198− | JSBlock [JS]
199− -- |
200− -- A variable introduction and optional initialization
201− --
202− | JSVariableIntroduction String (Maybe JS)
203− -- |
204− -- A variable assignment
205− --
206− | JSAssignment JS JS
207− -- |
208− -- While loop
209− --
210− | JSWhile JS JS
211− -- |
212− -- For loop
213− --
214− | JSFor String JS JS JS
215− -- |
216− -- ForIn loop
217− --
218− | JSForIn String JS JS
219− -- |
220− -- If-then-else statement
221− --
222− | JSIfElse JS JS (Maybe JS)
223− -- |
224− -- Return statement
225− --
226− | JSReturn JS
227− -- |
228− -- Throw statement
229− --
230− | JSThrow JS
231− -- |
232− -- Type-Of operator
233− --
234− | JSTypeOf JS
235− -- |
236− -- InstanceOf test
237− --
238− | JSInstanceOf JS JS
239− -- |
240− -- Labelled statement
241− --
242− | JSLabel String JS
243− -- |
244− -- Break statement
245− --
246− | JSBreak String
247− -- |
248− -- Continue statement
249− --
250− | JSContinue String
251− -- |
252− -- Raw Javascript (generated when parsing fails for an inline foreign import declaration)
253− --
254− | JSRaw String
255− -- |
256− -- Commented Javascript
257− --
258− | JSComment [Comment] JS deriving (Show, Read, Eq, Data, Typeable)
259−
260−--
261−-- Traversals
262−--
263−
264−everywhereOnJS :: (JS -> JS) -> JS -> JS
265−everywhereOnJS f = go
266− where
267− go :: JS -> JS
268− go (JSUnary op j) = f (JSUnary op (go j))
269− go (JSBinary op j1 j2) = f (JSBinary op (go j1) (go j2))
270− go (JSArrayLiteral js) = f (JSArrayLiteral (map go js))
271− go (JSIndexer j1 j2) = f (JSIndexer (go j1) (go j2))
272− go (JSObjectLiteral js) = f (JSObjectLiteral (map (fmap go) js))
273− go (JSAccessor prop j) = f (JSAccessor prop (go j))
274− go (JSFunction name args j) = f (JSFunction name args (go j))
275− go (JSApp j js) = f (JSApp (go j) (map go js))
276− go (JSConditional j1 j2 j3) = f (JSConditional (go j1) (go j2) (go j3))
277− go (JSBlock js) = f (JSBlock (map go js))
278− go (JSVariableIntroduction name j) = f (JSVariableIntroduction name (fmap go j))
279− go (JSAssignment j1 j2) = f (JSAssignment (go j1) (go j2))
280− go (JSWhile j1 j2) = f (JSWhile (go j1) (go j2))
281− go (JSFor name j1 j2 j3) = f (JSFor name (go j1) (go j2) (go j3))
282− go (JSForIn name j1 j2) = f (JSForIn name (go j1) (go j2))
283− go (JSIfElse j1 j2 j3) = f (JSIfElse (go j1) (go j2) (fmap go j3))
284− go (JSReturn js) = f (JSReturn (go js))
285− go (JSThrow js) = f (JSThrow (go js))
286− go (JSTypeOf js) = f (JSTypeOf (go js))
287− go (JSLabel name js) = f (JSLabel name (go js))
288− go (JSInstanceOf j1 j2) = f (JSInstanceOf (go j1) (go j2))
289− go (JSComment com j) = f (JSComment com (go j))
290− go other = f other
291−
292−everywhereOnJSTopDown :: (JS -> JS) -> JS -> JS
293−everywhereOnJSTopDown f = runIdentity . everywhereOnJSTopDownM (Identity . f)
294−
295−everywhereOnJSTopDownM :: (Applicative m, Monad m) => (JS -> m JS) -> JS -> m JS
296−everywhereOnJSTopDownM f = f >=> go
297− where
298− f' = f >=> go
299− go (JSUnary op j) = JSUnary op <$> f' j
300− go (JSBinary op j1 j2) = JSBinary op <$> f' j1 <*> f' j2
301− go (JSArrayLiteral js) = JSArrayLiteral <$> traverse f' js
302− go (JSIndexer j1 j2) = JSIndexer <$> f' j1 <*> f' j2
303− go (JSObjectLiteral js) = JSObjectLiteral <$> traverse (sndM f') js
304− go (JSAccessor prop j) = JSAccessor prop <$> f' j
305− go (JSFunction name args j) = JSFunction name args <$> f' j
306− go (JSApp j js) = JSApp <$> f' j <*> traverse f' js
307− go (JSConditional j1 j2 j3) = JSConditional <$> f' j1 <*> f' j2 <*> f' j3
308− go (JSBlock js) = JSBlock <$> traverse f' js
309− go (JSVariableIntroduction name j) = JSVariableIntroduction name <$> traverse f' j
310− go (JSAssignment j1 j2) = JSAssignment <$> f' j1 <*> f' j2
311− go (JSWhile j1 j2) = JSWhile <$> f' j1 <*> f' j2
312− go (JSFor name j1 j2 j3) = JSFor name <$> f' j1 <*> f' j2 <*> f' j3
313− go (JSForIn name j1 j2) = JSForIn name <$> f' j1 <*> f' j2
314− go (JSIfElse j1 j2 j3) = JSIfElse <$> f' j1 <*> f' j2 <*> traverse f' j3
315− go (JSReturn j) = JSReturn <$> f' j
316− go (JSThrow j) = JSThrow <$> f' j
317− go (JSTypeOf j) = JSTypeOf <$> f' j
318− go (JSLabel name j) = JSLabel name <$> f' j
319− go (JSInstanceOf j1 j2) = JSInstanceOf <$> f' j1 <*> f' j2
320− go (JSComment com j) = JSComment com <$> f' j
321− go other = f other
322−
323−everythingOnJS :: (r -> r -> r) -> (JS -> r) -> JS -> r
324−everythingOnJS (<>) f = go
325− where
326− go j@(JSUnary _ j1) = f j <> go j1
327− go j@(JSBinary _ j1 j2) = f j <> go j1 <> go j2
328− go j@(JSArrayLiteral js) = foldl (<>) (f j) (map go js)
329− go j@(JSIndexer j1 j2) = f j <> go j1 <> go j2
330− go j@(JSObjectLiteral js) = foldl (<>) (f j) (map (go . snd) js)
331− go j@(JSAccessor _ j1) = f j <> go j1
332− go j@(JSFunction _ _ j1) = f j <> go j1
333− go j@(JSApp j1 js) = foldl (<>) (f j <> go j1) (map go js)
334− go j@(JSConditional j1 j2 j3) = f j <> go j1 <> go j2 <> go j3
335− go j@(JSBlock js) = foldl (<>) (f j) (map go js)
336− go j@(JSVariableIntroduction _ (Just j1)) = f j <> go j1
337− go j@(JSAssignment j1 j2) = f j <> go j1 <> go j2
338− go j@(JSWhile j1 j2) = f j <> go j1 <> go j2
339− go j@(JSFor _ j1 j2 j3) = f j <> go j1 <> go j2 <> go j3
340− go j@(JSForIn _ j1 j2) = f j <> go j1 <> go j2
341− go j@(JSIfElse j1 j2 Nothing) = f j <> go j1 <> go j2
342− go j@(JSIfElse j1 j2 (Just j3)) = f j <> go j1 <> go j2 <> go j3
343− go j@(JSReturn j1) = f j <> go j1
344− go j@(JSThrow j1) = f j <> go j1
345− go j@(JSTypeOf j1) = f j <> go j1
346− go j@(JSLabel _ j1) = f j <> go j1
347− go j@(JSInstanceOf j1 j2) = f j <> go j1 <> go j2
348− go j@(JSComment _ j1) = f j <> go j1
349− go other = f other
src/Language/PureScript/CodeGen/JS/Common.hsdeleted−181
@@ -1,181 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.Common
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Common code generation utility functions
13−--
14−-----------------------------------------------------------------------------
15−
16−module Language.PureScript.CodeGen.JS.Common where
17−
18−import Data.Char
19−import Data.List (intercalate)
20−
21−import Language.PureScript.Names
22−
23−-- |
24−-- Convert an Ident into a valid Javascript identifier:
25−--
26−-- * Alphanumeric characters are kept unmodified.
27−--
28−-- * Reserved javascript identifiers are prefixed with '$$'.
29−--
30−-- * Symbols are prefixed with '$' followed by a symbol name or their ordinal value.
31−--
32−identToJs :: Ident -> String
33−identToJs (Ident name) | nameIsJsReserved name = "$$" ++ name
34−identToJs (Ident name) = concatMap identCharToString name
35−identToJs (Op op) = concatMap identCharToString op
36−
37−-- |
38−-- Test if a string is a valid JS identifier without escaping.
39−--
40−identNeedsEscaping :: String -> Bool
41−identNeedsEscaping s = s /= identToJs (Ident s)
42−
43−-- |
44−-- Attempts to find a human-readable name for a symbol, if none has been specified returns the
45−-- ordinal value.
46−--
47−identCharToString :: Char -> String
48−identCharToString c | isAlphaNum c = [c]
49−identCharToString '_' = "_"
50−identCharToString '.' = "$dot"
51−identCharToString '$' = "$dollar"
52−identCharToString '~' = "$tilde"
53−identCharToString '=' = "$eq"
54−identCharToString '<' = "$less"
55−identCharToString '>' = "$greater"
56−identCharToString '!' = "$bang"
57−identCharToString '#' = "$hash"
58−identCharToString '%' = "$percent"
59−identCharToString '^' = "$up"
60−identCharToString '&' = "$amp"
61−identCharToString '|' = "$bar"
62−identCharToString '*' = "$times"
63−identCharToString '/' = "$div"
64−identCharToString '+' = "$plus"
65−identCharToString '-' = "$minus"
66−identCharToString ':' = "$colon"
67−identCharToString '\\' = "$bslash"
68−identCharToString '?' = "$qmark"
69−identCharToString '@' = "$at"
70−identCharToString '\'' = "$prime"
71−identCharToString c = '$' : show (ord c)
72−
73−-- |
74−-- Checks whether an identifier name is reserved in Javascript.
75−--
76−nameIsJsReserved :: String -> Bool
77−nameIsJsReserved name =
78− name `elem` [ "abstract"
79− , "arguments"
80− , "boolean"
81− , "break"
82− , "byte"
83− , "case"
84− , "catch"
85− , "char"
86− , "class"
87− , "const"
88− , "continue"
89− , "debugger"
90− , "default"
91− , "delete"
92− , "do"
93− , "double"
94− , "else"
95− , "enum"
96− , "eval"
97− , "export"
98− , "extends"
99− , "final"
100− , "finally"
101− , "float"
102− , "for"
103− , "function"
104− , "goto"
105− , "if"
106− , "implements"
107− , "import"
108− , "in"
109− , "instanceof"
110− , "int"
111− , "interface"
112− , "let"
113− , "long"
114− , "native"
115− , "new"
116− , "null"
117− , "package"
118− , "private"
119− , "protected"
120− , "public"
121− , "return"
122− , "short"
123− , "static"
124− , "super"
125− , "switch"
126− , "synchronized"
127− , "this"
128− , "throw"
129− , "throws"
130− , "transient"
131− , "try"
132− , "typeof"
133− , "var"
134− , "void"
135− , "volatile"
136− , "while"
137− , "with"
138− , "yield" ] || properNameIsJsReserved name
139−
140−moduleNameToJs :: ModuleName -> String
141−moduleNameToJs (ModuleName pns) =
142− let name = intercalate "_" (runProperName `map` pns)
143− in if properNameIsJsReserved name then "$$" ++ name else name
144−
145−-- |
146−-- Checks whether a proper name is reserved in Javascript.
147−--
148−properNameIsJsReserved :: String -> Bool
149−properNameIsJsReserved name =
150− name `elem` [ "Infinity"
151− , "NaN"
152− , "Object"
153− , "Function"
154− , "Boolean"
155− , "Error"
156− , "EvalError"
157− , "InternalError"
158− , "RangeError"
159− , "ReferenceError"
160− , "SyntaxError"
161− , "TypeError"
162− , "URIError"
163− , "Number"
164− , "Math"
165− , "Date"
166− , "String"
167− , "RegExp"
168− , "Array"
169− , "Int8Array"
170− , "Uint8Array"
171− , "Uint8ClampedArray"
172− , "Int16Array"
173− , "Uint16Array"
174− , "Int32Array"
175− , "Uint32Array"
176− , "Float32Array"
177− , "Float64Array"
178− , "ArrayBuffer"
179− , "DataView"
180− , "JSON"
181− , "Intl" ]
src/Language/PureScript/CodeGen/JS/Optimizer.hsdeleted−92
@@ -1,92 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- This module optimizes code in the simplified-Javascript intermediate representation.
13−--
14−-- The following optimizations are supported:
15−--
16−-- * Collapsing nested blocks
17−--
18−-- * Tail call elimination
19−--
20−-- * Inlining of (>>=) and ret for the Eff monad
21−--
22−-- * Removal of unnecessary thunks
23−--
24−-- * Eta conversion
25−--
26−-- * Inlining variables
27−--
28−-- * Inline Prelude.($), Prelude.(#), Prelude.(++), Prelude.(!!)
29−--
30−-- * Inlining primitive Javascript operators
31−--
32−-----------------------------------------------------------------------------
33−
34−{-# LANGUAGE FlexibleContexts #-}
35−{-# LANGUAGE CPP #-}
36−
37−module Language.PureScript.CodeGen.JS.Optimizer (
38− optimize
39−) where
40−
41−#if __GLASGOW_HASKELL__ < 710
42−import Control.Applicative (Applicative)
43−#endif
44−import Control.Monad.Reader (MonadReader, ask, asks)
45−import Control.Monad.Supply.Class (MonadSupply)
46−
47−import Language.PureScript.CodeGen.JS.AST
48−import Language.PureScript.Options
49−import qualified Language.PureScript.Constants as C
50−
51−import Language.PureScript.CodeGen.JS.Optimizer.Common
52−import Language.PureScript.CodeGen.JS.Optimizer.TCO
53−import Language.PureScript.CodeGen.JS.Optimizer.MagicDo
54−import Language.PureScript.CodeGen.JS.Optimizer.Inliner
55−import Language.PureScript.CodeGen.JS.Optimizer.Unused
56−import Language.PureScript.CodeGen.JS.Optimizer.Blocks
57−
58−-- |
59−-- Apply a series of optimizer passes to simplified Javascript code
60−--
61−optimize :: (Monad m, MonadReader Options m, Applicative m, MonadSupply m) => JS -> m JS
62−optimize js = do
63− noOpt <- asks optionsNoOptimizations
64− if noOpt then return js else optimize' js
65−
66−optimize' :: (Monad m, MonadReader Options m, Applicative m, MonadSupply m) => JS -> m JS
67−optimize' js = do
68− opts <- ask
69− untilFixedPoint (inlineFnComposition . applyAll
70− [ collapseNestedBlocks
71− , collapseNestedIfs
72− , tco opts
73− , magicDo opts
74− , removeCodeAfterReturnStatements
75− , removeUnusedArg
76− , removeUndefinedApp
77− , unThunk
78− , etaConvert
79− , evaluateIifes
80− , inlineVariables
81− , inlineValues
82− , inlineOperator (C.prelude, (C.$)) $ \f x -> JSApp f [x]
83− , inlineOperator (C.prelude, (C.#)) $ \x f -> JSApp f [x]
84− , inlineOperator (C.dataArrayUnsafe, C.unsafeIndex) $ flip JSIndexer
85− , inlineCommonOperators ]) js
86−
87−untilFixedPoint :: (Monad m, Eq a) => (a -> m a) -> a -> m a
88−untilFixedPoint f = go
89− where
90− go a = do
91− a' <- f a
92− if a' == a then return a' else go a'
src/Language/PureScript/CodeGen/JS/Optimizer/Blocks.hsdeleted−42
@@ -1,42 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer.Blocks
4−-- Copyright : (c) Phil Freeman 2013-14
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Optimizer steps for simplifying Javascript blocks
13−--
14−-----------------------------------------------------------------------------
15−
16−module Language.PureScript.CodeGen.JS.Optimizer.Blocks
17− ( collapseNestedBlocks
18− , collapseNestedIfs
19− ) where
20−
21−import Language.PureScript.CodeGen.JS.AST
22−
23−-- |
24−-- Collapse blocks which appear nested directly below another block
25−--
26−collapseNestedBlocks :: JS -> JS
27−collapseNestedBlocks = everywhereOnJS collapse
28− where
29− collapse :: JS -> JS
30− collapse (JSBlock sts) = JSBlock (concatMap go sts)
31− collapse js = js
32− go :: JS -> [JS]
33− go (JSBlock sts) = sts
34− go s = [s]
35−
36−collapseNestedIfs :: JS -> JS
37−collapseNestedIfs = everywhereOnJS collapse
38− where
39− collapse :: JS -> JS
40− collapse (JSIfElse cond1 (JSBlock [JSIfElse cond2 body Nothing]) Nothing) =
41− JSIfElse (JSBinary And cond1 cond2) body Nothing
42− collapse js = js
src/Language/PureScript/CodeGen/JS/Optimizer/Common.hsdeleted−77
@@ -1,77 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer.Common
4−-- Copyright : (c) Phil Freeman 2013-14
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Common functions used by the various optimizer phases
13−--
14−-----------------------------------------------------------------------------
15−
16−module Language.PureScript.CodeGen.JS.Optimizer.Common where
17−
18−import Data.Maybe (fromMaybe)
19−
20−import Language.PureScript.CodeGen.JS.AST
21−
22−applyAll :: [a -> a] -> a -> a
23−applyAll = foldl1 (.)
24−
25−replaceIdent :: String -> JS -> JS -> JS
26−replaceIdent var1 js = everywhereOnJS replace
27− where
28− replace (JSVar var2) | var1 == var2 = js
29− replace other = other
30−
31−replaceIdents :: [(String, JS)] -> JS -> JS
32−replaceIdents vars = everywhereOnJS replace
33− where
34− replace v@(JSVar var) = fromMaybe v $ lookup var vars
35− replace other = other
36−
37−isReassigned :: String -> JS -> Bool
38−isReassigned var1 = everythingOnJS (||) check
39− where
40− check :: JS -> Bool
41− check (JSFunction _ args _) | var1 `elem` args = True
42− check (JSVariableIntroduction arg _) | var1 == arg = True
43− check (JSAssignment (JSVar arg) _) | var1 == arg = True
44− check (JSFor arg _ _ _) | var1 == arg = True
45− check (JSForIn arg _ _) | var1 == arg = True
46− check _ = False
47−
48−isRebound :: JS -> JS -> Bool
49−isRebound js d = any (\v -> isReassigned v d || isUpdated v d) (everythingOnJS (++) variablesOf js)
50− where
51− variablesOf (JSVar var) = [var]
52− variablesOf _ = []
53−
54−isUsed :: String -> JS -> Bool
55−isUsed var1 = everythingOnJS (||) check
56− where
57− check :: JS -> Bool
58− check (JSVar var2) | var1 == var2 = True
59− check (JSAssignment target _) | var1 == targetVariable target = True
60− check _ = False
61−
62−targetVariable :: JS -> String
63−targetVariable (JSVar var) = var
64−targetVariable (JSAccessor _ tgt) = targetVariable tgt
65−targetVariable (JSIndexer _ tgt) = targetVariable tgt
66−targetVariable _ = error "Invalid argument to targetVariable"
67−
68−isUpdated :: String -> JS -> Bool
69−isUpdated var1 = everythingOnJS (||) check
70− where
71− check :: JS -> Bool
72− check (JSAssignment target _) | var1 == targetVariable target = True
73− check _ = False
74−
75−removeFromBlock :: ([JS] -> [JS]) -> JS -> JS
76−removeFromBlock go (JSBlock sts) = JSBlock (go sts)
77−removeFromBlock _ js = js
src/Language/PureScript/CodeGen/JS/Optimizer/Inliner.hsdeleted−318
@@ -1,318 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer.Inliner
4−-- Copyright : (c) Phil Freeman 2013-14
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- This module provides basic inlining capabilities
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE CPP #-}
17−
18−module Language.PureScript.CodeGen.JS.Optimizer.Inliner (
19− inlineVariables,
20− inlineValues,
21− inlineOperator,
22− inlineCommonOperators,
23− inlineFnComposition,
24− etaConvert,
25− unThunk,
26− evaluateIifes
27−) where
28−
29−#if __GLASGOW_HASKELL__ < 710
30−import Control.Applicative (Applicative)
31−#endif
32−import Control.Monad.Supply.Class (MonadSupply, freshName)
33−import Data.Maybe (fromMaybe)
34−
35−import Language.PureScript.CodeGen.JS.AST
36−import Language.PureScript.CodeGen.JS.Common
37−import Language.PureScript.Names
38−import Language.PureScript.CodeGen.JS.Optimizer.Common
39−import qualified Language.PureScript.Constants as C
40−
41−-- TODO: Potential bug:
42−-- Shouldn't just inline this case: { var x = 0; x.toFixed(10); }
43−-- Needs to be: { 0..toFixed(10); }
44−-- Probably needs to be fixed in pretty-printer instead.
45−shouldInline :: JS -> Bool
46−shouldInline (JSVar _) = True
47−shouldInline (JSNumericLiteral _) = True
48−shouldInline (JSStringLiteral _) = True
49−shouldInline (JSBooleanLiteral _) = True
50−shouldInline (JSAccessor _ val) = shouldInline val
51−shouldInline (JSIndexer index val) = shouldInline index && shouldInline val
52−shouldInline _ = False
53−
54−etaConvert :: JS -> JS
55−etaConvert = everywhereOnJS convert
56− where
57− convert :: JS -> JS
58− convert (JSBlock [JSReturn (JSApp (JSFunction Nothing idents block@(JSBlock body)) args)])
59− | all shouldInline args &&
60− not (any (`isRebound` block) (map JSVar idents)) &&
61− not (any (`isRebound` block) args)
62− = JSBlock (map (replaceIdents (zip idents args)) body)
63− convert (JSFunction Nothing [] (JSBlock [JSReturn (JSApp fn [])])) = fn
64− convert js = js
65−
66−unThunk :: JS -> JS
67−unThunk = everywhereOnJS convert
68− where
69− convert :: JS -> JS
70− convert (JSBlock []) = JSBlock []
71− convert (JSBlock jss) =
72− case last jss of
73− JSReturn (JSApp (JSFunction Nothing [] (JSBlock body)) []) -> JSBlock $ init jss ++ body
74− _ -> JSBlock jss
75− convert js = js
76−
77−evaluateIifes :: JS -> JS
78−evaluateIifes = everywhereOnJS convert
79− where
80− convert :: JS -> JS
81− convert (JSApp (JSFunction Nothing [] (JSBlock [JSReturn ret])) []) = ret
82− convert js = js
83−
84−inlineVariables :: JS -> JS
85−inlineVariables = everywhereOnJS $ removeFromBlock go
86− where
87− go :: [JS] -> [JS]
88− go [] = []
89− go (JSVariableIntroduction var (Just js) : sts)
90− | shouldInline js && not (any (isReassigned var) sts) && not (any (isRebound js) sts) && not (any (isUpdated var) sts) =
91− go (map (replaceIdent var js) sts)
92− go (s:sts) = s : go sts
93−
94−inlineValues :: JS -> JS
95−inlineValues = everywhereOnJS convert
96− where
97− convert :: JS -> JS
98− convert (JSApp fn [dict]) | isDict semiringNumber dict && isFn fnZero fn = JSNumericLiteral (Left 0)
99− | isDict semiringNumber dict && isFn fnOne fn = JSNumericLiteral (Left 1)
100− | isDict semiringInt dict && isFn fnZero fn = JSNumericLiteral (Left 0)
101− | isDict semiringInt dict && isFn fnOne fn = JSNumericLiteral (Left 1)
102− | isDict boundedBoolean dict && isFn fnBottom fn = JSBooleanLiteral False
103− | isDict boundedBoolean dict && isFn fnTop fn = JSBooleanLiteral True
104− convert (JSApp (JSApp (JSApp fn [dict]) [x]) [y])
105− | isDict semiringInt dict && isFn fnAdd fn = JSBinary BitwiseOr (JSBinary Add x y) (JSNumericLiteral (Left 0))
106− | isDict semiringInt dict && isFn fnMultiply fn = JSBinary BitwiseOr (JSBinary Multiply x y) (JSNumericLiteral (Left 0))
107− | isDict moduloSemiringInt dict && isFn fnDivide fn = JSBinary BitwiseOr (JSBinary Divide x y) (JSNumericLiteral (Left 0))
108− | isDict ringInt dict && isFn fnSubtract fn = JSBinary BitwiseOr (JSBinary Subtract x y) (JSNumericLiteral (Left 0))
109− convert other = other
110− fnZero = (C.prelude, C.zero)
111− fnOne = (C.prelude, C.one)
112− fnBottom = (C.prelude, C.bottom)
113− fnTop = (C.prelude, C.top)
114− fnAdd = (C.prelude, (C.+))
115− fnDivide = (C.prelude, (C./))
116− fnMultiply = (C.prelude, (C.*))
117− fnSubtract = (C.prelude, (C.-))
118−
119−inlineOperator :: (String, String) -> (JS -> JS -> JS) -> JS -> JS
120−inlineOperator (m, op) f = everywhereOnJS convert
121− where
122− convert :: JS -> JS
123− convert (JSApp (JSApp op' [x]) [y]) | isOp op' = f x y
124− convert other = other
125− isOp (JSAccessor longForm (JSVar m')) = m == m' && longForm == identToJs (Op op)
126− isOp (JSIndexer (JSStringLiteral op') (JSVar m')) = m == m' && op == op'
127− isOp _ = False
128−
129−inlineCommonOperators :: JS -> JS
130−inlineCommonOperators = applyAll $
131− [ binary semiringNumber (C.+) Add
132− , binary semiringNumber (C.*) Multiply
133−
134− , binary ringNumber (C.-) Subtract
135− , unary ringNumber C.negate Negate
136− , binary ringInt (C.-) Subtract
137− , unary ringInt C.negate Negate
138−
139− , binary moduloSemiringNumber (C./) Divide
140− , binary moduloSemiringInt C.mod Modulus
141−
142− , binary eqNumber (C.==) EqualTo
143− , binary eqNumber (C./=) NotEqualTo
144− , binary eqInt (C.==) EqualTo
145− , binary eqInt (C./=) NotEqualTo
146− , binary eqString (C.==) EqualTo
147− , binary eqString (C./=) NotEqualTo
148− , binary eqBoolean (C.==) EqualTo
149− , binary eqBoolean (C./=) NotEqualTo
150−
151− , binary ordNumber (C.<) LessThan
152− , binary ordNumber (C.>) GreaterThan
153− , binary ordNumber (C.<=) LessThanOrEqualTo
154− , binary ordNumber (C.>=) GreaterThanOrEqualTo
155− , binary ordInt (C.<) LessThan
156− , binary ordInt (C.>) GreaterThan
157− , binary ordInt (C.<=) LessThanOrEqualTo
158− , binary ordInt (C.>=) GreaterThanOrEqualTo
159−
160− , binary semigroupString (C.<>) Add
161− , binary semigroupString (C.++) Add
162−
163− , binary booleanAlgebraBoolean (C.&&) And
164− , binary booleanAlgebraBoolean (C.||) Or
165− , binaryFunction booleanAlgebraBoolean C.conj And
166− , binaryFunction booleanAlgebraBoolean C.disj Or
167− , unary booleanAlgebraBoolean C.not Not
168−
169− , binary' C.dataIntBits (C..|.) BitwiseOr
170− , binary' C.dataIntBits (C..&.) BitwiseAnd
171− , binary' C.dataIntBits (C..^.) BitwiseXor
172− , binary' C.dataIntBits C.shl ShiftLeft
173− , binary' C.dataIntBits C.shr ShiftRight
174− , binary' C.dataIntBits C.zshr ZeroFillShiftRight
175− , unary' C.dataIntBits C.complement BitwiseNot
176− ] ++
177− [ fn | i <- [0..10], fn <- [ mkFn i, runFn i ] ]
178− where
179− binary :: (String, String) -> String -> BinaryOperator -> JS -> JS
180− binary dict opString op = everywhereOnJS convert
181− where
182− convert :: JS -> JS
183− convert (JSApp (JSApp (JSApp fn [dict']) [x]) [y]) | isDict dict dict' && isPreludeFn opString fn = JSBinary op x y
184− convert other = other
185− binary' :: String -> String -> BinaryOperator -> JS -> JS
186− binary' moduleName opString op = everywhereOnJS convert
187− where
188− convert :: JS -> JS
189− convert (JSApp (JSApp fn [x]) [y]) | isFn (moduleName, opString) fn = JSBinary op x y
190− convert other = other
191− binaryFunction :: (String, String) -> String -> BinaryOperator -> JS -> JS
192− binaryFunction dict fnName op = everywhereOnJS convert
193− where
194− convert :: JS -> JS
195− convert (JSApp (JSApp (JSApp fn [dict']) [x]) [y]) | isPreludeFn fnName fn && isDict dict dict' = JSBinary op x y
196− convert other = other
197− unary :: (String, String) -> String -> UnaryOperator -> JS -> JS
198− unary dict fnName op = everywhereOnJS convert
199− where
200− convert :: JS -> JS
201− convert (JSApp (JSApp fn [dict']) [x]) | isPreludeFn fnName fn && isDict dict dict' = JSUnary op x
202− convert other = other
203− unary' :: String -> String -> UnaryOperator -> JS -> JS
204− unary' moduleName fnName op = everywhereOnJS convert
205− where
206− convert :: JS -> JS
207− convert (JSApp fn [x]) | isFn (moduleName, fnName) fn = JSUnary op x
208− convert other = other
209− mkFn :: Int -> JS -> JS
210− mkFn 0 = everywhereOnJS convert
211− where
212− convert :: JS -> JS
213− convert (JSApp mkFnN [JSFunction Nothing [_] (JSBlock js)]) | isNFn C.mkFn 0 mkFnN =
214− JSFunction Nothing [] (JSBlock js)
215− convert other = other
216− mkFn n = everywhereOnJS convert
217− where
218− convert :: JS -> JS
219− convert orig@(JSApp mkFnN [fn]) | isNFn C.mkFn n mkFnN =
220− case collectArgs n [] fn of
221− Just (args, js) -> JSFunction Nothing args (JSBlock js)
222− Nothing -> orig
223− convert other = other
224− collectArgs :: Int -> [String] -> JS -> Maybe ([String], [JS])
225− collectArgs 1 acc (JSFunction Nothing [oneArg] (JSBlock js)) | length acc == n - 1 = Just (reverse (oneArg : acc), js)
226− collectArgs m acc (JSFunction Nothing [oneArg] (JSBlock [JSReturn ret])) = collectArgs (m - 1) (oneArg : acc) ret
227− collectArgs _ _ _ = Nothing
228−
229− isNFn :: String -> Int -> JS -> Bool
230− isNFn prefix n (JSVar name) = name == (prefix ++ show n)
231− isNFn prefix n (JSAccessor name (JSVar dataFunction)) | dataFunction == C.dataFunction = name == (prefix ++ show n)
232− isNFn _ _ _ = False
233−
234− runFn :: Int -> JS -> JS
235− runFn n = everywhereOnJS convert
236− where
237− convert :: JS -> JS
238− convert js = fromMaybe js $ go n [] js
239−
240− go :: Int -> [JS] -> JS -> Maybe JS
241− go 0 acc (JSApp runFnN [fn]) | isNFn C.runFn n runFnN && length acc == n = Just (JSApp fn acc)
242− go m acc (JSApp lhs [arg]) = go (m - 1) (arg : acc) lhs
243− go _ _ _ = Nothing
244−
245−-- (f <<< g $ x) = f (g x)
246−-- (f <<< g) = \x -> f (g x)
247−inlineFnComposition :: (Applicative m, MonadSupply m) => JS -> m JS
248−inlineFnComposition = everywhereOnJSTopDownM convert
249− where
250− convert :: (MonadSupply m) => JS -> m JS
251− convert (JSApp (JSApp (JSApp (JSApp fn [dict']) [x]) [y]) [z]) | isFnCompose dict' fn =
252− return $ JSApp x [JSApp y [z]]
253− convert (JSApp (JSApp (JSApp fn [dict']) [x]) [y]) | isFnCompose dict' fn = do
254− arg <- freshName
255− return $ JSFunction Nothing [arg] (JSBlock [JSReturn $ JSApp x [JSApp y [JSVar arg]]])
256− convert other = return other
257− isFnCompose :: JS -> JS -> Bool
258− isFnCompose dict' fn = isDict semigroupoidFn dict' && (isPreludeFn (C.<<<) fn || isPreludeFn C.compose fn)
259−
260−isDict :: (String, String) -> JS -> Bool
261−isDict (moduleName, dictName) (JSAccessor x (JSVar y)) = x == dictName && y == moduleName
262−isDict _ _ = False
263−
264−isFn :: (String, String) -> JS -> Bool
265−isFn (moduleName, fnName) (JSAccessor x (JSVar y)) = x == fnName && y == moduleName
266−isFn (moduleName, fnName) (JSIndexer (JSStringLiteral x) (JSVar y)) = x == fnName && y == moduleName
267−isFn _ _ = False
268−
269−isPreludeFn :: String -> JS -> Bool
270−isPreludeFn fnName = isFn (C.prelude, fnName)
271−
272−semiringNumber :: (String, String)
273−semiringNumber = (C.prelude, C.semiringNumber)
274−
275−semiringInt :: (String, String)
276−semiringInt = (C.prelude, C.semiringInt)
277−
278−ringNumber :: (String, String)
279−ringNumber = (C.prelude, C.ringNumber)
280−
281−ringInt :: (String, String)
282−ringInt = (C.prelude, C.ringInt)
283−
284−moduloSemiringNumber :: (String, String)
285−moduloSemiringNumber = (C.prelude, C.moduloSemiringNumber)
286−
287−moduloSemiringInt :: (String, String)
288−moduloSemiringInt = (C.prelude, C.moduloSemiringInt)
289−
290−eqNumber :: (String, String)
291−eqNumber = (C.prelude, C.eqNumber)
292−
293−eqInt :: (String, String)
294−eqInt = (C.prelude, C.eqInt)
295−
296−eqString :: (String, String)
297−eqString = (C.prelude, C.eqNumber)
298−
299−eqBoolean :: (String, String)
300−eqBoolean = (C.prelude, C.eqNumber)
301−
302−ordNumber :: (String, String)
303−ordNumber = (C.prelude, C.ordNumber)
304−
305−ordInt :: (String, String)
306−ordInt = (C.prelude, C.ordInt)
307−
308−semigroupString :: (String, String)
309−semigroupString = (C.prelude, C.semigroupString)
310−
311−boundedBoolean :: (String, String)
312−boundedBoolean = (C.prelude, C.boundedBoolean)
313−
314−booleanAlgebraBoolean :: (String, String)
315−booleanAlgebraBoolean = (C.prelude, C.booleanAlgebraBoolean)
316−
317−semigroupoidFn :: (String, String)
318−semigroupoidFn = (C.prelude, C.semigroupoidFn)
src/Language/PureScript/CodeGen/JS/Optimizer/MagicDo.hsdeleted−165
@@ -1,165 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer.MagicDo
4−-- Copyright : (c) Phil Freeman 2013-14
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- This module implements the "Magic Do" optimization, which inlines calls to return
13−-- and bind for the Eff monad, as well as some of its actions.
14−--
15−-----------------------------------------------------------------------------
16−
17−module Language.PureScript.CodeGen.JS.Optimizer.MagicDo (
18− magicDo
19−) where
20−
21−import Data.List (nub)
22−import Data.Maybe (fromJust, isJust)
23−
24−import Language.PureScript.CodeGen.JS.AST
25−import Language.PureScript.CodeGen.JS.Common
26−import Language.PureScript.Names
27−import Language.PureScript.Options
28−import qualified Language.PureScript.Constants as C
29−
30−magicDo :: Options -> JS -> JS
31−magicDo opts | optionsNoMagicDo opts = id
32− | otherwise = inlineST . magicDo'
33−
34−-- |
35−-- Inline type class dictionaries for >>= and return for the Eff monad
36−--
37−-- E.g.
38−--
39−-- Prelude[">>="](dict)(m1)(function(x) {
40−-- return ...;
41−-- })
42−--
43−-- becomes
44−--
45−-- function __do {
46−-- var x = m1();
47−-- ...
48−-- }
49−--
50−magicDo' :: JS -> JS
51−magicDo' = everywhereOnJS undo . everywhereOnJSTopDown convert
52− where
53− -- The name of the function block which is added to denote a do block
54− fnName = "__do"
55− -- Desugar monomorphic calls to >>= and return for the Eff monad
56− convert :: JS -> JS
57− -- Desugar return
58− convert (JSApp (JSApp ret [val]) []) | isReturn ret = val
59− -- Desugar pure
60− convert (JSApp (JSApp pure' [val]) []) | isPure pure' = val
61− -- Desugar >>
62− convert (JSApp (JSApp bind [m]) [JSFunction Nothing [] (JSBlock js)]) | isBind bind =
63− JSFunction (Just fnName) [] $ JSBlock (JSApp m [] : map applyReturns js )
64− -- Desugar >>=
65− convert (JSApp (JSApp bind [m]) [JSFunction Nothing [arg] (JSBlock js)]) | isBind bind =
66− JSFunction (Just fnName) [] $ JSBlock (JSVariableIntroduction arg (Just (JSApp m [])) : map applyReturns js)
67− -- Desugar untilE
68− convert (JSApp (JSApp f [arg]) []) | isEffFunc C.untilE f =
69− JSApp (JSFunction Nothing [] (JSBlock [ JSWhile (JSUnary Not (JSApp arg [])) (JSBlock []), JSReturn $ JSObjectLiteral []])) []
70− -- Desugar whileE
71− convert (JSApp (JSApp (JSApp f [arg1]) [arg2]) []) | isEffFunc C.whileE f =
72− JSApp (JSFunction Nothing [] (JSBlock [ JSWhile (JSApp arg1 []) (JSBlock [ JSApp arg2 [] ]), JSReturn $ JSObjectLiteral []])) []
73− convert other = other
74− -- Check if an expression represents a monomorphic call to >>= for the Eff monad
75− isBind (JSApp bindPoly [effDict]) | isBindPoly bindPoly && isEffDict C.bindEffDictionary effDict = True
76− isBind _ = False
77− -- Check if an expression represents a monomorphic call to return for the Eff monad
78− isReturn (JSApp retPoly [effDict]) | isRetPoly retPoly && isEffDict C.monadEffDictionary effDict = True
79− isReturn _ = False
80− -- Check if an expression represents a monomorphic call to pure for the Eff applicative
81− isPure (JSApp purePoly [effDict]) | isPurePoly purePoly && isEffDict C.applicativeEffDictionary effDict = True
82− isPure _ = False
83− -- Check if an expression represents the polymorphic >>= function
84− isBindPoly (JSAccessor prop (JSVar prelude)) = prelude == C.prelude && (prop `elem` map identToJs [Ident C.bind, Op (C.>>=)])
85− isBindPoly (JSIndexer (JSStringLiteral bind) (JSVar prelude)) = prelude == C.prelude && (bind `elem` [C.bind, (C.>>=)])
86− isBindPoly _ = False
87− -- Check if an expression represents the polymorphic return function
88− isRetPoly (JSAccessor returnEscaped (JSVar prelude)) = prelude == C.prelude && returnEscaped == C.returnEscaped
89− isRetPoly (JSIndexer (JSStringLiteral return') (JSVar prelude)) = prelude == C.prelude && return' == C.return
90− isRetPoly _ = False
91− -- Check if an expression represents the polymorphic pure function
92− isPurePoly (JSAccessor pure' (JSVar prelude)) = prelude == C.prelude && pure' == C.pure'
93− isPurePoly (JSIndexer (JSStringLiteral pure') (JSVar prelude)) = prelude == C.prelude && pure' == C.pure'
94− isPurePoly _ = False
95− -- Check if an expression represents a function in the Ef module
96− isEffFunc name (JSAccessor name' (JSVar eff)) = eff == C.eff && name == name'
97− isEffFunc _ _ = False
98− -- Check if an expression represents the Monad Eff dictionary
99− isEffDict name (JSVar ident) | ident == name = True
100− isEffDict name (JSAccessor prop (JSVar eff)) = eff == C.eff && prop == name
101− isEffDict _ _ = False
102− -- Remove __do function applications which remain after desugaring
103− undo :: JS -> JS
104− undo (JSReturn (JSApp (JSFunction (Just ident) [] body) [])) | ident == fnName = body
105− undo other = other
106−
107− applyReturns :: JS -> JS
108− applyReturns (JSReturn ret) = JSReturn (JSApp ret [])
109− applyReturns (JSBlock jss) = JSBlock (map applyReturns jss)
110− applyReturns (JSWhile cond js) = JSWhile cond (applyReturns js)
111− applyReturns (JSFor v lo hi js) = JSFor v lo hi (applyReturns js)
112− applyReturns (JSForIn v xs js) = JSForIn v xs (applyReturns js)
113− applyReturns (JSIfElse cond t f) = JSIfElse cond (applyReturns t) (applyReturns `fmap` f)
114− applyReturns other = other
115−
116−-- |
117−-- Inline functions in the ST module
118−--
119−inlineST :: JS -> JS
120−inlineST = everywhereOnJS convertBlock
121− where
122− -- Look for runST blocks and inline the STRefs there.
123− -- If all STRefs are used in the scope of the same runST, only using { read, write, modify }STRef then
124− -- we can be more aggressive about inlining, and actually turn STRefs into local variables.
125− convertBlock (JSApp f [arg]) | isSTFunc C.runST f =
126− let refs = nub . findSTRefsIn $ arg
127− usages = findAllSTUsagesIn arg
128− allUsagesAreLocalVars = all (\u -> let v = toVar u in isJust v && fromJust v `elem` refs) usages
129− localVarsDoNotEscape = all (\r -> length (r `appearingIn` arg) == length (filter (\u -> let v = toVar u in v == Just r) usages)) refs
130− in everywhereOnJS (convert (allUsagesAreLocalVars && localVarsDoNotEscape)) arg
131− convertBlock other = other
132− -- Convert a block in a safe way, preserving object wrappers of references,
133− -- or in a more aggressive way, turning wrappers into local variables depending on the
134− -- agg(ressive) parameter.
135− convert agg (JSApp f [arg]) | isSTFunc C.newSTRef f =
136− JSFunction Nothing [] (JSBlock [JSReturn $ if agg then arg else JSObjectLiteral [(C.stRefValue, arg)]])
137− convert agg (JSApp (JSApp f [ref]) []) | isSTFunc C.readSTRef f =
138− if agg then ref else JSAccessor C.stRefValue ref
139− convert agg (JSApp (JSApp (JSApp f [ref]) [arg]) []) | isSTFunc C.writeSTRef f =
140− if agg then JSAssignment ref arg else JSAssignment (JSAccessor C.stRefValue ref) arg
141− convert agg (JSApp (JSApp (JSApp f [ref]) [func]) []) | isSTFunc C.modifySTRef f =
142− if agg then JSAssignment ref (JSApp func [ref]) else JSAssignment (JSAccessor C.stRefValue ref) (JSApp func [JSAccessor C.stRefValue ref])
143− convert _ other = other
144− -- Check if an expression represents a function in the ST module
145− isSTFunc name (JSAccessor name' (JSVar st)) = st == C.st && name == name'
146− isSTFunc _ _ = False
147− -- Find all ST Refs initialized in this block
148− findSTRefsIn = everythingOnJS (++) isSTRef
149− where
150− isSTRef (JSVariableIntroduction ident (Just (JSApp (JSApp f [_]) []))) | isSTFunc C.newSTRef f = [ident]
151− isSTRef _ = []
152− -- Find all STRefs used as arguments to readSTRef, writeSTRef, modifySTRef
153− findAllSTUsagesIn = everythingOnJS (++) isSTUsage
154− where
155− isSTUsage (JSApp (JSApp f [ref]) []) | isSTFunc C.readSTRef f = [ref]
156− isSTUsage (JSApp (JSApp (JSApp f [ref]) [_]) []) | isSTFunc C.writeSTRef f || isSTFunc C.modifySTRef f = [ref]
157− isSTUsage _ = []
158− -- Find all uses of a variable
159− appearingIn ref = everythingOnJS (++) isVar
160− where
161− isVar e@(JSVar v) | v == ref = [e]
162− isVar _ = []
163− -- Convert a JS value to a String if it is a JSVar
164− toVar (JSVar v) = Just v
165− toVar _ = Nothing
src/Language/PureScript/CodeGen/JS/Optimizer/TCO.hsdeleted−128
@@ -1,128 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer.TCO
4−-- Copyright : (c) Phil Freeman 2013-14
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- This module implements tail call elimination.
13−--
14−-----------------------------------------------------------------------------
15−
16−module Language.PureScript.CodeGen.JS.Optimizer.TCO (tco) where
17−
18−import Data.Monoid
19−
20−import Language.PureScript.Options
21−import Language.PureScript.CodeGen.JS.AST
22−
23−-- |
24−-- Eliminate tail calls
25−--
26−tco :: Options -> JS -> JS
27−tco opts | optionsNoTco opts = id
28− | otherwise = tco'
29−
30−tco' :: JS -> JS
31−tco' = everywhereOnJS convert
32− where
33− tcoLabel :: String
34− tcoLabel = "tco"
35−
36− tcoVar :: String -> String
37− tcoVar arg = "__tco_" ++ arg
38−
39− copyVar :: String -> String
40− copyVar arg = "__copy_" ++ arg
41−
42− convert :: JS -> JS
43− convert js@(JSVariableIntroduction name (Just fn@JSFunction {})) =
44− let
45− (argss, body', replace) = collectAllFunctionArgs [] id fn
46− in case () of
47− _ | isTailCall name body' ->
48− let
49− allArgs = concat $ reverse argss
50− in
51− JSVariableIntroduction name (Just (replace (toLoop name allArgs body')))
52− | otherwise -> js
53− convert js = js
54−
55− collectAllFunctionArgs :: [[String]] -> (JS -> JS) -> JS -> ([[String]], JS, JS -> JS)
56− collectAllFunctionArgs allArgs f (JSFunction ident args (JSBlock (body@(JSReturn _):_))) =
57− collectAllFunctionArgs (args : allArgs) (\b -> f (JSFunction ident (map copyVar args) (JSBlock [b]))) body
58− collectAllFunctionArgs allArgs f (JSFunction ident args body@(JSBlock _)) =
59− (args : allArgs, body, f . JSFunction ident (map copyVar args))
60− collectAllFunctionArgs allArgs f (JSReturn (JSFunction ident args (JSBlock [body]))) =
61− collectAllFunctionArgs (args : allArgs) (\b -> f (JSReturn (JSFunction ident (map copyVar args) (JSBlock [b])))) body
62− collectAllFunctionArgs allArgs f (JSReturn (JSFunction ident args body@(JSBlock _))) =
63− (args : allArgs, body, f . JSReturn . JSFunction ident (map copyVar args))
64− collectAllFunctionArgs allArgs f body = (allArgs, body, f)
65−
66− isTailCall :: String -> JS -> Bool
67− isTailCall ident js =
68− let
69− numSelfCalls = everythingOnJS (+) countSelfCalls js
70− numSelfCallsInTailPosition = everythingOnJS (+) countSelfCallsInTailPosition js
71− numSelfCallsUnderFunctions = everythingOnJS (+) countSelfCallsUnderFunctions js
72− numSelfCallWithFnArgs = everythingOnJS (+) countSelfCallsWithFnArgs js
73− in
74− numSelfCalls > 0
75− && numSelfCalls == numSelfCallsInTailPosition
76− && numSelfCallsUnderFunctions == 0
77− && numSelfCallWithFnArgs == 0
78− where
79− countSelfCalls :: JS -> Int
80− countSelfCalls (JSApp (JSVar ident') _) | ident == ident' = 1
81− countSelfCalls _ = 0
82−
83− countSelfCallsInTailPosition :: JS -> Int
84− countSelfCallsInTailPosition (JSReturn ret) | isSelfCall ident ret = 1
85− countSelfCallsInTailPosition _ = 0
86−
87− countSelfCallsUnderFunctions :: JS -> Int
88− countSelfCallsUnderFunctions (JSFunction _ _ js') = everythingOnJS (+) countSelfCalls js'
89− countSelfCallsUnderFunctions _ = 0
90−
91− countSelfCallsWithFnArgs :: JS -> Int
92− countSelfCallsWithFnArgs ret = if isSelfCallWithFnArgs ident ret [] then 1 else 0
93−
94− toLoop :: String -> [String] -> JS -> JS
95− toLoop ident allArgs js = JSBlock $
96− map (\arg -> JSVariableIntroduction arg (Just (JSVar (copyVar arg)))) allArgs ++
97− [ JSLabel tcoLabel $ JSWhile (JSBooleanLiteral True) (JSBlock [ everywhereOnJS loopify js ]) ]
98− where
99− loopify :: JS -> JS
100− loopify (JSReturn ret) | isSelfCall ident ret =
101− let
102− allArgumentValues = concat $ collectSelfCallArgs [] ret
103− in
104− JSBlock $ zipWith (\val arg ->
105− JSVariableIntroduction (tcoVar arg) (Just val)) allArgumentValues allArgs
106− ++ map (\arg ->
107− JSAssignment (JSVar arg) (JSVar (tcoVar arg))) allArgs
108− ++ [ JSContinue tcoLabel ]
109− loopify other = other
110− collectSelfCallArgs :: [[JS]] -> JS -> [[JS]]
111− collectSelfCallArgs allArgumentValues (JSApp fn args') = collectSelfCallArgs (args' : allArgumentValues) fn
112− collectSelfCallArgs allArgumentValues _ = allArgumentValues
113−
114− isSelfCall :: String -> JS -> Bool
115− isSelfCall ident (JSApp (JSVar ident') _) = ident == ident'
116− isSelfCall ident (JSApp fn _) = isSelfCall ident fn
117− isSelfCall _ _ = False
118−
119− isSelfCallWithFnArgs :: String -> JS -> [JS] -> Bool
120− isSelfCallWithFnArgs ident (JSVar ident') args | ident == ident' && any hasFunction args = True
121− isSelfCallWithFnArgs ident (JSApp fn args) acc = isSelfCallWithFnArgs ident fn (args ++ acc)
122− isSelfCallWithFnArgs _ _ _ = False
123−
124− hasFunction :: JS -> Bool
125− hasFunction = getAny . everythingOnJS mappend (Any . isFunction)
126− where
127− isFunction JSFunction{} = True
128− isFunction _ = False
src/Language/PureScript/CodeGen/JS/Optimizer/Unused.hsdeleted−46
@@ -1,46 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer.Unused
4−-- Copyright : (c) Phil Freeman 2013-14
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Removes unused variables
13−--
14−-----------------------------------------------------------------------------
15−
16−module Language.PureScript.CodeGen.JS.Optimizer.Unused
17− ( removeCodeAfterReturnStatements
18− , removeUnusedArg
19− , removeUndefinedApp
20− ) where
21−
22−import Language.PureScript.CodeGen.JS.AST
23−import Language.PureScript.CodeGen.JS.Optimizer.Common
24−
25−import qualified Language.PureScript.Constants as C
26−
27−removeCodeAfterReturnStatements :: JS -> JS
28−removeCodeAfterReturnStatements = everywhereOnJS (removeFromBlock go)
29− where
30− go :: [JS] -> [JS]
31− go jss | not (any isJSReturn jss) = jss
32− | otherwise = let (body, ret : _) = break isJSReturn jss in body ++ [ret]
33− isJSReturn (JSReturn _) = True
34− isJSReturn _ = False
35−
36−removeUnusedArg :: JS -> JS
37−removeUnusedArg = everywhereOnJS convert
38− where
39− convert (JSFunction name [arg] body) | arg == C.__unused = JSFunction name [] body
40− convert js = js
41−
42−removeUndefinedApp :: JS -> JS
43−removeUndefinedApp = everywhereOnJS convert
44− where
45− convert (JSApp fn [JSVar arg]) | arg == C.undefined = JSApp fn []
46− convert js = js
src/Language/PureScript/Comments.hsdeleted−29
@@ -1,29 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.Parser.Comments
4−-- Copyright : (c) Phil Freeman 2015
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Defines the types of source code comments
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE DeriveDataTypeable #-}
17−{-# LANGUAGE TemplateHaskell #-}
18−
19−module Language.PureScript.Comments where
20−
21−import Data.Aeson.TH
22−import qualified Data.Data as D
23−
24−data Comment
25− = LineComment String
26− | BlockComment String
27− deriving (Show, Read, Eq, Ord, D.Data, D.Typeable)
28−
29−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''Comment)
src/Language/PureScript/Constants.hsdeleted−292
@@ -1,292 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.Constants
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Various constants which refer to things in the Prelude
13−--
14−-----------------------------------------------------------------------------
15−
16−module Language.PureScript.Constants where
17−
18−-- Operators
19−
20−($) :: String
21−($) = "$"
22−
23−(#) :: String
24−(#) = "#"
25−
26−(<>) :: String
27−(<>) = "<>"
28−
29−(++) :: String
30−(++) = "++"
31−
32−(>>=) :: String
33−(>>=) = ">>="
34−
35−(+) :: String
36−(+) = "+"
37−
38−(-) :: String
39−(-) = "-"
40−
41−(*) :: String
42−(*) = "*"
43−
44−(/) :: String
45−(/) = "/"
46−
47−(%) :: String
48−(%) = "%"
49−
50−(<) :: String
51−(<) = "<"
52−
53−(>) :: String
54−(>) = ">"
55−
56−(<=) :: String
57−(<=) = "<="
58−
59−(>=) :: String
60−(>=) = ">="
61−
62−(==) :: String
63−(==) = "=="
64−
65−(/=) :: String
66−(/=) = "/="
67−
68−(&&) :: String
69−(&&) = "&&"
70−
71−(||) :: String
72−(||) = "||"
73−
74−bind :: String
75−bind = "bind"
76−
77−unsafeIndex :: String
78−unsafeIndex = "unsafeIndex"
79−
80−(.|.) :: String
81−(.|.) = ".|."
82−
83−(.&.) :: String
84−(.&.) = ".&."
85−
86−(.^.) :: String
87−(.^.) = ".^."
88−
89−(<<<) :: String
90−(<<<) = "<<<"
91−
92−compose :: String
93−compose = "compose"
94−
95−-- Functions
96−
97−negate :: String
98−negate = "negate"
99−
100−not :: String
101−not = "not"
102−
103−conj :: String
104−conj = "conj"
105−
106−disj :: String
107−disj = "disj"
108−
109−mod :: String
110−mod = "mod"
111−
112−shl :: String
113−shl = "shl"
114−
115−shr :: String
116−shr = "shr"
117−
118−zshr :: String
119−zshr = "zshr"
120−
121−complement :: String
122−complement = "complement"
123−
124−-- Prelude Values
125−
126−zero :: String
127−zero = "zero"
128−
129−one :: String
130−one = "one"
131−
132−bottom :: String
133−bottom = "bottom"
134−
135−top :: String
136−top = "top"
137−
138−return :: String
139−return = "return"
140−
141−pure' :: String
142−pure' = "pure"
143−
144−returnEscaped :: String
145−returnEscaped = "$return"
146−
147−untilE :: String
148−untilE = "untilE"
149−
150−whileE :: String
151−whileE = "whileE"
152−
153−runST :: String
154−runST = "runST"
155−
156−stRefValue :: String
157−stRefValue = "value"
158−
159−newSTRef :: String
160−newSTRef = "newSTRef"
161−
162−readSTRef :: String
163−readSTRef = "readSTRef"
164−
165−writeSTRef :: String
166−writeSTRef = "writeSTRef"
167−
168−modifySTRef :: String
169−modifySTRef = "modifySTRef"
170−
171−mkFn :: String
172−mkFn = "mkFn"
173−
174−runFn :: String
175−runFn = "runFn"
176−
177−unit :: String
178−unit = "unit"
179−
180−-- Prim values
181−
182−undefined :: String
183−undefined = "undefined"
184−
185−-- Type Class Dictionary Names
186−
187−monadEffDictionary :: String
188−monadEffDictionary = "monadEff"
189−
190−applicativeEffDictionary :: String
191−applicativeEffDictionary = "applicativeEff"
192−
193−bindEffDictionary :: String
194−bindEffDictionary = "bindEff"
195−
196−semiringNumber :: String
197−semiringNumber = "semiringNumber"
198−
199−semiringInt :: String
200−semiringInt = "semiringInt"
201−
202−ringNumber :: String
203−ringNumber = "ringNumber"
204−
205−ringInt :: String
206−ringInt = "ringInt"
207−
208−moduloSemiringNumber :: String
209−moduloSemiringNumber = "moduloSemiringNumber"
210−
211−moduloSemiringInt :: String
212−moduloSemiringInt = "moduloSemiringInt"
213−
214−ordNumber :: String
215−ordNumber = "ordNumber"
216−
217−ordInt :: String
218−ordInt = "ordInt"
219−
220−eqNumber :: String
221−eqNumber = "eqNumber"
222−
223−eqInt :: String
224−eqInt = "eqInt"
225−
226−eqString :: String
227−eqString = "eqString"
228−
229−eqBoolean :: String
230−eqBoolean = "eqBoolean"
231−
232−boundedBoolean :: String
233−boundedBoolean = "boundedBoolean"
234−
235−booleanAlgebraBoolean :: String
236−booleanAlgebraBoolean = "booleanAlgebraBoolean"
237−
238−semigroupString :: String
239−semigroupString = "semigroupString"
240−
241−semigroupoidFn :: String
242−semigroupoidFn = "semigroupoidFn"
243−
244−-- Generic Deriving
245−
246−generic :: String
247−generic = "Generic"
248−
249−toSpine :: String
250−toSpine = "toSpine"
251−
252−fromSpine :: String
253−fromSpine = "fromSpine"
254−
255−toSignature :: String
256−toSignature = "toSignature"
257−
258−-- Main module
259−
260−main :: String
261−main = "main"
262−
263−-- Code Generation
264−
265−__superclass_ :: String
266−__superclass_ = "__superclass_"
267−
268−__unused :: String
269−__unused = "__unused"
270−
271−-- Modules
272−
273−prim :: String
274−prim = "Prim"
275−
276−prelude :: String
277−prelude = "Prelude"
278−
279−dataArrayUnsafe :: String
280−dataArrayUnsafe = "Data_Array_Unsafe"
281−
282−eff :: String
283−eff = "Control_Monad_Eff"
284−
285−st :: String
286−st = "Control_Monad_ST"
287−
288−dataFunction :: String
289−dataFunction = "Data_Function"
290−
291−dataIntBits :: String
292−dataIntBits = "Data_Int_Bits"
src/Language/PureScript/CoreFn.hsdeleted−26
@@ -1,26 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The core functional representation
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.CoreFn (
16− module C
17−) where
18−
19−import Language.PureScript.CoreFn.Ann as C
20−import Language.PureScript.CoreFn.Binders as C
21−import Language.PureScript.CoreFn.Desugar as C
22−import Language.PureScript.CoreFn.Expr as C
23−import Language.PureScript.CoreFn.Literals as C
24−import Language.PureScript.CoreFn.Meta as C
25−import Language.PureScript.CoreFn.Module as C
26−import Language.PureScript.CoreFn.Traversals as C
src/Language/PureScript/CoreFn/Ann.hsdeleted−37
@@ -1,37 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Ann
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Type alias for basic annotations
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.CoreFn.Ann where
16−
17−import Language.PureScript.AST.SourcePos
18−import Language.PureScript.CoreFn.Meta
19−import Language.PureScript.Types
20−import Language.PureScript.Comments
21−
22−-- |
23−-- Type alias for basic annotations
24−--
25−type Ann = (Maybe SourceSpan, [Comment], Maybe Type, Maybe Meta)
26−
27−-- |
28−-- Initial annotation with no metadata
29−--
30−nullAnn :: Ann
31−nullAnn = (Nothing, [], Nothing, Nothing)
32−
33−-- |
34−-- Remove the comments from an annotation
35−--
36−removeComments :: Ann -> Ann
37−removeComments (ss, _, ty, meta) = (ss, [], ty, meta)
src/Language/PureScript/CoreFn/Binders.hsdeleted−48
@@ -1,48 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Binders
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The core functional representation for binders
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−{-# LANGUAGE DeriveFunctor #-}
17−
18−module Language.PureScript.CoreFn.Binders where
19−
20−import qualified Data.Data as D
21−
22−import Language.PureScript.CoreFn.Literals
23−import Language.PureScript.Names
24−
25−-- |
26−-- Data type for binders
27−--
28−data Binder a
29− -- |
30− -- Wildcard binder
31− --
32− = NullBinder a
33− -- |
34− -- A binder which matches a literal value
35− --
36− | LiteralBinder a (Literal (Binder a))
37− -- |
38− -- A binder which binds an identifier
39− --
40− | VarBinder a Ident
41− -- |
42− -- A binder which matches a data constructor (type name, constructor name, binders)
43− --
44− | ConstructorBinder a (Qualified ProperName) (Qualified ProperName) [Binder a]
45− -- |
46− -- A binder which binds its input to an identifier
47− --
48− | NamedBinder a Ident (Binder a) deriving (Show, Read, D.Data, D.Typeable, Functor)
src/Language/PureScript/CoreFn/Desugar.hsdeleted−265
@@ -1,265 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Desugar
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The AST -> CoreFn desugaring step
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.CoreFn.Desugar (moduleToCoreFn) where
16−
17−import Data.Function (on)
18−import Data.List (sort, sortBy, nub)
19−import Data.Maybe (mapMaybe)
20−import qualified Data.Map as M
21−
22−import Control.Arrow (second, (***))
23−
24−import Language.PureScript.AST.SourcePos
25−import Language.PureScript.AST.Traversals
26−import Language.PureScript.CoreFn.Ann
27−import Language.PureScript.CoreFn.Binders
28−import Language.PureScript.CoreFn.Expr
29−import Language.PureScript.CoreFn.Literals
30−import Language.PureScript.CoreFn.Meta
31−import Language.PureScript.CoreFn.Module
32−import Language.PureScript.Environment
33−import Language.PureScript.Names
34−import Language.PureScript.Sugar.TypeClasses (typeClassMemberName, superClassDictionaryNames)
35−import Language.PureScript.Types
36−import Language.PureScript.Comments
37−import qualified Language.PureScript.AST as A
38−
39−-- |
40−-- Desugars a module from AST to CoreFn representation.
41−--
42−moduleToCoreFn :: Environment -> A.Module -> Module Ann
43−moduleToCoreFn _ (A.Module _ _ _ _ Nothing) =
44− error "Module exports were not elaborated before moduleToCoreFn"
45−moduleToCoreFn env (A.Module _ coms mn decls (Just exps)) =
46− let imports = nub $ mapMaybe importToCoreFn decls ++ findQualModules decls
47− exps' = nub $ concatMap exportToCoreFn exps
48− externs = nub $ mapMaybe externToCoreFn decls
49− decls' = concatMap (declToCoreFn Nothing []) decls
50− in Module coms mn imports exps' externs decls'
51−
52− where
53−
54− -- |
55− -- Desugars member declarations from AST to CoreFn representation.
56− --
57− declToCoreFn :: Maybe SourceSpan -> [Comment] -> A.Declaration -> [Bind Ann]
58− declToCoreFn ss com (A.DataDeclaration Newtype _ _ [(ctor, _)]) =
59− [NonRec (properToIdent ctor) $
60− Abs (ss, com, Nothing, Just IsNewtype) (Ident "x") (Var nullAnn $ Qualified Nothing (Ident "x"))]
61− declToCoreFn _ _ d@(A.DataDeclaration Newtype _ _ _) =
62− error $ "Found newtype with multiple constructors: " ++ show d
63− declToCoreFn ss com (A.DataDeclaration Data tyName _ ctors) =
64− flip map ctors $ \(ctor, _) ->
65− let (_, _, _, fields) = lookupConstructor env (Qualified (Just mn) ctor)
66− in NonRec (properToIdent ctor) $ Constructor (ss, com, Nothing, Nothing) tyName ctor fields
67− declToCoreFn ss _ (A.DataBindingGroupDeclaration ds) = concatMap (declToCoreFn ss []) ds
68− declToCoreFn ss com (A.ValueDeclaration name _ _ (Right e)) =
69− [NonRec name (exprToCoreFn ss com Nothing e)]
70− declToCoreFn ss _ (A.BindingGroupDeclaration ds) =
71− [Rec $ map (\(name, _, e) -> (name, exprToCoreFn ss [] Nothing e)) ds]
72− declToCoreFn ss com (A.TypeClassDeclaration name _ supers members) =
73− [NonRec (properToIdent name) $ mkTypeClassConstructor ss com supers members]
74− declToCoreFn _ com (A.PositionedDeclaration ss com1 d) =
75− declToCoreFn (Just ss) (com ++ com1) d
76− declToCoreFn _ _ _ = []
77−
78− -- |
79− -- Desugars expressions from AST to CoreFn representation.
80− --
81− exprToCoreFn :: Maybe SourceSpan -> [Comment] -> Maybe Type -> A.Expr -> Expr Ann
82− exprToCoreFn ss com ty (A.NumericLiteral v) =
83− Literal (ss, com, ty, Nothing) (NumericLiteral v)
84− exprToCoreFn ss com ty (A.StringLiteral v) =
85− Literal (ss, com, ty, Nothing) (StringLiteral v)
86− exprToCoreFn ss com ty (A.CharLiteral v) =
87− Literal (ss, com, ty, Nothing) (CharLiteral v)
88− exprToCoreFn ss com ty (A.BooleanLiteral v) =
89− Literal (ss, com, ty, Nothing) (BooleanLiteral v)
90− exprToCoreFn ss com ty (A.ArrayLiteral vs) =
91− Literal (ss, com, ty, Nothing) (ArrayLiteral $ map (exprToCoreFn ss [] Nothing) vs)
92− exprToCoreFn ss com ty (A.ObjectLiteral vs) =
93− Literal (ss, com, ty, Nothing) (ObjectLiteral $ map (second (exprToCoreFn ss [] Nothing)) vs)
94− exprToCoreFn ss com ty (A.Accessor name v) =
95− Accessor (ss, com, ty, Nothing) name (exprToCoreFn ss [] Nothing v)
96− exprToCoreFn ss com ty (A.ObjectUpdate obj vs) =
97− ObjectUpdate (ss, com, ty, Nothing) (exprToCoreFn ss [] Nothing obj) $ map (second (exprToCoreFn ss [] Nothing)) vs
98− exprToCoreFn ss com ty (A.Abs (Left name) v) =
99− Abs (ss, com, ty, Nothing) name (exprToCoreFn ss [] Nothing v)
100− exprToCoreFn _ _ _ (A.Abs _ _) =
101− error "Abs with Binder argument was not desugared before exprToCoreFn mn"
102− exprToCoreFn ss com ty (A.App v1 v2) =
103− App (ss, com, ty, Nothing) (exprToCoreFn ss [] Nothing v1) (exprToCoreFn ss [] Nothing v2)
104− exprToCoreFn ss com ty (A.Var ident) =
105− Var (ss, com, ty, getValueMeta ident) ident
106− exprToCoreFn ss com ty (A.IfThenElse v1 v2 v3) =
107− Case (ss, com, ty, Nothing) [exprToCoreFn ss [] Nothing v1]
108− [ CaseAlternative [LiteralBinder nullAnn $ BooleanLiteral True]
109− (Right $ exprToCoreFn Nothing [] Nothing v2)
110− , CaseAlternative [LiteralBinder nullAnn $ BooleanLiteral False]
111− (Right $ exprToCoreFn Nothing [] Nothing v3) ]
112− exprToCoreFn ss com ty (A.Constructor name) =
113− Var (ss, com, ty, Just $ getConstructorMeta name) $ fmap properToIdent name
114− exprToCoreFn ss com ty (A.Case vs alts) =
115− Case (ss, com, ty, Nothing) (map (exprToCoreFn ss [] Nothing) vs) (map (altToCoreFn ss) alts)
116− exprToCoreFn ss com _ (A.TypedValue _ v ty) =
117− exprToCoreFn ss com (Just ty) v
118− exprToCoreFn ss com ty (A.Let ds v) =
119− Let (ss, com, ty, Nothing) (concatMap (declToCoreFn ss []) ds) (exprToCoreFn ss [] Nothing v)
120− exprToCoreFn ss com _ (A.TypeClassDictionaryConstructorApp name (A.TypedValue _ (A.ObjectLiteral vs) _)) =
121− let args = map (exprToCoreFn ss [] Nothing . snd) $ sortBy (compare `on` fst) vs
122− ctor = Var (ss, [], Nothing, Just IsTypeClassConstructor) (fmap properToIdent name)
123− in foldl (App (ss, com, Nothing, Nothing)) ctor args
124− exprToCoreFn ss com ty (A.TypeClassDictionaryAccessor _ ident) =
125− Abs (ss, com, ty, Nothing) (Ident "dict")
126− (Accessor nullAnn (runIdent ident) (Var nullAnn $ Qualified Nothing (Ident "dict")))
127− exprToCoreFn _ com ty (A.PositionedValue ss com1 v) =
128− exprToCoreFn (Just ss) (com ++ com1) ty v
129− exprToCoreFn _ _ _ e =
130− error $ "Unexpected value in exprToCoreFn mn: " ++ show e
131−
132− -- |
133− -- Desugars case alternatives from AST to CoreFn representation.
134− --
135− altToCoreFn :: Maybe SourceSpan -> A.CaseAlternative -> CaseAlternative Ann
136− altToCoreFn ss (A.CaseAlternative bs vs) = CaseAlternative (map (binderToCoreFn ss []) bs) (go vs)
137− where
138− go :: Either [(A.Guard, A.Expr)] A.Expr -> Either [(Guard Ann, Expr Ann)] (Expr Ann)
139− go (Left ges) = Left $ map (exprToCoreFn ss [] Nothing *** exprToCoreFn ss [] Nothing) ges
140− go (Right e) = Right (exprToCoreFn ss [] Nothing e)
141−
142− -- |
143− -- Desugars case binders from AST to CoreFn representation.
144− --
145− binderToCoreFn :: Maybe SourceSpan -> [Comment] -> A.Binder -> Binder Ann
146− binderToCoreFn ss com (A.NullBinder) =
147− NullBinder (ss, com, Nothing, Nothing)
148− binderToCoreFn ss com (A.BooleanBinder b) =
149− LiteralBinder (ss, com, Nothing, Nothing) (BooleanLiteral b)
150− binderToCoreFn ss com (A.StringBinder s) =
151− LiteralBinder (ss, com, Nothing, Nothing) (StringLiteral s)
152− binderToCoreFn ss com (A.CharBinder c) =
153− LiteralBinder (ss, com, Nothing, Nothing) (CharLiteral c)
154− binderToCoreFn ss com (A.NumberBinder n) =
155− LiteralBinder (ss, com, Nothing, Nothing) (NumericLiteral n)
156− binderToCoreFn ss com (A.VarBinder name) =
157− VarBinder (ss, com, Nothing, Nothing) name
158− binderToCoreFn ss com (A.ConstructorBinder dctor@(Qualified mn' _) bs) =
159− let (_, tctor, _, _) = lookupConstructor env dctor
160− in ConstructorBinder (ss, com, Nothing, Just $ getConstructorMeta dctor) (Qualified mn' tctor) dctor (map (binderToCoreFn ss []) bs)
161− binderToCoreFn ss com (A.ObjectBinder bs) =
162− LiteralBinder (ss, com, Nothing, Nothing) (ObjectLiteral $ map (second (binderToCoreFn ss [])) bs)
163− binderToCoreFn ss com (A.ArrayBinder bs) =
164− LiteralBinder (ss, com, Nothing, Nothing) (ArrayLiteral $ map (binderToCoreFn ss []) bs)
165− binderToCoreFn ss com (A.NamedBinder name b) =
166− NamedBinder (ss, com, Nothing, Nothing) name (binderToCoreFn ss [] b)
167− binderToCoreFn _ com (A.PositionedBinder ss com1 b) =
168− binderToCoreFn (Just ss) (com ++ com1) b
169− binderToCoreFn ss com (A.TypedBinder _ b) =
170− binderToCoreFn ss com b
171−
172− -- |
173− -- Gets metadata for values.
174− --
175− getValueMeta :: Qualified Ident -> Maybe Meta
176− getValueMeta name =
177− case lookupValue env name of
178− Just (_, External, _) -> Just IsForeign
179− _ -> Nothing
180−
181− -- |
182− -- Gets metadata for data constructors.
183− --
184− getConstructorMeta :: Qualified ProperName -> Meta
185− getConstructorMeta ctor =
186− case lookupConstructor env ctor of
187− (Newtype, _, _, _) -> IsNewtype
188− dc@(Data, _, _, fields) ->
189− let constructorType = if numConstructors (ctor, dc) == 1 then ProductType else SumType
190− in IsConstructor constructorType fields
191− where
192− numConstructors :: (Qualified ProperName, (DataDeclType, ProperName, Type, [Ident])) -> Int
193− numConstructors ty = length $ filter (((==) `on` typeConstructor) ty) $ M.toList $ dataConstructors env
194− typeConstructor :: (Qualified ProperName, (DataDeclType, ProperName, Type, [Ident])) -> (ModuleName, ProperName)
195− typeConstructor (Qualified (Just mn') _, (_, tyCtor, _, _)) = (mn', tyCtor)
196− typeConstructor _ = error "Invalid argument to typeConstructor"
197−
198−-- |
199−-- Find module names from qualified references to values. This is used to
200−-- ensure instances are imported from any module that is referenced by the
201−-- current module, not just from those that are imported explicitly (#667).
202−--
203−findQualModules :: [A.Declaration] -> [ModuleName]
204−findQualModules decls =
205− let (f, _, _, _, _) = everythingOnValues (++) (const []) fqValues fqBinders (const []) (const [])
206− in f `concatMap` decls
207− where
208− fqValues :: A.Expr -> [ModuleName]
209− fqValues (A.Var (Qualified (Just mn) _)) = [mn]
210− fqValues (A.Constructor (Qualified (Just mn) _)) = [mn]
211− fqValues _ = []
212−
213− fqBinders :: A.Binder -> [ModuleName]
214− fqBinders (A.ConstructorBinder (Qualified (Just mn) _) _) = [mn]
215− fqBinders _ = []
216−
217−-- |
218−-- Desugars import declarations from AST to CoreFn representation.
219−--
220−importToCoreFn :: A.Declaration -> Maybe ModuleName
221−importToCoreFn (A.ImportDeclaration name _ _) = Just name
222−importToCoreFn (A.PositionedDeclaration _ _ d) = importToCoreFn d
223−importToCoreFn _ = Nothing
224−
225−-- |
226−-- Desugars foreign declarations from AST to CoreFn representation.
227−--
228−externToCoreFn :: A.Declaration -> Maybe ForeignDecl
229−externToCoreFn (A.ExternDeclaration name ty) = Just (name, ty)
230−externToCoreFn (A.PositionedDeclaration _ _ d) = externToCoreFn d
231−externToCoreFn _ = Nothing
232−
233−-- |
234−-- Desugars export declarations references from AST to CoreFn representation.
235−-- CoreFn modules only export values, so all data constructors, class
236−-- constructor, instances and values are flattened into one list.
237−--
238−exportToCoreFn :: A.DeclarationRef -> [Ident]
239−exportToCoreFn (A.TypeRef _ (Just dctors)) = map properToIdent dctors
240−exportToCoreFn (A.ValueRef name) = [name]
241−exportToCoreFn (A.TypeClassRef name) = [properToIdent name]
242−exportToCoreFn (A.TypeInstanceRef name) = [name]
243−exportToCoreFn (A.PositionedDeclarationRef _ _ d) = exportToCoreFn d
244−exportToCoreFn _ = []
245−
246−-- |
247−-- Makes a typeclass dictionary constructor function. The returned expression
248−-- is a function that accepts the superclass instances and member
249−-- implementations and returns a record for the instance dictionary.
250−--
251−mkTypeClassConstructor :: Maybe SourceSpan -> [Comment] -> [Constraint] -> [A.Declaration] -> Expr Ann
252−mkTypeClassConstructor ss com [] [] = Literal (ss, com, Nothing, Just IsTypeClassConstructor) (ObjectLiteral [])
253−mkTypeClassConstructor ss com supers members =
254− let args@(a:as) = sort $ map typeClassMemberName members ++ superClassDictionaryNames supers
255− props = [ (arg, Var nullAnn $ Qualified Nothing (Ident arg)) | arg <- args ]
256− dict = Literal nullAnn (ObjectLiteral props)
257− in Abs (ss, com, Nothing, Just IsTypeClassConstructor)
258− (Ident a)
259− (foldr (Abs nullAnn . Ident) dict as)
260−
261−-- |
262−-- Converts a ProperName to an Ident.
263−--
264−properToIdent :: ProperName -> Ident
265−properToIdent = Ident . runProperName
src/Language/PureScript/CoreFn/Expr.hsdeleted−134
@@ -1,134 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Expr
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The core functional representation
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−{-# LANGUAGE DeriveFunctor #-}
17−
18−module Language.PureScript.CoreFn.Expr where
19−
20−import Control.Arrow ((***))
21−
22−import qualified Data.Data as D
23−
24−import Language.PureScript.CoreFn.Binders
25−import Language.PureScript.CoreFn.Literals
26−import Language.PureScript.Names
27−
28−-- |
29−-- Data type for expressions and terms
30−--
31−data Expr a
32− -- |
33− -- A literal value
34− --
35− = Literal a (Literal (Expr a))
36− -- |
37− -- A data constructor (type name, constructor name, field names)
38− --
39− | Constructor a ProperName ProperName [Ident]
40− -- |
41− -- A record property accessor
42− --
43− | Accessor a String (Expr a)
44− -- |
45− -- Partial record update
46− --
47− | ObjectUpdate a (Expr a) [(String, Expr a)]
48− -- |
49− -- Function introduction
50− --
51− | Abs a Ident (Expr a)
52− -- |
53− -- Function application
54− --
55− | App a (Expr a) (Expr a)
56− -- |
57− -- Variable
58− --
59− | Var a (Qualified Ident)
60− -- |
61− -- A case expression
62− --
63− | Case a [Expr a] [CaseAlternative a]
64− -- |
65− -- A let binding
66− --
67− | Let a [Bind a] (Expr a) deriving (Show, Read, D.Data, D.Typeable, Functor)
68−
69−-- |
70−-- A let or module binding.
71−--
72−data Bind a
73− -- |
74− -- Non-recursive binding for a single value
75− --
76− = NonRec Ident (Expr a)
77− -- |
78− -- Mutually recursive binding group for several values
79− --
80− | Rec [(Ident, Expr a)] deriving (Show, Read, D.Data, D.Typeable, Functor)
81−
82−-- |
83−-- A guard is just a boolean-valued expression that appears alongside a set of binders
84−--
85−type Guard a = Expr a
86−
87−-- |
88−-- An alternative in a case statement
89−--
90−data CaseAlternative a = CaseAlternative
91− { -- |
92− -- A collection of binders with which to match the inputs
93− --
94− caseAlternativeBinders :: [Binder a]
95− -- |
96− -- The result expression or a collect of guarded expressions
97− --
98− , caseAlternativeResult :: Either [(Guard a, Expr a)] (Expr a)
99− } deriving (Show, Read, D.Data, D.Typeable)
100−
101−instance Functor CaseAlternative where
102−
103− fmap f (CaseAlternative cabs car) = CaseAlternative
104− (fmap (fmap f) cabs)
105− (either (Left . fmap (fmap f *** fmap f)) (Right . fmap f) car)
106−
107−-- |
108−-- Extract the annotation from a term
109−--
110−extractAnn :: Expr a -> a
111−extractAnn (Literal a _) = a
112−extractAnn (Constructor a _ _ _) = a
113−extractAnn (Accessor a _ _) = a
114−extractAnn (ObjectUpdate a _ _) = a
115−extractAnn (Abs a _ _) = a
116−extractAnn (App a _ _) = a
117−extractAnn (Var a _) = a
118−extractAnn (Case a _ _) = a
119−extractAnn (Let a _ _) = a
120−
121−
122−-- |
123−-- Modify the annotation on a term
124−--
125−modifyAnn :: (a -> a) -> Expr a -> Expr a
126−modifyAnn f (Literal a b) = Literal (f a) b
127−modifyAnn f (Constructor a b c d) = Constructor (f a) b c d
128−modifyAnn f (Accessor a b c) = Accessor (f a) b c
129−modifyAnn f (ObjectUpdate a b c) = ObjectUpdate (f a) b c
130−modifyAnn f (Abs a b c) = Abs (f a) b c
131−modifyAnn f (App a b c) = App (f a) b c
132−modifyAnn f (Var a b) = Var (f a) b
133−modifyAnn f (Case a b c) = Case (f a) b c
134−modifyAnn f (Let a b c) = Let (f a) b c
src/Language/PureScript/CoreFn/Literals.hsdeleted−50
@@ -1,50 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Literals
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The core functional representation for literal values.
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−{-# LANGUAGE DeriveFunctor #-}
17−
18−module Language.PureScript.CoreFn.Literals where
19−
20−import qualified Data.Data as D
21−
22−-- |
23−-- Data type for literal values. Parameterised so it can be used for Exprs and
24−-- Binders.
25−--
26−data Literal a
27− -- |
28− -- A numeric literal
29− --
30− = NumericLiteral (Either Integer Double)
31− -- |
32− -- A string literal
33− --
34− | StringLiteral String
35− -- |
36− -- A character literal
37− --
38− | CharLiteral Char
39− -- |
40− -- A boolean literal
41− --
42− | BooleanLiteral Bool
43− -- |
44− -- An array literal
45− --
46− | ArrayLiteral [a]
47− -- |
48− -- An object literal
49− --
50− | ObjectLiteral [(String, a)] deriving (Show, Read, D.Data, D.Typeable, Functor)
src/Language/PureScript/CoreFn/Meta.hsdeleted−55
@@ -1,55 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Meta
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Metadata annotations for core functional representation
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−
17−module Language.PureScript.CoreFn.Meta where
18−
19−import qualified Data.Data as D
20−
21−import Language.PureScript.Names
22−
23−-- |
24−-- Metadata annotations
25−--
26−data Meta
27− -- |
28− -- The contained value is a data constructor
29− --
30− = IsConstructor ConstructorType [Ident]
31− -- |
32− -- The contained value is a newtype
33− --
34− | IsNewtype
35− -- |
36− -- The contained value is a typeclass dictionary constructor
37− --
38− | IsTypeClassConstructor
39− -- |
40− -- The contained reference is for a foreign member
41− --
42− | IsForeign deriving (Show, Read, D.Data, D.Typeable)
43−
44−-- |
45−-- Data constructor metadata
46−--
47−data ConstructorType
48− -- |
49− -- The constructor is for a type with a single construcor
50− --
51− = ProductType
52− -- |
53− -- The constructor is for a type with multiple construcors
54− --
55− | SumType deriving (Show, Read, D.Data, D.Typeable)
src/Language/PureScript/CoreFn/Module.hsdeleted−31
@@ -1,31 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Module
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The CoreFn module representation
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.CoreFn.Module where
16−
17−import Language.PureScript.Comments
18−import Language.PureScript.CoreFn.Expr
19−import Language.PureScript.Names
20−import Language.PureScript.Types
21−
22−data Module a = Module
23− { moduleComments :: [Comment]
24− , moduleName :: ModuleName
25− , moduleImports :: [ModuleName]
26− , moduleExports :: [Ident]
27− , moduleForeign :: [ForeignDecl]
28− , moduleDecls :: [Bind a]
29− } deriving (Show, Read)
30−
31−type ForeignDecl = (Ident, Type)
src/Language/PureScript/CoreFn/Traversals.hsdeleted−85
@@ -1,85 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Traversals
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | CoreFn traversal helpers
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.CoreFn.Traversals where
16−
17−import Control.Arrow (second, (***), (+++))
18−
19−import Language.PureScript.CoreFn.Binders
20−import Language.PureScript.CoreFn.Expr
21−import Language.PureScript.CoreFn.Literals
22−
23−everywhereOnValues :: (Bind a -> Bind a) ->
24− (Expr a -> Expr a) ->
25− (Binder a -> Binder a) ->
26− (Bind a -> Bind a, Expr a -> Expr a, Binder a -> Binder a)
27−everywhereOnValues f g h = (f', g', h')
28− where
29− f' (NonRec name e) = f (NonRec name (g' e))
30− f' (Rec es) = f (Rec (map (second g') es))
31−
32− g' (Literal ann e) = g (Literal ann (handleLiteral g' e))
33− g' (Accessor ann prop e) = g (Accessor ann prop (g' e))
34− g' (ObjectUpdate ann obj vs) = g (ObjectUpdate ann (g' obj) (map (fmap g') vs))
35− g' (Abs ann name e) = g (Abs ann name (g' e))
36− g' (App ann v1 v2) = g (App ann (g' v1) (g' v2))
37− g' (Case ann vs alts) = g (Case ann (map g' vs) (map handleCaseAlternative alts))
38− g' (Let ann ds e) = g (Let ann (map f' ds) (g' e))
39− g' e = g e
40−
41− h' (LiteralBinder a b) = h (LiteralBinder a (handleLiteral h' b))
42− h' (NamedBinder a name b) = h (NamedBinder a name (h' b))
43− h' b = h b
44−
45− handleCaseAlternative ca =
46− ca { caseAlternativeBinders = map h' (caseAlternativeBinders ca)
47− , caseAlternativeResult = (map (g' *** g') +++ g') (caseAlternativeResult ca)
48− }
49−
50− handleLiteral :: (a -> a) -> Literal a -> Literal a
51− handleLiteral i (ArrayLiteral ls) = ArrayLiteral (map i ls)
52− handleLiteral i (ObjectLiteral ls) = ObjectLiteral (map (fmap i) ls)
53− handleLiteral _ other = other
54−
55−everythingOnValues :: (r -> r -> r) ->
56− (Bind a -> r) ->
57− (Expr a -> r) ->
58− (Binder a -> r) ->
59− (CaseAlternative a -> r) ->
60− (Bind a -> r, Expr a -> r, Binder a -> r, CaseAlternative a -> r)
61−everythingOnValues (<>) f g h i = (f', g', h', i')
62− where
63− f' b@(NonRec _ e) = f b <> g' e
64− f' b@(Rec es) = foldl (<>) (f b) (map (g' . snd) es)
65−
66− g' v@(Literal _ l) = foldl (<>) (g v) (map g' (extractLiteral l))
67− g' v@(Accessor _ _ e1) = g v <> g' e1
68− g' v@(ObjectUpdate _ obj vs) = foldl (<>) (g v <> g' obj) (map (g' . snd) vs)
69− g' v@(Abs _ _ e1) = g v <> g' e1
70− g' v@(App _ e1 e2) = g v <> g' e1 <> g' e2
71− g' v@(Case _ vs alts) = foldl (<>) (foldl (<>) (g v) (map g' vs)) (map i' alts)
72− g' v@(Let _ ds e1) = foldl (<>) (g v) (map f' ds) <> g' e1
73− g' v = g v
74−
75− h' b@(LiteralBinder _ l) = foldl (<>) (h b) (map h' (extractLiteral l))
76− h' b@(ConstructorBinder _ _ _ bs) = foldl (<>) (h b) (map h' bs)
77− h' b@(NamedBinder _ _ b1) = h b <> h' b1
78− h' b = h b
79−
80− i' ca@(CaseAlternative bs (Right val)) = foldl (<>) (i ca) (map h' bs) <> g' val
81− i' ca@(CaseAlternative bs (Left gs)) = foldl (<>) (i ca) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
82−
83− extractLiteral (ArrayLiteral xs) = xs
84− extractLiteral (ObjectLiteral xs) = map snd xs
85− extractLiteral _ = []
src/Language/PureScript/Docs.hsdeleted−14
@@ -1,14 +0,0 @@
1−
2−-- | Data types and functions for rendering generated documentation from
3−-- PureScript code, in a variety of formats.
4−
5−module Language.PureScript.Docs (
6− module Docs
7−) where
8−
9−import Language.PureScript.Docs.Types as Docs
10−import Language.PureScript.Docs.RenderedCode.Types as Docs
11−import Language.PureScript.Docs.RenderedCode.Render as Docs
12−import Language.PureScript.Docs.Convert as Docs
13−import Language.PureScript.Docs.Render as Docs
14−import Language.PureScript.Docs.ParseAndDesugar as Docs
src/Language/PureScript/Docs/AsMarkdown.hsdeleted−124
@@ -1,124 +0,0 @@
1−{-# LANGUAGE RecordWildCards #-}
2−
3−module Language.PureScript.Docs.AsMarkdown (
4− renderModulesAsMarkdown
5−) where
6−
7−import Control.Monad.Writer hiding (First)
8−import Data.Foldable (for_)
9−import Data.List (partition)
10−
11−import qualified Language.PureScript as P
12−
13−import Language.PureScript.Docs.Types
14−import Language.PureScript.Docs.RenderedCode
15−import qualified Language.PureScript.Docs.Convert as Convert
16−import qualified Language.PureScript.Docs.Render as Render
17−
18−-- |
19−-- Take a list of modules and render them all in order, returning a single
20−-- Markdown-formatted String.
21−--
22−renderModulesAsMarkdown :: [P.Module] -> String
23−renderModulesAsMarkdown =
24− runDocs . modulesAsMarkdown . map Convert.convertModule
25−
26−modulesAsMarkdown :: [Module] -> Docs
27−modulesAsMarkdown = mapM_ moduleAsMarkdown
28−
29−moduleAsMarkdown :: Module -> Docs
30−moduleAsMarkdown Module{..} = do
31− headerLevel 2 $ "Module " ++ modName
32− spacer
33− for_ modComments tell'
34− mapM_ declAsMarkdown modDeclarations
35− spacer
36−
37−declAsMarkdown :: Declaration -> Docs
38−declAsMarkdown decl@Declaration{..} = do
39− headerLevel 4 (ticks declTitle)
40− spacer
41−
42− let (instances, children) = partition (isChildInstance . cdeclInfo) declChildren
43− fencedBlock $ do
44− tell' (codeToString $ Render.renderDeclaration decl)
45− zipWithM_ (\f c -> tell' (childToString f c)) (First : repeat NotFirst) children
46− spacer
47−
48− for_ declFixity (\fixity -> fixityAsMarkdown fixity >> spacer)
49−
50− for_ declComments tell'
51−
52− unless (null instances) $ do
53− headerLevel 5 "Instances"
54− fencedBlock $ mapM_ (tell' . childToString NotFirst) instances
55− spacer
56−
57− where
58− isChildInstance (ChildInstance _ _) = True
59− isChildInstance _ = False
60−
61−codeToString :: RenderedCode -> String
62−codeToString = outputWith elemAsMarkdown
63− where
64− elemAsMarkdown (Syntax x) = x
65− elemAsMarkdown (Ident x) = x
66− elemAsMarkdown (Ctor x _) = x
67− elemAsMarkdown (Kind x) = x
68− elemAsMarkdown (Keyword x) = x
69− elemAsMarkdown Space = " "
70−
71−fixityAsMarkdown :: P.Fixity -> Docs
72−fixityAsMarkdown (P.Fixity associativity precedence) =
73− tell' $ concat [ "_"
74− , associativityStr
75− , " / precedence "
76− , show precedence
77− , "_"
78− ]
79− where
80− associativityStr = case associativity of
81− P.Infixl -> "left-associative"
82− P.Infixr -> "right-associative"
83− P.Infix -> "non-associative"
84−
85−childToString :: First -> ChildDeclaration -> String
86−childToString f decl@ChildDeclaration{..} =
87− case cdeclInfo of
88− ChildDataConstructor _ ->
89− let c = if f == First then "=" else "|"
90− in " " ++ c ++ " " ++ str
91− ChildTypeClassMember _ ->
92− " " ++ str
93− ChildInstance _ _ ->
94− str
95− where
96− str = codeToString $ Render.renderChildDeclaration decl
97−
98−data First
99− = First
100− | NotFirst
101− deriving (Show, Read, Eq, Ord)
102−
103−type Docs = Writer [String] ()
104−
105−runDocs :: Docs -> String
106−runDocs = unlines . execWriter
107−
108−tell' :: String -> Docs
109−tell' = tell . (:[])
110−
111−spacer :: Docs
112−spacer = tell' ""
113−
114−headerLevel :: Int -> String -> Docs
115−headerLevel level hdr = tell' (replicate level '#' ++ ' ' : hdr)
116−
117−fencedBlock :: Docs -> Docs
118−fencedBlock inner = do
119− tell' "``` purescript"
120− inner
121− tell' "```"
122−
123−ticks :: String -> String
124−ticks = ("`" ++) . (++ "`")
src/Language/PureScript/Docs/Convert.hsdeleted−226
@@ -1,226 +0,0 @@
1−{-# LANGUAGE TupleSections #-}
2−{-# LANGUAGE OverloadedStrings #-}
3−{-# LANGUAGE RecordWildCards #-}
4−{-# LANGUAGE ViewPatterns #-}
5−
6−-- | Functions for converting PureScript ASTs into values of the data types
7−-- from Language.PureScript.Docs.
8−
9−module Language.PureScript.Docs.Convert
10− ( convertModule
11− , collectBookmarks
12− ) where
13−
14−import Control.Monad
15−import Control.Category ((>>>))
16−import Data.Either
17−import Data.Maybe (mapMaybe, isNothing)
18−import Data.List (nub, isPrefixOf, isSuffixOf)
19−
20−import qualified Language.PureScript as P
21−
22−import Language.PureScript.Docs.Types
23−
24−-- |
25−-- Convert a single Module.
26−--
27−convertModule :: P.Module -> Module
28−convertModule m@(P.Module _ coms moduleName _ _) =
29− Module (P.runModuleName moduleName) comments (declarations m)
30− where
31− comments = convertComments coms
32− declarations =
33− P.exportedDeclarations
34− >>> mapMaybe (\d -> getDeclarationTitle d >>= convertDeclaration d)
35− >>> augmentDeclarations
36− >>> map addDefaultFixity
37−
38−-- | The data type for an intermediate stage which we go through during
39−-- converting.
40−--
41−-- In the first pass, we take all top level declarations in the module, and
42−-- collect other information which will later be used to augment the top level
43−-- declarations. These two situation correspond to the Right and Left
44−-- constructors, respectively.
45−--
46−-- In the second pass, we go over all of the Left values and augment the
47−-- relevant declarations, leaving only the augmented Right values.
48−--
49−-- Note that in the Left case, we provide a [String] as well as augment
50−-- information. The [String] value should be a list of titles of declarations
51−-- that the augmentation should apply to. For example, for a type instance
52−-- declaration, that would be any types or type classes mentioned in the
53−-- instance. For a fixity declaration, it would be just the relevant operator's
54−-- name.
55−type IntermediateDeclaration
56− = Either ([String], DeclarationAugment) Declaration
57−
58−-- | Some data which will be used to augment a Declaration in the
59−-- output.
60−--
61−-- The AugmentChild constructor allows us to move all children under their
62−-- respective parents. It is only necessary for type instance declarations,
63−-- since they appear at the top level in the AST, and since they might need to
64−-- appear as children in two places (for example, if a data type defined in a
65−-- module is an instance of a type class also defined in that module).
66−--
67−-- The AugmentFixity constructor allows us to augment operator definitions
68−-- with their associativity and precedence.
69−data DeclarationAugment
70− = AugmentChild ChildDeclaration
71− | AugmentFixity P.Fixity
72−
73−-- | Augment top-level declarations; the second pass. See the comments under
74−-- the type synonym IntermediateDeclaration for more information.
75−augmentDeclarations :: [IntermediateDeclaration] -> [Declaration]
76−augmentDeclarations (partitionEithers -> (augments, toplevels)) =
77− foldl go toplevels augments
78− where
79− go ds (parentTitles, a) =
80− map (\d ->
81− if declTitle d `elem` parentTitles
82− then augmentWith a d
83− else d) ds
84−
85− augmentWith a d =
86− case a of
87− AugmentChild child ->
88− d { declChildren = declChildren d ++ [child] }
89− AugmentFixity fixity ->
90− d { declFixity = Just fixity }
91−
92−-- | Add the default operator fixity for operators which do not have associated
93−-- fixity declarations.
94−--
95−-- TODO: This may no longer be necessary after issue 806 is resolved, hopefully
96−-- in 0.8.
97−addDefaultFixity :: Declaration -> Declaration
98−addDefaultFixity decl@Declaration{..}
99− | isOp declTitle && isNothing declFixity =
100− decl { declFixity = Just defaultFixity }
101− | otherwise =
102− decl
103− where
104− isOp :: String -> Bool
105− isOp str = "(" `isPrefixOf` str && ")" `isSuffixOf` str
106− defaultFixity = P.Fixity P.Infixl (-1)
107−
108−getDeclarationTitle :: P.Declaration -> Maybe String
109−getDeclarationTitle (P.TypeDeclaration name _) = Just (P.showIdent name)
110−getDeclarationTitle (P.ExternDeclaration name _) = Just (P.showIdent name)
111−getDeclarationTitle (P.DataDeclaration _ name _ _) = Just (P.runProperName name)
112−getDeclarationTitle (P.ExternDataDeclaration name _) = Just (P.runProperName name)
113−getDeclarationTitle (P.TypeSynonymDeclaration name _ _) = Just (P.runProperName name)
114−getDeclarationTitle (P.TypeClassDeclaration name _ _ _) = Just (P.runProperName name)
115−getDeclarationTitle (P.TypeInstanceDeclaration name _ _ _ _) = Just (P.showIdent name)
116−getDeclarationTitle (P.FixityDeclaration _ name) = Just ("(" ++ name ++ ")")
117−getDeclarationTitle (P.PositionedDeclaration _ _ d) = getDeclarationTitle d
118−getDeclarationTitle _ = Nothing
119−
120−-- | Create a basic Declaration value.
121−mkDeclaration :: String -> DeclarationInfo -> Declaration
122−mkDeclaration title info =
123− Declaration { declTitle = title
124− , declComments = Nothing
125− , declSourceSpan = Nothing
126− , declChildren = []
127− , declFixity = Nothing
128− , declInfo = info
129− }
130−
131−basicDeclaration :: String -> DeclarationInfo -> Maybe IntermediateDeclaration
132−basicDeclaration title info = Just $ Right $ mkDeclaration title info
133−
134−convertDeclaration :: P.Declaration -> String -> Maybe IntermediateDeclaration
135−convertDeclaration (P.TypeDeclaration _ ty) title =
136− basicDeclaration title (ValueDeclaration ty)
137−convertDeclaration (P.ExternDeclaration _ ty) title =
138− basicDeclaration title (ValueDeclaration ty)
139−convertDeclaration (P.DataDeclaration dtype _ args ctors) title =
140− Just (Right (mkDeclaration title info) { declChildren = children })
141− where
142− info = DataDeclaration dtype args
143− children = map convertCtor ctors
144− convertCtor (ctor', tys) =
145− ChildDeclaration (P.runProperName ctor') Nothing Nothing (ChildDataConstructor tys)
146−convertDeclaration (P.ExternDataDeclaration _ kind') title =
147− basicDeclaration title (ExternDataDeclaration kind')
148−convertDeclaration (P.TypeSynonymDeclaration _ args ty) title =
149− basicDeclaration title (TypeSynonymDeclaration args ty)
150−convertDeclaration (P.TypeClassDeclaration _ args implies ds) title =
151− Just (Right (mkDeclaration title info) { declChildren = children })
152− where
153− info = TypeClassDeclaration args implies
154− children = map convertClassMember ds
155− convertClassMember (P.PositionedDeclaration _ _ d) =
156− convertClassMember d
157− convertClassMember (P.TypeDeclaration ident' ty) =
158− ChildDeclaration (P.showIdent ident') Nothing Nothing (ChildTypeClassMember ty)
159− convertClassMember _ =
160− error "Invalid argument to convertClassMember."
161−convertDeclaration (P.TypeInstanceDeclaration _ constraints className tys _) title =
162− Just (Left (classNameString : typeNameStrings, AugmentChild childDecl))
163− where
164− classNameString = unQual className
165− typeNameStrings = nub (concatMap (P.everythingOnTypes (++) extractProperNames) tys)
166− unQual x = let (P.Qualified _ y) = x in P.runProperName y
167−
168− extractProperNames (P.TypeConstructor n) = [unQual n]
169− extractProperNames _ = []
170−
171− childDecl = ChildDeclaration title Nothing Nothing (ChildInstance constraints classApp)
172− classApp = foldl P.TypeApp (P.TypeConstructor className) tys
173−convertDeclaration (P.FixityDeclaration fixity _) title =
174− Just (Left ([title], AugmentFixity fixity))
175−convertDeclaration (P.PositionedDeclaration srcSpan com d') title =
176− fmap (addComments . addSourceSpan) (convertDeclaration d' title)
177− where
178− addComments (Right d) =
179− Right (d { declComments = convertComments com })
180− addComments (Left augment) =
181− Left (withAugmentChild (\d -> d { cdeclComments = convertComments com })
182− augment)
183−
184− addSourceSpan (Right d) =
185− Right (d { declSourceSpan = Just srcSpan })
186− addSourceSpan (Left augment) =
187− Left (withAugmentChild (\d -> d { cdeclSourceSpan = Just srcSpan })
188− augment)
189−
190− withAugmentChild f (t, a) =
191− case a of
192− AugmentChild d -> (t, AugmentChild (f d))
193− _ -> (t, a)
194−convertDeclaration _ _ = Nothing
195−
196−convertComments :: [P.Comment] -> Maybe String
197−convertComments cs = do
198− let raw = concatMap toLines cs
199− guard (all hasPipe raw && not (null raw))
200− return (go raw)
201− where
202− go = unlines . map stripPipes
203−
204− toLines (P.LineComment s) = [s]
205− toLines (P.BlockComment s) = lines s
206−
207− hasPipe s = case dropWhile (== ' ') s of { ('|':_) -> True; _ -> False }
208−
209− stripPipes = dropPipe . dropWhile (== ' ')
210−
211− dropPipe ('|':' ':s) = s
212− dropPipe ('|':s) = s
213− dropPipe s = s
214−
215−-- | Go through a PureScript module and extract a list of Bookmarks; references
216−-- to data types or values, to be used as a kind of index. These are used for
217−-- generating links in the HTML documentation, for example.
218−collectBookmarks :: InPackage P.Module -> [Bookmark]
219−collectBookmarks (Local m) = map Local (collectBookmarks' m)
220−collectBookmarks (FromDep pkg m) = map (FromDep pkg) (collectBookmarks' m)
221−
222−collectBookmarks' :: P.Module -> [(P.ModuleName, String)]
223−collectBookmarks' m =
224− map (P.getModuleName m, )
225− (mapMaybe getDeclarationTitle
226− (P.exportedDeclarations m))
src/Language/PureScript/Docs/ParseAndDesugar.hsdeleted−146
@@ -1,146 +0,0 @@
1−{-# LANGUAGE TupleSections #-}
2−{-# LANGUAGE CPP #-}
3−
4−module Language.PureScript.Docs.ParseAndDesugar
5− ( parseAndDesugar
6− , ParseDesugarError(..)
7− ) where
8−
9−import qualified Data.Map as M
10−import Control.Arrow (first)
11−import Control.Monad
12−#if __GLASGOW_HASKELL__ < 710
13−import Control.Applicative
14−#endif
15−
16−import Control.Monad.Trans.Except
17−import Control.Monad.Writer.Strict (runWriterT)
18−import Control.Monad.Error.Class (MonadError(..))
19−import Control.Monad.IO.Class (MonadIO(..))
20−
21−import Web.Bower.PackageMeta (PackageName)
22−
23−import qualified Language.PureScript as P
24−import qualified Language.PureScript.Constants as C
25−import Language.PureScript.Docs.Types
26−import Language.PureScript.Docs.Convert (collectBookmarks)
27−
28−data ParseDesugarError
29− = ParseError P.MultipleErrors
30− | SortModulesError P.MultipleErrors
31− | DesugarError P.MultipleErrors
32− deriving (Show)
33−
34−-- |
35−-- Given:
36−--
37−-- * A list of local source files
38−-- * A list of source files from external dependencies, together with their
39−-- package names
40−-- * A callback, taking a list of bookmarks, and a list of desugared modules
41−--
42−-- This function does the following:
43−--
44−-- * Parse all of the input and dependency source files
45−-- * Partially desugar all of the resulting modules
46−-- * Collect a list of bookmarks from the whole set of source files
47−-- * Collect a list of desugared modules from just the input source files (not
48−-- dependencies)
49−-- * Call the callback with the bookmarks and desugared module list.
50−parseAndDesugar ::
51− [FilePath]
52− -> [(PackageName, FilePath)]
53− -> ([Bookmark] -> [P.Module] -> IO a)
54− -> IO (Either ParseDesugarError a)
55−parseAndDesugar inputFiles depsFiles callback = do
56− inputFiles' <- mapM (parseAs Local) inputFiles
57− depsFiles' <- mapM (\(pkgName, f) -> parseAs (FromDep pkgName) f) depsFiles
58−
59− runExceptT $ do
60− ms <- parseFiles (inputFiles' ++ depsFiles')
61− ms' <- sortModules (map snd ms)
62− (bs, ms'') <- desugarWithBookmarks ms ms'
63− liftIO $ callback bs ms''
64−
65−parseFiles ::
66− [(FileInfo, FilePath)]
67− -> ExceptT ParseDesugarError IO [(FileInfo, P.Module)]
68−parseFiles =
69− throwLeft ParseError . P.parseModulesFromFiles fileInfoToString
70−
71−sortModules ::
72− [P.Module]
73− -> ExceptT ParseDesugarError IO [P.Module]
74−sortModules =
75− fmap fst . throwLeft SortModulesError . sortModules' . map importPrim
76− where
77− sortModules' :: [P.Module] -> Either P.MultipleErrors ([P.Module], P.ModuleGraph)
78− sortModules' = P.sortModules
79−
80−desugarWithBookmarks ::
81− [(FileInfo, P.Module)]
82− -> [P.Module]
83− -> ExceptT ParseDesugarError IO ([Bookmark], [P.Module])
84−desugarWithBookmarks msInfo msSorted = do
85− msDesugared <- throwLeft DesugarError (desugar msSorted)
86−
87− let msDeps = getDepsModuleNames (map (\(fp, m) -> (,m) <$> fp) msInfo)
88− msPackages = map (addPackage msDeps) msDesugared
89− bookmarks = concatMap collectBookmarks msPackages
90−
91− return (bookmarks, takeLocals msPackages)
92−
93−throwLeft :: (MonadError e m) => (l -> e) -> Either l r -> m r
94−throwLeft f = either (throwError . f) return
95−
96−-- | Specifies whether a PureScript source file is considered as:
97−--
98−-- 1) with the `Local` constructor, a target source file, i.e., we want to see
99−-- its modules in the output
100−-- 2) with the `FromDep` constructor, a dependencies source file, i.e. we do
101−-- not want its modules in the output; it is there to enable desugaring, and
102−-- to ensure that links between modules are constructed correctly.
103−type FileInfo = InPackage FilePath
104−
105−fileInfoToString :: FileInfo -> FilePath
106−fileInfoToString (Local fn) = fn
107−fileInfoToString (FromDep _ fn) = fn
108−
109−addDefaultImport :: P.ModuleName -> P.Module -> P.Module
110−addDefaultImport toImport m@(P.Module ss coms mn decls exps) =
111− if isExistingImport `any` decls || mn == toImport then m
112− else P.Module ss coms mn (P.ImportDeclaration toImport P.Implicit Nothing : decls) exps
113− where
114− isExistingImport (P.ImportDeclaration mn' _ _) | mn' == toImport = True
115− isExistingImport (P.PositionedDeclaration _ _ d) = isExistingImport d
116− isExistingImport _ = False
117−
118−importPrim :: P.Module -> P.Module
119−importPrim = addDefaultImport (P.ModuleName [P.ProperName C.prim])
120−
121−desugar :: [P.Module] -> Either P.MultipleErrors [P.Module]
122−desugar = P.evalSupplyT 0 . desugar'
123− where
124− desugar' :: [P.Module] -> P.SupplyT (Either P.MultipleErrors) [P.Module]
125− desugar' = mapM P.desugarDoModule >=> P.desugarCasesModule >=> ignoreWarnings . P.desugarImports []
126− ignoreWarnings m = liftM fst (runWriterT m)
127−
128−parseFile :: FilePath -> IO (FilePath, String)
129−parseFile input' = (,) input' <$> readFile input'
130−
131−parseAs :: (FilePath -> a) -> FilePath -> IO (a, String)
132−parseAs g = fmap (first g) . parseFile
133−
134−getDepsModuleNames :: [InPackage (FilePath, P.Module)] -> M.Map P.ModuleName PackageName
135−getDepsModuleNames = foldl go M.empty
136− where
137− go deps p = deps # case p of
138− Local _ -> id
139− FromDep pkgName (_, m) -> M.insert (P.getModuleName m) pkgName
140− (#) = flip ($)
141−
142−addPackage :: M.Map P.ModuleName PackageName -> P.Module -> InPackage P.Module
143−addPackage depsModules m =
144− case M.lookup (P.getModuleName m) depsModules of
145− Just pkgName -> FromDep pkgName m
146− Nothing -> Local m
src/Language/PureScript/Docs/Render.hsdeleted−128
@@ -1,128 +0,0 @@
1−{-# LANGUAGE RecordWildCards #-}
2−
3−-- | Functions for creating `RenderedCode` values from data types in
4−-- Language.PureScript.Docs.Types.
5−--
6−-- These functions are the ones that are used in markdown/html documentation
7−-- generation, but the intention is that you are able to supply your own
8−-- instead if necessary. For example, the Hoogle input file generator
9−-- substitutes some of these
10−
11−module Language.PureScript.Docs.Render where
12−
13−import Data.Maybe (maybeToList)
14−import Data.Monoid ((<>))
15−import qualified Language.PureScript as P
16−
17−import Language.PureScript.Docs.Types
18−import Language.PureScript.Docs.RenderedCode
19−import Language.PureScript.Docs.Utils.MonoidExtras
20−
21−renderDeclaration :: Declaration -> RenderedCode
22−renderDeclaration = renderDeclarationWithOptions defaultRenderTypeOptions
23−
24−renderDeclarationWithOptions :: RenderTypeOptions -> Declaration -> RenderedCode
25−renderDeclarationWithOptions opts Declaration{..} =
26− mintersperse sp $ case declInfo of
27− ValueDeclaration ty ->
28− [ ident declTitle
29− , syntax "::"
30− , renderType' ty
31− ]
32− DataDeclaration dtype args ->
33− [ keyword (P.showDataDeclType dtype)
34− , renderType' (typeApp declTitle args)
35− ]
36− ExternDataDeclaration kind' ->
37− [ keywordData
38− , renderType' (P.TypeConstructor (notQualified declTitle))
39− , syntax "::"
40− , renderKind kind'
41− ]
42− TypeSynonymDeclaration args ty ->
43− [ keywordType
44− , renderType' (typeApp declTitle args)
45− , syntax "="
46− , renderType' ty
47− ]
48− TypeClassDeclaration args implies ->
49− [ keywordClass ]
50− ++ maybeToList superclasses
51− ++ [renderType' (typeApp declTitle args)]
52− ++ if any (isTypeClassMember . cdeclInfo) declChildren
53− then [keywordWhere]
54− else []
55−
56− where
57− superclasses
58− | null implies = Nothing
59− | otherwise = Just $
60− syntax "("
61− <> mintersperse (syntax "," <> sp) (map renderConstraint implies)
62− <> syntax ")" <> sp <> syntax "<="
63−
64− isTypeClassMember (ChildTypeClassMember _) = True
65− isTypeClassMember _ = False
66− where
67− renderType' = renderTypeWithOptions opts
68−
69−renderChildDeclaration :: ChildDeclaration -> RenderedCode
70−renderChildDeclaration = renderChildDeclarationWithOptions defaultRenderTypeOptions
71−
72−renderChildDeclarationWithOptions :: RenderTypeOptions -> ChildDeclaration -> RenderedCode
73−renderChildDeclarationWithOptions opts ChildDeclaration{..} =
74− mintersperse sp $ case cdeclInfo of
75− ChildInstance constraints ty ->
76− [ keywordInstance
77− , ident cdeclTitle
78− , syntax "::"
79− ] ++ maybeToList (renderConstraints constraints)
80− ++ [ renderType' ty ]
81− ChildDataConstructor args ->
82− [ renderType' typeApp' ]
83− where
84− typeApp' = foldl P.TypeApp ctor' args
85− ctor' = P.TypeConstructor (notQualified cdeclTitle)
86−
87− ChildTypeClassMember ty ->
88− [ ident cdeclTitle
89− , syntax "::"
90− , renderType' ty
91− ]
92− where
93− renderType' = renderTypeWithOptions opts
94−
95−renderConstraint :: (P.Qualified P.ProperName, [P.Type]) -> RenderedCode
96−renderConstraint = renderConstraintWithOptions defaultRenderTypeOptions
97−
98−renderConstraintWithOptions :: RenderTypeOptions -> (P.Qualified P.ProperName, [P.Type]) -> RenderedCode
99−renderConstraintWithOptions opts (pn, tys) =
100− renderTypeWithOptions opts $ foldl P.TypeApp (P.TypeConstructor pn) tys
101−
102−renderConstraints :: [P.Constraint] -> Maybe RenderedCode
103−renderConstraints = renderConstraintsWithOptions defaultRenderTypeOptions
104−
105−renderConstraintsWithOptions :: RenderTypeOptions -> [P.Constraint] -> Maybe RenderedCode
106−renderConstraintsWithOptions opts constraints
107− | null constraints = Nothing
108− | otherwise = Just $
109− syntax "("
110− <> renderedConstraints
111− <> syntax ")" <> sp <> syntax "=>"
112− where
113− renderedConstraints =
114− mintersperse (syntax "," <> sp)
115− (map (renderConstraintWithOptions opts) constraints)
116−
117−notQualified :: String -> P.Qualified P.ProperName
118−notQualified = P.Qualified Nothing . P.ProperName
119−
120−typeApp :: String -> [(String, Maybe P.Kind)] -> P.Type
121−typeApp title typeArgs =
122− foldl P.TypeApp
123− (P.TypeConstructor (notQualified title))
124− (map toTypeVar typeArgs)
125−
126−toTypeVar :: (String, Maybe P.Kind) -> P.Type
127−toTypeVar (s, Nothing) = P.TypeVar s
128−toTypeVar (s, Just k) = P.KindedType (P.TypeVar s) k
src/Language/PureScript/Docs/RenderedCode.hsdeleted−11
@@ -1,11 +0,0 @@
1−
2−-- | Data types and functions for representing a simplified form of PureScript
3−-- code, intended for use in e.g. HTML documentation.
4−
5−module Language.PureScript.Docs.RenderedCode (
6− module RenderedCode
7−) where
8−
9−import Language.PureScript.Docs.RenderedCode.Types as RenderedCode
10−import Language.PureScript.Docs.RenderedCode.Render as RenderedCode
11−
src/Language/PureScript/Docs/RenderedCode/Render.hsdeleted−184
@@ -1,184 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−
3−-- | Functions for producing RenderedCode values from PureScript Type values.
4−
5−module Language.PureScript.Docs.RenderedCode.Render (
6− renderType,
7− renderTypeAtom,
8− renderRow,
9− renderKind,
10− RenderTypeOptions(..),
11− defaultRenderTypeOptions,
12− renderTypeWithOptions
13−) where
14−
15−#if __GLASGOW_HASKELL__ < 710
16−import Data.Monoid ((<>), mconcat, mempty)
17−#else
18−import Data.Monoid ((<>))
19−#endif
20−import Data.Maybe (fromMaybe)
21−
22−import Control.Arrow ((<+>))
23−import Control.PatternArrows
24−
25−import Language.PureScript.Names
26−import Language.PureScript.Types
27−import Language.PureScript.Kinds
28−import Language.PureScript.Pretty.Kinds
29−import Language.PureScript.Environment
30−
31−import Language.PureScript.Docs.RenderedCode.Types
32−import Language.PureScript.Docs.Utils.MonoidExtras
33−
34−typeLiterals :: Pattern () Type RenderedCode
35−typeLiterals = mkPattern match
36− where
37− match TypeWildcard =
38− Just (syntax "_")
39− match (TypeVar var) =
40− Just (ident var)
41− match (PrettyPrintObject row) =
42− Just $ mintersperse sp
43− [ syntax "{"
44− , renderRow row
45− , syntax "}"
46− ]
47− match (TypeConstructor (Qualified mn name)) =
48− Just (ctor (runProperName name) (maybeToContainingModule mn))
49− match (ConstrainedType deps ty) =
50− Just $ mintersperse sp
51− [ syntax "(" <> constraints <> syntax ")"
52− , syntax "=>"
53− , renderType ty
54− ]
55− where
56− constraints = mintersperse (syntax "," <> sp) (map renderDep deps)
57− renderDep (pn, tys) =
58− let instApp = foldl TypeApp (TypeConstructor pn) tys
59− in renderType instApp
60− match REmpty =
61− Just (syntax "()")
62− match row@RCons{} =
63− Just (syntax "(" <> renderRow row <> syntax ")")
64− match _ =
65− Nothing
66−
67−-- |
68−-- Render code representing a Row
69−--
70−renderRow :: Type -> RenderedCode
71−renderRow = uncurry renderRow' . rowToList
72− where
73− renderRow' h t = renderHead h <> renderTail t
74−
75−renderHead :: [(String, Type)] -> RenderedCode
76−renderHead = mintersperse (syntax "," <> sp) . map renderLabel
77−
78−renderLabel :: (String, Type) -> RenderedCode
79−renderLabel (label, ty) =
80− mintersperse sp
81− [ ident label
82− , syntax "::"
83− , renderType ty
84− ]
85−
86−renderTail :: Type -> RenderedCode
87−renderTail REmpty = mempty
88−renderTail other = sp <> syntax "|" <> sp <> renderType other
89−
90−typeApp :: Pattern () Type (Type, Type)
91−typeApp = mkPattern match
92− where
93− match (TypeApp f x) = Just (f, x)
94− match _ = Nothing
95−
96−appliedFunction :: Pattern () Type (Type, Type)
97−appliedFunction = mkPattern match
98− where
99− match (PrettyPrintFunction arg ret) = Just (arg, ret)
100− match _ = Nothing
101−
102−kinded :: Pattern () Type (Kind, Type)
103−kinded = mkPattern match
104− where
105− match (KindedType t k) = Just (k, t)
106− match _ = Nothing
107−
108−matchTypeAtom :: Pattern () Type RenderedCode
109−matchTypeAtom = typeLiterals <+> fmap parens matchType
110− where
111− parens x = syntax "(" <> x <> syntax ")"
112−
113−matchType :: Pattern () Type RenderedCode
114−matchType = buildPrettyPrinter operators matchTypeAtom
115− where
116− operators :: OperatorTable () Type RenderedCode
117− operators =
118− OperatorTable [ [ AssocL typeApp $ \f x -> f <> sp <> x ]
119− , [ AssocR appliedFunction $ \arg ret -> mintersperse sp [arg, syntax "->", ret] ]
120− , [ Wrap forall_ $ \idents ty -> mconcat [syntax "forall", sp, mintersperse sp (map ident idents), syntax ".", sp, ty] ]
121− , [ Wrap kinded $ \k ty -> mintersperse sp [ty, syntax "::", renderKind k] ]
122− ]
123−
124−forall_ :: Pattern () Type ([String], Type)
125−forall_ = mkPattern match
126− where
127− match (PrettyPrintForAll idents ty) = Just (idents, ty)
128− match _ = Nothing
129−
130−insertPlaceholders :: RenderTypeOptions -> Type -> Type
131−insertPlaceholders opts =
132− everywhereOnTypesTopDown convertForAlls . everywhereOnTypes (convert opts)
133−
134−dePrim :: Type -> Type
135−dePrim ty@(TypeConstructor (Qualified _ name))
136− | ty == tyBoolean || ty == tyNumber || ty == tyString =
137− TypeConstructor $ Qualified Nothing name
138−dePrim other = other
139−
140−convert :: RenderTypeOptions -> Type -> Type
141−convert _ (TypeApp (TypeApp f arg) ret) | f == tyFunction = PrettyPrintFunction arg ret
142−convert opts (TypeApp o r) | o == tyObject && prettyPrintObjects opts = PrettyPrintObject r
143−convert _ other = other
144−
145−convertForAlls :: Type -> Type
146−convertForAlls (ForAll i ty _) = go [i] ty
147− where
148− go idents (ForAll ident' ty' _) = go (ident' : idents) ty'
149− go idents other = PrettyPrintForAll idents other
150−convertForAlls other = other
151−
152−preprocessType :: RenderTypeOptions -> Type -> Type
153−preprocessType opts = dePrim . insertPlaceholders opts
154−
155−-- |
156−-- Render code representing a Kind
157−--
158−renderKind :: Kind -> RenderedCode
159−renderKind = kind . prettyPrintKind
160−
161−-- |
162−-- Render code representing a Type, as it should appear inside parentheses
163−--
164−renderTypeAtom :: Type -> RenderedCode
165−renderTypeAtom =
166− fromMaybe (error "Incomplete pattern") . pattern matchTypeAtom () . preprocessType defaultRenderTypeOptions
167−
168−
169−-- |
170−-- Render code representing a Type
171−--
172−renderType :: Type -> RenderedCode
173−renderType = renderTypeWithOptions defaultRenderTypeOptions
174−
175−data RenderTypeOptions = RenderTypeOptions
176− { prettyPrintObjects :: Bool
177− }
178−
179−defaultRenderTypeOptions :: RenderTypeOptions
180−defaultRenderTypeOptions = RenderTypeOptions { prettyPrintObjects = True }
181−
182−renderTypeWithOptions :: RenderTypeOptions -> Type -> RenderedCode
183−renderTypeWithOptions opts =
184− fromMaybe (error "Incomplete pattern") . pattern matchType () . preprocessType opts
src/Language/PureScript/Docs/RenderedCode/Types.hsdeleted−194
@@ -1,194 +0,0 @@
1−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
2−{-# LANGUAGE OverloadedStrings #-}
3−{-# LANGUAGE CPP #-}
4−
5−-- | Data types and functions for representing a simplified form of PureScript
6−-- code, intended for use in e.g. HTML documentation.
7−
8−module Language.PureScript.Docs.RenderedCode.Types
9− ( RenderedCodeElement(..)
10− , asRenderedCodeElement
11− , ContainingModule(..)
12− , asContainingModule
13− , containingModuleToMaybe
14− , maybeToContainingModule
15− , fromContainingModule
16− , RenderedCode
17− , asRenderedCode
18− , outputWith
19− , sp
20− , syntax
21− , ident
22− , ctor
23− , kind
24− , keyword
25− , keywordForall
26− , keywordData
27− , keywordNewtype
28− , keywordType
29− , keywordClass
30− , keywordInstance
31− , keywordWhere
32− ) where
33−
34−#if __GLASGOW_HASKELL__ < 710
35−import Control.Applicative ((<$>), (<*>), (*>), pure)
36−import Data.Foldable
37−import Data.Monoid
38−#endif
39−import qualified Data.Aeson as A
40−import Data.Aeson.BetterErrors
41−import Control.Monad.Error.Class (MonadError(..))
42−
43−import qualified Language.PureScript as P
44−
45−-- |
46−-- A single element in a rendered code fragment. The intention is to support
47−-- multiple output formats. For example, plain text, or highlighted HTML.
48−--
49−data RenderedCodeElement
50− = Syntax String
51− | Ident String
52− | Ctor String ContainingModule
53− | Kind String
54− | Keyword String
55− | Space
56− deriving (Show, Eq, Ord)
57−
58−instance A.ToJSON RenderedCodeElement where
59− toJSON (Syntax str) =
60− A.toJSON ["syntax", str]
61− toJSON (Ident str) =
62− A.toJSON ["ident", str]
63− toJSON (Ctor str mn) =
64− A.toJSON ["ctor", A.toJSON str, A.toJSON mn ]
65− toJSON (Kind str) =
66− A.toJSON ["kind", str]
67− toJSON (Keyword str) =
68− A.toJSON ["keyword", str]
69− toJSON Space =
70− A.toJSON ["space" :: String]
71−
72−asRenderedCodeElement :: Parse String RenderedCodeElement
73−asRenderedCodeElement =
74− a Syntax "syntax" <|>
75− a Ident "ident" <|>
76− asCtor <|>
77− a Kind "kind" <|>
78− a Keyword "keyword" <|>
79− asSpace <|>
80− unableToParse
81− where
82− p <|> q = catchError p (const q)
83−
84− a ctor' ctorStr = ctor' <$> (nth 0 (withString (eq ctorStr)) *> nth 1 asString)
85− asCtor = nth 0 (withString (eq "ctor")) *> (Ctor <$> nth 1 asString <*> nth 2 asContainingModule)
86− asSpace = nth 0 (withString (eq "space")) *> pure Space
87−
88− eq s s' = if s == s' then Right () else Left ""
89−
90− unableToParse = withString (Left . show)
91−
92−-- |
93−-- This type is isomorphic to 'Maybe' 'P.ModuleName'. It makes code a bit easier
94−-- to read, as the meaning is more explicit.
95−--
96−data ContainingModule
97− = ThisModule
98− | OtherModule P.ModuleName
99− deriving (Show, Eq, Ord)
100−
101−instance A.ToJSON ContainingModule where
102− toJSON mn = A.toJSON (P.runModuleName <$> containingModuleToMaybe mn)
103−
104−asContainingModule :: Parse e ContainingModule
105−asContainingModule =
106− maybeToContainingModule <$> perhaps (P.moduleNameFromString <$> asString)
107−
108−-- |
109−-- Convert a 'Maybe' 'P.ModuleName' to a 'ContainingModule', using the obvious
110−-- isomorphism.
111−--
112−maybeToContainingModule :: Maybe P.ModuleName -> ContainingModule
113−maybeToContainingModule Nothing = ThisModule
114−maybeToContainingModule (Just mn) = OtherModule mn
115−
116−-- |
117−-- Convert a 'ContainingModule' to a 'Maybe' 'P.ModuleName', using the obvious
118−-- isomorphism.
119−--
120−containingModuleToMaybe :: ContainingModule -> Maybe P.ModuleName
121−containingModuleToMaybe ThisModule = Nothing
122−containingModuleToMaybe (OtherModule mn) = Just mn
123−
124−-- |
125−-- A version of 'fromMaybe' for 'ContainingModule' values.
126−--
127−fromContainingModule :: P.ModuleName -> ContainingModule -> P.ModuleName
128−fromContainingModule def ThisModule = def
129−fromContainingModule _ (OtherModule mn) = mn
130−
131−-- |
132−-- A type representing a highly simplified version of PureScript code, intended
133−-- for use in output formats like plain text or HTML.
134−--
135−newtype RenderedCode
136− = RC { unRC :: [RenderedCodeElement] }
137− deriving (Show, Eq, Ord, Monoid)
138−
139−instance A.ToJSON RenderedCode where
140− toJSON (RC elems) = A.toJSON elems
141−
142−asRenderedCode :: Parse String RenderedCode
143−asRenderedCode = RC <$> eachInArray asRenderedCodeElement
144−
145−-- |
146−-- This function allows conversion of a 'RenderedCode' value into a value of
147−-- some other type (for example, plain text, or HTML). The first argument
148−-- is a function specifying how each individual 'RenderedCodeElement' should be
149−-- rendered.
150−--
151−outputWith :: Monoid a => (RenderedCodeElement -> a) -> RenderedCode -> a
152−outputWith f = foldMap f . unRC
153−
154−-- |
155−-- A 'RenderedCode' fragment representing a space.
156−--
157−sp :: RenderedCode
158−sp = RC [Space]
159−
160−syntax :: String -> RenderedCode
161−syntax x = RC [Syntax x]
162−
163−ident :: String -> RenderedCode
164−ident x = RC [Ident x]
165−
166−ctor :: String -> ContainingModule -> RenderedCode
167−ctor x m = RC [Ctor x m]
168−
169−kind :: String -> RenderedCode
170−kind x = RC [Kind x]
171−
172−keyword :: String -> RenderedCode
173−keyword kw = RC [Keyword kw]
174−
175−keywordForall :: RenderedCode
176−keywordForall = keyword "forall"
177−
178−keywordData :: RenderedCode
179−keywordData = keyword "data"
180−
181−keywordNewtype :: RenderedCode
182−keywordNewtype = keyword "newtype"
183−
184−keywordType :: RenderedCode
185−keywordType = keyword "type"
186−
187−keywordClass :: RenderedCode
188−keywordClass = keyword "class"
189−
190−keywordInstance :: RenderedCode
191−keywordInstance = keyword "instance"
192−
193−keywordWhere :: RenderedCode
194−keywordWhere = keyword "where"
src/Language/PureScript/Docs/Types.hsdeleted−513
@@ -1,513 +0,0 @@
1−{-# LANGUAGE RecordWildCards #-}
2−{-# LANGUAGE OverloadedStrings #-}
3−{-# LANGUAGE TupleSections #-}
4−{-# LANGUAGE RankNTypes #-}
5−{-# LANGUAGE CPP #-}
6−
7−module Language.PureScript.Docs.Types
8− ( module Language.PureScript.Docs.Types
9− , module ReExports
10− )
11− where
12−
13−import Control.Arrow (first, (***))
14−#if __GLASGOW_HASKELL__ < 710
15−import Control.Applicative ((<$>), (<$), (<*>), pure)
16−#endif
17−import Control.Monad (when)
18−import Data.Maybe (mapMaybe)
19−import Data.Version
20−import Data.Aeson ((.=))
21−import qualified Data.Aeson as A
22−import Data.Aeson.BetterErrors
23−import Text.ParserCombinators.ReadP (readP_to_S)
24−import Data.Text (Text)
25−import Data.ByteString.Lazy (ByteString)
26−import qualified Data.Text as T
27−
28−import Web.Bower.PackageMeta hiding (Version, displayError)
29−
30−import qualified Language.PureScript as P
31−
32−import Language.PureScript.Docs.RenderedCode as ReExports
33− (RenderedCode, asRenderedCode,
34− ContainingModule(..), asContainingModule,
35− RenderedCodeElement(..), asRenderedCodeElement)
36−
37−--------------------
38−-- Types
39−
40−data Package a = Package
41− { pkgMeta :: PackageMeta
42− , pkgVersion :: Version
43− , pkgVersionTag :: String
44− , pkgModules :: [Module]
45− , pkgBookmarks :: [Bookmark]
46− , pkgResolvedDependencies :: [(PackageName, Version)]
47− , pkgGithub :: (GithubUser, GithubRepo)
48− , pkgUploader :: a
49− , pkgCompilerVersion :: Version
50− -- ^ The version of the PureScript compiler which was used to generate
51− -- this data. We store this in order to reject packages which are too old.
52− }
53− deriving (Show, Eq, Ord)
54−
55−data NotYetKnown = NotYetKnown
56− deriving (Show, Eq, Ord)
57−
58−type UploadedPackage = Package NotYetKnown
59−type VerifiedPackage = Package GithubUser
60−
61−verifyPackage :: GithubUser -> UploadedPackage -> VerifiedPackage
62−verifyPackage verifiedUser Package{..} =
63− Package pkgMeta
64− pkgVersion
65− pkgVersionTag
66− pkgModules
67− pkgBookmarks
68− pkgResolvedDependencies
69− pkgGithub
70− verifiedUser
71− pkgCompilerVersion
72−
73−packageName :: Package a -> PackageName
74−packageName = bowerName . pkgMeta
75−
76−data Module = Module
77− { modName :: String
78− , modComments :: Maybe String
79− , modDeclarations :: [Declaration]
80− }
81− deriving (Show, Eq, Ord)
82−
83−data Declaration = Declaration
84− { declTitle :: String
85− , declComments :: Maybe String
86− , declSourceSpan :: Maybe P.SourceSpan
87− , declChildren :: [ChildDeclaration]
88− , declFixity :: Maybe P.Fixity
89− , declInfo :: DeclarationInfo
90− }
91− deriving (Show, Eq, Ord)
92−
93−-- |
94−-- A value of this type contains information that is specific to a particular
95−-- kind of declaration (as opposed to information which exists in all kinds of
96−-- declarations, which goes into the 'Declaration' type directly).
97−--
98−-- Many of the constructors are very similar to their equivalents in the real
99−-- PureScript AST, except that they have their name elided, since this is
100−-- already available via the rdTitle field of 'Declaration'.
101−--
102−data DeclarationInfo
103− -- |
104− -- A value declaration, with its type.
105− --
106− = ValueDeclaration P.Type
107−
108− -- |
109− -- A data/newtype declaration, with the kind of declaration (data or
110− -- newtype) and its type arguments. Constructors are represented as child
111− -- declarations.
112− --
113− | DataDeclaration P.DataDeclType [(String, Maybe P.Kind)]
114−
115− -- |
116− -- A data type foreign import, with its kind.
117− --
118− | ExternDataDeclaration P.Kind
119−
120− -- |
121− -- A type synonym, with its type arguments and its type.
122− --
123− | TypeSynonymDeclaration [(String, Maybe P.Kind)] P.Type
124−
125− -- |
126− -- A type class, with its type arguments and its superclasses. Instances and
127− -- members are represented as child declarations.
128− --
129− | TypeClassDeclaration [(String, Maybe P.Kind)] [P.Constraint]
130− deriving (Show, Eq, Ord)
131−
132−declInfoToString :: DeclarationInfo -> String
133−declInfoToString (ValueDeclaration _) = "value"
134−declInfoToString (DataDeclaration _ _) = "data"
135−declInfoToString (ExternDataDeclaration _) = "externData"
136−declInfoToString (TypeSynonymDeclaration _ _) = "typeSynonym"
137−declInfoToString (TypeClassDeclaration _ _) = "typeClass"
138−
139−data ChildDeclaration = ChildDeclaration
140− { cdeclTitle :: String
141− , cdeclComments :: Maybe String
142− , cdeclSourceSpan :: Maybe P.SourceSpan
143− , cdeclInfo :: ChildDeclarationInfo
144− }
145− deriving (Show, Eq, Ord)
146−
147−data ChildDeclarationInfo
148− -- |
149− -- A type instance declaration, with its dependencies and its type.
150− --
151− = ChildInstance [P.Constraint] P.Type
152−
153− -- |
154− -- A data constructor, with its type arguments.
155− --
156− | ChildDataConstructor [P.Type]
157−
158− -- |
159− -- A type class member, with its type. Note that the type does not include
160− -- the type class constraint; this may be added manually if desired. For
161− -- example, `pure` from `Applicative` would be `forall a. a -> f a`.
162− --
163− | ChildTypeClassMember P.Type
164− deriving (Show, Eq, Ord)
165−
166−childDeclInfoToString :: ChildDeclarationInfo -> String
167−childDeclInfoToString (ChildInstance _ _) = "instance"
168−childDeclInfoToString (ChildDataConstructor _) = "dataConstructor"
169−childDeclInfoToString (ChildTypeClassMember _) = "typeClassMember"
170−
171−newtype GithubUser
172− = GithubUser { runGithubUser :: String }
173− deriving (Show, Eq, Ord)
174−
175−newtype GithubRepo
176− = GithubRepo { runGithubRepo :: String }
177− deriving (Show, Eq, Ord)
178−
179−data PackageError
180− = CompilerTooOld Version Version
181− -- ^ Minimum allowable version for generating data with the current
182− -- parser, and actual version used.
183− | ErrorInPackageMeta BowerError
184− | InvalidVersion
185− | InvalidDeclarationType String
186− | InvalidChildDeclarationType String
187− | InvalidFixity
188− | InvalidKind String
189− | InvalidDataDeclType String
190− deriving (Show, Eq, Ord)
191−
192−type Bookmark = InPackage (P.ModuleName, String)
193−
194−data InPackage a
195− = Local a
196− | FromDep PackageName a
197− deriving (Show, Eq, Ord)
198−
199−instance Functor InPackage where
200− fmap f (Local x) = Local (f x)
201− fmap f (FromDep pkgName x) = FromDep pkgName (f x)
202−
203−takeLocal :: InPackage a -> Maybe a
204−takeLocal (Local a) = Just a
205−takeLocal _ = Nothing
206−
207−takeLocals :: [InPackage a] -> [a]
208−takeLocals = mapMaybe takeLocal
209−
210−ignorePackage :: InPackage a -> a
211−ignorePackage (Local x) = x
212−ignorePackage (FromDep _ x) = x
213−
214−----------------------
215−-- Parsing
216−
217−parseUploadedPackage :: Version -> ByteString -> Either (ParseError PackageError) UploadedPackage
218−parseUploadedPackage minVersion = parse $ asUploadedPackage minVersion
219−
220−parseVerifiedPackage :: Version -> ByteString -> Either (ParseError PackageError) VerifiedPackage
221−parseVerifiedPackage minVersion = parse $ asVerifiedPackage minVersion
222−
223−asPackage :: Version -> (forall e. Parse e a) -> Parse PackageError (Package a)
224−asPackage minimumVersion uploader = do
225− -- If the compilerVersion key is missing, we can be sure that it was produced
226− -- with 0.7.0.0, since that is the only released version that included the
227− -- psc-publish tool before this key was added.
228− compilerVersion <- keyOrDefault "compilerVersion" (Version [0,7,0,0] []) asVersion
229− when (compilerVersion < minimumVersion)
230− (throwCustomError $ CompilerTooOld minimumVersion compilerVersion)
231−
232− Package <$> key "packageMeta" asPackageMeta .! ErrorInPackageMeta
233− <*> key "version" asVersion
234− <*> key "versionTag" asString
235− <*> key "modules" (eachInArray asModule)
236− <*> key "bookmarks" asBookmarks .! ErrorInPackageMeta
237− <*> key "resolvedDependencies" asResolvedDependencies
238− <*> key "github" asGithub
239− <*> key "uploader" uploader
240− <*> pure compilerVersion
241−
242−asUploadedPackage :: Version -> Parse PackageError UploadedPackage
243−asUploadedPackage minVersion = asPackage minVersion asNotYetKnown
244−
245−asNotYetKnown :: Parse e NotYetKnown
246−asNotYetKnown = NotYetKnown <$ asNull
247−
248−instance A.FromJSON NotYetKnown where
249− parseJSON = toAesonParser' asNotYetKnown
250−
251−asVerifiedPackage :: Version -> Parse PackageError VerifiedPackage
252−asVerifiedPackage minVersion = asPackage minVersion asGithubUser
253−
254−displayPackageError :: PackageError -> Text
255−displayPackageError e = case e of
256− CompilerTooOld minV usedV ->
257− "Expecting data produced by at least version " <> T.pack (showVersion minV)
258− <> " of the compiler, but it appears that " <> T.pack (showVersion usedV)
259− <> " was used."
260− ErrorInPackageMeta err ->
261− "Error in package metadata: " <> showBowerError err
262− InvalidVersion ->
263− "Invalid version"
264− InvalidDeclarationType str ->
265− "Invalid declaration type: \"" <> T.pack str <> "\""
266− InvalidChildDeclarationType str ->
267− "Invalid child declaration type: \"" <> T.pack str <> "\""
268− InvalidFixity ->
269− "Invalid fixity"
270− InvalidKind str ->
271− "Invalid kind: \"" <> T.pack str <> "\""
272− InvalidDataDeclType str ->
273− "Invalid data declaration type: \"" <> T.pack str <> "\""
274− where
275− (<>) = T.append
276−
277−instance A.FromJSON a => A.FromJSON (Package a) where
278− parseJSON = toAesonParser displayPackageError
279− (asPackage (Version [0,0,0,0] []) fromAesonParser)
280−
281−asGithubUser :: Parse e GithubUser
282−asGithubUser = GithubUser <$> asString
283−
284−instance A.FromJSON GithubUser where
285− parseJSON = toAesonParser' asGithubUser
286−
287−asVersion :: Parse PackageError Version
288−asVersion = withString (maybe (Left InvalidVersion) Right . parseVersion')
289−
290−parseVersion' :: String -> Maybe Version
291−parseVersion' str =
292− case filter (null . snd) $ readP_to_S parseVersion str of
293− [(vers, "")] -> Just vers
294− _ -> Nothing
295−
296−asModule :: Parse PackageError Module
297−asModule =
298− Module <$> key "name" asString
299− <*> key "comments" (perhaps asString)
300− <*> key "declarations" (eachInArray asDeclaration)
301−
302−asDeclaration :: Parse PackageError Declaration
303−asDeclaration =
304− Declaration <$> key "title" asString
305− <*> key "comments" (perhaps asString)
306− <*> key "sourceSpan" (perhaps asSourceSpan)
307− <*> key "children" (eachInArray asChildDeclaration)
308− <*> key "fixity" (perhaps asFixity)
309− <*> key "info" asDeclarationInfo
310−
311−asFixity :: Parse PackageError P.Fixity
312−asFixity = P.Fixity <$> key "associativity" asAssociativity
313− <*> key "precedence" asIntegral
314−
315−parseAssociativity :: String -> Maybe P.Associativity
316−parseAssociativity str = case str of
317− "infix" -> Just P.Infix
318− "infixl" -> Just P.Infixl
319− "infixr" -> Just P.Infixr
320− _ -> Nothing
321−
322−asAssociativity :: Parse PackageError P.Associativity
323−asAssociativity = withString (maybe (Left InvalidFixity) Right . parseAssociativity)
324−
325−asDeclarationInfo :: Parse PackageError DeclarationInfo
326−asDeclarationInfo = do
327− ty <- key "declType" asString
328− case ty of
329− "value" ->
330− ValueDeclaration <$> key "type" asType
331− "data" ->
332− DataDeclaration <$> key "dataDeclType" asDataDeclType
333− <*> key "typeArguments" asTypeArguments
334− "externData" ->
335− ExternDataDeclaration <$> key "kind" asKind
336− "typeSynonym" ->
337− TypeSynonymDeclaration <$> key "arguments" asTypeArguments
338− <*> key "type" asType
339− "typeClass" ->
340− TypeClassDeclaration <$> key "arguments" asTypeArguments
341− <*> key "superclasses" (eachInArray asConstraint)
342− other ->
343− throwCustomError (InvalidDeclarationType other)
344−
345−asTypeArguments :: Parse PackageError [(String, Maybe P.Kind)]
346−asTypeArguments = eachInArray asTypeArgument
347− where
348− asTypeArgument = (,) <$> nth 0 asString <*> nth 1 (perhaps asKind)
349−
350−asKind :: Parse e P.Kind
351−asKind = fromAesonParser
352−
353−asType :: Parse e P.Type
354−asType = fromAesonParser
355−
356−asDataDeclType :: Parse PackageError P.DataDeclType
357−asDataDeclType =
358− withString $ \s -> case s of
359− "data" -> Right P.Data
360− "newtype" -> Right P.Newtype
361− other -> Left (InvalidDataDeclType other)
362−
363−asChildDeclaration :: Parse PackageError ChildDeclaration
364−asChildDeclaration =
365− ChildDeclaration <$> key "title" asString
366− <*> key "comments" (perhaps asString)
367− <*> key "sourceSpan" (perhaps asSourceSpan)
368− <*> key "info" asChildDeclarationInfo
369−
370−asChildDeclarationInfo :: Parse PackageError ChildDeclarationInfo
371−asChildDeclarationInfo = do
372− ty <- key "declType" asString
373− case ty of
374− "instance" ->
375− ChildInstance <$> key "dependencies" (eachInArray asConstraint)
376− <*> key "type" asType
377− "dataConstructor" ->
378− ChildDataConstructor <$> key "arguments" (eachInArray asType)
379− "typeClassMember" ->
380− ChildTypeClassMember <$> key "type" asType
381− other ->
382− throwCustomError $ InvalidChildDeclarationType other
383−
384−asSourcePos :: Parse e P.SourcePos
385−asSourcePos = P.SourcePos <$> nth 0 asIntegral
386− <*> nth 1 asIntegral
387−
388−asConstraint :: Parse PackageError P.Constraint
389−asConstraint = (,) <$> nth 0 asQualifiedProperName
390− <*> nth 1 (eachInArray asType)
391−
392−asQualifiedProperName :: Parse e (P.Qualified P.ProperName)
393−asQualifiedProperName = fromAesonParser
394−
395−asBookmarks :: Parse BowerError [Bookmark]
396−asBookmarks = eachInArray asBookmark
397−
398−asBookmark :: Parse BowerError Bookmark
399−asBookmark =
400− build <$> key "package" (perhaps (withString parsePackageName))
401− <*> key "item" ((,) <$> nth 0 (P.moduleNameFromString <$> asString)
402− <*> nth 1 asString)
403− where
404− build Nothing = Local
405− build (Just pn) = FromDep pn
406−
407−asResolvedDependencies :: Parse PackageError [(PackageName, Version)]
408−asResolvedDependencies =
409− eachInObjectWithKey (mapLeft ErrorInPackageMeta . parsePackageName . T.unpack) asVersion
410− where
411− mapLeft f (Left x) = Left (f x)
412− mapLeft _ (Right x) = Right x
413−
414−asGithub :: Parse e (GithubUser, GithubRepo)
415−asGithub = (,) <$> nth 0 (GithubUser <$> asString)
416− <*> nth 1 (GithubRepo <$> asString)
417−
418−asSourceSpan :: Parse e P.SourceSpan
419−asSourceSpan = P.SourceSpan <$> key "name" asString
420− <*> key "start" asSourcePos
421− <*> key "end" asSourcePos
422−
423−---------------------
424−-- ToJSON instances
425−
426−instance A.ToJSON a => A.ToJSON (Package a) where
427− toJSON Package{..} =
428− A.object
429− [ "packageMeta" .= pkgMeta
430− , "version" .= showVersion pkgVersion
431− , "versionTag" .= pkgVersionTag
432− , "modules" .= pkgModules
433− , "bookmarks" .= map (fmap (first P.runModuleName)) pkgBookmarks
434− , "resolvedDependencies" .= assocListToJSON (T.pack . runPackageName)
435− (T.pack . showVersion)
436− pkgResolvedDependencies
437− , "github" .= pkgGithub
438− , "uploader" .= pkgUploader
439− , "compilerVersion" .= showVersion P.version
440− ]
441−
442−instance A.ToJSON NotYetKnown where
443− toJSON _ = A.Null
444−
445−instance A.ToJSON Module where
446− toJSON Module{..} =
447− A.object [ "name" .= modName
448− , "comments" .= modComments
449− , "declarations" .= modDeclarations
450− ]
451−
452−instance A.ToJSON Declaration where
453− toJSON Declaration{..} =
454− A.object [ "title" .= declTitle
455− , "comments" .= declComments
456− , "sourceSpan" .= declSourceSpan
457− , "children" .= declChildren
458− , "fixity" .= declFixity
459− , "info" .= declInfo
460− ]
461−
462−instance A.ToJSON ChildDeclaration where
463− toJSON ChildDeclaration{..} =
464− A.object [ "title" .= cdeclTitle
465− , "comments" .= cdeclComments
466− , "sourceSpan" .= cdeclSourceSpan
467− , "info" .= cdeclInfo
468− ]
469−
470−instance A.ToJSON DeclarationInfo where
471− toJSON info = A.object $ "declType" .= declInfoToString info : props
472− where
473− props = case info of
474− ValueDeclaration ty -> ["type" .= ty]
475− DataDeclaration ty args -> ["dataDeclType" .= ty, "typeArguments" .= args]
476− ExternDataDeclaration kind -> ["kind" .= kind]
477− TypeSynonymDeclaration args ty -> ["arguments" .= args, "type" .= ty]
478− TypeClassDeclaration args super -> ["arguments" .= args, "superclasses" .= super]
479−
480−instance A.ToJSON ChildDeclarationInfo where
481− toJSON info = A.object $ "declType" .= childDeclInfoToString info : props
482− where
483− props = case info of
484− ChildInstance deps ty -> ["dependencies" .= deps, "type" .= ty]
485− ChildDataConstructor args -> ["arguments" .= args]
486− ChildTypeClassMember ty -> ["type" .= ty]
487−
488−instance A.ToJSON GithubUser where
489− toJSON = A.toJSON . runGithubUser
490−
491−instance A.ToJSON GithubRepo where
492− toJSON = A.toJSON . runGithubRepo
493−
494−-- | Given a function for turning association list keys into JSON object keys,
495−-- and a function for turning association list values to JSON string values,
496−-- turns an association list into a JSON object.
497−--
498−-- For example:
499−-- @assocListToJSON T.pack T.pack [("a", "b")]@ will give @{"a": "b"}@.
500−assocListToJSON :: (a -> Text) -> (b -> Text) -> [(a, b)] -> A.Value
501−assocListToJSON f g xs = A.object (map (uncurry (.=) . (f *** g)) xs)
502−
503−instance A.ToJSON a => A.ToJSON (InPackage a) where
504− toJSON x =
505− case x of
506− Local y -> withPackage (Nothing :: Maybe ()) y
507− FromDep pn y -> withPackage (Just pn) y
508− where
509− withPackage :: (A.ToJSON p, A.ToJSON x) => p -> x -> A.Value
510− withPackage p y =
511− A.object [ "package" .= p
512− , "item" .= y
513− ]
src/Language/PureScript/Docs/Utils/MonoidExtras.hsdeleted−9
@@ -1,9 +0,0 @@
1−module Language.PureScript.Docs.Utils.MonoidExtras where
2−
3−import Data.Monoid
4−
5−mintersperse :: (Monoid m) => m -> [m] -> m
6−mintersperse _ [] = mempty
7−mintersperse _ [x] = x
8−mintersperse sep (x:xs) = x <> sep <> mintersperse sep xs
9−
src/Language/PureScript/Environment.hsdeleted−272
@@ -1,272 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.Environment
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−{-# LANGUAGE OverloadedStrings #-}
17−{-# LANGUAGE TemplateHaskell #-}
18−
19−module Language.PureScript.Environment where
20−
21−import Data.Data
22−import Data.Maybe (fromMaybe)
23−import Data.Aeson.TH
24−import qualified Data.Map as M
25−import qualified Data.Text as T
26−import qualified Data.Aeson as A
27−
28−import Language.PureScript.Kinds
29−import Language.PureScript.Names
30−import Language.PureScript.TypeClassDictionaries
31−import Language.PureScript.Types
32−import qualified Language.PureScript.Constants as C
33−
34−-- |
35−-- The @Environment@ defines all values and types which are currently in scope:
36−--
37−data Environment = Environment {
38− -- |
39− -- Value names currently in scope
40− --
41− names :: M.Map (ModuleName, Ident) (Type, NameKind, NameVisibility)
42− -- |
43− -- Type names currently in scope
44− --
45− , types :: M.Map (Qualified ProperName) (Kind, TypeKind)
46− -- |
47− -- Data constructors currently in scope, along with their associated type
48− -- constructor name, argument types and return type.
49− , dataConstructors :: M.Map (Qualified ProperName) (DataDeclType, ProperName, Type, [Ident])
50− -- |
51− -- Type synonyms currently in scope
52− --
53− , typeSynonyms :: M.Map (Qualified ProperName) ([(String, Maybe Kind)], Type)
54− -- |
55− -- Available type class dictionaries
56− --
57− , typeClassDictionaries :: M.Map (Maybe ModuleName) (M.Map (Qualified ProperName) (M.Map (Qualified Ident) TypeClassDictionaryInScope))
58− -- |
59− -- Type classes
60− --
61− , typeClasses :: M.Map (Qualified ProperName) ([(String, Maybe Kind)], [(Ident, Type)], [Constraint])
62− } deriving (Show, Read)
63−
64−-- |
65−-- The initial environment with no values and only the default javascript types defined
66−--
67−initEnvironment :: Environment
68−initEnvironment = Environment M.empty primTypes M.empty M.empty M.empty M.empty
69−
70−-- |
71−-- The visibility of a name in scope
72−--
73−data NameVisibility
74− -- |
75− -- The name is defined in the current binding group, but is not visible
76− --
77− = Undefined
78− -- |
79− -- The name is defined in the another binding group, or has been made visible by a function binder
80− --
81− | Defined deriving (Show, Read, Eq)
82−
83−-- |
84−-- A flag for whether a name is for an private or public value - only public values will be
85−-- included in a generated externs file.
86−--
87−data NameKind
88− -- |
89− -- A private value introduced as an artifact of code generation (class instances, class member
90− -- accessors, etc.)
91− --
92− = Private
93− -- |
94− -- A public value for a module member or foreing import declaration
95− --
96− | Public
97− -- |
98− -- A name for member introduced by foreign import
99− --
100− | External deriving (Show, Read, Eq, Data, Typeable)
101−
102−-- |
103−-- The kinds of a type
104−--
105−data TypeKind
106− -- |
107− -- Data type
108− --
109− = DataType [(String, Maybe Kind)] [(ProperName, [Type])]
110− -- |
111− -- Type synonym
112− --
113− | TypeSynonym
114− -- |
115− -- Foreign data
116− --
117− | ExternData
118− -- |
119− -- A local type variable
120− --
121− | LocalTypeVariable
122− -- |
123− -- A scoped type variable
124− --
125− | ScopedTypeVar
126− deriving (Show, Read, Eq, Data, Typeable)
127−
128−-- |
129−-- The type ('data' or 'newtype') of a data type declaration
130−--
131−data DataDeclType
132− -- |
133− -- A standard data constructor
134− --
135− = Data
136− -- |
137− -- A newtype constructor
138− --
139− | Newtype deriving (Show, Read, Eq, Ord, Data, Typeable)
140−
141−showDataDeclType :: DataDeclType -> String
142−showDataDeclType Data = "data"
143−showDataDeclType Newtype = "newtype"
144−
145−instance A.ToJSON DataDeclType where
146− toJSON = A.toJSON . showDataDeclType
147−
148−instance A.FromJSON DataDeclType where
149− parseJSON = A.withText "DataDeclType" $ \str ->
150− case str of
151− "data" -> return Data
152− "newtype" -> return Newtype
153− other -> fail $ "invalid type: '" ++ T.unpack other ++ "'"
154−
155−-- |
156−-- Construct a ProperName in the Prim module
157−--
158−primName :: String -> Qualified ProperName
159−primName = Qualified (Just $ ModuleName [ProperName C.prim]) . ProperName
160−
161−-- |
162−-- Construct a type in the Prim module
163−--
164−primTy :: String -> Type
165−primTy = TypeConstructor . primName
166−
167−-- |
168−-- Type constructor for functions
169−--
170−tyFunction :: Type
171−tyFunction = primTy "Function"
172−
173−-- |
174−-- Type constructor for strings
175−--
176−tyString :: Type
177−tyString = primTy "String"
178−
179−-- |
180−-- Type constructor for strings
181−--
182−tyChar :: Type
183−tyChar = primTy "Char"
184−
185−-- |
186−-- Type constructor for numbers
187−--
188−tyNumber :: Type
189−tyNumber = primTy "Number"
190−
191−-- |
192−-- Type constructor for integers
193−--
194−tyInt :: Type
195−tyInt = primTy "Int"
196−
197−-- |
198−-- Type constructor for booleans
199−--
200−tyBoolean :: Type
201−tyBoolean = primTy "Boolean"
202−
203−-- |
204−-- Type constructor for arrays
205−--
206−tyArray :: Type
207−tyArray = primTy "Array"
208−
209−-- |
210−-- Type constructor for objects
211−--
212−tyObject :: Type
213−tyObject = primTy "Object"
214−
215−-- |
216−-- Check whether a type is an object
217−--
218−isObject :: Type -> Bool
219−isObject = isTypeOrApplied tyObject
220−
221−-- |
222−-- Check whether a type is a function
223−--
224−isFunction :: Type -> Bool
225−isFunction = isTypeOrApplied tyFunction
226−
227−isTypeOrApplied :: Type -> Type -> Bool
228−isTypeOrApplied t1 (TypeApp t2 _) = t1 == t2
229−isTypeOrApplied t1 t2 = t1 == t2
230−
231−-- |
232−-- Smart constructor for function types
233−--
234−function :: Type -> Type -> Type
235−function t1 = TypeApp (TypeApp tyFunction t1)
236−
237−-- |
238−-- The primitive types in the external javascript environment with their associated kinds.
239−--
240−primTypes :: M.Map (Qualified ProperName) (Kind, TypeKind)
241−primTypes = M.fromList [ (primName "Function" , (FunKind Star (FunKind Star Star), ExternData))
242− , (primName "Array" , (FunKind Star Star, ExternData))
243− , (primName "Object" , (FunKind (Row Star) Star, ExternData))
244− , (primName "String" , (Star, ExternData))
245− , (primName "Char" , (Star, ExternData))
246− , (primName "Number" , (Star, ExternData))
247− , (primName "Int" , (Star, ExternData))
248− , (primName "Boolean" , (Star, ExternData)) ]
249−
250−-- |
251−-- Finds information about data constructors from the current environment.
252−--
253−lookupConstructor :: Environment -> Qualified ProperName -> (DataDeclType, ProperName, Type, [Ident])
254−lookupConstructor env ctor =
255− fromMaybe (error "Data constructor not found") $ ctor `M.lookup` dataConstructors env
256−
257−-- |
258−-- Checks whether a data constructor is for a newtype.
259−--
260−isNewtypeConstructor :: Environment -> Qualified ProperName -> Bool
261−isNewtypeConstructor e ctor = case lookupConstructor e ctor of
262− (Newtype, _, _, _) -> True
263− (Data, _, _, _) -> False
264−
265−-- |
266−-- Finds information about values from the current environment.
267−--
268−lookupValue :: Environment -> Qualified Ident -> Maybe (Type, NameKind, NameVisibility)
269−lookupValue env (Qualified (Just mn) ident) = (mn, ident) `M.lookup` names env
270−lookupValue _ _ = Nothing
271−
272−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''TypeKind)
src/Language/PureScript/Errors.hsdeleted−967
@@ -1,967 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.Error
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
16−{-# LANGUAGE FlexibleContexts #-}
17−{-# LANGUAGE MultiParamTypeClasses #-}
18−{-# LANGUAGE CPP #-}
19−
20−module Language.PureScript.Errors where
21−
22−import Data.Either (lefts, rights)
23−import Data.List (intercalate, transpose, nub, nubBy, partition)
24−import Data.Function (on)
25−#if __GLASGOW_HASKELL__ < 710
26−import Data.Foldable (fold, foldMap)
27−import Data.Traversable (traverse)
28−#else
29−import Data.Foldable (fold)
30−#endif
31−
32−import qualified Data.Map as M
33−
34−import Control.Monad
35−import Control.Monad.Unify
36−import Control.Monad.Writer
37−import Control.Monad.Error.Class (MonadError(..))
38−#if __GLASGOW_HASKELL__ < 710
39−import Control.Applicative ((<$>), (<*>), Applicative, pure)
40−#endif
41−import Control.Monad.Trans.State.Lazy
42−import Control.Arrow(first)
43−
44−import Language.PureScript.AST
45−import Language.PureScript.Environment (isObject, isFunction)
46−import Language.PureScript.Pretty
47−import Language.PureScript.Types
48−import Language.PureScript.Names
49−import Language.PureScript.Kinds
50−
51−import qualified Text.PrettyPrint.Boxes as Box
52−
53−import qualified Text.Parsec as P
54−import qualified Text.Parsec.Error as PE
55−import Text.Parsec.Error (Message(..))
56−
57−-- | A type of error messages
58−data SimpleErrorMessage
59− = ErrorParsingExterns P.ParseError
60− | ErrorParsingFFIModule FilePath
61− | ErrorParsingModule P.ParseError
62− | MissingFFIModule ModuleName
63− | MultipleFFIModules ModuleName [FilePath]
64− | UnnecessaryFFIModule ModuleName FilePath
65− | InvalidExternsFile FilePath
66− | CannotGetFileInfo FilePath
67− | CannotReadFile FilePath
68− | CannotWriteFile FilePath
69− | InfiniteType Type
70− | InfiniteKind Kind
71− | CannotReorderOperators
72− | MultipleFixities Ident
73− | OrphanTypeDeclaration Ident
74− | OrphanFixityDeclaration String
75− | RedefinedModule ModuleName [SourceSpan]
76− | RedefinedIdent Ident
77− | OverlappingNamesInLet
78− | UnknownModule ModuleName
79− | UnknownType (Qualified ProperName)
80− | UnknownTypeClass (Qualified ProperName)
81− | UnknownValue (Qualified Ident)
82− | UnknownDataConstructor (Qualified ProperName) (Maybe (Qualified ProperName))
83− | UnknownTypeConstructor (Qualified ProperName)
84− | UnknownImportType ModuleName ProperName
85− | UnknownExportType ProperName
86− | UnknownImportTypeClass ModuleName ProperName
87− | UnknownExportTypeClass ProperName
88− | UnknownImportValue ModuleName Ident
89− | UnknownExportValue Ident
90− | UnknownExportModule ModuleName
91− | UnknownImportDataConstructor ModuleName ProperName ProperName
92− | UnknownExportDataConstructor ProperName ProperName
93− | ConflictingImport String ModuleName
94− | ConflictingImports String ModuleName ModuleName
95− | ConflictingTypeDecls ProperName
96− | ConflictingCtorDecls ProperName
97− | TypeConflictsWithClass ProperName
98− | CtorConflictsWithClass ProperName
99− | ClassConflictsWithType ProperName
100− | ClassConflictsWithCtor ProperName
101− | DuplicateModuleName ModuleName
102− | DuplicateClassExport ProperName
103− | DuplicateValueExport Ident
104− | DuplicateTypeArgument String
105− | InvalidDoBind
106− | InvalidDoLet
107− | CycleInDeclaration Ident
108− | CycleInTypeSynonym (Maybe ProperName)
109− | CycleInModules [ModuleName]
110− | NameIsUndefined Ident
111− | NameNotInScope Ident
112− | UndefinedTypeVariable ProperName
113− | PartiallyAppliedSynonym (Qualified ProperName)
114− | EscapedSkolem (Maybe Expr)
115− | UnspecifiedSkolemScope
116− | TypesDoNotUnify Type Type
117− | KindsDoNotUnify Kind Kind
118− | ConstrainedTypeUnified Type Type
119− | OverlappingInstances (Qualified ProperName) [Type] [Qualified Ident]
120− | NoInstanceFound (Qualified ProperName) [Type]
121− | PossiblyInfiniteInstance (Qualified ProperName) [Type]
122− | CannotDerive (Qualified ProperName) [Type]
123− | CannotFindDerivingType ProperName
124− | DuplicateLabel String (Maybe Expr)
125− | DuplicateValueDeclaration Ident
126− | ArgListLengthsDiffer Ident
127− | OverlappingArgNames (Maybe Ident)
128− | MissingClassMember Ident
129− | ExtraneousClassMember Ident
130− | ExpectedType Type Kind
131− | IncorrectConstructorArity (Qualified ProperName)
132− | SubsumptionCheckFailed
133− | ExprDoesNotHaveType Expr Type
134− | PropertyIsMissing String Type
135− | CannotApplyFunction Type Expr
136− | TypeSynonymInstance
137− | OrphanInstance Ident (Qualified ProperName) [Type]
138− | InvalidNewtype
139− | InvalidInstanceHead Type
140− | TransitiveExportError DeclarationRef [DeclarationRef]
141− | ShadowedName Ident
142− | ShadowedTypeVar String
143− | UnusedTypeVar String
144− | WildcardInferredType Type
145− | MissingTypeDeclaration Ident Type
146− | NotExhaustivePattern [[Binder]] Bool
147− | OverlappingPattern [[Binder]] Bool
148− | IncompleteExhaustivityCheck
149− | ClassOperator ProperName Ident
150− | MisleadingEmptyTypeImport ModuleName ProperName
151− | ImportHidingModule ModuleName
152− deriving Show
153−
154−-- | Error message hints, providing more detailed information about failure.
155−data ErrorMessageHint
156− = NotYetDefined [Ident]
157− | ErrorUnifyingTypes Type Type
158− | ErrorInExpression Expr
159− | ErrorInModule ModuleName
160− | ErrorInInstance (Qualified ProperName) [Type]
161− | ErrorInSubsumption Type Type
162− | ErrorCheckingType Expr Type
163− | ErrorCheckingKind Type
164− | ErrorInferringType Expr
165− | ErrorInApplication Expr Type Expr
166− | ErrorInDataConstructor ProperName
167− | ErrorInTypeConstructor ProperName
168− | ErrorInBindingGroup [Ident]
169− | ErrorInDataBindingGroup
170− | ErrorInTypeSynonym ProperName
171− | ErrorInValueDeclaration Ident
172− | ErrorInTypeDeclaration Ident
173− | ErrorInForeignImport Ident
174− | PositionedError SourceSpan
175− deriving Show
176−
177−-- | Categories of hints
178−data HintCategory
179− = ExprHint
180− | KindHint
181− | CheckHint
182− | PositionHint
183− | OtherHint
184− deriving (Show, Eq)
185−
186−data ErrorMessage = ErrorMessage [ErrorMessageHint] SimpleErrorMessage deriving (Show)
187−
188−instance UnificationError Type ErrorMessage where
189− occursCheckFailed t = ErrorMessage [] $ InfiniteType t
190−
191−instance UnificationError Kind ErrorMessage where
192− occursCheckFailed k = ErrorMessage [] $ InfiniteKind k
193−
194−-- |
195−-- Get the error code for a particular error type
196−--
197−errorCode :: ErrorMessage -> String
198−errorCode em = case unwrapErrorMessage em of
199− ErrorParsingExterns{} -> "ErrorParsingExterns"
200− ErrorParsingFFIModule{} -> "ErrorParsingFFIModule"
201− ErrorParsingModule{} -> "ErrorParsingModule"
202− MissingFFIModule{} -> "MissingFFIModule"
203− MultipleFFIModules{} -> "MultipleFFIModules"
204− UnnecessaryFFIModule{} -> "UnnecessaryFFIModule"
205− InvalidExternsFile{} -> "InvalidExternsFile"
206− CannotGetFileInfo{} -> "CannotGetFileInfo"
207− CannotReadFile{} -> "CannotReadFile"
208− CannotWriteFile{} -> "CannotWriteFile"
209− InfiniteType{} -> "InfiniteType"
210− InfiniteKind{} -> "InfiniteKind"
211− CannotReorderOperators -> "CannotReorderOperators"
212− MultipleFixities{} -> "MultipleFixities"
213− OrphanTypeDeclaration{} -> "OrphanTypeDeclaration"
214− OrphanFixityDeclaration{} -> "OrphanFixityDeclaration"
215− RedefinedModule{} -> "RedefinedModule"
216− RedefinedIdent{} -> "RedefinedIdent"
217− OverlappingNamesInLet -> "OverlappingNamesInLet"
218− UnknownModule{} -> "UnknownModule"
219− UnknownType{} -> "UnknownType"
220− UnknownTypeClass{} -> "UnknownTypeClass"
221− UnknownValue{} -> "UnknownValue"
222− UnknownDataConstructor{} -> "UnknownDataConstructor"
223− UnknownTypeConstructor{} -> "UnknownTypeConstructor"
224− UnknownImportType{} -> "UnknownImportType"
225− UnknownExportType{} -> "UnknownExportType"
226− UnknownImportTypeClass{} -> "UnknownImportTypeClass"
227− UnknownExportTypeClass{} -> "UnknownExportTypeClass"
228− UnknownImportValue{} -> "UnknownImportValue"
229− UnknownExportValue{} -> "UnknownExportValue"
230− UnknownExportModule{} -> "UnknownExportModule"
231− UnknownImportDataConstructor{} -> "UnknownImportDataConstructor"
232− UnknownExportDataConstructor{} -> "UnknownExportDataConstructor"
233− ConflictingImport{} -> "ConflictingImport"
234− ConflictingImports{} -> "ConflictingImports"
235− ConflictingTypeDecls{} -> "ConflictingTypeDecls"
236− ConflictingCtorDecls{} -> "ConflictingCtorDecls"
237− TypeConflictsWithClass{} -> "TypeConflictsWithClass"
238− CtorConflictsWithClass{} -> "CtorConflictsWithClass"
239− ClassConflictsWithType{} -> "ClassConflictsWithType"
240− ClassConflictsWithCtor{} -> "ClassConflictsWithCtor"
241− DuplicateModuleName{} -> "DuplicateModuleName"
242− DuplicateClassExport{} -> "DuplicateClassExport"
243− DuplicateValueExport{} -> "DuplicateValueExport"
244− DuplicateTypeArgument{} -> "DuplicateTypeArgument"
245− InvalidDoBind -> "InvalidDoBind"
246− InvalidDoLet -> "InvalidDoLet"
247− CycleInDeclaration{} -> "CycleInDeclaration"
248− CycleInTypeSynonym{} -> "CycleInTypeSynonym"
249− CycleInModules{} -> "CycleInModules"
250− NameIsUndefined{} -> "NameIsUndefined"
251− NameNotInScope{} -> "NameNotInScope"
252− UndefinedTypeVariable{} -> "UndefinedTypeVariable"
253− PartiallyAppliedSynonym{} -> "PartiallyAppliedSynonym"
254− EscapedSkolem{} -> "EscapedSkolem"
255− UnspecifiedSkolemScope -> "UnspecifiedSkolemScope"
256− TypesDoNotUnify{} -> "TypesDoNotUnify"
257− KindsDoNotUnify{} -> "KindsDoNotUnify"
258− ConstrainedTypeUnified{} -> "ConstrainedTypeUnified"
259− OverlappingInstances{} -> "OverlappingInstances"
260− NoInstanceFound{} -> "NoInstanceFound"
261− PossiblyInfiniteInstance{} -> "PossiblyInfiniteInstance"
262− CannotDerive{} -> "CannotDerive"
263− CannotFindDerivingType{} -> "CannotFindDerivingType"
264− DuplicateLabel{} -> "DuplicateLabel"
265− DuplicateValueDeclaration{} -> "DuplicateValueDeclaration"
266− ArgListLengthsDiffer{} -> "ArgListLengthsDiffer"
267− OverlappingArgNames{} -> "OverlappingArgNames"
268− MissingClassMember{} -> "MissingClassMember"
269− ExtraneousClassMember{} -> "ExtraneousClassMember"
270− ExpectedType{} -> "ExpectedType"
271− IncorrectConstructorArity{} -> "IncorrectConstructorArity"
272− SubsumptionCheckFailed -> "SubsumptionCheckFailed"
273− ExprDoesNotHaveType{} -> "ExprDoesNotHaveType"
274− PropertyIsMissing{} -> "PropertyIsMissing"
275− CannotApplyFunction{} -> "CannotApplyFunction"
276− TypeSynonymInstance -> "TypeSynonymInstance"
277− OrphanInstance{} -> "OrphanInstance"
278− InvalidNewtype -> "InvalidNewtype"
279− InvalidInstanceHead{} -> "InvalidInstanceHead"
280− TransitiveExportError{} -> "TransitiveExportError"
281− ShadowedName{} -> "ShadowedName"
282− ShadowedTypeVar{} -> "ShadowedTypeVar"
283− UnusedTypeVar{} -> "UnusedTypeVar"
284− WildcardInferredType{} -> "WildcardInferredType"
285− MissingTypeDeclaration{} -> "MissingTypeDeclaration"
286− NotExhaustivePattern{} -> "NotExhaustivePattern"
287− OverlappingPattern{} -> "OverlappingPattern"
288− IncompleteExhaustivityCheck{} -> "IncompleteExhaustivityCheck"
289− ClassOperator{} -> "ClassOperator"
290− MisleadingEmptyTypeImport{} -> "MisleadingEmptyTypeImport"
291− ImportHidingModule{} -> "ImportHidingModule"
292−
293−-- |
294−-- A stack trace for an error
295−--
296−newtype MultipleErrors = MultipleErrors
297− { runMultipleErrors :: [ErrorMessage] } deriving (Show, Monoid)
298−
299−instance UnificationError Type MultipleErrors where
300− occursCheckFailed t = MultipleErrors [occursCheckFailed t]
301−
302−instance UnificationError Kind MultipleErrors where
303− occursCheckFailed k = MultipleErrors [occursCheckFailed k]
304−
305−-- | Check whether a collection of errors is empty or not.
306−nonEmpty :: MultipleErrors -> Bool
307−nonEmpty = not . null . runMultipleErrors
308−
309−-- |
310−-- Create an error set from a single simple error message
311−--
312−errorMessage :: SimpleErrorMessage -> MultipleErrors
313−errorMessage err = MultipleErrors [ErrorMessage [] err]
314−
315−
316−-- |
317−-- Create an error set from a single error message
318−--
319−singleError :: ErrorMessage -> MultipleErrors
320−singleError = MultipleErrors . pure
321−
322−-- | Lift a function on ErrorMessage to a function on MultipleErrors
323−onErrorMessages :: (ErrorMessage -> ErrorMessage) -> MultipleErrors -> MultipleErrors
324−onErrorMessages f = MultipleErrors . map f . runMultipleErrors
325−
326−-- | Add a hint to an error message
327−addHint :: ErrorMessageHint -> MultipleErrors -> MultipleErrors
328−addHint hint = onErrorMessages $ \(ErrorMessage hints se) -> ErrorMessage (hint : hints) se
329−
330−-- | The various types of things which might need to be relabelled in errors messages.
331−data LabelType = TypeLabel | SkolemLabel String deriving (Show, Read, Eq, Ord)
332−
333−-- | A map from rigid type variable name/unknown variable pairs to new variables.
334−type UnknownMap = M.Map (LabelType, Unknown) Unknown
335−
336−-- | How critical the issue is
337−data Level = Error | Warning deriving Show
338−
339−-- |
340−-- Extract nested error messages from wrapper errors
341−--
342−unwrapErrorMessage :: ErrorMessage -> SimpleErrorMessage
343−unwrapErrorMessage (ErrorMessage _ se) = se
344−
345−replaceUnknowns :: Type -> State UnknownMap Type
346−replaceUnknowns = everywhereOnTypesM replaceTypes
347− where
348− lookupTable :: (LabelType, Unknown) -> UnknownMap -> (Unknown, UnknownMap)
349− lookupTable x m = case M.lookup x m of
350− Nothing -> let i = length (filter (on (==) fst x) (M.keys m)) in (i, M.insert x i m)
351− Just i -> (i, m)
352−
353− replaceTypes :: Type -> State UnknownMap Type
354− replaceTypes (TUnknown u) = state $ first TUnknown . lookupTable (TypeLabel, u)
355− replaceTypes (Skolem name s sko) = state $ first (flip (Skolem name) sko) . lookupTable (SkolemLabel name, s)
356− replaceTypes other = return other
357−
358−onTypesInErrorMessageM :: (Applicative m) => (Type -> m Type) -> ErrorMessage -> m ErrorMessage
359−onTypesInErrorMessageM f (ErrorMessage hints simple) = ErrorMessage <$> traverse gHint hints <*> gSimple simple
360− where
361− gSimple (InfiniteType t) = InfiniteType <$> f t
362− gSimple (TypesDoNotUnify t1 t2) = TypesDoNotUnify <$> f t1 <*> f t2
363− gSimple (ConstrainedTypeUnified t1 t2) = ConstrainedTypeUnified <$> f t1 <*> f t2
364− gSimple (ExprDoesNotHaveType e t) = ExprDoesNotHaveType e <$> f t
365− gSimple (PropertyIsMissing s t) = PropertyIsMissing s <$> f t
366− gSimple (CannotApplyFunction t e) = CannotApplyFunction <$> f t <*> pure e
367− gSimple (InvalidInstanceHead t) = InvalidInstanceHead <$> f t
368− gSimple other = pure other
369− gHint (ErrorInSubsumption t1 t2) = ErrorInSubsumption <$> f t1 <*> f t2
370− gHint (ErrorUnifyingTypes t1 t2) = ErrorUnifyingTypes <$> f t1 <*> f t2
371− gHint (ErrorCheckingType e t) = ErrorCheckingType e <$> f t
372− gHint (ErrorCheckingKind t) = ErrorCheckingKind <$> f t
373− gHint (ErrorInApplication e1 t1 e2) = ErrorInApplication e1 <$> f t1 <*> pure e2
374− gHint other = pure other
375−
376−-- |
377−-- Pretty print a single error, simplifying if necessary
378−--
379−prettyPrintSingleError :: Bool -> Level -> ErrorMessage -> State UnknownMap Box.Box
380−prettyPrintSingleError full level e = prettyPrintErrorMessage . positionHintsFirst . reverseHints <$> onTypesInErrorMessageM replaceUnknowns (if full then e else simplifyErrorMessage e)
381− where
382−
383− -- Pretty print an ErrorMessage
384− prettyPrintErrorMessage :: ErrorMessage -> Box.Box
385− prettyPrintErrorMessage (ErrorMessage hints simple) =
386− paras $
387− map renderHint hints ++
388− renderSimpleErrorMessage simple :
389− suggestions simple ++
390− [line $ "See " ++ wikiUri ++ " for more information, or to contribute content related to this " ++ levelText ++ "."]
391− where
392− wikiUri :: String
393− wikiUri = "https://github.com/purescript/purescript/wiki/Error-Code-" ++ errorCode e
394−
395− renderSimpleErrorMessage :: SimpleErrorMessage -> Box.Box
396− renderSimpleErrorMessage (CannotGetFileInfo path) =
397− paras [ line "Unable to read file info: "
398− , indent . line $ path
399− ]
400− renderSimpleErrorMessage (CannotReadFile path) =
401− paras [ line "Unable to read file: "
402− , indent . line $ path
403− ]
404− renderSimpleErrorMessage (CannotWriteFile path) =
405− paras [ line "Unable to write file: "
406− , indent . line $ path
407− ]
408− renderSimpleErrorMessage (ErrorParsingExterns err) =
409− paras [ lineWithLevel "parsing externs files: "
410− , prettyPrintParseError err
411− ]
412− renderSimpleErrorMessage (ErrorParsingFFIModule path) =
413− paras [ line "Unable to parse module from FFI file: "
414− , indent . line $ path
415− ]
416− renderSimpleErrorMessage (ErrorParsingModule err) =
417− paras [ line "Unable to parse module: "
418− , prettyPrintParseError err
419− ]
420− renderSimpleErrorMessage (MissingFFIModule mn) =
421− line $ "Missing FFI implementations for module " ++ runModuleName mn
422− renderSimpleErrorMessage (UnnecessaryFFIModule mn path) =
423− paras [ line $ "Unnecessary FFI implementations have been provided for module " ++ runModuleName mn ++ ": "
424− , indent . line $ path
425− ]
426− renderSimpleErrorMessage (MultipleFFIModules mn paths) =
427− paras [ line $ "Multiple FFI implementations have been provided for module " ++ runModuleName mn ++ ": "
428− , indent . paras $ map line paths
429− ]
430− renderSimpleErrorMessage (InvalidExternsFile path) =
431− paras [ line "Externs file is invalid: "
432− , indent . line $ path
433− ]
434− renderSimpleErrorMessage InvalidDoBind =
435− line "Bind statement cannot be the last statement in a do block. The last statement must be an expression."
436− renderSimpleErrorMessage InvalidDoLet =
437− line "Let statement cannot be the last statement in a do block. The last statement must be an expression."
438− renderSimpleErrorMessage CannotReorderOperators =
439− line "Unable to reorder operators"
440− renderSimpleErrorMessage UnspecifiedSkolemScope =
441− line "Skolem variable scope is unspecified"
442− renderSimpleErrorMessage OverlappingNamesInLet =
443− line "Overlapping names in let binding."
444− renderSimpleErrorMessage (InfiniteType ty) =
445− paras [ line "An infinite type was inferred for an expression: "
446− , indent $ typeAsBox ty
447− ]
448− renderSimpleErrorMessage (InfiniteKind ki) =
449− paras [ line "An infinite kind was inferred for a type: "
450− , indent $ line $ prettyPrintKind ki
451− ]
452− renderSimpleErrorMessage (MultipleFixities name) =
453− line $ "Multiple fixity declarations for " ++ showIdent name
454− renderSimpleErrorMessage (OrphanTypeDeclaration nm) =
455− line $ "Orphan type declaration for " ++ showIdent nm
456− renderSimpleErrorMessage (OrphanFixityDeclaration op) =
457− line $ "Orphan fixity declaration for " ++ show op
458− renderSimpleErrorMessage (RedefinedModule name filenames) =
459− paras [ line ("Module " ++ runModuleName name ++ " has been defined multiple times:")
460− , indent . paras $ map (line . displaySourceSpan) filenames
461− ]
462− renderSimpleErrorMessage (RedefinedIdent name) =
463− line $ "Name " ++ showIdent name ++ " has been defined multiple times"
464− renderSimpleErrorMessage (UnknownModule mn) =
465− line $ "Unknown module " ++ runModuleName mn
466− renderSimpleErrorMessage (UnknownType name) =
467− line $ "Unknown type " ++ showQualified runProperName name
468− renderSimpleErrorMessage (UnknownTypeClass name) =
469− line $ "Unknown type class " ++ showQualified runProperName name
470− renderSimpleErrorMessage (UnknownValue name) =
471− line $ "Unknown value " ++ showQualified showIdent name
472− renderSimpleErrorMessage (UnknownTypeConstructor name) =
473− line $ "Unknown type constructor " ++ showQualified runProperName name
474− renderSimpleErrorMessage (UnknownDataConstructor dc tc) =
475− line $ "Unknown data constructor " ++ showQualified runProperName dc ++ foldMap ((" for type constructor " ++) . showQualified runProperName) tc
476− renderSimpleErrorMessage (UnknownImportType mn name) =
477− line $ "Module " ++ runModuleName mn ++ " does not export type " ++ runProperName name
478− renderSimpleErrorMessage (UnknownExportType name) =
479− line $ "Cannot export unknown type " ++ runProperName name
480− renderSimpleErrorMessage (UnknownImportTypeClass mn name) =
481− line $ "Module " ++ runModuleName mn ++ " does not export type class " ++ runProperName name
482− renderSimpleErrorMessage (UnknownExportTypeClass name) =
483− line $ "Cannot export unknown type class " ++ runProperName name
484− renderSimpleErrorMessage (UnknownImportValue mn name) =
485− line $ "Module " ++ runModuleName mn ++ " does not export value " ++ showIdent name
486− renderSimpleErrorMessage (UnknownExportValue name) =
487− line $ "Cannot export unknown value " ++ showIdent name
488− renderSimpleErrorMessage (UnknownExportModule name) =
489− line $ "Cannot export unknown module " ++ runModuleName name ++ ", it either does not exist or has not been imported by the current module"
490− renderSimpleErrorMessage (UnknownImportDataConstructor mn tcon dcon) =
491− line $ "Module " ++ runModuleName mn ++ " does not export data constructor " ++ runProperName dcon ++ " for type " ++ runProperName tcon
492− renderSimpleErrorMessage (UnknownExportDataConstructor tcon dcon) =
493− line $ "Cannot export data constructor " ++ runProperName dcon ++ " for type " ++ runProperName tcon ++ " as it has not been declared"
494− renderSimpleErrorMessage (ConflictingImport nm mn) =
495− line $ "Cannot declare " ++ show nm ++ " since another declaration of that name was imported from " ++ runModuleName mn
496− renderSimpleErrorMessage (ConflictingImports nm m1 m2) =
497− line $ "Conflicting imports for " ++ nm ++ " from modules " ++ runModuleName m1 ++ " and " ++ runModuleName m2
498− renderSimpleErrorMessage (ConflictingTypeDecls nm) =
499− line $ "Conflicting type declarations for " ++ runProperName nm
500− renderSimpleErrorMessage (ConflictingCtorDecls nm) =
501− line $ "Conflicting data constructor declarations for " ++ runProperName nm
502− renderSimpleErrorMessage (TypeConflictsWithClass nm) =
503− line $ "Type " ++ runProperName nm ++ " conflicts with type class declaration of the same name"
504− renderSimpleErrorMessage (CtorConflictsWithClass nm) =
505− line $ "Data constructor " ++ runProperName nm ++ " conflicts with type class declaration of the same name"
506− renderSimpleErrorMessage (ClassConflictsWithType nm) =
507− line $ "Type class " ++ runProperName nm ++ " conflicts with type declaration of the same name"
508− renderSimpleErrorMessage (ClassConflictsWithCtor nm) =
509− line $ "Type class " ++ runProperName nm ++ " conflicts with data constructor declaration of the same name"
510− renderSimpleErrorMessage (DuplicateModuleName mn) =
511− line $ "Module " ++ runModuleName mn ++ " has been defined multiple times."
512− renderSimpleErrorMessage (DuplicateClassExport nm) =
513− line $ "Duplicate export declaration for type class " ++ runProperName nm
514− renderSimpleErrorMessage (DuplicateValueExport nm) =
515− line $ "Duplicate export declaration for value " ++ showIdent nm
516− renderSimpleErrorMessage (CycleInDeclaration nm) =
517− line $ "Cycle in declaration of " ++ showIdent nm
518− renderSimpleErrorMessage (CycleInModules mns) =
519− line $ "Cycle in module dependencies: " ++ intercalate ", " (map runModuleName mns)
520− renderSimpleErrorMessage (CycleInTypeSynonym pn) =
521− line $ "Cycle in type synonym" ++ foldMap ((" " ++) . runProperName) pn
522− renderSimpleErrorMessage (NameIsUndefined ident) =
523− line $ showIdent ident ++ " is undefined"
524− renderSimpleErrorMessage (NameNotInScope ident) =
525− line $ showIdent ident ++ " may not be defined in the current scope"
526− renderSimpleErrorMessage (UndefinedTypeVariable name) =
527− line $ "Type variable " ++ runProperName name ++ " is undefined"
528− renderSimpleErrorMessage (PartiallyAppliedSynonym name) =
529− paras [ line $ "Partially applied type synonym " ++ showQualified runProperName name
530− , line "Type synonyms must be applied to all of their type arguments."
531− ]
532− renderSimpleErrorMessage (EscapedSkolem binding) =
533− paras $ [ line "A type variable has escaped its scope." ]
534− <> foldMap (\expr -> [ line "Relevant expression: "
535− , indent $ prettyPrintValue expr
536− ]) binding
537− renderSimpleErrorMessage (TypesDoNotUnify t1 t2)
538− = paras [ line "Cannot unify type"
539− , indent $ typeAsBox t1
540− , line "with type"
541− , indent $ typeAsBox t2
542− ]
543− renderSimpleErrorMessage (KindsDoNotUnify k1 k2) =
544− paras [ line "Cannot unify kind"
545− , indent $ line $ prettyPrintKind k1
546− , line "with kind"
547− , indent $ line $ prettyPrintKind k2
548− ]
549− renderSimpleErrorMessage (ConstrainedTypeUnified t1 t2) =
550− paras [ line "Cannot unify constrained type"
551− , indent $ typeAsBox t1
552− , line "with type"
553− , indent $ typeAsBox t2
554− ]
555− renderSimpleErrorMessage (OverlappingInstances nm ts (d : ds)) =
556− paras [ line "Overlapping instances found for"
557− , indent $ Box.hsep 1 Box.left [ line (showQualified runProperName nm)
558− , Box.vcat Box.left (map typeAtomAsBox ts)
559− ]
560− , line "The following instances were found:"
561− , indent $ paras (line (showQualified showIdent d ++ " (chosen)") : map (line . showQualified showIdent) ds)
562− ]
563− renderSimpleErrorMessage OverlappingInstances{} = error "OverlappingInstances: empty instance list"
564− renderSimpleErrorMessage (NoInstanceFound nm ts) =
565− paras [ line "No instance found for"
566− , indent $ Box.hsep 1 Box.left [ line (showQualified runProperName nm)
567− , Box.vcat Box.left (map typeAtomAsBox ts)
568− ]
569− ]
570− renderSimpleErrorMessage (PossiblyInfiniteInstance nm ts) =
571− paras [ line "Instance for"
572− , indent $ Box.hsep 1 Box.left [ line (showQualified runProperName nm)
573− , Box.vcat Box.left (map typeAtomAsBox ts)
574− ]
575− , line "is possibly infinite."
576− ]
577− renderSimpleErrorMessage (CannotDerive nm ts) =
578− paras [ line "Cannot derive an instance for"
579− , indent $ Box.hsep 1 Box.left [ line (showQualified runProperName nm)
580− , Box.vcat Box.left (map typeAtomAsBox ts)
581− ]
582− ]
583− renderSimpleErrorMessage (CannotFindDerivingType nm) =
584− line $ "Cannot derive instance, because the type declaration for " ++ runProperName nm ++ " could not be found."
585− renderSimpleErrorMessage (DuplicateLabel l expr) =
586− paras $ [ line $ "Duplicate label " ++ show l ++ " in row." ]
587− <> foldMap (\expr' -> [ line "Relevant expression: "
588− , indent $ prettyPrintValue expr'
589− ]) expr
590− renderSimpleErrorMessage (DuplicateTypeArgument name) =
591− line $ "Duplicate type argument " ++ show name
592− renderSimpleErrorMessage (DuplicateValueDeclaration nm) =
593− line $ "Duplicate value declaration for " ++ showIdent nm
594− renderSimpleErrorMessage (ArgListLengthsDiffer ident) =
595− line $ "Argument list lengths differ in declaration " ++ showIdent ident
596− renderSimpleErrorMessage (OverlappingArgNames ident) =
597− line $ "Overlapping names in function/binder" ++ foldMap ((" in declaration" ++) . showIdent) ident
598− renderSimpleErrorMessage (MissingClassMember ident) =
599− line $ "Member " ++ showIdent ident ++ " has not been implemented"
600− renderSimpleErrorMessage (ExtraneousClassMember ident) =
601− line $ "Member " ++ showIdent ident ++ " is not a member of the class being instantiated"
602− renderSimpleErrorMessage (ExpectedType ty kind) =
603− paras [ line "In a type-annotated expression x :: t, the type t must have kind *."
604− , line "The error arises from the type"
605− , indent $ typeAsBox ty
606− , line "having the kind"
607− , indent $ line $ prettyPrintKind kind
608− , line "instead."
609− ]
610− renderSimpleErrorMessage (IncorrectConstructorArity nm) =
611− line $ "Wrong number of arguments to constructor " ++ showQualified runProperName nm
612− renderSimpleErrorMessage SubsumptionCheckFailed = line "Unable to check type subsumption"
613− renderSimpleErrorMessage (ExprDoesNotHaveType expr ty) =
614− paras [ line "Expression"
615− , indent $ prettyPrintValue expr
616− , line "does not have type"
617− , indent $ typeAsBox ty
618− ]
619− renderSimpleErrorMessage (PropertyIsMissing prop row) =
620− paras [ line "Row"
621− , indent $ prettyPrintRowWith '(' ')' row
622− , line $ "lacks required property " ++ show prop
623− ]
624− renderSimpleErrorMessage (CannotApplyFunction fn arg) =
625− paras [ line "Cannot apply function of type"
626− , indent $ typeAsBox fn
627− , line "to argument"
628− , indent $ prettyPrintValue arg
629− ]
630− renderSimpleErrorMessage TypeSynonymInstance =
631− line "Type synonym instances are disallowed"
632− renderSimpleErrorMessage (OrphanInstance nm cnm ts) =
633− paras [ line $ "Instance " ++ showIdent nm ++ " for "
634− , indent $ Box.hsep 1 Box.left [ line (showQualified runProperName cnm)
635− , Box.vcat Box.left (map typeAtomAsBox ts)
636− ]
637− , line "is an orphan instance."
638− , line "An orphan instance is an instance which is defined in neither the class module nor the data type module."
639− , line "Consider moving the instance, if possible, or using a newtype wrapper."
640− ]
641− renderSimpleErrorMessage InvalidNewtype =
642− line "Newtypes must define a single constructor with a single argument"
643− renderSimpleErrorMessage (InvalidInstanceHead ty) =
644− paras [ line "Invalid type in class instance head:"
645− , indent $ typeAsBox ty
646− ]
647− renderSimpleErrorMessage (TransitiveExportError x ys) =
648− paras $ line ("An export for " ++ prettyPrintExport x ++ " requires the following to also be exported: ")
649− : map (line . prettyPrintExport) ys
650− renderSimpleErrorMessage (ShadowedName nm) =
651− line $ "Name '" ++ showIdent nm ++ "' was shadowed"
652− renderSimpleErrorMessage (ShadowedTypeVar tv) =
653− line $ "Type variable '" ++ tv ++ "' was shadowed"
654− renderSimpleErrorMessage (UnusedTypeVar tv) =
655− line $ "Type variable '" ++ tv ++ "' was declared but not used"
656− renderSimpleErrorMessage (ClassOperator className opName) =
657− paras [ line $ "Class '" ++ runProperName className ++ "' declares operator " ++ showIdent opName ++ "."
658− , line "This may be disallowed in the future - consider declaring a named member in the class and making the operator an alias:"
659− , indent . line $ showIdent opName ++ " = someMember"
660− ]
661− renderSimpleErrorMessage (MisleadingEmptyTypeImport mn name) =
662− line $ "Importing type " ++ runProperName name ++ "(..) from " ++ runModuleName mn ++ " is misleading as it has no exported data constructors"
663− renderSimpleErrorMessage (ImportHidingModule name) =
664− line $ "Attempted to hide module " ++ runModuleName name ++ " in import expression, this is not permitted"
665− renderSimpleErrorMessage (WildcardInferredType ty) =
666− paras [ line "The wildcard type definition has the inferred type "
667− , indent $ typeAsBox ty
668− ]
669− renderSimpleErrorMessage (MissingTypeDeclaration ident ty) =
670− paras [ line $ "No type declaration was provided for the top-level declaration of " ++ showIdent ident ++ "."
671− , line "It is good practice to provide type declarations as a form of documentation."
672− , line $ "The inferred type of " ++ showIdent ident ++ " was:"
673− , indent $ typeAsBox ty
674− ]
675− renderSimpleErrorMessage (NotExhaustivePattern bs b) =
676− paras $ [ line "A case expression could not be determined to cover all inputs."
677− , line "The following additional cases are required to cover all inputs:\n"
678− , Box.hsep 1 Box.left (map (paras . map (line . prettyPrintBinderAtom)) (transpose bs))
679− ] ++
680− [ line "..." | not b ]
681− renderSimpleErrorMessage (OverlappingPattern bs b) =
682− paras $ [ line "A case expression contains unreachable cases:\n"
683− , Box.hsep 1 Box.left (map (paras . map (line . prettyPrintBinderAtom)) (transpose bs))
684− ] ++
685− [ line "..." | not b ]
686− renderSimpleErrorMessage IncompleteExhaustivityCheck =
687− paras [ line "An exhaustivity check was abandoned due to too many possible cases."
688− , line "You may want to decompose your data types into smaller types."
689− ]
690−
691− renderHint :: ErrorMessageHint -> Box.Box
692− renderHint (NotYetDefined names) =
693− line $ "The following are not yet defined here: " ++ intercalate ", " (map showIdent names) ++ ":"
694− renderHint (ErrorUnifyingTypes t1 t2) =
695− paras [ lineWithLevel "unifying type "
696− , indent $ typeAsBox t1
697− , line "with type"
698− , indent $ typeAsBox t2
699− ]
700− renderHint (ErrorInExpression expr) =
701− paras [ lineWithLevel "in expression:"
702− , indent $ prettyPrintValue expr
703− ]
704− renderHint (ErrorInModule mn) =
705− paras [ lineWithLevel $ "in module " ++ runModuleName mn ++ ":"
706− ]
707− renderHint (ErrorInSubsumption t1 t2) =
708− paras [ lineWithLevel "checking that type "
709− , indent $ typeAsBox t1
710− , line "subsumes type"
711− , indent $ typeAsBox t2
712− ]
713− renderHint (ErrorInInstance nm ts) =
714− paras [ lineWithLevel "in type class instance"
715− , indent $ Box.hsep 1 Box.left [ line (showQualified runProperName nm)
716− , Box.vcat Box.left (map typeAtomAsBox ts)
717− ]
718− ]
719− renderHint (ErrorCheckingKind ty) =
720− paras [ lineWithLevel "checking kind of type "
721− , indent $ typeAsBox ty
722− ]
723− renderHint (ErrorInferringType expr) =
724− paras [ lineWithLevel "inferring type of value "
725− , indent $ prettyPrintValue expr
726− ]
727− renderHint (ErrorCheckingType expr ty) =
728− paras [ lineWithLevel "checking that value "
729− , indent $ prettyPrintValue expr
730− , line "has type"
731− , indent $ typeAsBox ty
732− ]
733− renderHint (ErrorInApplication f t a) =
734− paras [ lineWithLevel "applying function"
735− , indent $ prettyPrintValue f
736− , line "of type"
737− , indent $ typeAsBox t
738− , line "to argument"
739− , indent $ prettyPrintValue a
740− ]
741− renderHint (ErrorInDataConstructor nm) =
742− lineWithLevel $ "in data constructor " ++ runProperName nm ++ ":"
743− renderHint (ErrorInTypeConstructor nm) =
744− lineWithLevel $ "in type constructor " ++ runProperName nm ++ ":"
745− renderHint (ErrorInBindingGroup nms) =
746− lineWithLevel $ "in binding group " ++ intercalate ", " (map showIdent nms) ++ ":"
747− renderHint ErrorInDataBindingGroup =
748− lineWithLevel "in data binding group:"
749− renderHint (ErrorInTypeSynonym name) =
750− lineWithLevel $ "in type synonym " ++ runProperName name ++ ":"
751− renderHint (ErrorInValueDeclaration n) =
752− lineWithLevel $ "in value declaration " ++ showIdent n ++ ":"
753− renderHint (ErrorInTypeDeclaration n) =
754− lineWithLevel $ "in type declaration for " ++ showIdent n ++ ":"
755− renderHint (ErrorInForeignImport nm) =
756− lineWithLevel $ "in foreign import " ++ showIdent nm ++ ":"
757− renderHint (PositionedError srcSpan) =
758− lineWithLevel $ "at " ++ displaySourceSpan srcSpan ++ ":"
759−
760− lineWithLevel :: String -> Box.Box
761− lineWithLevel text = line $ show level ++ " " ++ text
762−
763− levelText :: String
764− levelText = case level of
765− Error -> "error"
766− Warning -> "warning"
767−
768− suggestions :: SimpleErrorMessage -> [Box.Box]
769− suggestions (ConflictingImport nm im) = [ line $ "Possible fix: hide " ++ show nm ++ " when importing " ++ runModuleName im ++ ":"
770− , indent . line $ "import " ++ runModuleName im ++ " hiding (" ++ nm ++ ")"
771− ]
772− suggestions (TypesDoNotUnify t1 t2)
773− | isObject t1 && isFunction t2 = [line "Note that function composition in PureScript is defined using (<<<)"]
774− | otherwise = []
775− suggestions _ = []
776−
777− paras :: [Box.Box] -> Box.Box
778− paras = Box.vcat Box.left
779−
780− -- Pretty print and export declaration
781− prettyPrintExport :: DeclarationRef -> String
782− prettyPrintExport (TypeRef pn _) = runProperName pn
783− prettyPrintExport (ValueRef ident) = showIdent ident
784− prettyPrintExport (TypeClassRef pn) = runProperName pn
785− prettyPrintExport (TypeInstanceRef ident) = showIdent ident
786− prettyPrintExport (ModuleRef name) = "module " ++ runModuleName name
787− prettyPrintExport (PositionedDeclarationRef _ _ ref) = prettyPrintExport ref
788−
789− -- Hints get added at the front, so we need to reverse them before rendering
790− reverseHints :: ErrorMessage -> ErrorMessage
791− reverseHints (ErrorMessage hints simple) = ErrorMessage (reverse hints) simple
792−
793− -- | Put positional hints at the front of the list
794− positionHintsFirst :: ErrorMessage -> ErrorMessage
795− positionHintsFirst (ErrorMessage hints simple) = ErrorMessage (uncurry (++) $ partition (isPositionHint . hintCategory) hints) simple
796− where
797− isPositionHint :: HintCategory -> Bool
798− isPositionHint PositionHint = True
799− isPositionHint OtherHint = True
800− isPositionHint _ = False
801−
802− -- | Simplify an error message
803− simplifyErrorMessage :: ErrorMessage -> ErrorMessage
804− simplifyErrorMessage (ErrorMessage hints simple) = ErrorMessage (simplifyHints hints) simple
805− where
806− -- Take the last instance of each "hint category"
807− simplifyHints :: [ErrorMessageHint] -> [ErrorMessageHint]
808− simplifyHints = reverse . nubBy categoriesEqual . reverse
809−
810− -- Don't remove hints in the "other" category
811− categoriesEqual :: ErrorMessageHint -> ErrorMessageHint -> Bool
812− categoriesEqual x y =
813− case (hintCategory x, hintCategory y) of
814− (OtherHint, _) -> False
815− (_, OtherHint) -> False
816− (c1, c2) -> c1 == c2
817−
818− hintCategory :: ErrorMessageHint -> HintCategory
819− hintCategory ErrorCheckingType{} = ExprHint
820− hintCategory ErrorInferringType{} = ExprHint
821− hintCategory ErrorInExpression{} = ExprHint
822− hintCategory ErrorUnifyingTypes{} = CheckHint
823− hintCategory ErrorInSubsumption{} = CheckHint
824− hintCategory ErrorInApplication{} = CheckHint
825− hintCategory PositionedError{} = PositionHint
826− hintCategory _ = OtherHint
827−
828−-- |
829−-- Pretty print multiple errors
830−--
831−prettyPrintMultipleErrors :: Bool -> MultipleErrors -> String
832−prettyPrintMultipleErrors full = renderBox . prettyPrintMultipleErrorsBox full
833−
834−-- |
835−-- Pretty print multiple warnings
836−--
837−prettyPrintMultipleWarnings :: Bool -> MultipleErrors -> String
838−prettyPrintMultipleWarnings full = renderBox . prettyPrintMultipleWarningsBox full
839−
840−-- | Pretty print warnings as a Box
841−prettyPrintMultipleWarningsBox :: Bool -> MultipleErrors -> Box.Box
842−prettyPrintMultipleWarningsBox full = flip evalState M.empty . prettyPrintMultipleErrorsWith Warning "Warning found:" "Warning" full
843−
844−-- | Pretty print errors as a Box
845−prettyPrintMultipleErrorsBox :: Bool -> MultipleErrors -> Box.Box
846−prettyPrintMultipleErrorsBox full = flip evalState M.empty . prettyPrintMultipleErrorsWith Error "Error found:" "Error" full
847−
848−prettyPrintMultipleErrorsWith :: Level -> String -> String -> Bool -> MultipleErrors -> State UnknownMap Box.Box
849−prettyPrintMultipleErrorsWith level intro _ full (MultipleErrors [e]) = do
850− result <- prettyPrintSingleError full level e
851− return $
852− Box.vcat Box.left [ Box.text intro
853− , result
854− ]
855−prettyPrintMultipleErrorsWith level _ intro full (MultipleErrors es) = do
856− result <- forM es $ prettyPrintSingleError full level
857− return $ Box.vsep 1 Box.left $ concat $ zipWith withIntro [1 :: Int ..] result
858− where
859− withIntro i err = [ Box.text (intro ++ " " ++ show i ++ " of " ++ show (length es) ++ ":")
860− , Box.moveRight 2 err
861− ]
862−
863−-- | Pretty print a Parsec ParseError as a Box
864−prettyPrintParseError :: P.ParseError -> Box.Box
865−prettyPrintParseError = prettyPrintParseErrorMessages "or" "unknown parse error" "expecting" "unexpected" "end of input" . PE.errorMessages
866−
867−-- |
868−-- Pretty print ParseError detail messages.
869−--
870−-- Adapted from 'Text.Parsec.Error.showErrorMessages', see <https://github.com/aslatter/parsec/blob/v3.1.9/Text/Parsec/Error.hs#L173>.
871−--
872−prettyPrintParseErrorMessages :: String -> String -> String -> String -> String -> [Message] -> Box.Box
873−prettyPrintParseErrorMessages msgOr msgUnknown msgExpecting msgUnExpected msgEndOfInput msgs
874− | null msgs = Box.text msgUnknown
875− | otherwise = Box.vcat Box.left $ map Box.text $ clean [showSysUnExpect,showUnExpect,showExpect,showMessages]
876−
877− where
878− (sysUnExpect,msgs1) = span (SysUnExpect "" ==) msgs
879− (unExpect,msgs2) = span (UnExpect "" ==) msgs1
880− (expect,messages) = span (Expect "" ==) msgs2
881−
882− showExpect = showMany msgExpecting expect
883− showUnExpect = showMany msgUnExpected unExpect
884− showSysUnExpect | not (null unExpect) ||
885− null sysUnExpect = ""
886− | null firstMsg = msgUnExpected ++ " " ++ msgEndOfInput
887− | otherwise = msgUnExpected ++ " " ++ firstMsg
888− where
889− firstMsg = PE.messageString (head sysUnExpect)
890−
891− showMessages = showMany "" messages
892−
893− -- helpers
894− showMany pre msgs' = case clean (map PE.messageString msgs') of
895− [] -> ""
896− ms | null pre -> commasOr ms
897− | otherwise -> pre ++ " " ++ commasOr ms
898−
899− commasOr [] = ""
900− commasOr [m] = m
901− commasOr ms = commaSep (init ms) ++ " " ++ msgOr ++ " " ++ last ms
902−
903− commaSep = separate ", " . clean
904−
905− separate _ [] = ""
906− separate _ [m] = m
907− separate sep (m:ms) = m ++ sep ++ separate sep ms
908−
909− clean = nub . filter (not . null)
910−
911−-- | Indent to the right, and pad on top and bottom.
912−indent :: Box.Box -> Box.Box
913−indent = Box.moveUp 1 . Box.moveDown 1 . Box.moveRight 2
914−
915−line :: String -> Box.Box
916−line = Box.text
917−
918−renderBox :: Box.Box -> String
919−renderBox = unlines . map trimEnd . lines . Box.render
920− where
921− trimEnd = reverse . dropWhile (== ' ') . reverse
922−
923−-- |
924−-- Interpret multiple errors and warnings in a monad supporting errors and warnings
925−--
926−interpretMultipleErrorsAndWarnings :: (MonadError MultipleErrors m, MonadWriter MultipleErrors m) => (Either MultipleErrors a, MultipleErrors) -> m a
927−interpretMultipleErrorsAndWarnings (err, ws) = do
928− tell ws
929− either throwError return err
930−
931−-- |
932−-- Rethrow an error with a more detailed error message in the case of failure
933−--
934−rethrow :: (MonadError e m) => (e -> e) -> m a -> m a
935−rethrow f = flip catchError $ \e -> throwError (f e)
936−
937−warnAndRethrow :: (MonadError e m, MonadWriter e m) => (e -> e) -> m a -> m a
938−warnAndRethrow f = rethrow f . censor f
939−
940−-- |
941−-- Rethrow an error with source position information
942−--
943−rethrowWithPosition :: (MonadError MultipleErrors m) => SourceSpan -> m a -> m a
944−rethrowWithPosition pos = rethrow (onErrorMessages (withPosition pos))
945−
946−warnWithPosition :: (MonadWriter MultipleErrors m) => SourceSpan -> m a -> m a
947−warnWithPosition pos = censor (onErrorMessages (withPosition pos))
948−
949−warnAndRethrowWithPosition :: (MonadError MultipleErrors m, MonadWriter MultipleErrors m) => SourceSpan -> m a -> m a
950−warnAndRethrowWithPosition pos = rethrowWithPosition pos . warnWithPosition pos
951−
952−withPosition :: SourceSpan -> ErrorMessage -> ErrorMessage
953−withPosition pos (ErrorMessage hints se) = ErrorMessage (PositionedError pos : hints) se
954−
955−-- |
956−-- Collect errors in in parallel
957−--
958−parU :: (MonadError MultipleErrors m, Functor m) => [a] -> (a -> m b) -> m [b]
959−parU xs f = forM xs (withError . f) >>= collectErrors
960− where
961− withError :: (MonadError MultipleErrors m, Functor m) => m a -> m (Either MultipleErrors a)
962− withError u = catchError (Right <$> u) (return . Left)
963−
964− collectErrors :: (MonadError MultipleErrors m, Functor m) => [Either MultipleErrors a] -> m [a]
965− collectErrors es = case lefts es of
966− [] -> return $ rights es
967− errs -> throwError $ fold errs
src/Language/PureScript/Externs.hsdeleted−216
@@ -1,216 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.Externs
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- This module generates code for \"externs\" files, i.e. files containing only foreign import declarations.
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE CPP #-}
17−{-# LANGUAGE RecordWildCards #-}
18−{-# LANGUAGE PatternGuards #-}
19−{-# LANGUAGE TemplateHaskell #-}
20−
21−module Language.PureScript.Externs
22− ( ExternsFile(..)
23− , ExternsImport(..)
24− , ExternsFixity(..)
25− , ExternsDeclaration(..)
26− , moduleToExternsFile
27− , applyExternsFileToEnvironment
28− ) where
29−
30−import Data.List (find, foldl')
31−import Data.Maybe (mapMaybe, maybeToList, fromMaybe)
32−import Data.Foldable (fold)
33−import Data.Version (showVersion)
34−#if __GLASGOW_HASKELL__ < 710
35−import Data.Monoid
36−#endif
37−import Data.Aeson.TH
38−
39−import qualified Data.Map as M
40−
41−import Language.PureScript.AST
42−import Language.PureScript.Environment
43−import Language.PureScript.Names
44−import Language.PureScript.Types
45−import Language.PureScript.Kinds
46−import Language.PureScript.TypeClassDictionaries
47−
48−import Paths_purescript as Paths
49−
50−-- | The data which will be serialized to an externs file
51−data ExternsFile = ExternsFile
52− {
53− -- | The externs version
54− efVersion :: String
55− -- | Module name
56− , efModuleName :: ModuleName
57− -- | List of module exports
58− , efExports :: [DeclarationRef]
59− -- | List of module imports
60− , efImports :: [ExternsImport]
61− -- | List of operators and their fixities
62− , efFixities :: [ExternsFixity]
63− -- | List of type and value declaration
64− , efDeclarations :: [ExternsDeclaration]
65− } deriving (Show, Read)
66−
67−-- | A module import in an externs file
68−data ExternsImport = ExternsImport
69− {
70− -- | The imported module
71− eiModule :: ModuleName
72− -- | The import type: regular, qualified or hiding
73− , eiImportType :: ImportDeclarationType
74− -- | The imported-as name, for qualified imports
75− , eiImportedAs :: Maybe ModuleName
76− } deriving (Show, Read)
77−
78−-- | A fixity declaration in an externs file
79−data ExternsFixity = ExternsFixity
80− {
81− -- | The associativity of the operator
82− efAssociativity :: Associativity
83− -- | The precedence level of the operator
84− , efPrecedence :: Precedence
85− -- | The operator symbol
86− , efOperator :: String
87− } deriving (Show, Read)
88−
89−-- | A type or value declaration appearing in an externs file
90−data ExternsDeclaration =
91− -- | A type declaration
92− EDType
93− { edTypeName :: ProperName
94− , edTypeKind :: Kind
95− , edTypeDeclarationKind :: TypeKind
96− }
97− -- | A type synonym
98− | EDTypeSynonym
99− { edTypeSynonymName :: ProperName
100− , edTypeSynonymArguments :: [(String, Maybe Kind)]
101− , edTypeSynonymType :: Type
102− }
103− -- | A data construtor
104− | EDDataConstructor
105− { edDataCtorName :: ProperName
106− , edDataCtorOrigin :: DataDeclType
107− , edDataCtorTypeCtor :: ProperName
108− , edDataCtorType :: Type
109− , edDataCtorFields :: [Ident]
110− }
111− -- | A value declaration
112− | EDValue
113− { edValueName :: Ident
114− , edValueType :: Type
115− }
116− -- | A type class declaration
117− | EDClass
118− { edClassName :: ProperName
119− , edClassTypeArguments :: [(String, Maybe Kind)]
120− , edClassMembers :: [(Ident, Type)]
121− , edClassConstraints :: [Constraint]
122− }
123− -- | An instance declaration
124− | EDInstance
125− { edInstanceClassName :: Qualified ProperName
126− , edInstanceName :: Ident
127− , edInstanceTypes :: [Type]
128− , edInstanceConstraints :: Maybe [Constraint]
129− }
130− deriving (Show, Read)
131−
132−-- | Convert an externs file back into a module
133−applyExternsFileToEnvironment :: ExternsFile -> Environment -> Environment
134−applyExternsFileToEnvironment ExternsFile{..} = flip (foldl' applyDecl) efDeclarations
135− where
136− applyDecl :: Environment -> ExternsDeclaration -> Environment
137− applyDecl env (EDType pn kind tyKind) = env { types = M.insert (qual pn) (kind, tyKind) (types env) }
138− applyDecl env (EDTypeSynonym pn args ty) = env { typeSynonyms = M.insert (qual pn) (args, ty) (typeSynonyms env) }
139− applyDecl env (EDDataConstructor pn dTy tNm ty nms) = env { dataConstructors = M.insert (qual pn) (dTy, tNm, ty, nms) (dataConstructors env) }
140− applyDecl env (EDValue ident ty) = env { names = M.insert (efModuleName, ident) (ty, External, Defined) (names env) }
141− applyDecl env (EDClass pn args members cs) = env { typeClasses = M.insert (qual pn) (args, members, cs) (typeClasses env) }
142− applyDecl env (EDInstance className ident tys cs) = env { typeClassDictionaries = updateMap (updateMap (M.insert (qual ident) dict) className) (Just efModuleName) (typeClassDictionaries env) }
143− where
144− dict :: TypeClassDictionaryInScope
145− dict = TypeClassDictionaryInScope (qual ident) [] className tys cs
146−
147− updateMap :: (Ord k, Monoid a) => (a -> a) -> k -> M.Map k a -> M.Map k a
148− updateMap f = M.alter (Just . f . fold)
149−
150− qual :: a -> Qualified a
151− qual = Qualified (Just efModuleName)
152−
153−-- | Generate an externs file for all declarations in a module
154−moduleToExternsFile :: Module -> Environment -> ExternsFile
155−moduleToExternsFile (Module _ _ _ _ Nothing) _ = error "moduleToExternsFile: module exports were not elaborated"
156−moduleToExternsFile (Module _ _ mn ds (Just exps)) env = ExternsFile{..}
157− where
158− efVersion = showVersion Paths.version
159− efModuleName = mn
160− efExports = exps
161− efImports = mapMaybe importDecl ds
162− efFixities = mapMaybe fixityDecl ds
163− efDeclarations = concatMap toExternsDeclaration efExports
164−
165− fixityDecl :: Declaration -> Maybe ExternsFixity
166− fixityDecl (FixityDeclaration (Fixity assoc prec) op) = fmap (const (ExternsFixity assoc prec op)) (find exportsOp exps)
167− where
168− exportsOp :: DeclarationRef -> Bool
169− exportsOp (PositionedDeclarationRef _ _ r) = exportsOp r
170− exportsOp (ValueRef ident') = ident' == Op op
171− exportsOp _ = False
172− fixityDecl (PositionedDeclaration _ _ d) = fixityDecl d
173− fixityDecl _ = Nothing
174−
175− importDecl :: Declaration -> Maybe ExternsImport
176− importDecl (ImportDeclaration m mt qmn) = Just (ExternsImport m mt qmn)
177− importDecl (PositionedDeclaration _ _ d) = importDecl d
178− importDecl _ = Nothing
179−
180− toExternsDeclaration :: DeclarationRef -> [ExternsDeclaration]
181− toExternsDeclaration (PositionedDeclarationRef _ _ r) = toExternsDeclaration r
182− toExternsDeclaration (TypeRef pn dctors) =
183− case Qualified (Just mn) pn `M.lookup` types env of
184− Nothing -> error "toExternsDeclaration: no kind in toExternsDeclaration"
185− Just (kind, TypeSynonym)
186− | Just (args, synTy) <- Qualified (Just mn) pn `M.lookup` typeSynonyms env -> [ EDType pn kind TypeSynonym, EDTypeSynonym pn args synTy ]
187− Just (kind, ExternData) -> [ EDType pn kind ExternData ]
188− Just (kind, tk@(DataType _ tys)) ->
189− EDType pn kind tk : [ EDDataConstructor dctor dty pn ty args
190− | dctor <- fromMaybe (map fst tys) dctors
191− , (dty, _, ty, args) <- maybeToList (M.lookup (Qualified (Just mn) dctor) (dataConstructors env))
192− ]
193− _ -> error "toExternsDeclaration: Invalid input"
194− toExternsDeclaration (ValueRef ident)
195− | Just (ty, _, _) <- (mn, ident) `M.lookup` names env
196− = [ EDValue ident ty ]
197− toExternsDeclaration (TypeClassRef className)
198− | Just (args, members, implies) <- Qualified (Just mn) className `M.lookup` typeClasses env
199− , Just (kind, TypeSynonym) <- M.lookup (Qualified (Just mn) className) (types env)
200− , Just (_, synTy) <- Qualified (Just mn) className `M.lookup` typeSynonyms env
201− = [ EDType className kind TypeSynonym
202− , EDTypeSynonym className args synTy
203− , EDClass className args members implies
204− ]
205− toExternsDeclaration (TypeInstanceRef ident)
206− = [ EDInstance tcdClassName ident tcdInstanceTypes tcdDependencies
207− | m1 <- maybeToList (M.lookup (Just mn) (typeClassDictionaries env))
208− , m2 <- M.elems m1
209− , TypeClassDictionaryInScope{..} <- maybeToList (M.lookup (Qualified (Just mn) ident) m2)
210− ]
211− toExternsDeclaration _ = []
212−
213−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''ExternsImport)
214−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''ExternsFixity)
215−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''ExternsDeclaration)
216−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''ExternsFile)
src/Language/PureScript/Kinds.hsdeleted−75
@@ -1,75 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.Kinds
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DeriveDataTypeable #-}
16−{-# LANGUAGE TemplateHaskell #-}
17−{-# LANGUAGE CPP #-}
18−
19−module Language.PureScript.Kinds where
20−
21−import Data.Data
22−import qualified Data.Aeson.TH as A
23−
24−#if __GLASGOW_HASKELL__ < 710
25−import Control.Applicative
26−#endif
27−import Control.Monad.Unify (Unknown)
28−
29−-- |
30−-- The data type of kinds
31−--
32−data Kind
33− -- |
34− -- Unification variable of type Kind
35− --
36− = KUnknown Unknown
37− -- |
38− -- The kind of types
39− --
40− | Star
41− -- |
42− -- The kind of effects
43− --
44− | Bang
45− -- |
46− -- Kinds for labelled, unordered rows without duplicates
47− --
48− | Row Kind
49− -- |
50− -- Function kinds
51− --
52− | FunKind Kind Kind deriving (Show, Read, Eq, Ord, Data, Typeable)
53−
54−$(A.deriveJSON A.defaultOptions ''Kind)
55−
56−everywhereOnKinds :: (Kind -> Kind) -> Kind -> Kind
57−everywhereOnKinds f = go
58− where
59− go (Row k1) = f (Row (go k1))
60− go (FunKind k1 k2) = f (FunKind (go k1) (go k2))
61− go other = f other
62−
63−everywhereOnKindsM :: (Functor m, Applicative m, Monad m) => (Kind -> m Kind) -> Kind -> m Kind
64−everywhereOnKindsM f = go
65− where
66− go (Row k1) = (Row <$> go k1) >>= f
67− go (FunKind k1 k2) = (FunKind <$> go k1 <*> go k2) >>= f
68− go other = f other
69−
70−everythingOnKinds :: (r -> r -> r) -> (Kind -> r) -> Kind -> r
71−everythingOnKinds (<>) f = go
72− where
73− go k@(Row k1) = f k <> go k1
74− go k@(FunKind k1 k2) = f k <> go k1 <> go k2
75− go other = f other
src/Language/PureScript/Linter.hsdeleted−119
@@ -1,119 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.Linter
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | This module implements a simple linting pass on the PureScript AST.
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
16−{-# LANGUAGE FlexibleContexts #-}
17−{-# LANGUAGE ScopedTypeVariables #-}
18−{-# LANGUAGE CPP #-}
19−
20−module Language.PureScript.Linter (lint, module L) where
21−
22−import Data.List (mapAccumL, nub, (\\))
23−import Data.Maybe (mapMaybe)
24−import Data.Monoid
25−
26−import qualified Data.Set as S
27−
28−#if __GLASGOW_HASKELL__ < 710
29−import Control.Applicative
30−#endif
31−import Control.Monad.Writer.Class
32−
33−import Language.PureScript.AST
34−import Language.PureScript.Names
35−import Language.PureScript.Errors
36−import Language.PureScript.Types
37−import Language.PureScript.Linter.Exhaustive as L
38−
39−-- | Lint the PureScript AST.
40−-- |
41−-- | Right now, this pass only performs a shadowing check.
42−lint :: forall m. (Applicative m, MonadWriter MultipleErrors m) => Module -> m ()
43−lint (Module _ _ mn ds _) = censor (addHint (ErrorInModule mn)) $ mapM_ lintDeclaration ds
44− where
45− moduleNames :: S.Set Ident
46− moduleNames = S.fromList (nub (mapMaybe getDeclIdent ds))
47−
48− getDeclIdent :: Declaration -> Maybe Ident
49− getDeclIdent (PositionedDeclaration _ _ d) = getDeclIdent d
50− getDeclIdent (ValueDeclaration ident _ _ _) = Just ident
51− getDeclIdent (ExternDeclaration ident _) = Just ident
52− getDeclIdent (TypeInstanceDeclaration ident _ _ _ _) = Just ident
53− getDeclIdent (BindingGroupDeclaration _) = error "lint: binding groups should not be desugared yet."
54− getDeclIdent _ = Nothing
55−
56− lintDeclaration :: Declaration -> m ()
57− lintDeclaration d =
58− let (f, _, _, _, _) = everythingWithContextOnValues moduleNames mempty mappend stepD stepE stepB def def
59−
60− f' :: Declaration -> MultipleErrors
61− f' (PositionedDeclaration pos _ dec) = addHint (PositionedError pos) (f' dec)
62− f' dec@(ValueDeclaration name _ _ _) = addHint (ErrorInValueDeclaration name) (f dec <> checkTypeVarsInDecl dec)
63− f' (TypeDeclaration name ty) = addHint (ErrorInTypeDeclaration name) (checkTypeVars ty)
64− f' dec = f dec <> checkTypeVarsInDecl dec
65−
66− in tell (f' d)
67− where
68− def s _ = (s, mempty)
69−
70− stepD :: S.Set Ident -> Declaration -> (S.Set Ident, MultipleErrors)
71− stepD s (TypeClassDeclaration name _ _ decls) = (s, foldr go mempty decls)
72− where
73− go :: Declaration -> MultipleErrors -> MultipleErrors
74− go (PositionedDeclaration _ _ d') errs = go d' errs
75− go (TypeDeclaration op@(Op _) _) errs = errorMessage (ClassOperator name op) <> errs
76− go _ errs = errs
77− stepD s _ = (s, mempty)
78−
79− stepE :: S.Set Ident -> Expr -> (S.Set Ident, MultipleErrors)
80− stepE s (Abs (Left name) _) = bindName s name
81− stepE s (Let ds' _) =
82− case mapAccumL bindName s (nub (mapMaybe getDeclIdent ds')) of
83− (s', es) -> (s', mconcat es)
84− stepE s _ = (s, mempty)
85−
86− stepB :: S.Set Ident -> Binder -> (S.Set Ident, MultipleErrors)
87− stepB s (VarBinder name) = bindName s name
88− stepB s (NamedBinder name _) = bindName s name
89− stepB s (TypedBinder _ b) = stepB s b
90− stepB s _ = (s, mempty)
91−
92− bindName :: S.Set Ident -> Ident -> (S.Set Ident, MultipleErrors)
93− bindName = bind ShadowedName
94−
95− checkTypeVarsInDecl :: Declaration -> MultipleErrors
96− checkTypeVarsInDecl d = let (f, _, _, _, _) = accumTypes checkTypeVars in f d
97−
98− checkTypeVars :: Type -> MultipleErrors
99− checkTypeVars ty = everythingWithContextOnTypes S.empty mempty mappend step ty <> findUnused ty
100− where
101− step :: S.Set String -> Type -> (S.Set String, MultipleErrors)
102− step s (ForAll tv _ _) = bindVar s tv
103− step s _ = (s, mempty)
104− bindVar :: S.Set String -> String -> (S.Set String, MultipleErrors)
105− bindVar = bind ShadowedTypeVar
106− findUnused :: Type -> MultipleErrors
107− findUnused ty' =
108− let used = usedTypeVariables ty'
109− declared = everythingOnTypes (++) go ty'
110− unused = nub declared \\ nub used
111− in foldl (<>) mempty $ map (errorMessage . UnusedTypeVar) unused
112− where
113− go :: Type -> [String]
114− go (ForAll tv _ _) = [tv]
115− go _ = []
116−
117− bind :: (Ord a) => (a -> SimpleErrorMessage) -> S.Set a -> a -> (S.Set a, MultipleErrors)
118− bind mkError s name | name `S.member` s = (s, errorMessage (mkError name))
119− | otherwise = (S.insert name s, mempty)
src/Language/PureScript/Linter/Exhaustive.hsdeleted−310
@@ -1,310 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.Exhaustive
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- | Module for exhaustivity checking over pattern matching definitions
13−-- | The algorithm analyses the clauses of a definition one by one from top
14−-- | to bottom, where in each step it has the cases already missing (uncovered),
15−-- | and it generates the new set of missing cases.
16−--
17−-----------------------------------------------------------------------------
18−
19−{-# LANGUAGE FlexibleContexts #-}
20−{-# LANGUAGE ScopedTypeVariables #-}
21−{-# LANGUAGE CPP #-}
22−
23−module Language.PureScript.Linter.Exhaustive
24− ( checkExhaustive
25− , checkExhaustiveModule
26− ) where
27−
28−import qualified Data.Map as M
29−import Data.Maybe (fromMaybe)
30−import Data.List (foldl', sortBy, nub)
31−import Data.Function (on)
32−#if __GLASGOW_HASKELL__ < 710
33−import Data.Traversable (sequenceA)
34−#endif
35−
36−import Control.Monad (unless)
37−import Control.Applicative
38−import Control.Arrow (first, second)
39−import Control.Monad.Writer.Class
40−
41−import Language.PureScript.AST.Binders
42−import Language.PureScript.AST.Declarations
43−import Language.PureScript.Environment
44−import Language.PureScript.Names as P
45−import Language.PureScript.Kinds
46−import Language.PureScript.Types as P
47−import Language.PureScript.Errors
48−
49−-- | There are two modes of failure for the redudancy check:
50−--
51−-- 1. Exhaustivity was incomeplete due to too many cases, so we couldn't determine redundancy.
52−-- 2. We didn't attempt to determine redundancy for a binder, e.g. an integer binder.
53−--
54−-- We want to warn the user in the first case.
55−data RedudancyError = Incomplete | Unknown
56−
57−-- |
58−-- Qualifies a propername from a given qualified propername and a default module name
59−--
60−qualifyName :: a -> ModuleName -> Qualified a -> Qualified a
61−qualifyName n defmn qn = Qualified (Just mn) n
62− where
63− (mn, _) = qualify defmn qn
64−
65−-- |
66−-- Given an environment and a datatype or newtype name,
67−-- this function returns the associated data constructors if it is the case of a datatype
68−-- where: - ProperName is the name of the constructor (for example, "Nothing" in Maybe)
69−-- - [Type] is the list of arguments, if it has (for example, "Just" has [TypeVar "a"])
70−--
71−getConstructors :: Environment -> ModuleName -> Qualified ProperName -> [(ProperName, [Type])]
72−getConstructors env defmn n = extractConstructors lnte
73− where
74− qpn :: Qualified ProperName
75− qpn = getConsDataName n
76−
77− getConsDataName :: Qualified ProperName -> Qualified ProperName
78− getConsDataName con = qualifyName nm defmn con
79− where
80− nm = case getConsInfo con of
81− Nothing -> error $ "Constructor " ++ showQualified runProperName con ++ " not in the scope of the current environment in getConsDataName."
82− Just (_, pm, _, _) -> pm
83−
84− getConsInfo :: Qualified ProperName -> Maybe (DataDeclType, ProperName, Type, [Ident])
85− getConsInfo con = M.lookup con dce
86− where
87− dce :: M.Map (Qualified ProperName) (DataDeclType, ProperName, Type, [Ident])
88− dce = dataConstructors env
89−
90− lnte :: Maybe (Kind, TypeKind)
91− lnte = M.lookup qpn (types env)
92−
93− extractConstructors :: Maybe (Kind, TypeKind) -> [(ProperName, [Type])]
94− extractConstructors (Just (_, DataType _ pt)) = pt
95− extractConstructors _ = error "Data name not in the scope of the current environment in extractConstructors"
96−
97−-- |
98−-- Replicates a wildcard binder
99−--
100−initialize :: Int -> [Binder]
101−initialize l = replicate l NullBinder
102−
103−-- |
104−-- Applies a function over two lists of tuples that may lack elements
105−--
106−genericMerge :: Ord a =>
107− (a -> Maybe b -> Maybe c -> d) ->
108− [(a, b)] ->
109− [(a, c)] ->
110− [d]
111−genericMerge _ [] [] = []
112−genericMerge f bs [] = map (\(s, b) -> f s (Just b) Nothing) bs
113−genericMerge f [] bs = map (\(s, b) -> f s Nothing (Just b)) bs
114−genericMerge f bsl@((s, b):bs) bsr@((s', b'):bs')
115− | s < s' = f s (Just b) Nothing : genericMerge f bs bsr
116− | s > s' = f s' Nothing (Just b') : genericMerge f bsl bs'
117− | otherwise = f s (Just b) (Just b') : genericMerge f bs bs'
118−
119−-- |
120−-- Find the uncovered set between two binders:
121−-- the first binder is the case we are trying to cover, the second one is the matching binder
122−--
123−missingCasesSingle :: Environment -> ModuleName -> Binder -> Binder -> ([Binder], Either RedudancyError Bool)
124−missingCasesSingle _ _ _ NullBinder = ([], return True)
125−missingCasesSingle _ _ _ (VarBinder _) = ([], return True)
126−missingCasesSingle env mn (VarBinder _) b = missingCasesSingle env mn NullBinder b
127−missingCasesSingle env mn br (NamedBinder _ bl) = missingCasesSingle env mn br bl
128−missingCasesSingle env mn NullBinder cb@(ConstructorBinder con _) =
129− (concatMap (\cp -> fst $ missingCasesSingle env mn cp cb) allPatterns, return True)
130− where
131− allPatterns = map (\(p, t) -> ConstructorBinder (qualifyName p mn con) (initialize $ length t))
132− $ getConstructors env mn con
133−missingCasesSingle env mn cb@(ConstructorBinder con bs) (ConstructorBinder con' bs')
134− | con == con' = let (bs'', pr) = missingCasesMultiple env mn bs bs' in (map (ConstructorBinder con) bs'', pr)
135− | otherwise = ([cb], return False)
136−missingCasesSingle env mn NullBinder (ObjectBinder bs) =
137− (map (ObjectBinder . zip (map fst bs)) allMisses, pr)
138− where
139− (allMisses, pr) = missingCasesMultiple env mn (initialize $ length bs) (map snd bs)
140−missingCasesSingle env mn (ObjectBinder bs) (ObjectBinder bs') =
141− (map (ObjectBinder . zip sortedNames) allMisses, pr)
142− where
143− (allMisses, pr) = uncurry (missingCasesMultiple env mn) (unzip binders)
144−
145− sortNames = sortBy (compare `on` fst)
146−
147− (sbs, sbs') = (sortNames bs, sortNames bs')
148−
149− compB :: a -> Maybe a -> Maybe a -> (a, a)
150− compB e b b' = (fm b, fm b')
151− where
152− fm = fromMaybe e
153−
154− compBS :: Eq a => b -> a -> Maybe b -> Maybe b -> (a, (b, b))
155− compBS e s b b' = (s, compB e b b')
156−
157− (sortedNames, binders) = unzip $ genericMerge (compBS NullBinder) sbs sbs'
158−missingCasesSingle _ _ NullBinder (BooleanBinder b) = ([BooleanBinder $ not b], return True)
159−missingCasesSingle _ _ (BooleanBinder bl) (BooleanBinder br)
160− | bl == br = ([], return True)
161− | otherwise = ([BooleanBinder bl], return False)
162−missingCasesSingle env mn b (PositionedBinder _ _ cb) = missingCasesSingle env mn b cb
163−missingCasesSingle env mn b (TypedBinder _ cb) = missingCasesSingle env mn b cb
164−missingCasesSingle _ _ b _ = ([b], Left Unknown)
165−
166−-- |
167−-- Returns the uncovered set of binders
168−-- the first argument is the list of uncovered binders at step i
169−-- the second argument is the (i+1)th clause of a pattern matching definition
170−--
171−-- The idea of the algorithm is as follows:
172−-- it processes each binder of the two lists (say, `x` and `y`) one by one
173−-- at each step two cases arises:
174−-- - there are no missing cases between `x` and `y`: this is very straightforward, it continues with the remaining cases
175−-- but keeps the uncovered binder in its position.
176−-- - there are missing cases, let us call it the set `U`: on the one hand, we mix each new uncovered case in `U`
177−-- with the current tail of uncovered set. On the other hand, it continues with the remaining cases: here we
178−-- can use `x` (but it will generate overlapping cases), or `y`, which will generate non-overlapping cases.
179−--
180−-- As an example, consider:
181−--
182−-- data N = Z | S N
183−-- f Z Z = Z --> {[S _, _], [Z, S _]} which are the right non-overlapping cases (GHC uses this).
184−--
185−-- if we use `x` instead of `y` (in this case, `y` stands for `Z` and `x` for `_`) we obtain:
186−-- f Z Z = Z --> {[S _, _], [_, S _]} you can see that both cases overlaps each other.
187−--
188−-- Up to now, we've decided to use `x` just because we expect to generate uncovered cases which might be
189−-- redundant or not, but uncovered at least. If we use `y` instead, we'll need to have a redundancy checker
190−-- (which ought to be available soon), or increase the complexity of the algorithm.
191−--
192−missingCasesMultiple :: Environment -> ModuleName -> [Binder] -> [Binder] -> ([[Binder]], Either RedudancyError Bool)
193−missingCasesMultiple env mn = go
194− where
195− go [] [] = ([], pure True)
196− go (x:xs) (y:ys) = (map (: xs) miss1 ++ map (x :) miss2, liftA2 (&&) pr1 pr2)
197− where
198− (miss1, pr1) = missingCasesSingle env mn x y
199− (miss2, pr2) = go xs ys
200− go _ _ = error "Argument lengths did not match in missingCasesMultiple."
201−
202−-- |
203−-- Guard handling
204−--
205−-- We say a guard is exhaustive iff it has an `otherwise` (or `true`) expression.
206−-- Example:
207−-- f x | x < 0 = 0
208−-- | otherwise = 1
209−-- is exhaustive, whereas `f x | x < 0` is not
210−--
211−-- The function below say whether or not a guard has an `otherwise` expression
212−-- It is considered that `otherwise` is defined in Prelude
213−--
214−isExhaustiveGuard :: Either [(Guard, Expr)] Expr -> Bool
215−isExhaustiveGuard (Left gs) = not . null $ filter (\(g, _) -> isOtherwise g) gs
216− where
217− isOtherwise :: Expr -> Bool
218− isOtherwise (TypedValue _ (BooleanLiteral True) _) = True
219− isOtherwise (TypedValue _ (Var (Qualified (Just (ModuleName [ProperName "Prelude"])) (Ident "otherwise"))) _) = True
220− isOtherwise _ = False
221−isExhaustiveGuard (Right _) = True
222−
223−-- |
224−-- Returns the uncovered set of case alternatives
225−--
226−missingCases :: Environment -> ModuleName -> [Binder] -> CaseAlternative -> ([[Binder]], Either RedudancyError Bool)
227−missingCases env mn uncovered ca = missingCasesMultiple env mn uncovered (caseAlternativeBinders ca)
228−
229−missingAlternative :: Environment -> ModuleName -> CaseAlternative -> [Binder] -> ([[Binder]], Either RedudancyError Bool)
230−missingAlternative env mn ca uncovered
231− | isExhaustiveGuard (caseAlternativeResult ca) = mcases
232− | otherwise = ([uncovered], snd mcases)
233− where
234− mcases = missingCases env mn uncovered ca
235−
236−-- |
237−-- Main exhaustivity checking function
238−-- Starting with the set `uncovered = { _ }` (nothing covered, one `_` for each function argument),
239−-- it partitions that set with the new uncovered cases, until it consumes the whole set of clauses.
240−-- Then, returns the uncovered set of case alternatives.
241−--
242−checkExhaustive :: forall m. (MonadWriter MultipleErrors m) => Environment -> ModuleName -> Int -> [CaseAlternative] -> m ()
243−checkExhaustive env mn numArgs cas = makeResult . first nub $ foldl' step ([initialize numArgs], (pure True, [])) cas
244− where
245− step :: ([[Binder]], (Either RedudancyError Bool, [[Binder]])) -> CaseAlternative -> ([[Binder]], (Either RedudancyError Bool, [[Binder]]))
246− step (uncovered, (nec, redundant)) ca =
247− let (missed, pr) = unzip (map (missingAlternative env mn ca) uncovered)
248− (missed', approx) = splitAt 10000 (concat missed)
249− cond = liftA2 (&&) (or <$> sequenceA pr) nec
250− in (missed', ( if null approx
251− then cond
252− else Left Incomplete
253− , if either (const True) id cond
254− then redundant
255− else caseAlternativeBinders ca : redundant
256− )
257− )
258−
259− makeResult :: ([[Binder]], (Either RedudancyError Bool, [[Binder]])) -> m ()
260− makeResult (bss, (rr, bss')) =
261− do unless (null bss) tellExhaustive
262− unless (null bss') tellRedundant
263− case rr of
264− Left Incomplete -> tellIncomplete
265− _ -> return ()
266− where
267− tellExhaustive = tell . errorMessage . uncurry NotExhaustivePattern . second null . splitAt 5 $ bss
268− tellRedundant = tell . errorMessage . uncurry OverlappingPattern . second null . splitAt 5 $ bss'
269− tellIncomplete = tell . errorMessage $ IncompleteExhaustivityCheck
270−
271−-- |
272−-- Exhaustivity checking over a list of declarations
273−--
274−checkExhaustiveDecls :: forall m. (Applicative m, MonadWriter MultipleErrors m) => Environment -> ModuleName -> [Declaration] -> m ()
275−checkExhaustiveDecls env mn = mapM_ onDecl
276− where
277− onDecl :: Declaration -> m ()
278− onDecl (BindingGroupDeclaration bs) = mapM_ (onDecl . convert) bs
279− where
280− convert :: (Ident, NameKind, Expr) -> Declaration
281− convert (name, nk, e) = ValueDeclaration name nk [] (Right e)
282− onDecl (ValueDeclaration name _ _ (Right e)) = censor (addHint (ErrorInValueDeclaration name)) (onExpr e)
283− onDecl (PositionedDeclaration pos _ dec) = censor (addHint (PositionedError pos)) (onDecl dec)
284− onDecl _ = return ()
285−
286− onExpr :: Expr -> m ()
287− onExpr (UnaryMinus e) = onExpr e
288− onExpr (ArrayLiteral es) = mapM_ onExpr es
289− onExpr (ObjectLiteral es) = mapM_ (onExpr . snd) es
290− onExpr (TypeClassDictionaryConstructorApp _ e) = onExpr e
291− onExpr (Accessor _ e) = onExpr e
292− onExpr (ObjectUpdate o es) = onExpr o >> mapM_ (onExpr . snd) es
293− onExpr (Abs _ e) = onExpr e
294− onExpr (App e1 e2) = onExpr e1 >> onExpr e2
295− onExpr (IfThenElse e1 e2 e3) = onExpr e1 >> onExpr e2 >> onExpr e3
296− onExpr (Case es cas) = checkExhaustive env mn (length es) cas >> mapM_ onExpr es >> mapM_ onCaseAlternative cas
297− onExpr (TypedValue _ e _) = onExpr e
298− onExpr (Let ds e) = mapM_ onDecl ds >> onExpr e
299− onExpr (PositionedValue pos _ e) = censor (addHint (PositionedError pos)) (onExpr e)
300− onExpr _ = return ()
301−
302− onCaseAlternative :: CaseAlternative -> m ()
303− onCaseAlternative (CaseAlternative _ (Left es)) = mapM_ (\(e, g) -> onExpr e >> onExpr g) es
304− onCaseAlternative (CaseAlternative _ (Right e)) = onExpr e
305−
306−-- |
307−-- Exhaustivity checking over a single module
308−--
309−checkExhaustiveModule :: forall m. (Applicative m, MonadWriter MultipleErrors m) => Environment -> Module -> m ()
310−checkExhaustiveModule env (Module _ _ mn ds _) = censor (addHint (ErrorInModule mn)) $ checkExhaustiveDecls env mn ds
src/Language/PureScript/Make.hsdeleted−387

This diff is too big to show here.

src/Language/PureScript/ModuleDependencies.hsdeleted−79

This diff is too big to show here.

src/Language/PureScript/Names.hsdeleted−120

This diff is too big to show here.

src/Language/PureScript/Options.hsdeleted−49

This diff is too big to show here.

src/Language/PureScript/Parser.hsdeleted−36

This diff is too big to show here.

src/Language/PureScript/Parser/Common.hsdeleted−139

This diff is too big to show here.

src/Language/PureScript/Parser/Declarations.hsdeleted−568

This diff is too big to show here.

src/Language/PureScript/Parser/JS.hsdeleted−62

This diff is too big to show here.

src/Language/PureScript/Parser/Kinds.hsdeleted−49

This diff is too big to show here.

src/Language/PureScript/Parser/Lexer.hsdeleted−520

This diff is too big to show here.

src/Language/PureScript/Parser/State.hsdeleted−30

This diff is too big to show here.

src/Language/PureScript/Parser/Types.hsdeleted−137

This diff is too big to show here.

src/Language/PureScript/Pretty.hsdeleted−32

This diff is too big to show here.

src/Language/PureScript/Pretty/Common.hsdeleted−80

This diff is too big to show here.

src/Language/PureScript/Pretty/JS.hsdeleted−306

This diff is too big to show here.

src/Language/PureScript/Pretty/Kinds.hsdeleted−58

This diff is too big to show here.

src/Language/PureScript/Pretty/Types.hsdeleted−150

This diff is too big to show here.

src/Language/PureScript/Pretty/Values.hsdeleted−168

This diff is too big to show here.

src/Language/PureScript/Publish.hsdeleted−366

This diff is too big to show here.

src/Language/PureScript/Publish/BoxesHelpers.hsdeleted−38

This diff is too big to show here.

src/Language/PureScript/Publish/ErrorsWarnings.hsdeleted−395

This diff is too big to show here.

src/Language/PureScript/Publish/Utils.hsdeleted−38

This diff is too big to show here.

src/Language/PureScript/Renamer.hsdeleted−200

This diff is too big to show here.

src/Language/PureScript/Sugar.hsdeleted−79

This diff is too big to show here.

src/Language/PureScript/Sugar/BindingGroups.hsdeleted−208

This diff is too big to show here.

src/Language/PureScript/Sugar/CaseDeclarations.hsdeleted−186

This diff is too big to show here.

src/Language/PureScript/Sugar/DoNotation.hsdeleted−77

This diff is too big to show here.

src/Language/PureScript/Sugar/Names.hsdeleted−283

This diff is too big to show here.

src/Language/PureScript/Sugar/Names/Env.hsdeleted−191

This diff is too big to show here.

src/Language/PureScript/Sugar/Names/Exports.hsdeleted−235

This diff is too big to show here.

src/Language/PureScript/Sugar/Names/Imports.hsdeleted−210

This diff is too big to show here.

src/Language/PureScript/Sugar/ObjectWildcards.hsdeleted−68

This diff is too big to show here.

src/Language/PureScript/Sugar/Operators.hsdeleted−177

This diff is too big to show here.

src/Language/PureScript/Sugar/TypeClasses.hsdeleted−309

This diff is too big to show here.

src/Language/PureScript/Sugar/TypeClasses/Deriving.hsdeleted−232

This diff is too big to show here.

src/Language/PureScript/Sugar/TypeDeclarations.hsdeleted−70

This diff is too big to show here.

src/Language/PureScript/Traversals.hsdeleted−45

This diff is too big to show here.

src/Language/PureScript/TypeChecker.hsdeleted−365

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Entailment.hsdeleted−178

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Kinds.hsdeleted−223

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Monad.hsdeleted−278

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Rows.hsdeleted−66

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Skolems.hsdeleted−118

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Subsumption.hsdeleted−88

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Synonyms.hsdeleted−64

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Types.hsdeleted−675

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Unify.hsdeleted−194

This diff is too big to show here.

src/Language/PureScript/TypeClassDictionaries.hsdeleted−62

This diff is too big to show here.

src/Language/PureScript/Types.hsdeleted−315

This diff is too big to show here.

src/System/IO/UTF8.hsdeleted−9

This diff is too big to show here.

src/Tests.hsnew file+141

This diff is too big to show here.

stack-lts-2.yamldeleted−9

This diff is too big to show here.

stack-lts-3.yamldeleted−5

This diff is too big to show here.

stack-nightly.yamldeleted−5

This diff is too big to show here.

stack.nixnew file+23

This diff is too big to show here.

stack.yamlmode 120000 → 100644+24−1

This diff is too big to show here.

support/ffi-loader.gonew file+30

This diff is too big to show here.

support/go.mod.ffi-loadernew file+2

This diff is too big to show here.

support/go.mod.outputnew file+2

This diff is too big to show here.

support/go.mod.workingnew file+1

This diff is too big to show here.

test/Spec.hsnew file+2

This diff is too big to show here.

tests/Main.hsdeleted−221

This diff is too big to show here.

tests/common/TestsSetup.hsdeleted−48

This diff is too big to show here.

tests/support/.gitignoredeleted−2

This diff is too big to show here.

tests/support/bower.jsondeleted−11

This diff is too big to show here.

tests/support/package.jsondeleted−7

This diff is too big to show here.

tests/support/setup-win.cmddeleted−3

This diff is too big to show here.

tests/support/setup.jsdeleted−22

This diff is too big to show here.

travis/after.shdeleted−25

This diff is too big to show here.

travis/configure.shdeleted−17

This diff is too big to show here.

travis/test-install.shdeleted−18

This diff is too big to show here.