git.iko.soy/rowtype-yoga/purescript-native
on f3fc801 help sign in
355eb9b
swap
0 ahead, 1834 behind
381 files changed+24961−2708
since splitsnapshots
unifiedsplit
.gitignore+1−8 .travis.yml+62 CONTRIBUTING.md+40 ChangeLog.md−3 INSTALL.md+47 LICENSE+1863−24 README-go.md−48 README.md+17−33 Setup.hs+4 app/Main.hs−250 bundle/.gitignore+3 bundle/README+20 bundle/build.sh+46 bundle/winbuild.sh+43 core-tests/.gitignore+2 core-tests/test-everything.sh+53 default.nix−23 examples/.gitignore+1 examples/failing/365.purs+14 examples/failing/438.purs+15 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/ExtraRecordField.purs+10 examples/failing/Foldable.purs+17 examples/failing/InfiniteKind.purs+5 examples/failing/InfiniteType.purs+5 examples/failing/InstanceExport.purs+19 examples/failing/KindError.purs+6 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/OverlappingArguments.purs+6 examples/failing/OverlappingBinders.purs+9 examples/failing/OverlappingInstances.purs+14 examples/failing/OverlappingInstances2.purs+24 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/Superclasses4.purs+15 examples/failing/TopLevelCaseNoArgs.purs+8 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/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/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/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/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/ModuleExportHiding.purs+11 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/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/PartialFunction.purs+10 examples/passing/Patterns.purs+22 examples/passing/Person.purs+11 examples/passing/Rank2Data.purs+29 examples/passing/Rank2Object.purs+11 examples/passing/Rank2TypeSynonym.purs+16 examples/passing/Rank2Types.purs+11 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/Superclasses2.purs+23 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/TypedWhere.purs+17 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+44 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+176 psci/Completion.hs+227 psci/Directive.hs+115 psci/IO.hs+21 psci/PSCi.hs+598 psci/Parser.hs+140 psci/Types.hs+181 psci/main/Main.hs+6 psci/tests/Main.hs+156 psci/tests/data/Sample.purs psgo.cabal−145 purescript.cabal+258 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+43 src/Control/Monad/Supply/Class.hs+36 src/Control/Monad/Unify.hs+159 src/Language/PureScript.hs+49 src/Language/PureScript/AST.hs+24 src/Language/PureScript/AST/Binders.hs+86 src/Language/PureScript/AST/Declarations.hs+416 src/Language/PureScript/AST/Exported.hs+136 src/Language/PureScript/AST/Operators.hs+51 src/Language/PureScript/AST/SourcePos.hs+75 src/Language/PureScript/AST/Traversals.hs+401 src/Language/PureScript/Bundle.hs+545 src/Language/PureScript/CodeGen.hs+25 src/Language/PureScript/CodeGen/Externs.hs+136 src/Language/PureScript/CodeGen/JS.hs+359 src/Language/PureScript/CodeGen/JS/AST.hs+344 src/Language/PureScript/CodeGen/JS/Common.hs+181 src/Language/PureScript/CodeGen/JS/Optimizer.hs+89 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+314 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+25 src/Language/PureScript/Constants.hs+275 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+264 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+228 src/Language/PureScript/Docs/ParseAndDesugar.hs+141 src/Language/PureScript/Docs/Render.hs+127 src/Language/PureScript/Docs/RenderedCode.hs+11 src/Language/PureScript/Docs/RenderedCode/Render.hs+179 src/Language/PureScript/Docs/RenderedCode/Types.hs+191 src/Language/PureScript/Docs/Types.hs+511 src/Language/PureScript/Docs/Utils/MonoidExtras.hs+9 src/Language/PureScript/Environment.hs+268 src/Language/PureScript/Errors.hs+813 src/Language/PureScript/Kinds.hs+72 src/Language/PureScript/Linter.hs+88 src/Language/PureScript/Linter/Exhaustive.hs+285 src/Language/PureScript/Make.hs+311 src/Language/PureScript/ModuleDependencies.hs+77 src/Language/PureScript/Names.hs+102 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+551 src/Language/PureScript/Parser/JS.hs+59 src/Language/PureScript/Parser/Kinds.hs+45 src/Language/PureScript/Parser/Lexer.hs+519 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+69 src/Language/PureScript/Pretty/JS.hs+301 src/Language/PureScript/Pretty/Kinds.hs+59 src/Language/PureScript/Pretty/Types.hs+127 src/Language/PureScript/Pretty/Values.hs+218 src/Language/PureScript/Publish.hs+361 src/Language/PureScript/Publish/BoxesHelpers.hs+38 src/Language/PureScript/Publish/ErrorsWarnings.hs+385 src/Language/PureScript/Publish/Utils.hs+38 src/Language/PureScript/Renamer.hs+196 src/Language/PureScript/Sugar.hs+71 src/Language/PureScript/Sugar/BindingGroups.hs+206 src/Language/PureScript/Sugar/CaseDeclarations.hs+180 src/Language/PureScript/Sugar/DoNotation.hs+74 src/Language/PureScript/Sugar/Names.hs+609 src/Language/PureScript/Sugar/ObjectWildcards.hs+65 src/Language/PureScript/Sugar/Operators.hs+166 src/Language/PureScript/Sugar/TypeClasses.hs+297 src/Language/PureScript/Sugar/TypeDeclarations.hs+69 src/Language/PureScript/Traversals.hs+41 src/Language/PureScript/TypeChecker.hs+334 src/Language/PureScript/TypeChecker/Entailment.hs+207 src/Language/PureScript/TypeChecker/Kinds.hs+218 src/Language/PureScript/TypeChecker/Monad.hs+272 src/Language/PureScript/TypeChecker/Rows.hs+67 src/Language/PureScript/TypeChecker/Skolems.hs+114 src/Language/PureScript/TypeChecker/Subsumption.hs+96 src/Language/PureScript/TypeChecker/Synonyms.hs+105 src/Language/PureScript/TypeChecker/Types.hs+678 src/Language/PureScript/TypeChecker/Unify.hs+206 src/Language/PureScript/TypeClassDictionaries.hs+96 src/Language/PureScript/Types.hs+311 src/Tests.hs−141 stack.nix−23 stack.yaml+7−22 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+261 tests/support/.gitignore+2 tests/support/bower.json+11 tests/support/package.json+7 tests/support/setup.js+22 travis/after.sh+25 travis/configure.sh+17 travis/test-install.sh+12
.gitignore+1−8
@@ -11,13 +11,6 @@ cabal.sandbox.config
1111.psci_modules/
1212.test_modules/
1313bower_components/
14−node_modules
1514tmp/
1615.stack-work/
17−stack.yaml.lock
18−output
19−examples/docs/docs/
20−core-tests/full-core-docs.md
21−.psc-ide-port
22−.vscode/
23−result
16+tests/support/flattened/
.travis.ymlnew file+62
@@ -0,0 +1,62 @@
1+sudo: false
2+env:
3+ - GHCVER=7.8.3 COVERAGE_SUITE=tests
4+ - GHCVER=7.8.3 COVERAGE_SUITE=psci-tests
5+ - GHCVER=7.6.3
6+ - GHCVER=7.10.1
7+before_install:
8+ - export PATH="/opt/ghc/$GHCVER/bin:$PATH"
9+ - export PATH="/opt/cabal/1.22/bin:$PATH"
10+ - export PATH="$HOME/.cabal/bin:$PATH"
11+ - export PATH="/opt/happy/1.19.5/bin:/$PATH"
12+ - export PATH="/opt/alex/3.1.4/bin:/$PATH"
13+install:
14+ - cabal --version
15+ - echo "$(ghc --version) [$(ghc --print-project-git-commit-id 2> /dev/null || echo '?')]"
16+ - travis_retry cabal update
17+ - cabal sandbox init
18+ # Run with limited concurrency
19+ # Travis container infrastructure seems to expose all host CPUs (16?), thus
20+ # cabal and ghc tries to use them all. Which is bad idea on a shared box.
21+ # See also: https://ghc.haskell.org/trac/ghc/ticket/9221
22+ #
23+ # We probably want to be running with larger heap sizes when there are lots
24+ # of cores, to counteract the synchronization overhead of stop-the-world GC
25+ # across many cores. e.g. +RTS -A32m at least.
26+ - cabal install --only-dependencies --enable-tests -j2 --ghc-options='+RTS -A32m -RTS'
27+ - cabal install hpc-coveralls -j2
28+script:
29+ - ./travis/configure.sh
30+ - cabal build -j2 --ghc-options='+RTS -A32m -RTS'
31+ - cabal test
32+ - ./travis/test-install.sh
33+after_script:
34+ - ./travis/after.sh
35+notifications:
36+ email: true
37+before_deploy: "./bundle/build.sh linux64"
38+deploy:
39+ provider: releases
40+ api_key: $RELEASE_KEY
41+ file:
42+ - bundle/linux64.tar.gz
43+ - bundle/linux64.sha
44+ skip_cleanup: true
45+ on:
46+ all_branches: true
47+ tags: true
48+addons:
49+ apt:
50+ sources:
51+ - hvr-ghc
52+ packages:
53+ - cabal-install-1.22
54+ - ghc-7.6.3
55+ - ghc-7.8.3
56+ - ghc-7.10.1
57+ - happy-1.19.5
58+ - alex-3.1.4
59+cache:
60+ directories:
61+ - .cabal-sandbox
62+ - ../install-test/.cabal-sandbox
CONTRIBUTING.mdnew file+40
@@ -0,0 +1,40 @@
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.
ChangeLog.mddeleted−3
@@ -1,3 +0,0 @@
1−# Changelog for pscpp
2−
3−## Unreleased changes
INSTALL.mdnew file+47
@@ -0,0 +1,47 @@
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.3, and therefore they should
10+run on any operating system supported by GHC 7.8.3, 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 `cabal-install`:
28+
29+```
30+$ cabal update && cabal install purescript
31+```
32+
33+The PureScript compiler has been known to run on OS X 10.6 when built with GHC
34+7.6.
35+
36+## The "curses" library
37+
38+`psci` depends on the `curses` library (via the Haskell package `terminfo`). If
39+you are having difficulty running the compiler, it may be because the `curses`
40+library is missing.
41+
42+On Linux, you will probably need to install `ncurses` manually. On Ubuntu, for
43+example, this can be done by running:
44+
45+```
46+$ sudo apt-get install libncurses5-dev
47+```
LICENSE+1863−24
@@ -1,30 +1,1869 @@
1−Copyright Andy Arvanitis (c) 2018
1+The MIT License (MIT)
22
3−All rights reserved.
3+Copyright (c) 2013-15 Phil Freeman, (c) 2014-2015 Gary Burgess, and other
4+contributors
45
5−Redistribution and use in source and binary forms, with or without
6−modification, are permitted provided that the following conditions are met:
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:
712
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+ blaze-builder
35+ bower-json
36+ boxes
37+ bytestring
38+ containers
39+ deepseq
40+ directory
41+ dlist
42+ filepath
43+ ghc-prim
44+ hashable
45+ haskeline
46+ integer-gmp
47+ language-javascript
48+ mtl
49+ nats
50+ old-locale
51+ optparse-applicative
52+ parsec
53+ pattern-arrows
54+ pretty
55+ primitive
56+ process
57+ rts
58+ safe
59+ scientific
60+ semigroups
61+ split
62+ syb
63+ template-haskell
64+ terminfo
65+ text
66+ time
67+ transformers
68+ transformers-compat
69+ unix
70+ unordered-containers
71+ utf8-string
72+ vector
73+ void
74+
75+Glob LICENSE file:
76+
77+ The code in Glob is released under the license below. Copyrights to parts of
78+ the code are held by whoever wrote the code in question: see CREDITS.txt for a
79+ list of authors.
80+
81+ Copyright (c) 2008-2012 <authors>
82+ All rights reserved.
83+
84+ Redistribution and use in source and binary forms, with or without
85+ modification, are permitted provided that the following conditions are met:
86+ * Redistributions of source code must retain the above copyright
87+ notice, this list of conditions and the following disclaimer.
88+ * Redistributions in binary form must reproduce the above copyright
89+ notice, this list of conditions and the following disclaimer in the
90+ documentation and/or other materials provided with the distribution.
91+ * Neither the name of the project nor the names of its contributors may be
92+ used to endorse or promote products derived from this software without
93+ specific prior written permission.
94+
95+ THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR IMPLIED
96+ WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
97+ MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
98+ EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
99+ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
100+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
101+ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
102+ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
103+ OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
104+ ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
105+
106+HUnit LICENSE file:
107+
108+ HUnit is Copyright (c) Dean Herington, 2002, all rights reserved,
109+ and is distributed as free software under the following license.
110+
111+ Redistribution and use in source and binary forms, with or without
112+ modification, are permitted provided that the following conditions
113+ are met:
114+
115+ - Redistributions of source code must retain the above copyright
116+ notice, this list of conditions, and the following disclaimer.
117+
118+ - Redistributions in binary form must reproduce the above copyright
119+ notice, this list of conditions, and the following disclaimer in the
120+ documentation and/or other materials provided with the distribution.
121+
122+ - The names of the copyright holders may not be used to endorse or
123+ promote products derived from this software without specific prior
124+ written permission.
125+
126+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS "AS IS" AND ANY
127+ EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
128+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
129+ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS BE
130+ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
131+ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
132+ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
133+ BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
134+ WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
135+ OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
136+ IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
137+
138+aeson LICENSE file:
139+
140+ Copyright (c) 2011, MailRank, Inc.
141+
142+ All rights reserved.
143+
144+ Redistribution and use in source and binary forms, with or without
145+ modification, are permitted provided that the following conditions
146+ are met:
147+
148+ 1. Redistributions of source code must retain the above copyright
149+ notice, this list of conditions and the following disclaimer.
150+
151+ 2. Redistributions in binary form must reproduce the above copyright
152+ notice, this list of conditions and the following disclaimer in the
153+ documentation and/or other materials provided with the distribution.
154+
155+ 3. Neither the name of the author nor the names of his contributors
156+ may be used to endorse or promote products derived from this software
157+ without specific prior written permission.
158+
159+ THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
160+ OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
161+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
162+ DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
163+ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
164+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
165+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
166+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
167+ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
168+ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
169+ POSSIBILITY OF SUCH DAMAGE.
170+
171+aeson-better-errors LICENSE file:
172+
173+ Copyright (c) 2015 Harry Garrood
174+
175+ Permission is hereby granted, free of charge, to any person obtaining
176+ a copy of this software and associated documentation files (the
177+ "Software"), to deal in the Software without restriction, including
178+ without limitation the rights to use, copy, modify, merge, publish,
179+ distribute, sublicense, and/or sell copies of the Software, and to
180+ permit persons to whom the Software is furnished to do so, subject to
181+ the following conditions:
182+
183+ The above copyright notice and this permission notice shall be included
184+ in all copies or substantial portions of the Software.
185+
186+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
187+ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
188+ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
189+ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
190+ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
191+ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
192+ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
193+
194+ansi-terminal LICENSE file:
195+
196+ Copyright (c) 2008, Maximilian Bolingbroke
197+ All rights reserved.
198+
199+ Redistribution and use in source and binary forms, with or without modification, are permitted
200+ provided that the following conditions are met:
201+
202+ * Redistributions of source code must retain the above copyright notice, this list of
203+ conditions and the following disclaimer.
204+ * Redistributions in binary form must reproduce the above copyright notice, this list of
205+ conditions and the following disclaimer in the documentation and/or other materials
206+ provided with the distribution.
207+ * Neither the name of Maximilian Bolingbroke nor the names of other contributors may be used to
208+ endorse or promote products derived from this software without specific prior written permission.
209+
210+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
211+ IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
212+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
213+ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
214+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
215+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
216+ IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
217+ OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
218+
219+ansi-wl-pprint LICENSE file:
220+
221+ Copyright 2008, Daan Leijen and Max Bolingbroke. All rights reserved.
222+
223+ Redistribution and use in source and binary forms, with or without
224+ modification, are permitted provided that the following conditions are
225+ met:
226+
8227 * Redistributions of source code must retain the above copyright
9228 notice, this list of conditions and the following disclaimer.
229+
230+ * Redistributions in binary form must reproduce the above copyright
231+ notice, this list of conditions and the following disclaimer in
232+ the documentation and/or other materials provided with the
233+ distribution.
234+
235+ This software is provided by the copyright holders "as is" and any
236+ express or implied warranties, including, but not limited to, the
237+ implied warranties of merchantability and fitness for a particular
238+ purpose are disclaimed. In no event shall the copyright holders be
239+ liable for any direct, indirect, incidental, special, exemplary, or
240+ consequential damages (including, but not limited to, procurement of
241+ substitute goods or services; loss of use, data, or profits; or
242+ business interruption) however caused and on any theory of liability,
243+ whether in contract, strict liability, or tort (including negligence
244+ or otherwise) arising in any way out of the use of this software, even
245+ if advised of the possibility of such damage.
246+
247+array LICENSE file:
248+
249+ This library (libraries/base) is derived from code from several
250+ sources:
251+
252+ * Code from the GHC project which is largely (c) The University of
253+ Glasgow, and distributable under a BSD-style license (see below),
254+
255+ * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
256+ and freely redistributable (but see the full license for
257+ restrictions).
258+
259+ * Code from the Haskell Foreign Function Interface specification,
260+ which is (c) Manuel M. T. Chakravarty and freely redistributable
261+ (but see the full license for restrictions).
262+
263+ The full text of these licenses is reproduced below. All of the
264+ licenses are BSD-style or compatible.
265+
266+ -----------------------------------------------------------------------------
267+
268+ The Glasgow Haskell Compiler License
269+
270+ Copyright 2004, The University Court of the University of Glasgow.
271+ All rights reserved.
272+
273+ Redistribution and use in source and binary forms, with or without
274+ modification, are permitted provided that the following conditions are met:
275+
276+ - Redistributions of source code must retain the above copyright notice,
277+ this list of conditions and the following disclaimer.
278+
279+ - Redistributions in binary form must reproduce the above copyright notice,
280+ this list of conditions and the following disclaimer in the documentation
281+ and/or other materials provided with the distribution.
282+
283+ - Neither name of the University nor the names of its contributors may be
284+ used to endorse or promote products derived from this software without
285+ specific prior written permission.
286+
287+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
288+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
289+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
290+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
291+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
292+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
293+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
294+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
295+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
296+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
297+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
298+ DAMAGE.
299+
300+ -----------------------------------------------------------------------------
301+
302+ Code derived from the document "Report on the Programming Language
303+ Haskell 98", is distributed under the following license:
304+
305+ Copyright (c) 2002 Simon Peyton Jones
306+
307+ The authors intend this Report to belong to the entire Haskell
308+ community, and so we grant permission to copy and distribute it for
309+ any purpose, provided that it is reproduced in its entirety,
310+ including this Notice. Modified versions of this Report may also be
311+ copied and distributed for any purpose, provided that the modified
312+ version is clearly presented as such, and that it does not claim to
313+ be a definition of the Haskell 98 Language.
314+
315+ -----------------------------------------------------------------------------
316+
317+ Code derived from the document "The Haskell 98 Foreign Function
318+ Interface, An Addendum to the Haskell 98 Report" is distributed under
319+ the following license:
320+
321+ Copyright (c) 2002 Manuel M. T. Chakravarty
322+
323+ The authors intend this Report to belong to the entire Haskell
324+ community, and so we grant permission to copy and distribute it for
325+ any purpose, provided that it is reproduced in its entirety,
326+ including this Notice. Modified versions of this Report may also be
327+ copied and distributed for any purpose, provided that the modified
328+ version is clearly presented as such, and that it does not claim to
329+ be a definition of the Haskell 98 Foreign Function Interface.
330+
331+ -----------------------------------------------------------------------------
332+
333+attoparsec LICENSE file:
334+
335+ Copyright (c) Lennart Kolmodin
336+
337+ All rights reserved.
338+
339+ Redistribution and use in source and binary forms, with or without
340+ modification, are permitted provided that the following conditions
341+ are met:
342+
343+ 1. Redistributions of source code must retain the above copyright
344+ notice, this list of conditions and the following disclaimer.
345+
346+ 2. Redistributions in binary form must reproduce the above copyright
347+ notice, this list of conditions and the following disclaimer in the
348+ documentation and/or other materials provided with the distribution.
349+
350+ 3. Neither the name of the author nor the names of his contributors
351+ may be used to endorse or promote products derived from this software
352+ without specific prior written permission.
353+
354+ THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
355+ OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
356+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
357+ DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
358+ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
359+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
360+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
361+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
362+ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
363+ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
364+ POSSIBILITY OF SUCH DAMAGE.
365+
366+base LICENSE file:
367+
368+ This library (libraries/base) is derived from code from several
369+ sources:
370+
371+ * Code from the GHC project which is largely (c) The University of
372+ Glasgow, and distributable under a BSD-style license (see below),
373+
374+ * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
375+ and freely redistributable (but see the full license for
376+ restrictions).
377+
378+ * Code from the Haskell Foreign Function Interface specification,
379+ which is (c) Manuel M. T. Chakravarty and freely redistributable
380+ (but see the full license for restrictions).
381+
382+ The full text of these licenses is reproduced below. All of the
383+ licenses are BSD-style or compatible.
384+
385+ -----------------------------------------------------------------------------
386+
387+ The Glasgow Haskell Compiler License
388+
389+ Copyright 2004, The University Court of the University of Glasgow.
390+ All rights reserved.
391+
392+ Redistribution and use in source and binary forms, with or without
393+ modification, are permitted provided that the following conditions are met:
394+
395+ - Redistributions of source code must retain the above copyright notice,
396+ this list of conditions and the following disclaimer.
397+
398+ - Redistributions in binary form must reproduce the above copyright notice,
399+ this list of conditions and the following disclaimer in the documentation
400+ and/or other materials provided with the distribution.
401+
402+ - Neither name of the University nor the names of its contributors may be
403+ used to endorse or promote products derived from this software without
404+ specific prior written permission.
405+
406+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
407+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
408+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
409+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
410+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
411+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
412+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
413+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
414+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
415+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
416+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
417+ DAMAGE.
418+
419+ -----------------------------------------------------------------------------
420+
421+ Code derived from the document "Report on the Programming Language
422+ Haskell 98", is distributed under the following license:
423+
424+ Copyright (c) 2002 Simon Peyton Jones
425+
426+ The authors intend this Report to belong to the entire Haskell
427+ community, and so we grant permission to copy and distribute it for
428+ any purpose, provided that it is reproduced in its entirety,
429+ including this Notice. Modified versions of this Report may also be
430+ copied and distributed for any purpose, provided that the modified
431+ version is clearly presented as such, and that it does not claim to
432+ be a definition of the Haskell 98 Language.
433+
434+ -----------------------------------------------------------------------------
435+
436+ Code derived from the document "The Haskell 98 Foreign Function
437+ Interface, An Addendum to the Haskell 98 Report" is distributed under
438+ the following license:
439+
440+ Copyright (c) 2002 Manuel M. T. Chakravarty
441+
442+ The authors intend this Report to belong to the entire Haskell
443+ community, and so we grant permission to copy and distribute it for
444+ any purpose, provided that it is reproduced in its entirety,
445+ including this Notice. Modified versions of this Report may also be
446+ copied and distributed for any purpose, provided that the modified
447+ version is clearly presented as such, and that it does not claim to
448+ be a definition of the Haskell 98 Foreign Function Interface.
449+
450+ -----------------------------------------------------------------------------
451+
452+blaze-builder LICENSE file:
453+
454+ Copyright Jasper Van der Jeugt 2010, Simon Meier 2010 & 2011
455+
456+ All rights reserved.
457+
458+ Redistribution and use in source and binary forms, with or without
459+ modification, are permitted provided that the following conditions are met:
460+
461+ * Redistributions of source code must retain the above copyright
462+ notice, this list of conditions and the following disclaimer.
463+
464+ * Redistributions in binary form must reproduce the above
465+ copyright notice, this list of conditions and the following
466+ disclaimer in the documentation and/or other materials provided
467+ with the distribution.
468+
469+ * Neither the name of Jasper Van der Jeugt nor the names of other
470+ contributors may be used to endorse or promote products derived
471+ from this software without specific prior written permission.
472+
473+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
474+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
475+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
476+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
477+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
478+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
479+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
480+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
481+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
482+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
483+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
484+
485+bower-json LICENSE file:
486+
487+ Copyright (c) 2015 Harry Garrood
488+
489+ Permission is hereby granted, free of charge, to any person obtaining
490+ a copy of this software and associated documentation files (the
491+ "Software"), to deal in the Software without restriction, including
492+ without limitation the rights to use, copy, modify, merge, publish,
493+ distribute, sublicense, and/or sell copies of the Software, and to
494+ permit persons to whom the Software is furnished to do so, subject to
495+ the following conditions:
496+
497+ The above copyright notice and this permission notice shall be included
498+ in all copies or substantial portions of the Software.
499+
500+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
501+ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
502+ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
503+ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
504+ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
505+ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
506+ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
507+
508+boxes LICENSE file:
509+
510+ Copyright (c) Brent Yorgey 2008
511+
512+ Redistribution and use in source and binary forms, with or without
513+ modification, are permitted provided that the following conditions
514+ are met:
515+ 1. Redistributions of source code must retain the above copyright
516+ notice, this list of conditions and the following disclaimer.
517+ 2. Redistributions in binary form must reproduce the above copyright
518+ notice, this list of conditions and the following disclaimer in the
519+ documentation and/or other materials provided with the distribution.
520+ 3. Neither the name of the author nor the names of other contributors
521+ may be used to endorse or promote products derived from this software
522+ without specific prior written permission.
523+
524+ All other rights are reserved.
525+
526+ THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND
527+ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
528+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
529+ ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
530+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
531+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
532+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
533+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
534+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
535+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
536+ SUCH DAMAGE.
537+
538+bytestring LICENSE file:
539+
540+ Copyright (c) Don Stewart 2005-2009
541+ (c) Duncan Coutts 2006-2015
542+ (c) David Roundy 2003-2005
543+ (c) Simon Meier 2010-2011
544+
545+ All rights reserved.
546+
547+ Redistribution and use in source and binary forms, with or without
548+ modification, are permitted provided that the following conditions
549+ are met:
550+ 1. Redistributions of source code must retain the above copyright
551+ notice, this list of conditions and the following disclaimer.
552+ 2. Redistributions in binary form must reproduce the above copyright
553+ notice, this list of conditions and the following disclaimer in the
554+ documentation and/or other materials provided with the distribution.
555+ 3. Neither the name of the author nor the names of his contributors
556+ may be used to endorse or promote products derived from this software
557+ without specific prior written permission.
558+
559+ THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
560+ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
561+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
562+ ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
563+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
564+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
565+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
566+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
567+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
568+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
569+ SUCH DAMAGE.
570+
571+containers LICENSE file:
572+
573+ The Glasgow Haskell Compiler License
574+
575+ Copyright 2004, The University Court of the University of Glasgow.
576+ All rights reserved.
577+
578+ Redistribution and use in source and binary forms, with or without
579+ modification, are permitted provided that the following conditions are met:
580+
581+ - Redistributions of source code must retain the above copyright notice,
582+ this list of conditions and the following disclaimer.
583+
584+ - Redistributions in binary form must reproduce the above copyright notice,
585+ this list of conditions and the following disclaimer in the documentation
586+ and/or other materials provided with the distribution.
587+
588+ - Neither name of the University nor the names of its contributors may be
589+ used to endorse or promote products derived from this software without
590+ specific prior written permission.
591+
592+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
593+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
594+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
595+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
596+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
597+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
598+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
599+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
600+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
601+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
602+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
603+ DAMAGE.
604+
605+deepseq LICENSE file:
606+
607+ This library (deepseq) is derived from code from the GHC project which
608+ is largely (c) The University of Glasgow, and distributable under a
609+ BSD-style license (see below).
610+
611+ -----------------------------------------------------------------------------
612+
613+ The Glasgow Haskell Compiler License
614+
615+ Copyright 2001-2009, The University Court of the University of Glasgow.
616+ All rights reserved.
617+
618+ Redistribution and use in source and binary forms, with or without
619+ modification, are permitted provided that the following conditions are met:
620+
621+ - Redistributions of source code must retain the above copyright notice,
622+ this list of conditions and the following disclaimer.
623+
624+ - Redistributions in binary form must reproduce the above copyright notice,
625+ this list of conditions and the following disclaimer in the documentation
626+ and/or other materials provided with the distribution.
627+
628+ - Neither name of the University nor the names of its contributors may be
629+ used to endorse or promote products derived from this software without
630+ specific prior written permission.
631+
632+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
633+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
634+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
635+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
636+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
637+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
638+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
639+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
640+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
641+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
642+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
643+ DAMAGE.
644+
645+ -----------------------------------------------------------------------------
646+
647+directory LICENSE file:
648+
649+ This library (libraries/base) is derived from code from two
650+ sources:
651+
652+ * Code from the GHC project which is largely (c) The University of
653+ Glasgow, and distributable under a BSD-style license (see below),
654+
655+ * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
656+ and freely redistributable (but see the full license for
657+ restrictions).
658+
659+ The full text of these licenses is reproduced below. Both of the
660+ licenses are BSD-style or compatible.
661+
662+ -----------------------------------------------------------------------------
663+
664+ The Glasgow Haskell Compiler License
665+
666+ Copyright 2004, The University Court of the University of Glasgow.
667+ All rights reserved.
668+
669+ Redistribution and use in source and binary forms, with or without
670+ modification, are permitted provided that the following conditions are met:
671+
672+ - Redistributions of source code must retain the above copyright notice,
673+ this list of conditions and the following disclaimer.
674+
675+ - Redistributions in binary form must reproduce the above copyright notice,
676+ this list of conditions and the following disclaimer in the documentation
677+ and/or other materials provided with the distribution.
678+
679+ - Neither name of the University nor the names of its contributors may be
680+ used to endorse or promote products derived from this software without
681+ specific prior written permission.
682+
683+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
684+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
685+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
686+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
687+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
688+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
689+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
690+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
691+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
692+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
693+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
694+ DAMAGE.
695+
696+ -----------------------------------------------------------------------------
697+
698+ Code derived from the document "Report on the Programming Language
699+ Haskell 98", is distributed under the following license:
700+
701+ Copyright (c) 2002 Simon Peyton Jones
702+
703+ The authors intend this Report to belong to the entire Haskell
704+ community, and so we grant permission to copy and distribute it for
705+ any purpose, provided that it is reproduced in its entirety,
706+ including this Notice. Modified versions of this Report may also be
707+ copied and distributed for any purpose, provided that the modified
708+ version is clearly presented as such, and that it does not claim to
709+ be a definition of the Haskell 98 Language.
710+
711+ -----------------------------------------------------------------------------
712+
713+dlist LICENSE file:
714+
715+ Copyright (c) 2006-2009 Don Stewart, 2013-2014 Sean Leather
716+
717+ All rights reserved.
718+
719+ Redistribution and use in source and binary forms, with or without
720+ modification, are permitted provided that the following conditions are
721+ met:
722+
723+ * Redistributions of source code must retain the above copyright
724+ notice, this list of conditions and the following disclaimer.
725+
726+ * Redistributions in binary form must reproduce the above
727+ copyright notice, this list of conditions and the following
728+ disclaimer in the documentation and/or other materials provided
729+ with the distribution.
730+
731+ * Neither the name of Don Stewart nor the names of other
732+ contributors may be used to endorse or promote products derived
733+ from this software without specific prior written permission.
734+
735+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
736+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
737+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
738+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
739+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
740+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
741+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
742+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
743+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
744+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
745+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
746+
747+filepath LICENSE file:
748+
749+ Copyright Neil Mitchell 2005-2015.
750+ All rights reserved.
751+
752+ Redistribution and use in source and binary forms, with or without
753+ modification, are permitted provided that the following conditions are
754+ met:
755+
756+ * Redistributions of source code must retain the above copyright
757+ notice, this list of conditions and the following disclaimer.
758+
759+ * Redistributions in binary form must reproduce the above
760+ copyright notice, this list of conditions and the following
761+ disclaimer in the documentation and/or other materials provided
762+ with the distribution.
763+
764+ * Neither the name of Neil Mitchell nor the names of other
765+ contributors may be used to endorse or promote products derived
766+ from this software without specific prior written permission.
767+
768+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
769+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
770+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
771+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
772+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
773+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
774+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
775+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
776+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
777+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
778+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
779+
780+ghc-prim LICENSE file:
781+
782+ This library (libraries/ghc-prim) is derived from code from several
783+ sources:
784+
785+ * Code from the GHC project which is largely (c) The University of
786+ Glasgow, and distributable under a BSD-style license (see below),
787+
788+ * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
789+ and freely redistributable (but see the full license for
790+ restrictions).
791+
792+ The full text of these licenses is reproduced below. All of the
793+ licenses are BSD-style or compatible.
794+
795+ -----------------------------------------------------------------------------
796+
797+ The Glasgow Haskell Compiler License
798+
799+ Copyright 2004, The University Court of the University of Glasgow.
800+ All rights reserved.
801+
802+ Redistribution and use in source and binary forms, with or without
803+ modification, are permitted provided that the following conditions are met:
804+
805+ - Redistributions of source code must retain the above copyright notice,
806+ this list of conditions and the following disclaimer.
807+
808+ - Redistributions in binary form must reproduce the above copyright notice,
809+ this list of conditions and the following disclaimer in the documentation
810+ and/or other materials provided with the distribution.
811+
812+ - Neither name of the University nor the names of its contributors may be
813+ used to endorse or promote products derived from this software without
814+ specific prior written permission.
815+
816+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
817+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
818+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
819+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
820+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
821+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
822+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
823+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
824+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
825+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
826+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
827+ DAMAGE.
828+
829+ -----------------------------------------------------------------------------
830+
831+ Code derived from the document "Report on the Programming Language
832+ Haskell 98", is distributed under the following license:
833+
834+ Copyright (c) 2002 Simon Peyton Jones
835+
836+ The authors intend this Report to belong to the entire Haskell
837+ community, and so we grant permission to copy and distribute it for
838+ any purpose, provided that it is reproduced in its entirety,
839+ including this Notice. Modified versions of this Report may also be
840+ copied and distributed for any purpose, provided that the modified
841+ version is clearly presented as such, and that it does not claim to
842+ be a definition of the Haskell 98 Language.
843+
844+
845+hashable LICENSE file:
846+
847+ Copyright Milan Straka 2010
848+
849+ All rights reserved.
850+
851+ Redistribution and use in source and binary forms, with or without
852+ modification, are permitted provided that the following conditions are met:
853+
854+ * Redistributions of source code must retain the above copyright
855+ notice, this list of conditions and the following disclaimer.
856+
857+ * Redistributions in binary form must reproduce the above
858+ copyright notice, this list of conditions and the following
859+ disclaimer in the documentation and/or other materials provided
860+ with the distribution.
861+
862+ * Neither the name of Milan Straka nor the names of other
863+ contributors may be used to endorse or promote products derived
864+ from this software without specific prior written permission.
865+
866+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
867+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
868+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
869+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
870+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
871+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
872+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
873+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
874+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
875+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
876+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
877+
878+haskeline LICENSE file:
879+
880+ Copyright 2007-2009, Judah Jacobson.
881+ All Rights Reserved.
882+
883+ Redistribution and use in source and binary forms, with or without
884+ modification, are permitted provided that the following conditions are met:
885+
886+ - Redistribution of source code must retain the above copyright notice,
887+ this list of conditions and the following disclaimer.
888+
889+ - Redistribution in binary form must reproduce the above copyright notice,
890+ this list of conditions and the following disclaimer in the documentation
891+ and/or other materials provided with the distribution.
892+
893+ THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY
894+ EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
895+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
896+ DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR THE CONTRIBUTORS BE LIABLE
897+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
898+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
899+ SERVICES; LOSS OF USE, DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
900+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
901+ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
902+ USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
903+
904+integer-gmp LICENSE file:
905+
906+ Copyright (c) 2014, Herbert Valerio Riedel
907+
908+ All rights reserved.
909+
910+ Redistribution and use in source and binary forms, with or without
911+ modification, are permitted provided that the following conditions are met:
912+
913+ * Redistributions of source code must retain the above copyright
914+ notice, this list of conditions and the following disclaimer.
915+
916+ * Redistributions in binary form must reproduce the above
917+ copyright notice, this list of conditions and the following
918+ disclaimer in the documentation and/or other materials provided
919+ with the distribution.
920+
921+ * Neither the name of Herbert Valerio Riedel nor the names of other
922+ contributors may be used to endorse or promote products derived
923+ from this software without specific prior written permission.
924+
925+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
926+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
927+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
928+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
929+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
930+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
931+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
932+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
933+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
934+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
935+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
936+
937+language-javascript LICENSE file:
938+
939+ Copyright (c)2010, Alan Zimmerman
940+
941+ All rights reserved.
942+
943+ Redistribution and use in source and binary forms, with or without
944+ modification, are permitted provided that the following conditions are met:
945+
946+ * Redistributions of source code must retain the above copyright
947+ notice, this list of conditions and the following disclaimer.
948+
949+ * Redistributions in binary form must reproduce the above
950+ copyright notice, this list of conditions and the following
951+ disclaimer in the documentation and/or other materials provided
952+ with the distribution.
953+
954+ * Neither the name of Alan Zimmerman nor the names of other
955+ contributors may be used to endorse or promote products derived
956+ from this software without specific prior written permission.
957+
958+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
959+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
960+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
961+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
962+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
963+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
964+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
965+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
966+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
967+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
968+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
969+
970+mtl LICENSE file:
971+
972+ The Glasgow Haskell Compiler License
973+
974+ Copyright 2004, The University Court of the University of Glasgow.
975+ All rights reserved.
976+
977+ Redistribution and use in source and binary forms, with or without
978+ modification, are permitted provided that the following conditions are met:
979+
980+ - Redistributions of source code must retain the above copyright notice,
981+ this list of conditions and the following disclaimer.
982+
983+ - Redistributions in binary form must reproduce the above copyright notice,
984+ this list of conditions and the following disclaimer in the documentation
985+ and/or other materials provided with the distribution.
986+
987+ - Neither name of the University nor the names of its contributors may be
988+ used to endorse or promote products derived from this software without
989+ specific prior written permission.
990+
991+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
992+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
993+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
994+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
995+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
996+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
997+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
998+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
999+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1000+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1001+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1002+ DAMAGE.
1003+
1004+nats LICENSE file:
1005+
1006+ Copyright 2011-2014 Edward Kmett
1007+
1008+ All rights reserved.
1009+
1010+ Redistribution and use in source and binary forms, with or without
1011+ modification, are permitted provided that the following conditions
1012+ are met:
1013+
1014+ 1. Redistributions of source code must retain the above copyright
1015+ notice, this list of conditions and the following disclaimer.
1016+
1017+ 2. Redistributions in binary form must reproduce the above copyright
1018+ notice, this list of conditions and the following disclaimer in the
1019+ documentation and/or other materials provided with the distribution.
1020+
1021+ 3. Neither the name of the author nor the names of his contributors
1022+ may be used to endorse or promote products derived from this software
1023+ without specific prior written permission.
1024+
1025+ THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1026+ IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1027+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1028+ DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1029+ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1030+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1031+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1032+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1033+ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1034+ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1035+ POSSIBILITY OF SUCH DAMAGE.
1036+
1037+old-locale LICENSE file:
1038+
1039+ This library (libraries/base) is derived from code from two
1040+ sources:
1041+
1042+ * Code from the GHC project which is largely (c) The University of
1043+ Glasgow, and distributable under a BSD-style license (see below),
1044+
1045+ * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
1046+ and freely redistributable (but see the full license for
1047+ restrictions).
1048+
1049+ The full text of these licenses is reproduced below. Both of the
1050+ licenses are BSD-style or compatible.
1051+
1052+ -----------------------------------------------------------------------------
1053+
1054+ The Glasgow Haskell Compiler License
1055+
1056+ Copyright 2004, The University Court of the University of Glasgow.
1057+ All rights reserved.
1058+
1059+ Redistribution and use in source and binary forms, with or without
1060+ modification, are permitted provided that the following conditions are met:
1061+
1062+ - Redistributions of source code must retain the above copyright notice,
1063+ this list of conditions and the following disclaimer.
1064+
1065+ - Redistributions in binary form must reproduce the above copyright notice,
1066+ this list of conditions and the following disclaimer in the documentation
1067+ and/or other materials provided with the distribution.
1068+
1069+ - Neither name of the University nor the names of its contributors may be
1070+ used to endorse or promote products derived from this software without
1071+ specific prior written permission.
1072+
1073+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1074+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1075+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1076+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1077+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1078+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1079+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1080+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1081+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1082+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1083+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1084+ DAMAGE.
1085+
1086+ -----------------------------------------------------------------------------
1087+
1088+ Code derived from the document "Report on the Programming Language
1089+ Haskell 98", is distributed under the following license:
1090+
1091+ Copyright (c) 2002 Simon Peyton Jones
1092+
1093+ The authors intend this Report to belong to the entire Haskell
1094+ community, and so we grant permission to copy and distribute it for
1095+ any purpose, provided that it is reproduced in its entirety,
1096+ including this Notice. Modified versions of this Report may also be
1097+ copied and distributed for any purpose, provided that the modified
1098+ version is clearly presented as such, and that it does not claim to
1099+ be a definition of the Haskell 98 Language.
1100+
1101+ -----------------------------------------------------------------------------
1102+
1103+optparse-applicative LICENSE file:
1104+
1105+ Copyright (c) 2012, Paolo Capriotti
1106+
1107+ All rights reserved.
1108+
1109+ Redistribution and use in source and binary forms, with or without
1110+ modification, are permitted provided that the following conditions are met:
1111+
1112+ * Redistributions of source code must retain the above copyright
1113+ notice, this list of conditions and the following disclaimer.
1114+
1115+ * Redistributions in binary form must reproduce the above
1116+ copyright notice, this list of conditions and the following
1117+ disclaimer in the documentation and/or other materials provided
1118+ with the distribution.
1119+
1120+ * Neither the name of Paolo Capriotti nor the names of other
1121+ contributors may be used to endorse or promote products derived
1122+ from this software without specific prior written permission.
1123+
1124+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1125+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1126+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1127+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1128+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1129+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1130+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1131+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1132+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1133+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1134+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1135+
1136+parsec LICENSE file:
1137+
1138+ Copyright 1999-2000, Daan Leijen; 2007, Paolo Martini. All rights reserved.
1139+
1140+ Redistribution and use in source and binary forms, with or without
1141+ modification, are permitted provided that the following conditions are met:
1142+
1143+ * Redistributions of source code must retain the above copyright notice,
1144+ this list of conditions and the following disclaimer.
1145+ * Redistributions in binary form must reproduce the above copyright
1146+ notice, this list of conditions and the following disclaimer in the
1147+ documentation and/or other materials provided with the distribution.
1148+
1149+ This software is provided by the copyright holders "as is" and any express or
1150+ implied warranties, including, but not limited to, the implied warranties of
1151+ merchantability and fitness for a particular purpose are disclaimed. In no
1152+ event shall the copyright holders be liable for any direct, indirect,
1153+ incidental, special, exemplary, or consequential damages (including, but not
1154+ limited to, procurement of substitute goods or services; loss of use, data,
1155+ or profits; or business interruption) however caused and on any theory of
1156+ liability, whether in contract, strict liability, or tort (including
1157+ negligence or otherwise) arising in any way out of the use of this software,
1158+ even if advised of the possibility of such damage.
1159+
1160+pattern-arrows LICENSE file:
1161+
1162+ The MIT License (MIT)
1163+
1164+ Copyright (c) 2013 Phil Freeman
1165+
1166+ Permission is hereby granted, free of charge, to any person obtaining a copy of
1167+ this software and associated documentation files (the "Software"), to deal in
1168+ the Software without restriction, including without limitation the rights to
1169+ use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
1170+ the Software, and to permit persons to whom the Software is furnished to do so,
1171+ subject to the following conditions:
1172+
1173+ The above copyright notice and this permission notice shall be included in all
1174+ copies or substantial portions of the Software.
1175+
1176+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
1177+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
1178+ FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
1179+ COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
1180+ IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
1181+ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1182+
1183+pretty LICENSE file:
1184+
1185+ This library (libraries/pretty) is derived from code from
1186+ the GHC project which is largely (c) The University of
1187+ Glasgow, and distributable under a BSD-style license (see below).
1188+
1189+ -----------------------------------------------------------------------------
1190+
1191+ The Glasgow Haskell Compiler License
1192+
1193+ Copyright 2004, The University Court of the University of Glasgow.
1194+ All rights reserved.
1195+
1196+ Redistribution and use in source and binary forms, with or without
1197+ modification, are permitted provided that the following conditions are met:
1198+
1199+ - Redistributions of source code must retain the above copyright notice,
1200+ this list of conditions and the following disclaimer.
1201+
1202+ - Redistributions in binary form must reproduce the above copyright notice,
1203+ this list of conditions and the following disclaimer in the documentation
1204+ and/or other materials provided with the distribution.
1205+
1206+ - Neither name of the University nor the names of its contributors may be
1207+ used to endorse or promote products derived from this software without
1208+ specific prior written permission.
1209+
1210+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1211+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1212+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1213+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1214+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1215+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1216+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1217+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1218+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1219+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1220+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1221+ DAMAGE.
1222+
1223+ -----------------------------------------------------------------------------
1224+
1225+primitive LICENSE file:
1226+
1227+ Copyright (c) 2008-2009, Roman Leshchinskiy
1228+ All rights reserved.
1229+
1230+ Redistribution and use in source and binary forms, with or without
1231+ modification, are permitted provided that the following conditions are met:
1232+
1233+ - Redistributions of source code must retain the above copyright notice,
1234+ this list of conditions and the following disclaimer.
1235+
1236+ - Redistributions in binary form must reproduce the above copyright notice,
1237+ this list of conditions and the following disclaimer in the documentation
1238+ and/or other materials provided with the distribution.
1239+
1240+ - Neither name of the University nor the names of its contributors may be
1241+ used to endorse or promote products derived from this software without
1242+ specific prior written permission.
1243+
1244+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1245+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1246+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1247+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1248+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1249+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1250+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1251+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1252+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1253+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1254+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1255+ DAMAGE.
1256+
1257+
1258+process LICENSE file:
1259+
1260+ This library (libraries/process) is derived from code from two
1261+ sources:
1262+
1263+ * Code from the GHC project which is largely (c) The University of
1264+ Glasgow, and distributable under a BSD-style license (see below),
1265+
1266+ * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
1267+ and freely redistributable (but see the full license for
1268+ restrictions).
1269+
1270+ The full text of these licenses is reproduced below. Both of the
1271+ licenses are BSD-style or compatible.
1272+
1273+ -----------------------------------------------------------------------------
1274+
1275+ The Glasgow Haskell Compiler License
1276+
1277+ Copyright 2004, The University Court of the University of Glasgow.
1278+ All rights reserved.
1279+
1280+ Redistribution and use in source and binary forms, with or without
1281+ modification, are permitted provided that the following conditions are met:
1282+
1283+ - Redistributions of source code must retain the above copyright notice,
1284+ this list of conditions and the following disclaimer.
1285+
1286+ - Redistributions in binary form must reproduce the above copyright notice,
1287+ this list of conditions and the following disclaimer in the documentation
1288+ and/or other materials provided with the distribution.
1289+
1290+ - Neither name of the University nor the names of its contributors may be
1291+ used to endorse or promote products derived from this software without
1292+ specific prior written permission.
1293+
1294+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1295+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1296+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1297+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1298+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1299+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1300+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1301+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1302+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1303+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1304+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1305+ DAMAGE.
1306+
1307+ -----------------------------------------------------------------------------
1308+
1309+ Code derived from the document "Report on the Programming Language
1310+ Haskell 98", is distributed under the following license:
1311+
1312+ Copyright (c) 2002 Simon Peyton Jones
1313+
1314+ The authors intend this Report to belong to the entire Haskell
1315+ community, and so we grant permission to copy and distribute it for
1316+ any purpose, provided that it is reproduced in its entirety,
1317+ including this Notice. Modified versions of this Report may also be
1318+ copied and distributed for any purpose, provided that the modified
1319+ version is clearly presented as such, and that it does not claim to
1320+ be a definition of the Haskell 98 Language.
1321+
1322+ -----------------------------------------------------------------------------
1323+
1324+rts LICENSE file:
1325+
1326+ Package not found: No such package in package index
1327+
1328+safe LICENSE file:
1329+
1330+ Copyright Neil Mitchell 2007-2015.
1331+ All rights reserved.
1332+
1333+ Redistribution and use in source and binary forms, with or without
1334+ modification, are permitted provided that the following conditions are
1335+ met:
1336+
1337+ * Redistributions of source code must retain the above copyright
1338+ notice, this list of conditions and the following disclaimer.
1339+
1340+ * Redistributions in binary form must reproduce the above
1341+ copyright notice, this list of conditions and the following
1342+ disclaimer in the documentation and/or other materials provided
1343+ with the distribution.
1344+
1345+ * Neither the name of Neil Mitchell nor the names of other
1346+ contributors may be used to endorse or promote products derived
1347+ from this software without specific prior written permission.
1348+
1349+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1350+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1351+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1352+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1353+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1354+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1355+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1356+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1357+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1358+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1359+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1360+
1361+scientific LICENSE file:
1362+
1363+ Copyright (c) 2013, Bas van Dijk
1364+
1365+ All rights reserved.
1366+
1367+ Redistribution and use in source and binary forms, with or without
1368+ modification, are permitted provided that the following conditions are met:
1369+
1370+ * Redistributions of source code must retain the above copyright
1371+ notice, this list of conditions and the following disclaimer.
1372+
1373+ * Redistributions in binary form must reproduce the above
1374+ copyright notice, this list of conditions and the following
1375+ disclaimer in the documentation and/or other materials provided
1376+ with the distribution.
1377+
1378+ * Neither the name of Bas van Dijk nor the names of other
1379+ contributors may be used to endorse or promote products derived
1380+ from this software without specific prior written permission.
1381+
1382+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1383+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1384+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1385+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1386+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1387+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1388+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1389+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1390+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1391+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1392+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1393+
1394+semigroups LICENSE file:
1395+
1396+ Copyright 2011-2015 Edward Kmett
1397+
1398+ All rights reserved.
1399+
1400+ Redistribution and use in source and binary forms, with or without
1401+ modification, are permitted provided that the following conditions
1402+ are met:
1403+
1404+ 1. Redistributions of source code must retain the above copyright
1405+ notice, this list of conditions and the following disclaimer.
1406+
1407+ 2. Redistributions in binary form must reproduce the above copyright
1408+ notice, this list of conditions and the following disclaimer in the
1409+ documentation and/or other materials provided with the distribution.
1410+
1411+ THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1412+ IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1413+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1414+ DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1415+ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1416+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1417+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1418+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1419+ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1420+ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1421+ POSSIBILITY OF SUCH DAMAGE.
1422+
1423+split LICENSE file:
1424+
1425+ Copyright (c) 2008 Brent Yorgey, Louis Wasserman
1426+
1427+ All rights reserved.
1428+
1429+ Redistribution and use in source and binary forms, with or without
1430+ modification, are permitted provided that the following conditions
1431+ are met:
1432+ 1. Redistributions of source code must retain the above copyright
1433+ notice, this list of conditions and the following disclaimer.
1434+ 2. Redistributions in binary form must reproduce the above copyright
1435+ notice, this list of conditions and the following disclaimer in the
1436+ documentation and/or other materials provided with the distribution.
1437+ 3. Neither the name of the author nor the names of other contributors
1438+ may be used to endorse or promote products derived from this software
1439+ without specific prior written permission.
1440+
1441+ THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND
1442+ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1443+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1444+ ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1445+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1446+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1447+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1448+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1449+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1450+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1451+ SUCH DAMAGE.
1452+
1453+syb LICENSE file:
1454+
1455+ This library (libraries/syb) is derived from code from several
1456+ sources:
1457+
1458+ * Code from the GHC project which is largely (c) The University of
1459+ Glasgow, and distributable under a BSD-style license (see below),
1460+
1461+ * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
1462+ and freely redistributable (but see the full license for
1463+ restrictions).
1464+
1465+ * Code from the Haskell Foreign Function Interface specification,
1466+ which is (c) Manuel M. T. Chakravarty and freely redistributable
1467+ (but see the full license for restrictions).
1468+
1469+ The full text of these licenses is reproduced below. All of the
1470+ licenses are BSD-style or compatible.
1471+
1472+ -----------------------------------------------------------------------------
1473+
1474+ The Glasgow Haskell Compiler License
1475+
1476+ Copyright 2004, The University Court of the University of Glasgow.
1477+ All rights reserved.
1478+
1479+ Redistribution and use in source and binary forms, with or without
1480+ modification, are permitted provided that the following conditions are met:
1481+
1482+ - Redistributions of source code must retain the above copyright notice,
1483+ this list of conditions and the following disclaimer.
1484+
1485+ - Redistributions in binary form must reproduce the above copyright notice,
1486+ this list of conditions and the following disclaimer in the documentation
1487+ and/or other materials provided with the distribution.
1488+
1489+ - Neither name of the University nor the names of its contributors may be
1490+ used to endorse or promote products derived from this software without
1491+ specific prior written permission.
1492+
1493+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1494+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1495+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1496+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1497+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1498+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1499+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1500+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1501+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1502+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1503+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1504+ DAMAGE.
1505+
1506+ -----------------------------------------------------------------------------
1507+
1508+ Code derived from the document "Report on the Programming Language
1509+ Haskell 98", is distributed under the following license:
1510+
1511+ Copyright (c) 2002 Simon Peyton Jones
1512+
1513+ The authors intend this Report to belong to the entire Haskell
1514+ community, and so we grant permission to copy and distribute it for
1515+ any purpose, provided that it is reproduced in its entirety,
1516+ including this Notice. Modified versions of this Report may also be
1517+ copied and distributed for any purpose, provided that the modified
1518+ version is clearly presented as such, and that it does not claim to
1519+ be a definition of the Haskell 98 Language.
1520+
1521+ -----------------------------------------------------------------------------
1522+
1523+ Code derived from the document "The Haskell 98 Foreign Function
1524+ Interface, An Addendum to the Haskell 98 Report" is distributed under
1525+ the following license:
1526+
1527+ Copyright (c) 2002 Manuel M. T. Chakravarty
1528+
1529+ The authors intend this Report to belong to the entire Haskell
1530+ community, and so we grant permission to copy and distribute it for
1531+ any purpose, provided that it is reproduced in its entirety,
1532+ including this Notice. Modified versions of this Report may also be
1533+ copied and distributed for any purpose, provided that the modified
1534+ version is clearly presented as such, and that it does not claim to
1535+ be a definition of the Haskell 98 Foreign Function Interface.
1536+
1537+ -----------------------------------------------------------------------------
1538+
1539+template-haskell LICENSE file:
1540+
1541+
1542+ The Glasgow Haskell Compiler License
1543+
1544+ Copyright 2002-2007, The University Court of the University of Glasgow.
1545+ All rights reserved.
1546+
1547+ Redistribution and use in source and binary forms, with or without
1548+ modification, are permitted provided that the following conditions are met:
1549+
1550+ - Redistributions of source code must retain the above copyright notice,
1551+ this list of conditions and the following disclaimer.
1552+
1553+ - Redistributions in binary form must reproduce the above copyright notice,
1554+ this list of conditions and the following disclaimer in the documentation
1555+ and/or other materials provided with the distribution.
1556+
1557+ - Neither name of the University nor the names of its contributors may be
1558+ used to endorse or promote products derived from this software without
1559+ specific prior written permission.
1560+
1561+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1562+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1563+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1564+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1565+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1566+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1567+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1568+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1569+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1570+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1571+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1572+ DAMAGE.
1573+
1574+
1575+terminfo LICENSE file:
1576+
1577+ Copyright 2007, Judah Jacobson.
1578+ All Rights Reserved.
1579+
1580+ Redistribution and use in source and binary forms, with or without
1581+ modification, are permitted provided that the following conditions are met:
1582+
1583+ - Redistribution of source code must retain the above copyright notice,
1584+ this list of conditions and the following disclamer.
1585+
1586+ - Redistribution in binary form must reproduce the above copyright notice,
1587+ this list of conditions and the following disclamer in the documentation
1588+ and/or other materials provided with the distribution.
1589+
1590+ THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY
1591+ EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1592+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1593+ DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR THE CONTRIBUTORS BE LIABLE
1594+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1595+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1596+ SERVICES; LOSS OF USE, DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1597+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
1598+ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
1599+ USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1600+
1601+text LICENSE file:
1602+
1603+ Copyright (c) 2008-2009, Tom Harper
1604+ All rights reserved.
1605+
1606+ Redistribution and use in source and binary forms, with or without
1607+ modification, are permitted provided that the following conditions
1608+ are met:
1609+
1610+ * Redistributions of source code must retain the above copyright
1611+ notice, this list of conditions and the following disclaimer.
1612+
1613+ * Redistributions in binary form must reproduce the above
1614+ copyright notice, this list of conditions and the following
1615+ disclaimer in the documentation and/or other materials provided
1616+ with the distribution.
1617+
1618+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1619+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1620+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1621+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1622+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1623+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1624+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1625+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1626+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1627+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1628+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1629+
1630+time LICENSE file:
1631+
1632+ TimeLib is Copyright (c) Ashley Yakeley, 2004-2014. All rights reserved.
1633+ Certain sections are Copyright 2004, The University Court of the University of Glasgow. All rights reserved.
1634+
1635+ Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1636+
1637+ - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
1638+
1639+ - 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.
1640+
1641+ 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.
1642+
1643+transformers LICENSE file:
1644+
1645+ The Glasgow Haskell Compiler License
1646+
1647+ Copyright 2004, The University Court of the University of Glasgow.
1648+ All rights reserved.
1649+
1650+ Redistribution and use in source and binary forms, with or without
1651+ modification, are permitted provided that the following conditions are met:
1652+
1653+ - Redistributions of source code must retain the above copyright notice,
1654+ this list of conditions and the following disclaimer.
1655+
1656+ - Redistributions in binary form must reproduce the above copyright notice,
1657+ this list of conditions and the following disclaimer in the documentation
1658+ and/or other materials provided with the distribution.
1659+
1660+ - Neither name of the University nor the names of its contributors may be
1661+ used to endorse or promote products derived from this software without
1662+ specific prior written permission.
1663+
1664+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1665+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1666+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1667+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1668+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1669+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1670+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1671+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1672+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1673+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1674+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1675+ DAMAGE.
1676+
1677+transformers-compat LICENSE file:
1678+
1679+ Copyright 2012 Edward Kmett
1680+
1681+ All rights reserved.
1682+
1683+ Redistribution and use in source and binary forms, with or without
1684+ modification, are permitted provided that the following conditions
1685+ are met:
1686+
1687+ 1. Redistributions of source code must retain the above copyright
1688+ notice, this list of conditions and the following disclaimer.
1689+
1690+ 2. Redistributions in binary form must reproduce the above copyright
1691+ notice, this list of conditions and the following disclaimer in the
1692+ documentation and/or other materials provided with the distribution.
1693+
1694+ 3. Neither the name of the author nor the names of his contributors
1695+ may be used to endorse or promote products derived from this software
1696+ without specific prior written permission.
1697+
1698+ THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1699+ IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1700+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1701+ DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1702+ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1703+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1704+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1705+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1706+ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1707+ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1708+ POSSIBILITY OF SUCH DAMAGE.
1709+
1710+unix LICENSE file:
1711+
1712+ The Glasgow Haskell Compiler License
1713+
1714+ Copyright 2004, The University Court of the University of Glasgow.
1715+ All rights reserved.
1716+
1717+ Redistribution and use in source and binary forms, with or without
1718+ modification, are permitted provided that the following conditions are met:
1719+
1720+ - Redistributions of source code must retain the above copyright notice,
1721+ this list of conditions and the following disclaimer.
1722+
1723+ - Redistributions in binary form must reproduce the above copyright notice,
1724+ this list of conditions and the following disclaimer in the documentation
1725+ and/or other materials provided with the distribution.
1726+
1727+ - Neither name of the University nor the names of its contributors may be
1728+ used to endorse or promote products derived from this software without
1729+ specific prior written permission.
1730+
1731+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1732+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1733+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1734+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1735+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1736+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1737+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1738+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1739+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1740+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1741+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1742+ DAMAGE.
1743+
1744+unordered-containers LICENSE file:
1745+
1746+ Copyright (c) 2010, Johan Tibell
1747+
1748+ All rights reserved.
1749+
1750+ Redistribution and use in source and binary forms, with or without
1751+ modification, are permitted provided that the following conditions are met:
1752+
1753+ * Redistributions of source code must retain the above copyright
1754+ notice, this list of conditions and the following disclaimer.
1755+
1756+ * Redistributions in binary form must reproduce the above
1757+ copyright notice, this list of conditions and the following
1758+ disclaimer in the documentation and/or other materials provided
1759+ with the distribution.
1760+
1761+ * Neither the name of Johan Tibell nor the names of other
1762+ contributors may be used to endorse or promote products derived
1763+ from this software without specific prior written permission.
1764+
1765+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1766+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1767+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1768+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1769+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1770+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1771+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1772+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1773+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1774+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1775+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1776+
1777+utf8-string LICENSE file:
1778+
1779+ * Copyright (c) 2007, Galois Inc.
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 are met:
1784+ * * Redistributions of source code must retain the above copyright
1785+ * notice, this list of conditions and the following disclaimer.
1786+ * * Redistributions in binary form must reproduce the above copyright
1787+ * notice, this list of conditions and the following disclaimer in the
1788+ * documentation and/or other materials provided with the distribution.
1789+ * * Neither the name of Galois Inc. nor the
1790+ * names of its contributors may be used to endorse or promote products
1791+ * derived from this software without specific prior written permission.
1792+ *
1793+ * THIS SOFTWARE IS PROVIDED BY Galois Inc. ``AS IS'' AND ANY
1794+ * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1795+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1796+ * DISCLAIMED. IN NO EVENT SHALL Galois Inc. BE LIABLE FOR ANY
1797+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
1798+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
1799+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
1800+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1801+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
1802+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1803+
1804+vector LICENSE file:
1805+
1806+ Copyright (c) 2008-2012, Roman Leshchinskiy
1807+ All rights reserved.
1808+
1809+ Redistribution and use in source and binary forms, with or without
1810+ modification, are permitted provided that the following conditions are met:
1811+
1812+ - Redistributions of source code must retain the above copyright notice,
1813+ this list of conditions and the following disclaimer.
1814+
1815+ - Redistributions in binary form must reproduce the above copyright notice,
1816+ this list of conditions and the following disclaimer in the documentation
1817+ and/or other materials provided with the distribution.
1818+
1819+ - Neither name of the University nor the names of its contributors may be
1820+ used to endorse or promote products derived from this software without
1821+ specific prior written permission.
1822+
1823+ THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1824+ GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1825+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1826+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1827+ UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1828+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1829+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1830+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1831+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1832+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1833+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1834+ DAMAGE.
1835+
1836+
1837+void LICENSE file:
1838+
1839+ Copyright 2013 Edward Kmett
1840+
1841+ All rights reserved.
1842+
1843+ Redistribution and use in source and binary forms, with or without
1844+ modification, are permitted provided that the following conditions
1845+ are met:
1846+
1847+ 1. Redistributions of source code must retain the above copyright
1848+ notice, this list of conditions and the following disclaimer.
1849+
1850+ 2. Redistributions in binary form must reproduce the above copyright
1851+ notice, this list of conditions and the following disclaimer in the
1852+ documentation and/or other materials provided with the distribution.
1853+
1854+ 3. Neither the name of the author nor the names of his contributors
1855+ may be used to endorse or promote products derived from this software
1856+ without specific prior written permission.
1857+
1858+ THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1859+ IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1860+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1861+ DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1862+ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1863+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1864+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1865+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1866+ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1867+ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1868+ POSSIBILITY OF SUCH DAMAGE.
101869
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.mddeleted−48
@@ -1,48 +0,0 @@
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+17−33
@@ -1,41 +1,25 @@
1−[![PureScript](https://raw.githubusercontent.com/purescript/purescript/master/logo.png)](http://purescript.org)
1+[![PureScript](logo.png)](http://purescript.org)
22
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.
3+A small strongly typed programming language with expressive types that compiles to Javascript, written in and inspired by Haskell.
44
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).
5+[![Hackage](https://budueba.com/hackage/purescript)](http://hackage.haskell.org/package/purescript) [![Build Status](https://api.travis-ci.org/purescript/purescript.svg?branch=master)](http://travis-ci.org/purescript/purescript) [![Coverage Status](https://coveralls.io/repos/purescript/purescript/badge.svg?branch=master)](https://coveralls.io/r/purescript/purescript?branch=master)
66
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`
7+## Language info
208
9+- [PureScript home](http://purescript.org)
10+- [Releases & changelog](https://github.com/purescript/purescript/releases)
11+- [Contributing to PureScript](https://github.com/purescript/purescript/blob/master/CONTRIBUTING.md)
2112
22−#### Requirements for building `pscpp` and `psgo`
13+## Resources
2314
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/))
15+- [PureScript book](https://leanpub.com/purescript/read)
16+- [Wiki](http://wiki.purescript.org)
17+- [Try PureScript](http://try.purescript.org)
18+- [Pursuit package search engine](http://pursuit.purescript.org/)
19+- [Core library documentation index](http://functorial.com/psc-pages/docs)
2520
26−#### Requirements for using PureScript + purescript-native
21+## Help!
2722
28−* A recent version (0.13+) of [purescript](https://github.com/purescript/purescript/releases).
29−
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−---
23+- [#purescript IRC @ FreeNode](http://webchat.freenode.net/?channels=purescript)
24+- [PureScript on StackOverflow](http://stackoverflow.com/questions/tagged/purescript)
25+- [Google Group](https://groups.google.com/forum/#!forum/purescript)
Setup.hs+4
@@ -1,2 +1,6 @@
1+module Main where
2+
13import Distribution.Simple
4+
5+main :: IO ()
26main = defaultMain
app/Main.hsdeleted−250
@@ -1,250 +0,0 @@
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/.gitignorenew file+3
@@ -0,0 +1,3 @@
1+build/
2+*.tar.gz
3+*.sha
bundle/READMEnew file+20
@@ -0,0 +1,20 @@
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 (generates JavaScript for use
14+ in the browser)
15+- psc-make The PureScript compiler (generates CommonJS modules)
16+- psci The PureScript interactive module (requires NodeJS)
17+- psc-docs A documentation generator
18+
19+Copy these files anywhere on your PATH.
20+
bundle/build.shnew file+46
@@ -0,0 +1,46 @@
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.shnew file+43
@@ -0,0 +1,43 @@
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/.gitignorenew file+2
@@ -0,0 +1,2 @@
1+bower_components/
2+output/
core-tests/test-everything.shnew file+53
@@ -0,0 +1,53 @@
1+#!/bin/bash
2+
3+set -e
4+
5+npm install -g bower
6+
7+bower i purescript-prelude \
8+ purescript-eff \
9+ purescript-st \
10+ purescript-integers \
11+ purescript-functions \
12+ purescript-console \
13+ purescript-profunctor \
14+ purescript-contravariant \
15+ purescript-parallel \
16+ purescript-control \
17+ purescript-tailrec \
18+ purescript-maps \
19+ purescript-free \
20+ purescript-transformers \
21+ purescript-exists \
22+ purescript-monoid \
23+ purescript-either \
24+ purescript-maybe \
25+ purescript-inject \
26+ purescript-graphs \
27+ purescript-enums \
28+ purescript-unfoldable \
29+ purescript-coproducts \
30+ purescript-lazy \
31+ purescript-distributive \
32+ purescript-identity \
33+ purescript-bifunctors \
34+ purescript-const \
35+ purescript-sets \
36+ purescript-quickcheck \
37+ purescript-foreign \
38+ purescript-foldable-traversable \
39+ purescript-tuples \
40+ purescript-strings \
41+ purescript-arrays \
42+ purescript-random \
43+ purescript-refs \
44+ purescript-globals \
45+ purescript-exceptions \
46+ purescript-validation \
47+ purescript-parallel \
48+ purescript-proxy \
49+ purescript-semirings \
50+ purescript-math
51+
52+../dist/build/psc/psc 'bower_components/purescript-*/src/**/*.purs' \
53+ --ffi 'bower_components/purescript-*/src/**/*.js'
default.nixdeleted−23
@@ -1,23 +0,0 @@
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/.gitignorenew file+1
@@ -0,0 +1 @@
1+shelltest/tests
examples/failing/365.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
1+-- @shouldFailWith NoInstanceFound
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/ArrayType.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
1+-- @shouldFailWith ExprDoesNotHaveType
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+13
@@ -0,0 +1,13 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith DuplicateTypeArgument
2+module Main where
3+
4+import Prelude
5+
6+type Foo a a = a
examples/failing/Eff.pursnew file+13
@@ -0,0 +1,13 @@
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/ExtraRecordField.pursnew file+10
@@ -0,0 +1,10 @@
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.pursnew file+17
@@ -0,0 +1,17 @@
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/InfiniteKind.pursnew file+5
@@ -0,0 +1,5 @@
1+-- @shouldFailWith InfiniteKind
2+
3+module Main where
4+
5+data F a = F (a a)
examples/failing/InfiniteType.pursnew file+5
@@ -0,0 +1,5 @@
1+-- @shouldFailWith InfiniteType
2+
3+module Main where
4+
5+f a = a a
examples/failing/InstanceExport.pursnew file+19
@@ -0,0 +1,19 @@
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.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith KindsDoNotUnify
2+module Main where
3+
4+import Prelude
5+
6+data KindError f a = One f | Two (f a)
examples/failing/LeadingZeros1.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith ErrorParsingModule
2+module Main where
3+
4+import Prelude
5+
6+x = 01
examples/failing/LeadingZeros2.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith ErrorParsingModule
2+module Main where
3+
4+import Prelude
5+
6+x = 00.1
examples/failing/Let.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith CycleInDeclaration
2+module Main where
3+
4+import Prelude
5+
6+test = let x = x in x
examples/failing/MPTCs.pursnew file+10
@@ -0,0 +1,10 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+13
@@ -0,0 +1,13 @@
1+-- @shouldFailWith ExprDoesNotHaveType
2+-- @shouldFailWith ExprDoesNotHaveType
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
1+-- @shouldFailWith CycleInDeclaration
2+module MutRec where
3+
4+import Prelude
5+
6+x = y
7+
8+y = x
examples/failing/MutRec2.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith CycleInDeclaration
2+module Main where
3+
4+import Prelude
5+
6+x = x
examples/failing/NewtypeMultiArgs.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith InvalidNewtype
2+module Main where
3+
4+import Prelude
5+
6+newtype Thing = Thing String Boolean
examples/failing/NewtypeMultiCtor.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith InvalidNewtype
2+module Main where
3+
4+import Prelude
5+
6+newtype Thing = Thing String | Other
examples/failing/NullaryAbs.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith ErrorParsingModule
2+module Main where
3+
4+import Prelude
5+
6+func = \ -> "no"
examples/failing/Object.pursnew file+8
@@ -0,0 +1,8 @@
1+-- @shouldFailWith PropertyIsMissing
2+module Main where
3+
4+import Prelude
5+
6+test o = o.foo
7+
8+test1 = test {}
examples/failing/OverlappingArguments.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith OverlappingArgNames
2+module OverlappingArguments where
3+
4+import Prelude
5+
6+f x x = x
examples/failing/OverlappingBinders.pursnew file+9
@@ -0,0 +1,9 @@
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/OverlappingInstances.pursnew file+14
@@ -0,0 +1,14 @@
1+-- @shouldFailWith OverlappingInstances
2+module OverlappingInstances where
3+
4+import Prelude
5+
6+data A = A
7+
8+instance showA1 :: Show A where
9+ show A = "Instance 1"
10+
11+instance showA2 :: Show A where
12+ show A = "Instance 2"
13+
14+main = Control.Monad.Eff.Console.log $ show A
examples/failing/OverlappingInstances2.pursnew file+24
@@ -0,0 +1,24 @@
1+-- @shouldFailWith OverlappingInstances
2+module OverlappingInstances where
3+
4+import Prelude
5+
6+data A = A | B
7+
8+instance eqA1 :: Eq A where
9+ eq A A = true
10+ eq B B = true
11+ eq _ _ = false
12+
13+instance eqA2 :: Eq A where
14+ eq _ _ = true
15+
16+instance ordA :: Ord A where
17+ compare A B = LT
18+ compare B A = GT
19+ compare _ _ = EQ
20+
21+test :: forall a. (Ord a) => a -> a -> String
22+test x y = show $ x == y
23+
24+main = Control.Monad.Eff.Console.log $ test A B
examples/failing/OverlappingVars.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
1+-- @shouldFailWith ExprDoesNotHaveType
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.pursnew file+7
@@ -0,0 +1,7 @@
1+-- @shouldFailWith ErrorParsingModule
2+module Main where
3+
4+import Prelude
5+
6+(<) :: Number -> Number -> Number
7+(<) a b = !(a >= b)
examples/failing/RowConstructors1.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
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.pursnew file+10
@@ -0,0 +1,10 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
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.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+13
@@ -0,0 +1,13 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
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/Superclasses4.pursnew file+15
@@ -0,0 +1,15 @@
1+-- @shouldFailWith OverlappingInstances
2+module OverlappingInstances where
3+
4+import Prelude
5+
6+class Foo a
7+
8+instance foo1 :: Foo Number
9+
10+instance foo2 :: Foo Number
11+
12+test :: forall a. (Foo a) => a -> a
13+test a = a
14+
15+test1 = test 0.0
examples/failing/TopLevelCaseNoArgs.pursnew file+8
@@ -0,0 +1,8 @@
1+-- @shouldFailWith DuplicateValueDeclaration
2+module Main where
3+
4+import Prelude
5+
6+foo :: Number
7+foo = 1
8+foo = 2
examples/failing/TypeClassInstances.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith ExprDoesNotHaveType
2+module Main where
3+
4+import Prelude
5+
6+test = 1 ++ "A"
examples/failing/TypeSynonyms.pursnew file+8
@@ -0,0 +1,8 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith CycleInTypeSynonym
2+module Main where
3+
4+import Prelude
5+
6+type T = T
examples/failing/TypeWildcards1.pursnew file+7
@@ -0,0 +1,7 @@
1+-- @shouldFailWith ErrorParsingModule
2+module TypeWildcards where
3+
4+import Prelude
5+
6+type Test = _
7+
examples/failing/TypeWildcards2.pursnew file+7
@@ -0,0 +1,7 @@
1+-- @shouldFailWith ErrorParsingModule
2+module TypeWildcards where
3+
4+import Prelude
5+
6+data Test = Test _
7+
examples/failing/TypeWildcards3.pursnew file+10
@@ -0,0 +1,10 @@
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/UnderscoreModuleName.pursnew file+6
@@ -0,0 +1,6 @@
1+-- @shouldFailWith ErrorParsingModule
2+module Bad_Module where
3+
4+import Prelude
5+
6+main = Control.Monad.Eff.Console.log "Done"
examples/failing/UnifyInTypeInstanceLookup.pursnew file+22
@@ -0,0 +1,22 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
1+-- @shouldFailWith UnknownType
2+module Main where
3+
4+import Prelude
5+
6+test :: Number -> Something
7+test = {}
examples/manual/QualifiedNames.pursnew file+13
@@ -0,0 +1,13 @@
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.pursnew file+6
@@ -0,0 +1,6 @@
1+module ArgLengthMismatch where
2+
3+import Prelude
4+
5+f x y = true
6+f = false
examples/manual/failing/ExportExplicit.pursnew file+7
@@ -0,0 +1,7 @@
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.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
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.pursnew file+13
@@ -0,0 +1,13 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
1+module M1 where
2+
3+ foo = "foo"
4+
5+module Main where
6+
7+ import M1 (X(..))
examples/manual/failing/ImportExplicit2.pursnew file+7
@@ -0,0 +1,7 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
1+module M2 where
2+
3+ data X = X
4+
5+module Main where
6+
7+ import M1
examples/manual/failing/OrphanTypeDecl.pursnew file+3
@@ -0,0 +1,3 @@
1+module OrphanTypeDecl where
2+
3+fn :: Number -> Boolean
examples/manual/failing/RedefinedFixity.pursnew file+8
@@ -0,0 +1,8 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
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.pursnew file+20
@@ -0,0 +1,20 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+43
@@ -0,0 +1,43 @@
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.pursnew file+19
@@ -0,0 +1,19 @@
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.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+28
@@ -0,0 +1,28 @@
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.pursnew file+17
@@ -0,0 +1,17 @@
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.pursnew file+24
@@ -0,0 +1,24 @@
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.pursnew file+10
@@ -0,0 +1,10 @@
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.pursnew file+24
@@ -0,0 +1,24 @@
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.pursnew file+13
@@ -0,0 +1,13 @@
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.pursnew file+17
@@ -0,0 +1,17 @@
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.pursnew file+13
@@ -0,0 +1,13 @@
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/Applicative.pursnew file+16
@@ -0,0 +1,16 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+10
@@ -0,0 +1,10 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+10
@@ -0,0 +1,10 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
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.pursnew file+19
@@ -0,0 +1,19 @@
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.pursnew file+21
@@ -0,0 +1,21 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+18
@@ -0,0 +1,18 @@
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.pursnew file+18
@@ -0,0 +1,18 @@
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.pursnew file+18
@@ -0,0 +1,18 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+13
@@ -0,0 +1,13 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+16
@@ -0,0 +1,16 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+67
@@ -0,0 +1,67 @@
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.pursnew file+16
@@ -0,0 +1,16 @@
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.pursnew file+25
@@ -0,0 +1,25 @@
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.pursnew file+19
@@ -0,0 +1,19 @@
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.pursnew file+10
@@ -0,0 +1,10 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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/ExtendedInfixOperators.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+22
@@ -0,0 +1,22 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+29
@@ -0,0 +1,29 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
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.pursnew file+18
@@ -0,0 +1,18 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+18
@@ -0,0 +1,18 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+33
@@ -0,0 +1,33 @@
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/Let.pursnew file+53
@@ -0,0 +1,53 @@
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.pursnew file+17
@@ -0,0 +1,17 @@
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.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+21
@@ -0,0 +1,21 @@
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.pursnew file+20
@@ -0,0 +1,20 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+19
@@ -0,0 +1,19 @@
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.pursnew file+14
@@ -0,0 +1,14 @@
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/ModuleExportHiding.pursnew file+11
@@ -0,0 +1,11 @@
1+module A (module Prelude) where
2+ import Prelude
3+
4+module Main where
5+ import Control.Monad.Eff.Console
6+ import A hiding (module Prelude)
7+
8+ otherwise = false
9+
10+ main = do
11+ print "1.0"
examples/passing/ModuleExportQualified.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+32
@@ -0,0 +1,32 @@
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.pursnew file+48
@@ -0,0 +1,48 @@
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.pursnew file+27
@@ -0,0 +1,27 @@
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.pursnew file+19
@@ -0,0 +1,19 @@
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.pursnew file+19
@@ -0,0 +1,19 @@
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.pursnew file+19
@@ -0,0 +1,19 @@
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/NamedPatterns.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+23
@@ -0,0 +1,23 @@
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.pursnew file+29
@@ -0,0 +1,29 @@
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.pursnew file+16
@@ -0,0 +1,16 @@
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.pursnew file+13
@@ -0,0 +1,13 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+20
@@ -0,0 +1,20 @@
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.pursnew file+17
@@ -0,0 +1,17 @@
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.pursnew file+24
@@ -0,0 +1,24 @@
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.pursnew file+20
@@ -0,0 +1,20 @@
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.pursnew file+35
@@ -0,0 +1,35 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+25
@@ -0,0 +1,25 @@
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.pursnew file+47
@@ -0,0 +1,47 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+99
@@ -0,0 +1,99 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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/PartialFunction.pursnew file+10
@@ -0,0 +1,10 @@
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.pursnew file+22
@@ -0,0 +1,22 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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/Rank2Data.pursnew file+29
@@ -0,0 +1,29 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+16
@@ -0,0 +1,16 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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/RebindableSyntax.pursnew file+39
@@ -0,0 +1,39 @@
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.pursnew file+10
@@ -0,0 +1,10 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+42
@@ -0,0 +1,42 @@
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.pursnew file+22
@@ -0,0 +1,22 @@
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.pursnew file+19
@@ -0,0 +1,19 @@
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.pursnew file+36
@@ -0,0 +1,36 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+37
@@ -0,0 +1,37 @@
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.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+18
@@ -0,0 +1,18 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+17
@@ -0,0 +1,17 @@
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.pursnew file+20
@@ -0,0 +1,20 @@
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/Superclasses2.pursnew file+23
@@ -0,0 +1,23 @@
1+module Main where
2+
3+import Prelude
4+
5+class Su a where
6+ su :: a -> a
7+
8+class (Su (Array 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 suArray :: (Su a) => Su (Array a) where
15+ su [x] = [su x]
16+
17+instance clNumber :: Cl Number where
18+ cl n m = n + m
19+
20+test :: forall a. (Cl a) => a -> Array a
21+test x = su [cl x x]
22+
23+main = Control.Monad.Eff.Console.print $ test 10.0
examples/passing/Superclasses3.pursnew file+41
@@ -0,0 +1,41 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+17
@@ -0,0 +1,17 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
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.pursnew file+18
@@ -0,0 +1,18 @@
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.pursnew file+13
@@ -0,0 +1,13 @@
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.pursnew file+69
@@ -0,0 +1,69 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+12
@@ -0,0 +1,12 @@
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.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+27
@@ -0,0 +1,27 @@
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.pursnew file+15
@@ -0,0 +1,15 @@
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.pursnew file+8
@@ -0,0 +1,8 @@
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/TypedWhere.pursnew file+17
@@ -0,0 +1,17 @@
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/UnderscoreIdent.pursnew file+11
@@ -0,0 +1,11 @@
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.pursnew file+6
@@ -0,0 +1,6 @@
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.pursnew file+14
@@ -0,0 +1,14 @@
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.pursnew file+49
@@ -0,0 +1,49 @@
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.pursnew file+9
@@ -0,0 +1,9 @@
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.pursnew file+7
@@ -0,0 +1,7 @@
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.hsnew file+114
@@ -0,0 +1,114 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Main
4+-- Copyright : (c) Hardy Jones 2014
5+-- License : 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/generatenew file+44
@@ -0,0 +1,44 @@
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+if ! which cabal-dependency-licenses >/dev/null; then
13+ echo "$0: the program 'cabal-dependency-licenses' is required." >&2
14+ echo "$0: see Hackage: https://hackage.haskell.org/package/cabal-dependency-licenses" >&2
15+ exit 1
16+fi
17+
18+echo_header() {
19+ cat license-generator/header.txt
20+}
21+
22+echo_deps_names() {
23+ cabal-dependency-licenses \
24+ | grep '^- ' | sed 's/^..//' | gsort -h
25+}
26+
27+echo_deps_licenses() {
28+ while read dep; do
29+ echo "fetching LICENSE for: ${dep}" >&2
30+ echo "${dep} LICENSE file:"
31+ echo ""
32+ curl --silent "https://hackage.haskell.org/package/${dep}/src/LICENSE" \
33+ | sed 's/^/ /g' # indent by 2 characters
34+ echo ""
35+ done
36+}
37+
38+echo_deps_names > license-generator/tmp/deps.txt
39+
40+echo_header
41+echo ""
42+sed <license-generator/tmp/deps.txt 's/^/ /'
43+echo ""
44+echo_deps_licenses <license-generator/tmp/deps.txt
license-generator/header.txtnew file+23
@@ -0,0 +1,23 @@
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/.gitkeepnew file

No changes to the content.

logo.pngnew file

Binary file not shown.

package.yamldeleted−86
@@ -1,86 +0,0 @@
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.hsnew file+138
@@ -0,0 +1,138 @@
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.mdnew file+18
@@ -0,0 +1,18 @@
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.hsnew file+13
@@ -0,0 +1,13 @@
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.hsnew file+15
@@ -0,0 +1,15 @@
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.hsnew file+251
@@ -0,0 +1,251 @@
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.hsnew file+18
@@ -0,0 +1,18 @@
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.hsnew file+38
@@ -0,0 +1,38 @@
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.hsnew file+79
@@ -0,0 +1,79 @@
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)
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.hsnew file+176
@@ -0,0 +1,176 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Main
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 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
26+
27+import Data.Version (showVersion)
28+import qualified Data.Map as M
29+
30+import Options.Applicative as Opts
31+
32+import System.Exit (exitSuccess, exitFailure)
33+import System.IO (hPutStrLn, stderr)
34+import System.FilePath.Glob (glob)
35+
36+import qualified Language.PureScript as P
37+import qualified Paths_purescript as Paths
38+
39+import Language.PureScript.Make
40+
41+data PSCMakeOptions = PSCMakeOptions
42+ { pscmInput :: [FilePath]
43+ , pscmForeignInput :: [FilePath]
44+ , pscmOutputDir :: FilePath
45+ , pscmOpts :: P.Options
46+ , pscmUsePrefix :: Bool
47+ }
48+
49+data InputOptions = InputOptions
50+ { ioInputFiles :: [FilePath]
51+ }
52+
53+compile :: PSCMakeOptions -> IO ()
54+compile (PSCMakeOptions inputGlob inputForeignGlob outputDir opts usePrefix) = do
55+ input <- concat <$> mapM glob inputGlob
56+ when (null input) $ do
57+ hPutStrLn stderr "psc: No input files."
58+ exitFailure
59+ moduleFiles <- readInput (InputOptions input)
60+ inputForeign <- concat <$> mapM glob inputForeignGlob
61+ foreignFiles <- forM inputForeign (\inFile -> (inFile,) <$> readFile inFile)
62+ case runWriterT (parseInputs moduleFiles foreignFiles) of
63+ Left errs -> do
64+ hPutStrLn stderr (P.prettyPrintMultipleErrors (P.optionsVerboseErrors opts) errs)
65+ exitFailure
66+ Right ((ms, foreigns), warnings) -> do
67+ when (P.nonEmpty warnings) $
68+ hPutStrLn stderr (P.prettyPrintMultipleWarnings (P.optionsVerboseErrors opts) warnings)
69+ let filePathMap = M.fromList $ map (\(fp, P.Module _ mn _ _) -> (mn, fp)) ms
70+ makeActions = buildMakeActions outputDir filePathMap foreigns usePrefix
71+ e <- runMake opts $ P.make makeActions (map snd ms)
72+ case e of
73+ Left errs -> do
74+ hPutStrLn stderr (P.prettyPrintMultipleErrors (P.optionsVerboseErrors opts) errs)
75+ exitFailure
76+ Right (_, warnings') -> do
77+ when (P.nonEmpty warnings') $
78+ hPutStrLn stderr (P.prettyPrintMultipleWarnings (P.optionsVerboseErrors opts) warnings')
79+ exitSuccess
80+
81+readInput :: InputOptions -> IO [(Either P.RebuildPolicy FilePath, String)]
82+readInput InputOptions{..} = forM ioInputFiles $ \inFile -> (Right inFile, ) <$> readFile inFile
83+
84+parseInputs :: (Functor m, Applicative m, MonadError P.MultipleErrors m, MonadWriter P.MultipleErrors m)
85+ => [(Either P.RebuildPolicy FilePath, String)]
86+ -> [(FilePath, P.ForeignJS)]
87+ -> m ([(Either P.RebuildPolicy FilePath, P.Module)], M.Map P.ModuleName (FilePath, P.ForeignJS))
88+parseInputs modules foreigns =
89+ (,) <$> P.parseModulesFromFiles (either (const "") id) modules
90+ <*> P.parseForeignModulesFromFiles foreigns
91+
92+inputFile :: Parser FilePath
93+inputFile = strArgument $
94+ metavar "FILE"
95+ <> help "The input .purs file(s)"
96+
97+inputForeignFile :: Parser FilePath
98+inputForeignFile = strOption $
99+ short 'f'
100+ <> long "ffi"
101+ <> help "The input .js file(s) providing foreign import implementations"
102+
103+outputDirectory :: Parser FilePath
104+outputDirectory = strOption $
105+ short 'o'
106+ <> long "output"
107+ <> Opts.value "output"
108+ <> showDefault
109+ <> help "The output directory"
110+
111+requirePath :: Parser (Maybe FilePath)
112+requirePath = optional $ strOption $
113+ short 'r'
114+ <> long "require-path"
115+ <> help "The path prefix to use for require() calls in the generated JavaScript"
116+
117+noTco :: Parser Bool
118+noTco = switch $
119+ long "no-tco"
120+ <> help "Disable tail call optimizations"
121+
122+noMagicDo :: Parser Bool
123+noMagicDo = switch $
124+ long "no-magic-do"
125+ <> help "Disable the optimization that overloads the do keyword to generate efficient code specifically for the Eff monad"
126+
127+noOpts :: Parser Bool
128+noOpts = switch $
129+ long "no-opts"
130+ <> help "Skip the optimization phase"
131+
132+comments :: Parser Bool
133+comments = switch $
134+ short 'c'
135+ <> long "comments"
136+ <> help "Include comments in the generated code"
137+
138+verboseErrors :: Parser Bool
139+verboseErrors = switch $
140+ short 'v'
141+ <> long "verbose-errors"
142+ <> help "Display verbose error messages"
143+
144+noPrefix :: Parser Bool
145+noPrefix = switch $
146+ short 'p'
147+ <> long "no-prefix"
148+ <> help "Do not include comment header"
149+
150+
151+options :: Parser P.Options
152+options = P.Options <$> noTco
153+ <*> noMagicDo
154+ <*> pure Nothing
155+ <*> noOpts
156+ <*> verboseErrors
157+ <*> (not <$> comments)
158+ <*> requirePath
159+
160+pscMakeOptions :: Parser PSCMakeOptions
161+pscMakeOptions = PSCMakeOptions <$> many inputFile
162+ <*> many inputForeignFile
163+ <*> outputDirectory
164+ <*> options
165+ <*> (not <$> noPrefix)
166+
167+main :: IO ()
168+main = execParser opts >>= compile
169+ where
170+ opts = info (version <*> helper <*> pscMakeOptions) infoModList
171+ infoModList = fullDesc <> headerInfo <> footerInfo
172+ headerInfo = header "psc - Compiles PureScript to Javascript"
173+ footerInfo = footer $ "psc " ++ showVersion Paths.version
174+
175+ version :: Parser (a -> a)
176+ version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
psci/Completion.hsnew file+227
@@ -0,0 +1,227 @@
1+module Completion where
2+
3+import Data.Maybe (mapMaybe)
4+import Data.List (nub, nubBy, sortBy, isPrefixOf, stripPrefix)
5+import Data.Char (isUpper)
6+import Data.Function (on)
7+import Data.Traversable (traverse)
8+
9+import Control.Arrow (second)
10+import Control.Applicative ((<$>), (<*>))
11+import Control.Monad.Trans.Reader (asks, runReaderT, ReaderT)
12+import Control.Monad.Trans.State.Strict
13+
14+import System.Console.Haskeline
15+
16+import qualified Language.PureScript as P
17+import qualified Language.PureScript.Names as N
18+
19+import qualified Directive as D
20+import Types
21+
22+-- Completions may read the state, but not modify it.
23+type CompletionM = ReaderT PSCiState IO
24+
25+-- Lift a `CompletionM` action to a `StateT PSCiState IO` one.
26+liftCompletionM :: CompletionM a -> StateT PSCiState IO a
27+liftCompletionM act = StateT (\s -> (\a -> (a, s)) <$> runReaderT act s)
28+
29+-- Haskeline completions
30+
31+data CompletionContext
32+ = CtxDirective String
33+ | CtxFilePath String
34+ | CtxModule
35+ | CtxIdentifier
36+ | CtxType
37+ | CtxFixed String
38+ deriving (Show)
39+
40+-- |
41+-- Loads module, function, and file completions.
42+--
43+completion :: CompletionFunc (StateT PSCiState IO)
44+completion = liftCompletionM . completion'
45+
46+completion' :: CompletionFunc CompletionM
47+completion' = completeWordWithPrev Nothing " \t\n\r" findCompletions
48+
49+-- |
50+-- Decide what kind of completion we need based on input. This function expects
51+-- a list of complete words (to the left of the cursor) as the first argument,
52+-- and the current word as the second argument.
53+completionContext :: [String] -> String -> [CompletionContext]
54+completionContext [] _ = [CtxDirective "", CtxIdentifier, CtxFixed "import"]
55+completionContext ws w | headSatisfies (":" `isPrefixOf`) ws = completeDirective ws w
56+completionContext ws w | headSatisfies (== "import") ws = completeImport ws w
57+completionContext _ _ = [CtxIdentifier]
58+
59+completeDirective :: [String] -> String -> [CompletionContext]
60+completeDirective ws w =
61+ case ws of
62+ [] -> [CtxDirective w]
63+ [dir] -> case D.directivesFor <$> stripPrefix ":" dir of
64+ -- only offer completions if the directive is unambiguous
65+ Just [dir'] -> directiveArg w dir'
66+ _ -> []
67+
68+ -- All directives take exactly one argument. If we haven't yet matched,
69+ -- that means one argument has already been supplied. So don't complete
70+ -- any others.
71+ _ -> []
72+
73+directiveArg :: String -> Directive -> [CompletionContext]
74+directiveArg _ Browse = [CtxModule]
75+directiveArg w Load = [CtxFilePath w]
76+directiveArg w Foreign = [CtxFilePath w]
77+directiveArg _ Quit = []
78+directiveArg _ Reset = []
79+directiveArg _ Help = []
80+directiveArg _ Show = map CtxFixed replQueryStrings
81+directiveArg _ Type = [CtxIdentifier]
82+directiveArg _ Kind = [CtxType]
83+
84+completeImport :: [String] -> String -> [CompletionContext]
85+completeImport ws w' =
86+ case (ws, w') of
87+ (["import"], w) | headSatisfies isUpper w -> [CtxModule]
88+ (["import"], _) -> [CtxModule, CtxFixed "qualified"]
89+ (["import", "qualified"], _) -> [CtxModule]
90+ _ -> []
91+
92+headSatisfies :: (a -> Bool) -> [a] -> Bool
93+headSatisfies p str =
94+ case str of
95+ (c:_) -> p c
96+ _ -> False
97+
98+-- | Callback for Haskeline's `completeWordWithPrev`.
99+-- Expects:
100+-- * Line contents to the left of the word, reversed
101+-- * Word to be completed
102+findCompletions :: String -> String -> CompletionM [Completion]
103+findCompletions prev word = do
104+ let ctx = completionContext (words (reverse prev)) word
105+ completions <- concat <$> traverse getCompletions ctx
106+ return $ sortBy directivesFirst completions
107+ where
108+ getCompletions :: CompletionContext -> CompletionM [Completion]
109+ getCompletions = fmap (mapMaybe (either (prefixedBy word) Just)) . getCompletion
110+
111+ prefixedBy :: String -> String -> Maybe Completion
112+ prefixedBy w cand = if w `isPrefixOf` cand
113+ then Just (simpleCompletion cand)
114+ else Nothing
115+
116+getCompletion :: CompletionContext -> CompletionM [Either String Completion]
117+getCompletion ctx =
118+ case ctx of
119+ CtxFilePath f -> map Right <$> listFiles f
120+ CtxModule -> map Left <$> getModuleNames
121+ CtxIdentifier -> map Left <$> ((++) <$> getIdentNames <*> getDctorNames)
122+ CtxType -> map Left <$> getTypeNames
123+ CtxFixed str -> return [Left str]
124+ CtxDirective d -> return (map Left (completeDirectives d))
125+
126+ where
127+ completeDirectives :: String -> [String]
128+ completeDirectives = map (':' :) . D.directiveStringsFor
129+
130+
131+getLoadedModules :: CompletionM [P.Module]
132+getLoadedModules = asks (map snd . psciLoadedModules)
133+
134+getImportedModules :: CompletionM [ImportedModule]
135+getImportedModules = asks psciImportedModules
136+
137+getModuleNames :: CompletionM [String]
138+getModuleNames = moduleNames <$> getLoadedModules
139+
140+mapLoadedModulesAndQualify :: (Show a) => (P.Module -> [(a, P.Declaration)]) -> CompletionM [String]
141+mapLoadedModulesAndQualify f = do
142+ ms <- getLoadedModules
143+ let argPairs = do m <- ms
144+ fm <- f m
145+ return (m, fm)
146+ concat <$> traverse (uncurry getAllQualifications) argPairs
147+
148+getIdentNames :: CompletionM [String]
149+getIdentNames = mapLoadedModulesAndQualify identNames
150+
151+getDctorNames :: CompletionM [String]
152+getDctorNames = mapLoadedModulesAndQualify dctorNames
153+
154+getTypeNames :: CompletionM [String]
155+getTypeNames = mapLoadedModulesAndQualify typeDecls
156+
157+-- | Given a module and a declaration in that module, return all possible ways
158+-- it could have been referenced given the current PSCiState - including fully
159+-- qualified, qualified using an alias, and unqualified.
160+getAllQualifications :: (Show a) => P.Module -> (a, P.Declaration) -> CompletionM [String]
161+getAllQualifications m (declName, decl) = do
162+ imports <- getAllImportsOf m
163+ let fullyQualified = qualifyWith (Just (P.getModuleName m))
164+ let otherQuals = nub (concatMap qualificationsUsing imports)
165+ return $ fullyQualified : otherQuals
166+ where
167+ qualifyWith mMod = show (P.Qualified mMod declName)
168+ referencedBy refs = P.isExported (Just refs) decl
169+
170+ qualificationsUsing (_, importType, asQ') =
171+ let q = qualifyWith asQ'
172+ in case importType of
173+ P.Implicit -> [q]
174+ P.Explicit refs -> if referencedBy refs
175+ then [q]
176+ else []
177+ P.Hiding refs -> if referencedBy refs
178+ then []
179+ else [q]
180+
181+
182+-- | Returns all the ImportedModule values referring to imports of a particular
183+-- module.
184+getAllImportsOf :: P.Module -> CompletionM [ImportedModule]
185+getAllImportsOf = asks . allImportsOf
186+
187+nubOnFst :: Eq a => [(a, b)] -> [(a, b)]
188+nubOnFst = nubBy ((==) `on` fst)
189+
190+typeDecls :: P.Module -> [(N.ProperName, P.Declaration)]
191+typeDecls = mapMaybe getTypeName . filter P.isDataDecl . P.exportedDeclarations
192+ where
193+ getTypeName :: P.Declaration -> Maybe (N.ProperName, P.Declaration)
194+ getTypeName d@(P.TypeSynonymDeclaration name _ _) = Just (name, d)
195+ getTypeName d@(P.DataDeclaration _ name _ _) = Just (name, d)
196+ getTypeName (P.PositionedDeclaration _ _ d) = getTypeName d
197+ getTypeName _ = Nothing
198+
199+identNames :: P.Module -> [(N.Ident, P.Declaration)]
200+identNames = nubOnFst . concatMap getDeclNames . P.exportedDeclarations
201+ where
202+ getDeclNames :: P.Declaration -> [(P.Ident, P.Declaration)]
203+ getDeclNames d@(P.ValueDeclaration ident _ _ _) = [(ident, d)]
204+ getDeclNames d@(P.TypeDeclaration ident _ ) = [(ident, d)]
205+ getDeclNames d@(P.ExternDeclaration ident _) = [(ident, d)]
206+ getDeclNames d@(P.TypeClassDeclaration _ _ _ ds) = map (second (const d)) $ concatMap getDeclNames ds
207+ getDeclNames (P.PositionedDeclaration _ _ d) = getDeclNames d
208+ getDeclNames _ = []
209+
210+dctorNames :: P.Module -> [(N.ProperName, P.Declaration)]
211+dctorNames = nubOnFst . concatMap go . P.exportedDeclarations
212+ where
213+ go :: P.Declaration -> [(N.ProperName, P.Declaration)]
214+ go decl@(P.DataDeclaration _ _ _ ctors) = map (\n -> (n, decl)) (map fst ctors)
215+ go (P.PositionedDeclaration _ _ d) = go d
216+ go _ = []
217+
218+moduleNames :: [P.Module] -> [String]
219+moduleNames ms = nub [show moduleName | P.Module _ moduleName _ _ <- ms]
220+
221+directivesFirst :: Completion -> Completion -> Ordering
222+directivesFirst (Completion _ d1 _) (Completion _ d2 _) = go d1 d2
223+ where
224+ go (':' : xs) (':' : ys) = compare xs ys
225+ go (':' : _) _ = LT
226+ go _ (':' : _) = GT
227+ go xs ys = compare xs ys
psci/Directive.hsnew file+115
@@ -0,0 +1,115 @@
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.hsnew file+21
@@ -0,0 +1,21 @@
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.hsnew file+598
@@ -0,0 +1,598 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : PSCi
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+-- PureScript Compiler Interactive.
13+--
14+-----------------------------------------------------------------------------
15+
16+{-# LANGUAGE DoAndIfThenElse #-}
17+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
18+{-# LANGUAGE RecordWildCards #-}
19+{-# LANGUAGE TupleSections #-}
20+
21+module PSCi where
22+
23+import Data.Foldable (traverse_)
24+import Data.List (intercalate, nub, sort)
25+import Data.Traversable (traverse)
26+import Data.Tuple (swap)
27+import Data.Version (showVersion)
28+import qualified Data.Map as M
29+
30+import Control.Applicative
31+import Control.Arrow (first)
32+import Control.Monad
33+import Control.Monad.Error.Class (MonadError(..))
34+import Control.Monad.Trans.Class
35+import Control.Monad.Trans.Except (runExceptT)
36+import Control.Monad.Trans.Maybe (MaybeT(..), runMaybeT)
37+import Control.Monad.Trans.State.Strict
38+import Control.Monad.IO.Class (liftIO)
39+import Control.Monad.Writer (runWriter)
40+import qualified Control.Monad.Trans.State.Lazy as L
41+
42+import Options.Applicative as Opts
43+
44+import System.Console.Haskeline
45+import System.Directory (doesFileExist, findExecutable, getHomeDirectory, getCurrentDirectory)
46+import System.Exit
47+import System.FilePath (pathSeparator, (</>), isPathSeparator)
48+import System.FilePath.Glob (glob)
49+import System.Process (readProcessWithExitCode)
50+import System.IO.Error (tryIOError)
51+
52+import qualified Language.PureScript as P
53+import qualified Language.PureScript.Names as N
54+import qualified Paths_purescript as Paths
55+
56+import qualified Directive as D
57+import Completion (completion)
58+import IO (mkdirp)
59+import Parser (parseCommand)
60+import Types
61+
62+-- | The name of the PSCI support module
63+supportModuleName :: P.ModuleName
64+supportModuleName = P.ModuleName [P.ProperName "$PSCI", P.ProperName "Support"]
65+
66+-- | Support module, contains code to evaluate terms
67+supportModule :: P.Module
68+supportModule =
69+ case P.parseModulesFromFiles id [("", code)] of
70+ Right [(_, P.Module cs _ ds exps)] -> P.Module cs supportModuleName ds exps
71+ _ -> error "Support module could not be parsed"
72+ where
73+ code :: String
74+ code = unlines
75+ [ "module S where"
76+ , ""
77+ , "import Prelude"
78+ , "import Control.Monad.Eff"
79+ , "import Control.Monad.Eff.Console"
80+ , "import Control.Monad.Eff.Unsafe"
81+ , ""
82+ , "class Eval a where"
83+ , " eval :: a -> Eff (console :: CONSOLE) Unit"
84+ , ""
85+ , "instance evalShow :: (Show a) => Eval a where"
86+ , " eval = print"
87+ , ""
88+ , "instance evalEff :: (Eval a) => Eval (Eff eff a) where"
89+ , " eval x = unsafeInterleaveEff x >>= eval"
90+ ]
91+
92+-- File helpers
93+
94+onFirstFileMatching :: Monad m => (b -> m (Maybe a)) -> [b] -> m (Maybe a)
95+onFirstFileMatching f pathVariants = runMaybeT . msum $ map (MaybeT . f) pathVariants
96+
97+-- |
98+-- Locates the node executable.
99+-- Checks for either @nodejs@ or @node@.
100+--
101+findNodeProcess :: IO (Maybe String)
102+findNodeProcess = onFirstFileMatching findExecutable names
103+ where names = ["nodejs", "node"]
104+
105+-- |
106+-- Grabs the filename where the history is stored.
107+--
108+getHistoryFilename :: IO FilePath
109+getHistoryFilename = do
110+ home <- getHomeDirectory
111+ let filename = home </> ".purescript" </> "psci_history"
112+ mkdirp filename
113+ return filename
114+
115+-- |
116+-- Loads a file for use with imports.
117+--
118+loadModule :: FilePath -> IO (Either String [P.Module])
119+loadModule filename = do
120+ content <- readFile filename
121+ return $ either (Left . P.prettyPrintMultipleErrors False) (Right . map snd) $ P.parseModulesFromFiles id [(filename, content)]
122+
123+-- |
124+-- Load all modules.
125+--
126+loadAllModules :: [FilePath] -> IO (Either P.MultipleErrors [(Either P.RebuildPolicy FilePath, P.Module)])
127+loadAllModules files = do
128+ filesAndContent <- forM files $ \filename -> do
129+ content <- readFile filename
130+ return (Right filename, content)
131+ return $ P.parseModulesFromFiles (either (const "") id) filesAndContent
132+
133+-- |
134+-- Load all modules, updating the application state
135+--
136+loadAllImportedModules :: PSCI ()
137+loadAllImportedModules = do
138+ files <- PSCI . lift $ fmap psciImportedFilenames get
139+ modulesOrFirstError <- psciIO $ loadAllModules files
140+ case modulesOrFirstError of
141+ Left errs -> printErrors errs
142+ Right modules -> PSCI . lift . modify $ \st -> st { psciLoadedModules = modules }
143+
144+-- |
145+-- Expands tilde in path.
146+--
147+expandTilde :: FilePath -> IO FilePath
148+expandTilde ('~':p:rest) | isPathSeparator p = (</> rest) <$> getHomeDirectory
149+expandTilde p = return p
150+
151+-- Messages
152+
153+-- |
154+-- The help message.
155+--
156+helpMessage :: String
157+helpMessage = "The following commands are available:\n\n " ++
158+ intercalate "\n " (map line D.help) ++
159+ "\n\n" ++ extraHelp
160+ where
161+ line :: (Directive, String, String) -> String
162+ line (dir, arg, desc) =
163+ let cmd = ':' : D.stringFor dir
164+ in unwords [ cmd
165+ , replicate (11 - length cmd) ' '
166+ , arg
167+ , replicate (11 - length arg) ' '
168+ , desc
169+ ]
170+
171+ extraHelp =
172+ "Further information is available on the PureScript wiki:\n" ++
173+ " --> https://github.com/purescript/purescript/wiki/psci"
174+
175+
176+-- |
177+-- The welcome prologue.
178+--
179+prologueMessage :: String
180+prologueMessage = intercalate "\n"
181+ [ " ____ ____ _ _ "
182+ , "| _ \\ _ _ _ __ ___/ ___| ___ _ __(_)_ __ | |_ "
183+ , "| |_) | | | | '__/ _ \\___ \\ / __| '__| | '_ \\| __|"
184+ , "| __/| |_| | | | __/___) | (__| | | | |_) | |_ "
185+ , "|_| \\__,_|_| \\___|____/ \\___|_| |_| .__/ \\__|"
186+ , " |_| "
187+ , ""
188+ , ":? shows help"
189+ ]
190+
191+-- |
192+-- The quit message.
193+--
194+quitMessage :: String
195+quitMessage = "See ya!"
196+
197+-- |
198+-- PSCI monad
199+--
200+newtype PSCI a = PSCI { runPSCI :: InputT (StateT PSCiState IO) a } deriving (Functor, Applicative, Monad)
201+
202+psciIO :: IO a -> PSCI a
203+psciIO io = PSCI . lift $ lift io
204+
205+-- |
206+-- Makes a volatile module to execute the current expression.
207+--
208+createTemporaryModule :: Bool -> PSCiState -> P.Expr -> P.Module
209+createTemporaryModule exec PSCiState{psciImportedModules = imports, psciLetBindings = lets} val =
210+ let
211+ moduleName = P.ModuleName [P.ProperName "$PSCI"]
212+ trace = P.Var (P.Qualified (Just supportModuleName) (P.Ident "eval"))
213+ mainValue = P.App trace (P.Var (P.Qualified Nothing (P.Ident "it")))
214+ itDecl = P.ValueDeclaration (P.Ident "it") P.Public [] $ Right val
215+ mainDecl = P.ValueDeclaration (P.Ident "main") P.Public [] $ Right mainValue
216+ decls = if exec then [itDecl, mainDecl] else [itDecl]
217+ in
218+ P.Module [] moduleName ((importDecl `map` imports) ++ lets ++ decls) Nothing
219+
220+
221+-- |
222+-- Makes a volatile module to hold a non-qualified type synonym for a fully-qualified data type declaration.
223+--
224+createTemporaryModuleForKind :: PSCiState -> P.Type -> P.Module
225+createTemporaryModuleForKind PSCiState{psciImportedModules = imports, psciLetBindings = lets} typ =
226+ let
227+ moduleName = P.ModuleName [P.ProperName "$PSCI"]
228+ itDecl = P.TypeSynonymDeclaration (P.ProperName "IT") [] typ
229+ in
230+ P.Module [] moduleName ((importDecl `map` imports) ++ lets ++ [itDecl]) Nothing
231+
232+-- |
233+-- Makes a volatile module to execute the current imports.
234+--
235+createTemporaryModuleForImports :: PSCiState -> P.Module
236+createTemporaryModuleForImports PSCiState{psciImportedModules = imports} =
237+ let
238+ moduleName = P.ModuleName [P.ProperName "$PSCI"]
239+ in
240+ P.Module [] moduleName (importDecl `map` imports) Nothing
241+
242+importDecl :: ImportedModule -> P.Declaration
243+importDecl (mn, declType, asQ) = P.ImportDeclaration mn declType asQ
244+
245+indexFile :: FilePath
246+indexFile = ".psci_modules" ++ pathSeparator : "index.js"
247+
248+modulesDir :: FilePath
249+modulesDir = ".psci_modules" ++ pathSeparator : "node_modules"
250+
251+-- | This is different than the runMake in 'Language.PureScript.Make' in that it specifies the
252+-- options and ignores the warning messages.
253+runMake :: P.Make a -> IO (Either P.MultipleErrors a)
254+runMake mk = fmap (fmap fst) $ P.runMake (P.Options False False Nothing False False False Nothing) mk
255+
256+makeIO :: (IOError -> P.ErrorMessage) -> IO a -> P.Make a
257+makeIO f io = do
258+ e <- liftIO $ tryIOError io
259+ either (throwError . P.singleError . f) return e
260+
261+make :: PSCiState -> [(Either P.RebuildPolicy FilePath, P.Module)] -> P.Make P.Environment
262+make PSCiState{..} ms = P.make actions' (map snd (psciLoadedModules ++ ms))
263+ where
264+ filePathMap = M.fromList $ (first P.getModuleName . swap) `map` (psciLoadedModules ++ ms)
265+ actions = P.buildMakeActions modulesDir filePathMap psciForeignFiles False
266+ actions' = actions { P.progress = const (return ()) }
267+
268+-- |
269+-- Takes a value declaration and evaluates it with the current state.
270+--
271+handleDeclaration :: P.Expr -> PSCI ()
272+handleDeclaration val = do
273+ st <- PSCI $ lift get
274+ let m = createTemporaryModule True st val
275+ let nodeArgs = psciNodeFlags st ++ [indexFile]
276+ e <- psciIO . runMake $ make st [(Left P.RebuildAlways, supportModule), (Left P.RebuildAlways, m)]
277+ case e of
278+ Left errs -> printErrors errs
279+ Right _ -> do
280+ psciIO $ writeFile indexFile "require('$PSCI').main();"
281+ process <- psciIO findNodeProcess
282+ result <- psciIO $ traverse (\node -> readProcessWithExitCode node nodeArgs "") process
283+ case result of
284+ Just (ExitSuccess, out, _) -> PSCI $ outputStrLn out
285+ Just (ExitFailure _, _, err) -> PSCI $ outputStrLn err
286+ Nothing -> PSCI $ outputStrLn "Couldn't find node.js"
287+
288+-- |
289+-- Takes a list of declarations and updates the environment, then run a make. If the declaration fails,
290+-- restore the original environment.
291+--
292+handleDecls :: [P.Declaration] -> PSCI ()
293+handleDecls ds = do
294+ st <- PSCI $ lift get
295+ let st' = updateLets ds st
296+ let m = createTemporaryModule False st' (P.ObjectLiteral [])
297+ e <- psciIO . runMake $ make st' [(Left P.RebuildAlways, m)]
298+ case e of
299+ Left err -> printErrors err
300+ Right _ -> PSCI $ lift (put st')
301+
302+-- |
303+-- Show actual loaded modules in psci.
304+--
305+handleShowLoadedModules :: PSCI ()
306+handleShowLoadedModules = do
307+ PSCiState { psciLoadedModules = loadedModules } <- PSCI $ lift get
308+ psciIO $ readModules loadedModules >>= putStrLn
309+ return ()
310+ where readModules = return . unlines . sort . nub . map toModuleName
311+ toModuleName = N.runModuleName . (\ (P.Module _ mdName _ _) -> mdName) . snd
312+
313+-- |
314+-- Show the imported modules in psci.
315+--
316+handleShowImportedModules :: PSCI ()
317+handleShowImportedModules = do
318+ PSCiState { psciImportedModules = importedModules } <- PSCI $ lift get
319+ psciIO $ showModules importedModules >>= putStrLn
320+ return ()
321+ where
322+ showModules = return . unlines . sort . map showModule
323+ showModule (mn, declType, asQ) =
324+ "import " ++ case asQ of
325+ Just mn' -> "qualified " ++ N.runModuleName mn ++ " as " ++ N.runModuleName mn'
326+ Nothing -> N.runModuleName mn ++ " " ++ showDeclType declType
327+
328+ showDeclType P.Implicit = ""
329+ showDeclType (P.Explicit refs) = refsList refs
330+ showDeclType (P.Hiding refs) = "hiding " ++ refsList refs
331+ refsList refs = "(" ++ commaList (map showRef refs) ++ ")"
332+
333+ showRef :: P.DeclarationRef -> String
334+ showRef (P.TypeRef pn dctors) = show pn ++ "(" ++ maybe ".." (commaList . map N.runProperName) dctors ++ ")"
335+ showRef (P.ValueRef ident) = show ident
336+ showRef (P.TypeClassRef pn) = show pn
337+ showRef (P.TypeInstanceRef ident) = show ident
338+ showRef (P.ModuleRef name) = "module " ++ show name
339+ showRef (P.PositionedDeclarationRef _ _ ref) = showRef ref
340+
341+ commaList :: [String] -> String
342+ commaList = intercalate ", "
343+
344+-- |
345+-- Imports a module, preserving the initial state on failure.
346+--
347+handleImport :: ImportedModule -> PSCI ()
348+handleImport im = do
349+ st <- updateImportedModules im <$> PSCI (lift get)
350+ let m = createTemporaryModuleForImports st
351+ e <- psciIO . runMake $ make st [(Left P.RebuildAlways, m)]
352+ case e of
353+ Left errs -> printErrors errs
354+ Right _ -> do
355+ PSCI $ lift $ put st
356+ return ()
357+
358+-- |
359+-- Takes a value and prints its type
360+--
361+handleTypeOf :: P.Expr -> PSCI ()
362+handleTypeOf val = do
363+ st <- PSCI $ lift get
364+ let m = createTemporaryModule False st val
365+ e <- psciIO . runMake $ make st [(Left P.RebuildAlways, m)]
366+ case e of
367+ Left errs -> printErrors errs
368+ Right env' ->
369+ case M.lookup (P.ModuleName [P.ProperName "$PSCI"], P.Ident "it") (P.names env') of
370+ Just (ty, _, _) -> PSCI . outputStrLn . P.prettyPrintType $ ty
371+ Nothing -> PSCI $ outputStrLn "Could not find type"
372+
373+-- |
374+-- Pretty print a module's signatures
375+--
376+printModuleSignatures :: P.ModuleName -> P.Environment -> PSCI ()
377+printModuleSignatures moduleName env =
378+ PSCI $ let namesEnv = P.names env
379+ moduleNamesIdent = (filter ((== moduleName) . fst) . M.keys) namesEnv
380+ in case moduleNamesIdent of
381+ [] -> outputStrLn $ "This module '"++ P.runModuleName moduleName ++"' does not export functions."
382+ _ -> ( outputStrLn
383+ . unlines
384+ . sort
385+ . map (showType . findType namesEnv)) moduleNamesIdent
386+ 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))
387+ findType envNames m@(_, mIdent) = (mIdent, M.lookup m envNames)
388+ showType :: (P.Ident, Maybe (P.Type, P.NameKind, P.NameVisibility)) -> String
389+ showType (mIdent, Just (mType, _, _)) = show mIdent ++ " :: " ++ P.prettyPrintType mType
390+ showType _ = error "The impossible happened in printModuleSignatures."
391+
392+-- |
393+-- Browse a module and displays its signature (if module exists).
394+--
395+handleBrowse :: P.ModuleName -> PSCI ()
396+handleBrowse moduleName = do
397+ st <- PSCI $ lift get
398+ env <- psciIO . runMake $ make st []
399+ case env of
400+ Left errs -> printErrors errs
401+ Right env' ->
402+ if moduleName `notElem` (nub . map ((\ (P.Module _ modName _ _ ) -> modName) . snd)) (psciLoadedModules st)
403+ then PSCI $ outputStrLn $ "Module '" ++ N.runModuleName moduleName ++ "' is not valid."
404+ else printModuleSignatures moduleName env'
405+
406+-- | Pretty-print errors
407+printErrors :: P.MultipleErrors -> PSCI ()
408+printErrors = PSCI . outputStrLn . P.prettyPrintMultipleErrors False
409+
410+-- |
411+-- Takes a value and prints its kind
412+--
413+handleKindOf :: P.Type -> PSCI ()
414+handleKindOf typ = do
415+ st <- PSCI $ lift get
416+ let m = createTemporaryModuleForKind st typ
417+ mName = P.ModuleName [P.ProperName "$PSCI"]
418+ e <- psciIO . runMake $ make st [(Left P.RebuildAlways, m)]
419+ case e of
420+ Left errs -> printErrors errs
421+ Right env' ->
422+ case M.lookup (P.Qualified (Just mName) $ P.ProperName "IT") (P.typeSynonyms env') of
423+ Just (_, typ') -> do
424+ let chk = P.CheckState env' 0 0 (Just mName)
425+ k = fst . runWriter . runExceptT $ L.runStateT (P.unCheck (P.kindOf mName typ')) chk
426+ case k of
427+ Left errStack -> PSCI . outputStrLn . P.prettyPrintMultipleErrors False $ errStack
428+ Right (kind, _) -> PSCI . outputStrLn . P.prettyPrintKind $ kind
429+ Nothing -> PSCI $ outputStrLn "Could not find kind"
430+
431+-- Commands
432+
433+-- |
434+-- Parses the input and returns either a Metacommand, or an error as a string.
435+--
436+getCommand :: Bool -> InputT (StateT PSCiState IO) (Either String (Maybe Command))
437+getCommand singleLineMode = do
438+ firstLine <- getInputLine "> "
439+ case firstLine of
440+ Nothing -> return (Right Nothing)
441+ Just "" -> return (Right Nothing)
442+ Just s | singleLineMode || head s == ':' -> return . either Left (Right . Just) $ parseCommand s
443+ Just s -> either Left (Right . Just) . parseCommand <$> go [s]
444+ where
445+ go :: [String] -> InputT (StateT PSCiState IO) String
446+ go ls = maybe (return . unlines $ reverse ls) (go . (:ls)) =<< getInputLine " "
447+
448+-- |
449+-- Performs an action for each meta-command given, and also for expressions.
450+--
451+handleCommand :: Command -> PSCI ()
452+handleCommand (Expression val) = handleDeclaration val
453+handleCommand ShowHelp = PSCI $ outputStrLn helpMessage
454+handleCommand (Import im) = handleImport im
455+handleCommand (Decls l) = handleDecls l
456+handleCommand (LoadFile filePath) = whenFileExists filePath $ \absPath -> do
457+ PSCI . lift $ modify (updateImportedFiles absPath)
458+ m <- psciIO $ loadModule absPath
459+ case m of
460+ Left err -> PSCI $ outputStrLn err
461+ Right mods -> PSCI . lift $ modify (updateModules (map ((,) (Right absPath)) mods))
462+handleCommand (LoadForeign filePath) = whenFileExists filePath $ \absPath -> do
463+ foreignsOrError <- psciIO . runMake $ do
464+ foreignFile <- makeIO (const (P.SimpleErrorWrapper $ P.CannotReadFile absPath)) (readFile absPath)
465+ P.parseForeignModulesFromFiles [(absPath, foreignFile)]
466+ case foreignsOrError of
467+ Left err -> PSCI $ outputStrLn $ P.prettyPrintMultipleErrors False err
468+ Right foreigns -> PSCI . lift $ modify (updateForeignFiles foreigns)
469+handleCommand ResetState = do
470+ files <- psciImportedFilenames <$> PSCI (lift get)
471+ PSCI . lift . modify $ \st -> st
472+ { psciImportedFilenames = files
473+ , psciImportedModules = []
474+ , psciLetBindings = []
475+ }
476+ loadAllImportedModules
477+handleCommand (TypeOf val) = handleTypeOf val
478+handleCommand (KindOf typ) = handleKindOf typ
479+handleCommand (BrowseModule moduleName) = handleBrowse moduleName
480+handleCommand (ShowInfo QueryLoaded) = handleShowLoadedModules
481+handleCommand (ShowInfo QueryImport) = handleShowImportedModules
482+handleCommand QuitPSCi = error "`handleCommand QuitPSCi` was called. This is a bug."
483+
484+whenFileExists :: FilePath -> (FilePath -> PSCI ()) -> PSCI ()
485+whenFileExists filePath f = do
486+ absPath <- psciIO $ expandTilde filePath
487+ exists <- psciIO $ doesFileExist absPath
488+ if exists
489+ then f absPath
490+ else PSCI . outputStrLn $ "Couldn't locate: " ++ filePath
491+
492+-- |
493+-- Attempts to read initial commands from '.psci' in the present working
494+-- directory then the user's home
495+--
496+loadUserConfig :: IO (Maybe [Command])
497+loadUserConfig = onFirstFileMatching readCommands pathGetters
498+ where
499+ pathGetters = [getCurrentDirectory, getHomeDirectory]
500+ readCommands :: IO FilePath -> IO (Maybe [Command])
501+ readCommands path = do
502+ configFile <- (</> ".psci") <$> path
503+ exists <- doesFileExist configFile
504+ if exists
505+ then do
506+ ls <- lines <$> readFile configFile
507+ case mapM parseCommand ls of
508+ Left err -> print err >> exitFailure
509+ Right cs -> return $ Just cs
510+ else
511+ return Nothing
512+
513+
514+-- | Checks if the Console module is defined
515+consoleIsDefined :: [P.Module] -> Bool
516+consoleIsDefined = any ((== P.ModuleName (map P.ProperName [ "Control", "Monad", "Eff", "Console" ])) . P.getModuleName)
517+
518+-- |
519+-- The PSCI main loop.
520+--
521+loop :: PSCiOptions -> IO ()
522+loop PSCiOptions{..} = do
523+ config <- loadUserConfig
524+ inputFiles <- concat <$> mapM glob psciInputFile
525+ foreignFiles <- concat <$> mapM glob psciForeignInputFiles
526+ modulesOrFirstError <- loadAllModules inputFiles
527+ case modulesOrFirstError of
528+ Left errs -> putStrLn (P.prettyPrintMultipleErrors False errs) >> exitFailure
529+ Right modules -> do
530+ historyFilename <- getHistoryFilename
531+ let settings = defaultSettings { historyFile = Just historyFilename }
532+ foreignsOrError <- runMake $ do
533+ foreignFilesContent <- forM foreignFiles (\inFile -> (inFile,) <$> makeIO (const (P.SimpleErrorWrapper $ P.CannotReadFile inFile)) (readFile inFile))
534+ P.parseForeignModulesFromFiles foreignFilesContent
535+ case foreignsOrError of
536+ Left errs -> putStrLn (P.prettyPrintMultipleErrors False errs) >> exitFailure
537+ Right foreigns ->
538+ flip evalStateT (PSCiState inputFiles [] modules foreigns [] psciInputNodeFlags) . runInputT (setComplete completion settings) $ do
539+ outputStrLn prologueMessage
540+ traverse_ (mapM_ (runPSCI . handleCommand)) config
541+ modules' <- lift $ gets psciLoadedModules
542+ unless (consoleIsDefined (map snd modules')) . outputStrLn $ unlines
543+ [ "PSCi requires the purescript-console module to be installed."
544+ , "For help getting started, visit http://wiki.purescript.org/PSCi"
545+ ]
546+ go
547+ where
548+ go :: InputT (StateT PSCiState IO) ()
549+ go = do
550+ c <- getCommand (not psciMultiLineMode)
551+ case c of
552+ Left err -> outputStrLn err >> go
553+ Right Nothing -> go
554+ Right (Just QuitPSCi) -> outputStrLn quitMessage
555+ Right (Just c') -> runPSCI (loadAllImportedModules >> handleCommand c') >> go
556+
557+multiLineMode :: Parser Bool
558+multiLineMode = switch $
559+ long "multi-line-mode"
560+ <> short 'm'
561+ <> Opts.help "Run in multi-line mode (use ^D to terminate commands)"
562+
563+inputFile :: Parser FilePath
564+inputFile = strArgument $
565+ metavar "FILE"
566+ <> Opts.help "Optional .purs files to load on start"
567+
568+inputForeignFile :: Parser FilePath
569+inputForeignFile = strOption $
570+ short 'f'
571+ <> long "ffi"
572+ <> help "The input .js file(s) providing foreign import implementations"
573+
574+nodeFlagsFlag :: Parser [String]
575+nodeFlagsFlag = option parser $
576+ long "node-opts"
577+ <> metavar "NODE_OPTS"
578+ <> value []
579+ <> Opts.help "Flags to pass to node, separated by spaces"
580+ where
581+ parser = words <$> str
582+
583+psciOptions :: Parser PSCiOptions
584+psciOptions = PSCiOptions <$> multiLineMode
585+ <*> many inputFile
586+ <*> many inputForeignFile
587+ <*> nodeFlagsFlag
588+
589+runPSCi :: IO ()
590+runPSCi = execParser opts >>= loop
591+ where
592+ opts = info (version <*> helper <*> psciOptions) infoModList
593+ infoModList = fullDesc <> headerInfo <> footerInfo
594+ headerInfo = header "psci - Interactive mode for PureScript"
595+ footerInfo = footer $ "psci " ++ showVersion Paths.version
596+
597+ version :: Parser (a -> a)
598+ version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> Opts.help "Show the version number" <> hidden
psci/Parser.hsnew file+140
@@ -0,0 +1,140 @@
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+module Parser
17+ ( parseCommand
18+ ) where
19+
20+import Prelude hiding (lex)
21+
22+import Data.Char (isSpace)
23+import Data.List (intercalate)
24+
25+import Control.Applicative hiding (many)
26+
27+import Text.Parsec hiding ((<|>))
28+
29+import qualified Language.PureScript as P
30+import Language.PureScript.Parser.Common (mark, same)
31+
32+import qualified Directive as D
33+import Types
34+
35+-- |
36+-- Parses PSCI metacommands or expressions input from the user.
37+--
38+parseCommand :: String -> Either String Command
39+parseCommand cmdString =
40+ case cmdString of
41+ (':' : cmd) -> parseDirective cmd
42+ _ -> parseRest psciCommand cmdString
43+
44+parseRest :: P.TokenParser a -> String -> Either String a
45+parseRest p s = either (Left . show) Right $ do
46+ ts <- P.lex "" s
47+ P.runTokenParser "" (p <* eof) ts
48+
49+psciCommand :: P.TokenParser Command
50+psciCommand = choice (map try parsers)
51+ where
52+ parsers =
53+ [ psciLet
54+ , psciImport
55+ , psciOtherDeclaration
56+ , psciExpression
57+ ]
58+
59+trim :: String -> String
60+trim = trimEnd . trimStart
61+
62+trimStart :: String -> String
63+trimStart = dropWhile isSpace
64+
65+trimEnd :: String -> String
66+trimEnd = reverse . trimStart . reverse
67+
68+parseDirective :: String -> Either String Command
69+parseDirective cmd =
70+ case D.directivesFor' dstr of
71+ [(d, _)] -> commandFor d
72+ [] -> Left "Unrecognized directive. Type :? for help."
73+ ds -> Left ("Ambiguous directive. Possible matches: " ++
74+ intercalate ", " (map snd ds) ++ ". Type :? for help.")
75+ where
76+ (dstr, arg) = break isSpace cmd
77+
78+ commandFor d = case d of
79+ Help -> return ShowHelp
80+ Quit -> return QuitPSCi
81+ Reset -> return ResetState
82+ Browse -> BrowseModule <$> parseRest P.moduleName arg
83+ Load -> return $ LoadFile (trim arg)
84+ Foreign -> return $ LoadForeign (trim arg)
85+ Show -> ShowInfo <$> parseReplQuery' (trim arg)
86+ Type -> TypeOf <$> parseRest P.parseValue arg
87+ Kind -> KindOf <$> parseRest P.parseType arg
88+
89+-- |
90+-- Parses expressions entered at the PSCI repl.
91+--
92+psciExpression :: P.TokenParser Command
93+psciExpression = Expression <$> P.parseValue
94+
95+-- |
96+-- PSCI version of @let@.
97+-- This is essentially let from do-notation.
98+-- However, since we don't support the @Eff@ monad,
99+-- we actually want the normal @let@.
100+--
101+psciLet :: P.TokenParser Command
102+psciLet = Decls <$> (P.reserved "let" *> P.indented *> manyDecls)
103+ where
104+ manyDecls :: P.TokenParser [P.Declaration]
105+ manyDecls = mark (many1 (same *> P.parseLocalDeclaration))
106+
107+-- | Imports must be handled separately from other declarations, so that
108+-- :show import works, for example.
109+psciImport :: P.TokenParser Command
110+psciImport = Import <$> P.parseImportDeclaration'
111+
112+-- | Any other declaration that we don't need a 'special case' parser for
113+-- (like let or import declarations).
114+psciOtherDeclaration :: P.TokenParser Command
115+psciOtherDeclaration = Decls . (:[]) <$> do
116+ decl <- discardPositionInfo <$> P.parseDeclaration
117+ if acceptable decl
118+ then return decl
119+ else fail "this kind of declaration is not supported in psci"
120+
121+discardPositionInfo :: P.Declaration -> P.Declaration
122+discardPositionInfo (P.PositionedDeclaration _ _ d) = d
123+discardPositionInfo d = d
124+
125+acceptable :: P.Declaration -> Bool
126+acceptable P.DataDeclaration{} = True
127+acceptable P.TypeSynonymDeclaration{} = True
128+acceptable P.ExternDeclaration{} = True
129+acceptable P.ExternDataDeclaration{} = True
130+acceptable P.ExternInstanceDeclaration{} = True
131+acceptable P.TypeClassDeclaration{} = True
132+acceptable P.TypeInstanceDeclaration{} = True
133+acceptable _ = False
134+
135+parseReplQuery' :: String -> Either String ReplQuery
136+parseReplQuery' str =
137+ case parseReplQuery str of
138+ Nothing -> Left ("Don't know how to show " ++ str ++ ". Try one of: " ++
139+ intercalate ", " replQueryStrings ++ ".")
140+ Just query -> Right query
psci/Types.hsnew file+181
@@ -0,0 +1,181 @@
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, P.ForeignJS)
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, P.ForeignJS) -> 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.hsnew file+6
@@ -0,0 +1,6 @@
1+module Main where
2+
3+import PSCi
4+
5+main :: IO ()
6+main = runPSCi
psci/tests/Main.hsnew file+156
@@ -0,0 +1,156 @@
1+{-# LANGUAGE RecordWildCards, TupleSections #-}
2+
3+module Main where
4+
5+import Control.Monad.Trans.State.Strict (runStateT)
6+import Control.Monad (when, forM)
7+import Control.Applicative
8+import Control.Monad.Writer (runWriterT)
9+import Control.Monad.Trans.Except (runExceptT)
10+
11+import Data.List (sort)
12+
13+import System.Exit (exitFailure)
14+import System.Console.Haskeline
15+import System.FilePath ((</>))
16+import System.Directory (getCurrentDirectory)
17+import qualified System.FilePath.Glob as Glob
18+
19+import Test.HUnit
20+
21+import qualified Language.PureScript as P
22+
23+import PSCi
24+import Completion
25+import Types
26+
27+main :: IO ()
28+main = do
29+ Counts{..} <- runTestTT allTests
30+ when (errors + failures > 0) exitFailure
31+
32+allTests :: Test
33+allTests = completionTests
34+
35+completionTests :: Test
36+completionTests =
37+ TestLabel "completionTests"
38+ (TestList (map (TestCase . assertCompletedOk) completionTestData))
39+
40+-- If the cursor is at the right end of the line, with the 1st element of the
41+-- pair as the text in the line, then pressing tab should offer all the
42+-- elements of the list (which is the 2nd element) as completions.
43+completionTestData :: [(String, [String])]
44+completionTestData =
45+ -- basic directives
46+ [ (":h", [":help"])
47+ , (":re", [":reset"])
48+ , (":q", [":quit"])
49+ , (":mo", [":module"])
50+ , (":b", [":browse"])
51+
52+ -- :browse should complete module names
53+ , (":b Control.Monad.E", map (":b Control.Monad.Eff" ++) ["", ".Unsafe", ".Class", ".Console"])
54+ , (":b Control.Monad.Eff.", map (":b Control.Monad.Eff" ++) [".Unsafe", ".Class", ".Console"])
55+
56+ -- import should complete module names
57+ , ("import Control.Monad.E", map ("import Control.Monad.Eff" ++) ["", ".Unsafe", ".Class", ".Console"])
58+ , ("import Control.Monad.Eff.", map ("import Control.Monad.Eff" ++) [".Unsafe", ".Class", ".Console"])
59+ , ("import qualified Control.Monad.Eff.", map ("import qualified Control.Monad.Eff" ++) [".Unsafe", ".Class", ".Console"])
60+
61+ -- :load, :module should complete file paths
62+ , (":l psci/tests/data/", [":l psci/tests/data/Sample.purs"])
63+ , (":module psci/tests/data/", [":module psci/tests/data/Sample.purs"])
64+
65+ -- :quit, :help, :reset should not complete
66+ , (":help ", [])
67+ , (":quit ", [])
68+ , (":reset ", [])
69+
70+ -- :show should complete to "loaded" and "import"
71+ , (":show ", [":show import", ":show loaded"])
72+ , (":show a", [])
73+
74+ -- :type should complete values and data constructors in scope
75+ , (":type Control.Monad.Eff.Console.lo", [":type Control.Monad.Eff.Console.log"])
76+ , (":type uni", [":type unit"])
77+ , (":type E", [":type EQ"])
78+
79+ -- :kind should complete types in scope
80+ , (":kind C", [":kind Control.Monad.Eff.Pure"])
81+ , (":kind O", [":kind Ordering"])
82+
83+ -- Only one argument for directives should be completed
84+ , (":show import ", [])
85+ , (":type EQ ", [])
86+ , (":kind Ordering ", [])
87+
88+ -- a few other import tests
89+ , ("impor", ["import"])
90+ , ("import q", ["import qualified"])
91+ , ("import ", map ("import " ++) supportModules ++ ["import qualified"])
92+ , ("import Prelude ", [])
93+
94+ -- String and number literals should not be completed
95+ , ("\"hi", [])
96+ , ("34", [])
97+
98+ -- Identifiers and data constructors should be completed
99+ , ("uni", ["unit"])
100+ , ("Control.Monad.Eff.Class.", ["Control.Monad.Eff.Class.liftEff"])
101+ , ("G", ["GT"])
102+ , ("Prelude.L", ["Prelude.LT"])
103+
104+ -- if a module is imported qualified, values should complete under the
105+ -- qualified name, as well as the original name.
106+ , ("ST.new", ["ST.newSTRef"])
107+ , ("Control.Monad.ST.new", ["Control.Monad.ST.newSTRef"])
108+ ]
109+ where
110+
111+assertCompletedOk :: (String, [String]) -> Assertion
112+assertCompletedOk (line, expecteds) = do
113+ (unusedR, completions) <- runCM (completion' (reverse line, ""))
114+ let unused = reverse unusedR
115+ let actuals = map ((unused ++) . replacement) completions
116+ sort expecteds @=? sort actuals
117+
118+runCM :: CompletionM a -> IO a
119+runCM act = do
120+ psciState <- getPSCiState
121+ fmap fst (runStateT (liftCompletionM act) psciState)
122+
123+getPSCiState :: IO PSCiState
124+getPSCiState = do
125+ cwd <- getCurrentDirectory
126+ let supportDir = cwd </> "tests" </> "support" </> "flattened"
127+ let supportFiles ext = Glob.globDir1 (Glob.compile ("*." ++ ext)) supportDir
128+ pursFiles <- supportFiles "purs"
129+ jsFiles <- supportFiles "js"
130+
131+ modulesOrFirstError <- loadAllModules pursFiles
132+ foreignFiles <- forM jsFiles (\f -> (f,) <$> readFile f)
133+ Right (foreigns, _) <- runExceptT $ runWriterT $ P.parseForeignModulesFromFiles foreignFiles
134+ case modulesOrFirstError of
135+ Left err ->
136+ print err >> exitFailure
137+ Right modules ->
138+ let imports = [controlMonadSTasST, (P.ModuleName [P.ProperName "Prelude"], P.Implicit, Nothing)]
139+ in return (PSCiState [] imports modules foreigns [] [])
140+
141+controlMonadSTasST :: ImportedModule
142+controlMonadSTasST = (s "Control.Monad.ST", P.Implicit, Just (s "ST"))
143+ where
144+ s = P.moduleNameFromString
145+
146+supportModules :: [String]
147+supportModules =
148+ [ "Control.Monad.Eff.Class"
149+ , "Control.Monad.Eff.Console"
150+ , "Control.Monad.Eff"
151+ , "Control.Monad.Eff.Unsafe"
152+ , "Control.Monad.ST"
153+ , "Data.Function"
154+ , "Prelude"
155+ , "Test.Assert"
156+ ]
psci/tests/data/Sample.pursnew file

No changes to the content.

psgo.cabaldeleted−145
@@ -1,145 +0,0 @@
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.cabalnew file+258
@@ -0,0 +1,258 @@
1+name: purescript
2+version: 0.7.2.0
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+ , psci/tests/data/Sample.purs
27+
28+source-repository head
29+ type: git
30+ location: https://github.com/purescript/purescript.git
31+
32+library
33+ build-depends: base >=4.6 && <5,
34+ containers -any,
35+ unordered-containers -any,
36+ dlist -any,
37+ directory >= 1.2,
38+ filepath -any,
39+ mtl >= 2.1.0 && < 2.3.0,
40+ parsec -any,
41+ transformers >= 0.3.0 && < 0.5,
42+ transformers-compat >= 0.3.0,
43+ utf8-string >= 1 && < 2,
44+ pattern-arrows >= 0.0.2 && < 0.1,
45+ time -any,
46+ boxes >= 0.1.4 && < 0.2.0,
47+ aeson >= 0.8 && < 0.9,
48+ vector -any,
49+ bower-json >= 0.7,
50+ aeson-better-errors >= 0.8,
51+ bytestring -any,
52+ text -any,
53+ split -any,
54+ language-javascript == 0.5.*,
55+ syb -any,
56+ Glob >= 0.7 && < 0.8,
57+ process >= 1.2.0 && < 1.3,
58+ safe >= 0.3.9 && < 0.4,
59+ semigroups >= 0.16.2 && < 0.17
60+
61+ exposed-modules: Language.PureScript
62+ Language.PureScript.AST
63+ Language.PureScript.AST.Binders
64+ Language.PureScript.AST.Declarations
65+ Language.PureScript.AST.Operators
66+ Language.PureScript.AST.SourcePos
67+ Language.PureScript.AST.Traversals
68+ Language.PureScript.AST.Exported
69+ Language.PureScript.Bundle
70+ Language.PureScript.CodeGen
71+ Language.PureScript.CodeGen.Externs
72+ Language.PureScript.CodeGen.JS
73+ Language.PureScript.CodeGen.JS.AST
74+ Language.PureScript.CodeGen.JS.Common
75+ Language.PureScript.CodeGen.JS.Optimizer
76+ Language.PureScript.CodeGen.JS.Optimizer.Blocks
77+ Language.PureScript.CodeGen.JS.Optimizer.Common
78+ Language.PureScript.CodeGen.JS.Optimizer.Inliner
79+ Language.PureScript.CodeGen.JS.Optimizer.MagicDo
80+ Language.PureScript.CodeGen.JS.Optimizer.TCO
81+ Language.PureScript.CodeGen.JS.Optimizer.Unused
82+ Language.PureScript.Constants
83+ Language.PureScript.CoreFn
84+ Language.PureScript.CoreFn.Ann
85+ Language.PureScript.CoreFn.Binders
86+ Language.PureScript.CoreFn.Desugar
87+ Language.PureScript.CoreFn.Expr
88+ Language.PureScript.CoreFn.Literals
89+ Language.PureScript.CoreFn.Meta
90+ Language.PureScript.CoreFn.Module
91+ Language.PureScript.CoreFn.Traversals
92+ Language.PureScript.Comments
93+ Language.PureScript.Environment
94+ Language.PureScript.Errors
95+ Language.PureScript.Kinds
96+ Language.PureScript.Linter
97+ Language.PureScript.Linter.Exhaustive
98+ Language.PureScript.Make
99+ Language.PureScript.ModuleDependencies
100+ Language.PureScript.Names
101+ Language.PureScript.Options
102+ Language.PureScript.Parser
103+ Language.PureScript.Parser.Lexer
104+ Language.PureScript.Parser.Common
105+ Language.PureScript.Parser.Declarations
106+ Language.PureScript.Parser.JS
107+ Language.PureScript.Parser.Kinds
108+ Language.PureScript.Parser.State
109+ Language.PureScript.Parser.Types
110+ Language.PureScript.Pretty
111+ Language.PureScript.Pretty.Common
112+ Language.PureScript.Pretty.JS
113+ Language.PureScript.Pretty.Kinds
114+ Language.PureScript.Pretty.Types
115+ Language.PureScript.Pretty.Values
116+ Language.PureScript.Renamer
117+ Language.PureScript.Sugar
118+ Language.PureScript.Sugar.BindingGroups
119+ Language.PureScript.Sugar.CaseDeclarations
120+ Language.PureScript.Sugar.DoNotation
121+ Language.PureScript.Sugar.Names
122+ Language.PureScript.Sugar.ObjectWildcards
123+ Language.PureScript.Sugar.Operators
124+ Language.PureScript.Sugar.TypeClasses
125+ Language.PureScript.Sugar.TypeDeclarations
126+ Language.PureScript.Traversals
127+ Language.PureScript.TypeChecker
128+ Language.PureScript.TypeChecker.Entailment
129+ Language.PureScript.TypeChecker.Kinds
130+ Language.PureScript.TypeChecker.Monad
131+ Language.PureScript.TypeChecker.Rows
132+ Language.PureScript.TypeChecker.Skolems
133+ Language.PureScript.TypeChecker.Subsumption
134+ Language.PureScript.TypeChecker.Synonyms
135+ Language.PureScript.TypeChecker.Types
136+ Language.PureScript.TypeChecker.Unify
137+ Language.PureScript.TypeClassDictionaries
138+ Language.PureScript.Types
139+
140+ Language.PureScript.Docs
141+ Language.PureScript.Docs.Convert
142+ Language.PureScript.Docs.Render
143+ Language.PureScript.Docs.Types
144+ Language.PureScript.Docs.RenderedCode
145+ Language.PureScript.Docs.RenderedCode.Types
146+ Language.PureScript.Docs.RenderedCode.Render
147+ Language.PureScript.Docs.AsMarkdown
148+ Language.PureScript.Docs.ParseAndDesugar
149+ Language.PureScript.Docs.Utils.MonoidExtras
150+
151+ Language.PureScript.Publish
152+ Language.PureScript.Publish.Utils
153+ Language.PureScript.Publish.ErrorsWarnings
154+ Language.PureScript.Publish.BoxesHelpers
155+
156+ Control.Monad.Unify
157+ Control.Monad.Supply
158+ Control.Monad.Supply.Class
159+
160+ exposed: True
161+ buildable: True
162+ hs-source-dirs: src
163+ other-modules: Paths_purescript
164+ ghc-options: -Wall -O2
165+
166+executable psc
167+ build-depends: base >=4 && <5, containers -any, directory -any, filepath -any,
168+ mtl -any, optparse-applicative >= 0.10.0, parsec -any, purescript -any,
169+ time -any, transformers -any, transformers-compat -any, Glob >= 0.7 && < 0.8
170+ main-is: Main.hs
171+ buildable: True
172+ hs-source-dirs: psc
173+ ghc-options: -Wall -O2 -fno-warn-unused-do-bind
174+
175+executable psci
176+ build-depends: base >=4 && <5, containers -any, directory -any, filepath -any,
177+ mtl -any, optparse-applicative >= 0.10.0, parsec -any,
178+ haskeline >= 0.7.0.0, purescript -any, transformers -any,
179+ transformers-compat -any, process -any, time -any, Glob -any
180+
181+ main-is: Main.hs
182+ buildable: True
183+ hs-source-dirs: psci psci/main
184+ other-modules: Types
185+ Parser
186+ Directive
187+ Completion
188+ PSCi
189+ IO
190+ ghc-options: -Wall -O2
191+
192+executable psc-docs
193+ build-depends: base >=4 && <5, purescript -any,
194+ optparse-applicative >= 0.10.0, process -any, mtl -any,
195+ split -any, ansi-wl-pprint -any, directory -any,
196+ filepath -any, Glob -any
197+ main-is: Main.hs
198+ buildable: True
199+ hs-source-dirs: psc-docs
200+ other-modules: Ctags
201+ Etags
202+ Tags
203+ ghc-options: -Wall -O2
204+
205+executable psc-publish
206+ build-depends: base >=4 && <5, purescript -any, bytestring -any, aeson -any, optparse-applicative -any
207+ main-is: Main.hs
208+ buildable: True
209+ hs-source-dirs: psc-publish
210+ ghc-options: -Wall -O2
211+
212+executable psc-hierarchy
213+ build-depends: base >=4 && <5, purescript -any, optparse-applicative >= 0.10.0,
214+ process -any, mtl -any, parsec -any, filepath -any, directory -any,
215+ Glob -any
216+ main-is: Main.hs
217+ buildable: True
218+ hs-source-dirs: hierarchy
219+ other-modules:
220+ ghc-options: -Wall -O2
221+
222+executable psc-bundle
223+ main-is: Main.hs
224+ other-modules:
225+ other-extensions:
226+ build-depends: base >=4 && <5,
227+ purescript -any,
228+ filepath -any,
229+ directory -any,
230+ mtl -any,
231+ transformers -any,
232+ transformers-compat -any,
233+ optparse-applicative >= 0.10.0,
234+ Glob -any
235+ ghc-options: -Wall -O2
236+ hs-source-dirs: psc-bundle
237+
238+test-suite tests
239+ build-depends: base >=4 && <5, containers -any, directory -any,
240+ filepath -any, mtl -any, parsec -any, purescript -any,
241+ transformers -any, process -any, transformers-compat -any, time -any,
242+ Glob -any
243+ type: exitcode-stdio-1.0
244+ main-is: Main.hs
245+ buildable: True
246+ hs-source-dirs: tests
247+
248+test-suite psci-tests
249+ build-depends: base >=4 && <5, containers -any, directory -any, filepath -any,
250+ mtl -any, optparse-applicative >= 0.10.0, parsec -any,
251+ haskeline >= 0.7.0.0, purescript -any, transformers -any,
252+ transformers-compat -any, process -any, HUnit -any, time -any,
253+ Glob -any
254+ type: exitcode-stdio-1.0
255+ main-is: Main.hs
256+ buildable: True
257+ hs-source-dirs: psci psci/tests
258+ ghc-options: -Wall
src/CodeGen/IL.hsdeleted−321
@@ -1,321 +0,0 @@
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.hsdeleted−196
@@ -1,196 +0,0 @@
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.hsdeleted−81
@@ -1,81 +0,0 @@
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.hsdeleted−18
@@ -1,18 +0,0 @@
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.hsdeleted−435
@@ -1,435 +0,0 @@
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.hsdeleted−146
@@ -1,146 +0,0 @@
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.hsdeleted−141
@@ -1,141 +0,0 @@
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.hsdeleted−527
@@ -1,527 +0,0 @@
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.hsnew file+43
@@ -0,0 +1,43 @@
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+
18+module Control.Monad.Supply where
19+
20+import Data.Functor.Identity
21+
22+import Control.Applicative
23+import Control.Monad.State
24+import Control.Monad.Error.Class (MonadError(..))
25+import Control.Monad.Reader
26+import Control.Monad.Writer
27+
28+newtype SupplyT m a = SupplyT { unSupplyT :: StateT Integer m a }
29+ deriving (Functor, Applicative, Monad, MonadTrans, MonadError e, MonadWriter w, MonadReader r)
30+
31+runSupplyT :: Integer -> SupplyT m a -> m (a, Integer)
32+runSupplyT n = flip runStateT n . unSupplyT
33+
34+evalSupplyT :: (Functor m) => Integer -> SupplyT m a -> m a
35+evalSupplyT n = fmap fst . runSupplyT n
36+
37+type Supply = SupplyT Identity
38+
39+runSupply :: Integer -> Supply a -> (a, Integer)
40+runSupply n = runIdentity . runSupplyT n
41+
42+evalSupply :: Integer -> Supply a -> a
43+evalSupply n = runIdentity . evalSupplyT n
src/Control/Monad/Supply/Class.hsnew file+36
@@ -0,0 +1,36 @@
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.hsnew file+159
@@ -0,0 +1,159 @@
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+
32+import Data.HashMap.Strict as M
33+
34+-- |
35+-- Untyped unification variables
36+--
37+type Unknown = Int
38+
39+-- |
40+-- A type which can contain unification variables
41+--
42+class Partial t where
43+ unknown :: Unknown -> t
44+ isUnknown :: t -> Maybe Unknown
45+ unknowns :: t -> [Unknown]
46+ ($?) :: Substitution t -> t -> t
47+
48+-- |
49+-- Identifies types which support unification
50+--
51+class (Partial t) => Unifiable m t | t -> m where
52+ (=?=) :: t -> t -> UnifyT t m ()
53+
54+-- |
55+-- A substitution maintains a mapping from unification variables to their values
56+--
57+data Substitution t = Substitution { runSubstitution :: M.HashMap Int t }
58+
59+instance (Partial t) => Monoid (Substitution t) where
60+ mempty = Substitution M.empty
61+ s1 `mappend` s2 = Substitution $
62+ M.map (s2 $?) (runSubstitution s1) `M.union`
63+ M.map (s1 $?) (runSubstitution s2)
64+
65+-- |
66+-- State required for type checking
67+--
68+data UnifyState t = UnifyState {
69+ -- |
70+ -- The next fresh unification variable
71+ --
72+ unifyNextVar :: Int
73+ -- |
74+ -- The current substitution
75+ --
76+ , unifyCurrentSubstitution :: Substitution t
77+ }
78+
79+-- |
80+-- An empty @UnifyState@
81+--
82+defaultUnifyState :: (Partial t) => UnifyState t
83+defaultUnifyState = UnifyState 0 mempty
84+
85+-- |
86+-- A class for errors which support unification errors
87+--
88+class UnificationError t e where
89+ occursCheckFailed :: t -> e
90+
91+-- |
92+-- The type checking monad, which provides the state of the type checker, and error reporting capabilities
93+--
94+newtype UnifyT t m a = UnifyT { unUnify :: StateT (UnifyState t) m a }
95+ deriving (Functor, Monad, Applicative, Alternative, MonadPlus)
96+
97+instance (MonadState s m) => MonadState s (UnifyT t m) where
98+ get = UnifyT . lift $ get
99+ put = UnifyT . lift . put
100+
101+instance (MonadError e m) => MonadError e (UnifyT t m) where
102+ throwError = UnifyT . throwError
103+ catchError e f = UnifyT $ catchError (unUnify e) (unUnify . f)
104+
105+-- |
106+-- Run a computation in the Unify monad, failing with an error, or succeeding with a return value and the new next unification variable
107+--
108+runUnify :: UnifyState t -> UnifyT t m a -> m (a, UnifyState t)
109+runUnify s = flip runStateT s . unUnify
110+
111+-- |
112+-- Substitute a single unification variable
113+--
114+substituteOne :: (Partial t) => Unknown -> t -> Substitution t
115+substituteOne u t = Substitution $ M.singleton u t
116+
117+-- |
118+-- Replace a unification variable with the specified value in the current substitution
119+--
120+(=:=) :: (UnificationError t e, Monad m, MonadError e m, Unifiable m t) => Unknown -> t -> UnifyT t m ()
121+(=:=) u t' = do
122+ st <- UnifyT get
123+ let sub = unifyCurrentSubstitution st
124+ let t = sub $? t'
125+ occursCheck u t
126+ let current = sub $? unknown u
127+ case isUnknown current of
128+ Just u1 | u1 == u -> return ()
129+ _ -> current =?= t
130+ UnifyT $ modify $ \s -> s { unifyCurrentSubstitution = substituteOne u t <> unifyCurrentSubstitution s }
131+
132+-- |
133+-- Perform the occurs check, to make sure a unification variable does not occur inside a value
134+--
135+occursCheck :: (UnificationError t e, Monad m, MonadError e m, Partial t) => Unknown -> t -> UnifyT t m ()
136+occursCheck u t =
137+ case isUnknown t of
138+ Nothing -> when (u `elem` unknowns t) $ UnifyT . lift . throwError $ occursCheckFailed t
139+ _ -> return ()
140+
141+-- |
142+-- Generate a fresh untyped unification variable
143+--
144+fresh' :: (Monad m) => UnifyT t m Unknown
145+fresh' = do
146+ st <- UnifyT get
147+ UnifyT $ modify $ \s -> s { unifyNextVar = succ (unifyNextVar s) }
148+ return $ unifyNextVar st
149+
150+-- |
151+-- Generate a fresh unification variable at a specific type
152+--
153+fresh :: (Monad m, Partial t) => UnifyT t m t
154+fresh = do
155+ u <- fresh'
156+ return $ unknown u
157+
158+
159+
src/Language/PureScript.hsnew file+49
@@ -0,0 +1,49 @@
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
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.hsnew file+24
@@ -0,0 +1,24 @@
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.hsnew file+86
@@ -0,0 +1,86 @@
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+
25+-- |
26+-- Data type for binders
27+--
28+data Binder
29+ -- |
30+ -- Wildcard binder
31+ --
32+ = NullBinder
33+ -- |
34+ -- A binder which matches a boolean literal
35+ --
36+ | BooleanBinder Bool
37+ -- |
38+ -- A binder which matches a string literal
39+ --
40+ | StringBinder String
41+ -- |
42+ -- A binder which matches a character literal
43+ --
44+ | CharBinder Char
45+ -- |
46+ -- A binder which matches a numeric literal
47+ --
48+ | NumberBinder (Either Integer Double)
49+ -- |
50+ -- A binder which binds an identifier
51+ --
52+ | VarBinder Ident
53+ -- |
54+ -- A binder which matches a data constructor
55+ --
56+ | ConstructorBinder (Qualified ProperName) [Binder]
57+ -- |
58+ -- A binder which matches a record and binds its properties
59+ --
60+ | ObjectBinder [(String, Binder)]
61+ -- |
62+ -- A binder which matches an array and binds its elements
63+ --
64+ | ArrayBinder [Binder]
65+ -- |
66+ -- A binder which binds its input to an identifier
67+ --
68+ | NamedBinder Ident Binder
69+ -- |
70+ -- A binder with source position information
71+ --
72+ | PositionedBinder SourceSpan [Comment] Binder deriving (Show, Eq, D.Data, D.Typeable)
73+
74+-- |
75+-- Collect all names introduced in binders in an expression
76+--
77+binderNames :: Binder -> [Ident]
78+binderNames = go []
79+ where
80+ go ns (VarBinder name) = name : ns
81+ go ns (ConstructorBinder _ bs) = foldl go ns bs
82+ go ns (ObjectBinder bs) = foldl go ns (map snd bs)
83+ go ns (ArrayBinder bs) = foldl go ns bs
84+ go ns (NamedBinder name b) = go (name : ns) b
85+ go ns (PositionedBinder _ _ b) = go ns b
86+ go ns _ = ns
src/Language/PureScript/AST/Declarations.hsnew file+416
@@ -0,0 +1,416 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.AST.Declarations
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+-- | Data types for modules and declarations
12+--
13+-----------------------------------------------------------------------------
14+
15+{-# LANGUAGE DeriveDataTypeable, ScopedTypeVariables #-}
16+
17+module Language.PureScript.AST.Declarations where
18+
19+import qualified Data.Data as D
20+import qualified Data.Map as M
21+
22+import Language.PureScript.AST.Binders
23+import Language.PureScript.AST.Operators
24+import Language.PureScript.AST.SourcePos
25+import Language.PureScript.Types
26+import Language.PureScript.Names
27+import Language.PureScript.Kinds
28+import Language.PureScript.TypeClassDictionaries
29+import Language.PureScript.Comments
30+import Language.PureScript.Environment
31+
32+-- |
33+-- A module declaration, consisting of comments about the module, a module name,
34+-- a list of declarations, and a list of the declarations that are
35+-- explicitly exported. If the export list is Nothing, everything is exported.
36+--
37+data Module = Module [Comment] ModuleName [Declaration] (Maybe [DeclarationRef]) deriving (Show, D.Data, D.Typeable)
38+
39+-- | Return a module's name.
40+getModuleName :: Module -> ModuleName
41+getModuleName (Module _ name _ _) = name
42+
43+-- |
44+-- An item in a list of explicit imports or exports
45+--
46+data DeclarationRef
47+ -- |
48+ -- A type constructor with data constructors
49+ --
50+ = TypeRef ProperName (Maybe [ProperName])
51+ -- |
52+ -- A value
53+ --
54+ | ValueRef Ident
55+ -- |
56+ -- A type class
57+ --
58+ | TypeClassRef ProperName
59+ -- |
60+ -- A type class instance, created during typeclass desugaring (name, class name, instance types)
61+ --
62+ | TypeInstanceRef Ident
63+ -- |
64+ -- A module, in its entirety
65+ --
66+ | ModuleRef ModuleName
67+ -- |
68+ -- A declaration reference with source position information
69+ --
70+ | PositionedDeclarationRef SourceSpan [Comment] DeclarationRef
71+ deriving (Show, D.Data, D.Typeable)
72+
73+instance Eq DeclarationRef where
74+ (TypeRef name dctors) == (TypeRef name' dctors') = name == name' && dctors == dctors'
75+ (ValueRef name) == (ValueRef name') = name == name'
76+ (TypeClassRef name) == (TypeClassRef name') = name == name'
77+ (TypeInstanceRef name) == (TypeInstanceRef name') = name == name'
78+ (ModuleRef name) == (ModuleRef name') = name == name'
79+ (PositionedDeclarationRef _ _ r) == r' = r == r'
80+ r == (PositionedDeclarationRef _ _ r') = r == r'
81+ _ == _ = False
82+
83+-- |
84+-- The data type which specifies type of import declaration
85+--
86+data ImportDeclarationType
87+ -- |
88+ -- An import with no explicit list: `import M`
89+ --
90+ = Implicit
91+ -- |
92+ -- An import with an explicit list of references to import: `import M (foo)`
93+ --
94+ | Explicit [DeclarationRef]
95+ -- |
96+ -- An import with a list of references to hide: `import M hiding (foo)`
97+ --
98+ | Hiding [DeclarationRef]
99+ deriving (Show, D.Data, D.Typeable)
100+
101+-- |
102+-- The data type of declarations
103+--
104+data Declaration
105+ -- |
106+ -- A data type declaration (data or newtype, name, arguments, data constructors)
107+ --
108+ = DataDeclaration DataDeclType ProperName [(String, Maybe Kind)] [(ProperName, [Type])]
109+ -- |
110+ -- A minimal mutually recursive set of data type declarations
111+ --
112+ | DataBindingGroupDeclaration [Declaration]
113+ -- |
114+ -- A type synonym declaration (name, arguments, type)
115+ --
116+ | TypeSynonymDeclaration ProperName [(String, Maybe Kind)] Type
117+ -- |
118+ -- A type declaration for a value (name, ty)
119+ --
120+ | TypeDeclaration Ident Type
121+ -- |
122+ -- A value declaration (name, top-level binders, optional guard, value)
123+ --
124+ | ValueDeclaration Ident NameKind [Binder] (Either [(Guard, Expr)] Expr)
125+ -- |
126+ -- A minimal mutually recursive set of value declarations
127+ --
128+ | BindingGroupDeclaration [(Ident, NameKind, Expr)]
129+ -- |
130+ -- A foreign import declaration (name, type)
131+ --
132+ | ExternDeclaration Ident Type
133+ -- |
134+ -- A data type foreign import (name, kind)
135+ --
136+ | ExternDataDeclaration ProperName Kind
137+ -- |
138+ -- A type class instance foreign import
139+ --
140+ | ExternInstanceDeclaration Ident [Constraint] (Qualified ProperName) [Type]
141+ -- |
142+ -- A fixity declaration (fixity data, operator name)
143+ --
144+ | FixityDeclaration Fixity String
145+ -- |
146+ -- A module import (module name, qualified/unqualified/hiding, optional "qualified as" name)
147+ --
148+ | ImportDeclaration ModuleName ImportDeclarationType (Maybe ModuleName)
149+ -- |
150+ -- A type class declaration (name, argument, implies, member declarations)
151+ --
152+ | TypeClassDeclaration ProperName [(String, Maybe Kind)] [Constraint] [Declaration]
153+ -- |
154+ -- A type instance declaration (name, dependencies, class name, instance types, member
155+ -- declarations)
156+ --
157+ | TypeInstanceDeclaration Ident [Constraint] (Qualified ProperName) [Type] [Declaration]
158+ -- |
159+ -- A declaration with source position information
160+ --
161+ | PositionedDeclaration SourceSpan [Comment] Declaration
162+ deriving (Show, D.Data, D.Typeable)
163+
164+-- |
165+-- Test if a declaration is a value declaration
166+--
167+isValueDecl :: Declaration -> Bool
168+isValueDecl ValueDeclaration{} = True
169+isValueDecl (PositionedDeclaration _ _ d) = isValueDecl d
170+isValueDecl _ = False
171+
172+-- |
173+-- Test if a declaration is a data type or type synonym declaration
174+--
175+isDataDecl :: Declaration -> Bool
176+isDataDecl DataDeclaration{} = True
177+isDataDecl TypeSynonymDeclaration{} = True
178+isDataDecl (PositionedDeclaration _ _ d) = isDataDecl d
179+isDataDecl _ = False
180+
181+-- |
182+-- Test if a declaration is a module import
183+--
184+isImportDecl :: Declaration -> Bool
185+isImportDecl ImportDeclaration{} = True
186+isImportDecl (PositionedDeclaration _ _ d) = isImportDecl d
187+isImportDecl _ = False
188+
189+-- |
190+-- Test if a declaration is a data type foreign import
191+--
192+isExternDataDecl :: Declaration -> Bool
193+isExternDataDecl ExternDataDeclaration{} = True
194+isExternDataDecl (PositionedDeclaration _ _ d) = isExternDataDecl d
195+isExternDataDecl _ = False
196+
197+-- |
198+-- Test if a declaration is a type class instance foreign import
199+--
200+isExternInstanceDecl :: Declaration -> Bool
201+isExternInstanceDecl ExternInstanceDeclaration{} = True
202+isExternInstanceDecl (PositionedDeclaration _ _ d) = isExternInstanceDecl d
203+isExternInstanceDecl _ = False
204+
205+-- |
206+-- Test if a declaration is a fixity declaration
207+--
208+isFixityDecl :: Declaration -> Bool
209+isFixityDecl FixityDeclaration{} = True
210+isFixityDecl (PositionedDeclaration _ _ d) = isFixityDecl d
211+isFixityDecl _ = False
212+
213+-- |
214+-- Test if a declaration is a foreign import
215+--
216+isExternDecl :: Declaration -> Bool
217+isExternDecl ExternDeclaration{} = True
218+isExternDecl (PositionedDeclaration _ _ d) = isExternDecl d
219+isExternDecl _ = False
220+
221+-- |
222+-- Test if a declaration is a type class instance declaration
223+--
224+isTypeClassInstanceDeclaration :: Declaration -> Bool
225+isTypeClassInstanceDeclaration TypeInstanceDeclaration{} = True
226+isTypeClassInstanceDeclaration (PositionedDeclaration _ _ d) = isTypeClassInstanceDeclaration d
227+isTypeClassInstanceDeclaration _ = False
228+
229+-- |
230+-- Test if a declaration is a type class declaration
231+--
232+isTypeClassDeclaration :: Declaration -> Bool
233+isTypeClassDeclaration TypeClassDeclaration{} = True
234+isTypeClassDeclaration (PositionedDeclaration _ _ d) = isTypeClassDeclaration d
235+isTypeClassDeclaration _ = False
236+
237+-- |
238+-- Recursively flatten data binding groups in the list of declarations
239+flattenDecls :: [Declaration] -> [Declaration]
240+flattenDecls = concatMap flattenOne
241+ where flattenOne :: Declaration -> [Declaration]
242+ flattenOne (DataBindingGroupDeclaration decls) = concatMap flattenOne decls
243+ flattenOne d = [d]
244+
245+-- |
246+-- A guard is just a boolean-valued expression that appears alongside a set of binders
247+--
248+type Guard = Expr
249+
250+-- |
251+-- Data type for expressions and terms
252+--
253+data Expr
254+ -- |
255+ -- A numeric literal
256+ --
257+ = NumericLiteral (Either Integer Double)
258+ -- |
259+ -- A string literal
260+ --
261+ | StringLiteral String
262+ -- |
263+ -- A character literal
264+ --
265+ | CharLiteral Char
266+ -- |
267+ -- A boolean literal
268+ --
269+ | BooleanLiteral Bool
270+ -- |
271+ -- A prefix -, will be desugared
272+ --
273+ | UnaryMinus Expr
274+ -- |
275+ -- Binary operator application. During the rebracketing phase of desugaring, this data constructor
276+ -- will be removed.
277+ --
278+ | BinaryNoParens Expr Expr Expr
279+ -- |
280+ -- Explicit parentheses. During the rebracketing phase of desugaring, this data constructor
281+ -- will be removed.
282+ --
283+ | Parens Expr
284+ -- |
285+ -- Operator section. This will be removed during desugaring and replaced with a partially applied
286+ -- operator or lambda to flip the arguments.
287+ --
288+ | OperatorSection Expr (Either Expr Expr)
289+ -- |
290+ -- An array literal
291+ --
292+ | ArrayLiteral [Expr]
293+ -- |
294+ -- An object literal
295+ --
296+ | ObjectLiteral [(String, Expr)]
297+ -- |
298+ -- An object constructor (object literal with underscores). This will be removed during
299+ -- desugaring and expanded into a lambda that returns an object literal.
300+ --
301+ | ObjectConstructor [(String, Maybe Expr)]
302+ -- |
303+ -- An object property getter (e.g. `_.x`). This will be removed during
304+ -- desugaring and expanded into a lambda that reads a property from an object.
305+ --
306+ | ObjectGetter String
307+ -- |
308+ -- An record property accessor expression
309+ --
310+ | Accessor String Expr
311+ -- |
312+ -- Partial record update
313+ --
314+ | ObjectUpdate Expr [(String, Expr)]
315+ -- |
316+ -- Partial record updater. This will be removed during desugaring and
317+ -- expanded into a lambda that returns an object update.
318+ --
319+ | ObjectUpdater (Maybe Expr) [(String, Maybe Expr)]
320+ -- |
321+ -- Function introduction
322+ --
323+ | Abs (Either Ident Binder) Expr
324+ -- |
325+ -- Function application
326+ --
327+ | App Expr Expr
328+ -- |
329+ -- Variable
330+ --
331+ | Var (Qualified Ident)
332+ -- |
333+ -- Conditional (if-then-else expression)
334+ --
335+ | IfThenElse Expr Expr Expr
336+ -- |
337+ -- A data constructor
338+ --
339+ | Constructor (Qualified ProperName)
340+ -- |
341+ -- A case expression. During the case expansion phase of desugaring, top-level binders will get
342+ -- desugared into case expressions, hence the need for guards and multiple binders per branch here.
343+ --
344+ | Case [Expr] [CaseAlternative]
345+ -- |
346+ -- A value with a type annotation
347+ --
348+ | TypedValue Bool Expr Type
349+ -- |
350+ -- A let binding
351+ --
352+ | Let [Declaration] Expr
353+ -- |
354+ -- A do-notation block
355+ --
356+ | Do [DoNotationElement]
357+ -- |
358+ -- An application of a typeclass dictionary constructor. The value should be
359+ -- an ObjectLiteral.
360+ --
361+ | TypeClassDictionaryConstructorApp (Qualified ProperName) Expr
362+ -- |
363+ -- A placeholder for a type class dictionary to be inserted later. At the end of type checking, these
364+ -- placeholders will be replaced with actual expressions representing type classes dictionaries which
365+ -- can be evaluated at runtime. The constructor arguments represent (in order): whether or not to look
366+ -- at superclass implementations when searching for a dictionary, the type class name and
367+ -- instance type, and the type class dictionaries in scope.
368+ --
369+ | TypeClassDictionary Bool Constraint (M.Map (Maybe ModuleName) (M.Map (Qualified ProperName) (M.Map (Qualified Ident) TypeClassDictionaryInScope)))
370+ -- |
371+ -- A typeclass dictionary accessor, the implementation is left unspecified until CoreFn desugaring.
372+ --
373+ | TypeClassDictionaryAccessor (Qualified ProperName) Ident
374+ -- |
375+ -- A placeholder for a superclass dictionary to be turned into a TypeClassDictionary during typechecking
376+ --
377+ | SuperClassDictionary (Qualified ProperName) [Type]
378+ -- |
379+ -- A value with source position information
380+ --
381+ | PositionedValue SourceSpan [Comment] Expr deriving (Show, D.Data, D.Typeable)
382+
383+-- |
384+-- An alternative in a case statement
385+--
386+data CaseAlternative = CaseAlternative
387+ { -- |
388+ -- A collection of binders with which to match the inputs
389+ --
390+ caseAlternativeBinders :: [Binder]
391+ -- |
392+ -- The result expression or a collect of guarded expressions
393+ --
394+ , caseAlternativeResult :: Either [(Guard, Expr)] Expr
395+ } deriving (Show, D.Data, D.Typeable)
396+
397+-- |
398+-- A statement in a do-notation block
399+--
400+data DoNotationElement
401+ -- |
402+ -- A monadic value without a binder
403+ --
404+ = DoNotationValue Expr
405+ -- |
406+ -- A monadic value with a binder
407+ --
408+ | DoNotationBind Binder Expr
409+ -- |
410+ -- A let statement, i.e. a pure value with a binder
411+ --
412+ | DoNotationLet [Declaration]
413+ -- |
414+ -- A do notation element with source position information
415+ --
416+ | PositionedDoNotationElement SourceSpan [Comment] DoNotationElement deriving (Show, D.Data, D.Typeable)
src/Language/PureScript/AST/Exported.hsnew file+136
@@ -0,0 +1,136 @@
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) = any (== n) 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.hsnew file+51
@@ -0,0 +1,51 @@
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 (Eq, Ord, D.Data, D.Typeable)
33+
34+instance Show Associativity where
35+ show Infixl = "infixl"
36+ show Infixr = "infixr"
37+ show Infix = "infix"
38+
39+instance A.ToJSON Associativity where
40+ toJSON = A.toJSON . show
41+
42+-- |
43+-- Fixity data for infix operators
44+--
45+data Fixity = Fixity Associativity Precedence deriving (Show, Eq, Ord, D.Data, D.Typeable)
46+
47+instance A.ToJSON Fixity where
48+ toJSON (Fixity associativity precedence) =
49+ A.object [ "associativity" .= associativity
50+ , "precedence" .= precedence
51+ ]
src/Language/PureScript/AST/SourcePos.hsnew file+75
@@ -0,0 +1,75 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.AST.SourcePos
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+-- | Source position information
12+--
13+-----------------------------------------------------------------------------
14+
15+{-# LANGUAGE DeriveDataTypeable, ScopedTypeVariables, RecordWildCards, OverloadedStrings #-}
16+
17+module Language.PureScript.AST.SourcePos where
18+
19+import qualified Data.Data as D
20+import Data.Aeson ((.=))
21+import qualified Data.Aeson as A
22+
23+-- |
24+-- Source position information
25+--
26+data SourcePos = SourcePos
27+ { -- |
28+ -- Line number
29+ --
30+ sourcePosLine :: Int
31+ -- |
32+ -- Column number
33+ --
34+ , sourcePosColumn :: Int
35+ } deriving (Eq, Ord, Show, D.Data, D.Typeable)
36+
37+displaySourcePos :: SourcePos -> String
38+displaySourcePos sp =
39+ "line " ++ show (sourcePosLine sp) ++
40+ ", column " ++ show (sourcePosColumn sp)
41+
42+instance A.ToJSON SourcePos where
43+ toJSON SourcePos{..} =
44+ A.toJSON [sourcePosLine, sourcePosColumn]
45+
46+data SourceSpan = SourceSpan
47+ { -- |
48+ -- Source name
49+ --
50+ spanName :: String
51+ -- |
52+ -- Start of the span
53+ --
54+ , spanStart :: SourcePos
55+ -- End of the span
56+ --
57+ , spanEnd :: SourcePos
58+ } deriving (Eq, Ord, Show, D.Data, D.Typeable)
59+
60+displayStartEndPos :: SourceSpan -> String
61+displayStartEndPos sp =
62+ displaySourcePos (spanStart sp) ++ " - " ++
63+ displaySourcePos (spanEnd sp)
64+
65+displaySourceSpan :: SourceSpan -> String
66+displaySourceSpan sp =
67+ spanName sp ++ " " ++
68+ displayStartEndPos sp
69+
70+instance A.ToJSON SourceSpan where
71+ toJSON SourceSpan{..} =
72+ A.object [ "name" .= spanName
73+ , "start" .= spanStart
74+ , "end" .= spanEnd
75+ ]
src/Language/PureScript/AST/Traversals.hsnew file+401
@@ -0,0 +1,401 @@
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+module Language.PureScript.AST.Traversals where
16+
17+import Data.Monoid (Monoid(..), mconcat)
18+import Data.Maybe (mapMaybe)
19+
20+import Control.Applicative
21+import Control.Monad
22+import Control.Arrow ((***), (+++), second)
23+
24+import Language.PureScript.AST.Binders
25+import Language.PureScript.AST.Declarations
26+import Language.PureScript.Types
27+import Language.PureScript.Traversals
28+
29+everywhereOnValues :: (Declaration -> Declaration) ->
30+ (Expr -> Expr) ->
31+ (Binder -> Binder) ->
32+ (Declaration -> Declaration, Expr -> Expr, Binder -> Binder)
33+everywhereOnValues f g h = (f', g', h')
34+ where
35+ f' :: Declaration -> Declaration
36+ f' (DataBindingGroupDeclaration ds) = f (DataBindingGroupDeclaration (map f' ds))
37+ f' (ValueDeclaration name nameKind bs val) = f (ValueDeclaration name nameKind (map h' bs) ((map (g' *** g') +++ g') val))
38+ f' (BindingGroupDeclaration ds) = f (BindingGroupDeclaration (map (\(name, nameKind, val) -> (name, nameKind, g' val)) ds))
39+ f' (TypeClassDeclaration name args implies ds) = f (TypeClassDeclaration name args implies (map f' ds))
40+ f' (TypeInstanceDeclaration name cs className args ds) = f (TypeInstanceDeclaration name cs className args (map f' ds))
41+ f' (PositionedDeclaration pos com d) = f (PositionedDeclaration pos com (f' d))
42+ f' other = f other
43+
44+ g' :: Expr -> Expr
45+ g' (UnaryMinus v) = g (UnaryMinus (g' v))
46+ g' (BinaryNoParens op v1 v2) = g (BinaryNoParens (g' op) (g' v1) (g' v2))
47+ g' (Parens v) = g (Parens (g' v))
48+ g' (OperatorSection op (Left v)) = g (OperatorSection (g' op) (Left $ g' v))
49+ g' (OperatorSection op (Right v)) = g (OperatorSection (g' op) (Right $ g' v))
50+ g' (ArrayLiteral vs) = g (ArrayLiteral (map g' vs))
51+ g' (ObjectLiteral vs) = g (ObjectLiteral (map (fmap g') vs))
52+ g' (ObjectConstructor vs) = g (ObjectConstructor (map (second (fmap g')) vs))
53+ g' (TypeClassDictionaryConstructorApp name v) = g (TypeClassDictionaryConstructorApp name (g' v))
54+ g' (Accessor prop v) = g (Accessor prop (g' v))
55+ g' (ObjectUpdate obj vs) = g (ObjectUpdate (g' obj) (map (fmap g') vs))
56+ g' (ObjectUpdater obj vs) = g (ObjectUpdater (fmap g' obj) (map (second (fmap g')) vs))
57+ g' (Abs name v) = g (Abs name (g' v))
58+ g' (App v1 v2) = g (App (g' v1) (g' v2))
59+ g' (IfThenElse v1 v2 v3) = g (IfThenElse (g' v1) (g' v2) (g' v3))
60+ g' (Case vs alts) = g (Case (map g' vs) (map handleCaseAlternative alts))
61+ g' (TypedValue check v ty) = g (TypedValue check (g' v) ty)
62+ g' (Let ds v) = g (Let (map f' ds) (g' v))
63+ g' (Do es) = g (Do (map handleDoNotationElement es))
64+ g' (PositionedValue pos com v) = g (PositionedValue pos com (g' v))
65+ g' other = g other
66+
67+ h' :: Binder -> Binder
68+ h' (ConstructorBinder ctor bs) = h (ConstructorBinder ctor (map h' bs))
69+ h' (ObjectBinder bs) = h (ObjectBinder (map (fmap h') bs))
70+ h' (ArrayBinder bs) = h (ArrayBinder (map h' bs))
71+ h' (NamedBinder name b) = h (NamedBinder name (h' b))
72+ h' (PositionedBinder pos com b) = h (PositionedBinder pos com (h' b))
73+ h' other = h other
74+
75+ handleCaseAlternative :: CaseAlternative -> CaseAlternative
76+ handleCaseAlternative ca =
77+ ca { caseAlternativeBinders = map h' (caseAlternativeBinders ca)
78+ , caseAlternativeResult = (map (g' *** g') +++ g') (caseAlternativeResult ca)
79+ }
80+
81+ handleDoNotationElement :: DoNotationElement -> DoNotationElement
82+ handleDoNotationElement (DoNotationValue v) = DoNotationValue (g' v)
83+ handleDoNotationElement (DoNotationBind b v) = DoNotationBind (h' b) (g' v)
84+ handleDoNotationElement (DoNotationLet ds) = DoNotationLet (map f' ds)
85+ handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com (handleDoNotationElement e)
86+
87+everywhereOnValuesTopDownM :: (Functor m, Applicative m, Monad m) =>
88+ (Declaration -> m Declaration) ->
89+ (Expr -> m Expr) ->
90+ (Binder -> m Binder) ->
91+ (Declaration -> m Declaration, Expr -> m Expr, Binder -> m Binder)
92+everywhereOnValuesTopDownM f g h = (f' <=< f, g' <=< g, h' <=< h)
93+ where
94+ f' (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> mapM (f' <=< f) ds
95+ f' (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> mapM (h' <=< h) bs <*> eitherM (mapM (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
96+ f' (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> mapM (\(name, nameKind, val) -> (,,) name nameKind <$> (g val >>= g')) ds
97+ f' (TypeClassDeclaration name args implies ds) = TypeClassDeclaration name args implies <$> mapM (f' <=< f) ds
98+ f' (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> mapM (f' <=< f) ds
99+ f' (PositionedDeclaration pos com d) = PositionedDeclaration pos com <$> (f d >>= f')
100+ f' other = f other
101+
102+ g' (UnaryMinus v) = UnaryMinus <$> (g v >>= g')
103+ g' (BinaryNoParens op v1 v2) = BinaryNoParens <$> (g op >>= g') <*> (g v1 >>= g') <*> (g v2 >>= g')
104+ g' (Parens v) = Parens <$> (g v >>= g')
105+ g' (OperatorSection op (Left v)) = OperatorSection <$> (g op >>= g') <*> (Left <$> (g v >>= g'))
106+ g' (OperatorSection op (Right v)) = OperatorSection <$> (g op >>= g') <*> (Right <$> (g v >>= g'))
107+ g' (ArrayLiteral vs) = ArrayLiteral <$> mapM (g' <=< g) vs
108+ g' (ObjectLiteral vs) = ObjectLiteral <$> mapM (sndM (g' <=< g)) vs
109+ g' (ObjectConstructor vs) = ObjectConstructor <$> mapM (sndM $ maybeM (g' <=< g)) vs
110+ g' (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> (g v >>= g')
111+ g' (Accessor prop v) = Accessor prop <$> (g v >>= g')
112+ g' (ObjectUpdate obj vs) = ObjectUpdate <$> (g obj >>= g') <*> mapM (sndM (g' <=< g)) vs
113+ g' (ObjectUpdater obj vs) = ObjectUpdater <$> (maybeM g obj >>= maybeM g') <*> mapM (sndM $ maybeM (g' <=< g)) vs
114+ g' (Abs name v) = Abs name <$> (g v >>= g')
115+ g' (App v1 v2) = App <$> (g v1 >>= g') <*> (g v2 >>= g')
116+ g' (IfThenElse v1 v2 v3) = IfThenElse <$> (g v1 >>= g') <*> (g v2 >>= g') <*> (g v3 >>= g')
117+ g' (Case vs alts) = Case <$> mapM (g' <=< g) vs <*> mapM handleCaseAlternative alts
118+ g' (TypedValue check v ty) = TypedValue check <$> (g v >>= g') <*> pure ty
119+ g' (Let ds v) = Let <$> mapM (f' <=< f) ds <*> (g v >>= g')
120+ g' (Do es) = Do <$> mapM handleDoNotationElement es
121+ g' (PositionedValue pos com v) = PositionedValue pos com <$> (g v >>= g')
122+ g' other = g other
123+
124+ h' (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> mapM (h' <=< h) bs
125+ h' (ObjectBinder bs) = ObjectBinder <$> mapM (sndM (h' <=< h)) bs
126+ h' (ArrayBinder bs) = ArrayBinder <$> mapM (h' <=< h) bs
127+ h' (NamedBinder name b) = NamedBinder name <$> (h b >>= h')
128+ h' (PositionedBinder pos com b) = PositionedBinder pos com <$> (h b >>= h')
129+ h' other = h other
130+
131+ handleCaseAlternative (CaseAlternative bs val) = CaseAlternative <$> mapM (h' <=< h) bs
132+ <*> eitherM (mapM (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
133+
134+ handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> (g' <=< g) v
135+ handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> (h' <=< h) b <*> (g' <=< g) v
136+ handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> mapM (f' <=< f) ds
137+ handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
138+
139+everywhereOnValuesM :: (Functor m, Applicative m, Monad m) =>
140+ (Declaration -> m Declaration) ->
141+ (Expr -> m Expr) ->
142+ (Binder -> m Binder) ->
143+ (Declaration -> m Declaration, Expr -> m Expr, Binder -> m Binder)
144+everywhereOnValuesM f g h = (f', g', h')
145+ where
146+ f' (DataBindingGroupDeclaration ds) = (DataBindingGroupDeclaration <$> mapM f' ds) >>= f
147+ f' (ValueDeclaration name nameKind bs val) = (ValueDeclaration name nameKind <$> mapM h' bs <*> eitherM (mapM (pairM g' g')) g' val) >>= f
148+ f' (BindingGroupDeclaration ds) = (BindingGroupDeclaration <$> mapM (\(name, nameKind, val) -> (,,) name nameKind <$> g' val) ds) >>= f
149+ f' (TypeClassDeclaration name args implies ds) = (TypeClassDeclaration name args implies <$> mapM f' ds) >>= f
150+ f' (TypeInstanceDeclaration name cs className args ds) = (TypeInstanceDeclaration name cs className args <$> mapM f' ds) >>= f
151+ f' (PositionedDeclaration pos com d) = (PositionedDeclaration pos com <$> f' d) >>= f
152+ f' other = f other
153+
154+ g' (UnaryMinus v) = (UnaryMinus <$> g' v) >>= g
155+ g' (BinaryNoParens op v1 v2) = (BinaryNoParens <$> g' op <*> g' v1 <*> g' v2) >>= g
156+ g' (Parens v) = (Parens <$> g' v) >>= g
157+ g' (OperatorSection op (Left v)) = (OperatorSection <$> g' op <*> (Left <$> g' v)) >>= g
158+ g' (OperatorSection op (Right v)) = (OperatorSection <$> g' op <*> (Right <$> g' v)) >>= g
159+ g' (ArrayLiteral vs) = (ArrayLiteral <$> mapM g' vs) >>= g
160+ g' (ObjectLiteral vs) = (ObjectLiteral <$> mapM (sndM g') vs) >>= g
161+ g' (ObjectConstructor vs) = (ObjectConstructor <$> mapM (sndM $ maybeM g') vs) >>= g
162+ g' (TypeClassDictionaryConstructorApp name v) = (TypeClassDictionaryConstructorApp name <$> g' v) >>= g
163+ g' (Accessor prop v) = (Accessor prop <$> g' v) >>= g
164+ g' (ObjectUpdate obj vs) = (ObjectUpdate <$> g' obj <*> mapM (sndM g') vs) >>= g
165+ g' (ObjectUpdater obj vs) = (ObjectUpdater <$> maybeM g' obj <*> mapM (sndM $ maybeM g') vs) >>= g
166+ g' (Abs name v) = (Abs name <$> g' v) >>= g
167+ g' (App v1 v2) = (App <$> g' v1 <*> g' v2) >>= g
168+ g' (IfThenElse v1 v2 v3) = (IfThenElse <$> g' v1 <*> g' v2 <*> g' v3) >>= g
169+ g' (Case vs alts) = (Case <$> mapM g' vs <*> mapM handleCaseAlternative alts) >>= g
170+ g' (TypedValue check v ty) = (TypedValue check <$> g' v <*> pure ty) >>= g
171+ g' (Let ds v) = (Let <$> mapM f' ds <*> g' v) >>= g
172+ g' (Do es) = (Do <$> mapM handleDoNotationElement es) >>= g
173+ g' (PositionedValue pos com v) = (PositionedValue pos com <$> g' v) >>= g
174+ g' other = g other
175+
176+ h' (ConstructorBinder ctor bs) = (ConstructorBinder ctor <$> mapM h' bs) >>= h
177+ h' (ObjectBinder bs) = (ObjectBinder <$> mapM (sndM h') bs) >>= h
178+ h' (ArrayBinder bs) = (ArrayBinder <$> mapM h' bs) >>= h
179+ h' (NamedBinder name b) = (NamedBinder name <$> h' b) >>= h
180+ h' (PositionedBinder pos com b) = (PositionedBinder pos com <$> h' b) >>= h
181+ h' other = h other
182+
183+ handleCaseAlternative (CaseAlternative bs val) = CaseAlternative <$> mapM h' bs
184+ <*> eitherM (mapM (pairM g' g')) g' val
185+
186+ handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> g' v
187+ handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> h' b <*> g' v
188+ handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> mapM f' ds
189+ handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
190+
191+everythingOnValues :: (r -> r -> r) ->
192+ (Declaration -> r) ->
193+ (Expr -> r) ->
194+ (Binder -> r) ->
195+ (CaseAlternative -> r) ->
196+ (DoNotationElement -> r) ->
197+ (Declaration -> r, Expr -> r, Binder -> r, CaseAlternative -> r, DoNotationElement -> r)
198+everythingOnValues (<>) f g h i j = (f', g', h', i', j')
199+ where
200+ f' d@(DataBindingGroupDeclaration ds) = foldl (<>) (f d) (map f' ds)
201+ f' d@(ValueDeclaration _ _ bs (Right val)) = foldl (<>) (f d) (map h' bs) <> g' val
202+ f' d@(ValueDeclaration _ _ bs (Left gs)) = foldl (<>) (f d) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
203+ f' d@(BindingGroupDeclaration ds) = foldl (<>) (f d) (map (\(_, _, val) -> g' val) ds)
204+ f' d@(TypeClassDeclaration _ _ _ ds) = foldl (<>) (f d) (map f' ds)
205+ f' d@(TypeInstanceDeclaration _ _ _ _ ds) = foldl (<>) (f d) (map f' ds)
206+ f' d@(PositionedDeclaration _ _ d1) = f d <> f' d1
207+ f' d = f d
208+
209+ g' v@(UnaryMinus v1) = g v <> g' v1
210+ g' v@(BinaryNoParens op v1 v2) = g v <> g op <> g' v1 <> g' v2
211+ g' v@(Parens v1) = g v <> g' v1
212+ g' v@(OperatorSection op (Left v1)) = g v <> g op <> g' v1
213+ g' v@(OperatorSection op (Right v1)) = g v <> g op <> g' v1
214+ g' v@(ArrayLiteral vs) = foldl (<>) (g v) (map g' vs)
215+ g' v@(ObjectLiteral vs) = foldl (<>) (g v) (map (g' . snd) vs)
216+ g' v@(ObjectConstructor vs) = foldl (<>) (g v) (map g' (mapMaybe snd vs))
217+ g' v@(TypeClassDictionaryConstructorApp _ v1) = g v <> g' v1
218+ g' v@(Accessor _ v1) = g v <> g' v1
219+ g' v@(ObjectUpdate obj vs) = foldl (<>) (g v <> g' obj) (map (g' . snd) vs)
220+ g' v@(ObjectUpdater obj vs) = foldl (<>) (maybe (g v) (\x -> g v <> g' x) obj) (map g' (mapMaybe snd vs))
221+ g' v@(Abs _ v1) = g v <> g' v1
222+ g' v@(App v1 v2) = g v <> g' v1 <> g' v2
223+ g' v@(IfThenElse v1 v2 v3) = g v <> g' v1 <> g' v2 <> g' v3
224+ g' v@(Case vs alts) = foldl (<>) (foldl (<>) (g v) (map g' vs)) (map i' alts)
225+ g' v@(TypedValue _ v1 _) = g v <> g' v1
226+ g' v@(Let ds v1) = foldl (<>) (g v) (map f' ds) <> g' v1
227+ g' v@(Do es) = foldl (<>) (g v) (map j' es)
228+ g' v@(PositionedValue _ _ v1) = g v <> g' v1
229+ g' v = g v
230+
231+ h' b@(ConstructorBinder _ bs) = foldl (<>) (h b) (map h' bs)
232+ h' b@(ObjectBinder bs) = foldl (<>) (h b) (map (h' . snd) bs)
233+ h' b@(ArrayBinder bs) = foldl (<>) (h b) (map h' bs)
234+ h' b@(NamedBinder _ b1) = h b <> h' b1
235+ h' b@(PositionedBinder _ _ b1) = h b <> h' b1
236+ h' b = h b
237+
238+ i' ca@(CaseAlternative bs (Right val)) = foldl (<>) (i ca) (map h' bs) <> g' val
239+ i' ca@(CaseAlternative bs (Left gs)) = foldl (<>) (i ca) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
240+
241+ j' e@(DoNotationValue v) = j e <> g' v
242+ j' e@(DoNotationBind b v) = j e <> h' b <> g' v
243+ j' e@(DoNotationLet ds) = foldl (<>) (j e) (map f' ds)
244+ j' e@(PositionedDoNotationElement _ _ e1) = j e <> j' e1
245+
246+everythingWithContextOnValues ::
247+ s ->
248+ r ->
249+ (r -> r -> r) ->
250+ (s -> Declaration -> (s, r)) ->
251+ (s -> Expr -> (s, r)) ->
252+ (s -> Binder -> (s, r)) ->
253+ (s -> CaseAlternative -> (s, r)) ->
254+ (s -> DoNotationElement -> (s, r)) ->
255+ ( Declaration -> r
256+ , Expr -> r
257+ , Binder -> r
258+ , CaseAlternative -> r
259+ , DoNotationElement -> r)
260+everythingWithContextOnValues s0 r0 (<>) f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
261+ where
262+ f'' s d = let (s', r) = f s d in r <> f' s' d
263+
264+ f' s (DataBindingGroupDeclaration ds) = foldl (<>) r0 (map (f'' s) ds)
265+ f' s (ValueDeclaration _ _ bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
266+ f' s (ValueDeclaration _ _ bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
267+ f' s (BindingGroupDeclaration ds) = foldl (<>) r0 (map (\(_, _, val) -> g'' s val) ds)
268+ f' s (TypeClassDeclaration _ _ _ ds) = foldl (<>) r0 (map (f'' s) ds)
269+ f' s (TypeInstanceDeclaration _ _ _ _ ds) = foldl (<>) r0 (map (f'' s) ds)
270+ f' s (PositionedDeclaration _ _ d1) = f'' s d1
271+ f' _ _ = r0
272+
273+ g'' s v = let (s', r) = g s v in r <> g' s' v
274+
275+ g' s (UnaryMinus v1) = g'' s v1
276+ g' s (BinaryNoParens op v1 v2) = g'' s op <> g'' s v1 <> g'' s v2
277+ g' s (Parens v1) = g'' s v1
278+ g' s (OperatorSection op (Left v)) = g'' s op <> g'' s v
279+ g' s (OperatorSection op (Right v)) = g'' s op <> g'' s v
280+ g' s (ArrayLiteral vs) = foldl (<>) r0 (map (g'' s) vs)
281+ g' s (ObjectLiteral vs) = foldl (<>) r0 (map (g'' s . snd) vs)
282+ g' s (ObjectConstructor vs) = foldl (<>) r0 (map (g'' s) (mapMaybe snd vs))
283+ g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
284+ g' s (Accessor _ v1) = g'' s v1
285+ g' s (ObjectUpdate obj vs) = foldl (<>) (g'' s obj) (map (g'' s . snd) vs)
286+ g' s (ObjectUpdater obj vs) = foldl (<>) (maybe r0 (g'' s) obj) (map (g'' s) (mapMaybe snd vs))
287+ g' s (Abs _ v1) = g'' s v1
288+ g' s (App v1 v2) = g'' s v1 <> g'' s v2
289+ g' s (IfThenElse v1 v2 v3) = g'' s v1 <> g'' s v2 <> g'' s v3
290+ g' s (Case vs alts) = foldl (<>) (foldl (<>) r0 (map (g'' s) vs)) (map (i'' s) alts)
291+ g' s (TypedValue _ v1 _) = g'' s v1
292+ g' s (Let ds v1) = foldl (<>) r0 (map (f'' s) ds) <> g'' s v1
293+ g' s (Do es) = foldl (<>) r0 (map (j'' s) es)
294+ g' s (PositionedValue _ _ v1) = g'' s v1
295+ g' _ _ = r0
296+
297+ h'' s b = let (s', r) = h s b in r <> h' s' b
298+
299+ h' s (ConstructorBinder _ bs) = foldl (<>) r0 (map (h'' s) bs)
300+ h' s (ObjectBinder bs) = foldl (<>) r0 (map (h'' s . snd) bs)
301+ h' s (ArrayBinder bs) = foldl (<>) r0 (map (h'' s) bs)
302+ h' s (NamedBinder _ b1) = h'' s b1
303+ h' s (PositionedBinder _ _ b1) = h'' s b1
304+ h' _ _ = r0
305+
306+ i'' s ca = let (s', r) = i s ca in r <> i' s' ca
307+
308+ i' s (CaseAlternative bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
309+ i' s (CaseAlternative bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
310+
311+ j'' s e = let (s', r) = j s e in r <> j' s' e
312+
313+ j' s (DoNotationValue v) = g'' s v
314+ j' s (DoNotationBind b v) = h'' s b <> g'' s v
315+ j' s (DoNotationLet ds) = foldl (<>) r0 (map (f'' s) ds)
316+ j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
317+
318+everywhereWithContextOnValuesM :: (Functor m, Applicative m, Monad m) =>
319+ s ->
320+ (s -> Declaration -> m (s, Declaration)) ->
321+ (s -> Expr -> m (s, Expr)) ->
322+ (s -> Binder -> m (s, Binder)) ->
323+ (s -> CaseAlternative -> m (s, CaseAlternative)) ->
324+ (s -> DoNotationElement -> m (s, DoNotationElement)) ->
325+ ( Declaration -> m Declaration
326+ , Expr -> m Expr
327+ , Binder -> m Binder
328+ , CaseAlternative -> m CaseAlternative
329+ , DoNotationElement -> m DoNotationElement)
330+everywhereWithContextOnValuesM s0 f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
331+ where
332+ f'' s = uncurry f' <=< f s
333+
334+ f' s (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> mapM (f'' s) ds
335+ f' s (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> mapM (h'' s) bs <*> eitherM (mapM (pairM (g'' s) (g'' s))) (g'' s) val
336+ f' s (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> mapM (thirdM (g'' s)) ds
337+ f' s (TypeClassDeclaration name args implies ds) = TypeClassDeclaration name args implies <$> mapM (f'' s) ds
338+ f' s (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> mapM (f'' s) ds
339+ f' s (PositionedDeclaration pos com d1) = PositionedDeclaration pos com <$> f'' s d1
340+ f' _ other = return other
341+
342+ g'' s = uncurry g' <=< g s
343+
344+ g' s (UnaryMinus v) = UnaryMinus <$> g'' s v
345+ g' s (BinaryNoParens op v1 v2) = BinaryNoParens <$> g'' s op <*> g'' s v1 <*> g'' s v2
346+ g' s (Parens v) = Parens <$> g'' s v
347+ g' s (OperatorSection op (Left v)) = OperatorSection <$> g'' s op <*> (Left <$> g'' s v)
348+ g' s (OperatorSection op (Right v)) = OperatorSection <$> g'' s op <*> (Right <$> g'' s v)
349+ g' s (ArrayLiteral vs) = ArrayLiteral <$> mapM (g'' s) vs
350+ g' s (ObjectLiteral vs) = ObjectLiteral <$> mapM (sndM (g'' s)) vs
351+ g' s (ObjectConstructor vs) = ObjectConstructor <$> mapM (sndM $ maybeM (g'' s)) vs
352+ g' s (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> g'' s v
353+ g' s (Accessor prop v) = Accessor prop <$> g'' s v
354+ g' s (ObjectUpdate obj vs) = ObjectUpdate <$> g'' s obj <*> mapM (sndM (g'' s)) vs
355+ g' s (ObjectUpdater obj vs) = ObjectUpdater <$> maybeM (g'' s) obj <*> mapM (sndM $ maybeM (g'' s)) vs
356+ g' s (Abs name v) = Abs name <$> g'' s v
357+ g' s (App v1 v2) = App <$> g'' s v1 <*> g'' s v2
358+ g' s (IfThenElse v1 v2 v3) = IfThenElse <$> g'' s v1 <*> g'' s v2 <*> g'' s v3
359+ g' s (Case vs alts) = Case <$> mapM (g'' s) vs <*> mapM (i'' s) alts
360+ g' s (TypedValue check v ty) = TypedValue check <$> g'' s v <*> pure ty
361+ g' s (Let ds v) = Let <$> mapM (f'' s) ds <*> g'' s v
362+ g' s (Do es) = Do <$> mapM (j'' s) es
363+ g' s (PositionedValue pos com v) = PositionedValue pos com <$> g'' s v
364+ g' _ other = return other
365+
366+ h'' s = uncurry h' <=< h s
367+
368+ h' s (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> mapM (h'' s) bs
369+ h' s (ObjectBinder bs) = ObjectBinder <$> mapM (sndM (h'' s)) bs
370+ h' s (ArrayBinder bs) = ArrayBinder <$> mapM (h'' s) bs
371+ h' s (NamedBinder name b) = NamedBinder name <$> h'' s b
372+ h' s (PositionedBinder pos com b) = PositionedBinder pos com <$> h'' s b
373+ h' _ other = return other
374+
375+ i'' s = uncurry i' <=< i s
376+
377+ i' s (CaseAlternative bs val) = CaseAlternative <$> mapM (h'' s) bs <*> eitherM (mapM (pairM (g'' s) (g'' s))) (g'' s) val
378+
379+ j'' s = uncurry j' <=< j s
380+
381+ j' s (DoNotationValue v) = DoNotationValue <$> g'' s v
382+ j' s (DoNotationBind b v) = DoNotationBind <$> h'' s b <*> g'' s v
383+ j' s (DoNotationLet ds) = DoNotationLet <$> mapM (f'' s) ds
384+ j' s (PositionedDoNotationElement pos com e1) = PositionedDoNotationElement pos com <$> j'' s e1
385+
386+accumTypes :: (Monoid r) => (Type -> r) -> (Declaration -> r, Expr -> r, Binder -> r, CaseAlternative -> r, DoNotationElement -> r)
387+accumTypes f = everythingOnValues mappend forDecls forValues (const mempty) (const mempty) (const mempty)
388+ where
389+ forDecls (DataDeclaration _ _ _ dctors) = mconcat (concatMap (map f . snd) dctors)
390+ forDecls (ExternDeclaration _ ty) = f ty
391+ forDecls (ExternInstanceDeclaration _ cs _ tys) = mconcat (concatMap (map f . snd) cs) `mappend` mconcat (map f tys)
392+ forDecls (TypeClassDeclaration _ _ implies _) = mconcat (concatMap (map f . snd) implies)
393+ forDecls (TypeInstanceDeclaration _ cs _ tys _) = mconcat (concatMap (map f . snd) cs) `mappend` mconcat (map f tys)
394+ forDecls (TypeSynonymDeclaration _ _ ty) = f ty
395+ forDecls (TypeDeclaration _ ty) = f ty
396+ forDecls _ = mempty
397+
398+ forValues (TypeClassDictionary _ (_, cs) _) = mconcat (map f cs)
399+ forValues (SuperClassDictionary _ tys) = mconcat (map f tys)
400+ forValues (TypedValue _ _ ty) = f ty
401+ forValues _ = mempty
src/Language/PureScript/Bundle.hsnew file+545
@@ -0,0 +1,545 @@
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+
24+module Language.PureScript.Bundle (
25+ bundle
26+ , ModuleIdentifier(..)
27+ , moduleName
28+ , ModuleType(..)
29+ , ErrorMessage(..)
30+ , printErrorMessage
31+) where
32+
33+import Data.List (nub)
34+import Data.Maybe (mapMaybe, catMaybes)
35+import Data.Generics (everything, everywhere, mkQ, mkT)
36+import Data.Graph
37+import Data.Version (showVersion)
38+
39+import qualified Data.Set as S
40+
41+import Control.Applicative
42+import Control.Monad
43+import Control.Monad.Error.Class
44+import Language.JavaScript.Parser
45+
46+import qualified Paths_purescript as Paths
47+
48+-- | The type of error messages. We separate generation and rendering of errors using a data
49+-- type, in case we need to match on error types later.
50+data ErrorMessage
51+ = UnsupportedModulePath String
52+ | InvalidTopLevel
53+ | UnableToParseModule String
54+ | UnsupportedExport
55+ | ErrorInModule ModuleIdentifier ErrorMessage
56+ deriving Show
57+
58+-- | Modules are either "regular modules" (i.e. those generated by psc) or foreign modules.
59+data ModuleType
60+ = Regular
61+ | Foreign
62+ deriving (Show, Eq, Ord)
63+
64+-- | A module is identified by its module name and its type.
65+data ModuleIdentifier = ModuleIdentifier String ModuleType deriving (Show, Eq, Ord)
66+
67+moduleName :: ModuleIdentifier -> String
68+moduleName (ModuleIdentifier name _) = name
69+
70+-- | A piece of code is identified by its module and its name. These keys are used to label vertices
71+-- in the dependency graph.
72+type Key = (ModuleIdentifier, String)
73+
74+-- | An export is either a "regular export", which exports a name from the regular module we are in,
75+-- or a reexport of a declaration in the corresponding foreign module.
76+--
77+-- Regular exports are labelled, since they might re-export an operator with another name.
78+data ExportType
79+ = RegularExport String
80+ | ForeignReexport
81+ deriving (Show, Eq, Ord)
82+
83+-- | There are four types of module element we are interested in:
84+--
85+-- 1) Require statements
86+-- 2) Member declarations
87+-- 3) Export lists
88+-- 4) Everything else
89+--
90+-- Each is labelled with the original AST node which generated it, so that we can dump it back
91+-- into the output during codegen.
92+data ModuleElement
93+ = Require JSNode String ModuleIdentifier
94+ | Member JSNode Bool String [JSNode] [Key]
95+ | ExportsList [(ExportType, String, JSNode, [Key])]
96+ | Other JSNode
97+ deriving Show
98+
99+-- | A module is just a list of elements of the types listed above.
100+data Module = Module ModuleIdentifier [ModuleElement] deriving Show
101+
102+-- | Prepare an error message for consumption by humans.
103+printErrorMessage :: ErrorMessage -> [String]
104+printErrorMessage (UnsupportedModulePath s) =
105+ [ "A CommonJS module has an unsupported name (" ++ show s ++ ")."
106+ , "The following file names are supported:"
107+ , " 1) index.js (psc native modules)"
108+ , " 2) foreign.js (psc foreign modules)"
109+ ]
110+printErrorMessage InvalidTopLevel =
111+ [ "Expected a list of source elements at the top level." ]
112+printErrorMessage (UnableToParseModule err) =
113+ [ "The module could not be parsed:"
114+ , err
115+ ]
116+printErrorMessage UnsupportedExport =
117+ [ "An export was unsupported. Exports can be defined in one of two ways: "
118+ , " 1) exports.name = ..."
119+ , " 2) exports = { ... }"
120+ ]
121+printErrorMessage (ErrorInModule mid e) =
122+ ("Error in module " ++ displayIdentifier mid ++ ":")
123+ : ""
124+ : map (" " ++) (printErrorMessage e)
125+ where
126+ displayIdentifier (ModuleIdentifier name ty) =
127+ name ++ " (" ++ show ty ++ ")"
128+
129+-- | Unpack the node inside a JSNode. This is useful when pattern matching.
130+node :: JSNode -> Node
131+node (NN n) = n
132+node (NT n _ _) = n
133+
134+-- | Calculate the ModuleIdentifier which a require(...) statement imports.
135+checkImportPath :: String -> ModuleIdentifier -> S.Set String -> Maybe ModuleIdentifier
136+checkImportPath "./foreign" m _ =
137+ Just (ModuleIdentifier (moduleName m) Foreign)
138+checkImportPath name _ names
139+ | name `S.member` names = Just (ModuleIdentifier name Regular)
140+checkImportPath _ _ _ = Nothing
141+
142+-- | Compute the dependencies of all elements in a module, and add them to the tree.
143+--
144+-- Members and exports can have dependencies. A dependency is of one of the following forms:
145+--
146+-- 1) module.name or member["name"]
147+--
148+-- where module was imported using
149+--
150+-- var module = require("Module.Name");
151+--
152+-- 2) name
153+--
154+-- where name is the name of a member defined in the current module.
155+withDeps :: Module -> Module
156+withDeps (Module modulePath es) = Module modulePath (map expandDeps es)
157+ where
158+ -- | Collects all modules which are imported, so that we can identify dependencies of the first type.
159+ imports :: [(String, ModuleIdentifier)]
160+ imports = mapMaybe toImport es
161+ where
162+ toImport :: ModuleElement -> Maybe (String, ModuleIdentifier)
163+ toImport (Require _ nm mid) = Just (nm, mid)
164+ toImport _ = Nothing
165+
166+ -- | Collects all member names in scope, so that we can identify dependencies of the second type.
167+ boundNames :: [String]
168+ boundNames = mapMaybe toBoundName es
169+ where
170+ toBoundName :: ModuleElement -> Maybe String
171+ toBoundName (Member _ _ nm _ _) = Just nm
172+ toBoundName _ = Nothing
173+
174+ -- | Calculate dependencies and add them to the current element.
175+ expandDeps :: ModuleElement -> ModuleElement
176+ expandDeps (Member n f nm decl _) = Member n f nm decl (nub (concatMap (dependencies modulePath) decl))
177+ expandDeps (ExportsList exps) = ExportsList (map expand exps)
178+ where
179+ expand (ty, nm, n1, _) = (ty, nm, n1, nub (dependencies modulePath n1))
180+ expandDeps other = other
181+
182+ dependencies :: ModuleIdentifier -> JSNode -> [(ModuleIdentifier, String)]
183+ dependencies m = everything (++) (mkQ [] toReference)
184+ where
185+ toReference :: Node -> [(ModuleIdentifier, String)]
186+ toReference (JSMemberDot [ mn ] _ nm)
187+ | JSIdentifier mn' <- node mn
188+ , JSIdentifier nm' <- node nm
189+ , Just mid <- lookup mn' imports
190+ = [(mid, nm')]
191+ toReference (JSMemberSquare [ mn ] _ nm _)
192+ | JSIdentifier mn' <- node mn
193+ , JSExpression [ s ] <- node nm
194+ , JSStringLiteral _ nm' <- node s
195+ , Just mid <- lookup mn' imports
196+ = [(mid, nm')]
197+ toReference (JSIdentifier nm)
198+ | nm `elem` boundNames
199+ = [(m, nm)]
200+ toReference _ = []
201+
202+-- | Attempt to create a Module from a Javascript AST.
203+--
204+-- Each type of module element is matched using pattern guards, and everything else is bundled into the
205+-- Other constructor.
206+toModule :: forall m. (Applicative m, MonadError ErrorMessage m) => S.Set String -> ModuleIdentifier -> JSNode -> m Module
207+toModule mids mid top
208+ | JSSourceElementsTop ns <- node top = Module mid <$> mapM toModuleElement ns
209+ | otherwise = err InvalidTopLevel
210+ where
211+ err = throwError . ErrorInModule mid
212+
213+ toModuleElement :: JSNode -> m ModuleElement
214+ toModuleElement n
215+ | JSVariables var [ varIntro ] _ <- node n
216+ , JSLiteral "var" <- node var
217+ , JSVarDecl impN [ eq, req, impP ] <- node varIntro
218+ , JSIdentifier importName <- node impN
219+ , JSLiteral "=" <- node eq
220+ , JSIdentifier "require" <- node req
221+ , JSArguments _ [ impS ] _ <- node impP
222+ , JSStringLiteral _ importPath <- node impS
223+ , Just importPath' <- checkImportPath importPath mid mids
224+ = pure (Require n importName importPath')
225+ toModuleElement n
226+ | JSVariables var [ varIntro ] _ <- node n
227+ , JSLiteral "var" <- node var
228+ , JSVarDecl declN (eq : decl) <- node varIntro
229+ , JSIdentifier name <- node declN
230+ , JSLiteral "=" <- node eq
231+ = pure (Member n False name decl [])
232+ toModuleElement n
233+ | JSExpression (e : op : decl) <- node n
234+ , Just name <- accessor (node e)
235+ , JSOperator eq <- node op
236+ , JSLiteral "=" <- node eq
237+ = pure (Member n True name decl [])
238+ where
239+ accessor :: Node -> Maybe String
240+ accessor (JSMemberDot [ exports ] _ nm)
241+ | JSIdentifier "exports" <- node exports
242+ , JSIdentifier name <- node nm
243+ = Just name
244+ accessor (JSMemberSquare [ exports ] _ nm _)
245+ | JSIdentifier "exports" <- node exports
246+ , JSExpression [e] <- node nm
247+ , JSStringLiteral _ name <- node e
248+ = Just name
249+ accessor _ = Nothing
250+ toModuleElement n
251+ | JSExpression (mnExp : op : obj: _) <- node n
252+ , JSMemberDot [ mn ] _ e <- node mnExp
253+ , JSIdentifier "module" <- node mn
254+ , JSIdentifier "exports" <- node e
255+ , JSOperator eq <- node op
256+ , JSLiteral "=" <- node eq
257+ , JSObjectLiteral _ props _ <- node obj
258+ = ExportsList <$> mapM toExport (filter (not . isSeparator) (map node props))
259+ where
260+ toExport :: Node -> m (ExportType, String, JSNode, [Key])
261+ toExport (JSPropertyNameandValue name _ [val] ) =
262+ (,,val,[]) <$> exportType (node val)
263+ <*> extractLabel (node name)
264+ toExport _ = err UnsupportedExport
265+
266+ exportType :: Node -> m ExportType
267+ exportType (JSMemberDot [f] _ _)
268+ | JSIdentifier "$foreign" <- node f
269+ = pure ForeignReexport
270+ exportType (JSMemberSquare [f] _ _ _)
271+ | JSIdentifier "$foreign" <- node f
272+ = pure ForeignReexport
273+ exportType (JSIdentifier s) = pure (RegularExport s)
274+ exportType _ = err UnsupportedExport
275+
276+ extractLabel :: Node -> m String
277+ extractLabel (JSStringLiteral _ nm) = pure nm
278+ extractLabel (JSIdentifier nm) = pure nm
279+ extractLabel _ = err UnsupportedExport
280+
281+ isSeparator :: Node -> Bool
282+ isSeparator (JSLiteral ",") = True
283+ isSeparator _ = False
284+ toModuleElement other = pure (Other other)
285+
286+-- | Eliminate unused code based on the specified entry point set.
287+compile :: [Module] -> [ModuleIdentifier] -> [Module]
288+compile modules [] = modules
289+compile modules entryPoints = filteredModules
290+ where
291+ (graph, _, vertexFor) = graphFromEdges verts
292+
293+ -- | The vertex set
294+ verts :: [(ModuleElement, Key, [Key])]
295+ verts = do
296+ Module mid els <- modules
297+ concatMap (toVertices mid) els
298+ where
299+ -- | Create a set of vertices for a module element.
300+ --
301+ -- Some special cases worth commenting on:
302+ --
303+ -- 1) Regular exports which simply export their own name do not count as dependencies.
304+ -- Regular exports which rename and reexport an operator do count, however.
305+ --
306+ -- 2) Require statements don't contribute towards dependencies, since they effectively get
307+ -- inlined wherever they are used inside other module elements.
308+ toVertices :: ModuleIdentifier -> ModuleElement -> [(ModuleElement, Key, [Key])]
309+ toVertices p m@(Member _ _ nm _ deps) = [(m, (p, nm), deps)]
310+ toVertices p m@(ExportsList exps) = mapMaybe toVertex exps
311+ where
312+ toVertex (ForeignReexport, nm, _, ks) = Just (m, (p, nm), ks)
313+ toVertex (RegularExport nm, nm1, _, ks) | nm /= nm1 = Just (m, (p, nm1), ks)
314+ toVertex _ = Nothing
315+ toVertices _ _ = []
316+
317+ -- | The set of vertices whose connected components we are interested in keeping.
318+ entryPointVertices :: [Vertex]
319+ entryPointVertices = catMaybes $ do
320+ (_, k@(mid, _), _) <- verts
321+ guard $ mid `elem` entryPoints
322+ return (vertexFor k)
323+
324+ -- | The set of vertices reachable from an entry point
325+ reachableSet :: S.Set Vertex
326+ reachableSet = S.fromList (concatMap (reachable graph) entryPointVertices)
327+
328+ filteredModules :: [Module]
329+ filteredModules = map filterUsed modules
330+ where
331+ filterUsed :: Module -> Module
332+ filterUsed (Module mid ds) = Module mid (map filterExports (go ds))
333+ where
334+ go :: [ModuleElement] -> [ModuleElement]
335+ go [] = []
336+ go (d : Other semi : rest)
337+ | JSLiteral ";" <- node semi
338+ , not (isDeclUsed d)
339+ = go rest
340+ go (d : rest)
341+ | not (isDeclUsed d) = go rest
342+ | otherwise = d : go rest
343+
344+ -- | Filter out the exports for members which aren't used.
345+ filterExports :: ModuleElement -> ModuleElement
346+ filterExports (ExportsList exps) = ExportsList (filter (\(_, nm, _, _) -> isKeyUsed (mid, nm)) exps)
347+ filterExports me = me
348+
349+ isDeclUsed :: ModuleElement -> Bool
350+ isDeclUsed (Member _ _ nm _ _) = isKeyUsed (mid, nm)
351+ isDeclUsed _ = True
352+
353+ isKeyUsed :: Key -> Bool
354+ isKeyUsed k
355+ | Just me <- vertexFor k = me `S.member` reachableSet
356+ | otherwise = False
357+
358+-- | Topologically sort the module dependency graph, so that when we generate code, modules can be
359+-- defined in the right order.
360+sortModules :: [Module] -> [Module]
361+sortModules modules = map (\v -> case nodeFor v of (n, _, _) -> n) (reverse (topSort graph))
362+ where
363+ (graph, nodeFor, _) = graphFromEdges $ do
364+ m@(Module mid els) <- modules
365+ return (m, mid, mapMaybe getKey els)
366+
367+ getKey :: ModuleElement -> Maybe ModuleIdentifier
368+ getKey (Require _ _ mi) = Just mi
369+ getKey _ = Nothing
370+
371+-- | A module is empty if it contains no exported members (in other words,
372+-- if the only things left after dead code elimination are module imports and
373+-- "other" foreign code).
374+--
375+-- If a module is empty, we don't want to generate code for it.
376+isModuleEmpty :: Module -> Bool
377+isModuleEmpty (Module _ els) = all isElementEmpty els
378+ where
379+ isElementEmpty :: ModuleElement -> Bool
380+ isElementEmpty (ExportsList exps) = null exps
381+ isElementEmpty (Require _ _ _) = True
382+ isElementEmpty (Other _) = True
383+ isElementEmpty _ = False
384+
385+-- | Generate code for a set of modules, including a call to main().
386+--
387+-- Modules get defined on the global PS object, as follows:
388+--
389+-- var PS = { };
390+-- (function(exports) {
391+-- ...
392+-- })(PS["Module.Name"] = PS["Module.Name"] || {});
393+--
394+-- In particular, a module and its foreign imports share the same namespace inside PS.
395+-- This saves us from having to generate unique names for a module and its foreign imports,
396+-- and is safe since a module shares a namespace with its foreign imports in PureScript as well
397+-- (so there is no way to have overlaps in code generated by psc).
398+codeGen :: Maybe String -- ^ main module
399+ -> String -- ^ namespace
400+ -> [Module] -- ^ input modules
401+ -> String
402+codeGen optionsMainModule optionsNamespace ms = renderToString (NN (JSSourceElementsTop (prelude ++ concatMap moduleToJS ms ++ maybe [] runMain optionsMainModule)))
403+ where
404+ moduleToJS :: Module -> [JSNode]
405+ moduleToJS (Module mn ds) = wrap (moduleName mn) (indent (concatMap declToJS ds))
406+ where
407+ declToJS :: ModuleElement -> [JSNode]
408+ declToJS (Member n _ _ _ _) = [n]
409+ declToJS (Other n) = [n]
410+ declToJS (Require _ nm req) =
411+ [ NN (JSVariables (NT (JSLiteral "var") tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n " ])
412+ [ NN (JSVarDecl (sp (JSIdentifier nm))
413+ [ sp (JSLiteral "=")
414+ , moduleReference sp (moduleName req)
415+ ])
416+ ]
417+ (nt (JSLiteral ";"))) ]
418+ declToJS (ExportsList exps) = map toExport exps
419+
420+ where
421+ toExport :: (ExportType, String, JSNode, [Key]) -> JSNode
422+ toExport (_, nm, val, _) =
423+ NN (JSExpression [ NN (JSMemberSquare [ NT (JSIdentifier "exports") tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n " ] ]
424+ (nt (JSLiteral "["))
425+ (NN (JSExpression [ nt (JSStringLiteral '"' nm) ]))
426+ (nt (JSLiteral "]")))
427+ , NN (JSOperator (sp (JSLiteral "=")))
428+ , reindent val
429+ , nt (JSLiteral ";")
430+ ])
431+
432+ reindent :: JSNode -> JSNode
433+ reindent (NT n _ _) = sp n
434+ reindent nn = nn
435+
436+ indent :: [JSNode] -> [JSNode]
437+ indent = everywhere (mkT squash)
438+ where
439+ squash (NT n pos ann) = NT n (keepCol pos) (map splat ann)
440+ squash nn = nn
441+
442+ splat (CommentA pos s) = CommentA (keepCol pos) s
443+ splat (WhiteSpace pos w) = WhiteSpace (keepCol pos) w
444+ splat ann = ann
445+
446+ keepCol (TokenPn _ _ c) = TokenPn 0 0 (c + 2)
447+
448+ prelude :: [JSNode]
449+ prelude =
450+ [ NN (JSVariables (NT (JSLiteral "var") tokenPosnEmpty [ CommentA tokenPosnEmpty ("// Generated by psc-bundle " ++ showVersion Paths.version)
451+ , WhiteSpace tokenPosnEmpty "\n"
452+ ])
453+ [ NN (JSVarDecl (sp (JSIdentifier optionsNamespace))
454+ [ sp (JSLiteral "=")
455+ , NN (JSObjectLiteral (sp (JSLiteral "{"))
456+ []
457+ (sp (JSLiteral "}")))
458+ ])
459+ ]
460+ (nt (JSLiteral ";")))
461+ , lf
462+ ]
463+
464+ moduleReference :: (Node -> JSNode) -> String -> JSNode
465+ moduleReference f mn =
466+ NN (JSMemberSquare [ f (JSIdentifier optionsNamespace) ]
467+ (nt (JSLiteral "["))
468+ (NN (JSExpression [ nt (JSStringLiteral '"' mn) ]))
469+ (nt (JSLiteral "]")))
470+
471+ wrap :: String -> [JSNode] -> [JSNode]
472+ wrap mn ds =
473+ [ NN (JSExpression [ NN (JSExpressionParen (nt (JSLiteral "("))
474+ (NN (JSExpression [ NN (JSFunctionExpression (nt (JSLiteral "function"))
475+ []
476+ (nt (JSLiteral "(") ) [nt (JSIdentifier "exports")] (nt (JSLiteral ")"))
477+ (NN (JSBlock [sp (JSLiteral "{")]
478+ (lf : ds)
479+ [nl (JSLiteral "}")])))]))
480+ (nt (JSLiteral ")")))
481+ , NN (JSArguments (nt (JSLiteral "("))
482+ [ NN (JSExpression [ moduleReference nt mn
483+ , NN (JSOperator (sp (JSLiteral "=")))
484+ , NN (JSExpressionBinary "||"
485+ [ moduleReference sp mn ]
486+ (sp (JSLiteral "||"))
487+ [ emptyObj ])
488+ ])
489+ ]
490+ (nt (JSLiteral ")")))
491+ ])
492+ , nt (JSLiteral ";")
493+ , lf
494+ ]
495+ where
496+ emptyObj = NN (JSObjectLiteral (sp (JSLiteral "{")) [] (nt (JSLiteral "}")))
497+
498+ runMain :: String -> [JSNode]
499+ runMain mn =
500+ [ NN (JSExpression [ NN (JSMemberDot [ NN (JSMemberSquare [ nl (JSIdentifier optionsNamespace) ]
501+ (nt (JSLiteral "["))
502+ (NN (JSExpression [ nt (JSStringLiteral '"' mn) ]))
503+ (nt (JSLiteral "]")))
504+ ]
505+ (nt (JSLiteral "."))
506+ (nt (JSIdentifier "main")))
507+ , NN (JSArguments (nt (JSLiteral "(")) [] (nt (JSLiteral ")")))
508+ ])
509+ , nt (JSLiteral ";")
510+ ]
511+
512+ nt :: Node -> JSNode
513+ nt n = NT n tokenPosnEmpty []
514+
515+ lf :: JSNode
516+ lf = NT (JSLiteral "") tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n" ]
517+
518+ sp :: Node -> JSNode
519+ sp n = NT n tokenPosnEmpty [ WhiteSpace tokenPosnEmpty " " ]
520+
521+ nl :: Node -> JSNode
522+ nl n = NT n tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n" ]
523+
524+-- | The bundling function.
525+-- This function performs dead code elimination, filters empty modules
526+-- and generates and prints the final Javascript bundle.
527+bundle :: forall m. (Applicative m, MonadError ErrorMessage m)
528+ => [(ModuleIdentifier, String)] -- ^ The input modules. Each module should be javascript rendered from 'Language.PureScript.Make' or @psc@.
529+ -> [ModuleIdentifier] -- ^ Entry points. These module identifiers are used as the roots for dead-code elimination
530+ -> Maybe String -- ^ An optional main module.
531+ -> String -- ^ The namespace (e.g. PS).
532+ -> m String
533+bundle inputStrs entryPoints mainModule namespace = do
534+ input <- forM inputStrs $ \(ident, js) -> do
535+ ast <- either (throwError . ErrorInModule ident . UnableToParseModule) pure $ parse js (moduleName ident)
536+ return (ident, ast)
537+
538+ let mids = S.fromList (map (moduleName . fst) input)
539+
540+ modules <- mapM (fmap withDeps . uncurry (toModule mids)) input
541+
542+ let compiled = compile modules entryPoints
543+ sorted = sortModules (filter (not . isModuleEmpty) compiled)
544+
545+ return (codeGen mainModule namespace sorted)
src/Language/PureScript/CodeGen.hsnew file+25
@@ -0,0 +1,25 @@
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+-- [@Language.PureScript.CodeGen.Externs@] Code generator for extern (foreign import) files
17+--
18+-- [@Language.PureScript.CodeGen.Optimize@] Optimization passes for generated Javascript
19+--
20+-----------------------------------------------------------------------------
21+
22+module Language.PureScript.CodeGen (module C) where
23+
24+import Language.PureScript.CodeGen.JS as C
25+import Language.PureScript.CodeGen.Externs as C
src/Language/PureScript/CodeGen/Externs.hsnew file+136
@@ -0,0 +1,136 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.CodeGen.Externs
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 for \"externs\" files, i.e. files containing only foreign import declarations.
13+--
14+-----------------------------------------------------------------------------
15+
16+module Language.PureScript.CodeGen.Externs (
17+ moduleToPs
18+) where
19+
20+import Data.List (intercalate, find)
21+import Data.Maybe (fromMaybe, mapMaybe)
22+import qualified Data.Map as M
23+
24+import Control.Monad.Writer
25+
26+import Language.PureScript.AST
27+import Language.PureScript.Comments
28+import Language.PureScript.Environment
29+import Language.PureScript.Kinds
30+import Language.PureScript.Names
31+import Language.PureScript.Pretty
32+import Language.PureScript.TypeClassDictionaries
33+import Language.PureScript.Types
34+
35+-- |
36+-- Generate foreign imports for all declarations in a module
37+--
38+moduleToPs :: Module -> Environment -> String
39+moduleToPs (Module _ _ _ Nothing) _ = error "Module exports were not elaborated in moduleToPs"
40+moduleToPs (Module _ moduleName ds (Just exts)) env = intercalate "\n" . execWriter $ do
41+ let exps = listExports exts
42+ tell ["module " ++ runModuleName moduleName ++ (if null exps then "" else " (" ++ exps ++ ")") ++ " where"]
43+ mapM_ declToPs ds
44+ mapM_ exportToPs exts
45+ where
46+
47+ listExports :: [DeclarationRef] -> String
48+ listExports = intercalate ", " . mapMaybe listExport
49+
50+ listExport :: DeclarationRef -> Maybe String
51+ listExport (PositionedDeclarationRef _ _ d) = listExport d
52+ listExport (TypeRef name Nothing) = Just $ show name ++ "()"
53+ listExport (TypeRef name (Just dctors)) = Just $ show name ++ "(" ++ intercalate ", " (map show dctors) ++ ")"
54+ listExport (ValueRef name) = Just $ show name
55+ listExport (TypeClassRef name) = Just $ show name
56+ listExport (ModuleRef name) = Just $ "module " ++ show name
57+ listExport _ = Nothing
58+
59+ declToPs :: Declaration -> Writer [String] ()
60+ declToPs (ImportDeclaration mn _ _) = tell ["import " ++ show mn ++ " ()"]
61+ declToPs (FixityDeclaration (Fixity assoc prec) op) =
62+ case find exportsOp exts of
63+ Nothing -> return ()
64+ Just _ -> tell [ unwords [ show assoc, show prec, op ] ]
65+ where
66+ exportsOp :: DeclarationRef -> Bool
67+ exportsOp (PositionedDeclarationRef _ _ r) = exportsOp r
68+ exportsOp (ValueRef ident') = ident' == Op op
69+ exportsOp _ = False
70+ declToPs (PositionedDeclaration _ com d) = mapM_ commentToPs com >> declToPs d
71+ declToPs _ = return ()
72+
73+ commentToPs :: Comment -> Writer [String] ()
74+ commentToPs (LineComment s) = tell ["-- " ++ s]
75+ commentToPs (BlockComment s) = tell ["{- " ++ s ++ " -}"]
76+
77+ exportToPs :: DeclarationRef -> Writer [String] ()
78+ exportToPs (PositionedDeclarationRef _ _ r) = exportToPs r
79+ exportToPs (TypeRef pn dctors) =
80+ case Qualified (Just moduleName) pn `M.lookup` types env of
81+ Nothing -> error $ show pn ++ " has no kind in exportToPs"
82+ Just (kind, ExternData) ->
83+ tell ["foreign import data " ++ show pn ++ " :: " ++ prettyPrintKind kind]
84+ Just (_, DataType args tys) -> do
85+ let dctors' = fromMaybe (map fst tys) dctors
86+ printDctor dctor = case dctor `lookup` tys of
87+ Nothing -> Nothing
88+ Just tyArgs -> Just $ show dctor ++ " " ++ unwords (map prettyPrintTypeAtom tyArgs)
89+ let dtype = if length dctors' == 1 && isNewtypeConstructor env (Qualified (Just moduleName) $ head dctors')
90+ then "newtype"
91+ else "data"
92+ typeName = prettyPrintType $ foldl TypeApp (TypeConstructor (Qualified Nothing pn)) (map toTypeVar args)
93+ tell [dtype ++ " " ++ typeName ++ (if null dctors' then "" else " = " ++ intercalate " | " (mapMaybe printDctor dctors'))]
94+ Just (_, TypeSynonym) ->
95+ case Qualified (Just moduleName) pn `M.lookup` typeSynonyms env of
96+ Nothing -> error $ show pn ++ " has no type synonym info in exportToPs"
97+ Just (args, synTy) ->
98+ let
99+ typeName = prettyPrintType $ foldl TypeApp (TypeConstructor (Qualified Nothing pn)) (map toTypeVar args)
100+ in tell ["type " ++ typeName ++ " = " ++ prettyPrintType synTy]
101+ _ -> error "Invalid input in exportToPs"
102+
103+ exportToPs (ValueRef ident) =
104+ case (moduleName, ident) `M.lookup` names env of
105+ Nothing -> error $ show ident ++ " has no type in exportToPs"
106+ Just (ty, nk, _) | nk == Public || nk == External ->
107+ tell ["foreign import " ++ show ident ++ " :: " ++ prettyPrintType ty]
108+ _ -> return ()
109+ exportToPs (TypeClassRef className) =
110+ case Qualified (Just moduleName) className `M.lookup` typeClasses env of
111+ Nothing -> error $ show className ++ " has no type class definition in exportToPs"
112+ Just (args, members, implies) -> do
113+ let impliesString = if null implies
114+ then ""
115+ else "(" ++ intercalate ", " (map (\(pn, tys') -> show pn ++ " " ++ unwords (map prettyPrintTypeAtom tys')) implies) ++ ") <= "
116+ typeName = prettyPrintType $ foldl TypeApp (TypeConstructor (Qualified Nothing className)) (map toTypeVar args)
117+ tell ["class " ++ impliesString ++ typeName ++ " where"]
118+ forM_ (filter (isValueExported . fst) members) $ \(member ,ty) ->
119+ tell [ " " ++ show member ++ " :: " ++ prettyPrintType ty ]
120+
121+ exportToPs (TypeInstanceRef ident) = do
122+ let TypeClassDictionaryInScope { tcdClassName = className, tcdInstanceTypes = tys, tcdDependencies = deps} =
123+ fromMaybe (error $ "Type class instance has no dictionary in exportToPs") . find (\tcd -> tcdName tcd == Qualified (Just moduleName) ident && tcdType tcd == TCDRegular) . maybe [] (M.elems >=> M.elems) . M.lookup (Just moduleName) $ typeClassDictionaries env
124+ let constraintsText = case fromMaybe [] deps of
125+ [] -> ""
126+ cs -> "(" ++ intercalate ", " (map (\(pn, tys') -> show pn ++ " " ++ unwords (map prettyPrintTypeAtom tys')) cs) ++ ") => "
127+ tell ["foreign import instance " ++ show ident ++ " :: " ++ constraintsText ++ show className ++ " " ++ unwords (map prettyPrintTypeAtom tys)]
128+
129+ exportToPs (ModuleRef _) = return ()
130+
131+ toTypeVar :: (String, Maybe Kind) -> Type
132+ toTypeVar (s, Nothing) = TypeVar s
133+ toTypeVar (s, Just k) = KindedType (TypeVar s) k
134+
135+ isValueExported :: Ident -> Bool
136+ isValueExported ident = ValueRef ident `elem` exts
src/Language/PureScript/CodeGen/JS.hsnew file+359
@@ -0,0 +1,359 @@
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+
21+module Language.PureScript.CodeGen.JS
22+ ( module AST
23+ , module Common
24+ , moduleToJs
25+ , mainCall
26+ ) where
27+
28+import Data.List ((\\), delete, intersect)
29+import qualified Data.Traversable as T (traverse)
30+
31+import Control.Applicative
32+import Control.Arrow ((&&&))
33+import Control.Monad (replicateM, forM)
34+import Control.Monad.Reader (MonadReader, asks)
35+import Control.Monad.Supply.Class
36+
37+import Language.PureScript.AST.SourcePos
38+import Language.PureScript.CodeGen.JS.AST as AST
39+import Language.PureScript.CodeGen.JS.Common as Common
40+import Language.PureScript.CoreFn
41+import Language.PureScript.Names
42+import Language.PureScript.CodeGen.JS.Optimizer
43+import Language.PureScript.Options
44+import Language.PureScript.Traversals (sndM)
45+import qualified Language.PureScript.Constants as C
46+
47+import System.FilePath.Posix ((</>))
48+
49+-- |
50+-- Generate code in the simplified Javascript intermediate representation for all declarations in a
51+-- module.
52+--
53+moduleToJs :: forall m. (Applicative m, Monad m, MonadReader Options m, MonadSupply m)
54+ => Module Ann -> Maybe JS -> m [JS]
55+moduleToJs (Module coms mn imps exps foreigns decls) foreign = do
56+ jsImports <- T.traverse importToJs . delete (ModuleName [ProperName C.prim]) . (\\ [mn]) $ imps
57+ jsDecls <- mapM bindToJs decls
58+ optimized <- T.traverse (T.traverse optimize) jsDecls
59+ comments <- not <$> asks optionsNoComments
60+ let strict = JSStringLiteral "use strict"
61+ let header = if comments && not (null coms) then JSComment coms strict else strict
62+ let foreign' = [JSVariableIntroduction "$foreign" foreign | not $ null foreigns || foreign == Nothing]
63+ let moduleBody = header : foreign' ++ jsImports ++ concat optimized
64+ let foreignExps = exps `intersect` (fst `map` foreigns)
65+ let standardExps = exps \\ foreignExps
66+ let exps' = JSObjectLiteral $ map (runIdent &&& JSVar . identToJs) standardExps
67+ ++ map (runIdent &&& foreignIdent) foreignExps
68+ return $ moduleBody ++ [JSAssignment (JSAccessor "exports" (JSVar "module")) exps']
69+
70+ where
71+
72+ -- |
73+ -- Generates Javascript code for a module import.
74+ --
75+ importToJs :: ModuleName -> m JS
76+ importToJs mn' = do
77+ path <- asks optionsRequirePath
78+ let moduleBody = JSApp (JSVar "require") [JSStringLiteral (maybe id (</>) path $ runModuleName mn')]
79+ return $ JSVariableIntroduction (moduleNameToJs mn') (Just moduleBody)
80+
81+ -- |
82+ -- Generate code in the simplified Javascript intermediate representation for a declaration
83+ --
84+ bindToJs :: Bind Ann -> m [JS]
85+ bindToJs (NonRec ident val) = return <$> nonRecToJS ident val
86+ bindToJs (Rec vals) = forM vals (uncurry nonRecToJS)
87+
88+ -- |
89+ -- Generate code in the simplified Javascript intermediate representation for a single non-recursive
90+ -- declaration.
91+ --
92+ -- The main purpose of this function is to handle code generation for comments.
93+ --
94+ nonRecToJS :: Ident -> Expr Ann -> m JS
95+ nonRecToJS i e@(extractAnn -> (_, com, _, _)) | not (null com) = do
96+ withoutComment <- asks optionsNoComments
97+ if withoutComment
98+ then nonRecToJS i (modifyAnn removeComments e)
99+ else JSComment com <$> nonRecToJS i (modifyAnn removeComments e)
100+ nonRecToJS ident val = do
101+ js <- valueToJs val
102+ return $ JSVariableIntroduction (identToJs ident) (Just js)
103+
104+ -- |
105+ -- Generate code in the simplified Javascript intermediate representation for a variable based on a
106+ -- PureScript identifier.
107+ --
108+ var :: Ident -> JS
109+ var = JSVar . identToJs
110+
111+ -- |
112+ -- Generate code in the simplified Javascript intermediate representation for an accessor based on
113+ -- a PureScript identifier. If the name is not valid in Javascript (symbol based, reserved name) an
114+ -- indexer is returned.
115+ --
116+ accessor :: Ident -> JS -> JS
117+ accessor (Ident prop) = accessorString prop
118+ accessor (Op op) = JSIndexer (JSStringLiteral op)
119+
120+ accessorString :: String -> JS -> JS
121+ accessorString prop | identNeedsEscaping prop = JSIndexer (JSStringLiteral prop)
122+ | otherwise = JSAccessor prop
123+
124+ -- |
125+ -- Generate code in the simplified Javascript intermediate representation for a value or expression.
126+ --
127+ valueToJs :: Expr Ann -> m JS
128+ valueToJs (Literal _ l) =
129+ literalToValueJS l
130+ valueToJs (Var (_, _, _, Just (IsConstructor _ [])) name) =
131+ return $ JSAccessor "value" $ qualifiedToJS id name
132+ valueToJs (Var (_, _, _, Just (IsConstructor _ _)) name) =
133+ return $ JSAccessor "create" $ qualifiedToJS id name
134+ valueToJs (Accessor _ prop val) =
135+ accessorString prop <$> valueToJs val
136+ valueToJs (ObjectUpdate _ o ps) = do
137+ obj <- valueToJs o
138+ sts <- mapM (sndM valueToJs) ps
139+ extendObj obj sts
140+ valueToJs e@(Abs (_, _, _, Just IsTypeClassConstructor) _ _) =
141+ let args = unAbs e
142+ in return $ JSFunction Nothing (map identToJs args) (JSBlock $ map assign args)
143+ where
144+ unAbs :: Expr Ann -> [Ident]
145+ unAbs (Abs _ arg val) = arg : unAbs val
146+ unAbs _ = []
147+ assign :: Ident -> JS
148+ assign name = JSAssignment (accessorString (runIdent name) (JSVar "this"))
149+ (var name)
150+ valueToJs (Abs _ arg val) = do
151+ ret <- valueToJs val
152+ return $ JSFunction Nothing [identToJs arg] (JSBlock [JSReturn ret])
153+ valueToJs e@App{} = do
154+ let (f, args) = unApp e []
155+ args' <- mapM valueToJs args
156+ case f of
157+ Var (_, _, _, Just IsNewtype) _ -> return (head args')
158+ Var (_, _, _, Just (IsConstructor _ fields)) name | length args == length fields ->
159+ return $ JSUnary JSNew $ JSApp (qualifiedToJS id name) args'
160+ Var (_, _, _, Just IsTypeClassConstructor) name ->
161+ return $ JSUnary JSNew $ JSApp (qualifiedToJS id name) args'
162+ _ -> flip (foldl (\fn a -> JSApp fn [a])) args' <$> valueToJs f
163+ where
164+ unApp :: Expr Ann -> [Expr Ann] -> (Expr Ann, [Expr Ann])
165+ unApp (App _ val arg) args = unApp val (arg : args)
166+ unApp other args = (other, args)
167+ valueToJs (Var (_, _, _, Just IsForeign) qi@(Qualified (Just mn') ident)) =
168+ return $ if mn' == mn
169+ then foreignIdent ident
170+ else varToJs qi
171+ valueToJs (Var (_, _, _, Just IsForeign) ident) =
172+ error $ "Encountered an unqualified reference to a foreign ident " ++ show ident
173+ valueToJs (Var _ ident) =
174+ return $ varToJs ident
175+ valueToJs (Case (maybeSpan, _, _, _) values binders) = do
176+ vals <- mapM valueToJs values
177+ bindersToJs maybeSpan binders vals
178+ valueToJs (Let _ ds val) = do
179+ ds' <- concat <$> mapM bindToJs ds
180+ ret <- valueToJs val
181+ return $ JSApp (JSFunction Nothing [] (JSBlock (ds' ++ [JSReturn ret]))) []
182+ valueToJs (Constructor (_, _, _, Just IsNewtype) _ (ProperName ctor) _) =
183+ return $ JSVariableIntroduction ctor (Just $
184+ JSObjectLiteral [("create",
185+ JSFunction Nothing ["value"]
186+ (JSBlock [JSReturn $ JSVar "value"]))])
187+ valueToJs (Constructor _ _ (ProperName ctor) []) =
188+ return $ iife ctor [ JSFunction (Just ctor) [] (JSBlock [])
189+ , JSAssignment (JSAccessor "value" (JSVar ctor))
190+ (JSUnary JSNew $ JSApp (JSVar ctor) []) ]
191+ valueToJs (Constructor _ _ (ProperName ctor) fields) =
192+ let constructor =
193+ let body = [ JSAssignment (JSAccessor (identToJs f) (JSVar "this")) (var f) | f <- fields ]
194+ in JSFunction (Just ctor) (identToJs `map` fields) (JSBlock body)
195+ createFn =
196+ let body = JSUnary JSNew $ JSApp (JSVar ctor) (var `map` fields)
197+ in foldr (\f inner -> JSFunction Nothing [identToJs f] (JSBlock [JSReturn inner])) body fields
198+ in return $ iife ctor [ constructor
199+ , JSAssignment (JSAccessor "create" (JSVar ctor)) createFn
200+ ]
201+
202+ iife :: String -> [JS] -> JS
203+ iife v exprs = JSApp (JSFunction Nothing [] (JSBlock $ exprs ++ [JSReturn $ JSVar v])) []
204+
205+ literalToValueJS :: Literal (Expr Ann) -> m JS
206+ literalToValueJS (NumericLiteral n) = return $ JSNumericLiteral n
207+ literalToValueJS (StringLiteral s) = return $ JSStringLiteral s
208+ literalToValueJS (CharLiteral c) = return $ JSStringLiteral [c]
209+ literalToValueJS (BooleanLiteral b) = return $ JSBooleanLiteral b
210+ literalToValueJS (ArrayLiteral xs) = JSArrayLiteral <$> mapM valueToJs xs
211+ literalToValueJS (ObjectLiteral ps) = JSObjectLiteral <$> mapM (sndM valueToJs) ps
212+
213+ -- |
214+ -- Shallow copy an object.
215+ --
216+ extendObj :: JS -> [(String, JS)] -> m JS
217+ extendObj obj sts = do
218+ newObj <- freshName
219+ key <- freshName
220+ let
221+ jsKey = JSVar key
222+ jsNewObj = JSVar newObj
223+ block = JSBlock (objAssign:copy:extend ++ [JSReturn jsNewObj])
224+ objAssign = JSVariableIntroduction newObj (Just $ JSObjectLiteral [])
225+ copy = JSForIn key obj $ JSBlock [JSIfElse cond assign Nothing]
226+ cond = JSApp (JSAccessor "hasOwnProperty" obj) [jsKey]
227+ assign = JSBlock [JSAssignment (JSIndexer jsKey jsNewObj) (JSIndexer jsKey obj)]
228+ stToAssign (s, js) = JSAssignment (JSAccessor s jsNewObj) js
229+ extend = map stToAssign sts
230+ return $ JSApp (JSFunction Nothing [] block) []
231+
232+ -- |
233+ -- Generate code in the simplified Javascript intermediate representation for a reference to a
234+ -- variable.
235+ --
236+ varToJs :: Qualified Ident -> JS
237+ varToJs (Qualified Nothing ident) = var ident
238+ varToJs qual = qualifiedToJS id qual
239+
240+ -- |
241+ -- Generate code in the simplified Javascript intermediate representation for a reference to a
242+ -- variable that may have a qualified name.
243+ --
244+ qualifiedToJS :: (a -> Ident) -> Qualified a -> JS
245+ qualifiedToJS f (Qualified (Just (ModuleName [ProperName mn'])) a) | mn' == C.prim = JSVar . runIdent $ f a
246+ qualifiedToJS f (Qualified (Just mn') a) | mn /= mn' = accessor (f a) (JSVar (moduleNameToJs mn'))
247+ qualifiedToJS f (Qualified _ a) = JSVar $ identToJs (f a)
248+
249+ foreignIdent :: Ident -> JS
250+ foreignIdent ident = accessorString (runIdent ident) (JSVar "$foreign")
251+
252+ -- |
253+ -- Generate code in the simplified Javascript intermediate representation for pattern match binders
254+ -- and guards.
255+ --
256+ bindersToJs :: Maybe SourceSpan -> [CaseAlternative Ann] -> [JS] -> m JS
257+ bindersToJs maybeSpan binders vals = do
258+ valNames <- replicateM (length vals) freshName
259+ let assignments = zipWith JSVariableIntroduction valNames (map Just vals)
260+ jss <- forM binders $ \(CaseAlternative bs result) -> do
261+ ret <- guardsToJs result
262+ go valNames ret bs
263+ return $ JSApp (JSFunction Nothing [] (JSBlock (assignments ++ concat jss ++ [JSThrow $ failedPatternError valNames])))
264+ []
265+ where
266+ go :: [String] -> [JS] -> [Binder Ann] -> m [JS]
267+ go _ done [] = return done
268+ go (v:vs) done' (b:bs) = do
269+ done'' <- go vs done' bs
270+ binderToJs v done'' b
271+ go _ _ _ = error "Invalid arguments to bindersToJs"
272+
273+ failedPatternError :: [String] -> JS
274+ failedPatternError names = JSUnary JSNew $ JSApp (JSVar "Error") [JSBinary Add (JSStringLiteral errorMessage) (JSArrayLiteral $ zipWith valueError names vals)]
275+
276+ errorMessage :: String
277+ errorMessage = "Failed pattern match" ++ maybe "" (((" at " ++ runModuleName mn ++ " ") ++) . displayStartEndPos) maybeSpan ++ ": "
278+
279+ valueError :: String -> JS -> JS
280+ valueError _ l@(JSNumericLiteral _) = l
281+ valueError _ l@(JSStringLiteral _) = l
282+ valueError _ l@(JSBooleanLiteral _) = l
283+ valueError s _ = JSAccessor "name" . JSAccessor "constructor" $ JSVar s
284+
285+ guardsToJs :: Either [(Guard Ann, Expr Ann)] (Expr Ann) -> m [JS]
286+ guardsToJs (Left gs) = forM gs $ \(cond, val) -> do
287+ cond' <- valueToJs cond
288+ done <- valueToJs val
289+ return $ JSIfElse cond' (JSBlock [JSReturn done]) Nothing
290+ guardsToJs (Right v) = return . JSReturn <$> valueToJs v
291+
292+ -- |
293+ -- Generate code in the simplified Javascript intermediate representation for a pattern match
294+ -- binder.
295+ --
296+ binderToJs :: String -> [JS] -> Binder Ann -> m [JS]
297+ binderToJs _ done (NullBinder{}) = return done
298+ binderToJs varName done (LiteralBinder _ l) =
299+ literalToBinderJS varName done l
300+ binderToJs varName done (VarBinder _ ident) =
301+ return (JSVariableIntroduction (identToJs ident) (Just (JSVar varName)) : done)
302+ binderToJs varName done (ConstructorBinder (_, _, _, Just IsNewtype) _ _ [b]) =
303+ binderToJs varName done b
304+ binderToJs varName done (ConstructorBinder (_, _, _, Just (IsConstructor ctorType fields)) _ ctor bs) = do
305+ js <- go (zip fields bs) done
306+ return $ case ctorType of
307+ ProductType -> js
308+ SumType ->
309+ [JSIfElse (JSInstanceOf (JSVar varName) (qualifiedToJS (Ident . runProperName) ctor))
310+ (JSBlock js)
311+ Nothing]
312+ where
313+ go :: [(Ident, Binder Ann)] -> [JS] -> m [JS]
314+ go [] done' = return done'
315+ go ((field, binder) : remain) done' = do
316+ argVar <- freshName
317+ done'' <- go remain done'
318+ js <- binderToJs argVar done'' binder
319+ return (JSVariableIntroduction argVar (Just (JSAccessor (identToJs field) (JSVar varName))) : js)
320+ binderToJs _ _ b@(ConstructorBinder{}) =
321+ error $ "Invalid ConstructorBinder in binderToJs: " ++ show b
322+ binderToJs varName done (NamedBinder _ ident binder) = do
323+ js <- binderToJs varName done binder
324+ return (JSVariableIntroduction (identToJs ident) (Just (JSVar varName)) : js)
325+
326+ literalToBinderJS :: String -> [JS] -> Literal (Binder Ann) -> m [JS]
327+ literalToBinderJS varName done (NumericLiteral num) =
328+ return [JSIfElse (JSBinary EqualTo (JSVar varName) (JSNumericLiteral num)) (JSBlock done) Nothing]
329+ literalToBinderJS varName done (CharLiteral c) =
330+ return [JSIfElse (JSBinary EqualTo (JSVar varName) (JSStringLiteral [c])) (JSBlock done) Nothing]
331+ literalToBinderJS varName done (StringLiteral str) =
332+ return [JSIfElse (JSBinary EqualTo (JSVar varName) (JSStringLiteral str)) (JSBlock done) Nothing]
333+ literalToBinderJS varName done (BooleanLiteral True) =
334+ return [JSIfElse (JSVar varName) (JSBlock done) Nothing]
335+ literalToBinderJS varName done (BooleanLiteral False) =
336+ return [JSIfElse (JSUnary Not (JSVar varName)) (JSBlock done) Nothing]
337+ literalToBinderJS varName done (ObjectLiteral bs) = go done bs
338+ where
339+ go :: [JS] -> [(String, Binder Ann)] -> m [JS]
340+ go done' [] = return done'
341+ go done' ((prop, binder):bs') = do
342+ propVar <- freshName
343+ done'' <- go done' bs'
344+ js <- binderToJs propVar done'' binder
345+ return (JSVariableIntroduction propVar (Just (accessorString prop (JSVar varName))) : js)
346+ literalToBinderJS varName done (ArrayLiteral bs) = do
347+ js <- go done 0 bs
348+ return [JSIfElse (JSBinary EqualTo (JSAccessor "length" (JSVar varName)) (JSNumericLiteral (Left (fromIntegral $ length bs)))) (JSBlock js) Nothing]
349+ where
350+ go :: [JS] -> Integer -> [Binder Ann] -> m [JS]
351+ go done' _ [] = return done'
352+ go done' index (binder:bs') = do
353+ elVar <- freshName
354+ done'' <- go done' (index + 1) bs'
355+ js <- binderToJs elVar done'' binder
356+ return (JSVariableIntroduction elVar (Just (JSIndexer (JSNumericLiteral (Left index)) (JSVar varName))) : js)
357+
358+mainCall :: ModuleName -> String -> JS
359+mainCall mmi ns = JSApp (JSAccessor C.main (JSAccessor (moduleNameToJs mmi) (JSVar ns))) []
src/Language/PureScript/CodeGen/JS/AST.hsnew file+344
@@ -0,0 +1,344 @@
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+
18+module Language.PureScript.CodeGen.JS.AST where
19+
20+import Control.Applicative (Applicative, (<$>), (<*>))
21+import Control.Monad.Identity
22+import Data.Data
23+import Data.Traversable (traverse)
24+
25+import Language.PureScript.Comments
26+import Language.PureScript.Traversals
27+
28+-- |
29+-- Built-in unary operators
30+--
31+data UnaryOperator
32+ -- |
33+ -- Numeric negation
34+ --
35+ = Negate
36+ -- |
37+ -- Boolean negation
38+ --
39+ | Not
40+ -- |
41+ -- Bitwise negation
42+ --
43+ | BitwiseNot
44+ -- |
45+ -- Numeric unary \'plus\'
46+ --
47+ | Positive
48+ -- |
49+ -- Constructor
50+ --
51+ | JSNew deriving (Show, Eq, Data, Typeable)
52+
53+-- |
54+-- Built-in binary operators
55+--
56+data BinaryOperator
57+ -- |
58+ -- Numeric addition
59+ --
60+ = Add
61+ -- |
62+ -- Numeric subtraction
63+ --
64+ | Subtract
65+ -- |
66+ -- Numeric multiplication
67+ --
68+ | Multiply
69+ -- |
70+ -- Numeric division
71+ --
72+ | Divide
73+ -- |
74+ -- Remainder
75+ --
76+ | Modulus
77+ -- |
78+ -- Generic equality test
79+ --
80+ | EqualTo
81+ -- |
82+ -- Generic inequality test
83+ --
84+ | NotEqualTo
85+ -- |
86+ -- Numeric less-than
87+ --
88+ | LessThan
89+ -- |
90+ -- Numeric less-than-or-equal
91+ --
92+ | LessThanOrEqualTo
93+ -- |
94+ -- Numeric greater-than
95+ --
96+ | GreaterThan
97+ -- |
98+ -- Numeric greater-than-or-equal
99+ --
100+ | GreaterThanOrEqualTo
101+ -- |
102+ -- Boolean and
103+ --
104+ | And
105+ -- |
106+ -- Boolean or
107+ --
108+ | Or
109+ -- |
110+ -- Bitwise and
111+ --
112+ | BitwiseAnd
113+ -- |
114+ -- Bitwise or
115+ --
116+ | BitwiseOr
117+ -- |
118+ -- Bitwise xor
119+ --
120+ | BitwiseXor
121+ -- |
122+ -- Bitwise left shift
123+ --
124+ | ShiftLeft
125+ -- |
126+ -- Bitwise right shift
127+ --
128+ | ShiftRight
129+ -- |
130+ -- Bitwise right shift with zero-fill
131+ --
132+ | ZeroFillShiftRight deriving (Show, Eq, Data, Typeable)
133+
134+-- |
135+-- Data type for simplified Javascript expressions
136+--
137+data JS
138+ -- |
139+ -- A numeric literal
140+ --
141+ = JSNumericLiteral (Either Integer Double)
142+ -- |
143+ -- A string literal
144+ --
145+ | JSStringLiteral String
146+ -- |
147+ -- A boolean literal
148+ --
149+ | JSBooleanLiteral Bool
150+ -- |
151+ -- A unary operator application
152+ --
153+ | JSUnary UnaryOperator JS
154+ -- |
155+ -- A binary operator application
156+ --
157+ | JSBinary BinaryOperator JS JS
158+ -- |
159+ -- An array literal
160+ --
161+ | JSArrayLiteral [JS]
162+ -- |
163+ -- An array indexer expression
164+ --
165+ | JSIndexer JS JS
166+ -- |
167+ -- An object literal
168+ --
169+ | JSObjectLiteral [(String, JS)]
170+ -- |
171+ -- An object property accessor expression
172+ --
173+ | JSAccessor String JS
174+ -- |
175+ -- A function introduction (optional name, arguments, body)
176+ --
177+ | JSFunction (Maybe String) [String] JS
178+ -- |
179+ -- Function application
180+ --
181+ | JSApp JS [JS]
182+ -- |
183+ -- Variable
184+ --
185+ | JSVar String
186+ -- |
187+ -- Conditional expression
188+ --
189+ | JSConditional JS JS JS
190+ -- |
191+ -- A block of expressions in braces
192+ --
193+ | JSBlock [JS]
194+ -- |
195+ -- A variable introduction and optional initialization
196+ --
197+ | JSVariableIntroduction String (Maybe JS)
198+ -- |
199+ -- A variable assignment
200+ --
201+ | JSAssignment JS JS
202+ -- |
203+ -- While loop
204+ --
205+ | JSWhile JS JS
206+ -- |
207+ -- For loop
208+ --
209+ | JSFor String JS JS JS
210+ -- |
211+ -- ForIn loop
212+ --
213+ | JSForIn String JS JS
214+ -- |
215+ -- If-then-else statement
216+ --
217+ | JSIfElse JS JS (Maybe JS)
218+ -- |
219+ -- Return statement
220+ --
221+ | JSReturn JS
222+ -- |
223+ -- Throw statement
224+ --
225+ | JSThrow JS
226+ -- |
227+ -- Type-Of operator
228+ --
229+ | JSTypeOf JS
230+ -- |
231+ -- InstanceOf test
232+ --
233+ | JSInstanceOf JS JS
234+ -- |
235+ -- Labelled statement
236+ --
237+ | JSLabel String JS
238+ -- |
239+ -- Break statement
240+ --
241+ | JSBreak String
242+ -- |
243+ -- Continue statement
244+ --
245+ | JSContinue String
246+ -- |
247+ -- Raw Javascript (generated when parsing fails for an inline foreign import declaration)
248+ --
249+ | JSRaw String
250+ -- |
251+ -- Commented Javascript
252+ --
253+ | JSComment [Comment] JS deriving (Show, Eq, Data, Typeable)
254+
255+--
256+-- Traversals
257+--
258+
259+everywhereOnJS :: (JS -> JS) -> JS -> JS
260+everywhereOnJS f = go
261+ where
262+ go :: JS -> JS
263+ go (JSUnary op j) = f (JSUnary op (go j))
264+ go (JSBinary op j1 j2) = f (JSBinary op (go j1) (go j2))
265+ go (JSArrayLiteral js) = f (JSArrayLiteral (map go js))
266+ go (JSIndexer j1 j2) = f (JSIndexer (go j1) (go j2))
267+ go (JSObjectLiteral js) = f (JSObjectLiteral (map (fmap go) js))
268+ go (JSAccessor prop j) = f (JSAccessor prop (go j))
269+ go (JSFunction name args j) = f (JSFunction name args (go j))
270+ go (JSApp j js) = f (JSApp (go j) (map go js))
271+ go (JSConditional j1 j2 j3) = f (JSConditional (go j1) (go j2) (go j3))
272+ go (JSBlock js) = f (JSBlock (map go js))
273+ go (JSVariableIntroduction name j) = f (JSVariableIntroduction name (fmap go j))
274+ go (JSAssignment j1 j2) = f (JSAssignment (go j1) (go j2))
275+ go (JSWhile j1 j2) = f (JSWhile (go j1) (go j2))
276+ go (JSFor name j1 j2 j3) = f (JSFor name (go j1) (go j2) (go j3))
277+ go (JSForIn name j1 j2) = f (JSForIn name (go j1) (go j2))
278+ go (JSIfElse j1 j2 j3) = f (JSIfElse (go j1) (go j2) (fmap go j3))
279+ go (JSReturn js) = f (JSReturn (go js))
280+ go (JSThrow js) = f (JSThrow (go js))
281+ go (JSTypeOf js) = f (JSTypeOf (go js))
282+ go (JSLabel name js) = f (JSLabel name (go js))
283+ go (JSInstanceOf j1 j2) = f (JSInstanceOf (go j1) (go j2))
284+ go (JSComment com j) = f (JSComment com (go j))
285+ go other = f other
286+
287+everywhereOnJSTopDown :: (JS -> JS) -> JS -> JS
288+everywhereOnJSTopDown f = runIdentity . everywhereOnJSTopDownM (Identity . f)
289+
290+everywhereOnJSTopDownM :: (Applicative m, Monad m) => (JS -> m JS) -> JS -> m JS
291+everywhereOnJSTopDownM f = f >=> go
292+ where
293+ f' = f >=> go
294+ go (JSUnary op j) = JSUnary op <$> f' j
295+ go (JSBinary op j1 j2) = JSBinary op <$> f' j1 <*> f' j2
296+ go (JSArrayLiteral js) = JSArrayLiteral <$> traverse f' js
297+ go (JSIndexer j1 j2) = JSIndexer <$> f' j1 <*> f' j2
298+ go (JSObjectLiteral js) = JSObjectLiteral <$> traverse (sndM f') js
299+ go (JSAccessor prop j) = JSAccessor prop <$> f' j
300+ go (JSFunction name args j) = JSFunction name args <$> f' j
301+ go (JSApp j js) = JSApp <$> f' j <*> traverse f' js
302+ go (JSConditional j1 j2 j3) = JSConditional <$> f' j1 <*> f' j2 <*> f' j3
303+ go (JSBlock js) = JSBlock <$> traverse f' js
304+ go (JSVariableIntroduction name j) = JSVariableIntroduction name <$> traverse f' j
305+ go (JSAssignment j1 j2) = JSAssignment <$> f' j1 <*> f' j2
306+ go (JSWhile j1 j2) = JSWhile <$> f' j1 <*> f' j2
307+ go (JSFor name j1 j2 j3) = JSFor name <$> f' j1 <*> f' j2 <*> f' j3
308+ go (JSForIn name j1 j2) = JSForIn name <$> f' j1 <*> f' j2
309+ go (JSIfElse j1 j2 j3) = JSIfElse <$> f' j1 <*> f' j2 <*> traverse f' j3
310+ go (JSReturn j) = JSReturn <$> f' j
311+ go (JSThrow j) = JSThrow <$> f' j
312+ go (JSTypeOf j) = JSTypeOf <$> f' j
313+ go (JSLabel name j) = JSLabel name <$> f' j
314+ go (JSInstanceOf j1 j2) = JSInstanceOf <$> f' j1 <*> f' j2
315+ go (JSComment com j) = JSComment com <$> f' j
316+ go other = f other
317+
318+everythingOnJS :: (r -> r -> r) -> (JS -> r) -> JS -> r
319+everythingOnJS (<>) f = go
320+ where
321+ go j@(JSUnary _ j1) = f j <> go j1
322+ go j@(JSBinary _ j1 j2) = f j <> go j1 <> go j2
323+ go j@(JSArrayLiteral js) = foldl (<>) (f j) (map go js)
324+ go j@(JSIndexer j1 j2) = f j <> go j1 <> go j2
325+ go j@(JSObjectLiteral js) = foldl (<>) (f j) (map (go . snd) js)
326+ go j@(JSAccessor _ j1) = f j <> go j1
327+ go j@(JSFunction _ _ j1) = f j <> go j1
328+ go j@(JSApp j1 js) = foldl (<>) (f j <> go j1) (map go js)
329+ go j@(JSConditional j1 j2 j3) = f j <> go j1 <> go j2 <> go j3
330+ go j@(JSBlock js) = foldl (<>) (f j) (map go js)
331+ go j@(JSVariableIntroduction _ (Just j1)) = f j <> go j1
332+ go j@(JSAssignment j1 j2) = f j <> go j1 <> go j2
333+ go j@(JSWhile j1 j2) = f j <> go j1 <> go j2
334+ go j@(JSFor _ j1 j2 j3) = f j <> go j1 <> go j2 <> go j3
335+ go j@(JSForIn _ j1 j2) = f j <> go j1 <> go j2
336+ go j@(JSIfElse j1 j2 Nothing) = f j <> go j1 <> go j2
337+ go j@(JSIfElse j1 j2 (Just j3)) = f j <> go j1 <> go j2 <> go j3
338+ go j@(JSReturn j1) = f j <> go j1
339+ go j@(JSThrow j1) = f j <> go j1
340+ go j@(JSTypeOf j1) = f j <> go j1
341+ go j@(JSLabel _ j1) = f j <> go j1
342+ go j@(JSInstanceOf j1 j2) = f j <> go j1 <> go j2
343+ go j@(JSComment _ j1) = f j <> go j1
344+ go other = f other
src/Language/PureScript/CodeGen/JS/Common.hsnew file+181
@@ -0,0 +1,181 @@
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.hsnew file+89
@@ -0,0 +1,89 @@
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+
36+module Language.PureScript.CodeGen.JS.Optimizer (
37+ optimize
38+) where
39+
40+import Control.Applicative (Applicative)
41+import Control.Monad.Reader (MonadReader, ask, asks)
42+import Control.Monad.Supply.Class (MonadSupply)
43+
44+import Language.PureScript.CodeGen.JS.AST
45+import Language.PureScript.Options
46+import qualified Language.PureScript.Constants as C
47+
48+import Language.PureScript.CodeGen.JS.Optimizer.Common
49+import Language.PureScript.CodeGen.JS.Optimizer.TCO
50+import Language.PureScript.CodeGen.JS.Optimizer.MagicDo
51+import Language.PureScript.CodeGen.JS.Optimizer.Inliner
52+import Language.PureScript.CodeGen.JS.Optimizer.Unused
53+import Language.PureScript.CodeGen.JS.Optimizer.Blocks
54+
55+-- |
56+-- Apply a series of optimizer passes to simplified Javascript code
57+--
58+optimize :: (Monad m, MonadReader Options m, Applicative m, MonadSupply m) => JS -> m JS
59+optimize js = do
60+ noOpt <- asks optionsNoOptimizations
61+ if noOpt then return js else optimize' js
62+
63+optimize' :: (Monad m, MonadReader Options m, Applicative m, MonadSupply m) => JS -> m JS
64+optimize' js = do
65+ opts <- ask
66+ untilFixedPoint (inlineArrComposition . applyAll
67+ [ collapseNestedBlocks
68+ , collapseNestedIfs
69+ , tco opts
70+ , magicDo opts
71+ , removeCodeAfterReturnStatements
72+ , removeUnusedArg
73+ , removeUndefinedApp
74+ , unThunk
75+ , etaConvert
76+ , evaluateIifes
77+ , inlineVariables
78+ , inlineValues
79+ , inlineOperator (C.prelude, (C.$)) $ \f x -> JSApp f [x]
80+ , inlineOperator (C.prelude, (C.#)) $ \x f -> JSApp f [x]
81+ , inlineOperator (C.dataArrayUnsafe, C.unsafeIndex) $ flip JSIndexer
82+ , inlineCommonOperators ]) js
83+
84+untilFixedPoint :: (Monad m, Eq a) => (a -> m a) -> a -> m a
85+untilFixedPoint f = go
86+ where
87+ go a = do
88+ a' <- f a
89+ if a' == a then return a' else go a'
src/Language/PureScript/CodeGen/JS/Optimizer/Blocks.hsnew file+42
@@ -0,0 +1,42 @@
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.hsnew file+77
@@ -0,0 +1,77 @@
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.hsnew file+314
@@ -0,0 +1,314 @@
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+module Language.PureScript.CodeGen.JS.Optimizer.Inliner (
17+ inlineVariables,
18+ inlineValues,
19+ inlineOperator,
20+ inlineCommonOperators,
21+ inlineArrComposition,
22+ etaConvert,
23+ unThunk,
24+ evaluateIifes
25+) where
26+
27+import Control.Applicative (Applicative)
28+import Control.Monad.Supply.Class (MonadSupply, freshName)
29+import Data.Maybe (fromMaybe)
30+
31+import Language.PureScript.CodeGen.JS.AST
32+import Language.PureScript.CodeGen.JS.Common
33+import Language.PureScript.Names
34+import Language.PureScript.CodeGen.JS.Optimizer.Common
35+import qualified Language.PureScript.Constants as C
36+
37+-- TODO: Potential bug:
38+-- Shouldn't just inline this case: { var x = 0; x.toFixed(10); }
39+-- Needs to be: { 0..toFixed(10); }
40+-- Probably needs to be fixed in pretty-printer instead.
41+shouldInline :: JS -> Bool
42+shouldInline (JSVar _) = True
43+shouldInline (JSNumericLiteral _) = True
44+shouldInline (JSStringLiteral _) = True
45+shouldInline (JSBooleanLiteral _) = True
46+shouldInline (JSAccessor _ val) = shouldInline val
47+shouldInline (JSIndexer index val) = shouldInline index && shouldInline val
48+shouldInline _ = False
49+
50+etaConvert :: JS -> JS
51+etaConvert = everywhereOnJS convert
52+ where
53+ convert :: JS -> JS
54+ convert (JSBlock [JSReturn (JSApp (JSFunction Nothing idents block@(JSBlock body)) args)])
55+ | all shouldInline args &&
56+ not (any (`isRebound` block) (map JSVar idents)) &&
57+ not (any (`isRebound` block) args)
58+ = JSBlock (map (replaceIdents (zip idents args)) body)
59+ convert (JSFunction Nothing [] (JSBlock [JSReturn (JSApp fn [])])) = fn
60+ convert js = js
61+
62+unThunk :: JS -> JS
63+unThunk = everywhereOnJS convert
64+ where
65+ convert :: JS -> JS
66+ convert (JSBlock []) = JSBlock []
67+ convert (JSBlock jss) =
68+ case last jss of
69+ JSReturn (JSApp (JSFunction Nothing [] (JSBlock body)) []) -> JSBlock $ init jss ++ body
70+ _ -> JSBlock jss
71+ convert js = js
72+
73+evaluateIifes :: JS -> JS
74+evaluateIifes = everywhereOnJS convert
75+ where
76+ convert :: JS -> JS
77+ convert (JSApp (JSFunction Nothing [] (JSBlock [JSReturn ret])) []) = ret
78+ convert js = js
79+
80+inlineVariables :: JS -> JS
81+inlineVariables = everywhereOnJS $ removeFromBlock go
82+ where
83+ go :: [JS] -> [JS]
84+ go [] = []
85+ go (JSVariableIntroduction var (Just js) : sts)
86+ | shouldInline js && not (any (isReassigned var) sts) && not (any (isRebound js) sts) && not (any (isUpdated var) sts) =
87+ go (map (replaceIdent var js) sts)
88+ go (s:sts) = s : go sts
89+
90+inlineValues :: JS -> JS
91+inlineValues = everywhereOnJS convert
92+ where
93+ convert :: JS -> JS
94+ convert (JSApp fn [dict]) | isDict semiringNumber dict && isFn fnZero fn = JSNumericLiteral (Left 0)
95+ | isDict semiringNumber dict && isFn fnOne fn = JSNumericLiteral (Left 1)
96+ | isDict semiringInt dict && isFn fnZero fn = JSNumericLiteral (Left 0)
97+ | isDict semiringInt dict && isFn fnOne fn = JSNumericLiteral (Left 1)
98+ | isDict boundedBoolean dict && isFn fnBottom fn = JSBooleanLiteral False
99+ | isDict boundedBoolean dict && isFn fnTop fn = JSBooleanLiteral True
100+ convert (JSApp (JSApp (JSApp fn [dict]) [x]) [y])
101+ | isDict semiringInt dict && isFn fnAdd fn = JSBinary BitwiseOr (JSBinary Add x y) (JSNumericLiteral (Left 0))
102+ | isDict semiringInt dict && isFn fnMultiply fn = JSBinary BitwiseOr (JSBinary Multiply x y) (JSNumericLiteral (Left 0))
103+ | isDict moduloSemiringInt dict && isFn fnDivide fn = JSBinary BitwiseOr (JSBinary Divide x y) (JSNumericLiteral (Left 0))
104+ | isDict ringInt dict && isFn fnSubtract fn = JSBinary BitwiseOr (JSBinary Subtract x y) (JSNumericLiteral (Left 0))
105+ convert other = other
106+ fnZero = (C.prelude, C.zero)
107+ fnOne = (C.prelude, C.one)
108+ fnBottom = (C.prelude, C.bottom)
109+ fnTop = (C.prelude, C.top)
110+ fnAdd = (C.prelude, (C.+))
111+ fnDivide = (C.prelude, (C./))
112+ fnMultiply = (C.prelude, (C.*))
113+ fnSubtract = (C.prelude, (C.-))
114+
115+inlineOperator :: (String, String) -> (JS -> JS -> JS) -> JS -> JS
116+inlineOperator (m, op) f = everywhereOnJS convert
117+ where
118+ convert :: JS -> JS
119+ convert (JSApp (JSApp op' [x]) [y]) | isOp op' = f x y
120+ convert other = other
121+ isOp (JSAccessor longForm (JSVar m')) = m == m' && longForm == identToJs (Op op)
122+ isOp (JSIndexer (JSStringLiteral op') (JSVar m')) = m == m' && op == op'
123+ isOp _ = False
124+
125+inlineCommonOperators :: JS -> JS
126+inlineCommonOperators = applyAll $
127+ [ binary semiringNumber (C.+) Add
128+ , binary semiringNumber (C.*) Multiply
129+
130+ , binary ringNumber (C.-) Subtract
131+ , unary ringNumber C.negate Negate
132+ , binary ringInt (C.-) Subtract
133+ , unary ringInt C.negate Negate
134+
135+ , binary moduloSemiringNumber (C./) Divide
136+ , binary moduloSemiringInt C.mod Modulus
137+
138+ , binary eqNumber (C.==) EqualTo
139+ , binary eqNumber (C./=) NotEqualTo
140+ , binary eqInt (C.==) EqualTo
141+ , binary eqInt (C./=) NotEqualTo
142+ , binary eqString (C.==) EqualTo
143+ , binary eqString (C./=) NotEqualTo
144+ , binary eqBoolean (C.==) EqualTo
145+ , binary eqBoolean (C./=) NotEqualTo
146+
147+ , binary ordNumber (C.<) LessThan
148+ , binary ordNumber (C.>) GreaterThan
149+ , binary ordNumber (C.<=) LessThanOrEqualTo
150+ , binary ordNumber (C.>=) GreaterThanOrEqualTo
151+ , binary ordInt (C.<) LessThan
152+ , binary ordInt (C.>) GreaterThan
153+ , binary ordInt (C.<=) LessThanOrEqualTo
154+ , binary ordInt (C.>=) GreaterThanOrEqualTo
155+
156+ , binary semigroupString (C.<>) Add
157+ , binary semigroupString (C.++) Add
158+
159+ , binary booleanAlgebraBoolean (C.&&) And
160+ , binary booleanAlgebraBoolean (C.||) Or
161+ , binaryFunction booleanAlgebraBoolean C.conj And
162+ , binaryFunction booleanAlgebraBoolean C.disj Or
163+ , unary booleanAlgebraBoolean C.not Not
164+
165+ , binary' C.dataIntBits (C..|.) BitwiseOr
166+ , binary' C.dataIntBits (C..&.) BitwiseAnd
167+ , binary' C.dataIntBits (C..^.) BitwiseXor
168+ , binary' C.dataIntBits C.shl ShiftLeft
169+ , binary' C.dataIntBits C.shr ShiftRight
170+ , binary' C.dataIntBits C.zshr ZeroFillShiftRight
171+ , unary' C.dataIntBits C.complement BitwiseNot
172+ ] ++
173+ [ fn | i <- [0..10], fn <- [ mkFn i, runFn i ] ]
174+ where
175+ binary :: (String, String) -> String -> BinaryOperator -> JS -> JS
176+ binary dict opString op = everywhereOnJS convert
177+ where
178+ convert :: JS -> JS
179+ convert (JSApp (JSApp (JSApp fn [dict']) [x]) [y]) | isDict dict dict' && isPreludeFn opString fn = JSBinary op x y
180+ convert other = other
181+ binary' :: String -> String -> BinaryOperator -> JS -> JS
182+ binary' moduleName opString op = everywhereOnJS convert
183+ where
184+ convert :: JS -> JS
185+ convert (JSApp (JSApp fn [x]) [y]) | isFn (moduleName, opString) fn = JSBinary op x y
186+ convert other = other
187+ binaryFunction :: (String, String) -> String -> BinaryOperator -> JS -> JS
188+ binaryFunction dict fnName op = everywhereOnJS convert
189+ where
190+ convert :: JS -> JS
191+ convert (JSApp (JSApp (JSApp fn [dict']) [x]) [y]) | isPreludeFn fnName fn && isDict dict dict' = JSBinary op x y
192+ convert other = other
193+ unary :: (String, String) -> String -> UnaryOperator -> JS -> JS
194+ unary dict fnName op = everywhereOnJS convert
195+ where
196+ convert :: JS -> JS
197+ convert (JSApp (JSApp fn [dict']) [x]) | isPreludeFn fnName fn && isDict dict dict' = JSUnary op x
198+ convert other = other
199+ unary' :: String -> String -> UnaryOperator -> JS -> JS
200+ unary' moduleName fnName op = everywhereOnJS convert
201+ where
202+ convert :: JS -> JS
203+ convert (JSApp fn [x]) | isFn (moduleName, fnName) fn = JSUnary op x
204+ convert other = other
205+ mkFn :: Int -> JS -> JS
206+ mkFn 0 = everywhereOnJS convert
207+ where
208+ convert :: JS -> JS
209+ convert (JSApp mkFnN [JSFunction Nothing [_] (JSBlock js)]) | isNFn C.mkFn 0 mkFnN =
210+ JSFunction Nothing [] (JSBlock js)
211+ convert other = other
212+ mkFn n = everywhereOnJS convert
213+ where
214+ convert :: JS -> JS
215+ convert orig@(JSApp mkFnN [fn]) | isNFn C.mkFn n mkFnN =
216+ case collectArgs n [] fn of
217+ Just (args, js) -> JSFunction Nothing args (JSBlock js)
218+ Nothing -> orig
219+ convert other = other
220+ collectArgs :: Int -> [String] -> JS -> Maybe ([String], [JS])
221+ collectArgs 1 acc (JSFunction Nothing [oneArg] (JSBlock js)) | length acc == n - 1 = Just (reverse (oneArg : acc), js)
222+ collectArgs m acc (JSFunction Nothing [oneArg] (JSBlock [JSReturn ret])) = collectArgs (m - 1) (oneArg : acc) ret
223+ collectArgs _ _ _ = Nothing
224+
225+ isNFn :: String -> Int -> JS -> Bool
226+ isNFn prefix n (JSVar name) = name == (prefix ++ show n)
227+ isNFn prefix n (JSAccessor name (JSVar dataFunction)) | dataFunction == C.dataFunction = name == (prefix ++ show n)
228+ isNFn _ _ _ = False
229+
230+ runFn :: Int -> JS -> JS
231+ runFn n = everywhereOnJS convert
232+ where
233+ convert :: JS -> JS
234+ convert js = fromMaybe js $ go n [] js
235+
236+ go :: Int -> [JS] -> JS -> Maybe JS
237+ go 0 acc (JSApp runFnN [fn]) | isNFn C.runFn n runFnN && length acc == n = Just (JSApp fn acc)
238+ go m acc (JSApp lhs [arg]) = go (m - 1) (arg : acc) lhs
239+ go _ _ _ = Nothing
240+
241+-- (f <<< g $ x) = f (g x)
242+-- (f <<< g) = \x -> f (g x)
243+inlineArrComposition :: (Applicative m, MonadSupply m) => JS -> m JS
244+inlineArrComposition = everywhereOnJSTopDownM convert
245+ where
246+ convert :: (MonadSupply m) => JS -> m JS
247+ convert (JSApp (JSApp (JSApp (JSApp fn [dict']) [x]) [y]) [z]) | isArrCompose dict' fn =
248+ return $ JSApp x [JSApp y [z]]
249+ convert (JSApp (JSApp (JSApp fn [dict']) [x]) [y]) | isArrCompose dict' fn = do
250+ arg <- freshName
251+ return $ JSFunction Nothing [arg] (JSBlock [JSReturn $ JSApp x [JSApp y [JSVar arg]]])
252+ convert other = return other
253+ isArrCompose :: JS -> JS -> Bool
254+ isArrCompose dict' fn = isDict semigroupoidArr dict' && isPreludeFn (C.<<<) fn
255+
256+isDict :: (String, String) -> JS -> Bool
257+isDict (moduleName, dictName) (JSAccessor x (JSVar y)) = x == dictName && y == moduleName
258+isDict _ _ = False
259+
260+isFn :: (String, String) -> JS -> Bool
261+isFn (moduleName, fnName) (JSAccessor x (JSVar y)) = x == fnName && y == moduleName
262+isFn (moduleName, fnName) (JSIndexer (JSStringLiteral x) (JSVar y)) = x == fnName && y == moduleName
263+isFn _ _ = False
264+
265+isPreludeFn :: String -> JS -> Bool
266+isPreludeFn fnName = isFn (C.prelude, fnName)
267+
268+semiringNumber :: (String, String)
269+semiringNumber = (C.prelude, C.semiringNumber)
270+
271+semiringInt :: (String, String)
272+semiringInt = (C.prelude, C.semiringInt)
273+
274+ringNumber :: (String, String)
275+ringNumber = (C.prelude, C.ringNumber)
276+
277+ringInt :: (String, String)
278+ringInt = (C.prelude, C.ringInt)
279+
280+moduloSemiringNumber :: (String, String)
281+moduloSemiringNumber = (C.prelude, C.moduloSemiringNumber)
282+
283+moduloSemiringInt :: (String, String)
284+moduloSemiringInt = (C.prelude, C.moduloSemiringInt)
285+
286+eqNumber :: (String, String)
287+eqNumber = (C.prelude, C.eqNumber)
288+
289+eqInt :: (String, String)
290+eqInt = (C.prelude, C.eqInt)
291+
292+eqString :: (String, String)
293+eqString = (C.prelude, C.eqNumber)
294+
295+eqBoolean :: (String, String)
296+eqBoolean = (C.prelude, C.eqNumber)
297+
298+ordNumber :: (String, String)
299+ordNumber = (C.prelude, C.ordNumber)
300+
301+ordInt :: (String, String)
302+ordInt = (C.prelude, C.ordInt)
303+
304+semigroupString :: (String, String)
305+semigroupString = (C.prelude, C.semigroupString)
306+
307+boundedBoolean :: (String, String)
308+boundedBoolean = (C.prelude, C.boundedBoolean)
309+
310+booleanAlgebraBoolean :: (String, String)
311+booleanAlgebraBoolean = (C.prelude, C.booleanAlgebraBoolean)
312+
313+semigroupoidArr :: (String, String)
314+semigroupoidArr = (C.prelude, C.semigroupoidArr)
src/Language/PureScript/CodeGen/JS/Optimizer/MagicDo.hsnew file+165
@@ -0,0 +1,165 @@
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.hsnew file+128
@@ -0,0 +1,128 @@
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.hsnew file+46
@@ -0,0 +1,46 @@
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 : _) = span (not . 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.hsnew file+25
@@ -0,0 +1,25 @@
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+
18+module Language.PureScript.Comments where
19+
20+import qualified Data.Data as D
21+
22+data Comment
23+ = LineComment String
24+ | BlockComment String
25+ deriving (Show, Eq, Ord, D.Data, D.Typeable)
src/Language/PureScript/Constants.hsnew file+275
@@ -0,0 +1,275 @@
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+-- Functions
93+
94+negate :: String
95+negate = "negate"
96+
97+not :: String
98+not = "not"
99+
100+conj :: String
101+conj = "conj"
102+
103+disj :: String
104+disj = "disj"
105+
106+mod :: String
107+mod = "mod"
108+
109+shl :: String
110+shl = "shl"
111+
112+shr :: String
113+shr = "shr"
114+
115+zshr :: String
116+zshr = "zshr"
117+
118+complement :: String
119+complement = "complement"
120+
121+-- Prelude Values
122+
123+zero :: String
124+zero = "zero"
125+
126+one :: String
127+one = "one"
128+
129+bottom :: String
130+bottom = "bottom"
131+
132+top :: String
133+top = "top"
134+
135+return :: String
136+return = "return"
137+
138+pure' :: String
139+pure' = "pure"
140+
141+returnEscaped :: String
142+returnEscaped = "$return"
143+
144+untilE :: String
145+untilE = "untilE"
146+
147+whileE :: String
148+whileE = "whileE"
149+
150+runST :: String
151+runST = "runST"
152+
153+stRefValue :: String
154+stRefValue = "value"
155+
156+newSTRef :: String
157+newSTRef = "newSTRef"
158+
159+readSTRef :: String
160+readSTRef = "readSTRef"
161+
162+writeSTRef :: String
163+writeSTRef = "writeSTRef"
164+
165+modifySTRef :: String
166+modifySTRef = "modifySTRef"
167+
168+mkFn :: String
169+mkFn = "mkFn"
170+
171+runFn :: String
172+runFn = "runFn"
173+
174+unit :: String
175+unit = "unit"
176+
177+-- Prim values
178+
179+undefined :: String
180+undefined = "undefined"
181+
182+-- Type Class Dictionary Names
183+
184+monadEffDictionary :: String
185+monadEffDictionary = "monadEff"
186+
187+applicativeEffDictionary :: String
188+applicativeEffDictionary = "applicativeEff"
189+
190+bindEffDictionary :: String
191+bindEffDictionary = "bindEff"
192+
193+semiringNumber :: String
194+semiringNumber = "semiringNumber"
195+
196+semiringInt :: String
197+semiringInt = "semiringInt"
198+
199+ringNumber :: String
200+ringNumber = "ringNumber"
201+
202+ringInt :: String
203+ringInt = "ringInt"
204+
205+moduloSemiringNumber :: String
206+moduloSemiringNumber = "moduloSemiringNumber"
207+
208+moduloSemiringInt :: String
209+moduloSemiringInt = "moduloSemiringInt"
210+
211+ordNumber :: String
212+ordNumber = "ordNumber"
213+
214+ordInt :: String
215+ordInt = "ordInt"
216+
217+eqNumber :: String
218+eqNumber = "eqNumber"
219+
220+eqInt :: String
221+eqInt = "eqInt"
222+
223+eqString :: String
224+eqString = "eqString"
225+
226+eqBoolean :: String
227+eqBoolean = "eqBoolean"
228+
229+boundedBoolean :: String
230+boundedBoolean = "boundedBoolean"
231+
232+booleanAlgebraBoolean :: String
233+booleanAlgebraBoolean = "booleanAlgebraBoolean"
234+
235+semigroupString :: String
236+semigroupString = "semigroupString"
237+
238+semigroupoidArr :: String
239+semigroupoidArr = "semigroupoidArr"
240+
241+-- Main module
242+
243+main :: String
244+main = "main"
245+
246+-- Code Generation
247+
248+__superclass_ :: String
249+__superclass_ = "__superclass_"
250+
251+__unused :: String
252+__unused = "__unused"
253+
254+-- Modules
255+
256+prim :: String
257+prim = "Prim"
258+
259+prelude :: String
260+prelude = "Prelude"
261+
262+dataArrayUnsafe :: String
263+dataArrayUnsafe = "Data_Array_Unsafe"
264+
265+eff :: String
266+eff = "Control_Monad_Eff"
267+
268+st :: String
269+st = "Control_Monad_ST"
270+
271+dataFunction :: String
272+dataFunction = "Data_Function"
273+
274+dataIntBits :: String
275+dataIntBits = "Data_Int_Bits"
src/Language/PureScript/CoreFn.hsnew file+26
@@ -0,0 +1,26 @@
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.hsnew file+37
@@ -0,0 +1,37 @@
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.hsnew file+48
@@ -0,0 +1,48 @@
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, D.Data, D.Typeable, Functor)
src/Language/PureScript/CoreFn/Desugar.hsnew file+264
@@ -0,0 +1,264 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.CoreFn.Desugar
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 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+
170+ -- |
171+ -- Gets metadata for values.
172+ --
173+ getValueMeta :: Qualified Ident -> Maybe Meta
174+ getValueMeta name =
175+ case lookupValue env name of
176+ Just (_, External, _) -> Just IsForeign
177+ _ -> Nothing
178+
179+ -- |
180+ -- Gets metadata for data constructors.
181+ --
182+ getConstructorMeta :: Qualified ProperName -> Meta
183+ getConstructorMeta ctor =
184+ case lookupConstructor env ctor of
185+ (Newtype, _, _, _) -> IsNewtype
186+ dc@(Data, _, _, fields) ->
187+ let constructorType = if numConstructors (ctor, dc) == 1 then ProductType else SumType
188+ in IsConstructor constructorType fields
189+ where
190+ numConstructors :: (Qualified ProperName, (DataDeclType, ProperName, Type, [Ident])) -> Int
191+ numConstructors ty = length $ filter (((==) `on` typeConstructor) ty) $ M.toList $ dataConstructors env
192+ typeConstructor :: (Qualified ProperName, (DataDeclType, ProperName, Type, [Ident])) -> (ModuleName, ProperName)
193+ typeConstructor (Qualified (Just mn') _, (_, tyCtor, _, _)) = (mn', tyCtor)
194+ typeConstructor _ = error "Invalid argument to typeConstructor"
195+
196+-- |
197+-- Find module names from qualified references to values. This is used to
198+-- ensure instances are imported from any module that is referenced by the
199+-- current module, not just from those that are imported explicitly (#667).
200+--
201+findQualModules :: [A.Declaration] -> [ModuleName]
202+findQualModules decls =
203+ let (f, _, _, _, _) = everythingOnValues (++) (const []) fqValues fqBinders (const []) (const [])
204+ in f `concatMap` decls
205+ where
206+ fqValues :: A.Expr -> [ModuleName]
207+ fqValues (A.Var (Qualified (Just mn) _)) = [mn]
208+ fqValues (A.Constructor (Qualified (Just mn) _)) = [mn]
209+ fqValues _ = []
210+
211+ fqBinders :: A.Binder -> [ModuleName]
212+ fqBinders (A.ConstructorBinder (Qualified (Just mn) _) _) = [mn]
213+ fqBinders _ = []
214+
215+-- |
216+-- Desugars import declarations from AST to CoreFn representation.
217+--
218+importToCoreFn :: A.Declaration -> Maybe ModuleName
219+importToCoreFn (A.ImportDeclaration name _ _) = Just name
220+importToCoreFn (A.PositionedDeclaration _ _ d) = importToCoreFn d
221+importToCoreFn _ = Nothing
222+
223+-- |
224+-- Desugars foreign declarations from AST to CoreFn representation.
225+--
226+externToCoreFn :: A.Declaration -> Maybe ForeignDecl
227+externToCoreFn (A.ExternDeclaration name ty) = Just (name, ty)
228+externToCoreFn (A.ExternInstanceDeclaration name _ _ _) = Just (name, tyObject)
229+externToCoreFn (A.PositionedDeclaration _ _ d) = externToCoreFn d
230+externToCoreFn _ = Nothing
231+
232+-- |
233+-- Desugars export declarations references from AST to CoreFn representation.
234+-- CoreFn modules only export values, so all data constructors, class
235+-- constructor, instances and values are flattened into one list.
236+--
237+exportToCoreFn :: A.DeclarationRef -> [Ident]
238+exportToCoreFn (A.TypeRef _ (Just dctors)) = map properToIdent dctors
239+exportToCoreFn (A.ValueRef name) = [name]
240+exportToCoreFn (A.TypeClassRef name) = [properToIdent name]
241+exportToCoreFn (A.TypeInstanceRef name) = [name]
242+exportToCoreFn (A.PositionedDeclarationRef _ _ d) = exportToCoreFn d
243+exportToCoreFn _ = []
244+
245+-- |
246+-- Makes a typeclass dictionary constructor function. The returned expression
247+-- is a function that accepts the superclass instances and member
248+-- implementations and returns a record for the instance dictionary.
249+--
250+mkTypeClassConstructor :: Maybe SourceSpan -> [Comment] -> [Constraint] -> [A.Declaration] -> Expr Ann
251+mkTypeClassConstructor ss com [] [] = Literal (ss, com, Nothing, Just IsTypeClassConstructor) (ObjectLiteral [])
252+mkTypeClassConstructor ss com supers members =
253+ let args@(a:as) = sort $ map typeClassMemberName members ++ superClassDictionaryNames supers
254+ props = [ (arg, Var nullAnn $ Qualified Nothing (Ident arg)) | arg <- args ]
255+ dict = Literal nullAnn (ObjectLiteral props)
256+ in Abs (ss, com, Nothing, Just IsTypeClassConstructor)
257+ (Ident a)
258+ (foldr (Abs nullAnn . Ident) dict as)
259+
260+-- |
261+-- Converts a ProperName to an Ident.
262+--
263+properToIdent :: ProperName -> Ident
264+properToIdent = Ident . runProperName
src/Language/PureScript/CoreFn/Expr.hsnew file+134
@@ -0,0 +1,134 @@
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, 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, 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, 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.hsnew file+50
@@ -0,0 +1,50 @@
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, D.Data, D.Typeable, Functor)
src/Language/PureScript/CoreFn/Meta.hsnew file+55
@@ -0,0 +1,55 @@
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, 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, D.Data, D.Typeable)
src/Language/PureScript/CoreFn/Module.hsnew file+31
@@ -0,0 +1,31 @@
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)
30+
31+type ForeignDecl = (Ident, Type)
src/Language/PureScript/CoreFn/Traversals.hsnew file+85
@@ -0,0 +1,85 @@
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.hsnew file+14
@@ -0,0 +1,14 @@
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.hsnew file+124
@@ -0,0 +1,124 @@
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, 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.hsnew file+228
@@ -0,0 +1,228 @@
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 (show 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 (show name)
110+getDeclarationTitle (P.ExternDeclaration name _) = Just (show name)
111+getDeclarationTitle (P.DataDeclaration _ name _ _) = Just (show name)
112+getDeclarationTitle (P.ExternDataDeclaration name _) = Just (show name)
113+getDeclarationTitle (P.TypeSynonymDeclaration name _ _) = Just (show name)
114+getDeclarationTitle (P.TypeClassDeclaration name _ _ _) = Just (show name)
115+getDeclarationTitle (P.TypeInstanceDeclaration name _ _ _ _) = Just (show 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 (show 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 = do
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 (show ident') Nothing Nothing (ChildTypeClassMember ty)
159+ convertClassMember _ =
160+ error "Invalid argument to convertClassMember."
161+convertDeclaration (P.TypeInstanceDeclaration _ constraints className tys _) title = do
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 show y
167+
168+ extractProperNames (P.TypeConstructor n) = [unQual n]
169+ extractProperNames (P.SaturatedTypeSynonym n _) = [unQual n]
170+ extractProperNames _ = []
171+
172+ childDecl = ChildDeclaration title Nothing Nothing (ChildInstance constraints classApp)
173+ classApp = foldl P.TypeApp (P.TypeConstructor className) tys
174+convertDeclaration (P.FixityDeclaration fixity _) title =
175+ Just (Left ([title], AugmentFixity fixity))
176+convertDeclaration (P.PositionedDeclaration srcSpan com d') title =
177+ fmap (addComments . addSourceSpan) (convertDeclaration d' title)
178+ where
179+ addComments (Right d) =
180+ Right (d { declComments = convertComments com })
181+ addComments (Left augment) =
182+ Left (withAugmentChild (\d -> d { cdeclComments = convertComments com })
183+ augment)
184+
185+ addSourceSpan (Right d) =
186+ Right (d { declSourceSpan = Just srcSpan })
187+ addSourceSpan (Left augment) =
188+ Left (withAugmentChild (\d -> d { cdeclSourceSpan = Just srcSpan })
189+ augment)
190+
191+ withAugmentChild f (t, a) =
192+ case a of
193+ AugmentChild d -> (t, AugmentChild (f d))
194+ _ -> (t, a)
195+convertDeclaration _ _ = Nothing
196+
197+convertComments :: [P.Comment] -> Maybe String
198+convertComments cs = do
199+ let raw = concatMap toLines cs
200+ guard (all hasPipe raw && not (null raw))
201+ return (go raw)
202+ where
203+ go = unlines . map stripPipes
204+
205+ toLines (P.LineComment s) = [s]
206+ toLines (P.BlockComment s) = lines s
207+
208+ hasPipe s = case dropWhile (== ' ') s of { ('|':_) -> True; _ -> False }
209+
210+ stripPipes = dropPipe . dropWhile (== ' ')
211+
212+ dropPipe ('|':' ':s) = s
213+ dropPipe ('|':s) = s
214+ dropPipe s = s
215+
216+-- | Go through a PureScript module and extract a list of Bookmarks; references
217+-- to data types or values, to be used as a kind of index. These are used for
218+-- generating links in the HTML documentation, for example.
219+collectBookmarks :: InPackage P.Module -> [Bookmark]
220+collectBookmarks (Local m) = map Local (collectBookmarks' m)
221+collectBookmarks (FromDep pkg m) = map (FromDep pkg) (collectBookmarks' m)
222+
223+collectBookmarks' :: P.Module -> [(P.ModuleName, String)]
224+collectBookmarks' m =
225+ map (P.getModuleName m, )
226+ (mapMaybe getDeclarationTitle
227+ (P.exportedDeclarations m))
228+
src/Language/PureScript/Docs/ParseAndDesugar.hsnew file+141
@@ -0,0 +1,141 @@
1+{-# LANGUAGE TupleSections #-}
2+
3+module Language.PureScript.Docs.ParseAndDesugar
4+ ( parseAndDesugar
5+ , ParseDesugarError(..)
6+ ) where
7+
8+import qualified Data.Map as M
9+import Control.Arrow (first)
10+import Control.Monad
11+import Control.Applicative
12+
13+import Control.Monad.Trans.Except
14+import Control.Monad.Error.Class (MonadError(..))
15+import Control.Monad.IO.Class (MonadIO(..))
16+
17+import Web.Bower.PackageMeta (PackageName)
18+
19+import qualified Language.PureScript as P
20+import qualified Language.PureScript.Constants as C
21+import Language.PureScript.Docs.Types
22+import Language.PureScript.Docs.Convert (collectBookmarks)
23+
24+data ParseDesugarError
25+ = ParseError P.MultipleErrors
26+ | SortModulesError P.MultipleErrors
27+ | DesugarError P.MultipleErrors
28+ deriving (Show)
29+
30+-- |
31+-- Given:
32+--
33+-- * A list of local source files
34+-- * A list of source files from external dependencies, together with their
35+-- package names
36+-- * A callback, taking a list of bookmarks, and a list of desugared modules
37+--
38+-- This function does the following:
39+--
40+-- * Parse all of the input and dependency source files
41+-- * Partially desugar all of the resulting modules
42+-- * Collect a list of bookmarks from the whole set of source files
43+-- * Collect a list of desugared modules from just the input source files (not
44+-- dependencies)
45+-- * Call the callback with the bookmarks and desugared module list.
46+parseAndDesugar ::
47+ [FilePath]
48+ -> [(PackageName, FilePath)]
49+ -> ([Bookmark] -> [P.Module] -> IO a)
50+ -> IO (Either ParseDesugarError a)
51+parseAndDesugar inputFiles depsFiles callback = do
52+ inputFiles' <- mapM (parseAs Local) inputFiles
53+ depsFiles' <- mapM (\(pkgName, f) -> parseAs (FromDep pkgName) f) depsFiles
54+
55+ runExceptT $ do
56+ ms <- parseFiles (inputFiles' ++ depsFiles')
57+ ms' <- sortModules (map snd ms)
58+ (bs, ms'') <- desugarWithBookmarks ms ms'
59+ liftIO $ callback bs ms''
60+
61+parseFiles ::
62+ [(FileInfo, FilePath)]
63+ -> ExceptT ParseDesugarError IO [(FileInfo, P.Module)]
64+parseFiles =
65+ throwLeft ParseError . P.parseModulesFromFiles fileInfoToString
66+
67+sortModules ::
68+ [P.Module]
69+ -> ExceptT ParseDesugarError IO [P.Module]
70+sortModules =
71+ fmap fst . throwLeft SortModulesError . sortModules' . map importPrim
72+ where
73+ sortModules' :: [P.Module] -> Either P.MultipleErrors ([P.Module], P.ModuleGraph)
74+ sortModules' = P.sortModules
75+
76+desugarWithBookmarks ::
77+ [(FileInfo, P.Module)]
78+ -> [P.Module]
79+ -> ExceptT ParseDesugarError IO ([Bookmark], [P.Module])
80+desugarWithBookmarks msInfo msSorted = do
81+ msDesugared <- throwLeft DesugarError (desugar msSorted)
82+
83+ let msDeps = getDepsModuleNames (map (\(fp, m) -> (,m) <$> fp) msInfo)
84+ msPackages = map (addPackage msDeps) msDesugared
85+ bookmarks = concatMap collectBookmarks msPackages
86+
87+ return (bookmarks, takeLocals msPackages)
88+
89+throwLeft :: (MonadError e m) => (l -> e) -> Either l r -> m r
90+throwLeft f = either (throwError . f) return
91+
92+-- | Specifies whether a PureScript source file is considered as:
93+--
94+-- 1) with the `Local` constructor, a target source file, i.e., we want to see
95+-- its modules in the output
96+-- 2) with the `FromDep` constructor, a dependencies source file, i.e. we do
97+-- not want its modules in the output; it is there to enable desugaring, and
98+-- to ensure that links between modules are constructed correctly.
99+type FileInfo = InPackage FilePath
100+
101+fileInfoToString :: FileInfo -> FilePath
102+fileInfoToString (Local fn) = fn
103+fileInfoToString (FromDep _ fn) = fn
104+
105+addDefaultImport :: P.ModuleName -> P.Module -> P.Module
106+addDefaultImport toImport m@(P.Module coms mn decls exps) =
107+ if isExistingImport `any` decls || mn == toImport then m
108+ else P.Module coms mn (P.ImportDeclaration toImport P.Implicit Nothing : decls) exps
109+ where
110+ isExistingImport (P.ImportDeclaration mn' _ _) | mn' == toImport = True
111+ isExistingImport (P.PositionedDeclaration _ _ d) = isExistingImport d
112+ isExistingImport _ = False
113+
114+importPrim :: P.Module -> P.Module
115+importPrim = addDefaultImport (P.ModuleName [P.ProperName C.prim])
116+
117+desugar :: [P.Module] -> Either P.MultipleErrors [P.Module]
118+desugar = P.evalSupplyT 0 . desugar'
119+ where
120+ desugar' :: [P.Module] -> P.SupplyT (Either P.MultipleErrors) [P.Module]
121+ desugar' = mapM P.desugarDoModule >=> P.desugarCasesModule >=> P.desugarImports
122+
123+parseFile :: FilePath -> IO (FilePath, String)
124+parseFile input' = (,) input' <$> readFile input'
125+
126+parseAs :: (FilePath -> a) -> FilePath -> IO (a, String)
127+parseAs g = fmap (first g) . parseFile
128+
129+getDepsModuleNames :: [InPackage (FilePath, P.Module)] -> M.Map P.ModuleName PackageName
130+getDepsModuleNames = foldl go M.empty
131+ where
132+ go deps p = deps # case p of
133+ Local _ -> id
134+ FromDep pkgName (_, m) -> M.insert (P.getModuleName m) pkgName
135+ (#) = flip ($)
136+
137+addPackage :: M.Map P.ModuleName PackageName -> P.Module -> InPackage P.Module
138+addPackage depsModules m =
139+ case M.lookup (P.getModuleName m) depsModules of
140+ Just pkgName -> FromDep pkgName m
141+ Nothing -> Local m
src/Language/PureScript/Docs/Render.hsnew file+127
@@ -0,0 +1,127 @@
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.Monoid ((<>))
14+import qualified Language.PureScript as P
15+
16+import Language.PureScript.Docs.Types
17+import Language.PureScript.Docs.RenderedCode
18+import Language.PureScript.Docs.Utils.MonoidExtras
19+
20+renderDeclaration :: Declaration -> RenderedCode
21+renderDeclaration = renderDeclarationWithOptions defaultRenderTypeOptions
22+
23+renderDeclarationWithOptions :: RenderTypeOptions -> Declaration -> RenderedCode
24+renderDeclarationWithOptions opts Declaration{..} =
25+ mintersperse sp $ case declInfo of
26+ ValueDeclaration ty ->
27+ [ ident declTitle
28+ , syntax "::"
29+ , renderType' ty
30+ ]
31+ DataDeclaration dtype args ->
32+ [ keyword (show dtype)
33+ , renderType' (typeApp declTitle args)
34+ ]
35+ ExternDataDeclaration kind' ->
36+ [ keywordData
37+ , renderType' (P.TypeConstructor (notQualified declTitle))
38+ , syntax "::"
39+ , renderKind kind'
40+ ]
41+ TypeSynonymDeclaration args ty ->
42+ [ keywordType
43+ , renderType' (typeApp declTitle args)
44+ , syntax "="
45+ , renderType' ty
46+ ]
47+ TypeClassDeclaration args implies ->
48+ [ keywordClass ]
49+ ++ maybe [] (:[]) superclasses
50+ ++ [renderType' (typeApp declTitle args)]
51+ ++ if any (isTypeClassMember . cdeclInfo) declChildren
52+ then [keywordWhere]
53+ else []
54+
55+ where
56+ superclasses
57+ | null implies = Nothing
58+ | otherwise = Just $
59+ syntax "("
60+ <> mintersperse (syntax "," <> sp) (map renderConstraint implies)
61+ <> syntax ")" <> sp <> syntax "<="
62+
63+ isTypeClassMember (ChildTypeClassMember _) = True
64+ isTypeClassMember _ = False
65+ where
66+ renderType' = renderTypeWithOptions opts
67+
68+renderChildDeclaration :: ChildDeclaration -> RenderedCode
69+renderChildDeclaration = renderChildDeclarationWithOptions defaultRenderTypeOptions
70+
71+renderChildDeclarationWithOptions :: RenderTypeOptions -> ChildDeclaration -> RenderedCode
72+renderChildDeclarationWithOptions opts ChildDeclaration{..} =
73+ mintersperse sp $ case cdeclInfo of
74+ ChildInstance constraints ty ->
75+ [ keywordInstance
76+ , ident cdeclTitle
77+ , syntax "::"
78+ ] ++ maybe [] (:[]) (renderConstraints constraints)
79+ ++ [ renderType' ty ]
80+ ChildDataConstructor args ->
81+ [ renderType' typeApp' ]
82+ where
83+ typeApp' = foldl P.TypeApp ctor' args
84+ ctor' = P.TypeConstructor (notQualified cdeclTitle)
85+
86+ ChildTypeClassMember ty ->
87+ [ ident cdeclTitle
88+ , syntax "::"
89+ , renderType' ty
90+ ]
91+ where
92+ renderType' = renderTypeWithOptions opts
93+
94+renderConstraint :: (P.Qualified P.ProperName, [P.Type]) -> RenderedCode
95+renderConstraint = renderConstraintWithOptions defaultRenderTypeOptions
96+
97+renderConstraintWithOptions :: RenderTypeOptions -> (P.Qualified P.ProperName, [P.Type]) -> RenderedCode
98+renderConstraintWithOptions opts (pn, tys) =
99+ renderTypeWithOptions opts $ foldl P.TypeApp (P.TypeConstructor pn) tys
100+
101+renderConstraints :: [P.Constraint] -> Maybe RenderedCode
102+renderConstraints = renderConstraintsWithOptions defaultRenderTypeOptions
103+
104+renderConstraintsWithOptions :: RenderTypeOptions -> [P.Constraint] -> Maybe RenderedCode
105+renderConstraintsWithOptions opts constraints
106+ | null constraints = Nothing
107+ | otherwise = Just $
108+ syntax "("
109+ <> renderedConstraints
110+ <> syntax ")" <> sp <> syntax "=>"
111+ where
112+ renderedConstraints =
113+ mintersperse (syntax "," <> sp)
114+ (map (renderConstraintWithOptions opts) constraints)
115+
116+notQualified :: String -> P.Qualified P.ProperName
117+notQualified = P.Qualified Nothing . P.ProperName
118+
119+typeApp :: String -> [(String, Maybe P.Kind)] -> P.Type
120+typeApp title typeArgs =
121+ foldl P.TypeApp
122+ (P.TypeConstructor (notQualified title))
123+ (map toTypeVar typeArgs)
124+
125+toTypeVar :: (String, Maybe P.Kind) -> P.Type
126+toTypeVar (s, Nothing) = P.TypeVar s
127+toTypeVar (s, Just k) = P.KindedType (P.TypeVar s) k
src/Language/PureScript/Docs/RenderedCode.hsnew file+11
@@ -0,0 +1,11 @@
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.hsnew file+179
@@ -0,0 +1,179 @@
1+
2+-- | Functions for producing RenderedCode values from PureScript Type values.
3+
4+module Language.PureScript.Docs.RenderedCode.Render (
5+ renderType,
6+ renderTypeAtom,
7+ renderRow,
8+ renderKind,
9+ RenderTypeOptions(..),
10+ defaultRenderTypeOptions,
11+ renderTypeWithOptions
12+) where
13+
14+import Data.Monoid ((<>), mconcat, mempty)
15+import Data.Maybe (fromMaybe)
16+
17+import Control.Arrow ((<+>))
18+import Control.PatternArrows
19+
20+import Language.PureScript.Names
21+import Language.PureScript.Types
22+import Language.PureScript.Kinds
23+import Language.PureScript.Pretty.Kinds
24+import Language.PureScript.Environment
25+
26+import Language.PureScript.Docs.RenderedCode.Types
27+import Language.PureScript.Docs.Utils.MonoidExtras
28+
29+typeLiterals :: Pattern () Type RenderedCode
30+typeLiterals = mkPattern match
31+ where
32+ match TypeWildcard =
33+ Just (syntax "_")
34+ match (TypeVar var) =
35+ Just (ident var)
36+ match (PrettyPrintObject row) =
37+ Just $ mintersperse sp
38+ [ syntax "{"
39+ , renderRow row
40+ , syntax "}"
41+ ]
42+ match (TypeConstructor (Qualified mn name)) =
43+ Just (ctor (show name) (maybeToContainingModule mn))
44+ match (ConstrainedType deps ty) =
45+ Just $ mintersperse sp
46+ [ syntax "(" <> constraints <> syntax ")"
47+ , syntax "=>"
48+ , renderType ty
49+ ]
50+ where
51+ constraints = mintersperse (syntax "," <> sp) (map renderDep deps)
52+ renderDep (pn, tys) =
53+ let instApp = foldl TypeApp (TypeConstructor pn) tys
54+ in renderType instApp
55+ match REmpty =
56+ Just (syntax "()")
57+ match row@RCons{} =
58+ Just (syntax "(" <> renderRow row <> syntax ")")
59+ match _ =
60+ Nothing
61+
62+-- |
63+-- Render code representing a Row
64+--
65+renderRow :: Type -> RenderedCode
66+renderRow = uncurry renderRow' . rowToList
67+ where
68+ renderRow' h t = renderHead h <> renderTail t
69+
70+renderHead :: [(String, Type)] -> RenderedCode
71+renderHead = mintersperse (syntax "," <> sp) . map renderLabel
72+
73+renderLabel :: (String, Type) -> RenderedCode
74+renderLabel (label, ty) =
75+ mintersperse sp
76+ [ ident label
77+ , syntax "::"
78+ , renderType ty
79+ ]
80+
81+renderTail :: Type -> RenderedCode
82+renderTail REmpty = mempty
83+renderTail other = sp <> syntax "|" <> sp <> renderType other
84+
85+typeApp :: Pattern () Type (Type, Type)
86+typeApp = mkPattern match
87+ where
88+ match (TypeApp f x) = Just (f, x)
89+ match _ = Nothing
90+
91+appliedFunction :: Pattern () Type (Type, Type)
92+appliedFunction = mkPattern match
93+ where
94+ match (PrettyPrintFunction arg ret) = Just (arg, ret)
95+ match _ = Nothing
96+
97+kinded :: Pattern () Type (Kind, Type)
98+kinded = mkPattern match
99+ where
100+ match (KindedType t k) = Just (k, t)
101+ match _ = Nothing
102+
103+matchTypeAtom :: Pattern () Type RenderedCode
104+matchTypeAtom = typeLiterals <+> fmap parens matchType
105+ where
106+ parens x = syntax "(" <> x <> syntax ")"
107+
108+matchType :: Pattern () Type RenderedCode
109+matchType = buildPrettyPrinter operators matchTypeAtom
110+ where
111+ operators :: OperatorTable () Type RenderedCode
112+ operators =
113+ OperatorTable [ [ AssocL typeApp $ \f x -> f <> sp <> x ]
114+ , [ AssocR appliedFunction $ \arg ret -> mintersperse sp [arg, syntax "->", ret] ]
115+ , [ Wrap forall_ $ \idents ty -> mconcat [syntax "forall", sp, mintersperse sp (map ident idents), syntax ".", sp, ty] ]
116+ , [ Wrap kinded $ \k ty -> mintersperse sp [ty, syntax "::", renderKind k] ]
117+ ]
118+
119+forall_ :: Pattern () Type ([String], Type)
120+forall_ = mkPattern match
121+ where
122+ match (PrettyPrintForAll idents ty) = Just (idents, ty)
123+ match _ = Nothing
124+
125+insertPlaceholders :: RenderTypeOptions -> Type -> Type
126+insertPlaceholders opts =
127+ everywhereOnTypesTopDown convertForAlls . everywhereOnTypes (convert opts)
128+
129+dePrim :: Type -> Type
130+dePrim ty@(TypeConstructor (Qualified _ name))
131+ | ty == tyBoolean || ty == tyNumber || ty == tyString =
132+ TypeConstructor $ Qualified Nothing name
133+dePrim other = other
134+
135+convert :: RenderTypeOptions -> Type -> Type
136+convert _ (TypeApp (TypeApp f arg) ret) | f == tyFunction = PrettyPrintFunction arg ret
137+convert opts (TypeApp o r) | o == tyObject && prettyPrintObjects opts = PrettyPrintObject r
138+convert _ other = other
139+
140+convertForAlls :: Type -> Type
141+convertForAlls (ForAll i ty _) = go [i] ty
142+ where
143+ go idents (ForAll ident' ty' _) = go (ident' : idents) ty'
144+ go idents other = PrettyPrintForAll idents other
145+convertForAlls other = other
146+
147+preprocessType :: RenderTypeOptions -> Type -> Type
148+preprocessType opts = dePrim . insertPlaceholders opts
149+
150+-- |
151+-- Render code representing a Kind
152+--
153+renderKind :: Kind -> RenderedCode
154+renderKind = kind . prettyPrintKind
155+
156+-- |
157+-- Render code representing a Type, as it should appear inside parentheses
158+--
159+renderTypeAtom :: Type -> RenderedCode
160+renderTypeAtom =
161+ fromMaybe (error "Incomplete pattern") . pattern matchTypeAtom () . preprocessType defaultRenderTypeOptions
162+
163+
164+-- |
165+-- Render code representing a Type
166+--
167+renderType :: Type -> RenderedCode
168+renderType = renderTypeWithOptions defaultRenderTypeOptions
169+
170+data RenderTypeOptions = RenderTypeOptions
171+ { prettyPrintObjects :: Bool
172+ }
173+
174+defaultRenderTypeOptions :: RenderTypeOptions
175+defaultRenderTypeOptions = RenderTypeOptions { prettyPrintObjects = True }
176+
177+renderTypeWithOptions :: RenderTypeOptions -> Type -> RenderedCode
178+renderTypeWithOptions opts =
179+ fromMaybe (error "Incomplete pattern") . pattern matchType () . preprocessType opts
src/Language/PureScript/Docs/RenderedCode/Types.hsnew file+191
@@ -0,0 +1,191 @@
1+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
2+{-# LANGUAGE OverloadedStrings #-}
3+
4+-- | Data types and functions for representing a simplified form of PureScript
5+-- code, intended for use in e.g. HTML documentation.
6+
7+module Language.PureScript.Docs.RenderedCode.Types
8+ ( RenderedCodeElement(..)
9+ , asRenderedCodeElement
10+ , ContainingModule(..)
11+ , asContainingModule
12+ , containingModuleToMaybe
13+ , maybeToContainingModule
14+ , fromContainingModule
15+ , RenderedCode
16+ , asRenderedCode
17+ , outputWith
18+ , sp
19+ , syntax
20+ , ident
21+ , ctor
22+ , kind
23+ , keyword
24+ , keywordForall
25+ , keywordData
26+ , keywordNewtype
27+ , keywordType
28+ , keywordClass
29+ , keywordInstance
30+ , keywordWhere
31+ ) where
32+
33+import Control.Applicative ((<$>), (<*>), (*>), pure)
34+import Data.Foldable
35+import Data.Monoid
36+import qualified Data.Aeson as A
37+import Data.Aeson.BetterErrors
38+import Control.Monad.Error.Class (MonadError(..))
39+
40+import qualified Language.PureScript as P
41+
42+-- |
43+-- A single element in a rendered code fragment. The intention is to support
44+-- multiple output formats. For example, plain text, or highlighted HTML.
45+--
46+data RenderedCodeElement
47+ = Syntax String
48+ | Ident String
49+ | Ctor String ContainingModule
50+ | Kind String
51+ | Keyword String
52+ | Space
53+ deriving (Show, Eq, Ord)
54+
55+instance A.ToJSON RenderedCodeElement where
56+ toJSON (Syntax str) =
57+ A.toJSON ["syntax", str]
58+ toJSON (Ident str) =
59+ A.toJSON ["ident", str]
60+ toJSON (Ctor str mn) =
61+ A.toJSON ["ctor", A.toJSON str, A.toJSON mn ]
62+ toJSON (Kind str) =
63+ A.toJSON ["kind", str]
64+ toJSON (Keyword str) =
65+ A.toJSON ["keyword", str]
66+ toJSON Space =
67+ A.toJSON ["space" :: String]
68+
69+asRenderedCodeElement :: Parse String RenderedCodeElement
70+asRenderedCodeElement =
71+ a Syntax "syntax" <|>
72+ a Ident "ident" <|>
73+ asCtor <|>
74+ a Kind "kind" <|>
75+ a Keyword "keyword" <|>
76+ asSpace <|>
77+ unableToParse
78+ where
79+ p <|> q = catchError p (const q)
80+
81+ a ctor' ctorStr = ctor' <$> (nth 0 (withString (eq ctorStr)) *> nth 1 asString)
82+ asCtor = nth 0 (withString (eq "ctor")) *> (Ctor <$> nth 1 asString <*> nth 2 asContainingModule)
83+ asSpace = nth 0 (withString (eq "space")) *> pure Space
84+
85+ eq s s' = if s == s' then Right () else Left ""
86+
87+ unableToParse = withString (Left . show)
88+
89+-- |
90+-- This type is isomorphic to 'Maybe' 'P.ModuleName'. It makes code a bit easier
91+-- to read, as the meaning is more explicit.
92+--
93+data ContainingModule
94+ = ThisModule
95+ | OtherModule P.ModuleName
96+ deriving (Show, Eq, Ord)
97+
98+instance A.ToJSON ContainingModule where
99+ toJSON mn = A.toJSON (P.runModuleName <$> containingModuleToMaybe mn)
100+
101+asContainingModule :: Parse e ContainingModule
102+asContainingModule =
103+ maybeToContainingModule <$> perhaps (P.moduleNameFromString <$> asString)
104+
105+-- |
106+-- Convert a 'Maybe' 'P.ModuleName' to a 'ContainingModule', using the obvious
107+-- isomorphism.
108+--
109+maybeToContainingModule :: Maybe P.ModuleName -> ContainingModule
110+maybeToContainingModule Nothing = ThisModule
111+maybeToContainingModule (Just mn) = OtherModule mn
112+
113+-- |
114+-- Convert a 'ContainingModule' to a 'Maybe' 'P.ModuleName', using the obvious
115+-- isomorphism.
116+--
117+containingModuleToMaybe :: ContainingModule -> Maybe P.ModuleName
118+containingModuleToMaybe ThisModule = Nothing
119+containingModuleToMaybe (OtherModule mn) = Just mn
120+
121+-- |
122+-- A version of 'fromMaybe' for 'ContainingModule' values.
123+--
124+fromContainingModule :: P.ModuleName -> ContainingModule -> P.ModuleName
125+fromContainingModule def ThisModule = def
126+fromContainingModule _ (OtherModule mn) = mn
127+
128+-- |
129+-- A type representing a highly simplified version of PureScript code, intended
130+-- for use in output formats like plain text or HTML.
131+--
132+newtype RenderedCode
133+ = RC { unRC :: [RenderedCodeElement] }
134+ deriving (Show, Eq, Ord, Monoid)
135+
136+instance A.ToJSON RenderedCode where
137+ toJSON (RC elems) = A.toJSON elems
138+
139+asRenderedCode :: Parse String RenderedCode
140+asRenderedCode = RC <$> eachInArray asRenderedCodeElement
141+
142+-- |
143+-- This function allows conversion of a 'RenderedCode' value into a value of
144+-- some other type (for example, plain text, or HTML). The first argument
145+-- is a function specifying how each individual 'RenderedCodeElement' should be
146+-- rendered.
147+--
148+outputWith :: Monoid a => (RenderedCodeElement -> a) -> RenderedCode -> a
149+outputWith f = foldMap f . unRC
150+
151+-- |
152+-- A 'RenderedCode' fragment representing a space.
153+--
154+sp :: RenderedCode
155+sp = RC [Space]
156+
157+syntax :: String -> RenderedCode
158+syntax x = RC [Syntax x]
159+
160+ident :: String -> RenderedCode
161+ident x = RC [Ident x]
162+
163+ctor :: String -> ContainingModule -> RenderedCode
164+ctor x m = RC [Ctor x m]
165+
166+kind :: String -> RenderedCode
167+kind x = RC [Kind x]
168+
169+keyword :: String -> RenderedCode
170+keyword kw = RC [Keyword kw]
171+
172+keywordForall :: RenderedCode
173+keywordForall = keyword "forall"
174+
175+keywordData :: RenderedCode
176+keywordData = keyword "data"
177+
178+keywordNewtype :: RenderedCode
179+keywordNewtype = keyword "newtype"
180+
181+keywordType :: RenderedCode
182+keywordType = keyword "type"
183+
184+keywordClass :: RenderedCode
185+keywordClass = keyword "class"
186+
187+keywordInstance :: RenderedCode
188+keywordInstance = keyword "instance"
189+
190+keywordWhere :: RenderedCode
191+keywordWhere = keyword "where"
src/Language/PureScript/Docs/Types.hsnew file+511
@@ -0,0 +1,511 @@
1+{-# LANGUAGE RecordWildCards #-}
2+{-# LANGUAGE OverloadedStrings #-}
3+{-# LANGUAGE TupleSections #-}
4+{-# LANGUAGE RankNTypes #-}
5+
6+module Language.PureScript.Docs.Types
7+ ( module Language.PureScript.Docs.Types
8+ , module ReExports
9+ )
10+ where
11+
12+import Control.Arrow (first, (***))
13+import Control.Applicative ((<$>), (<*>), pure)
14+import Control.Monad (when)
15+import Data.Functor ((<$))
16+import Data.Maybe (mapMaybe)
17+import Data.Version
18+import Data.Aeson ((.=))
19+import qualified Data.Aeson as A
20+import Data.Aeson.BetterErrors
21+import Text.ParserCombinators.ReadP (readP_to_S)
22+import Data.Text (Text)
23+import Data.ByteString.Lazy (ByteString)
24+import qualified Data.Text as T
25+
26+import Web.Bower.PackageMeta hiding (Version, displayError)
27+
28+import qualified Language.PureScript as P
29+
30+import Language.PureScript.Docs.RenderedCode as ReExports
31+ (RenderedCode, asRenderedCode,
32+ ContainingModule(..), asContainingModule,
33+ RenderedCodeElement(..), asRenderedCodeElement)
34+
35+--------------------
36+-- Types
37+
38+data Package a = Package
39+ { pkgMeta :: PackageMeta
40+ , pkgVersion :: Version
41+ , pkgVersionTag :: String
42+ , pkgModules :: [Module]
43+ , pkgBookmarks :: [Bookmark]
44+ , pkgResolvedDependencies :: [(PackageName, Version)]
45+ , pkgGithub :: (GithubUser, GithubRepo)
46+ , pkgUploader :: a
47+ , pkgCompilerVersion :: Version
48+ -- ^ The version of the PureScript compiler which was used to generate
49+ -- this data. We store this in order to reject packages which are too old.
50+ }
51+ deriving (Show, Eq, Ord)
52+
53+data NotYetKnown = NotYetKnown
54+ deriving (Show, Eq, Ord)
55+
56+type UploadedPackage = Package NotYetKnown
57+type VerifiedPackage = Package GithubUser
58+
59+verifyPackage :: GithubUser -> UploadedPackage -> VerifiedPackage
60+verifyPackage verifiedUser Package{..} =
61+ Package pkgMeta
62+ pkgVersion
63+ pkgVersionTag
64+ pkgModules
65+ pkgBookmarks
66+ pkgResolvedDependencies
67+ pkgGithub
68+ verifiedUser
69+ pkgCompilerVersion
70+
71+packageName :: Package a -> PackageName
72+packageName = bowerName . pkgMeta
73+
74+data Module = Module
75+ { modName :: String
76+ , modComments :: Maybe String
77+ , modDeclarations :: [Declaration]
78+ }
79+ deriving (Show, Eq, Ord)
80+
81+data Declaration = Declaration
82+ { declTitle :: String
83+ , declComments :: Maybe String
84+ , declSourceSpan :: Maybe P.SourceSpan
85+ , declChildren :: [ChildDeclaration]
86+ , declFixity :: Maybe P.Fixity
87+ , declInfo :: DeclarationInfo
88+ }
89+ deriving (Show, Eq, Ord)
90+
91+-- |
92+-- A value of this type contains information that is specific to a particular
93+-- kind of declaration (as opposed to information which exists in all kinds of
94+-- declarations, which goes into the 'Declaration' type directly).
95+--
96+-- Many of the constructors are very similar to their equivalents in the real
97+-- PureScript AST, except that they have their name elided, since this is
98+-- already available via the rdTitle field of 'Declaration'.
99+--
100+data DeclarationInfo
101+ -- |
102+ -- A value declaration, with its type.
103+ --
104+ = ValueDeclaration P.Type
105+
106+ -- |
107+ -- A data/newtype declaration, with the kind of declaration (data or
108+ -- newtype) and its type arguments. Constructors are represented as child
109+ -- declarations.
110+ --
111+ | DataDeclaration P.DataDeclType [(String, Maybe P.Kind)]
112+
113+ -- |
114+ -- A data type foreign import, with its kind.
115+ --
116+ | ExternDataDeclaration P.Kind
117+
118+ -- |
119+ -- A type synonym, with its type arguments and its type.
120+ --
121+ | TypeSynonymDeclaration [(String, Maybe P.Kind)] P.Type
122+
123+ -- |
124+ -- A type class, with its type arguments and its superclasses. Instances and
125+ -- members are represented as child declarations.
126+ --
127+ | TypeClassDeclaration [(String, Maybe P.Kind)] [P.Constraint]
128+ deriving (Show, Eq, Ord)
129+
130+declInfoToString :: DeclarationInfo -> String
131+declInfoToString (ValueDeclaration _) = "value"
132+declInfoToString (DataDeclaration _ _) = "data"
133+declInfoToString (ExternDataDeclaration _) = "externData"
134+declInfoToString (TypeSynonymDeclaration _ _) = "typeSynonym"
135+declInfoToString (TypeClassDeclaration _ _) = "typeClass"
136+
137+data ChildDeclaration = ChildDeclaration
138+ { cdeclTitle :: String
139+ , cdeclComments :: Maybe String
140+ , cdeclSourceSpan :: Maybe P.SourceSpan
141+ , cdeclInfo :: ChildDeclarationInfo
142+ }
143+ deriving (Show, Eq, Ord)
144+
145+data ChildDeclarationInfo
146+ -- |
147+ -- A type instance declaration, with its dependencies and its type.
148+ --
149+ = ChildInstance [P.Constraint] P.Type
150+
151+ -- |
152+ -- A data constructor, with its type arguments.
153+ --
154+ | ChildDataConstructor [P.Type]
155+
156+ -- |
157+ -- A type class member, with its type. Note that the type does not include
158+ -- the type class constraint; this may be added manually if desired. For
159+ -- example, `pure` from `Applicative` would be `forall a. a -> f a`.
160+ --
161+ | ChildTypeClassMember P.Type
162+ deriving (Show, Eq, Ord)
163+
164+childDeclInfoToString :: ChildDeclarationInfo -> String
165+childDeclInfoToString (ChildInstance _ _) = "instance"
166+childDeclInfoToString (ChildDataConstructor _) = "dataConstructor"
167+childDeclInfoToString (ChildTypeClassMember _) = "typeClassMember"
168+
169+newtype GithubUser
170+ = GithubUser { runGithubUser :: String }
171+ deriving (Show, Eq, Ord)
172+
173+newtype GithubRepo
174+ = GithubRepo { runGithubRepo :: String }
175+ deriving (Show, Eq, Ord)
176+
177+data PackageError
178+ = CompilerTooOld Version Version
179+ -- ^ Minimum allowable version for generating data with the current
180+ -- parser, and actual version used.
181+ | ErrorInPackageMeta BowerError
182+ | InvalidVersion
183+ | InvalidDeclarationType String
184+ | InvalidChildDeclarationType String
185+ | InvalidFixity
186+ | InvalidKind String
187+ | InvalidDataDeclType String
188+ deriving (Show, Eq, Ord)
189+
190+type Bookmark = InPackage (P.ModuleName, String)
191+
192+data InPackage a
193+ = Local a
194+ | FromDep PackageName a
195+ deriving (Show, Eq, Ord)
196+
197+instance Functor InPackage where
198+ fmap f (Local x) = Local (f x)
199+ fmap f (FromDep pkgName x) = FromDep pkgName (f x)
200+
201+takeLocal :: InPackage a -> Maybe a
202+takeLocal (Local a) = Just a
203+takeLocal _ = Nothing
204+
205+takeLocals :: [InPackage a] -> [a]
206+takeLocals = mapMaybe takeLocal
207+
208+ignorePackage :: InPackage a -> a
209+ignorePackage (Local x) = x
210+ignorePackage (FromDep _ x) = x
211+
212+----------------------
213+-- Parsing
214+
215+parseUploadedPackage :: Version -> ByteString -> Either (ParseError PackageError) UploadedPackage
216+parseUploadedPackage minVersion = parse $ asUploadedPackage minVersion
217+
218+parseVerifiedPackage :: Version -> ByteString -> Either (ParseError PackageError) VerifiedPackage
219+parseVerifiedPackage minVersion = parse $ asVerifiedPackage minVersion
220+
221+asPackage :: Version -> (forall e. Parse e a) -> Parse PackageError (Package a)
222+asPackage minimumVersion uploader = do
223+ -- If the compilerVersion key is missing, we can be sure that it was produced
224+ -- with 0.7.0.0, since that is the only released version that included the
225+ -- psc-publish tool before this key was added.
226+ compilerVersion <- keyOrDefault "compilerVersion" (Version [0,7,0,0] []) asVersion
227+ when (compilerVersion < minimumVersion)
228+ (throwCustomError $ CompilerTooOld minimumVersion compilerVersion)
229+
230+ Package <$> key "packageMeta" asPackageMeta .! ErrorInPackageMeta
231+ <*> key "version" asVersion
232+ <*> key "versionTag" asString
233+ <*> key "modules" (eachInArray asModule)
234+ <*> key "bookmarks" asBookmarks .! ErrorInPackageMeta
235+ <*> key "resolvedDependencies" asResolvedDependencies
236+ <*> key "github" asGithub
237+ <*> key "uploader" uploader
238+ <*> pure compilerVersion
239+
240+asUploadedPackage :: Version -> Parse PackageError UploadedPackage
241+asUploadedPackage minVersion = asPackage minVersion asNotYetKnown
242+
243+asNotYetKnown :: Parse e NotYetKnown
244+asNotYetKnown = NotYetKnown <$ asNull
245+
246+instance A.FromJSON NotYetKnown where
247+ parseJSON = toAesonParser' asNotYetKnown
248+
249+asVerifiedPackage :: Version -> Parse PackageError VerifiedPackage
250+asVerifiedPackage minVersion = asPackage minVersion asGithubUser
251+
252+displayPackageError :: PackageError -> Text
253+displayPackageError e = case e of
254+ CompilerTooOld minV usedV ->
255+ "Expecting data produced by at least version " <> T.pack (showVersion minV)
256+ <> " of the compiler, but it appears that " <> T.pack (showVersion usedV)
257+ <> " was used."
258+ ErrorInPackageMeta err ->
259+ "Error in package metadata: " <> showBowerError err
260+ InvalidVersion ->
261+ "Invalid version"
262+ InvalidDeclarationType str ->
263+ "Invalid declaration type: \"" <> T.pack str <> "\""
264+ InvalidChildDeclarationType str ->
265+ "Invalid child declaration type: \"" <> T.pack str <> "\""
266+ InvalidFixity ->
267+ "Invalid fixity"
268+ InvalidKind str ->
269+ "Invalid kind: \"" <> T.pack str <> "\""
270+ InvalidDataDeclType str ->
271+ "Invalid data declaration type: \"" <> T.pack str <> "\""
272+ where
273+ (<>) = T.append
274+
275+instance A.FromJSON a => A.FromJSON (Package a) where
276+ parseJSON = toAesonParser displayPackageError
277+ (asPackage (Version [0,0,0,0] []) fromAesonParser)
278+
279+asGithubUser :: Parse e GithubUser
280+asGithubUser = GithubUser <$> asString
281+
282+instance A.FromJSON GithubUser where
283+ parseJSON = toAesonParser' asGithubUser
284+
285+asVersion :: Parse PackageError Version
286+asVersion = withString (maybe (Left InvalidVersion) Right . parseVersion')
287+
288+parseVersion' :: String -> Maybe Version
289+parseVersion' str =
290+ case filter (null . snd) $ readP_to_S parseVersion str of
291+ [(vers, "")] -> Just vers
292+ _ -> Nothing
293+
294+asModule :: Parse PackageError Module
295+asModule =
296+ Module <$> key "name" asString
297+ <*> key "comments" (perhaps asString)
298+ <*> key "declarations" (eachInArray asDeclaration)
299+
300+asDeclaration :: Parse PackageError Declaration
301+asDeclaration =
302+ Declaration <$> key "title" asString
303+ <*> key "comments" (perhaps asString)
304+ <*> key "sourceSpan" (perhaps asSourceSpan)
305+ <*> key "children" (eachInArray asChildDeclaration)
306+ <*> key "fixity" (perhaps asFixity)
307+ <*> key "info" asDeclarationInfo
308+
309+asFixity :: Parse PackageError P.Fixity
310+asFixity = P.Fixity <$> key "associativity" asAssociativity
311+ <*> key "precedence" asIntegral
312+
313+parseAssociativity :: String -> Maybe P.Associativity
314+parseAssociativity str = case str of
315+ "infix" -> Just P.Infix
316+ "infixl" -> Just P.Infixl
317+ "infixr" -> Just P.Infixr
318+ _ -> Nothing
319+
320+asAssociativity :: Parse PackageError P.Associativity
321+asAssociativity = withString (maybe (Left InvalidFixity) Right . parseAssociativity)
322+
323+asDeclarationInfo :: Parse PackageError DeclarationInfo
324+asDeclarationInfo = do
325+ ty <- key "declType" asString
326+ case ty of
327+ "value" ->
328+ ValueDeclaration <$> key "type" asType
329+ "data" ->
330+ DataDeclaration <$> key "dataDeclType" asDataDeclType
331+ <*> key "typeArguments" asTypeArguments
332+ "externData" ->
333+ ExternDataDeclaration <$> key "kind" asKind
334+ "typeSynonym" ->
335+ TypeSynonymDeclaration <$> key "arguments" asTypeArguments
336+ <*> key "type" asType
337+ "typeClass" ->
338+ TypeClassDeclaration <$> key "arguments" asTypeArguments
339+ <*> key "superclasses" (eachInArray asConstraint)
340+ other ->
341+ throwCustomError (InvalidDeclarationType other)
342+
343+asTypeArguments :: Parse PackageError [(String, Maybe P.Kind)]
344+asTypeArguments = eachInArray asTypeArgument
345+ where
346+ asTypeArgument = (,) <$> nth 0 asString <*> nth 1 (perhaps asKind)
347+
348+asKind :: Parse e P.Kind
349+asKind = fromAesonParser
350+
351+asType :: Parse e P.Type
352+asType = fromAesonParser
353+
354+asDataDeclType :: Parse PackageError P.DataDeclType
355+asDataDeclType =
356+ withString $ \s -> case s of
357+ "data" -> Right P.Data
358+ "newtype" -> Right P.Newtype
359+ other -> Left (InvalidDataDeclType other)
360+
361+asChildDeclaration :: Parse PackageError ChildDeclaration
362+asChildDeclaration =
363+ ChildDeclaration <$> key "title" asString
364+ <*> key "comments" (perhaps asString)
365+ <*> key "sourceSpan" (perhaps asSourceSpan)
366+ <*> key "info" asChildDeclarationInfo
367+
368+asChildDeclarationInfo :: Parse PackageError ChildDeclarationInfo
369+asChildDeclarationInfo = do
370+ ty <- key "declType" asString
371+ case ty of
372+ "instance" ->
373+ ChildInstance <$> key "dependencies" (eachInArray asConstraint)
374+ <*> key "type" asType
375+ "dataConstructor" ->
376+ ChildDataConstructor <$> key "arguments" (eachInArray asType)
377+ "typeClassMember" ->
378+ ChildTypeClassMember <$> key "type" asType
379+ other ->
380+ throwCustomError $ InvalidChildDeclarationType other
381+
382+asSourcePos :: Parse e P.SourcePos
383+asSourcePos = P.SourcePos <$> nth 0 asIntegral
384+ <*> nth 1 asIntegral
385+
386+asConstraint :: Parse PackageError P.Constraint
387+asConstraint = (,) <$> nth 0 asQualifiedProperName
388+ <*> nth 1 (eachInArray asType)
389+
390+asQualifiedProperName :: Parse e (P.Qualified P.ProperName)
391+asQualifiedProperName = fromAesonParser
392+
393+asBookmarks :: Parse BowerError [Bookmark]
394+asBookmarks = eachInArray asBookmark
395+
396+asBookmark :: Parse BowerError Bookmark
397+asBookmark =
398+ build <$> key "package" (perhaps (withString parsePackageName))
399+ <*> key "item" ((,) <$> nth 0 (P.moduleNameFromString <$> asString)
400+ <*> nth 1 asString)
401+ where
402+ build Nothing = Local
403+ build (Just pn) = FromDep pn
404+
405+asResolvedDependencies :: Parse PackageError [(PackageName, Version)]
406+asResolvedDependencies =
407+ eachInObjectWithKey (mapLeft ErrorInPackageMeta . parsePackageName . T.unpack) asVersion
408+ where
409+ mapLeft f (Left x) = Left (f x)
410+ mapLeft _ (Right x) = Right x
411+
412+asGithub :: Parse e (GithubUser, GithubRepo)
413+asGithub = (,) <$> nth 0 (GithubUser <$> asString)
414+ <*> nth 1 (GithubRepo <$> asString)
415+
416+asSourceSpan :: Parse e P.SourceSpan
417+asSourceSpan = P.SourceSpan <$> key "name" asString
418+ <*> key "start" asSourcePos
419+ <*> key "end" asSourcePos
420+
421+---------------------
422+-- ToJSON instances
423+
424+instance A.ToJSON a => A.ToJSON (Package a) where
425+ toJSON Package{..} =
426+ A.object $
427+ [ "packageMeta" .= pkgMeta
428+ , "version" .= showVersion pkgVersion
429+ , "versionTag" .= pkgVersionTag
430+ , "modules" .= pkgModules
431+ , "bookmarks" .= map (fmap (first P.runModuleName)) pkgBookmarks
432+ , "resolvedDependencies" .= assocListToJSON (T.pack . runPackageName)
433+ (T.pack . showVersion)
434+ pkgResolvedDependencies
435+ , "github" .= pkgGithub
436+ , "uploader" .= pkgUploader
437+ , "compilerVersion" .= showVersion P.version
438+ ]
439+
440+instance A.ToJSON NotYetKnown where
441+ toJSON _ = A.Null
442+
443+instance A.ToJSON Module where
444+ toJSON Module{..} =
445+ A.object [ "name" .= modName
446+ , "comments" .= modComments
447+ , "declarations" .= modDeclarations
448+ ]
449+
450+instance A.ToJSON Declaration where
451+ toJSON Declaration{..} =
452+ A.object [ "title" .= declTitle
453+ , "comments" .= declComments
454+ , "sourceSpan" .= declSourceSpan
455+ , "children" .= declChildren
456+ , "fixity" .= declFixity
457+ , "info" .= declInfo
458+ ]
459+
460+instance A.ToJSON ChildDeclaration where
461+ toJSON ChildDeclaration{..} =
462+ A.object [ "title" .= cdeclTitle
463+ , "comments" .= cdeclComments
464+ , "sourceSpan" .= cdeclSourceSpan
465+ , "info" .= cdeclInfo
466+ ]
467+
468+instance A.ToJSON DeclarationInfo where
469+ toJSON info = A.object $ "declType" .= declInfoToString info : props
470+ where
471+ props = case info of
472+ ValueDeclaration ty -> ["type" .= ty]
473+ DataDeclaration ty args -> ["dataDeclType" .= ty, "typeArguments" .= args]
474+ ExternDataDeclaration kind -> ["kind" .= kind]
475+ TypeSynonymDeclaration args ty -> ["arguments" .= args, "type" .= ty]
476+ TypeClassDeclaration args super -> ["arguments" .= args, "superclasses" .= super]
477+
478+instance A.ToJSON ChildDeclarationInfo where
479+ toJSON info = A.object $ "declType" .= childDeclInfoToString info : props
480+ where
481+ props = case info of
482+ ChildInstance deps ty -> ["dependencies" .= deps, "type" .= ty]
483+ ChildDataConstructor args -> ["arguments" .= args]
484+ ChildTypeClassMember ty -> ["type" .= ty]
485+
486+instance A.ToJSON GithubUser where
487+ toJSON = A.toJSON . runGithubUser
488+
489+instance A.ToJSON GithubRepo where
490+ toJSON = A.toJSON . runGithubRepo
491+
492+-- | Given a function for turning association list keys into JSON object keys,
493+-- and a function for turning association list values to JSON string values,
494+-- turns an association list into a JSON object.
495+--
496+-- For example:
497+-- @assocListToJSON T.pack T.pack [("a", "b")]@ will give @{"a": "b"}@.
498+assocListToJSON :: (a -> Text) -> (b -> Text) -> [(a, b)] -> A.Value
499+assocListToJSON f g xs = A.object (map (uncurry (.=) . (f *** g)) xs)
500+
501+instance A.ToJSON a => A.ToJSON (InPackage a) where
502+ toJSON x =
503+ case x of
504+ Local y -> withPackage (Nothing :: Maybe ()) y
505+ FromDep pn y -> withPackage (Just pn) y
506+ where
507+ withPackage :: (A.ToJSON p, A.ToJSON x) => p -> x -> A.Value
508+ withPackage p y =
509+ A.object [ "package" .= p
510+ , "item" .= y
511+ ]
src/Language/PureScript/Docs/Utils/MonoidExtras.hsnew file+9
@@ -0,0 +1,9 @@
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.hsnew file+268
@@ -0,0 +1,268 @@
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+
18+module Language.PureScript.Environment where
19+
20+import Data.Data
21+import Data.Maybe (fromMaybe)
22+import qualified Data.Map as M
23+import qualified Data.Text as T
24+import qualified Data.Aeson as A
25+
26+import Language.PureScript.Kinds
27+import Language.PureScript.Names
28+import Language.PureScript.TypeClassDictionaries
29+import Language.PureScript.Types
30+import qualified Language.PureScript.Constants as C
31+
32+-- |
33+-- The @Environment@ defines all values and types which are currently in scope:
34+--
35+data Environment = Environment {
36+ -- |
37+ -- Value names currently in scope
38+ --
39+ names :: M.Map (ModuleName, Ident) (Type, NameKind, NameVisibility)
40+ -- |
41+ -- Type names currently in scope
42+ --
43+ , types :: M.Map (Qualified ProperName) (Kind, TypeKind)
44+ -- |
45+ -- Data constructors currently in scope, along with their associated data type constructors
46+ --
47+ , dataConstructors :: M.Map (Qualified ProperName) (DataDeclType, ProperName, Type, [Ident])
48+ -- |
49+ -- Type synonyms currently in scope
50+ --
51+ , typeSynonyms :: M.Map (Qualified ProperName) ([(String, Maybe Kind)], Type)
52+ -- |
53+ -- Available type class dictionaries
54+ --
55+ , typeClassDictionaries :: M.Map (Maybe ModuleName) (M.Map (Qualified ProperName) (M.Map (Qualified Ident) TypeClassDictionaryInScope))
56+ -- |
57+ -- Type classes
58+ --
59+ , typeClasses :: M.Map (Qualified ProperName) ([(String, Maybe Kind)], [(Ident, Type)], [Constraint])
60+ } deriving (Show)
61+
62+-- |
63+-- The initial environment with no values and only the default javascript types defined
64+--
65+initEnvironment :: Environment
66+initEnvironment = Environment M.empty primTypes M.empty M.empty M.empty M.empty
67+
68+-- |
69+-- The visibility of a name in scope
70+--
71+data NameVisibility
72+ -- |
73+ -- The name is defined in the current binding group, but is not visible
74+ --
75+ = Undefined
76+ -- |
77+ -- The name is defined in the another binding group, or has been made visible by a function binder
78+ --
79+ | Defined deriving (Show, Eq)
80+
81+-- |
82+-- A flag for whether a name is for an private or public value - only public values will be
83+-- included in a generated externs file.
84+--
85+data NameKind
86+ -- |
87+ -- A private value introduced as an artifact of code generation (class instances, class member
88+ -- accessors, etc.)
89+ --
90+ = Private
91+ -- |
92+ -- A public value for a module member or foreing import declaration
93+ --
94+ | Public
95+ -- |
96+ -- A name for member introduced by foreign import
97+ --
98+ | External deriving (Show, Eq, Data, Typeable)
99+
100+-- |
101+-- The kinds of a type
102+--
103+data TypeKind
104+ -- |
105+ -- Data type
106+ --
107+ = DataType [(String, Maybe Kind)] [(ProperName, [Type])]
108+ -- |
109+ -- Type synonym
110+ --
111+ | TypeSynonym
112+ -- |
113+ -- Foreign data
114+ --
115+ | ExternData
116+ -- |
117+ -- A local type variable
118+ --
119+ | LocalTypeVariable
120+ -- |
121+ -- A scoped type variable
122+ --
123+ | ScopedTypeVar
124+ deriving (Show, Eq, Data, Typeable)
125+
126+-- |
127+-- The type ('data' or 'newtype') of a data type declaration
128+--
129+data DataDeclType
130+ -- |
131+ -- A standard data constructor
132+ --
133+ = Data
134+ -- |
135+ -- A newtype constructor
136+ --
137+ | Newtype deriving (Eq, Ord, Data, Typeable)
138+
139+instance Show DataDeclType where
140+ show Data = "data"
141+ show Newtype = "newtype"
142+
143+instance A.ToJSON DataDeclType where
144+ toJSON = A.toJSON . show
145+
146+instance A.FromJSON DataDeclType where
147+ parseJSON = A.withText "DataDeclType" $ \str ->
148+ case str of
149+ "data" -> return Data
150+ "newtype" -> return Newtype
151+ other -> fail $ "invalid type: '" ++ T.unpack other ++ "'"
152+
153+-- |
154+-- Construct a ProperName in the Prim module
155+--
156+primName :: String -> Qualified ProperName
157+primName = Qualified (Just $ ModuleName [ProperName C.prim]) . ProperName
158+
159+-- |
160+-- Construct a type in the Prim module
161+--
162+primTy :: String -> Type
163+primTy = TypeConstructor . primName
164+
165+-- |
166+-- Type constructor for functions
167+--
168+tyFunction :: Type
169+tyFunction = primTy "Function"
170+
171+-- |
172+-- Type constructor for strings
173+--
174+tyString :: Type
175+tyString = primTy "String"
176+
177+-- |
178+-- Type constructor for strings
179+--
180+tyChar :: Type
181+tyChar = primTy "Char"
182+
183+-- |
184+-- Type constructor for numbers
185+--
186+tyNumber :: Type
187+tyNumber = primTy "Number"
188+
189+-- |
190+-- Type constructor for integers
191+--
192+tyInt :: Type
193+tyInt = primTy "Int"
194+
195+-- |
196+-- Type constructor for booleans
197+--
198+tyBoolean :: Type
199+tyBoolean = primTy "Boolean"
200+
201+-- |
202+-- Type constructor for arrays
203+--
204+tyArray :: Type
205+tyArray = primTy "Array"
206+
207+-- |
208+-- Type constructor for objects
209+--
210+tyObject :: Type
211+tyObject = primTy "Object"
212+
213+-- |
214+-- Check whether a type is an object
215+--
216+isObject :: Type -> Bool
217+isObject = isTypeOrApplied tyObject
218+
219+-- |
220+-- Check whether a type is a function
221+--
222+isFunction :: Type -> Bool
223+isFunction = isTypeOrApplied tyFunction
224+
225+isTypeOrApplied :: Type -> Type -> Bool
226+isTypeOrApplied t1 (TypeApp t2 _) = t1 == t2
227+isTypeOrApplied t1 t2 = t1 == t2
228+
229+-- |
230+-- Smart constructor for function types
231+--
232+function :: Type -> Type -> Type
233+function t1 = TypeApp (TypeApp tyFunction t1)
234+
235+-- |
236+-- The primitive types in the external javascript environment with their associated kinds.
237+--
238+primTypes :: M.Map (Qualified ProperName) (Kind, TypeKind)
239+primTypes = M.fromList [ (primName "Function" , (FunKind Star (FunKind Star Star), ExternData))
240+ , (primName "Array" , (FunKind Star Star, ExternData))
241+ , (primName "Object" , (FunKind (Row Star) Star, ExternData))
242+ , (primName "String" , (Star, ExternData))
243+ , (primName "Char" , (Star, ExternData))
244+ , (primName "Number" , (Star, ExternData))
245+ , (primName "Int" , (Star, ExternData))
246+ , (primName "Boolean" , (Star, ExternData)) ]
247+
248+-- |
249+-- Finds information about data constructors from the current environment.
250+--
251+lookupConstructor :: Environment -> Qualified ProperName -> (DataDeclType, ProperName, Type, [Ident])
252+lookupConstructor env ctor =
253+ fromMaybe (error "Data constructor not found") $ ctor `M.lookup` dataConstructors env
254+
255+-- |
256+-- Checks whether a data constructor is for a newtype.
257+--
258+isNewtypeConstructor :: Environment -> Qualified ProperName -> Bool
259+isNewtypeConstructor e ctor = case lookupConstructor e ctor of
260+ (Newtype, _, _, _) -> True
261+ (Data, _, _, _) -> False
262+
263+-- |
264+-- Finds information about values from the current environment.
265+--
266+lookupValue :: Environment -> Qualified Ident -> Maybe (Type, NameKind, NameVisibility)
267+lookupValue env (Qualified (Just mn) ident) = (mn, ident) `M.lookup` names env
268+lookupValue _ _ = Nothing
src/Language/PureScript/Errors.hsnew file+813
@@ -0,0 +1,813 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.Error
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 GeneralizedNewtypeDeriving #-}
16+{-# LANGUAGE FlexibleContexts #-}
17+{-# LANGUAGE MultiParamTypeClasses #-}
18+
19+module Language.PureScript.Errors where
20+
21+import Data.Either (lefts, rights)
22+import Data.List (intercalate, transpose)
23+import Data.Function (on)
24+import Data.Monoid
25+import Data.Foldable (fold, foldMap)
26+
27+import qualified Data.Map as M
28+
29+import Control.Monad
30+import Control.Monad.Unify
31+import Control.Monad.Writer
32+import Control.Monad.Error.Class (MonadError(..))
33+import Control.Applicative ((<$>), (<*>), Applicative, pure)
34+import Control.Monad.Trans.State.Lazy
35+import Control.Arrow(first)
36+
37+import Language.PureScript.AST
38+import Language.PureScript.Environment (isObject, isFunction)
39+import Language.PureScript.Pretty
40+import Language.PureScript.Types
41+import Language.PureScript.Names
42+import Language.PureScript.Kinds
43+import Language.PureScript.TypeClassDictionaries
44+
45+import qualified Text.PrettyPrint.Boxes as Box
46+
47+import qualified Text.Parsec as P
48+
49+-- |
50+-- A type of error messages
51+--
52+data SimpleErrorMessage
53+ = ErrorParsingExterns P.ParseError
54+ | ErrorParsingFFIModule FilePath
55+ | ErrorParsingModule P.ParseError
56+ | MissingFFIModule ModuleName
57+ | MultipleFFIModules ModuleName [FilePath]
58+ | UnnecessaryFFIModule ModuleName FilePath
59+ | InvalidExternsFile FilePath
60+ | CannotGetFileInfo FilePath
61+ | CannotReadFile FilePath
62+ | CannotWriteFile FilePath
63+ | InfiniteType Type
64+ | InfiniteKind Kind
65+ | CannotReorderOperators
66+ | MultipleFixities Ident
67+ | OrphanTypeDeclaration Ident
68+ | OrphanFixityDeclaration String
69+ | RedefinedModule ModuleName
70+ | RedefinedIdent Ident
71+ | OverlappingNamesInLet
72+ | UnknownModule ModuleName
73+ | UnknownType (Qualified ProperName)
74+ | UnknownTypeClass (Qualified ProperName)
75+ | UnknownValue (Qualified Ident)
76+ | UnknownDataConstructor (Qualified ProperName) (Maybe (Qualified ProperName))
77+ | UnknownTypeConstructor (Qualified ProperName)
78+ | ConflictingImport String ModuleName
79+ | ConflictingImports String ModuleName ModuleName
80+ | ConflictingTypeDecls ProperName
81+ | ConflictingCtorDecls ProperName
82+ | TypeConflictsWithClass ProperName
83+ | CtorConflictsWithClass ProperName
84+ | ClassConflictsWithType ProperName
85+ | ClassConflictsWithCtor ProperName
86+ | DuplicateClassExport ProperName
87+ | DuplicateValueExport Ident
88+ | DuplicateTypeArgument String
89+ | InvalidDoBind
90+ | InvalidDoLet
91+ | CycleInDeclaration Ident
92+ | CycleInTypeSynonym (Maybe ProperName)
93+ | CycleInModules [ModuleName]
94+ | NameIsUndefined Ident
95+ | NameNotInScope Ident
96+ | UndefinedTypeVariable ProperName
97+ | PartiallyAppliedSynonym (Qualified ProperName)
98+ | EscapedSkolem (Maybe Expr)
99+ | UnspecifiedSkolemScope
100+ | TypesDoNotUnify Type Type
101+ | KindsDoNotUnify Kind Kind
102+ | ConstrainedTypeUnified Type Type
103+ | OverlappingInstances (Qualified ProperName) [Type] [DictionaryValue]
104+ | NoInstanceFound (Qualified ProperName) [Type]
105+ | DuplicateLabel String (Maybe Expr)
106+ | DuplicateValueDeclaration Ident
107+ | ArgListLengthsDiffer Ident
108+ | OverlappingArgNames (Maybe Ident)
109+ | MissingClassMember Ident
110+ | ExtraneousClassMember Ident
111+ | ExpectedType Kind
112+ | IncorrectConstructorArity (Qualified ProperName)
113+ | SubsumptionCheckFailed
114+ | ExprDoesNotHaveType Expr Type
115+ | PropertyIsMissing String Type
116+ | CannotApplyFunction Type Expr
117+ | TypeSynonymInstance
118+ | InvalidNewtype
119+ | InvalidInstanceHead Type
120+ | TransitiveExportError DeclarationRef [DeclarationRef]
121+ | ShadowedName Ident
122+ | WildcardInferredType Type
123+ | NotExhaustivePattern [[Binder]] Bool
124+ | OverlappingPattern [[Binder]] Bool
125+ | ClassOperator ProperName Ident
126+ deriving (Show)
127+
128+-- |
129+-- Wrapper of simpler errors
130+--
131+data ErrorMessage
132+ = NotYetDefined [Ident] ErrorMessage
133+ | ErrorUnifyingTypes Type Type ErrorMessage
134+ | ErrorInExpression Expr ErrorMessage
135+ | ErrorInModule ModuleName ErrorMessage
136+ | ErrorInInstance (Qualified ProperName) [Type] ErrorMessage
137+ | ErrorInSubsumption Type Type ErrorMessage
138+ | ErrorCheckingType Expr Type ErrorMessage
139+ | ErrorCheckingKind Type ErrorMessage
140+ | ErrorInferringType Expr ErrorMessage
141+ | ErrorInApplication Expr Type Expr ErrorMessage
142+ | ErrorInDataConstructor ProperName ErrorMessage
143+ | ErrorInTypeConstructor ProperName ErrorMessage
144+ | ErrorInBindingGroup [Ident] ErrorMessage
145+ | ErrorInDataBindingGroup ErrorMessage
146+ | ErrorInTypeSynonym ProperName ErrorMessage
147+ | ErrorInValueDeclaration Ident ErrorMessage
148+ | ErrorInForeignImport Ident ErrorMessage
149+ | PositionedError SourceSpan ErrorMessage
150+ | SimpleErrorWrapper SimpleErrorMessage
151+ deriving (Show)
152+
153+instance UnificationError Type ErrorMessage where
154+ occursCheckFailed t = SimpleErrorWrapper $ InfiniteType t
155+
156+instance UnificationError Kind ErrorMessage where
157+ occursCheckFailed k = SimpleErrorWrapper $ InfiniteKind k
158+
159+-- |
160+-- Get the error code for a particular error type
161+--
162+errorCode :: ErrorMessage -> String
163+errorCode em = case unwrapErrorMessage em of
164+ (ErrorParsingExterns _) -> "ErrorParsingExterns"
165+ (ErrorParsingFFIModule _) -> "ErrorParsingFFIModule"
166+ (ErrorParsingModule _) -> "ErrorParsingModule"
167+ MissingFFIModule{} -> "MissingFFIModule"
168+ MultipleFFIModules{} -> "MultipleFFIModules"
169+ UnnecessaryFFIModule{} -> "UnnecessaryFFIModule"
170+ (InvalidExternsFile _) -> "InvalidExternsFile"
171+ (CannotGetFileInfo _) -> "CannotGetFileInfo"
172+ (CannotReadFile _) -> "CannotReadFile"
173+ (CannotWriteFile _) -> "CannotWriteFile"
174+ (InfiniteType _) -> "InfiniteType"
175+ (InfiniteKind _) -> "InfiniteKind"
176+ CannotReorderOperators -> "CannotReorderOperators"
177+ (MultipleFixities _) -> "MultipleFixities"
178+ (OrphanTypeDeclaration _) -> "OrphanTypeDeclaration"
179+ (OrphanFixityDeclaration _) -> "OrphanFixityDeclaration"
180+ (RedefinedModule _) -> "RedefinedModule"
181+ (RedefinedIdent _) -> "RedefinedIdent"
182+ OverlappingNamesInLet -> "OverlappingNamesInLet"
183+ (UnknownModule _) -> "UnknownModule"
184+ (UnknownType _) -> "UnknownType"
185+ (UnknownTypeClass _) -> "UnknownTypeClass"
186+ (UnknownValue _) -> "UnknownValue"
187+ (UnknownDataConstructor _ _) -> "UnknownDataConstructor"
188+ (UnknownTypeConstructor _) -> "UnknownTypeConstructor"
189+ (ConflictingImport _ _) -> "ConflictingImport"
190+ (ConflictingImports _ _ _) -> "ConflictingImports"
191+ (ConflictingTypeDecls _) -> "ConflictingTypeDecls"
192+ (ConflictingCtorDecls _) -> "ConflictingCtorDecls"
193+ (TypeConflictsWithClass _) -> "TypeConflictsWithClass"
194+ (CtorConflictsWithClass _) -> "CtorConflictsWithClass"
195+ (ClassConflictsWithType _) -> "ClassConflictsWithType"
196+ (ClassConflictsWithCtor _) -> "ClassConflictsWithCtor"
197+ (DuplicateClassExport _) -> "DuplicateClassExport"
198+ (DuplicateValueExport _) -> "DuplicateValueExport"
199+ (DuplicateTypeArgument _) -> "DuplicateTypeArgument"
200+ InvalidDoBind -> "InvalidDoBind"
201+ InvalidDoLet -> "InvalidDoLet"
202+ (CycleInDeclaration _) -> "CycleInDeclaration"
203+ (CycleInTypeSynonym _) -> "CycleInTypeSynonym"
204+ (CycleInModules _) -> "CycleInModules"
205+ (NameIsUndefined _) -> "NameIsUndefined"
206+ (NameNotInScope _) -> "NameNotInScope"
207+ (UndefinedTypeVariable _) -> "UndefinedTypeVariable"
208+ (PartiallyAppliedSynonym _) -> "PartiallyAppliedSynonym"
209+ (EscapedSkolem _) -> "EscapedSkolem"
210+ UnspecifiedSkolemScope -> "UnspecifiedSkolemScope"
211+ (TypesDoNotUnify _ _) -> "TypesDoNotUnify"
212+ (KindsDoNotUnify _ _) -> "KindsDoNotUnify"
213+ (ConstrainedTypeUnified _ _) -> "ConstrainedTypeUnified"
214+ (OverlappingInstances _ _ _) -> "OverlappingInstances"
215+ (NoInstanceFound _ _) -> "NoInstanceFound"
216+ (DuplicateLabel _ _) -> "DuplicateLabel"
217+ (DuplicateValueDeclaration _) -> "DuplicateValueDeclaration"
218+ (ArgListLengthsDiffer _) -> "ArgListLengthsDiffer"
219+ (OverlappingArgNames _) -> "OverlappingArgNames"
220+ (MissingClassMember _) -> "MissingClassMember"
221+ (ExtraneousClassMember _) -> "ExtraneousClassMember"
222+ (ExpectedType _) -> "ExpectedType"
223+ (IncorrectConstructorArity _) -> "IncorrectConstructorArity"
224+ SubsumptionCheckFailed -> "SubsumptionCheckFailed"
225+ (ExprDoesNotHaveType _ _) -> "ExprDoesNotHaveType"
226+ (PropertyIsMissing _ _) -> "PropertyIsMissing"
227+ (CannotApplyFunction _ _) -> "CannotApplyFunction"
228+ TypeSynonymInstance -> "TypeSynonymInstance"
229+ InvalidNewtype -> "InvalidNewtype"
230+ (InvalidInstanceHead _) -> "InvalidInstanceHead"
231+ (TransitiveExportError _ _) -> "TransitiveExportError"
232+ (ShadowedName _) -> "ShadowedName"
233+ (WildcardInferredType _) -> "WildcardInferredType"
234+ (NotExhaustivePattern _ _) -> "NotExhaustivePattern"
235+ (OverlappingPattern _ _) -> "OverlappingPattern"
236+ (ClassOperator _ _) -> "ClassOperator"
237+
238+-- |
239+-- A stack trace for an error
240+--
241+newtype MultipleErrors = MultipleErrors
242+ { runMultipleErrors :: [ErrorMessage] } deriving (Show, Monoid)
243+
244+instance UnificationError Type MultipleErrors where
245+ occursCheckFailed t = MultipleErrors [occursCheckFailed t]
246+
247+instance UnificationError Kind MultipleErrors where
248+ occursCheckFailed k = MultipleErrors [occursCheckFailed k]
249+
250+-- | Check whether a collection of errors is empty or not.
251+nonEmpty :: MultipleErrors -> Bool
252+nonEmpty = not . null . runMultipleErrors
253+
254+-- |
255+-- Create an error set from a single simple error message
256+--
257+errorMessage :: SimpleErrorMessage -> MultipleErrors
258+errorMessage err = MultipleErrors [SimpleErrorWrapper err]
259+
260+
261+-- |
262+-- Create an error set from a single error message
263+--
264+singleError :: ErrorMessage -> MultipleErrors
265+singleError = MultipleErrors . pure
266+
267+-- |
268+-- Lift a function on ErrorMessage to a function on MultipleErrors
269+--
270+onErrorMessages :: (ErrorMessage -> ErrorMessage) -> MultipleErrors -> MultipleErrors
271+onErrorMessages f = MultipleErrors . map f . runMultipleErrors
272+
273+-- | The various types of things which might need to be relabelled in errors messages.
274+data LabelType = TypeLabel | SkolemLabel String deriving (Show, Eq, Ord)
275+
276+-- | A map from rigid type variable name/unknown variable pairs to new variables.
277+type UnknownMap = M.Map (LabelType, Unknown) Unknown
278+
279+-- | How critical the issue is
280+data Level = Error | Warning deriving Show
281+
282+-- |
283+-- Extract nested error messages from wrapper errors
284+--
285+unwrapErrorMessage :: ErrorMessage -> SimpleErrorMessage
286+unwrapErrorMessage em = case em of
287+ (ErrorCheckingKind _ err) -> unwrapErrorMessage err
288+ (ErrorCheckingType _ _ err) -> unwrapErrorMessage err
289+ (ErrorInApplication _ _ _ err) -> unwrapErrorMessage err
290+ (ErrorInBindingGroup _ err) -> unwrapErrorMessage err
291+ (ErrorInDataBindingGroup err) -> unwrapErrorMessage err
292+ (ErrorInDataConstructor _ err) -> unwrapErrorMessage err
293+ (ErrorInExpression _ err) -> unwrapErrorMessage err
294+ (ErrorInForeignImport _ err) -> unwrapErrorMessage err
295+ (ErrorInInstance _ _ err) -> unwrapErrorMessage err
296+ (ErrorInModule _ err) -> unwrapErrorMessage err
297+ (ErrorInSubsumption _ _ err) -> unwrapErrorMessage err
298+ (ErrorInTypeConstructor _ err) -> unwrapErrorMessage err
299+ (ErrorInTypeSynonym _ err) -> unwrapErrorMessage err
300+ (ErrorInValueDeclaration _ err) -> unwrapErrorMessage err
301+ (ErrorInferringType _ err) -> unwrapErrorMessage err
302+ (ErrorUnifyingTypes _ _ err) -> unwrapErrorMessage err
303+ (NotYetDefined _ err) -> unwrapErrorMessage err
304+ (PositionedError _ err) -> unwrapErrorMessage err
305+ (SimpleErrorWrapper sem) -> sem
306+
307+replaceUnknowns :: Type -> State UnknownMap Type
308+replaceUnknowns = everywhereOnTypesM replaceTypes
309+ where
310+ lookupTable :: (LabelType, Unknown) -> UnknownMap -> (Unknown, UnknownMap)
311+ lookupTable x m = case M.lookup x m of
312+ Nothing -> let i = length (filter (on (==) fst x) (M.keys m)) in (i, M.insert x i m)
313+ Just i -> (i, m)
314+
315+ replaceTypes :: Type -> State UnknownMap Type
316+ replaceTypes (TUnknown u) = state $ first TUnknown . lookupTable (TypeLabel, u)
317+ replaceTypes (Skolem name s sko) = state $ first (flip (Skolem name) sko) . lookupTable (SkolemLabel name, s)
318+ replaceTypes other = return other
319+
320+onTypesInErrorMessageM :: (Applicative m) => (Type -> m Type) -> ErrorMessage -> m ErrorMessage
321+onTypesInErrorMessageM f = g
322+ where
323+ gSimple (InfiniteType t) = InfiniteType <$> (f t)
324+ gSimple (TypesDoNotUnify t1 t2) = TypesDoNotUnify <$> (f t1) <*> (f t2)
325+ gSimple (ConstrainedTypeUnified t1 t2) = ConstrainedTypeUnified <$> (f t1) <*> (f t2)
326+ gSimple (ExprDoesNotHaveType e t) = ExprDoesNotHaveType e <$> (f t)
327+ gSimple (PropertyIsMissing s t) = PropertyIsMissing s <$> (f t)
328+ gSimple (CannotApplyFunction t e) = CannotApplyFunction <$> f t <*> (pure e)
329+ gSimple (InvalidInstanceHead t) = InvalidInstanceHead <$> f t
330+ gSimple other = pure other
331+ g (ErrorInSubsumption t1 t2 em) = ErrorInSubsumption <$> (f t1) <*> (f t2) <*> (g em)
332+ g (ErrorUnifyingTypes t1 t2 e) = ErrorUnifyingTypes <$> (f t1) <*> (f t2) <*> (g e)
333+ g (ErrorCheckingType e t em) = ErrorCheckingType e <$> (f t) <*> (g em)
334+ g (ErrorCheckingKind t em) = ErrorCheckingKind <$> (f t) <*> g em
335+ g (ErrorInApplication e1 t1 e2 em) = ErrorInApplication e1 <$> (f t1) <*> (pure e2) <*> (g em)
336+ g (NotYetDefined x e) = NotYetDefined x <$> (g e)
337+ g (ErrorInExpression x e) = ErrorInExpression x <$> (g e)
338+ g (ErrorInModule x e) = ErrorInModule x <$> (g e)
339+ g (ErrorInInstance x y e) = ErrorInInstance x y <$> (g e)
340+ g (ErrorInferringType x e) = ErrorInferringType x <$> (g e)
341+ g (ErrorInDataConstructor x e) = ErrorInDataConstructor x <$> (g e)
342+ g (ErrorInTypeConstructor x e) = ErrorInTypeConstructor x <$> (g e)
343+ g (ErrorInBindingGroup x e) = ErrorInBindingGroup x <$> (g e)
344+ g (ErrorInDataBindingGroup e) = ErrorInDataBindingGroup <$> (g e)
345+ g (ErrorInTypeSynonym x e) = ErrorInTypeSynonym x <$> (g e)
346+ g (ErrorInValueDeclaration x e) = ErrorInValueDeclaration x <$> (g e)
347+ g (ErrorInForeignImport x e) = ErrorInForeignImport x <$> (g e)
348+ g (PositionedError x e) = PositionedError x <$> (g e)
349+ g (SimpleErrorWrapper sem) = SimpleErrorWrapper <$> gSimple sem
350+
351+-- |
352+-- Pretty print a single error, simplifying if necessary
353+--
354+prettyPrintSingleError :: Bool -> Level -> ErrorMessage -> State UnknownMap Box.Box
355+prettyPrintSingleError full level e = prettyPrintErrorMessage <$> onTypesInErrorMessageM replaceUnknowns (if full then e else simplifyErrorMessage e)
356+ where
357+ -- |
358+ -- Pretty print an ErrorMessage
359+ --
360+ prettyPrintErrorMessage :: ErrorMessage -> Box.Box
361+ prettyPrintErrorMessage em =
362+ paras $
363+ go em:suggestions em ++
364+ [line $ "See " ++ wikiUri ++ " for more information, or to contribute content related to this error."]
365+ where
366+ wikiUri :: String
367+ wikiUri = "https://github.com/purescript/purescript/wiki/Error-Code-" ++ errorCode e
368+
369+ go :: ErrorMessage -> Box.Box
370+ goSimple (CannotGetFileInfo path) =
371+ paras [ line "Unable to read file info: "
372+ , indent . line $ path
373+ ]
374+ goSimple (CannotReadFile path) =
375+ paras [ line "Unable to read file: "
376+ , indent . line $ path
377+ ]
378+ goSimple (CannotWriteFile path) =
379+ paras [ line "Unable to write file: "
380+ , indent . line $ path
381+ ]
382+ goSimple (ErrorParsingExterns err) =
383+ paras [ lineWithLevel "parsing externs files: "
384+ , indent . line . show $ err
385+ ]
386+ goSimple (ErrorParsingFFIModule path) =
387+ paras [ line "Unable to parse module from FFI file: "
388+ , indent . line $ path
389+ ]
390+ goSimple (ErrorParsingModule err) =
391+ paras [ line "Unable to parse module: "
392+ , indent . line . show $ err
393+ ]
394+ goSimple (MissingFFIModule mn) =
395+ line $ "Missing FFI implementations for module " ++ show mn
396+ goSimple (UnnecessaryFFIModule mn path) =
397+ paras [ line $ "Unnecessary FFI implementations have been provided for module " ++ show mn ++ ": "
398+ , indent . line $ path
399+ ]
400+ goSimple (MultipleFFIModules mn paths) =
401+ paras $ [ line $ "Multiple FFI implementations have been provided for module " ++ show mn ++ ": " ]
402+ ++ map (indent . line) paths
403+ goSimple (InvalidExternsFile path) =
404+ paras [ line "Externs file is invalid: "
405+ , indent . line $ path
406+ ]
407+ goSimple InvalidDoBind =
408+ line "Bind statement cannot be the last statement in a do block"
409+ goSimple InvalidDoLet =
410+ line "Let statement cannot be the last statement in a do block"
411+ goSimple CannotReorderOperators =
412+ line "Unable to reorder operators"
413+ goSimple UnspecifiedSkolemScope =
414+ line "Skolem variable scope is unspecified"
415+ goSimple OverlappingNamesInLet =
416+ line "Overlapping names in let binding."
417+ goSimple (InfiniteType ty) =
418+ paras [ line "Infinite type detected: "
419+ , indent $ line $ prettyPrintType ty
420+ ]
421+ goSimple (InfiniteKind ki) =
422+ paras [ line "Infinite kind detected: "
423+ , indent $ line $ prettyPrintKind ki
424+ ]
425+ goSimple (MultipleFixities name) =
426+ line $ "Multiple fixity declarations for " ++ show name
427+ goSimple (OrphanTypeDeclaration nm) =
428+ line $ "Orphan type declaration for " ++ show nm
429+ goSimple (OrphanFixityDeclaration op) =
430+ line $ "Orphan fixity declaration for " ++ show op
431+ goSimple (RedefinedModule name) =
432+ line $ "Module " ++ show name ++ " has been defined multiple times"
433+ goSimple (RedefinedIdent name) =
434+ line $ "Name " ++ show name ++ " has been defined multiple times"
435+ goSimple (UnknownModule mn) =
436+ line $ "Unknown module " ++ show mn
437+ goSimple (UnknownType name) =
438+ line $ "Unknown type " ++ show name
439+ goSimple (UnknownTypeClass name) =
440+ line $ "Unknown type class " ++ show name
441+ goSimple (UnknownValue name) =
442+ line $ "Unknown value " ++ show name
443+ goSimple (UnknownTypeConstructor name) =
444+ line $ "Unknown type constructor " ++ show name
445+ goSimple (UnknownDataConstructor dc tc) =
446+ line $ "Unknown data constructor " ++ show dc ++ foldMap ((" for type constructor " ++) . show) tc
447+ goSimple (ConflictingImport nm mn) =
448+ line $ "Cannot declare " ++ show nm ++ " since another declaration of that name was imported from " ++ show mn
449+ goSimple (ConflictingImports nm m1 m2) =
450+ line $ "Conflicting imports for " ++ show nm ++ " from modules " ++ show m1 ++ " and " ++ show m2
451+ goSimple (ConflictingTypeDecls nm) =
452+ line $ "Conflicting type declarations for " ++ show nm
453+ goSimple (ConflictingCtorDecls nm) =
454+ line $ "Conflicting data constructor declarations for " ++ show nm
455+ goSimple (TypeConflictsWithClass nm) =
456+ line $ "Type " ++ show nm ++ " conflicts with type class declaration of the same name"
457+ goSimple (CtorConflictsWithClass nm) =
458+ line $ "Data constructor " ++ show nm ++ " conflicts with type class declaration of the same name"
459+ goSimple (ClassConflictsWithType nm) =
460+ line $ "Type class " ++ show nm ++ " conflicts with type declaration of the same name"
461+ goSimple (ClassConflictsWithCtor nm) =
462+ line $ "Type class " ++ show nm ++ " conflicts with data constructor declaration of the same name"
463+ goSimple (DuplicateClassExport nm) =
464+ line $ "Duplicate export declaration for type class " ++ show nm
465+ goSimple (DuplicateValueExport nm) =
466+ line $ "Duplicate export declaration for value " ++ show nm
467+ goSimple (CycleInDeclaration nm) =
468+ line $ "Cycle in declaration of " ++ show nm
469+ goSimple (CycleInModules mns) =
470+ line $ "Cycle in module dependencies: " ++ intercalate ", " (map show mns)
471+ goSimple (CycleInTypeSynonym pn) =
472+ line $ "Cycle in type synonym" ++ foldMap ((" " ++) . show) pn
473+ goSimple (NameIsUndefined ident) =
474+ line $ show ident ++ " is undefined"
475+ goSimple (NameNotInScope ident) =
476+ line $ show ident ++ " may not be defined in the current scope"
477+ goSimple (UndefinedTypeVariable name) =
478+ line $ "Type variable " ++ show name ++ " is undefined"
479+ goSimple (PartiallyAppliedSynonym name) =
480+ line $ "Partially applied type synonym " ++ show name
481+ goSimple (EscapedSkolem binding) =
482+ paras $ [ line "Rigid/skolem type variable has escaped." ]
483+ <> foldMap (\expr -> [ line "Relevant expression: "
484+ , indent $ line $ prettyPrintValue expr
485+ ]) binding
486+ goSimple (TypesDoNotUnify t1 t2)
487+ = paras [ line "Cannot unify type"
488+ , indent $ line $ prettyPrintType t1
489+ , line "with type"
490+ , indent $ line $ prettyPrintType t2
491+ ]
492+ goSimple (KindsDoNotUnify k1 k2) =
493+ paras [ line "Cannot unify kind"
494+ , indent $ line $ prettyPrintKind k1
495+ , line "with kind"
496+ , indent $ line $ prettyPrintKind k2
497+ ]
498+ goSimple (ConstrainedTypeUnified t1 t2) =
499+ paras [ line "Cannot unify constrained type"
500+ , indent $ line $ prettyPrintType t1
501+ , line "with type"
502+ , indent $ line $ prettyPrintType t2
503+ ]
504+ goSimple (OverlappingInstances nm ts ds) =
505+ paras [ line $ "Overlapping instances found for " ++ show nm ++ " " ++ unwords (map prettyPrintTypeAtom ts) ++ ":"
506+ , paras $ map prettyPrintDictionaryValue ds
507+ ]
508+ goSimple (NoInstanceFound nm ts) =
509+ line $ "No instance found for " ++ show nm ++ " " ++ unwords (map prettyPrintTypeAtom ts)
510+ goSimple (DuplicateLabel l expr) =
511+ paras $ [ line $ "Duplicate label " ++ show l ++ " in row." ]
512+ <> foldMap (\expr' -> [ line "Relevant expression: "
513+ , indent $ line $ prettyPrintValue expr'
514+ ]) expr
515+ goSimple (DuplicateTypeArgument name) =
516+ line $ "Duplicate type argument " ++ show name
517+ goSimple (DuplicateValueDeclaration nm) =
518+ line $ "Duplicate value declaration for " ++ show nm
519+ goSimple (ArgListLengthsDiffer ident) =
520+ line $ "Argument list lengths differ in declaration " ++ show ident
521+ goSimple (OverlappingArgNames ident) =
522+ line $ "Overlapping names in function/binder" ++ foldMap ((" in declaration" ++) . show) ident
523+ goSimple (MissingClassMember ident) =
524+ line $ "Member " ++ show ident ++ " has not been implemented"
525+ goSimple (ExtraneousClassMember ident) =
526+ line $ "Member " ++ show ident ++ " is not a member of the class being instantiated"
527+ goSimple (ExpectedType kind) =
528+ line $ "Expected type of kind *, was " ++ prettyPrintKind kind
529+ goSimple (IncorrectConstructorArity nm) =
530+ line $ "Wrong number of arguments to constructor " ++ show nm
531+ goSimple SubsumptionCheckFailed = line $ "Unable to check type subsumption"
532+ goSimple (ExprDoesNotHaveType expr ty) =
533+ paras [ line "Expression"
534+ , indent $ line $ prettyPrintValue expr
535+ , line "does not have type"
536+ , indent $ line $ prettyPrintType ty
537+ ]
538+ goSimple (PropertyIsMissing prop row) =
539+ line $ "Row " ++ prettyPrintRow row ++ " lacks required property " ++ show prop
540+ goSimple (CannotApplyFunction fn arg) =
541+ paras [ line "Cannot apply function of type"
542+ , indent $ line $ prettyPrintType fn
543+ , line "to argument"
544+ , indent $ line $ prettyPrintValue arg
545+ ]
546+ goSimple TypeSynonymInstance =
547+ line "Type synonym instances are disallowed"
548+ goSimple InvalidNewtype =
549+ line "Newtypes must define a single constructor with a single argument"
550+ goSimple (InvalidInstanceHead ty) =
551+ paras [ line "Invalid type in class instance head:"
552+ , indent $ line $ prettyPrintType ty
553+ ]
554+ goSimple (TransitiveExportError x ys) =
555+ paras $ (line $ "An export for " ++ prettyPrintExport x ++ " requires the following to also be exported: ")
556+ : map (line . prettyPrintExport) ys
557+ goSimple (ShadowedName nm) =
558+ line $ "Name '" ++ show nm ++ "' was shadowed."
559+ goSimple (ClassOperator className opName) =
560+ paras [ line $ "Class '" ++ show className ++ "' declares operator " ++ show opName ++ "."
561+ , indent $ line $ "This may be disallowed in the future - consider declaring a named member in the class and making the operator an alias:"
562+ , indent $ line $ show opName ++ " = someMember"
563+ ]
564+ goSimple (WildcardInferredType ty) =
565+ line $ "The wildcard type definition has the inferred type " ++ prettyPrintType ty
566+ goSimple (NotExhaustivePattern bs b) =
567+ indent $ paras $ [ line "Pattern could not be determined to cover all cases."
568+ , line $ "The definition has the following uncovered cases:\n"
569+ , Box.hsep 1 Box.left (map (paras . map (line . prettyPrintBinderAtom)) (transpose bs))
570+ ] ++ if not b then [line "..."] else []
571+ goSimple (OverlappingPattern bs b) =
572+ indent $ paras $ [ line "Redundant cases have been detected."
573+ , line $ "The definition has the following redundant cases:\n"
574+ , Box.hsep 1 Box.left (map (paras . map (line . prettyPrintBinderAtom)) (transpose bs))
575+ ] ++ if not b then [line "..."] else []
576+ go (NotYetDefined names err) =
577+ paras [ line $ "The following are not yet defined here: " ++ intercalate ", " (map show names) ++ ":"
578+ , indent $ go err
579+ ]
580+ go (ErrorUnifyingTypes t1 t2 err) =
581+ paras [ lineWithLevel "unifying type "
582+ , indent $ line $ prettyPrintType t1
583+ , line "with type"
584+ , indent $ line $ prettyPrintType t2
585+ , go err
586+ ]
587+ go (ErrorInExpression expr err) =
588+ paras [ lineWithLevel "in expression:"
589+ , indent $ line $ prettyPrintValue expr
590+ , go err
591+ ]
592+ go (ErrorInModule mn err) =
593+ paras [ lineWithLevel $ "in module " ++ show mn ++ ":"
594+ , go err
595+ ]
596+ go (ErrorInSubsumption t1 t2 err) =
597+ paras [ lineWithLevel "checking that type "
598+ , indent $ line $ prettyPrintType t1
599+ , line "subsumes type"
600+ , indent $ line $ prettyPrintType t2
601+ , go err
602+ ]
603+ go (ErrorInInstance name ts err) =
604+ paras [ lineWithLevel $ "in type class instance " ++ show name ++ " " ++ unwords (map prettyPrintTypeAtom ts) ++ ":"
605+ , go err
606+ ]
607+ go (ErrorCheckingKind ty err) =
608+ paras [ lineWithLevel "checking kind of type "
609+ , indent $ line $ prettyPrintType ty
610+ , go err
611+ ]
612+ go (ErrorInferringType expr err) =
613+ paras [ lineWithLevel "inferring type of value "
614+ , indent $ line $ prettyPrintValue expr
615+ , go err
616+ ]
617+ go (ErrorCheckingType expr ty err) =
618+ paras [ lineWithLevel "checking that value "
619+ , indent $ line $ prettyPrintValue expr
620+ , line "has type"
621+ , indent $ line $ prettyPrintType ty
622+ , go err
623+ ]
624+ go (ErrorInApplication f t a err) =
625+ paras [ lineWithLevel "applying function"
626+ , indent $ line $ prettyPrintValue f
627+ , line "of type"
628+ , indent $ line $ prettyPrintType t
629+ , line "to argument"
630+ , indent $ line $ prettyPrintValue a
631+ , go err
632+ ]
633+ go (ErrorInDataConstructor nm err) =
634+ paras [ lineWithLevel $ "in data constructor " ++ show nm ++ ":"
635+ , go err
636+ ]
637+ go (ErrorInTypeConstructor nm err) =
638+ paras [ lineWithLevel $ "in type constructor " ++ show nm ++ ":"
639+ , go err
640+ ]
641+ go (ErrorInBindingGroup nms err) =
642+ paras [ lineWithLevel $ "in binding group " ++ intercalate ", " (map show nms) ++ ":"
643+ , go err
644+ ]
645+ go (ErrorInDataBindingGroup err) =
646+ paras [ lineWithLevel $ "in data binding group:"
647+ , go err
648+ ]
649+ go (ErrorInTypeSynonym name err) =
650+ paras [ lineWithLevel $ "in type synonym " ++ show name ++ ":"
651+ , go err
652+ ]
653+ go (ErrorInValueDeclaration n err) =
654+ paras [ lineWithLevel $ "in value declaration " ++ show n ++ ":"
655+ , go err
656+ ]
657+ go (ErrorInForeignImport nm err) =
658+ paras [ lineWithLevel $ "in foreign import " ++ show nm ++ ":"
659+ , go err
660+ ]
661+ go (PositionedError srcSpan err) =
662+ paras [ lineWithLevel $ "at " ++ displaySourceSpan srcSpan ++ ":"
663+ , indent $ go err
664+ ]
665+ go (SimpleErrorWrapper sem) = goSimple sem
666+
667+ line :: String -> Box.Box
668+ line = Box.text
669+
670+ lineWithLevel :: String -> Box.Box
671+ lineWithLevel text = line $ show level ++ " " ++ text
672+
673+ suggestions :: ErrorMessage -> [Box.Box]
674+ suggestions = suggestions' . unwrapErrorMessage
675+ where
676+ suggestions' (ConflictingImport nm im) = [ line $ "Possible fix: hide " ++ show nm ++ " when importing " ++ show im ++ ":"
677+ , indent . line $ "import " ++ show im ++ " hiding (" ++ nm ++ ")"
678+ ]
679+ suggestions' (TypesDoNotUnify t1 t2)
680+ | isObject t1 && isFunction t2 = [line "Note that function composition in PureScript is defined using (<<<)"]
681+ | otherwise = []
682+ suggestions' _ = []
683+
684+ paras :: [Box.Box] -> Box.Box
685+ paras = Box.vcat Box.left
686+
687+ indent :: Box.Box -> Box.Box
688+ indent = Box.moveRight 2
689+
690+ -- |
691+ -- Render a DictionaryValue fit for human consumption in error messages
692+ --
693+ prettyPrintDictionaryValue :: DictionaryValue -> Box.Box
694+ prettyPrintDictionaryValue (LocalDictionaryValue _) = line "Dictionary in scope"
695+ prettyPrintDictionaryValue (GlobalDictionaryValue nm) = line (show nm)
696+ prettyPrintDictionaryValue (DependentDictionaryValue nm args) = paras [ line $ (show nm) ++ " via"
697+ , indent $ paras $ map prettyPrintDictionaryValue args
698+ ]
699+ prettyPrintDictionaryValue (SubclassDictionaryValue sup nm _) = paras [ line $ (show nm) ++ " via superclass"
700+ , indent $ prettyPrintDictionaryValue sup
701+ ]
702+
703+ -- |
704+ -- Pretty print and export declaration
705+ --
706+ prettyPrintExport :: DeclarationRef -> String
707+ prettyPrintExport (TypeRef pn _) = show pn
708+ prettyPrintExport (ValueRef ident) = show ident
709+ prettyPrintExport (TypeClassRef pn) = show pn
710+ prettyPrintExport (TypeInstanceRef ident) = show ident
711+ prettyPrintExport (ModuleRef name) = "module " ++ show name
712+ prettyPrintExport (PositionedDeclarationRef _ _ ref) = prettyPrintExport ref
713+
714+ -- |
715+ -- Simplify an error message
716+ --
717+ simplifyErrorMessage :: ErrorMessage -> ErrorMessage
718+ simplifyErrorMessage = unwrap Nothing
719+ where
720+ unwrap :: Maybe SourceSpan -> ErrorMessage -> ErrorMessage
721+ unwrap pos (ErrorInExpression _ err) = unwrap pos err
722+ unwrap pos (ErrorInInstance name ts err) = ErrorInInstance name ts (unwrap pos err)
723+ unwrap pos (ErrorInSubsumption t1 t2 err) = ErrorInSubsumption t1 t2 (unwrap pos err)
724+ unwrap pos (ErrorUnifyingTypes _ _ err) = unwrap pos err
725+ unwrap pos (ErrorInferringType _ err) = unwrap pos err
726+ unwrap pos (ErrorCheckingType _ _ err) = unwrap pos err
727+ unwrap pos (ErrorCheckingKind ty err) = ErrorCheckingKind ty (unwrap pos err)
728+ unwrap pos (ErrorInModule mn err) = ErrorInModule mn (unwrap pos err)
729+ unwrap pos (ErrorInApplication _ _ _ err) = unwrap pos err
730+ unwrap pos (ErrorInDataConstructor nm err) = ErrorInDataConstructor nm (unwrap pos err)
731+ unwrap pos (ErrorInTypeConstructor nm err) = ErrorInTypeConstructor nm (unwrap pos err)
732+ unwrap pos (ErrorInBindingGroup nms err) = ErrorInBindingGroup nms (unwrap pos err)
733+ unwrap pos (ErrorInDataBindingGroup err) = ErrorInDataBindingGroup (unwrap pos err)
734+ unwrap pos (ErrorInTypeSynonym nm err) = ErrorInTypeSynonym nm (unwrap pos err)
735+ unwrap pos (ErrorInValueDeclaration nm err) = ErrorInValueDeclaration nm (unwrap pos err)
736+ unwrap pos (ErrorInForeignImport nm err) = ErrorInForeignImport nm (unwrap pos err)
737+ unwrap pos (NotYetDefined ns err) = NotYetDefined ns (unwrap pos err)
738+ unwrap _ (PositionedError pos err) = unwrap (Just pos) err
739+ unwrap pos other = wrap pos other
740+
741+ wrap :: Maybe SourceSpan -> ErrorMessage -> ErrorMessage
742+ wrap Nothing = id
743+ wrap (Just pos) = PositionedError pos
744+
745+
746+-- |
747+-- Pretty print multiple errors
748+--
749+prettyPrintMultipleErrors :: Bool -> MultipleErrors -> String
750+prettyPrintMultipleErrors full = flip evalState M.empty . prettyPrintMultipleErrorsWith Error "Error found:" "Multiple errors found:" full
751+
752+-- |
753+-- Pretty print multiple warnings
754+--
755+prettyPrintMultipleWarnings :: Bool -> MultipleErrors -> String
756+prettyPrintMultipleWarnings full = flip evalState M.empty . prettyPrintMultipleErrorsWith Warning "Warning found:" "Multiple warnings found:" full
757+
758+prettyPrintMultipleErrorsWith :: Level -> String -> String -> Bool -> MultipleErrors -> State UnknownMap String
759+prettyPrintMultipleErrorsWith level intro _ full (MultipleErrors [e]) = do
760+ result <- prettyPrintSingleError full level e
761+ return $ renderBox $
762+ Box.vcat Box.left [ Box.text intro
763+ , result
764+ ]
765+prettyPrintMultipleErrorsWith level _ intro full (MultipleErrors es) = do
766+ result <- forM es $ (liftM $ Box.moveRight 2) . prettyPrintSingleError full level
767+ return $ renderBox $
768+ Box.vcat Box.left [ Box.text intro
769+ , Box.vsep 1 Box.left result
770+ ]
771+
772+renderBox :: Box.Box -> String
773+renderBox = unlines . map trimEnd . lines . Box.render
774+ where
775+ trimEnd = reverse . dropWhile (== ' ') . reverse
776+
777+-- |
778+-- Interpret multiple errors and warnings in a monad supporting errors and warnings
779+--
780+interpretMultipleErrorsAndWarnings :: (MonadError MultipleErrors m, MonadWriter MultipleErrors m) => (Either MultipleErrors a, MultipleErrors) -> m a
781+interpretMultipleErrorsAndWarnings (err, ws) = do
782+ tell ws
783+ either throwError return $ err
784+
785+-- |
786+-- Rethrow an error with a more detailed error message in the case of failure
787+--
788+rethrow :: (MonadError e m) => (e -> e) -> m a -> m a
789+rethrow f = flip catchError $ \e -> throwError (f e)
790+
791+-- |
792+-- Rethrow an error with source position information
793+--
794+rethrowWithPosition :: (MonadError MultipleErrors m) => SourceSpan -> m a -> m a
795+rethrowWithPosition pos = rethrow (onErrorMessages withPosition)
796+ where
797+ withPosition :: ErrorMessage -> ErrorMessage
798+ withPosition (PositionedError _ err) = withPosition err
799+ withPosition err = PositionedError pos err
800+
801+-- |
802+-- Collect errors in in parallel
803+--
804+parU :: (MonadError MultipleErrors m, Functor m) => [a] -> (a -> m b) -> m [b]
805+parU xs f = forM xs (withError . f) >>= collectErrors
806+ where
807+ withError :: (MonadError MultipleErrors m, Functor m) => m a -> m (Either MultipleErrors a)
808+ withError u = catchError (Right <$> u) (return . Left)
809+
810+ collectErrors :: (MonadError MultipleErrors m, Functor m) => [Either MultipleErrors a] -> m [a]
811+ collectErrors es = case lefts es of
812+ [] -> return $ rights es
813+ errs -> throwError $ fold errs
src/Language/PureScript/Kinds.hsnew file+72
@@ -0,0 +1,72 @@
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+
18+module Language.PureScript.Kinds where
19+
20+import Data.Data
21+import qualified Data.Aeson.TH as A
22+
23+import Control.Applicative
24+import Control.Monad.Unify (Unknown)
25+
26+-- |
27+-- The data type of kinds
28+--
29+data Kind
30+ -- |
31+ -- Unification variable of type Kind
32+ --
33+ = KUnknown Unknown
34+ -- |
35+ -- The kind of types
36+ --
37+ | Star
38+ -- |
39+ -- The kind of effects
40+ --
41+ | Bang
42+ -- |
43+ -- Kinds for labelled, unordered rows without duplicates
44+ --
45+ | Row Kind
46+ -- |
47+ -- Function kinds
48+ --
49+ | FunKind Kind Kind deriving (Show, Eq, Ord, Data, Typeable)
50+
51+$(A.deriveJSON A.defaultOptions ''Kind)
52+
53+everywhereOnKinds :: (Kind -> Kind) -> Kind -> Kind
54+everywhereOnKinds f = go
55+ where
56+ go (Row k1) = f (Row (go k1))
57+ go (FunKind k1 k2) = f (FunKind (go k1) (go k2))
58+ go other = f other
59+
60+everywhereOnKindsM :: (Functor m, Applicative m, Monad m) => (Kind -> m Kind) -> Kind -> m Kind
61+everywhereOnKindsM f = go
62+ where
63+ go (Row k1) = (Row <$> go k1) >>= f
64+ go (FunKind k1 k2) = (FunKind <$> go k1 <*> go k2) >>= f
65+ go other = f other
66+
67+everythingOnKinds :: (r -> r -> r) -> (Kind -> r) -> Kind -> r
68+everythingOnKinds (<>) f = go
69+ where
70+ go k@(Row k1) = f k <> go k1
71+ go k@(FunKind k1 k2) = f k <> go k1 <> go k2
72+ go other = f other
src/Language/PureScript/Linter.hsnew file+88
@@ -0,0 +1,88 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.Linter
4+-- Copyright : (c) Copyright 2015 PureScript
5+-- License : 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+
19+module Language.PureScript.Linter (lint, module L) where
20+
21+import Data.List (mapAccumL, nub)
22+import Data.Maybe (mapMaybe)
23+import Data.Monoid
24+
25+import qualified Data.Set as S
26+
27+import Control.Applicative
28+import Control.Monad.Writer.Class
29+
30+import Language.PureScript.AST
31+import Language.PureScript.Names
32+import Language.PureScript.Errors
33+import Language.PureScript.Linter.Exhaustive as L
34+
35+-- | Lint the PureScript AST.
36+-- |
37+-- | Right now, this pass only performs a shadowing check.
38+lint :: forall m. (Applicative m, MonadWriter MultipleErrors m) => Module -> m ()
39+lint (Module _ mn ds _) = censor (onErrorMessages (ErrorInModule mn)) $ mapM_ lintDeclaration ds
40+ where
41+ moduleNames :: S.Set Ident
42+ moduleNames = S.fromList (nub (mapMaybe getDeclIdent ds))
43+
44+ getDeclIdent :: Declaration -> Maybe Ident
45+ getDeclIdent (PositionedDeclaration _ _ d) = getDeclIdent d
46+ getDeclIdent (ValueDeclaration ident _ _ _) = Just ident
47+ getDeclIdent (ExternDeclaration ident _) = Just ident
48+ getDeclIdent (ExternInstanceDeclaration ident _ _ _) = Just ident
49+ getDeclIdent (TypeInstanceDeclaration ident _ _ _ _) = Just ident
50+ getDeclIdent (BindingGroupDeclaration _) = error "lint: binding groups should not be desugared yet."
51+ getDeclIdent _ = Nothing
52+
53+ lintDeclaration :: Declaration -> m ()
54+ lintDeclaration d =
55+ let (f, _, _, _, _) = everythingWithContextOnValues moduleNames mempty mappend stepD stepE stepB def def
56+
57+ f' :: Declaration -> MultipleErrors
58+ f' (PositionedDeclaration pos _ dec) = onErrorMessages (PositionedError pos) (f' dec)
59+ f' dec = f dec
60+
61+ in tell (f' d)
62+ where
63+ def s _ = (s, mempty)
64+
65+ stepD :: S.Set Ident -> Declaration -> (S.Set Ident, MultipleErrors)
66+ stepD s (TypeClassDeclaration name _ _ decls) = (s, foldr go mempty decls)
67+ where
68+ go :: Declaration -> MultipleErrors -> MultipleErrors
69+ go (PositionedDeclaration _ _ d') errs = go d' errs
70+ go (TypeDeclaration op@(Op _) _) errs = errorMessage (ClassOperator name op) <> errs
71+ go _ errs = errs
72+ stepD s _ = (s, mempty)
73+
74+ stepE :: S.Set Ident -> Expr -> (S.Set Ident, MultipleErrors)
75+ stepE s (Abs (Left name) _) = bind s name
76+ stepE s (Let ds' _) =
77+ case mapAccumL bind s (nub (mapMaybe getDeclIdent ds')) of
78+ (s', es) -> (s', mconcat es)
79+ stepE s _ = (s, mempty)
80+
81+ stepB :: S.Set Ident -> Binder -> (S.Set Ident, MultipleErrors)
82+ stepB s (VarBinder name) = bind s name
83+ stepB s (NamedBinder name _) = bind s name
84+ stepB s _ = (s, mempty)
85+
86+ bind :: S.Set Ident -> Ident -> (S.Set Ident, MultipleErrors)
87+ bind s name | name `S.member` s = (s, errorMessage (ShadowedName name))
88+ | otherwise = (S.insert name s, mempty)
src/Language/PureScript/Linter/Exhaustive.hsnew file+285
@@ -0,0 +1,285 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.Exhaustive
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+-- | 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+
22+module Language.PureScript.Linter.Exhaustive
23+ ( checkExhaustive
24+ , checkExhaustiveModule
25+ ) where
26+
27+import qualified Data.Map as M
28+import Data.Maybe (fromMaybe)
29+import Data.List (foldl', sortBy, nub)
30+import Data.Function (on)
31+
32+import Control.Monad (unless)
33+import Control.Applicative
34+import Control.Arrow (first, second)
35+import Control.Monad.Writer.Class
36+
37+import Language.PureScript.AST.Binders
38+import Language.PureScript.AST.Declarations
39+import Language.PureScript.Environment
40+import Language.PureScript.Names as P
41+import Language.PureScript.Kinds
42+import Language.PureScript.Types as P
43+import Language.PureScript.Errors
44+
45+import Language.PureScript.AST.Traversals (everywhereOnValuesTopDownM)
46+
47+-- |
48+-- Qualifies a propername from a given qualified propername and a default module name
49+--
50+qualifyName :: a -> ModuleName -> Qualified a -> Qualified a
51+qualifyName n defmn qn = Qualified (Just mn) n
52+ where
53+ (mn, _) = qualify defmn qn
54+
55+-- |
56+-- Given an environment and a datatype or newtype name,
57+-- this function returns the associated data constructors if it is the case of a datatype
58+-- where: - ProperName is the name of the constructor (for example, "Nothing" in Maybe)
59+-- - [Type] is the list of arguments, if it has (for example, "Just" has [TypeVar "a"])
60+--
61+getConstructors :: Environment -> ModuleName -> (Qualified ProperName) -> [(ProperName, [Type])]
62+getConstructors env defmn n = extractConstructors lnte
63+ where
64+ qpn :: Qualified ProperName
65+ qpn = getConsDataName n
66+
67+ getConsDataName :: (Qualified ProperName) -> (Qualified ProperName)
68+ getConsDataName con = qualifyName nm defmn con
69+ where
70+ nm = case getConsInfo con of
71+ Nothing -> error $ "ProperName " ++ show con ++ " not in the scope of the current environment in getConsDataName."
72+ Just (_, pm, _, _) -> pm
73+
74+ getConsInfo :: (Qualified ProperName) -> Maybe (DataDeclType, ProperName, Type, [Ident])
75+ getConsInfo con = M.lookup con dce
76+ where
77+ dce :: M.Map (Qualified ProperName) (DataDeclType, ProperName, Type, [Ident])
78+ dce = dataConstructors env
79+
80+ lnte :: Maybe (Kind, TypeKind)
81+ lnte = M.lookup qpn (types env)
82+
83+ extractConstructors :: Maybe (Kind, TypeKind) -> [(ProperName, [Type])]
84+ extractConstructors (Just (_, DataType _ pt)) = pt
85+ extractConstructors _ = error "Data name not in the scope of the current environment in extractConstructors"
86+
87+-- |
88+-- Replicates a wildcard binder
89+--
90+initialize :: Int -> [Binder]
91+initialize l = replicate l NullBinder
92+
93+-- |
94+-- Applies a function over two lists of tuples that may lack elements
95+--
96+genericMerge :: Ord a =>
97+ (a -> Maybe b -> Maybe c -> d) ->
98+ [(a, b)] ->
99+ [(a, c)] ->
100+ [d]
101+genericMerge _ [] [] = []
102+genericMerge f bs [] = map (\(s, b) -> f s (Just b) Nothing) bs
103+genericMerge f [] bs = map (\(s, b) -> f s Nothing (Just b)) bs
104+genericMerge f bsl@((s, b):bs) bsr@((s', b'):bs')
105+ | s < s' = (f s (Just b) Nothing) : genericMerge f bs bsr
106+ | s > s' = (f s' Nothing (Just b')) : genericMerge f bsl bs'
107+ | otherwise = (f s (Just b) (Just b')) : genericMerge f bs bs'
108+
109+-- |
110+-- Find the uncovered set between two binders:
111+-- the first binder is the case we are trying to cover, the second one is the matching binder
112+--
113+missingCasesSingle :: Environment -> ModuleName -> Binder -> Binder -> ([Binder], Maybe Bool)
114+missingCasesSingle _ _ _ NullBinder = ([], Just True)
115+missingCasesSingle _ _ _ (VarBinder _) = ([], Just True)
116+missingCasesSingle env mn (VarBinder _) b = missingCasesSingle env mn NullBinder b
117+missingCasesSingle env mn br (NamedBinder _ bl) = missingCasesSingle env mn br bl
118+missingCasesSingle env mn NullBinder cb@(ConstructorBinder con _) =
119+ (concatMap (\cp -> fst $ missingCasesSingle env mn cp cb) allPatterns, Just True)
120+ where
121+ allPatterns = map (\(p, t) -> ConstructorBinder (qualifyName p mn con) (initialize $ length t))
122+ $ getConstructors env mn con
123+missingCasesSingle env mn cb@(ConstructorBinder con bs) (ConstructorBinder con' bs')
124+ | con == con' = let (bs'', pr) = missingCasesMultiple env mn bs bs' in (map (ConstructorBinder con) bs'', pr)
125+ | otherwise = ([cb], Just False)
126+missingCasesSingle env mn NullBinder (ObjectBinder bs) =
127+ (map (ObjectBinder . zip (map fst bs)) allMisses, pr)
128+ where
129+ (allMisses, pr) = missingCasesMultiple env mn (initialize $ length bs) (map snd bs)
130+missingCasesSingle env mn (ObjectBinder bs) (ObjectBinder bs') =
131+ (map (ObjectBinder . zip sortedNames) allMisses, pr)
132+ where
133+ (allMisses, pr) = uncurry (missingCasesMultiple env mn) (unzip binders)
134+
135+ sortNames = sortBy (compare `on` fst)
136+
137+ (sbs, sbs') = (sortNames bs, sortNames bs')
138+
139+ compB :: a -> Maybe a -> Maybe a -> (a, a)
140+ compB e b b' = (fm b, fm b')
141+ where
142+ fm = fromMaybe e
143+
144+ compBS :: Eq a => b -> a -> Maybe b -> Maybe b -> (a, (b, b))
145+ compBS e s b b' = (s, compB e b b')
146+
147+ (sortedNames, binders) = unzip $ genericMerge (compBS NullBinder) sbs sbs'
148+missingCasesSingle _ _ NullBinder (BooleanBinder b) = ([BooleanBinder $ not b], Just True)
149+missingCasesSingle _ _ (BooleanBinder bl) (BooleanBinder br)
150+ | bl == br = ([], Just True)
151+ | otherwise = ([BooleanBinder bl], Just False)
152+missingCasesSingle env mn b (PositionedBinder _ _ cb) = missingCasesSingle env mn b cb
153+missingCasesSingle _ _ b _ = ([b], Nothing)
154+
155+-- |
156+-- Returns the uncovered set of binders
157+-- the first argument is the list of uncovered binders at step i
158+-- the second argument is the (i+1)th clause of a pattern matching definition
159+--
160+-- The idea of the algorithm is as follows:
161+-- it processes each binder of the two lists (say, `x` and `y`) one by one
162+-- at each step two cases arises:
163+-- - there are no missing cases between `x` and `y`: this is very straightforward, it continues with the remaining cases
164+-- but keeps the uncovered binder in its position.
165+-- - there are missing cases, let us call it the set `U`: on the one hand, we mix each new uncovered case in `U`
166+-- with the current tail of uncovered set. On the other hand, it continues with the remaining cases: here we
167+-- can use `x` (but it will generate overlapping cases), or `y`, which will generate non-overlapping cases.
168+--
169+-- As an example, consider:
170+--
171+-- data N = Z | S N
172+-- f Z Z = Z --> {[S _, _], [Z, S _]} which are the right non-overlapping cases (GHC uses this).
173+--
174+-- if we use `x` instead of `y` (in this case, `y` stands for `Z` and `x` for `_`) we obtain:
175+-- f Z Z = Z --> {[S _, _], [_, S _]} you can see that both cases overlaps each other.
176+--
177+-- Up to now, we've decided to use `x` just because we expect to generate uncovered cases which might be
178+-- redundant or not, but uncovered at least. If we use `y` instead, we'll need to have a redundancy checker
179+-- (which ought to be available soon), or increase the complexity of the algorithm.
180+--
181+missingCasesMultiple :: Environment -> ModuleName -> [Binder] -> [Binder] -> ([[Binder]], Maybe Bool)
182+missingCasesMultiple env mn = go
183+ where
184+ go [] [] = ([], pure True)
185+ go (x:xs) (y:ys) = (map (: xs) miss1 ++ map (x :) miss2, liftA2 (&&) pr1 pr2)
186+ where
187+ (miss1, pr1) = missingCasesSingle env mn x y
188+ (miss2, pr2) = go xs ys
189+ go _ _ = error "Argument lengths did not match in missingCasesMultiple."
190+
191+-- |
192+-- Guard handling
193+--
194+-- We say a guard is exhaustive iff it has an `otherwise` (or `true`) expression.
195+-- Example:
196+-- f x | x < 0 = 0
197+-- | otherwise = 1
198+-- is exhaustive, whereas `f x | x < 0` is not
199+--
200+-- The function below say whether or not a guard has an `otherwise` expression
201+-- It is considered that `otherwise` is defined in Prelude
202+--
203+isExhaustiveGuard :: Either [(Guard, Expr)] Expr -> Bool
204+isExhaustiveGuard (Left gs) = not . null $ filter (\(g, _) -> isOtherwise g) gs
205+ where
206+ isOtherwise :: Expr -> Bool
207+ isOtherwise (TypedValue _ (BooleanLiteral True) _) = True
208+ isOtherwise (TypedValue _ (Var (Qualified (Just (ModuleName [ProperName "Prelude"])) (Ident "otherwise"))) _) = True
209+ isOtherwise _ = False
210+isExhaustiveGuard (Right _) = True
211+
212+-- |
213+-- Returns the uncovered set of case alternatives
214+--
215+missingCases :: Environment -> ModuleName -> [Binder] -> CaseAlternative -> ([[Binder]], Maybe Bool)
216+missingCases env mn uncovered ca = missingCasesMultiple env mn uncovered (caseAlternativeBinders ca)
217+
218+missingAlternative :: Environment -> ModuleName -> CaseAlternative -> [Binder] -> ([[Binder]], Maybe Bool)
219+missingAlternative env mn ca uncovered
220+ | isExhaustiveGuard (caseAlternativeResult ca) = mcases
221+ | otherwise = ([uncovered], snd mcases)
222+ where
223+ mcases = missingCases env mn uncovered ca
224+
225+-- |
226+-- Main exhaustivity checking function
227+-- Starting with the set `uncovered = { _ }` (nothing covered, one `_` for each function argument),
228+-- it partitions that set with the new uncovered cases, until it consumes the whole set of clauses.
229+-- Then, returns the uncovered set of case alternatives.
230+--
231+checkExhaustive :: forall m. (MonadWriter MultipleErrors m) => Environment -> ModuleName -> [CaseAlternative] -> m ()
232+checkExhaustive env mn cas = makeResult . first nub $ foldl' step ([initial], (pure True, [])) cas
233+ where
234+ step :: ([[Binder]], (Maybe Bool, [[Binder]])) -> CaseAlternative -> ([[Binder]], (Maybe Bool, [[Binder]]))
235+ step (uncovered, (nec, redundant)) ca =
236+ let (missed, pr) = unzip (map (missingAlternative env mn ca) uncovered)
237+ cond = or <$> sequenceA pr
238+ in (concat missed, (liftA2 (&&) cond nec,
239+ if fromMaybe True cond then redundant else caseAlternativeBinders ca : redundant))
240+ where
241+ sequenceA = foldr (liftA2 (:)) (pure [])
242+
243+ initial :: [Binder]
244+ initial = initialize numArgs
245+ where
246+ numArgs = length . caseAlternativeBinders . head $ cas
247+
248+ makeResult :: ([[Binder]], (Maybe Bool, [[Binder]])) -> m ()
249+ makeResult (bss, (_, bss')) =
250+ do unless (null bss) tellExhaustive
251+ unless (null bss') tellRedundant
252+ where
253+ tellExhaustive = tell . errorMessage . uncurry NotExhaustivePattern . second null . splitAt 5 $ bss
254+ tellRedundant = tell . errorMessage . uncurry OverlappingPattern . second null . splitAt 5 $ bss'
255+
256+-- |
257+-- Exhaustivity checking over a list of declarations
258+--
259+checkExhaustiveDecls :: forall m. (Applicative m, MonadWriter MultipleErrors m) => Environment -> ModuleName -> [Declaration] -> m ()
260+checkExhaustiveDecls env mn ds =
261+ let (f, _, _) = everywhereOnValuesTopDownM return checkExpr return
262+
263+ f' :: Declaration -> m Declaration
264+ f' d@(BindingGroupDeclaration bs) = mapM_ (f' . convert) bs >> return d
265+ where
266+ convert :: (Ident, NameKind, Expr) -> Declaration
267+ convert (name, nk, e) = ValueDeclaration name nk [] (Right e)
268+ f' d@(ValueDeclaration name _ _ _) = censor (onErrorMessages (ErrorInValueDeclaration name)) $ f d
269+ f' (PositionedDeclaration pos com dec) = PositionedDeclaration pos com <$> censor (onErrorMessages (PositionedError pos)) (f' dec)
270+ -- Don't generate two warnings for desugared dictionaries.
271+ f' d@TypeInstanceDeclaration{} = return d
272+ f' d = f d
273+
274+ in mapM_ f' ds
275+ where
276+ checkExpr :: Expr -> m Expr
277+ checkExpr c@(Case _ cas) = checkExhaustive env mn cas >> return c
278+ checkExpr other = return other
279+
280+-- |
281+-- Exhaustivity checking over a single module
282+--
283+checkExhaustiveModule :: forall m. (Applicative m, MonadWriter MultipleErrors m) => Environment -> Module -> m ()
284+checkExhaustiveModule env (Module _ mn ds _) = censor (onErrorMessages (ErrorInModule mn)) $ checkExhaustiveDecls env mn ds
285+
src/Language/PureScript/Make.hsnew file+311
@@ -0,0 +1,311 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Make
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 DataKinds #-}
16+{-# LANGUAGE FlexibleContexts #-}
17+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
18+{-# LANGUAGE TupleSections #-}
19+{-# LANGUAGE RankNTypes #-}
20+{-# LANGUAGE RecordWildCards #-}
21+{-# LANGUAGE ScopedTypeVariables #-}
22+
23+module Language.PureScript.Make
24+ (
25+ -- * Make API
26+ RebuildPolicy(..)
27+ , MakeActions(..)
28+ , SupplyVar()
29+ , Externs()
30+ , make
31+
32+ -- * Implementation of Make API using files on disk
33+ , Make(..)
34+ , runMake
35+ , buildMakeActions
36+ ) where
37+
38+import Control.Applicative
39+import Control.Arrow ((&&&))
40+import Control.Monad
41+import Control.Monad.Error.Class (MonadError(..))
42+import Control.Monad.Trans.Except
43+import Control.Monad.Reader
44+import Control.Monad.Writer
45+import Control.Monad.Supply
46+import Control.Monad.Supply.Class (fresh)
47+
48+import Data.Function (on)
49+import Data.List (sortBy, groupBy)
50+import Data.Maybe (fromMaybe)
51+import Data.Time.Clock
52+import Data.Traversable (traverse)
53+import Data.Version (showVersion)
54+import qualified Data.Map as M
55+import qualified Data.Set as S
56+
57+import System.Directory
58+ (doesFileExist, getModificationTime, createDirectoryIfMissing)
59+import System.FilePath ((</>), takeDirectory)
60+import System.IO.Error (tryIOError)
61+
62+
63+import Language.PureScript.AST
64+import Language.PureScript.CodeGen.Externs (moduleToPs)
65+import Language.PureScript.Environment
66+import Language.PureScript.Errors
67+import Language.PureScript.Linter
68+import Language.PureScript.ModuleDependencies
69+import Language.PureScript.Names
70+import Language.PureScript.Options
71+import Language.PureScript.Parser
72+import Language.PureScript.Pretty
73+import Language.PureScript.Renamer
74+import Language.PureScript.Sugar
75+import Language.PureScript.TypeChecker
76+import qualified Language.PureScript.Constants as C
77+
78+import qualified Language.PureScript.CodeGen.JS as J
79+import qualified Language.PureScript.CoreFn as CF
80+import qualified Paths_purescript as Paths
81+
82+-- |
83+-- Actions that require implementations when running in "make" mode.
84+--
85+data MakeActions m = MakeActions {
86+ -- |
87+ -- Get the timestamp for the input file(s) for a module. If there are multiple
88+ -- files (.purs and foreign files, for example) the timestamp should be for
89+ -- the most recently modified file.
90+ --
91+ getInputTimestamp :: ModuleName -> m (Either RebuildPolicy (Maybe UTCTime))
92+ -- |
93+ -- Get the timestamp for the output files for a module. This should be the
94+ -- timestamp for the oldest modified file, or Nothing if any of the required
95+ -- output files are missing.
96+ --
97+ , getOutputTimestamp :: ModuleName -> m (Maybe UTCTime)
98+ -- |
99+ -- Read the externs file for a module as a string and also return the actual
100+ -- path for the file.
101+ , readExterns :: ModuleName -> m (FilePath, String)
102+ -- |
103+ -- Run the code generator for the module and write any required output files.
104+ --
105+ , codegen :: CF.Module CF.Ann -> Environment -> SupplyVar -> Externs -> m ()
106+ -- |
107+ -- Respond to a progress update.
108+ --
109+ , progress :: String -> m ()
110+ }
111+
112+-- |
113+-- Generated code for an externs file.
114+--
115+type Externs = String
116+
117+-- |
118+-- A value to be used in the Supply monad.
119+--
120+type SupplyVar = Integer
121+
122+-- |
123+-- Determines when to rebuild a module
124+--
125+data RebuildPolicy
126+ -- | Never rebuild this module
127+ = RebuildNever
128+ -- | Always rebuild this module
129+ | RebuildAlways deriving (Show, Eq, Ord)
130+
131+-- |
132+-- Compiles in "make" mode, compiling each module separately to a js files and an externs file
133+--
134+-- If timestamps have not changed, the externs file can be used to provide the module's types without
135+-- having to typecheck the module again.
136+--
137+make :: forall m. (Functor m, Applicative m, Monad m, MonadReader Options m, MonadError MultipleErrors m, MonadWriter MultipleErrors m)
138+ => MakeActions m
139+ -> [Module]
140+ -> m Environment
141+make MakeActions{..} ms = do
142+ (sorted, graph) <- sortModules $ map importPrim ms
143+ mapM_ lint sorted
144+ toRebuild <- foldM (\s (Module _ moduleName' _ _) -> do
145+ inputTimestamp <- getInputTimestamp moduleName'
146+ outputTimestamp <- getOutputTimestamp moduleName'
147+ return $ case (inputTimestamp, outputTimestamp) of
148+ (Right (Just t1), Just t2) | t1 < t2 -> s
149+ (Left RebuildNever, Just _) -> s
150+ _ -> S.insert moduleName' s) S.empty sorted
151+
152+ marked <- rebuildIfNecessary (reverseDependencies graph) toRebuild sorted
153+ (desugared, nextVar) <- runSupplyT 0 $ zip (map fst marked) <$> desugar (map snd marked)
154+ evalSupplyT nextVar $ go initEnvironment desugared
155+ where
156+
157+ go :: Environment -> [(Bool, Module)] -> SupplyT m Environment
158+ go env [] = return env
159+ go env ((False, m) : ms') = do
160+ (_, env') <- lift . runCheck' env $ typeCheckModule Nothing m
161+ go env' ms'
162+ go env ((True, m@(Module coms moduleName' _ exps)) : ms') = do
163+ lift $ progress $ "Compiling " ++ runModuleName moduleName'
164+ (checked@(Module _ _ elaborated _), env') <- lift . runCheck' env $ typeCheckModule Nothing m
165+ checkExhaustiveModule env' checked
166+ regrouped <- createBindingGroups moduleName' . collapseBindingGroups $ elaborated
167+ let mod' = Module coms moduleName' regrouped exps
168+ corefn = CF.moduleToCoreFn env' mod'
169+ [renamed] = renameInModules [corefn]
170+ exts = moduleToPs mod' env'
171+ nextVar <- fresh
172+ lift $ codegen renamed env' nextVar exts
173+ go env' ms'
174+
175+ rebuildIfNecessary :: M.Map ModuleName [ModuleName] -> S.Set ModuleName -> [Module] -> m [(Bool, Module)]
176+ rebuildIfNecessary _ _ [] = return []
177+ rebuildIfNecessary graph toRebuild (m@(Module _ moduleName' _ _) : ms') | moduleName' `S.member` toRebuild = do
178+ let deps = fromMaybe [] $ moduleName' `M.lookup` graph
179+ toRebuild' = toRebuild `S.union` S.fromList deps
180+ (:) (True, m) <$> rebuildIfNecessary graph toRebuild' ms'
181+ rebuildIfNecessary graph toRebuild (Module _ moduleName' _ _ : ms') = do
182+ (path, externs) <- readExterns moduleName'
183+ externsModules <- fmap (map snd) . alterErrors $ parseModulesFromFiles id [(path, externs)]
184+ case externsModules of
185+ [m'@(Module _ moduleName'' _ _)] | moduleName'' == moduleName' -> (:) (False, m') <$> rebuildIfNecessary graph toRebuild ms'
186+ _ -> throwError . errorMessage . InvalidExternsFile $ path
187+ where
188+ alterErrors = flip catchError $ \(MultipleErrors errs) ->
189+ throwError . MultipleErrors $ flip map errs $ \e -> case e of
190+ SimpleErrorWrapper (ErrorParsingModule err) -> SimpleErrorWrapper (ErrorParsingExterns err)
191+ _ -> e
192+
193+reverseDependencies :: ModuleGraph -> M.Map ModuleName [ModuleName]
194+reverseDependencies g = combine [ (dep, mn) | (mn, deps) <- g, dep <- deps ]
195+ where
196+ combine :: (Ord a) => [(a, b)] -> M.Map a [b]
197+ combine = M.fromList . map ((fst . head) &&& map snd) . groupBy ((==) `on` fst) . sortBy (compare `on` fst)
198+
199+-- |
200+-- Add an import declaration for a module if it does not already explicitly import it.
201+--
202+addDefaultImport :: ModuleName -> Module -> Module
203+addDefaultImport toImport m@(Module coms mn decls exps) =
204+ if isExistingImport `any` decls || mn == toImport then m
205+ else Module coms mn (ImportDeclaration toImport Implicit Nothing : decls) exps
206+ where
207+ isExistingImport (ImportDeclaration mn' _ _) | mn' == toImport = True
208+ isExistingImport (PositionedDeclaration _ _ d) = isExistingImport d
209+ isExistingImport _ = False
210+
211+importPrim :: Module -> Module
212+importPrim = addDefaultImport (ModuleName [ProperName C.prim])
213+
214+-- |
215+-- A monad for running make actions
216+--
217+newtype Make a = Make { unMake :: ReaderT Options (WriterT MultipleErrors (ExceptT MultipleErrors IO)) a }
218+ deriving (Functor, Applicative, Monad, MonadIO, MonadError MultipleErrors, MonadWriter MultipleErrors, MonadReader Options)
219+
220+-- |
221+-- Execute a 'Make' monad, returning either errors, or the result of the compile plus any warnings.
222+--
223+runMake :: Options -> Make a -> IO (Either MultipleErrors (a, MultipleErrors))
224+runMake opts = runExceptT . runWriterT . flip runReaderT opts . unMake
225+
226+makeIO :: (IOError -> ErrorMessage) -> IO a -> Make a
227+makeIO f io = do
228+ e <- liftIO $ tryIOError io
229+ either (throwError . singleError . f) return e
230+
231+-- Traverse (Either e) instance (base 4.7)
232+traverseEither :: Applicative f => (a -> f b) -> Either e a -> f (Either e b)
233+traverseEither _ (Left x) = pure (Left x)
234+traverseEither f (Right y) = Right <$> f y
235+
236+-- |
237+-- A set of make actions that read and write modules from the given directory.
238+--
239+buildMakeActions :: FilePath -- ^ the output directory
240+ -> M.Map ModuleName (Either RebuildPolicy String) -- ^ a map between module names and paths to the file containing the PureScript module
241+ -> M.Map ModuleName (FilePath, ForeignJS) -- ^ a map between module name and the file containing the foreign javascript for the module
242+ -> Bool -- ^ Generate a prefix comment?
243+ -> MakeActions Make
244+buildMakeActions outputDir filePathMap foreigns usePrefix =
245+ MakeActions getInputTimestamp getOutputTimestamp readExterns codegen progress
246+ where
247+
248+ getInputTimestamp :: ModuleName -> Make (Either RebuildPolicy (Maybe UTCTime))
249+ getInputTimestamp mn = do
250+ let path = fromMaybe (error "Module has no filename in 'make'") $ M.lookup mn filePathMap
251+ e1 <- traverseEither getTimestamp path
252+ fPath <- maybe (return Nothing) (getTimestamp . fst) $ M.lookup mn foreigns
253+ return $ fmap (max fPath) e1
254+
255+ getOutputTimestamp :: ModuleName -> Make (Maybe UTCTime)
256+ getOutputTimestamp mn = do
257+ let filePath = runModuleName mn
258+ jsFile = outputDir </> filePath </> "index.js"
259+ externsFile = outputDir </> filePath </> "externs.purs"
260+ min <$> getTimestamp jsFile <*> getTimestamp externsFile
261+
262+ readExterns :: ModuleName -> Make (FilePath, String)
263+ readExterns mn = do
264+ let path = outputDir </> runModuleName mn </> "externs.purs"
265+ (path, ) <$> readTextFile path
266+
267+ codegen :: CF.Module CF.Ann -> Environment -> SupplyVar -> Externs -> Make ()
268+ codegen m _ nextVar exts = do
269+ let mn = CF.moduleName m
270+ foreignInclude <- case mn `M.lookup` foreigns of
271+ Just (path, _)
272+ | not $ requiresForeign m -> do
273+ tell $ errorMessage $ UnnecessaryFFIModule mn path
274+ return Nothing
275+ | otherwise -> return $ Just $ J.JSApp (J.JSVar "require") [J.JSStringLiteral "./foreign"]
276+ Nothing | requiresForeign m -> throwError . errorMessage $ MissingFFIModule mn
277+ | otherwise -> return Nothing
278+ pjs <- evalSupplyT nextVar $ prettyPrintJS <$> J.moduleToJs m foreignInclude
279+ let filePath = runModuleName mn
280+ jsFile = outputDir </> filePath </> "index.js"
281+ externsFile = outputDir </> filePath </> "externs.purs"
282+ foreignFile = outputDir </> filePath </> "foreign.js"
283+ prefix = ["Generated by psc version " ++ showVersion Paths.version | usePrefix]
284+ js = unlines $ map ("// " ++) prefix ++ [pjs]
285+ verboseErrorsEnabled <- asks optionsVerboseErrors
286+ when verboseErrorsEnabled $ progress $ "Writing " ++ jsFile
287+ writeTextFile jsFile js
288+ maybe (return ()) (writeTextFile foreignFile . snd) $ mn `M.lookup` foreigns
289+ writeTextFile externsFile exts
290+
291+ requiresForeign :: CF.Module a -> Bool
292+ requiresForeign = not . null . CF.moduleForeign
293+
294+ getTimestamp :: FilePath -> Make (Maybe UTCTime)
295+ getTimestamp path = makeIO (const (SimpleErrorWrapper $ CannotGetFileInfo path)) $ do
296+ exists <- doesFileExist path
297+ traverse (const $ getModificationTime path) $ guard exists
298+
299+ readTextFile :: FilePath -> Make String
300+ readTextFile path = makeIO (const (SimpleErrorWrapper $ CannotReadFile path)) $ readFile path
301+
302+ writeTextFile :: FilePath -> String -> Make ()
303+ writeTextFile path text = makeIO (const (SimpleErrorWrapper $ CannotWriteFile path)) $ do
304+ mkdirp path
305+ writeFile path text
306+ where
307+ mkdirp :: FilePath -> IO ()
308+ mkdirp = createDirectoryIfMissing True . takeDirectory
309+
310+ progress :: String -> Make ()
311+ progress = liftIO . putStrLn
src/Language/PureScript/ModuleDependencies.hsnew file+77
@@ -0,0 +1,77 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.ModuleDependencies
4+-- Copyright : (c) Phil Freeman 2013
5+-- License : MIT
6+--
7+-- Maintainer : Phil Freeman <paf31@cantab.net>
8+-- Stability : experimental
9+-- Portability :
10+--
11+-- | Provides the ability to sort modules based on module dependencies
12+--
13+-----------------------------------------------------------------------------
14+
15+{-# LANGUAGE FlexibleContexts #-}
16+
17+module Language.PureScript.ModuleDependencies (
18+ sortModules,
19+ ModuleGraph
20+) where
21+
22+import Control.Monad.Error.Class (MonadError(..))
23+
24+import Data.Graph
25+import Data.List (nub)
26+import Data.Maybe (mapMaybe)
27+
28+import Language.PureScript.AST
29+import Language.PureScript.Names
30+import Language.PureScript.Types
31+import Language.PureScript.Errors
32+
33+-- |
34+-- A list of modules with their dependencies
35+--
36+type ModuleGraph = [(ModuleName, [ModuleName])]
37+
38+-- |
39+-- Sort a collection of modules based on module dependencies.
40+--
41+-- Reports an error if the module graph contains a cycle.
42+--
43+sortModules :: (MonadError MultipleErrors m) => [Module] -> m ([Module], ModuleGraph)
44+sortModules ms = do
45+ let verts = map (\m@(Module _ _ ds _) -> (m, getModuleName m, nub (concatMap usedModules ds))) ms
46+ ms' <- mapM toModule $ stronglyConnComp verts
47+ let moduleGraph = map (\(_, mn, deps) -> (mn, deps)) verts
48+ return (ms', moduleGraph)
49+
50+-- |
51+-- Calculate a list of used modules based on explicit imports and qualified names
52+--
53+usedModules :: Declaration -> [ModuleName]
54+usedModules = let (f, _, _, _, _) = everythingOnValues (++) forDecls forValues (const []) (const []) (const []) in nub . f
55+ where
56+ forDecls :: Declaration -> [ModuleName]
57+ forDecls (ImportDeclaration mn _ _) = [mn]
58+ forDecls _ = []
59+
60+ forValues :: Expr -> [ModuleName]
61+ forValues (Var (Qualified (Just mn) _)) = [mn]
62+ forValues (Constructor (Qualified (Just mn) _)) = [mn]
63+ forValues (TypedValue _ _ ty) = forTypes ty
64+ forValues _ = []
65+
66+ forTypes :: Type -> [ModuleName]
67+ forTypes (TypeConstructor (Qualified (Just mn) _)) = [mn]
68+ forTypes (ConstrainedType cs _) = mapMaybe (\(Qualified mn _, _) -> mn) cs
69+ forTypes _ = []
70+
71+-- |
72+-- Convert a strongly connected component of the module graph to a module
73+--
74+toModule :: (MonadError MultipleErrors m) => SCC Module -> m Module
75+toModule (AcyclicSCC m) = return m
76+toModule (CyclicSCC [m]) = return m
77+toModule (CyclicSCC ms) = throwError . errorMessage $ CycleInModules (map getModuleName ms)
src/Language/PureScript/Names.hsnew file+102
@@ -0,0 +1,102 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.Names
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 names
13+--
14+-----------------------------------------------------------------------------
15+
16+{-# LANGUAGE DeriveDataTypeable, DeriveFunctor, GADTs #-}
17+
18+module Language.PureScript.Names where
19+
20+import Data.List
21+import Data.Data
22+import Data.List.Split (splitOn)
23+import qualified Data.Aeson as A
24+import qualified Data.Text as T
25+
26+-- |
27+-- Names for value identifiers
28+--
29+data Ident
30+ -- |
31+ -- An alphanumeric identifier
32+ --
33+ = Ident String
34+ -- |
35+ -- A symbolic name for an infix operator
36+ --
37+ | Op String deriving (Eq, Ord, Data, Typeable)
38+
39+runIdent :: Ident -> String
40+runIdent (Ident i) = i
41+runIdent (Op op) = op
42+
43+instance Show Ident where
44+ show (Ident s) = s
45+ show (Op op) = '(':op ++ ")"
46+
47+-- |
48+-- Proper names, i.e. capitalized names for e.g. module names, type//data constructors.
49+--
50+newtype ProperName = ProperName { runProperName :: String } deriving (Eq, Ord, Data, Typeable)
51+
52+instance Show ProperName where
53+ show = runProperName
54+
55+-- |
56+-- Module names
57+--
58+data ModuleName = ModuleName [ProperName] deriving (Eq, Ord, Data, Typeable)
59+
60+runModuleName :: ModuleName -> String
61+runModuleName (ModuleName pns) = intercalate "." (runProperName `map` pns)
62+
63+moduleNameFromString :: String -> ModuleName
64+moduleNameFromString = ModuleName . splitProperNames
65+ where
66+ splitProperNames s = case dropWhile (== '.') s of
67+ "" -> []
68+ s' -> ProperName w : splitProperNames s''
69+ where (w, s'') = break (== '.') s'
70+
71+instance Show ModuleName where
72+ show = runModuleName
73+
74+-- |
75+-- A qualified name, i.e. a name with an optional module name
76+--
77+data Qualified a = Qualified (Maybe ModuleName) a deriving (Eq, Ord, Data, Typeable, Functor)
78+
79+instance (Show a) => Show (Qualified a) where
80+ show (Qualified Nothing a) = show a
81+ show (Qualified (Just name) a) = show name ++ "." ++ show a
82+
83+instance (a ~ ProperName) => A.ToJSON (Qualified a) where
84+ toJSON = A.toJSON . show
85+
86+instance (a ~ ProperName) => A.FromJSON (Qualified a) where
87+ parseJSON =
88+ A.withText "Qualified ProperName" $ \str ->
89+ return $ case reverse (splitOn "." (T.unpack str)) of
90+ [name] -> Qualified Nothing (ProperName name)
91+ (name:rest) -> Qualified (Just (reconstructModuleName rest)) (ProperName name)
92+ _ -> Qualified Nothing (ProperName "")
93+ where
94+ reconstructModuleName = moduleNameFromString . intercalate "." . reverse
95+
96+
97+-- |
98+-- Provide a default module name, if a name is unqualified
99+--
100+qualify :: ModuleName -> Qualified a -> (ModuleName, a)
101+qualify m (Qualified Nothing a) = (m, a)
102+qualify _ (Qualified (Just m) a) = (m, a)
src/Language/PureScript/Options.hsnew file+49
@@ -0,0 +1,49 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.Options
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+-- The data type of compiler options
13+--
14+-----------------------------------------------------------------------------
15+
16+module Language.PureScript.Options where
17+
18+-- |
19+-- The data type of compiler options
20+--
21+data Options = Options {
22+ -- |
23+ -- Disable tail-call elimination
24+ optionsNoTco :: Bool
25+ -- |
26+ -- Disable inlining of calls to return and bind for the Eff monad
27+ , optionsNoMagicDo :: Bool
28+ -- |
29+ -- When specified, checks the type of `main` in the module, and generate a call to run main
30+ -- after the module definitions.
31+ , optionsMain :: Maybe String
32+ -- |
33+ -- Skip all optimizations
34+ , optionsNoOptimizations :: Bool
35+ -- |
36+ -- Verbose error message
37+ , optionsVerboseErrors :: Bool
38+ -- |
39+ -- Remove the comments from the generated js
40+ , optionsNoComments :: Bool
41+ -- |
42+ -- The path to prepend to require statements
43+ , optionsRequirePath :: Maybe FilePath
44+ } deriving Show
45+
46+-- |
47+-- Default make options
48+defaultOptions :: Options
49+defaultOptions = Options False False Nothing False False False Nothing
src/Language/PureScript/Parser.hsnew file+36
@@ -0,0 +1,36 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.Parser
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 parsers for core data types:
13+--
14+-- [@Language.PureScript.Parser.Kinds@] Parser for kinds
15+--
16+-- [@Language.PureScript.Parser.Values@] Parser for values
17+--
18+-- [@Language.PureScript.Parser.Types@] Parser for types
19+--
20+-- [@Language.PureScript.Parser.Declaration@] Parsers for declarations and modules
21+--
22+-- [@Language.PureScript.Parser.State@] Parser state, including indentation
23+--
24+-- [@Language.PureScript.Parser.Common@] Common parsing utility functions
25+--
26+-----------------------------------------------------------------------------
27+
28+module Language.PureScript.Parser (module P) where
29+
30+import Language.PureScript.Parser.Common as P
31+import Language.PureScript.Parser.Types as P
32+import Language.PureScript.Parser.State as P
33+import Language.PureScript.Parser.Kinds as P
34+import Language.PureScript.Parser.Lexer as P
35+import Language.PureScript.Parser.Declarations as P
36+import Language.PureScript.Parser.JS as P
src/Language/PureScript/Parser/Common.hsnew file+139
@@ -0,0 +1,139 @@
1+-----------------------------------------------------------------------------
2+--
3+-- Module : Language.PureScript.Parser.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+-- Constants, and utility functions to be used when parsing
13+--
14+-----------------------------------------------------------------------------
15+
16+{-# LANGUAGE FlexibleContexts #-}
17+
18+module Language.PureScript.Parser.Common where
19+
20+import Control.Applicative
21+import Control.Monad (guard)
22+
23+import Language.PureScript.Comments
24+import Language.PureScript.Parser.Lexer
25+import Language.PureScript.Parser.State
26+import Language.PureScript.Names
27+
28+import qualified Text.Parsec as P
29+
30+featureWasRemoved :: String -> TokenParser a
31+featureWasRemoved err = do
32+ pos <- P.getPosition
33+ error $ "It looks like you are trying to use a feature from a previous version of the compiler:\n" ++ err ++ "\nat " ++ show pos
34+
35+properName :: TokenParser ProperName
36+properName = ProperName <$> uname
37+
38+-- |
39+-- Parse a module name
40+--
41+moduleName :: TokenParser ModuleName
42+moduleName = part []
43+ where
44+ part path = (do name <- ProperName <$> P.try qualifier
45+ part (path `snoc` name))
46+ <|> (ModuleName . snoc path . ProperName <$> mname)
47+ snoc path name = path ++ [name]
48+
49+-- |
50+-- Parse a qualified name, i.e. M.name or just name
51+--
52+parseQualified :: TokenParser a -> TokenParser (Qualified a)
53+parseQualified parser = part []
54+ where
55+ part path = (do name <- ProperName <$> P.try qualifier
56+ part (updatePath path name))
57+ <|> (Qualified (qual path) <$> P.try parser)
58+ updatePath path name = path ++ [name]
59+ qual path = if null path then Nothing else Just $ ModuleName path
60+
61+-- |
62+-- Parse an identifier or parenthesized operator
63+--
64+parseIdent :: TokenParser Ident
65+parseIdent = (Ident <$> identifier) <|> (Op <$> parens symbol)
66+
67+-- |
68+-- Run the first parser, then match the second if possible, applying the specified function on a successful match
69+--
70+augment :: P.Stream s m t => P.ParsecT s u m a -> P.ParsecT s u m b -> (a -> b -> a) -> P.ParsecT s u m a
71+augment p q f = flip (maybe id $ flip f) <$> p <*> P.optionMaybe q
72+
73+-- |
74+-- Run the first parser, then match the second zero or more times, applying the specified function for each match
75+--
76+fold :: P.Stream s m t => P.ParsecT s u m a -> P.ParsecT s u m b -> (a -> b -> a) -> P.ParsecT s u m a
77+fold first more combine = do
78+ a <- first
79+ bs <- P.many more
80+ return $ foldl combine a bs
81+
82+-- |
83+-- Build a parser from a smaller parser and a list of parsers for postfix operators
84+--
85+buildPostfixParser :: P.Stream s m t => [a -> P.ParsecT s u m a] -> P.ParsecT s u m a -> P.ParsecT s u m a
86+buildPostfixParser fs first = do
87+ a <- first
88+ go a
89+ where
90+ go a = do
91+ maybeA <- P.optionMaybe $ P.choice (map ($ a) fs)
92+ case maybeA of
93+ Nothing -> return a
94+ Just a' -> go a'
95+
96+-- |
97+-- Mark the current indentation level
98+--
99+mark :: P.Parsec s ParseState a -> P.Parsec s ParseState a
100+mark p = do
101+ current <- indentationLevel <$> P.getState
102+ pos <- P.sourceColumn <$> P.getPosition
103+ P.modifyState $ \st -> st { indentationLevel = pos }
104+ a <- p
105+ P.modifyState $ \st -> st { indentationLevel = current }
106+ return a
107+
108+-- |
109+-- Check that the current identation level matches a predicate
110+--
111+checkIndentation :: (P.Column -> P.Column -> Bool) -> P.Parsec s ParseState ()
112+checkIndentation rel = do
113+ col <- P.sourceColumn <$> P.getPosition
114+ current <- indentationLevel <$> P.getState
115+ guard (col `rel` current)
116+
117+-- |
118+-- Check that the current indentation level is past the current mark
119+--
120+indented :: P.Parsec s ParseState ()
121+indented = checkIndentation (>) P.<?> "indentation"
122+
123+-- |
124+-- Check that the current indentation level is at the same indentation as the current mark
125+--
126+same :: P.Parsec s ParseState ()
127+same = checkIndentation (==) P.<?> "no indentation"
128+
129+-- |
130+-- Read the comments from the the next token, without consuming it
131+--
132+readComments :: P.Parsec [PositionedToken] u [Comment]
133+readComments = P.lookAhead $ ptComments <$> P.anyToken
134+
135+-- |
136+-- Run a parser
137+--
138+runTokenParser :: FilePath -> TokenParser a -> [PositionedToken] -> Either P.ParseError a
139+runTokenParser filePath p = P.runParser p (ParseState 0) filePath
src/Language/PureScript/Parser/Declarations.hsnew file+551

This diff is too big to show here.

src/Language/PureScript/Parser/JS.hsnew file+59

This diff is too big to show here.

src/Language/PureScript/Parser/Kinds.hsnew file+45

This diff is too big to show here.

src/Language/PureScript/Parser/Lexer.hsnew file+519

This diff is too big to show here.

src/Language/PureScript/Parser/State.hsnew file+30

This diff is too big to show here.

src/Language/PureScript/Parser/Types.hsnew file+137

This diff is too big to show here.

src/Language/PureScript/Pretty.hsnew file+32

This diff is too big to show here.

src/Language/PureScript/Pretty/Common.hsnew file+69

This diff is too big to show here.

src/Language/PureScript/Pretty/JS.hsnew file+301

This diff is too big to show here.

src/Language/PureScript/Pretty/Kinds.hsnew file+59

This diff is too big to show here.

src/Language/PureScript/Pretty/Types.hsnew file+127

This diff is too big to show here.

src/Language/PureScript/Pretty/Values.hsnew file+218

This diff is too big to show here.

src/Language/PureScript/Publish.hsnew file+361

This diff is too big to show here.

src/Language/PureScript/Publish/BoxesHelpers.hsnew file+38

This diff is too big to show here.

src/Language/PureScript/Publish/ErrorsWarnings.hsnew file+385

This diff is too big to show here.

src/Language/PureScript/Publish/Utils.hsnew file+38

This diff is too big to show here.

src/Language/PureScript/Renamer.hsnew file+196

This diff is too big to show here.

src/Language/PureScript/Sugar.hsnew file+71

This diff is too big to show here.

src/Language/PureScript/Sugar/BindingGroups.hsnew file+206

This diff is too big to show here.

src/Language/PureScript/Sugar/CaseDeclarations.hsnew file+180

This diff is too big to show here.

src/Language/PureScript/Sugar/DoNotation.hsnew file+74

This diff is too big to show here.

src/Language/PureScript/Sugar/Names.hsnew file+609

This diff is too big to show here.

src/Language/PureScript/Sugar/ObjectWildcards.hsnew file+65

This diff is too big to show here.

src/Language/PureScript/Sugar/Operators.hsnew file+166

This diff is too big to show here.

src/Language/PureScript/Sugar/TypeClasses.hsnew file+297

This diff is too big to show here.

src/Language/PureScript/Sugar/TypeDeclarations.hsnew file+69

This diff is too big to show here.

src/Language/PureScript/Traversals.hsnew file+41

This diff is too big to show here.

src/Language/PureScript/TypeChecker.hsnew file+334

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Entailment.hsnew file+207

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Kinds.hsnew file+218

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Monad.hsnew file+272

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Rows.hsnew file+67

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Skolems.hsnew file+114

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Subsumption.hsnew file+96

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Synonyms.hsnew file+105

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Types.hsnew file+678

This diff is too big to show here.

src/Language/PureScript/TypeChecker/Unify.hsnew file+206

This diff is too big to show here.

src/Language/PureScript/TypeClassDictionaries.hsnew file+96

This diff is too big to show here.

src/Language/PureScript/Types.hsnew file+311

This diff is too big to show here.

src/Tests.hsdeleted−141

This diff is too big to show here.

stack.nixdeleted−23

This diff is too big to show here.

stack.yaml+7−22

This diff is too big to show here.

support/ffi-loader.godeleted−30

This diff is too big to show here.

support/go.mod.ffi-loaderdeleted−2

This diff is too big to show here.

support/go.mod.outputdeleted−2

This diff is too big to show here.

support/go.mod.workingdeleted−1

This diff is too big to show here.

test/Spec.hsdeleted−2

This diff is too big to show here.

tests/Main.hsnew file+261

This diff is too big to show here.

tests/support/.gitignorenew file+2

This diff is too big to show here.

tests/support/bower.jsonnew file+11

This diff is too big to show here.

tests/support/package.jsonnew file+7

This diff is too big to show here.

tests/support/setup.jsnew file+22

This diff is too big to show here.

travis/after.shnew file+25

This diff is too big to show here.

travis/configure.shnew file+17

This diff is too big to show here.

travis/test-install.shnew file+12

This diff is too big to show here.