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

Binary file not shown.

make_release_notesdeleted−2
@@ -1,2 +0,0 @@
1−curl https://api.github.com/repos/purescript/purescript/pulls?state=closed\&per_page=100 \
2− | jq -r '.[] | ("- " + .title + " (@" + .user.login + ")")'
package.yamlnew file+86
@@ -0,0 +1,86 @@
1+name: psgo
2+version: 0.1.0.0
3+github: "andyarvanitis/purescript-native"
4+license: BSD3
5+author: "Andy Arvanitis"
6+maintainer: "example@example.com"
7+copyright: "2018 Andy Arvanitis"
8+
9+extra-source-files:
10+- README.md
11+- ChangeLog.md
12+- stack.yaml
13+- support/*
14+
15+# Metadata used when publishing your package
16+# synopsis: Short description of your package
17+# category: Web
18+
19+# To avoid duplicated efforts in documentation and dealing with the
20+# complications of embedding Haddock markup inside cabal files, it is
21+# common to point users to the README.md file.
22+description: Please see the README on Github at <https://github.com/andyarvanitis/purescript-native#readme>
23+
24+dependencies:
25+- base >= 4.7 && < 5
26+- bytestring >= 0.10.8.2 && < 0.11
27+- purescript
28+- base-compat >=0.6.0
29+- protolude >=0.1.6
30+- text
31+- containers
32+- filepath
33+- monad-parallel >= 0.7.2.2 && <0.8
34+- pattern-arrows >=0.0.2 && <0.1
35+- safe >=0.3.9 && <0.4
36+- transformers >=0.3.0 && <0.6
37+- mtl >=2.1.0 && <2.3.0
38+- aeson >=1.0 && <1.5
39+- directory
40+- process
41+- file-embed
42+- filemanip
43+- gitrev
44+
45+library:
46+ source-dirs: src
47+ default-extensions:
48+ - ConstraintKinds
49+ - DataKinds
50+ - DeriveFunctor
51+ - EmptyDataDecls
52+ - FlexibleContexts
53+ - KindSignatures
54+ - LambdaCase
55+ - MultiParamTypeClasses
56+ - NoImplicitPrelude
57+ - PatternGuards
58+ - PatternSynonyms
59+ - RankNTypes
60+ - RecordWildCards
61+ - OverloadedStrings
62+ - ScopedTypeVariables
63+ - TupleSections
64+ - ViewPatterns
65+
66+executables:
67+ psgo:
68+ main: Main.hs
69+ source-dirs: app
70+ ghc-options:
71+ - -threaded
72+ - -rtsopts
73+ - -with-rtsopts=-N
74+ dependencies:
75+ - psgo
76+
77+tests:
78+ psgo-test:
79+ main: Spec.hs
80+ source-dirs: test
81+ ghc-options:
82+ - -threaded
83+ - -rtsopts
84+ - -with-rtsopts=-N
85+ dependencies:
86+ - psgo
psc-bundle/Main.hsdeleted−146
@@ -1,146 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : psc-bundle
4−-- Copyright : (c) Phil Freeman 2015
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Bundles compiled PureScript modules for the browser.
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE FlexibleContexts #-}
16−{-# LANGUAGE ScopedTypeVariables #-}
17−{-# LANGUAGE TupleSections #-}
18−{-# LANGUAGE RecordWildCards #-}
19−
20−module Main (main) where
21−
22−import Data.Traversable (for)
23−import Data.Version (showVersion)
24−
25−import Control.Applicative
26−import Control.Monad
27−import Control.Monad.Error.Class
28−import Control.Monad.Trans.Except
29−import Control.Monad.IO.Class
30−
31−import System.FilePath (takeFileName, takeDirectory)
32−import System.FilePath.Glob (glob)
33−import System.Exit (exitFailure)
34−import System.IO (stderr, hPutStrLn)
35−import System.Directory (createDirectoryIfMissing)
36−
37−import Language.PureScript.Bundle
38−
39−import Options.Applicative as Opts
40−
41−import qualified Paths_purescript as Paths
42−
43−-- | Command line options.
44−data Options = Options
45− { optionsInputFiles :: [FilePath]
46− , optionsOutputFile :: Maybe FilePath
47− , optionsEntryPoints :: [String]
48− , optionsMainModule :: Maybe String
49− , optionsNamespace :: String
50− , optionsRequirePath :: Maybe FilePath
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 :: (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− length js `seq` return (mid, js) -- evaluate readFile till EOF before returning, not to exhaust file handles
74−
75− let entryIds = map (`ModuleIdentifier` Regular) optionsEntryPoints
76−
77− bundle input entryIds optionsMainModule optionsNamespace optionsRequirePath
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− <*> optional requirePath
87− where
88− inputFile :: Parser FilePath
89− inputFile = strArgument $
90− metavar "FILE"
91− <> help "The input .js file(s)"
92−
93− outputFile :: Parser FilePath
94− outputFile = strOption $
95− short 'o'
96− <> long "output"
97− <> help "The output .js file"
98−
99− entryPoint :: Parser String
100− entryPoint = strOption $
101− short 'm'
102− <> long "module"
103− <> help "Entry point module name(s). All code which is not a transitive dependency of an entry point module will be removed."
104−
105− mainModule :: Parser String
106− mainModule = strOption $
107− long "main"
108− <> help "Generate code to run the main method in the specified module."
109−
110− namespace :: Parser String
111− namespace = strOption $
112− short 'n'
113− <> long "namespace"
114− <> Opts.value "PS"
115− <> showDefault
116− <> help "Specify the namespace that PureScript modules will be exported to when running in the browser."
117−
118− requirePath :: Parser FilePath
119− requirePath = strOption $
120− short 'r'
121− <> long "require-path"
122− <> Opts.value ""
123− <> help "The path prefix used in require() calls in the generated JavaScript"
124−
125−-- | Make it go.
126−main :: IO ()
127−main = do
128− opts <- execParser (info (version <*> helper <*> options) infoModList)
129− output <- runExceptT (app opts)
130− case output of
131− Left err -> do
132− hPutStrLn stderr (unlines (printErrorMessage err))
133− exitFailure
134− Right js ->
135− case optionsOutputFile opts of
136− Just outputFile -> do
137− createDirectoryIfMissing True (takeDirectory outputFile)
138− writeFile outputFile js
139− Nothing -> putStrLn js
140− where
141− infoModList = fullDesc <> headerInfo <> footerInfo
142− headerInfo = header "psc-bundle - Bundles compiled PureScript modules for the browser"
143− footerInfo = footer $ "psc-bundle " ++ showVersion Paths.version
144−
145− version :: Parser (a -> a)
146− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
psc-bundle/README.mddeleted−18
@@ -1,18 +0,0 @@
1−# psc-bundle
2−
3−A dead code elimination tool for PureScript-style CommonJS modules. This can be used as an alternative to Browserify.
4−
5−## Usage
6−
7− psc-bundle FILE (-m|--module ARG) [--main ARG] [--namespace ARG]
8−
9−Options:
10−
11−- The input .js file(s)
12−- Entry point module name(s) are specified with `-m` or `--module`. All code which is not a transitive dependency of an entry point module will be removed.
13−- The main module is (optionally) specified using `--main`. If specified, this will generate code to run the main method in the specified module.
14−- The browser namespace defaults to `PS`, and can be overridden with `--namespace`.
15−
16−For example, to bundle the modules in the `output` directory, with main module `Main`:
17−
18− psc-bundle output/**/*.js -m Main --main Main
psc-docs/Ctags.hsdeleted−13
@@ -1,13 +0,0 @@
1−module Ctags (dumpCtags) where
2−
3−import qualified Language.PureScript as P
4−import Tags
5−import Data.List (sort)
6−
7−dumpCtags :: [(String, P.Module)] -> [String]
8−dumpCtags = sort . concatMap renderModCtags
9−
10−renderModCtags :: (String, P.Module) -> [String]
11−renderModCtags (path, mdl) = sort tagLines
12− where tagLines = map tagLine $ tags mdl
13− tagLine (name, line) = name ++ "\t" ++ path ++ "\t" ++ show line
psc-docs/Etags.hsdeleted−13
@@ -1,13 +0,0 @@
1−module Etags (dumpEtags) where
2−
3−import qualified Language.PureScript as P
4−import Tags
5−
6−dumpEtags :: [(String, P.Module)] -> [String]
7−dumpEtags = concatMap 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 ++ ","
psc-docs/Main.hsdeleted−259
@@ -1,259 +0,0 @@
1−{-# LANGUAGE TupleSections #-}
2−----------------------------------------------------------------------------
3−--
4−-- Module : Main
5−-- Copyright : (c) Phil Freeman 2013
6−-- License : MIT
7−--
8−-- Maintainer : Phil Freeman <paf31@cantab.net>
9−-- Stability : experimental
10−-- Portability :
11−--
12−-- |
13−--
14−-----------------------------------------------------------------------------
15−
16−module Main where
17−
18−import Control.Applicative
19−import Control.Monad.Trans.Except (runExceptT)
20−import Control.Arrow (first, second)
21−import Control.Category ((>>>))
22−import Control.Monad.Writer
23−import Data.Function (on)
24−import Data.List
25−import Data.Maybe (fromMaybe)
26−import Data.Tuple (swap)
27−import Data.Version (showVersion)
28−
29−import Options.Applicative
30−import qualified Text.PrettyPrint.ANSI.Leijen as PP
31−
32−import qualified Language.PureScript as P
33−import qualified Paths_purescript as Paths
34−import System.Exit (exitFailure)
35−import System.IO (hPutStrLn, stderr)
36−import System.Directory (createDirectoryIfMissing)
37−import System.FilePath (takeDirectory)
38−import System.FilePath.Glob (glob)
39−
40−import Etags
41−import Ctags
42−import qualified Language.PureScript.Docs as D
43−import qualified Language.PureScript.Docs.AsMarkdown as D
44−
45−-- Available output formats
46−data Format = Markdown -- Output documentation in Markdown format
47− | Ctags -- Output ctags symbol index suitable for use with vi
48− | Etags -- Output etags symbol index suitable for use with emacs
49− deriving (Show, Eq, Ord)
50−
51−-- | Available methods of outputting Markdown documentation
52−data DocgenOutput
53− = EverythingToStdOut
54− | ToStdOut [P.ModuleName]
55− | ToFiles [(P.ModuleName, FilePath)]
56− deriving (Show)
57−
58−data PSCDocsOptions = PSCDocsOptions
59− { pscdFormat :: Format
60− , pscdInputFiles :: [FilePath]
61− , pscdDocgen :: DocgenOutput
62− }
63− deriving (Show)
64−
65−docgen :: PSCDocsOptions -> IO ()
66−docgen (PSCDocsOptions fmt inputGlob output) = do
67− input <- concat <$> mapM glob inputGlob
68− case fmt of
69− Etags -> dumpTags input dumpEtags
70− Ctags -> dumpTags input dumpCtags
71− Markdown -> do
72− ms <- runExceptT (D.parseAndBookmark input []
73− >>= (fst >>> D.convertModulesInPackage))
74− >>= successOrExit
75−
76− case output of
77− EverythingToStdOut ->
78− putStrLn (D.runDocs (D.modulesAsMarkdown ms))
79− ToStdOut names -> do
80− let (ms', missing) = takeByName ms names
81− guardMissing missing
82− putStrLn (D.runDocs (D.modulesAsMarkdown ms'))
83− ToFiles names -> do
84− let (ms', missing) = takeByName' ms names
85− guardMissing missing
86−
87− let ms'' = groupBy ((==) `on` fst) . sortBy (compare `on` fst) $ map swap ms'
88− forM_ ms'' $ \grp -> do
89− let fp = fst (head grp)
90− createDirectoryIfMissing True (takeDirectory fp)
91− writeFile fp (D.runDocs (D.modulesAsMarkdown (map snd grp)))
92−
93− where
94− guardMissing [] = return ()
95− guardMissing [mn] = do
96− hPutStrLn stderr ("psc-docs: error: unknown module \"" ++ P.runModuleName mn ++ "\"")
97− exitFailure
98− guardMissing mns = do
99− hPutStrLn stderr "psc-docs: error: unknown modules:"
100− forM_ mns $ \mn ->
101− hPutStrLn stderr (" * " ++ P.runModuleName mn)
102− exitFailure
103−
104− successOrExit :: Either P.MultipleErrors a -> IO a
105− successOrExit act =
106− case act of
107− Right x ->
108− return x
109− Left err -> do
110− hPutStrLn stderr $ P.prettyPrintMultipleErrors False err
111− exitFailure
112−
113− takeByName = takeModulesByName D.modName
114− takeByName' = takeModulesByName' D.modName
115−
116−-- |
117−-- Given a list of module names and a list of modules, return a list of modules
118−-- whose names appeared in the given name list, together with a list of names
119−-- for which no module could be found in the module list.
120−--
121−takeModulesByName :: (Eq n) => (m -> n) -> [m] -> [n] -> ([m], [n])
122−takeModulesByName getModuleName modules names =
123− first (map fst) (takeModulesByName' getModuleName modules (map (,()) names))
124−
125−-- |
126−-- Like takeModulesByName, but also keeps some extra information with each
127−-- module.
128−--
129−takeModulesByName' :: (Eq n) => (m -> n) -> [m] -> [(n, a)] -> ([(m, a)], [n])
130−takeModulesByName' getModuleName modules = foldl go ([], [])
131− where
132− go (ms, missing) (name, x) =
133− case find ((== name) . getModuleName) modules of
134− Just m -> ((m, x) : ms, missing)
135− Nothing -> (ms, name : missing)
136−
137−dumpTags :: [FilePath] -> ([(String, P.Module)] -> [String]) -> IO ()
138−dumpTags input renderTags = do
139− e <- P.parseModulesFromFiles (fromMaybe "") <$> mapM (fmap (first Just) . parseFile) (nub input)
140− case e of
141− Left err -> do
142− hPutStrLn stderr (show err)
143− exitFailure
144− Right ms ->
145− ldump (renderTags (pairs ms))
146−
147− where
148− pairs :: [(Maybe String, m)] -> [(String, m)]
149− pairs = map (first (fromMaybe ""))
150−
151− ldump :: [String] -> IO ()
152− ldump = mapM_ putStrLn
153−
154−parseFile :: FilePath -> IO (FilePath, String)
155−parseFile input = (,) input <$> readFile input
156−
157−inputFile :: Parser FilePath
158−inputFile = strArgument $
159− metavar "FILE"
160− <> help "The input .purs file(s)"
161−
162−instance Read Format where
163− readsPrec _ "etags" = [(Etags, "")]
164− readsPrec _ "ctags" = [(Ctags, "")]
165− readsPrec _ "markdown" = [(Markdown, "")]
166− readsPrec _ _ = []
167−
168−format :: Parser Format
169−format = option auto $ value Markdown
170− <> long "format"
171− <> metavar "FORMAT"
172− <> help "Set output FORMAT (markdown | etags | ctags)"
173−
174−docgenModule :: Parser String
175−docgenModule = strOption $
176− long "docgen"
177− <> 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."
178−
179−pscDocsOptions :: Parser (Format, [FilePath], [String])
180−pscDocsOptions = (,,) <$> format <*> many inputFile <*> many docgenModule
181−
182−parseDocgen :: [String] -> Either String DocgenOutput
183−parseDocgen [] = Right EverythingToStdOut
184−parseDocgen xs = go xs
185− where
186− go = intersperse " "
187− >>> concat
188− >>> words
189− >>> map parseItem
190− >>> combine
191−
192−data DocgenOutputItem
193− = IToStdOut P.ModuleName
194− | IToFile (P.ModuleName, FilePath)
195−
196−parseItem :: String -> DocgenOutputItem
197−parseItem s = case elemIndex ':' s of
198− Just i ->
199− s # splitAt i
200− >>> first P.moduleNameFromString
201− >>> second (drop 1)
202− >>> IToFile
203− Nothing ->
204− IToStdOut (P.moduleNameFromString s)
205−
206− where
207− infixr 1 #
208− (#) = flip ($)
209−
210−combine :: [DocgenOutputItem] -> Either String DocgenOutput
211−combine [] = Right EverythingToStdOut
212−combine (x:xs) = foldM go (initial x) xs
213− where
214− initial (IToStdOut m) = ToStdOut [m]
215− initial (IToFile m) = ToFiles [m]
216−
217− go (ToStdOut ms) (IToStdOut m) = Right (ToStdOut (m:ms))
218− go (ToFiles ms) (IToFile m) = Right (ToFiles (m:ms))
219− go _ _ = Left "Can't mix module names and module name/file path pairs in the same invocation."
220−
221−buildOptions :: (Format, [FilePath], [String]) -> IO PSCDocsOptions
222−buildOptions (fmt, input, mapping) =
223− case parseDocgen mapping of
224− Right mapping' -> return (PSCDocsOptions fmt input mapping')
225− Left err -> do
226− hPutStrLn stderr "psc-docs: error in --docgen option:"
227− hPutStrLn stderr (" " ++ err)
228− exitFailure
229−
230−main :: IO ()
231−main = execParser opts >>= buildOptions >>= docgen
232− where
233− opts = info (version <*> helper <*> pscDocsOptions) infoModList
234− infoModList = fullDesc <> headerInfo <> footerInfo
235− headerInfo = header "psc-docs - Generate Markdown documentation from PureScript source files"
236− footerInfo = footerDoc $ Just $ PP.vcat
237− [ examples, PP.empty, PP.text ("psc-docs " ++ showVersion Paths.version) ]
238−
239− version :: Parser (a -> a)
240− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
241−
242−examples :: PP.Doc
243−examples =
244− PP.vcat $ map PP.text
245− [ "Examples:"
246− , " print documentation for Data.List to stdout:"
247− , " psc-docs \"src/**/*.purs\" \"bower_components/*/src/**/*.purs\" \\"
248− , " --docgen Data.List"
249− , ""
250− , " write documentation for Data.List to docs/Data.List.md:"
251− , " psc-docs \"src/**/*.purs\" \"bower_components/*/src/**/*.purs\" \\"
252− , " --docgen Data.List:docs/Data.List.md"
253− , ""
254− , " write documentation for Data.List to docs/Data.List.md, and"
255− , " documentation for Data.List.Lazy to docs/Data.List.Lazy.md:"
256− , " psc-docs \"src/**/*.purs\" \"bower_components/*/src/**/*.purs\" \\"
257− , " --docgen Data.List:docs/Data.List.md \\"
258− , " --docgen Data.List.Lazy:docs/Data.List.Lazy.md"
259− ]
psc-docs/Tags.hsdeleted−18
@@ -1,18 +0,0 @@
1−module Tags where
2−
3−import qualified Language.PureScript as P
4−
5−tags :: P.Module -> [(String, Int)]
6−tags = concatMap dtags . P.exportedDeclarations
7− where dtags (P.PositionedDeclaration sp _ d) = map tag $ names d
8− where tag name = (name, line)
9− line = P.sourcePosLine $ P.spanStart sp
10− dtags _ = []
11− names (P.DataDeclaration _ name _ dcons) = P.runProperName name : consNames
12− where consNames = map (\(cname, _) -> P.runProperName cname) dcons
13− names (P.TypeDeclaration ident _) = [P.showIdent ident]
14− names (P.ExternDeclaration ident _) = [P.showIdent ident]
15− names (P.TypeSynonymDeclaration name _ _) = [P.runProperName name]
16− names (P.TypeClassDeclaration name _ _ _) = [P.runProperName name]
17− names (P.TypeInstanceDeclaration name _ _ _ _) = [P.showIdent name]
18− names _ = []
psc-ide-client/Main.hsdeleted−57
@@ -1,57 +0,0 @@
1−{-# LANGUAGE OverloadedStrings #-}
2−module Main where
3−
4−import Prelude ()
5−import Prelude.Compat
6−
7−import Control.Exception
8−import Data.Maybe (fromMaybe)
9−import Data.Text (Text)
10−import qualified Data.Text as T
11−import qualified Data.Text.IO as T
12−import Data.Version (showVersion)
13−import Network
14−import Options.Applicative
15−import System.Exit
16−import System.IO
17−
18−import qualified Paths_purescript as Paths
19−
20−data Options = Options
21− { optionsPort :: Maybe Int
22− }
23−
24−main :: IO ()
25−main = do
26− Options port <- execParser opts
27− let port' = PortNumber . fromIntegral $ fromMaybe 4242 port
28− client port'
29− where
30− parser =
31− Options <$>
32− optional (option auto (long "port" <> short 'p'))
33− opts = info (version <*> parser) mempty
34− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
35−
36−client :: PortID -> IO ()
37−client port = do
38− h <-
39− connectTo "localhost" port `catch`
40− (\(SomeException e) ->
41− putStrLn
42− ("Couldn't connect to psc-ide-server on port: " ++
43− show port ++ " Error: " ++ show e) >>
44− exitFailure)
45− cmd <- T.getLine
46− -- Temporary fix for emacs windows bug
47− let cleanedCmd = removeSurroundingTicks cmd
48− --
49− T.hPutStrLn h cleanedCmd
50− res <- T.hGetLine h
51− putStrLn (T.unpack res)
52− hFlush stdout
53− hClose h
54−
55−-- TODO: Fix this in the emacs plugin by using a real process over shellcommands
56−removeSurroundingTicks :: Text -> Text
57−removeSurroundingTicks = T.dropWhile (== '\'') . T.dropWhileEnd (== '\'')
psc-ide-server/Main.hsdeleted−135
@@ -1,135 +0,0 @@
1−{-# LANGUAGE ConstraintKinds #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE MultiParamTypeClasses #-}
4−{-# LANGUAGE OverloadedStrings #-}
5−{-# LANGUAGE PackageImports #-}
6−{-# LANGUAGE TemplateHaskell #-}
7−module Main where
8−
9−import Prelude ()
10−import Prelude.Compat
11−
12−import Control.Concurrent (forkFinally)
13−import Control.Concurrent.STM
14−import Control.Exception (bracketOnError)
15−import Control.Monad
16−import "monad-logger" Control.Monad.Logger
17−import Control.Monad.Reader
18−import Control.Monad.Trans.Except
19−import qualified Data.Text as T
20−import qualified Data.Text.IO as T
21−import Data.Version (showVersion)
22−import Language.PureScript.Ide
23−import Language.PureScript.Ide.CodecJSON
24−import Language.PureScript.Ide.Error
25−import Language.PureScript.Ide.Types
26−import Language.PureScript.Ide.Watcher
27−import Network hiding (socketPort)
28−import Network.BSD (getProtocolNumber)
29−import Network.Socket hiding (PortNumber, Type,
30− accept, sClose)
31−import Options.Applicative
32−import System.Directory
33−import System.FilePath
34−import System.IO
35−
36−import qualified Paths_purescript as Paths
37−
38−-- "Borrowed" from the Idris Compiler
39−-- Copied from upstream impl of listenOn
40−-- bound to localhost interface instead of iNADDR_ANY
41−listenOnLocalhost :: PortID -> IO Socket
42−listenOnLocalhost (PortNumber port) = do
43− proto <- getProtocolNumber "tcp"
44− localhost <- inet_addr "127.0.0.1"
45− bracketOnError
46− (socket AF_INET Stream proto)
47− sClose
48− (\sock -> do
49− setSocketOption sock ReuseAddr 1
50− bindSocket sock (SockAddrInet port localhost)
51− listen sock maxListenQueue
52− pure sock)
53−listenOnLocalhost _ = error "Wrong Porttype"
54−
55−data Options = Options
56− { optionsDirectory :: Maybe FilePath
57− , optionsOutputPath :: FilePath
58− , optionsPort :: PortID
59− , optionsDebug :: Bool
60− }
61−
62−main :: IO ()
63−main = do
64− Options dir outputPath port debug <- execParser opts
65− maybe (pure ()) setCurrentDirectory dir
66− serverState <- newTVarIO emptyPscIdeState
67− cwd <- getCurrentDirectory
68− _ <- forkFinally (watcher serverState (cwd </> outputPath)) print
69− let conf =
70− Configuration
71− {
72− confDebug = debug
73− , confOutputPath = outputPath
74− }
75− let env =
76− PscIdeEnvironment
77− {
78− envStateVar = serverState
79− , envConfiguration = conf
80− }
81− startServer port env
82− where
83− parser =
84− Options <$>
85− optional (strOption (long "directory" <> short 'd')) <*>
86− strOption (long "output-directory" <> value "output/") <*>
87− (PortNumber . fromIntegral <$>
88− option auto (long "port" <> short 'p' <> value (4242 :: Integer))) <*>
89− switch (long "debug")
90− opts = info (version <*> parser) mempty
91− version = abortOption
92− (InfoMsg (showVersion Paths.version))
93− (long "version" <> help "Show the version number")
94−
95−startServer :: PortID -> PscIdeEnvironment -> IO ()
96−startServer port env = withSocketsDo $ do
97− sock <- listenOnLocalhost port
98− runLogger (runReaderT (forever (loop sock)) env)
99− where
100− runLogger = runStdoutLoggingT . filterLogger (\_ _ -> confDebug (envConfiguration env))
101−
102− loop :: (PscIde m, MonadLogger m) => Socket -> m ()
103− loop sock = do
104− (cmd,h) <- acceptCommand sock
105− case decodeT cmd of
106− Just cmd' -> do
107− result <- runExceptT (handleCommand cmd')
108− $(logDebug) ("Answer was: " <> T.pack (show result))
109− liftIO (hFlush stdout)
110− case result of
111− -- What function can I use to clean this up?
112− Right r -> liftIO $ T.hPutStrLn h (encodeT r)
113− Left err -> liftIO $ T.hPutStrLn h (encodeT err)
114− Nothing -> do
115− $(logDebug) ("Parsing the command failed. Command: " <> cmd)
116− liftIO $ do
117− T.hPutStrLn h (encodeT (GeneralError "Error parsing Command."))
118− hFlush stdout
119− liftIO (hClose h)
120−
121−
122−acceptCommand :: (Applicative m, MonadIO m, MonadLogger m)
123− => Socket -> m (T.Text, Handle)
124−acceptCommand sock = do
125− h <- acceptConnection
126− $(logDebug) "Accepted a connection"
127− cmd <- liftIO (T.hGetLine h)
128− $(logDebug) cmd
129− pure (cmd, h)
130− where
131− acceptConnection = liftIO $ do
132− (h,_,_) <- accept sock
133− hSetEncoding h utf8
134− hSetBuffering h LineBuffering
135− pure h
psc-ide-server/PROTOCOL.mddeleted−409
@@ -1,409 +0,0 @@
1−# Protocol
2−
3−Encode the following JSON formats into a single line string and pass them to
4−`psc-ide-client`s stdin. You can then read the result from `psc-ide-client`s
5−stdout as a single line. The result needs to be unwrapped from the "wrapper"
6−which separates success from failure. This wrapper is described at the end of
7−this document.
8−
9−## Command:
10−### Load
11−The `load` command "loads" the requested modules into the server
12−for completion and type info.
13−
14−**Params:**
15− - `modules :: (optional) [ModuleName]`: A list of modules to load.
16− psc-ide-server will try to parse all the declarations in these modules
17− - `dependencies :: (optional) [ModuleName]`: A list of modules to load
18− including their dependencies. In contrast to the `module` field, all the
19− imports in these Modules will also be loaded.
20−
21−```json
22−{
23− "command": "load",
24− "params": {
25− "modules": (optional)["Module.Name1", "Module.Name2"],
26− "dependencies": (optional)["Module.Name3"]
27− }
28−}
29−```
30−
31−**Result:**
32−
33−The Load Command returns a string.
34−
35−### Type
36−The `type` command looks up the type for a given identifier.
37−
38−**Params:**
39− - `search :: String`: The identifier to look for. Only matches on equality.
40− - `filters :: [Filter]`: These filters will be applied before looking for the
41− identifier. These filters get combined with *AND*, so a candidate must match *ALL*
42− of them to be eligible.
43−```json
44−{
45− "command": "type",
46− "params": {
47− "search": "filterM",
48− "filters": [Filter]
49− }
50−}
51−```
52−
53−**Result:**
54−The possible types are returned in the same format as completions
55−
56−### Complete
57−The `complete` command looks up possible completions/corrections.
58−
59−**Params**:
60− - `filters :: [Filter]`: The same as for the `type` command. A candidate must match
61− all filters.
62− - `matcher :: (optional) Matcher`: The strategy used for matching candidates after filtering.
63− Results are scored internally and will be returned in the descending order where
64− the nth element is better then the n+1-th.
65−
66− If no matcher is given every candidate, that passes the filters, is returned in no
67− particular order.
68−```json
69−{
70− "command": "complete",
71− "params": {
72− "filters": [Filter],
73− "matcher": (optional) Matcher
74− }
75−}
76−```
77−
78−**Result:**
79−
80−The following format is returned as the Result:
81−
82−```json
83−[
84− {
85− "module": "Data.Array",
86− "identifier": "filter",
87− "type": "forall a. (a -> Boolean) -> Array a -> Array a"
88− }
89−]
90−```
91−
92−
93−### CaseSplit
94−
95−The CaseSplit command takes a line of source code, an area in that line of code
96−and replaces it with all patterns for a given type. The parameter `annotations`
97−is used to turn type annotations on or off for the constructor fields.
98−
99−```json
100−{
101− "command": "caseSplit",
102− "params": {
103− "line": "elem a as",
104− "begin": 8,
105− "end": 10,
106− "annotations": true,
107− "type": "List"
108− }
109−}
110−```
111−
112−**Result:**
113−
114−The following format is returned as the Result:
115−
116−```json
117−[
118− "elem a Nil",
119− "elem a (Cons (_ :: a) (_ :: List a))"
120−]
121−```
122−You should then be able to replace the affected line of code in the editor with the new suggestions.
123−
124−### Add Clause
125−
126−The AddClause command takes a typedeclaration and generates a function template for the given type.
127−The `annotations` option turns type annotations on or off for the function arguments.
128−
129−```json
130−{
131− "command": "addClause",
132− "params": {
133− "line": "elem :: forall a. (Eq a) => a -> List a",
134− "annotations": true
135− }
136−}
137−```
138−
139−**Result:**
140−
141−The following format is returned as the Result:
142−
143−```json
144−[
145− "elem :: forall a. (Eq a) => a -> List a",
146− "elem ( _ :: a) = ?elem"
147−]
148−```
149−You should then be able to replace the affected line of code in the editor with the new suggestions.
150−
151−### Pursuit
152−The `pursuit` command looks up the packages/completions for a given identifier from Pursuit.
153−
154−**Params:**
155− - `query :: String`: With `type: "package"` this should be a module name. With
156− `type: "completion"` this can be any string to look up.
157− - `type :: String`: Takes the following values:
158− - `package`: Looks for packages that contain the given module name.
159− - `completion` Looks for declarations for the query from Pursuit.
160−
161−```json
162−{
163− "command": "pursuit",
164− "params": {
165− "query": "Data.Array",
166− "type": "package"
167− }
168−}
169−```
170−
171−**Result:**
172−
173−`package` returns:
174−
175−```json
176−[
177− {
178− "module": "Module1.Name",
179− "package": "purescript-packagename"
180− }
181−]
182−```
183−
184−`completion` returns:
185−
186−```json
187−[
188− {
189− "module": "Data.Array",
190− "identifier": "filter",
191− "type": "forall a. (a -> Boolean) -> Array a -> Array a",
192− "package": "purescript-arrays"
193− }
194−]
195−```
196−
197−### List
198−
199−#### Loaded Modules
200−
201−`list` of type `loadedModules` lists all loaded modules (This means they can be searched for completions etc)
202−
203−```json
204−{
205− "command": "list",
206− "params": {
207− "type": "loadedModules"
208− }
209−}
210−```
211−
212−#### Response:
213−
214−The list loadedModules command returns a list of strings.
215−
216−#### Available Modules
217−
218−`list` of type `availableModules` lists all available modules. (This basically
219−means the contents of the `output/` folder.))
220−
221−```json
222−{
223− "command": "list",
224− "params": {
225− "type": "availableModules"
226− }
227−}
228−```
229−
230−#### Response:
231−
232−The list availableModules command returns a list of strings.
233−
234−#### Imports
235−
236−The list commmand can also list the imports for a given file.
237−
238−```json
239−{
240− "command": "list",
241− "params": {
242− "type": "import",
243− "file": "/home/kritzcreek/Documents/psc-ide/examples/Main.purs"
244− }
245−}
246−```
247−
248−#### Response:
249−
250−The list import command returns a list of imports where imports are of the following form:
251−
252−Implicit Import(`import Data.Array`):
253−```json
254−[
255− {
256− "module": "Data.Array",
257− "importType": "implicit"
258− }
259−]
260−```
261−
262−Implicit qualified Import(`import qualified Data.Array as A`):
263−```json
264−[
265− {
266− "module": "Data.Array",
267− "importType": "implicit",
268− "qualifier": "A"
269− }
270−]
271−```
272−
273−Explicit Import(`import Data.Array (filter, filterM, join)`):
274−```json
275−[
276− {
277− "module": "Data.Array",
278− "importType": "explicit",
279− "identifiers": ["filter", "filterM", "join"]
280− }
281−]
282−```
283−
284−Hiding Import(`import Data.Array hiding (filter, filterM, join)`):
285−```json
286−[
287− {
288− "module": "Data.Array",
289− "importType": "hiding",
290− "identifiers": ["filter", "filterM", "join"]
291− }
292−]
293−```
294−### Cwd/Quit
295−`cwd` returns the working directory of the server(should be your project root).
296−
297−`quit` quits the server.
298−
299−```json
300−{
301− "command": "cwd|quit"
302−}
303−```
304−
305−**Result:**
306−These commands return strings.
307−
308−## Filter:
309−
310−### Exact filter
311−The Exact filter only keeps identifiers that are equal to the search term.
312−
313−```json
314−{
315− "filter": "exact",
316− "params": {
317− "search": "filterM"
318− }
319−}
320−```
321−### Prefix filter
322−The Prefix filter keeps identifiers/modules/data declarations that
323−are prefixed by the search term.
324−
325−```json
326−{
327− "filter": "prefix",
328− "params": {
329− "search": "filt"
330− }
331−}
332−```
333−
334−### Module filter
335−The Module filter only keeps identifiers that appear in the listed modules.
336−
337−```json
338−{
339− "filter": "modules",
340− "params": {
341− "modules": ["My.Module"]
342− }
343−}
344−```
345−
346−### Dependency filter
347−The Dependency filter only keeps identifiers that appear in the listed modules
348−and in any of their dependencies/imports.
349−
350−```json
351−{
352− "filter": "dependencies",
353− "params": {
354− "modules": ["My.Module"]
355− }
356−}
357−```
358−
359−## Matcher:
360−
361−### Flex matcher
362−Matches any occurence of the search string with intersections
363−
364−The scoring measures how far the matches span the string, where
365−closer is better. The matches then get sorted with highest score first.
366−
367−Examples:
368−- flMa matches **fl**ex**Ma**tcher. Score: 14.28
369−- sons matches **so**rtCompletio**ns**. Score: 6.25
370−```json
371−
372−{
373− "matcher": "flex",
374− "params": {
375− "search": "filt"
376− }
377−}
378−```
379−
380−### Distance Matcher
381−
382−The Distance matcher is meant to provide corrections for typos. It calculates
383−the edit distance in between the search and the loaded identifiers.
384−
385−```json
386−{
387− "matcher": "distance",
388− "params": {
389− "search": "dilterM",
390− "maximumDistance": 3
391− }
392−}
393−```
394−
395−## Responses
396−
397−All Responses are wrapped in the following format:
398−
399−```json
400−{
401− "resultType": "success|error",
402− "result": Result|Error
403−}
404−```
405−
406−### Error
407−
408−Errors at this point are merely Error strings. Newlines are escaped like `\n`
409−and should be taken care of by the editor-plugin.
psc-ide-server/README.mddeleted−40
@@ -1,40 +0,0 @@
1−psc-ide
2−===
3−
4−A tool which provides editor support for the PureScript programming language.
5−
6−## Editor Integration
7−* [@epost](https://github.com/epost) wrote a plugin to integrate psc-ide with Emacs at https://github.com/epost/psc-ide-emacs.
8−* Atom integration is available with https://github.com/nwolverson/atom-ide-purescript.
9−* Visual Studio Code integration is available with https://github.com/nwolverson/vscode-ide-purescript.
10−* Vim integration is available here: https://github.com/FrigoEU/psc-ide-vim.
11−
12−## Running the Server
13−Start the server by running the `psc-ide-server` executable.
14−It supports the following options:
15−
16−- `-p / --port` specify a port. Defaults to 4242
17−- `-d / --directory` specify the toplevel directory of your project. Defaults to
18− the current directory
19−- `--output-directory`: Specify where to look for compiled output inside your
20− project directory. Defaults to `output/`, relative to either the current
21− directory or the directory specified by `-d`.
22−- `--debug`: Enables some logging meant for debugging
23−- `--version`: Output psc-ide version
24−
25−## Issuing queries
26−
27−After you started the server you can start issuing requests using
28−`psc-ide-client`. Make sure you start by loading the modules before you try to
29−query them.
30−
31−`psc-ide-server` expects the build externs.purs inside the `output/` folder of
32−your project after running `pulp build` or `psc-make` respectively.
33−
34−(If you changed the port of the server you can change the port for
35−`psc-ide-client` by using the -p option accordingly)
36−
37−## Protocol
38−
39−For documentation about the protocol have a look at:
40−[PROTOCOL.md](PROTOCOL.md)
psc-publish/Main.hsdeleted−45
@@ -1,45 +0,0 @@
1−
2−module Main where
3−
4−import Data.Version (Version(..), showVersion)
5−import qualified Data.Aeson as A
6−import qualified Data.ByteString.Lazy.Char8 as BL
7−
8−import Options.Applicative hiding (str)
9−
10−import qualified Paths_purescript as Paths
11−import Language.PureScript.Publish
12−import Language.PureScript.Publish.ErrorsWarnings
13−
14−dryRun :: Parser Bool
15−dryRun = switch $
16− long "dry-run"
17− <> help "Produce no output, and don't require a tagged version to be checked out."
18−
19−dryRunOptions :: PublishOptions
20−dryRunOptions = defaultPublishOptions
21− { publishGetVersion = return dummyVersion
22− , publishWorkingTreeDirty = warn DirtyWorkingTree_Warn
23− }
24− where dummyVersion = ("0.0.0", Version [0,0,0] [])
25−
26−main :: IO ()
27−main = execParser opts >>= publish
28− where
29− opts = info (version <*> helper <*> dryRun) infoModList
30− infoModList = fullDesc <> headerInfo <> footerInfo
31− headerInfo = header "psc-publish - Generates documentation packages for upload to http://pursuit.purescript.org"
32− footerInfo = footer $ "psc-publish " ++ showVersion Paths.version
33−
34− version :: Parser (a -> a)
35− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
36−
37−publish :: Bool -> IO ()
38−publish isDryRun =
39− if isDryRun
40− then do
41− _ <- preparePackage dryRunOptions
42− putStrLn "Dry run completed, no errors."
43− else do
44− pkg <- preparePackage defaultPublishOptions
45− BL.putStrLn (A.encode pkg)
psc/JSON.hsdeleted−80
@@ -1,80 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Main
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE TemplateHaskell #-}
16−
17−module JSON where
18−
19−import Prelude ()
20−import Prelude.Compat
21−
22−import qualified Data.Aeson.TH as A
23−
24−import qualified Language.PureScript as P
25−
26−data ErrorPosition = ErrorPosition
27− { startLine :: Int
28− , startColumn :: Int
29− , endLine :: Int
30− , endColumn :: Int
31− }
32−
33−data ErrorSuggestion = ErrorSuggestion { replacement :: String }
34−
35−data JSONError = JSONError
36− { position :: Maybe ErrorPosition
37− , message :: String
38− , errorCode :: String
39− , errorLink :: String
40− , filename :: Maybe String
41− , moduleName :: Maybe String
42− , suggestion :: Maybe ErrorSuggestion
43− }
44−
45−data JSONResult = JSONResult
46− { warnings :: [JSONError]
47− , errors :: [JSONError]
48− }
49−
50−$(A.deriveJSON A.defaultOptions ''ErrorPosition)
51−$(A.deriveJSON A.defaultOptions ''JSONError)
52−$(A.deriveJSON A.defaultOptions ''JSONResult)
53−$(A.deriveJSON A.defaultOptions ''ErrorSuggestion)
54−
55−
56−toJSONErrors :: Bool -> P.Level -> P.MultipleErrors -> [JSONError]
57−toJSONErrors verbose level = map (toJSONError verbose level) . P.runMultipleErrors
58−
59−toJSONError :: Bool -> P.Level -> P.ErrorMessage -> JSONError
60−toJSONError verbose level e =
61− JSONError (toErrorPosition <$> sspan)
62− (P.renderBox (P.prettyPrintSingleError verbose level False (P.stripModuleAndSpan e)))
63− (P.errorCode e)
64− (P.wikiUri e)
65− (P.spanName <$> sspan)
66− (P.runModuleName <$> P.errorModule e)
67− (toSuggestion <$> (P.errorSuggestion $ P.unwrapErrorMessage e))
68− where
69− sspan :: Maybe P.SourceSpan
70− sspan = P.errorSpan e
71−
72− toErrorPosition :: P.SourceSpan -> ErrorPosition
73− toErrorPosition ss =
74− ErrorPosition (P.sourcePosLine (P.spanStart ss))
75− (P.sourcePosColumn (P.spanStart ss))
76− (P.sourcePosLine (P.spanEnd ss))
77− (P.sourcePosColumn (P.spanEnd ss))
78− toSuggestion :: P.ErrorSuggestion -> ErrorSuggestion
79−-- TODO: Adding a newline because source spans chomp everything up to the next character
80− toSuggestion (P.ErrorSuggestion s) = ErrorSuggestion $ if null s then s else s ++ "\n"
psc/Main.hsdeleted−213
@@ -1,213 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Main
4−-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE DataKinds #-}
16−{-# LANGUAGE FlexibleContexts #-}
17−{-# LANGUAGE RecordWildCards #-}
18−{-# LANGUAGE TupleSections #-}
19−
20−module Main where
21−
22−import Control.Applicative
23−import Control.Monad
24−import Control.Monad.Error.Class (MonadError(..))
25−import Control.Monad.Writer.Strict
26−
27−import Data.List (isSuffixOf, partition)
28−import Data.Version (showVersion)
29−import qualified Data.Map as M
30−import qualified Data.Aeson as A
31−import qualified Data.ByteString.Lazy as B
32−import qualified Data.ByteString.UTF8 as BU8
33−
34−import Options.Applicative as Opts
35−
36−import System.Exit (exitSuccess, exitFailure)
37−import System.IO (hPutStrLn, stderr)
38−import System.IO.UTF8
39−import System.FilePath.Glob (glob)
40−
41−import qualified Language.PureScript as P
42−import qualified Paths_purescript as Paths
43−
44−import Language.PureScript.Make
45−
46−import JSON
47−
48−data PSCMakeOptions = PSCMakeOptions
49− { pscmInput :: [FilePath]
50− , pscmForeignInput :: [FilePath]
51− , pscmOutputDir :: FilePath
52− , pscmOpts :: P.Options
53− , pscmUsePrefix :: Bool
54− , pscmJSONErrors :: Bool
55− }
56−
57−data InputOptions = InputOptions
58− { ioInputFiles :: [FilePath]
59− }
60−
61−-- | Argumnets: verbose, use JSON, warnings, errors
62−printWarningsAndErrors :: Bool -> Bool -> P.MultipleErrors -> Either P.MultipleErrors a -> IO ()
63−printWarningsAndErrors verbose False warnings errors = do
64− when (P.nonEmpty warnings) $
65− hPutStrLn stderr (P.prettyPrintMultipleWarnings verbose warnings)
66− case errors of
67− Left errs -> do
68− hPutStrLn stderr (P.prettyPrintMultipleErrors verbose errs)
69− exitFailure
70− Right _ -> return ()
71−printWarningsAndErrors verbose True warnings errors = do
72− hPutStrLn stderr . BU8.toString . B.toStrict . A.encode $
73− JSONResult (toJSONErrors verbose P.Warning warnings)
74− (either (toJSONErrors verbose P.Error) (const []) errors)
75− either (const exitFailure) (const (return ())) errors
76−
77−compile :: PSCMakeOptions -> IO ()
78−compile PSCMakeOptions{..} = do
79− input <- globWarningOnMisses (unless pscmJSONErrors . warnFileTypeNotFound) pscmInput
80− when (null input && not pscmJSONErrors) $ do
81− hPutStrLn stderr "psc: No input files."
82− exitFailure
83− let (jsFiles, pursFiles) = partition (isSuffixOf ".js") input
84− moduleFiles <- readInput (InputOptions pursFiles)
85− inputForeign <- globWarningOnMisses (unless pscmJSONErrors . warnFileTypeNotFound) pscmForeignInput
86− foreignFiles <- forM (inputForeign ++ jsFiles) (\inFile -> (inFile,) <$> readUTF8File inFile)
87− (makeErrors, makeWarnings) <- runMake pscmOpts $ do
88− (ms, foreigns) <- parseInputs moduleFiles foreignFiles
89− let filePathMap = M.fromList $ map (\(fp, P.Module _ _ mn _ _) -> (mn, fp)) ms
90− makeActions = buildMakeActions pscmOutputDir filePathMap foreigns pscmUsePrefix
91− P.make makeActions (map snd ms)
92− printWarningsAndErrors (P.optionsVerboseErrors pscmOpts) pscmJSONErrors makeWarnings makeErrors
93− exitSuccess
94−
95−warnFileTypeNotFound :: String -> IO ()
96−warnFileTypeNotFound = hPutStrLn stderr . ("psc: No files found using pattern: " ++)
97−
98−globWarningOnMisses :: (String -> IO ()) -> [FilePath] -> IO [FilePath]
99−globWarningOnMisses warn = concatMapM globWithWarning
100− where
101− globWithWarning pattern = do
102− paths <- glob pattern
103− when (null paths) $ warn pattern
104− return paths
105− concatMapM f = liftM concat . mapM f
106−
107−readInput :: InputOptions -> IO [(Either P.RebuildPolicy FilePath, String)]
108−readInput InputOptions{..} = forM ioInputFiles $ \inFile -> (Right inFile, ) <$> readUTF8File inFile
109−
110−parseInputs :: (Functor m, Applicative m, MonadError P.MultipleErrors m, MonadWriter P.MultipleErrors m)
111− => [(Either P.RebuildPolicy FilePath, String)]
112− -> [(FilePath, P.ForeignJS)]
113− -> m ([(Either P.RebuildPolicy FilePath, P.Module)], M.Map P.ModuleName FilePath)
114−parseInputs modules foreigns =
115− (,) <$> P.parseModulesFromFiles (either (const "") id) modules
116− <*> P.parseForeignModulesFromFiles foreigns
117−
118−inputFile :: Parser FilePath
119−inputFile = strArgument $
120− metavar "FILE"
121− <> help "The input .purs file(s)"
122−
123−inputForeignFile :: Parser FilePath
124−inputForeignFile = strOption $
125− short 'f'
126− <> long "ffi"
127− <> help "The input .js file(s) providing foreign import implementations"
128−
129−outputDirectory :: Parser FilePath
130−outputDirectory = strOption $
131− short 'o'
132− <> long "output"
133− <> Opts.value "output"
134− <> showDefault
135− <> help "The output directory"
136−
137−requirePath :: Parser (Maybe FilePath)
138−requirePath = optional $ strOption $
139− short 'r'
140− <> long "require-path"
141− <> help "The path prefix to use for require() calls in the generated JavaScript"
142−
143−noTco :: Parser Bool
144−noTco = switch $
145− long "no-tco"
146− <> help "Disable tail call optimizations"
147−
148−noMagicDo :: Parser Bool
149−noMagicDo = switch $
150− long "no-magic-do"
151− <> help "Disable the optimization that overloads the do keyword to generate efficient code specifically for the Eff monad"
152−
153−noOpts :: Parser Bool
154−noOpts = switch $
155− long "no-opts"
156− <> help "Skip the optimization phase"
157−
158−comments :: Parser Bool
159−comments = switch $
160− short 'c'
161− <> long "comments"
162− <> help "Include comments in the generated code"
163−
164−verboseErrors :: Parser Bool
165−verboseErrors = switch $
166− short 'v'
167− <> long "verbose-errors"
168− <> help "Display verbose error messages"
169−
170−noPrefix :: Parser Bool
171−noPrefix = switch $
172− short 'p'
173− <> long "no-prefix"
174− <> help "Do not include comment header"
175−
176−jsonErrors :: Parser Bool
177−jsonErrors = switch $
178− long "json-errors"
179− <> help "Print errors to stderr as JSON"
180−sourceMaps :: Parser Bool
181−sourceMaps = switch $
182− long "source-maps"
183− <> help "Generate source maps"
184−
185−
186−options :: Parser P.Options
187−options = P.Options <$> noTco
188− <*> noMagicDo
189− <*> pure Nothing
190− <*> noOpts
191− <*> verboseErrors
192− <*> (not <$> comments)
193− <*> requirePath
194− <*> sourceMaps
195−
196−pscMakeOptions :: Parser PSCMakeOptions
197−pscMakeOptions = PSCMakeOptions <$> many inputFile
198− <*> many inputForeignFile
199− <*> outputDirectory
200− <*> options
201− <*> (not <$> noPrefix)
202− <*> jsonErrors
203−
204−main :: IO ()
205−main = execParser opts >>= compile
206− where
207− opts = info (version <*> helper <*> pscMakeOptions) infoModList
208− infoModList = fullDesc <> headerInfo <> footerInfo
209− headerInfo = header "psc - Compiles PureScript to Javascript"
210− footerInfo = footer $ "psc " ++ showVersion Paths.version
211−
212− version :: Parser (a -> a)
213− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
psci/PSCi.hsdeleted−371
@@ -1,371 +0,0 @@
1−{-# LANGUAGE DoAndIfThenElse #-}
2−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
3−{-# LANGUAGE RecordWildCards #-}
4−{-# LANGUAGE TupleSections #-}
5−{-# LANGUAGE DataKinds #-}
6−
7−-- |
8−-- PureScript Compiler Interactive.
9−--
10−module PSCi (runPSCi) where
11−
12−import Prelude ()
13−import Prelude.Compat
14−
15−import Data.Foldable (traverse_)
16−import Data.List (intercalate, nub, sort, find)
17−import Data.Tuple (swap)
18−import qualified Data.Map as M
19−
20−import Control.Arrow (first)
21−import Control.Monad
22−import Control.Monad.Error.Class (MonadError(..))
23−import Control.Monad.Trans.Class
24−import Control.Monad.Trans.Except (ExceptT(), runExceptT)
25−import Control.Monad.Trans.State.Strict
26−import Control.Monad.IO.Class (liftIO)
27−import Control.Monad.Writer.Strict (Writer(), runWriter)
28−
29−import System.Console.Haskeline
30−import System.Directory (doesFileExist, getHomeDirectory, getCurrentDirectory)
31−import System.Exit
32−import System.FilePath ((</>))
33−import System.FilePath.Glob (glob)
34−import System.Process (readProcessWithExitCode)
35−import System.IO.Error (tryIOError)
36−
37−import qualified Language.PureScript as P
38−import qualified Language.PureScript.Names as N
39−
40−import PSCi.Completion (completion)
41−import PSCi.Parser (parseCommand)
42−import PSCi.Option
43−import PSCi.Types
44−import PSCi.Message
45−import PSCi.IO
46−import PSCi.Printer
47−import PSCi.Module
48−
49−-- |
50−-- PSCI monad
51−--
52−newtype PSCI a = PSCI { runPSCI :: InputT (StateT PSCiState IO) a } deriving (Functor, Applicative, Monad)
53−
54−psciIO :: IO a -> PSCI a
55−psciIO io = PSCI . lift $ lift io
56−
57−-- |
58−-- The runner
59−--
60−runPSCi :: IO ()
61−runPSCi = getOpt >>= loop
62−
63−-- |
64−-- The PSCI main loop.
65−--
66−loop :: PSCiOptions -> IO ()
67−loop PSCiOptions{..} = do
68− config <- loadUserConfig
69− inputFiles <- concat <$> traverse glob psciInputFile
70− foreignFiles <- concat <$> traverse glob psciForeignInputFiles
71− modulesOrFirstError <- loadAllModules inputFiles
72− case modulesOrFirstError of
73− Left errs -> putStrLn (P.prettyPrintMultipleErrors False errs) >> exitFailure
74− Right modules -> do
75− historyFilename <- getHistoryFilename
76− let settings = defaultSettings { historyFile = Just historyFilename }
77− foreignsOrError <- runMake $ do
78− foreignFilesContent <- forM foreignFiles (\inFile -> (inFile,) <$> makeIO (const (P.ErrorMessage [] $ P.CannotReadFile inFile)) (readFile inFile))
79− P.parseForeignModulesFromFiles foreignFilesContent
80− case foreignsOrError of
81− Left errs -> putStrLn (P.prettyPrintMultipleErrors False errs) >> exitFailure
82− Right foreigns ->
83− flip evalStateT (mkPSCiState [] modules foreigns [] psciInputNodeFlags) . runInputT (setComplete completion settings) $ do
84− outputStrLn prologueMessage
85− traverse_ (traverse_ (runPSCI . handleCommand)) config
86− modules' <- lift $ gets psciLoadedModules
87− unless (consoleIsDefined (map snd modules')) . outputStrLn $ unlines
88− [ "PSCi requires the purescript-console module to be installed."
89− , "For help getting started, visit http://wiki.purescript.org/PSCi"
90− ]
91− go
92− where
93− go :: InputT (StateT PSCiState IO) ()
94− go = do
95− c <- getCommand (not psciMultiLineMode)
96− case c of
97− Left err -> outputStrLn err >> go
98− Right Nothing -> go
99− Right (Just QuitPSCi) -> outputStrLn quitMessage
100− Right (Just c') -> do
101− handleInterrupt (outputStrLn "Interrupted.")
102− (withInterrupt (runPSCI (loadAllImportedModules >> handleCommand c')))
103− go
104−
105−-- Compile the module
106−
107−-- |
108−-- Load all modules, updating the application state
109−--
110−loadAllImportedModules :: PSCI ()
111−loadAllImportedModules = do
112− files <- PSCI . lift $ fmap psciImportedFilenames get
113− modulesOrFirstError <- psciIO $ loadAllModules files
114− case modulesOrFirstError of
115− Left errs -> PSCI $ printErrors errs
116− Right modules -> PSCI . lift . modify $ updateModules modules
117−
118−-- | This is different than the runMake in 'Language.PureScript.Make' in that it specifies the
119−-- options and ignores the warning messages.
120−runMake :: P.Make a -> IO (Either P.MultipleErrors a)
121−runMake mk = fst <$> P.runMake P.defaultOptions mk
122−
123−makeIO :: (IOError -> P.ErrorMessage) -> IO a -> P.Make a
124−makeIO f io = do
125− e <- liftIO $ tryIOError io
126− either (throwError . P.singleError . f) return e
127−
128−make :: PSCiState -> [P.Module] -> P.Make P.Environment
129−make st@PSCiState{..} ms = P.make actions' (map snd loadedModules ++ ms)
130− where
131− filePathMap = M.fromList $ (first P.getModuleName . swap) `map` allModules
132− actions = P.buildMakeActions modulesDir filePathMap psciForeignFiles False
133− actions' = actions { P.progress = const (return ()) }
134− loadedModules = psciLoadedModules st
135− allModules = map (first Right) loadedModules ++ map (Left P.RebuildAlways,) ms
136−
137−
138−-- Commands
139−
140−-- |
141−-- Parses the input and returns either a Metacommand, or an error as a string.
142−--
143−getCommand :: Bool -> InputT (StateT PSCiState IO) (Either String (Maybe Command))
144−getCommand singleLineMode = handleInterrupt (return (Right Nothing)) $ do
145− firstLine <- withInterrupt $ getInputLine "> "
146− case firstLine of
147− Nothing -> return (Right (Just QuitPSCi)) -- Ctrl-D when input is empty
148− Just "" -> return (Right Nothing)
149− Just s | singleLineMode || head s == ':' -> return .fmap Just $ parseCommand s
150− Just s -> fmap Just . parseCommand <$> go [s]
151− where
152− go :: [String] -> InputT (StateT PSCiState IO) String
153− go ls = maybe (return . unlines $ reverse ls) (go . (:ls)) =<< getInputLine " "
154−
155−-- |
156−-- Performs an action for each meta-command given, and also for expressions.
157−--
158−handleCommand :: Command -> PSCI ()
159−handleCommand (Expression val) = handleExpression val
160−handleCommand ShowHelp = PSCI $ outputStrLn helpMessage
161−handleCommand (Import im) = handleImport im
162−handleCommand (Decls l) = handleDecls l
163−handleCommand (LoadFile filePath) = PSCI $ whenFileExists filePath $ \absPath -> do
164− m <- lift . lift $ loadModule absPath
165− case m of
166− Left err -> outputStrLn err
167− Right mods -> lift $ modify (updateModules (map (absPath,) mods))
168−handleCommand (LoadForeign filePath) = PSCI $ whenFileExists filePath $ \absPath -> do
169− foreignsOrError <- lift . lift . runMake $ do
170− foreignFile <- makeIO (const (P.ErrorMessage [] $ P.CannotReadFile absPath)) (readFile absPath)
171− P.parseForeignModulesFromFiles [(absPath, foreignFile)]
172− case foreignsOrError of
173− Left err -> outputStrLn $ P.prettyPrintMultipleErrors False err
174− Right foreigns -> lift $ modify (updateForeignFiles foreigns)
175−handleCommand ResetState = do
176− PSCI . lift . modify $ \st ->
177− st { psciImportedModules = []
178− , psciLetBindings = []
179− }
180− loadAllImportedModules
181−handleCommand (TypeOf val) = handleTypeOf val
182−handleCommand (KindOf typ) = handleKindOf typ
183−handleCommand (BrowseModule moduleName) = handleBrowse moduleName
184−handleCommand (ShowInfo QueryLoaded) = handleShowLoadedModules
185−handleCommand (ShowInfo QueryImport) = handleShowImportedModules
186−handleCommand QuitPSCi = P.internalError "`handleCommand QuitPSCi` was called. This is a bug."
187−
188−
189−-- |
190−-- Takes a value expression and evaluates it with the current state.
191−--
192−handleExpression :: P.Expr -> PSCI ()
193−handleExpression val = do
194− st <- PSCI $ lift get
195− let m = createTemporaryModule True st val
196− let nodeArgs = psciNodeFlags st ++ [indexFile]
197− e <- psciIO . runMake $ make st [supportModule, m]
198− case e of
199− Left errs -> PSCI $ printErrors errs
200− Right _ -> do
201− psciIO $ writeFile indexFile "require('$PSCI')['$main']();"
202− process <- psciIO findNodeProcess
203− result <- psciIO $ traverse (\node -> readProcessWithExitCode node nodeArgs "") process
204− case result of
205− Just (ExitSuccess, out, _) -> PSCI $ outputStrLn out
206− Just (ExitFailure _, _, err) -> PSCI $ outputStrLn err
207− Nothing -> PSCI $ outputStrLn "Couldn't find node.js"
208−
209−-- |
210−-- Takes a list of declarations and updates the environment, then run a make. If the declaration fails,
211−-- restore the original environment.
212−--
213−handleDecls :: [P.Declaration] -> PSCI ()
214−handleDecls ds = do
215− st <- PSCI $ lift get
216− let st' = updateLets ds st
217− let m = createTemporaryModule False st' (P.ObjectLiteral [])
218− e <- psciIO . runMake $ make st' [m]
219− case e of
220− Left err -> PSCI $ printErrors err
221− Right _ -> PSCI $ lift (put st')
222−
223−-- |
224−-- Show actual loaded modules in psci.
225−--
226−handleShowLoadedModules :: PSCI ()
227−handleShowLoadedModules = do
228− loadedModules <- PSCI $ lift $ gets psciLoadedModules
229− psciIO $ readModules loadedModules >>= putStrLn
230− return ()
231− where readModules = return . unlines . sort . nub . map toModuleName
232− toModuleName = N.runModuleName . (\ (P.Module _ _ mdName _ _) -> mdName) . snd
233−
234−-- |
235−-- Show the imported modules in psci.
236−--
237−handleShowImportedModules :: PSCI ()
238−handleShowImportedModules = do
239− PSCiState { psciImportedModules = importedModules } <- PSCI $ lift get
240− psciIO $ showModules importedModules >>= putStrLn
241− return ()
242− where
243− showModules = return . unlines . sort . map showModule
244− showModule (mn, declType, asQ) =
245− "import " ++ case asQ of
246− Just mn' -> "qualified " ++ N.runModuleName mn ++ " as " ++ N.runModuleName mn'
247− Nothing -> N.runModuleName mn ++ " " ++ showDeclType declType
248−
249− showDeclType P.Implicit = ""
250− showDeclType (P.Explicit refs) = refsList refs
251− showDeclType (P.Hiding refs) = " hiding " ++ refsList refs
252− refsList refs = " (" ++ commaList (map showRef refs) ++ ")"
253−
254− showRef :: P.DeclarationRef -> String
255− showRef (P.TypeRef pn dctors) = N.runProperName pn ++ "(" ++ maybe ".." (commaList . map N.runProperName) dctors ++ ")"
256− showRef (P.ValueRef ident) = N.runIdent ident
257− showRef (P.TypeClassRef pn) = N.runProperName pn
258− showRef (P.ProperRef pn) = pn
259− showRef (P.TypeInstanceRef ident) = N.runIdent ident
260− showRef (P.ModuleRef name) = "module " ++ N.runModuleName name
261− showRef (P.PositionedDeclarationRef _ _ ref) = showRef ref
262−
263− commaList :: [String] -> String
264− commaList = intercalate ", "
265−
266−-- |
267−-- Imports a module, preserving the initial state on failure.
268−--
269−handleImport :: ImportedModule -> PSCI ()
270−handleImport im = do
271− st <- updateImportedModules im <$> PSCI (lift get)
272− let m = createTemporaryModuleForImports st
273− e <- psciIO . runMake $ make st [m]
274− case e of
275− Left errs -> PSCI $ printErrors errs
276− Right _ -> do
277− PSCI $ lift $ put st
278− return ()
279−
280−-- |
281−-- Takes a value and prints its type
282−--
283−handleTypeOf :: P.Expr -> PSCI ()
284−handleTypeOf val = do
285− st <- PSCI $ lift get
286− let m = createTemporaryModule False st val
287− e <- psciIO . runMake $ make st [m]
288− case e of
289− Left errs -> PSCI $ printErrors errs
290− Right env' ->
291− case M.lookup (P.ModuleName [P.ProperName "$PSCI"], P.Ident "it") (P.names env') of
292− Just (ty, _, _) -> PSCI . outputStrLn . P.prettyPrintType $ ty
293− Nothing -> PSCI $ outputStrLn "Could not find type"
294−
295−-- |
296−-- Browse a module and displays its signature (if module exists).
297−--
298−handleBrowse :: P.ModuleName -> PSCI ()
299−handleBrowse moduleName = do
300− st <- PSCI $ lift get
301− env <- psciIO . runMake $ make st []
302− case env of
303− Left errs -> PSCI $ printErrors errs
304− Right env' ->
305− if isModInEnv moduleName st
306− then PSCI $ printModuleSignatures moduleName env'
307− else case lookupUnQualifiedModName moduleName st of
308− Just unQualifiedName ->
309− if isModInEnv unQualifiedName st
310− then PSCI $ printModuleSignatures unQualifiedName env'
311− else failNotInEnv moduleName
312− Nothing ->
313− failNotInEnv moduleName
314− where
315− isModInEnv modName =
316− any ((== modName) . P.getModuleName . snd) . psciLoadedModules
317− failNotInEnv modName =
318− PSCI $ outputStrLn $ "Module '" ++ N.runModuleName modName ++ "' is not valid."
319− lookupUnQualifiedModName quaModName st =
320− (\(modName,_,_) -> modName) <$> find ( \(_, _, mayQuaName) -> mayQuaName == Just quaModName) (psciImportedModules st)
321−
322−-- |
323−-- Takes a value and prints its kind
324−--
325−handleKindOf :: P.Type -> PSCI ()
326−handleKindOf typ = do
327− st <- PSCI $ lift get
328− let m = createTemporaryModuleForKind st typ
329− mName = P.ModuleName [P.ProperName "$PSCI"]
330− e <- psciIO . runMake $ make st [m]
331− case e of
332− Left errs -> PSCI $ printErrors errs
333− Right env' ->
334− case M.lookup (P.Qualified (Just mName) $ P.ProperName "IT") (P.typeSynonyms env') of
335− Just (_, typ') -> do
336− let chk = (P.emptyCheckState env') { P.checkCurrentModule = Just mName }
337− k = check (P.kindOf typ') chk
338−
339− check :: StateT P.CheckState (ExceptT P.MultipleErrors (Writer P.MultipleErrors)) a -> P.CheckState -> Either P.MultipleErrors (a, P.CheckState)
340− check sew cs = fst . runWriter . runExceptT . runStateT sew $ cs
341− case k of
342− Left errStack -> PSCI . outputStrLn . P.prettyPrintMultipleErrors False $ errStack
343− Right (kind, _) -> PSCI . outputStrLn . P.prettyPrintKind $ kind
344− Nothing -> PSCI $ outputStrLn "Could not find kind"
345−
346−-- Misc
347−
348−-- |
349−-- Attempts to read initial commands from '.psci' in the present working
350−-- directory then the user's home
351−--
352−loadUserConfig :: IO (Maybe [Command])
353−loadUserConfig = onFirstFileMatching readCommands pathGetters
354− where
355− pathGetters = [getCurrentDirectory, getHomeDirectory]
356− readCommands :: IO FilePath -> IO (Maybe [Command])
357− readCommands path = do
358− configFile <- (</> ".psci") <$> path
359− exists <- doesFileExist configFile
360− if exists
361− then do
362− ls <- lines <$> readFile configFile
363− case traverse parseCommand ls of
364− Left err -> print err >> exitFailure
365− Right cs -> return $ Just cs
366− else
367− return Nothing
368−
369−-- | Checks if the Console module is defined
370−consoleIsDefined :: [P.Module] -> Bool
371−consoleIsDefined = any ((== P.ModuleName (map P.ProperName [ "Control", "Monad", "Eff", "Console" ])) . P.getModuleName)
psci/PSCi/Completion.hsdeleted−226
@@ -1,226 +0,0 @@
1−{-# LANGUAGE DataKinds #-}
2−
3−module PSCi.Completion where
4−
5−import Prelude ()
6−import Prelude.Compat
7−
8−import Data.Maybe (mapMaybe)
9−import Data.List (nub, nubBy, sortBy, isPrefixOf, stripPrefix)
10−import Data.Char (isUpper)
11−import Data.Function (on)
12−
13−import Control.Arrow (second)
14−import Control.Monad.Trans.Reader (asks, runReaderT, ReaderT)
15−import Control.Monad.Trans.State.Strict
16−
17−import System.Console.Haskeline
18−
19−import qualified Language.PureScript as P
20−import qualified Language.PureScript.Names as N
21−
22−import qualified PSCi.Directive as D
23−import PSCi.Types
24−
25−-- Completions may read the state, but not modify it.
26−type CompletionM = ReaderT PSCiState IO
27−
28−-- Lift a `CompletionM` action to a `StateT PSCiState IO` one.
29−liftCompletionM :: CompletionM a -> StateT PSCiState IO a
30−liftCompletionM act = StateT (\s -> (\a -> (a, s)) <$> runReaderT act s)
31−
32−-- Haskeline completions
33−
34−data CompletionContext
35− = CtxDirective String
36− | CtxFilePath String
37− | CtxModule
38− | CtxIdentifier
39− | CtxType
40− | CtxFixed String
41− deriving (Show, Read)
42−
43−-- |
44−-- Loads module, function, and file completions.
45−--
46−completion :: CompletionFunc (StateT PSCiState IO)
47−completion = liftCompletionM . completion'
48−
49−completion' :: CompletionFunc CompletionM
50−completion' = completeWordWithPrev Nothing " \t\n\r" findCompletions
51−
52−-- |
53−-- Decide what kind of completion we need based on input. This function expects
54−-- a list of complete words (to the left of the cursor) as the first argument,
55−-- and the current word as the second argument.
56−completionContext :: [String] -> String -> [CompletionContext]
57−completionContext [] _ = [CtxDirective "", CtxIdentifier, CtxFixed "import"]
58−completionContext ws w | headSatisfies (":" `isPrefixOf`) ws = completeDirective ws w
59−completionContext ws w | headSatisfies (== "import") ws = completeImport ws w
60−completionContext _ _ = [CtxIdentifier]
61−
62−completeDirective :: [String] -> String -> [CompletionContext]
63−completeDirective ws w =
64− case ws of
65− [] -> [CtxDirective w]
66− [dir] -> case D.directivesFor <$> stripPrefix ":" dir of
67− -- only offer completions if the directive is unambiguous
68− Just [dir'] -> directiveArg w dir'
69− _ -> []
70−
71− -- All directives take exactly one argument. If we haven't yet matched,
72− -- that means one argument has already been supplied. So don't complete
73− -- any others.
74− _ -> []
75−
76−directiveArg :: String -> Directive -> [CompletionContext]
77−directiveArg _ Browse = [CtxModule]
78−directiveArg w Load = [CtxFilePath w]
79−directiveArg w Foreign = [CtxFilePath w]
80−directiveArg _ Quit = []
81−directiveArg _ Reset = []
82−directiveArg _ Help = []
83−directiveArg _ Show = map CtxFixed replQueryStrings
84−directiveArg _ Type = [CtxIdentifier]
85−directiveArg _ Kind = [CtxType]
86−
87−completeImport :: [String] -> String -> [CompletionContext]
88−completeImport ws w' =
89− case (ws, w') of
90− (["import"], w) | headSatisfies isUpper w -> [CtxModule]
91− (["import"], _) -> [CtxModule, CtxFixed "qualified"]
92− (["import", "qualified"], _) -> [CtxModule]
93− _ -> []
94−
95−headSatisfies :: (a -> Bool) -> [a] -> Bool
96−headSatisfies p str =
97− case str of
98− (c:_) -> p c
99− _ -> False
100−
101−-- | Callback for Haskeline's `completeWordWithPrev`.
102−-- Expects:
103−-- * Line contents to the left of the word, reversed
104−-- * Word to be completed
105−findCompletions :: String -> String -> CompletionM [Completion]
106−findCompletions prev word = do
107− let ctx = completionContext (words (reverse prev)) word
108− completions <- concat <$> traverse getCompletions ctx
109− return $ sortBy directivesFirst completions
110− where
111− getCompletions :: CompletionContext -> CompletionM [Completion]
112− getCompletions = fmap (mapMaybe (either (prefixedBy word) Just)) . getCompletion
113−
114− prefixedBy :: String -> String -> Maybe Completion
115− prefixedBy w cand = if w `isPrefixOf` cand
116− then Just (simpleCompletion cand)
117− else Nothing
118−
119−getCompletion :: CompletionContext -> CompletionM [Either String Completion]
120−getCompletion ctx =
121− case ctx of
122− CtxFilePath f -> map Right <$> listFiles f
123− CtxModule -> map Left <$> getModuleNames
124− CtxIdentifier -> map Left <$> ((++) <$> getIdentNames <*> getDctorNames)
125− CtxType -> map Left <$> getTypeNames
126− CtxFixed str -> return [Left str]
127− CtxDirective d -> return (map Left (completeDirectives d))
128−
129− where
130− completeDirectives :: String -> [String]
131− completeDirectives = map (':' :) . D.directiveStringsFor
132−
133−
134−getLoadedModules :: CompletionM [P.Module]
135−getLoadedModules = asks (map snd . psciLoadedModules)
136−
137−getImportedModules :: CompletionM [ImportedModule]
138−getImportedModules = asks psciImportedModules
139−
140−getModuleNames :: CompletionM [String]
141−getModuleNames = moduleNames <$> getLoadedModules
142−
143−mapLoadedModulesAndQualify :: (a -> String) -> (P.Module -> [(a, P.Declaration)]) -> CompletionM [String]
144−mapLoadedModulesAndQualify sho f = do
145− ms <- getLoadedModules
146− let argPairs = do m <- ms
147− fm <- f m
148− return (m, fm)
149− concat <$> traverse (uncurry (getAllQualifications sho)) argPairs
150−
151−getIdentNames :: CompletionM [String]
152−getIdentNames = mapLoadedModulesAndQualify P.showIdent identNames
153−
154−getDctorNames :: CompletionM [String]
155−getDctorNames = mapLoadedModulesAndQualify P.runProperName dctorNames
156−
157−getTypeNames :: CompletionM [String]
158−getTypeNames = mapLoadedModulesAndQualify P.runProperName typeDecls
159−
160−-- | Given a module and a declaration in that module, return all possible ways
161−-- it could have been referenced given the current PSCiState - including fully
162−-- qualified, qualified using an alias, and unqualified.
163−getAllQualifications :: (a -> String) -> P.Module -> (a, P.Declaration) -> CompletionM [String]
164−getAllQualifications sho m (declName, decl) = do
165− imports <- getAllImportsOf m
166− let fullyQualified = qualifyWith (Just (P.getModuleName m))
167− let otherQuals = nub (concatMap qualificationsUsing imports)
168− return $ fullyQualified : otherQuals
169− where
170− qualifyWith mMod = P.showQualified sho (P.Qualified mMod declName)
171− referencedBy refs = P.isExported (Just refs) decl
172−
173− qualificationsUsing (_, importType, asQ') =
174− let q = qualifyWith asQ'
175− in case importType of
176− P.Implicit -> [q]
177− P.Explicit refs -> [q | referencedBy refs]
178− P.Hiding refs -> [q | not $ referencedBy refs]
179−
180−
181−-- | Returns all the ImportedModule values referring to imports of a particular
182−-- module.
183−getAllImportsOf :: P.Module -> CompletionM [ImportedModule]
184−getAllImportsOf = asks . allImportsOf
185−
186−nubOnFst :: Eq a => [(a, b)] -> [(a, b)]
187−nubOnFst = nubBy ((==) `on` fst)
188−
189−typeDecls :: P.Module -> [(N.ProperName 'N.TypeName, P.Declaration)]
190−typeDecls = mapMaybe getTypeName . filter P.isDataDecl . P.exportedDeclarations
191− where
192− getTypeName :: P.Declaration -> Maybe (N.ProperName 'N.TypeName, P.Declaration)
193− getTypeName d@(P.TypeSynonymDeclaration name _ _) = Just (name, d)
194− getTypeName d@(P.DataDeclaration _ name _ _) = Just (name, d)
195− getTypeName (P.PositionedDeclaration _ _ d) = getTypeName d
196− getTypeName _ = Nothing
197−
198−identNames :: P.Module -> [(N.Ident, P.Declaration)]
199−identNames = nubOnFst . concatMap getDeclNames . P.exportedDeclarations
200− where
201− getDeclNames :: P.Declaration -> [(P.Ident, P.Declaration)]
202− getDeclNames d@(P.ValueDeclaration ident _ _ _) = [(ident, d)]
203− getDeclNames d@(P.TypeDeclaration ident _ ) = [(ident, d)]
204− getDeclNames d@(P.ExternDeclaration ident _) = [(ident, d)]
205− getDeclNames d@(P.TypeClassDeclaration _ _ _ ds) = map (second (const d)) $ concatMap getDeclNames ds
206− getDeclNames (P.PositionedDeclaration _ _ d) = getDeclNames d
207− getDeclNames _ = []
208−
209−dctorNames :: P.Module -> [(N.ProperName 'N.ConstructorName, P.Declaration)]
210−dctorNames = nubOnFst . concatMap go . P.exportedDeclarations
211− where
212− go :: P.Declaration -> [(N.ProperName 'N.ConstructorName, P.Declaration)]
213− go decl@(P.DataDeclaration _ _ _ ctors) = map (\n -> (n, decl)) (map fst ctors)
214− go (P.PositionedDeclaration _ _ d) = go d
215− go _ = []
216−
217−moduleNames :: [P.Module] -> [String]
218−moduleNames ms = nub [P.runModuleName moduleName | P.Module _ _ moduleName _ _ <- ms]
219−
220−directivesFirst :: Completion -> Completion -> Ordering
221−directivesFirst (Completion _ d1 _) (Completion _ d2 _) = go d1 d2
222− where
223− go (':' : xs) (':' : ys) = compare xs ys
224− go (':' : _) _ = LT
225− go _ (':' : _) = GT
226− go xs ys = compare xs ys
psci/PSCi/Directive.hsdeleted−119
@@ -1,119 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Directive
4−-- Copyright :
5−-- License : MIT
6−--
7−-- Maintainer :
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Directives for PSCI.
13−--
14−-----------------------------------------------------------------------------
15−
16−module PSCi.Directive where
17−
18−import Prelude ()
19−import Prelude.Compat
20−
21−
22−import Data.Maybe (fromJust, listToMaybe)
23−import Data.List (isPrefixOf)
24−import Data.Tuple (swap)
25−
26−import PSCi.Types
27−
28−-- |
29−-- List of all avaliable directives.
30−--
31−directives :: [Directive]
32−directives = map fst directiveStrings
33−
34−-- |
35−-- A mapping of directives to the different strings that can be used to invoke
36−-- them.
37−--
38−directiveStrings :: [(Directive, [String])]
39−directiveStrings =
40− [ (Help , ["?", "help"])
41− , (Quit , ["quit"])
42− , (Reset , ["reset"])
43− , (Browse , ["browse"])
44− , (Load , ["load", "module"])
45− , (Foreign, ["foreign"])
46− , (Type , ["type"])
47− , (Kind , ["kind"])
48− , (Show , ["show"])
49− ]
50−
51−-- |
52−-- Like directiveStrings, but the other way around.
53−--
54−directiveStrings' :: [(String, Directive)]
55−directiveStrings' = concatMap go directiveStrings
56− where
57− go (dir, strs) = map (\s -> (s, dir)) strs
58−
59−-- |
60−-- List of all directive strings.
61−--
62−strings :: [String]
63−strings = concatMap snd directiveStrings
64−
65−-- |
66−-- Returns all possible string representations of a directive.
67−--
68−stringsFor :: Directive -> [String]
69−stringsFor d = fromJust (lookup d directiveStrings)
70−
71−-- |
72−-- Returns the default string representation of a directive.
73−--
74−stringFor :: Directive -> String
75−stringFor = head . stringsFor
76−
77−-- |
78−-- Returns the list of directives which could be expanded from the string
79−-- argument, together with the string alias that matched.
80−--
81−directivesFor' :: String -> [(Directive, String)]
82−directivesFor' str = go directiveStrings'
83− where
84− go = map swap . filter ((str `isPrefixOf`) . fst)
85−
86−directivesFor :: String -> [Directive]
87−directivesFor = map fst . directivesFor'
88−
89−directiveStringsFor :: String -> [String]
90−directiveStringsFor = map snd . directivesFor'
91−
92−parseDirective :: String -> Maybe Directive
93−parseDirective = listToMaybe . directivesFor
94−
95−-- |
96−-- True if the given directive takes an argument, false otherwise.
97−hasArgument :: Directive -> Bool
98−hasArgument Help = False
99−hasArgument Quit = False
100−hasArgument Reset = False
101−hasArgument _ = True
102−
103−-- |
104−-- The help menu.
105−--
106−help :: [(Directive, String, String)]
107−help =
108− [ (Help, "", "Show this help menu")
109− , (Quit, "", "Quit PSCi")
110− , (Reset, "", "Discard all imported modules and declared bindings")
111− , (Browse, "<module>", "See all functions in <module>")
112− , (Load, "<file>", "Load <file> for importing")
113− , (Foreign, "<file>", "Load foreign module <file>")
114− , (Type, "<expr>", "Show the type of <expr>")
115− , (Kind, "<type>", "Show the kind of <type>")
116− , (Show, "import", "Show all imported modules")
117− , (Show, "loaded", "Show all loaded modules")
118− ]
119−
psci/PSCi/IO.hsdeleted−68
@@ -1,68 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : IO
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−--
13−-----------------------------------------------------------------------------
14−
15−module PSCi.IO where
16−
17−import Prelude ()
18−import Prelude.Compat
19−
20−import System.Directory (createDirectoryIfMissing, getHomeDirectory, findExecutable, doesFileExist)
21−import System.FilePath (takeDirectory, (</>), isPathSeparator)
22−import Control.Monad.Trans.Maybe (MaybeT(..), runMaybeT)
23−import Control.Monad (msum)
24−import Control.Monad.IO.Class (MonadIO, liftIO)
25−import System.Console.Haskeline (outputStrLn, InputT)
26−
27−mkdirp :: FilePath -> IO ()
28−mkdirp = createDirectoryIfMissing True . takeDirectory
29−
30−-- File helpers
31−
32−onFirstFileMatching :: Monad m => (b -> m (Maybe a)) -> [b] -> m (Maybe a)
33−onFirstFileMatching f pathVariants = runMaybeT . msum $ map (MaybeT . f) pathVariants
34−
35−-- |
36−-- Locates the node executable.
37−-- Checks for either @nodejs@ or @node@.
38−--
39−findNodeProcess :: IO (Maybe String)
40−findNodeProcess = onFirstFileMatching findExecutable names
41− where names = ["nodejs", "node"]
42−
43−-- |
44−-- Grabs the filename where the history is stored.
45−--
46−getHistoryFilename :: IO FilePath
47−getHistoryFilename = do
48− home <- getHomeDirectory
49− let filename = home </> ".purescript" </> "psci_history"
50− mkdirp filename
51− return filename
52−
53−
54−-- |
55−-- Expands tilde in path.
56−--
57−expandTilde :: FilePath -> IO FilePath
58−expandTilde ('~':p:rest) | isPathSeparator p = (</> rest) <$> getHomeDirectory
59−expandTilde p = return p
60−
61−
62−whenFileExists :: MonadIO m => FilePath -> (FilePath -> InputT m ()) -> InputT m ()
63−whenFileExists filePath f = do
64− absPath <- liftIO $ expandTilde filePath
65− exists <- liftIO $ doesFileExist absPath
66− if exists
67− then f absPath
68− else outputStrLn $ "Couldn't locate: " ++ filePath
psci/PSCi/Message.hsdeleted−53
@@ -1,53 +0,0 @@
1−module PSCi.Message where
2−
3−
4−import Data.List (intercalate)
5−import qualified PSCi.Directive as D
6−import PSCi.Types
7−
8−-- Messages
9−
10−-- |
11−-- The help message.
12−--
13−helpMessage :: String
14−helpMessage = "The following commands are available:\n\n " ++
15− intercalate "\n " (map line D.help) ++
16− "\n\n" ++ extraHelp
17− where
18− line :: (Directive, String, String) -> String
19− line (dir, arg, desc) =
20− let cmd = ':' : D.stringFor dir
21− in unwords [ cmd
22− , replicate (11 - length cmd) ' '
23− , arg
24− , replicate (11 - length arg) ' '
25− , desc
26− ]
27−
28− extraHelp =
29− "Further information is available on the PureScript wiki:\n" ++
30− " --> https://github.com/purescript/purescript/wiki/psci"
31−
32−
33−-- |
34−-- The welcome prologue.
35−--
36−prologueMessage :: String
37−prologueMessage = intercalate "\n"
38− [ " ____ ____ _ _ "
39− , "| _ \\ _ _ _ __ ___/ ___| ___ _ __(_)_ __ | |_ "
40− , "| |_) | | | | '__/ _ \\___ \\ / __| '__| | '_ \\| __|"
41− , "| __/| |_| | | | __/___) | (__| | | | |_) | |_ "
42− , "|_| \\__,_|_| \\___|____/ \\___|_| |_| .__/ \\__|"
43− , " |_| "
44− , ""
45− , ":? shows help"
46− ]
47−
48−-- |
49−-- The quit message.
50−--
51−quitMessage :: String
52−quitMessage = "See ya!"
53−
psci/PSCi/Module.hsdeleted−106
@@ -1,106 +0,0 @@
1−module PSCi.Module where
2−
3−import Prelude ()
4−import Prelude.Compat
5−
6−import qualified Language.PureScript as P
7−import PSCi.Types
8−import System.FilePath (pathSeparator)
9−import Control.Monad
10−
11−-- | The name of the PSCI support module
12−supportModuleName :: P.ModuleName
13−supportModuleName = P.ModuleName [P.ProperName "$PSCI", P.ProperName "Support"]
14−
15−-- | Support module, contains code to evaluate terms
16−supportModule :: P.Module
17−supportModule =
18− case P.parseModulesFromFiles id [("", code)] of
19− Right [(_, P.Module ss cs _ ds exps)] -> P.Module ss cs supportModuleName ds exps
20− _ -> P.internalError "Support module could not be parsed"
21− where
22− code :: String
23− code = unlines
24− [ "module S where"
25− , ""
26− , "import Prelude"
27− , "import Control.Monad.Eff"
28− , "import Control.Monad.Eff.Console"
29− , "import Control.Monad.Eff.Unsafe"
30− , ""
31− , "class Eval a where"
32− , " eval :: a -> Eff (console :: CONSOLE) Unit"
33− , ""
34− , "instance evalShow :: (Show a) => Eval a where"
35− , " eval = print"
36− , ""
37− , "instance evalEff :: (Eval a) => Eval (Eff eff a) where"
38− , " eval x = unsafeInterleaveEff x >>= eval"
39− ]
40−
41−-- Module Management
42−
43−-- |
44−-- Loads a file for use with imports.
45−--
46−loadModule :: FilePath -> IO (Either String [P.Module])
47−loadModule filename = do
48− content <- readFile filename
49− return $ either (Left . P.prettyPrintMultipleErrors False) (Right . map snd) $ P.parseModulesFromFiles id [(filename, content)]
50−
51−-- |
52−-- Load all modules.
53−--
54−loadAllModules :: [FilePath] -> IO (Either P.MultipleErrors [(FilePath, P.Module)])
55−loadAllModules files = do
56− filesAndContent <- forM files $ \filename -> do
57− content <- readFile filename
58− return (filename, content)
59− return $ P.parseModulesFromFiles id filesAndContent
60−
61−
62−-- |
63−-- Makes a volatile module to execute the current expression.
64−--
65−createTemporaryModule :: Bool -> PSCiState -> P.Expr -> P.Module
66−createTemporaryModule exec PSCiState{psciImportedModules = imports, psciLetBindings = lets} val =
67− let
68− moduleName = P.ModuleName [P.ProperName "$PSCI"]
69− trace = P.Var (P.Qualified (Just supportModuleName) (P.Ident "eval"))
70− mainValue = P.App trace (P.Var (P.Qualified Nothing (P.Ident "it")))
71− itDecl = P.ValueDeclaration (P.Ident "it") P.Public [] $ Right val
72− mainDecl = P.ValueDeclaration (P.Ident "$main") P.Public [] $ Right mainValue
73− decls = if exec then [itDecl, mainDecl] else [itDecl]
74− in
75− P.Module (P.internalModuleSourceSpan "<internal>") [] moduleName ((importDecl `map` imports) ++ lets ++ decls) Nothing
76−
77−
78−-- |
79−-- Makes a volatile module to hold a non-qualified type synonym for a fully-qualified data type declaration.
80−--
81−createTemporaryModuleForKind :: PSCiState -> P.Type -> P.Module
82−createTemporaryModuleForKind PSCiState{psciImportedModules = imports, psciLetBindings = lets} typ =
83− let
84− moduleName = P.ModuleName [P.ProperName "$PSCI"]
85− itDecl = P.TypeSynonymDeclaration (P.ProperName "IT") [] typ
86− in
87− P.Module (P.internalModuleSourceSpan "<internal>") [] moduleName ((importDecl `map` imports) ++ lets ++ [itDecl]) Nothing
88−
89−-- |
90−-- Makes a volatile module to execute the current imports.
91−--
92−createTemporaryModuleForImports :: PSCiState -> P.Module
93−createTemporaryModuleForImports PSCiState{psciImportedModules = imports} =
94− let
95− moduleName = P.ModuleName [P.ProperName "$PSCI"]
96− in
97− P.Module (P.internalModuleSourceSpan "<internal>") [] moduleName (importDecl `map` imports) Nothing
98−
99−importDecl :: ImportedModule -> P.Declaration
100−importDecl (mn, declType, asQ) = P.ImportDeclaration mn declType asQ False
101−
102−indexFile :: FilePath
103−indexFile = ".psci_modules" ++ pathSeparator : "index.js"
104−
105−modulesDir :: FilePath
106−modulesDir = ".psci_modules" ++ pathSeparator : "node_modules"
psci/PSCi/Option.hsdeleted−57
@@ -1,57 +0,0 @@
1−module PSCi.Option (
2− getOpt
3−) where
4−
5−import Prelude ()
6−import Prelude.Compat
7−
8−import Options.Applicative as Opts
9−import Data.Version (showVersion)
10−
11−import PSCi.Types
12−import qualified Paths_purescript as Paths
13−
14−-- Parse Command line option
15−
16−multiLineMode :: Parser Bool
17−multiLineMode = switch $
18− long "multi-line-mode"
19− <> short 'm'
20− <> Opts.help "Run in multi-line mode (use ^D to terminate commands)"
21−
22−inputFile :: Parser FilePath
23−inputFile = strArgument $
24− metavar "FILE"
25− <> Opts.help "Optional .purs files to load on start"
26−
27−inputForeignFile :: Parser FilePath
28−inputForeignFile = strOption $
29− short 'f'
30− <> long "ffi"
31− <> help "The input .js file(s) providing foreign import implementations"
32−
33−nodeFlagsFlag :: Parser [String]
34−nodeFlagsFlag = option parser $
35− long "node-opts"
36− <> metavar "NODE_OPTS"
37− <> value []
38− <> Opts.help "Flags to pass to node, separated by spaces"
39− where
40− parser = words <$> str
41−
42−psciOptions :: Parser PSCiOptions
43−psciOptions = PSCiOptions <$> multiLineMode
44− <*> many inputFile
45− <*> many inputForeignFile
46− <*> nodeFlagsFlag
47−
48−version :: Parser (a -> a)
49−version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> Opts.help "Show the version number" <> hidden
50−
51−getOpt :: IO PSCiOptions
52−getOpt = execParser opts
53− where
54− opts = info (version <*> helper <*> psciOptions) infoModList
55− infoModList = fullDesc <> headerInfo <> footerInfo
56− headerInfo = header "psci - Interactive mode for PureScript"
57− footerInfo = footer $ "psci " ++ showVersion Paths.version
psci/PSCi/Parser.hsdeleted−140
@@ -1,140 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Parser
4−-- Copyright : (c) Phil Freeman 2014
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Parser for PSCI.
13−--
14−-----------------------------------------------------------------------------
15−
16−module PSCi.Parser
17− ( parseCommand
18− ) where
19−
20−import Prelude ()
21−import Prelude.Compat hiding (lex)
22−
23−import Data.Char (isSpace)
24−import Data.List (intercalate)
25−
26−import Text.Parsec hiding ((<|>))
27−
28−import qualified Language.PureScript as P
29−import Language.PureScript.Parser.Common (mark, same)
30−
31−import qualified PSCi.Directive as D
32−import PSCi.Types
33−
34−-- |
35−-- Parses PSCI metacommands or expressions input from the user.
36−--
37−parseCommand :: String -> Either String Command
38−parseCommand cmdString =
39− case cmdString of
40− (':' : cmd) -> parseDirective cmd
41− _ -> parseRest psciCommand cmdString
42−
43−parseRest :: P.TokenParser a -> String -> Either String a
44−parseRest p s = either (Left . show) Right $ do
45− ts <- P.lex "" s
46− P.runTokenParser "" (p <* eof) ts
47−
48−psciCommand :: P.TokenParser Command
49−psciCommand = choice (map try parsers)
50− where
51− parsers =
52− [ psciLet
53− , psciImport
54− , psciOtherDeclaration
55− , psciExpression
56− ]
57−
58−trim :: String -> String
59−trim = trimEnd . trimStart
60−
61−trimStart :: String -> String
62−trimStart = dropWhile isSpace
63−
64−trimEnd :: String -> String
65−trimEnd = reverse . trimStart . reverse
66−
67−parseDirective :: String -> Either String Command
68−parseDirective cmd =
69− case D.directivesFor' dstr of
70− [(d, _)] -> commandFor d
71− [] -> Left "Unrecognized directive. Type :? for help."
72− ds -> Left ("Ambiguous directive. Possible matches: " ++
73− intercalate ", " (map snd ds) ++ ". Type :? for help.")
74− where
75− (dstr, arg) = break isSpace cmd
76−
77− commandFor d = case d of
78− Help -> return ShowHelp
79− Quit -> return QuitPSCi
80− Reset -> return ResetState
81− Browse -> BrowseModule <$> parseRest P.moduleName arg
82− Load -> return $ LoadFile (trim arg)
83− Foreign -> return $ LoadForeign (trim arg)
84− Show -> ShowInfo <$> parseReplQuery' (trim arg)
85− Type -> TypeOf <$> parseRest P.parseValue arg
86− Kind -> KindOf <$> parseRest P.parseType arg
87−
88−-- |
89−-- Parses expressions entered at the PSCI repl.
90−--
91−psciExpression :: P.TokenParser Command
92−psciExpression = Expression <$> P.parseValue
93−
94−-- |
95−-- PSCI version of @let@.
96−-- This is essentially let from do-notation.
97−-- However, since we don't support the @Eff@ monad,
98−-- we actually want the normal @let@.
99−--
100−psciLet :: P.TokenParser Command
101−psciLet = Decls <$> (P.reserved "let" *> P.indented *> manyDecls)
102− where
103− manyDecls :: P.TokenParser [P.Declaration]
104− manyDecls = mark (many1 (same *> P.parseLocalDeclaration))
105−
106−-- | Imports must be handled separately from other declarations, so that
107−-- :show import works, for example.
108−psciImport :: P.TokenParser Command
109−psciImport = do
110− (mn, declType, asQ, _) <- P.parseImportDeclaration'
111− return $ Import (mn, declType, asQ)
112−
113−-- | Any other declaration that we don't need a 'special case' parser for
114−-- (like let or import declarations).
115−psciOtherDeclaration :: P.TokenParser Command
116−psciOtherDeclaration = Decls . (:[]) <$> do
117− decl <- discardPositionInfo <$> P.parseDeclaration
118− if acceptable decl
119− then return decl
120− else fail "this kind of declaration is not supported in psci"
121−
122−discardPositionInfo :: P.Declaration -> P.Declaration
123−discardPositionInfo (P.PositionedDeclaration _ _ d) = d
124−discardPositionInfo d = d
125−
126−acceptable :: P.Declaration -> Bool
127−acceptable P.DataDeclaration{} = True
128−acceptable P.TypeSynonymDeclaration{} = True
129−acceptable P.ExternDeclaration{} = True
130−acceptable P.ExternDataDeclaration{} = 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/PSCi/Printer.hsdeleted−131
@@ -1,131 +0,0 @@
1−{-# LANGUAGE RecordWildCards #-}
2−{-# LANGUAGE DataKinds #-}
3−
4−module PSCi.Printer where
5−
6−import Prelude ()
7−import Prelude.Compat
8−
9−import qualified Language.PureScript as P
10−import qualified Text.PrettyPrint.Boxes as Box
11−import qualified Data.Map as M
12−import System.Console.Haskeline
13−import Data.Maybe (mapMaybe)
14−import Data.List (intersperse)
15−import Control.Monad.IO.Class (MonadIO)
16−
17−-- Printers
18−
19−-- |
20−-- Pretty print a module's signatures
21−--
22−printModuleSignatures :: MonadIO m => P.ModuleName -> P.Environment -> InputT m ()
23−printModuleSignatures moduleName (P.Environment {..}) =
24− -- get relevant components of a module from environment
25− let moduleNamesIdent = (filter ((== moduleName) . fst) . M.keys) names
26− moduleTypeClasses = (filter (\(P.Qualified maybeName _) -> maybeName == Just moduleName) . M.keys) typeClasses
27− moduleTypes = (filter (\(P.Qualified maybeName _) -> maybeName == Just moduleName) . M.keys) types
28−
29− in
30− -- print each component
31− (outputStr . unlines . map trimEnd . lines . Box.render . Box.vsep 1 Box.left)
32− [ printModule's (mapMaybe (showTypeClass . findTypeClass typeClasses)) moduleTypeClasses -- typeClasses
33− , printModule's (mapMaybe (showType typeClasses dataConstructors typeSynonyms . findType types)) moduleTypes -- types
34− , printModule's (map (showNameType . findNameType names)) moduleNamesIdent -- functions
35− ]
36−
37− where printModule's showF = Box.vsep 1 Box.left . showF
38−
39− findNameType :: 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))
40− findNameType envNames m@(_, mIdent) = (mIdent, M.lookup m envNames)
41−
42− showNameType :: (P.Ident, Maybe (P.Type, P.NameKind, P.NameVisibility)) -> Box.Box
43− showNameType (mIdent, Just (mType, _, _)) = Box.text (P.showIdent mIdent ++ " :: ") Box.<> P.typeAsBox mType
44− showNameType _ = P.internalError "The impossible happened in printModuleSignatures."
45−
46− findTypeClass
47− :: M.Map (P.Qualified (P.ProperName 'P.ClassName)) ([(String, Maybe P.Kind)], [(P.Ident, P.Type)], [P.Constraint])
48− -> P.Qualified (P.ProperName 'P.ClassName)
49− -> (P.Qualified (P.ProperName 'P.ClassName), Maybe ([(String, Maybe P.Kind)], [(P.Ident, P.Type)], [P.Constraint]))
50− findTypeClass envTypeClasses name = (name, M.lookup name envTypeClasses)
51−
52− showTypeClass
53− :: (P.Qualified (P.ProperName 'P.ClassName), Maybe ([(String, Maybe P.Kind)], [(P.Ident, P.Type)], [P.Constraint]))
54− -> Maybe Box.Box
55− showTypeClass (_, Nothing) = Nothing
56− showTypeClass (P.Qualified _ name, Just (vars, body, constrs)) =
57− let constraints =
58− if null constrs
59− then Box.text ""
60− else Box.text "("
61− Box.<> Box.hcat Box.left (intersperse (Box.text ", ") $ map (\(P.Qualified _ pn, lt) -> Box.text (P.runProperName pn) Box.<+> Box.hcat Box.left (map P.typeAtomAsBox lt)) constrs)
62− Box.<> Box.text ") <= "
63− className =
64− Box.text (P.runProperName name)
65− Box.<> Box.text (concatMap ((' ':) . fst) vars)
66− classBody =
67− Box.vcat Box.top (map (\(i, t) -> Box.text (P.showIdent i ++ " ::") Box.<+> P.typeAsBox t) body)
68−
69− in
70− Just $
71− (Box.text "class "
72− Box.<> constraints
73− Box.<> className
74− Box.<+> if null body then Box.text "" else Box.text "where")
75− Box.// Box.moveRight 2 classBody
76−
77−
78− findType
79− :: M.Map (P.Qualified (P.ProperName 'P.TypeName)) (P.Kind, P.TypeKind)
80− -> P.Qualified (P.ProperName 'P.TypeName)
81− -> (P.Qualified (P.ProperName 'P.TypeName), Maybe (P.Kind, P.TypeKind))
82− findType envTypes name = (name, M.lookup name envTypes)
83−
84− showType
85− :: M.Map (P.Qualified (P.ProperName 'P.ClassName)) ([(String, Maybe P.Kind)], [(P.Ident, P.Type)], [P.Constraint])
86− -> M.Map (P.Qualified (P.ProperName 'P.ConstructorName)) (P.DataDeclType, P.ProperName 'P.TypeName, P.Type, [P.Ident])
87− -> M.Map (P.Qualified (P.ProperName 'P.TypeName)) ([(String, Maybe P.Kind)], P.Type)
88− -> (P.Qualified (P.ProperName 'P.TypeName), Maybe (P.Kind, P.TypeKind))
89− -> Maybe Box.Box
90− showType typeClassesEnv dataConstructorsEnv typeSynonymsEnv (n@(P.Qualified modul name), typ) =
91− case (typ, M.lookup n typeSynonymsEnv) of
92− (Just (_, P.TypeSynonym), Just (typevars, dtType)) ->
93− if M.member (fmap P.coerceProperName n) typeClassesEnv
94− then
95− Nothing
96− else
97− Just $
98− Box.text ("type " ++ P.runProperName name ++ concatMap ((' ':) . fst) typevars)
99− Box.// Box.moveRight 2 (Box.text "=" Box.<+> P.typeAsBox dtType)
100−
101− (Just (_, P.DataType typevars pt), _) ->
102− let prefix =
103− case pt of
104− [(dtProperName,_)] ->
105− case M.lookup (P.Qualified modul dtProperName) dataConstructorsEnv of
106− Just (dataDeclType, _, _, _) -> P.showDataDeclType dataDeclType
107− _ -> "data"
108− _ -> "data"
109−
110− in
111− Just $ Box.text (prefix ++ " " ++ P.runProperName name ++ concatMap ((' ':) . fst) typevars) Box.// printCons pt
112−
113− _ ->
114− Nothing
115−
116− where printCons pt =
117− Box.moveRight 2 $
118− Box.vcat Box.left $
119− mapFirstRest (Box.text "=" Box.<+>) (Box.text "|" Box.<+>) $
120− map (\(cons,idents) -> (Box.text (P.runProperName cons) Box.<> Box.hcat Box.left (map prettyPrintType idents))) pt
121−
122− prettyPrintType t = Box.text " " Box.<> P.typeAtomAsBox t
123−
124− mapFirstRest _ _ [] = []
125− mapFirstRest f g (x:xs) = f x : map g xs
126−
127− trimEnd = reverse . dropWhile (== ' ') . reverse
128−
129−-- | Pretty-print errors
130−printErrors :: MonadIO m => P.MultipleErrors -> InputT m ()
131−printErrors = outputStrLn . P.prettyPrintMultipleErrors False
psci/PSCi/Types.hsdeleted−218
@@ -1,218 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Types
4−-- Copyright : (c) Phil Freeman 2014
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Type declarations and associated basic functions for PSCI.
13−--
14−-----------------------------------------------------------------------------
15−
16−module PSCi.Types where
17−
18−import Prelude ()
19−import Prelude.Compat
20−
21−import Control.Arrow (second)
22−import Data.Map (Map)
23−import qualified Data.Map as Map
24−import qualified Language.PureScript as P
25−
26−data PSCiOptions = PSCiOptions
27− { psciMultiLineMode :: Bool
28− , psciInputFile :: [FilePath]
29− , psciForeignInputFiles :: [FilePath]
30− , psciInputNodeFlags :: [String]
31− }
32−
33−-- |
34−-- The PSCI state.
35−-- Holds a list of imported modules, loaded files, and partial let bindings.
36−-- The let bindings are partial,
37−-- because it makes more sense to apply the binding to the final evaluated expression.
38−--
39−data PSCiState = PSCiState
40− { psciImportedModules :: [ImportedModule]
41− , _psciLoadedModules :: Map FilePath [P.Module]
42− , psciForeignFiles :: Map P.ModuleName FilePath
43− , psciLetBindings :: [P.Declaration]
44− , psciNodeFlags :: [String]
45− }
46−
47−initialPSCiState :: PSCiState
48−initialPSCiState =
49− PSCiState [] Map.empty Map.empty [] []
50−
51−mkPSCiState :: [ImportedModule]
52− -> [(FilePath, P.Module)]
53− -> Map P.ModuleName FilePath
54− -> [P.Declaration]
55− -> [String]
56− -> PSCiState
57−mkPSCiState imported loaded foreigns lets nodeFlags =
58− (initialPSCiState
59− |> each imported updateImportedModules
60− |> updateModules loaded)
61− { psciForeignFiles = foreigns
62− , psciLetBindings = lets
63− , psciNodeFlags = nodeFlags
64− }
65− where
66− x |> f = f x
67− each xs f st = foldl (flip f) st xs
68−
69−-- Public psci state accessors
70−
71−-- | Get the imported filenames as a list.
72−psciImportedFilenames :: PSCiState -> [FilePath]
73−psciImportedFilenames = Map.keys . _psciLoadedModules
74−
75−-- | Get the loaded modules as a list.
76−psciLoadedModules :: PSCiState -> [(FilePath, P.Module)]
77−psciLoadedModules = collect . Map.toList . _psciLoadedModules
78− where
79− collect :: [(k, [v])] -> [(k, v)]
80− collect vss = [ (k, v) | (k, vs) <- vss, v <- vs ]
81−
82−-- | All of the data that is contained by an ImportDeclaration in the AST.
83−-- That is:
84−--
85−-- * A module name, the name of the module which is being imported
86−-- * An ImportDeclarationType which specifies whether there is an explicit
87−-- import list, a hiding list, or neither.
88−-- * If the module is imported qualified, its qualified name in the importing
89−-- module. Otherwise, Nothing.
90−--
91−type ImportedModule = (P.ModuleName, P.ImportDeclarationType, Maybe P.ModuleName)
92−
93−psciImportedModuleNames :: PSCiState -> [P.ModuleName]
94−psciImportedModuleNames (PSCiState{psciImportedModules = is}) =
95− map (\(mn, _, _) -> mn) is
96−
97−allImportsOf :: P.Module -> PSCiState -> [ImportedModule]
98−allImportsOf m (PSCiState{psciImportedModules = is}) =
99− filter isImportOfThis is
100− where
101− name = P.getModuleName m
102− isImportOfThis (name', _, _) = name == name'
103−
104−-- State helpers
105−
106−-- |
107−-- Updates the state to have more imported modules.
108−--
109−updateImportedModules :: ImportedModule -> PSCiState -> PSCiState
110−updateImportedModules im st = st { psciImportedModules = im : psciImportedModules st }
111−
112−-- |
113−-- Updates the state to have more loaded modules (available for import, but
114−-- not necessarily imported).
115−--
116−updateModules :: [(FilePath, P.Module)] -> PSCiState -> PSCiState
117−updateModules modules st =
118− st { _psciLoadedModules = Map.union (go modules) (_psciLoadedModules st) }
119− where
120− go = Map.fromListWith (++) . map (second (:[]))
121−
122−-- |
123−-- Updates the state to have more let bindings.
124−--
125−updateLets :: [P.Declaration] -> PSCiState -> PSCiState
126−updateLets ds st = st { psciLetBindings = psciLetBindings st ++ ds }
127−
128−-- |
129−-- Updates the state to have more let bindings.
130−--
131−updateForeignFiles :: Map P.ModuleName FilePath -> PSCiState -> PSCiState
132−updateForeignFiles fs st = st { psciForeignFiles = psciForeignFiles st `Map.union` fs }
133−
134−-- |
135−-- Valid Meta-commands for PSCI
136−--
137−data Command
138− -- |
139− -- A purescript expression
140− --
141− = Expression P.Expr
142− -- |
143− -- Show the help (ie, list of directives)
144− --
145− | ShowHelp
146− -- |
147− -- Import a module from a loaded file
148− --
149− | Import ImportedModule
150− -- |
151− -- Browse a module
152− --
153− | BrowseModule P.ModuleName
154− -- |
155− -- Load a file for use with importing
156− --
157− | LoadFile FilePath
158− -- |
159− -- Load a foreign module
160− --
161− | LoadForeign FilePath
162− -- |
163− -- Exit PSCI
164− --
165− | QuitPSCi
166− -- |
167− -- Reset the state of the REPL
168− --
169− | ResetState
170− -- |
171− -- Add some declarations to the current evaluation context.
172− --
173− | Decls [P.Declaration]
174− -- |
175− -- Find the type of an expression
176− --
177− | TypeOf P.Expr
178− -- |
179− -- Find the kind of an expression
180− --
181− | KindOf P.Type
182− -- |
183− -- Shows information about the current state of the REPL
184− --
185− | ShowInfo ReplQuery
186−
187−data ReplQuery
188− = QueryLoaded
189− | QueryImport
190− deriving (Eq, Show)
191−
192−-- | A list of all ReplQuery values.
193−replQueries :: [ReplQuery]
194−replQueries = [QueryLoaded, QueryImport]
195−
196−replQueryStrings :: [String]
197−replQueryStrings = map showReplQuery replQueries
198−
199−showReplQuery :: ReplQuery -> String
200−showReplQuery QueryLoaded = "loaded"
201−showReplQuery QueryImport = "import"
202−
203−parseReplQuery :: String -> Maybe ReplQuery
204−parseReplQuery "loaded" = Just QueryLoaded
205−parseReplQuery "import" = Just QueryImport
206−parseReplQuery _ = Nothing
207−
208−data Directive
209− = Help
210− | Quit
211− | Reset
212− | Browse
213− | Load
214− | Foreign
215− | Type
216− | Kind
217− | Show
218− deriving (Eq, Show)
psci/main/Main.hsdeleted−6
@@ -1,6 +0,0 @@
1−module Main where
2−
3−import PSCi
4−
5−main :: IO ()
6−main = runPSCi
psgo.cabalnew file+145
@@ -0,0 +1,145 @@
1+cabal-version: 1.12
2+
3+-- This file has been generated from package.yaml by hpack version 0.35.0.
4+--
5+-- see: https://github.com/sol/hpack
6+
7+name: psgo
8+version: 0.1.0.0
9+description: Please see the README on Github at <https://github.com/andyarvanitis/purescript-native#readme>
10+homepage: https://github.com/andyarvanitis/purescript-native#readme
11+bug-reports: https://github.com/andyarvanitis/purescript-native/issues
12+author: Andy Arvanitis
13+maintainer: example@example.com
14+copyright: 2018 Andy Arvanitis
15+license: BSD3
16+license-file: LICENSE
17+build-type: Simple
18+extra-source-files:
19+ README.md
20+ ChangeLog.md
21+ stack.yaml
22+ support/ffi-loader.go
23+ support/go.mod.ffi-loader
24+ support/go.mod.output
25+ support/go.mod.working
26+
27+source-repository head
28+ type: git
29+ location: https://github.com/andyarvanitis/purescript-native
30+
31+library
32+ exposed-modules:
33+ CodeGen.IL
34+ CodeGen.IL.Common
35+ CodeGen.IL.Optimizer
36+ CodeGen.IL.Optimizer.Common
37+ CodeGen.IL.Optimizer.Inliner
38+ CodeGen.IL.Optimizer.MagicDo
39+ CodeGen.IL.Optimizer.TCO
40+ CodeGen.IL.Printer
41+ Tests
42+ other-modules:
43+ Paths_psgo
44+ hs-source-dirs:
45+ src
46+ default-extensions:
47+ ConstraintKinds
48+ DataKinds
49+ DeriveFunctor
50+ EmptyDataDecls
51+ FlexibleContexts
52+ KindSignatures
53+ LambdaCase
54+ MultiParamTypeClasses
55+ NoImplicitPrelude
56+ PatternGuards
57+ PatternSynonyms
58+ RankNTypes
59+ RecordWildCards
60+ OverloadedStrings
61+ ScopedTypeVariables
62+ TupleSections
63+ ViewPatterns
64+ build-depends:
65+ aeson >=1.0 && <1.5
66+ , base >=4.7 && <5
67+ , base-compat >=0.6.0
68+ , bytestring >=0.10.8.2 && <0.11
69+ , containers
70+ , directory
71+ , file-embed
72+ , filemanip
73+ , filepath
74+ , gitrev
75+ , monad-parallel >=0.7.2.2 && <0.8
76+ , mtl >=2.1.0 && <2.3.0
77+ , pattern-arrows >=0.0.2 && <0.1
78+ , process
79+ , protolude >=0.1.6
80+ , purescript
81+ , safe >=0.3.9 && <0.4
82+ , text
83+ , transformers >=0.3.0 && <0.6
84+ default-language: Haskell2010
85+
86+executable psgo
87+ main-is: Main.hs
88+ other-modules:
89+ Paths_psgo
90+ hs-source-dirs:
91+ app
92+ ghc-options: -threaded -rtsopts -with-rtsopts=-N
93+ build-depends:
94+ aeson >=1.0 && <1.5
95+ , base >=4.7 && <5
96+ , base-compat >=0.6.0
97+ , bytestring >=0.10.8.2 && <0.11
98+ , containers
99+ , directory
100+ , file-embed
101+ , filemanip
102+ , filepath
103+ , gitrev
104+ , monad-parallel >=0.7.2.2 && <0.8
105+ , mtl >=2.1.0 && <2.3.0
106+ , pattern-arrows >=0.0.2 && <0.1
107+ , process
108+ , protolude >=0.1.6
109+ , psgo
110+ , purescript
111+ , safe >=0.3.9 && <0.4
112+ , text
113+ , transformers >=0.3.0 && <0.6
114+ default-language: Haskell2010
115+
116+test-suite psgo-test
117+ type: exitcode-stdio-1.0
118+ main-is: Spec.hs
119+ other-modules:
120+ Paths_psgo
121+ hs-source-dirs:
122+ test
123+ ghc-options: -threaded -rtsopts -with-rtsopts=-N
124+ build-depends:
125+ aeson >=1.0 && <1.5
126+ , base >=4.7 && <5
127+ , base-compat >=0.6.0
128+ , bytestring >=0.10.8.2 && <0.11
129+ , containers
130+ , directory
131+ , file-embed
132+ , filemanip
133+ , filepath
134+ , gitrev
135+ , monad-parallel >=0.7.2.2 && <0.8
136+ , mtl >=2.1.0 && <2.3.0
137+ , pattern-arrows >=0.0.2 && <0.1
138+ , process
139+ , protolude >=0.1.6
140+ , psgo
141+ , purescript
142+ , safe >=0.3.9 && <0.4
143+ , text
144+ , transformers >=0.3.0 && <0.6
145+ default-language: Haskell2010
purescript.cabaldeleted−365
@@ -1,365 +0,0 @@
1−name: purescript
2−version: 0.8.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− Christoph Hegemann <christoph.hegemann1337@gmail.com>
19−
20−tested-with: GHC==7.8.4, GHC==7.10.3, GHC==8.0.1
21−
22−extra-source-files: examples/passing/*.purs
23− , examples/failing/*.purs
24− , examples/docs/bower_components/purescript-prelude/src/*.purs
25− , examples/docs/bower.json
26− , examples/docs/src/*.purs
27− , tests/support/setup.js
28− , tests/support/package.json
29− , tests/support/prelude/bower.json
30− , tests/support/prelude/src/*.purs
31− , tests/support/prelude/src/*.js
32− , tests/support/prelude/LICENSE
33− , tests/support/bower.json
34− , tests/support/setup-win.cmd
35− , tests/support/flattened/*.purs
36− , tests/support/flattened/*.js
37− , tests/support/psci/*.purs
38− , stack.yaml
39− , stack-lts-2.yaml
40− , stack-lts-3.yaml
41− , stack-nightly.yaml
42− , README.md
43− , INSTALL.md
44− , CONTRIBUTORS.md
45− , CONTRIBUTING.md
46−
47−source-repository head
48− type: git
49− location: https://github.com/purescript/purescript.git
50−
51−library
52− build-depends: base >=4.6 && <5,
53− base-compat >=0.6.0,
54− lifted-base >= 0.2.3 && < 0.2.4,
55− monad-control >= 1.0.0.0 && < 1.1,
56− transformers-base >= 0.4.0 && < 0.5,
57− containers -any,
58− unordered-containers -any,
59− dlist -any,
60− directory >= 1.2,
61− filepath -any,
62− mtl >= 2.1.0 && < 2.3.0,
63− parsec -any,
64− transformers >= 0.3.0 && < 0.6,
65− transformers-compat >= 0.3.0,
66− utf8-string >= 1 && < 2,
67− pattern-arrows >= 0.0.2 && < 0.1,
68− time -any,
69− boxes >= 0.1.4 && < 0.2.0,
70− aeson >= 0.8 && < 0.12,
71− vector -any,
72− bower-json >= 0.7,
73− aeson-better-errors >= 0.8,
74− bytestring -any,
75− text -any,
76− split -any,
77− language-javascript == 0.5.*,
78− syb -any,
79− Glob >= 0.7 && < 0.8,
80− process >= 1.2.0 && < 1.5,
81− safe >= 0.3.9 && < 0.4,
82− semigroups >= 0.16.2 && < 0.19,
83− parallel >= 3.2 && < 3.3,
84− sourcemap >= 0.1.6,
85− stm >= 0.2.4.0,
86− regex-tdfa -any,
87− edit-distance -any,
88− fsnotify >= 0.2.1,
89− monad-logger >= 0.3 && < 0.4,
90− pipes >= 4.0.0 && < 4.2.0 ,
91− pipes-http -any,
92− http-types -any
93−
94− exposed-modules: Language.PureScript
95− Language.PureScript.AST
96− Language.PureScript.AST.Binders
97− Language.PureScript.AST.Declarations
98− Language.PureScript.AST.Operators
99− Language.PureScript.AST.SourcePos
100− Language.PureScript.AST.Traversals
101− Language.PureScript.AST.Exported
102− Language.PureScript.Bundle
103− Language.PureScript.Crash
104− Language.PureScript.Externs
105− Language.PureScript.CodeGen
106− Language.PureScript.CodeGen.JS
107− Language.PureScript.CodeGen.JS.AST
108− Language.PureScript.CodeGen.JS.Common
109− Language.PureScript.CodeGen.JS.Optimizer
110− Language.PureScript.CodeGen.JS.Optimizer.Blocks
111− Language.PureScript.CodeGen.JS.Optimizer.Common
112− Language.PureScript.CodeGen.JS.Optimizer.Inliner
113− Language.PureScript.CodeGen.JS.Optimizer.MagicDo
114− Language.PureScript.CodeGen.JS.Optimizer.TCO
115− Language.PureScript.CodeGen.JS.Optimizer.Unused
116− Language.PureScript.Constants
117− Language.PureScript.CoreFn
118− Language.PureScript.CoreFn.Ann
119− Language.PureScript.CoreFn.Binders
120− Language.PureScript.CoreFn.Desugar
121− Language.PureScript.CoreFn.Expr
122− Language.PureScript.CoreFn.Literals
123− Language.PureScript.CoreFn.Meta
124− Language.PureScript.CoreFn.Module
125− Language.PureScript.CoreFn.Traversals
126− Language.PureScript.Comments
127− Language.PureScript.Environment
128− Language.PureScript.Errors
129− Language.PureScript.Kinds
130− Language.PureScript.Linter
131− Language.PureScript.Linter.Exhaustive
132− Language.PureScript.Linter.Imports
133− Language.PureScript.Make
134− Language.PureScript.ModuleDependencies
135− Language.PureScript.Names
136− Language.PureScript.Options
137− Language.PureScript.Parser
138− Language.PureScript.Parser.Lexer
139− Language.PureScript.Parser.Common
140− Language.PureScript.Parser.Declarations
141− Language.PureScript.Parser.JS
142− Language.PureScript.Parser.Kinds
143− Language.PureScript.Parser.State
144− Language.PureScript.Parser.Types
145− Language.PureScript.Pretty
146− Language.PureScript.Pretty.Common
147− Language.PureScript.Pretty.JS
148− Language.PureScript.Pretty.Kinds
149− Language.PureScript.Pretty.Types
150− Language.PureScript.Pretty.Values
151− Language.PureScript.Renamer
152− Language.PureScript.Sugar
153− Language.PureScript.Sugar.BindingGroups
154− Language.PureScript.Sugar.CaseDeclarations
155− Language.PureScript.Sugar.DoNotation
156− Language.PureScript.Sugar.Names
157− Language.PureScript.Sugar.Names.Env
158− Language.PureScript.Sugar.Names.Imports
159− Language.PureScript.Sugar.Names.Exports
160− Language.PureScript.Sugar.ObjectWildcards
161− Language.PureScript.Sugar.Operators
162− Language.PureScript.Sugar.Operators.Common
163− Language.PureScript.Sugar.Operators.Expr
164− Language.PureScript.Sugar.Operators.Binders
165− Language.PureScript.Sugar.TypeClasses
166− Language.PureScript.Sugar.TypeClasses.Deriving
167− Language.PureScript.Sugar.TypeDeclarations
168− Language.PureScript.Traversals
169− Language.PureScript.TypeChecker
170− Language.PureScript.TypeChecker.Entailment
171− Language.PureScript.TypeChecker.Kinds
172− Language.PureScript.TypeChecker.Monad
173− Language.PureScript.TypeChecker.Rows
174− Language.PureScript.TypeChecker.Skolems
175− Language.PureScript.TypeChecker.Subsumption
176− Language.PureScript.TypeChecker.Synonyms
177− Language.PureScript.TypeChecker.Types
178− Language.PureScript.TypeChecker.Unify
179− Language.PureScript.TypeClassDictionaries
180− Language.PureScript.Types
181−
182− Language.PureScript.Docs
183− Language.PureScript.Docs.Convert
184− Language.PureScript.Docs.Convert.Single
185− Language.PureScript.Docs.Convert.ReExports
186− Language.PureScript.Docs.Render
187− Language.PureScript.Docs.Types
188− Language.PureScript.Docs.RenderedCode
189− Language.PureScript.Docs.RenderedCode.Types
190− Language.PureScript.Docs.RenderedCode.Render
191− Language.PureScript.Docs.AsMarkdown
192− Language.PureScript.Docs.ParseAndBookmark
193− Language.PureScript.Docs.Utils.MonoidExtras
194−
195− Language.PureScript.Publish
196− Language.PureScript.Publish.Utils
197− Language.PureScript.Publish.ErrorsWarnings
198− Language.PureScript.Publish.BoxesHelpers
199−
200− Language.PureScript.Ide
201− Language.PureScript.Ide.Command
202− Language.PureScript.Ide.Externs
203− Language.PureScript.Ide.Error
204− Language.PureScript.Ide.CodecJSON
205− Language.PureScript.Ide.Pursuit
206− Language.PureScript.Ide.Completion
207− Language.PureScript.Ide.Matcher
208− Language.PureScript.Ide.Filter
209− Language.PureScript.Ide.Types
210− Language.PureScript.Ide.State
211− Language.PureScript.Ide.CaseSplit
212− Language.PureScript.Ide.SourceFile
213− Language.PureScript.Ide.Watcher
214− Language.PureScript.Ide.Reexports
215−
216− Control.Monad.Logger
217− Control.Monad.Supply
218− Control.Monad.Supply.Class
219−
220− System.IO.UTF8
221−
222− extensions: DataKinds
223− exposed: True
224− buildable: True
225− hs-source-dirs: src
226− other-modules: Paths_purescript
227− ghc-options: -Wall -O2
228−
229−executable psc
230− build-depends: base >=4 && <5, base-compat >=0.6.0,
231− containers -any, directory -any, filepath -any,
232− mtl -any, optparse-applicative >= 0.10.0, parsec -any, purescript -any,
233− time -any, transformers -any, transformers-compat -any, Glob >= 0.7 && < 0.8,
234− aeson >= 0.8 && < 0.12, bytestring -any, utf8-string >= 1 && < 2
235− main-is: Main.hs
236− buildable: True
237− hs-source-dirs: psc
238− other-modules: JSON, Paths_purescript
239− ghc-options: -Wall -O2 -fno-warn-unused-do-bind -threaded -rtsopts "-with-rtsopts=-N"
240−
241−executable psci
242− build-depends: base >=4 && <5, containers -any, directory -any, filepath -any,
243− mtl -any, optparse-applicative >= 0.10.0, parsec -any,
244− haskeline >= 0.7.0.0, purescript -any, transformers -any,
245− transformers-compat -any, process -any, time -any, Glob -any, base-compat >=0.6.0,
246− boxes >= 0.1.4 && < 0.2.0
247−
248− main-is: Main.hs
249− buildable: True
250− hs-source-dirs: psci psci/main
251− other-modules: PSCi
252− PSCi.Types
253− PSCi.Parser
254− PSCi.Directive
255− PSCi.Completion
256− PSCi.IO
257− PSCi.Message
258− PSCi.Option
259− PSCi.Module
260− PSCi.Printer
261− Paths_purescript
262− ghc-options: -Wall -O2
263−
264−executable psc-docs
265− build-depends: base >=4 && <5, purescript -any,
266− optparse-applicative >= 0.10.0, process -any, mtl -any,
267− split -any, ansi-wl-pprint -any, directory -any,
268− filepath -any, Glob -any, transformers -any,
269− transformers-compat -any
270− main-is: Main.hs
271− other-modules: Paths_purescript
272− buildable: True
273− hs-source-dirs: psc-docs
274− other-modules: Ctags
275− Etags
276− Tags
277− ghc-options: -Wall -O2
278−
279−executable psc-publish
280− build-depends: base >=4 && <5, purescript -any, bytestring -any, aeson -any, optparse-applicative -any
281− main-is: Main.hs
282− other-modules: Paths_purescript
283− buildable: True
284− hs-source-dirs: psc-publish
285− ghc-options: -Wall -O2
286−
287−executable psc-hierarchy
288− build-depends: base >=4 && <5, purescript -any, optparse-applicative >= 0.10.0,
289− process -any, mtl -any, parsec -any, filepath -any, directory -any,
290− Glob -any
291− main-is: Main.hs
292− other-modules: Paths_purescript
293− buildable: True
294− hs-source-dirs: hierarchy
295− other-modules:
296− ghc-options: -Wall -O2
297−
298−executable psc-bundle
299− main-is: Main.hs
300− other-modules: Paths_purescript
301− other-extensions:
302− build-depends: base >=4 && <5,
303− purescript -any,
304− filepath -any,
305− directory -any,
306− mtl -any,
307− transformers -any,
308− transformers-compat -any,
309− optparse-applicative >= 0.10.0,
310− Glob -any
311− ghc-options: -Wall -O2
312− hs-source-dirs: psc-bundle
313−
314−executable psc-ide-server
315− main-is: Main.hs
316− other-modules:
317− other-extensions:
318− build-depends: base >=4 && <5
319− , purescript -any
320− , directory -any
321− , filepath -any
322− , monad-logger -any
323− , mtl -any
324− , transformers -any
325− , transformers-compat -any
326− , network -any
327− , optparse-applicative >= 0.10.0
328− , stm -any
329− , text -any
330− , base-compat >=0.6.0
331− ghc-options: -Wall -O2 -threaded
332− hs-source-dirs: psc-ide-server
333−
334−executable psc-ide-client
335− main-is: Main.hs
336− other-modules:
337− other-extensions:
338− build-depends: base >=4 && <5
339− , mtl -any
340− , text -any
341− , optparse-applicative >= 0.10.0
342− , network -any
343− , base-compat >=0.6.0
344− ghc-options: -Wall -O2
345− hs-source-dirs: psc-ide-client
346−
347−test-suite tests
348− build-depends: base >=4 && <5, containers -any, directory -any,
349− filepath -any, mtl -any, parsec -any, purescript -any,
350− transformers -any, process -any, transformers-compat -any, time -any,
351− Glob -any, aeson-better-errors -any, bytestring -any, aeson -any,
352− base-compat -any, haskeline >= 0.7.0.0, optparse-applicative -any,
353− boxes -any, HUnit -any, hspec -any, hspec-discover -any, stm -any, text -any
354− ghc-options: -Wall
355− type: exitcode-stdio-1.0
356− main-is: Main.hs
357− other-modules: TestUtils
358− TestCompiler
359− TestDocs
360− TestPscPublish
361− TestPsci
362− TestPscIde
363− PscIdeSpec
364− buildable: True
365− hs-source-dirs: tests psci
src/CodeGen/IL.hsnew file+321
@@ -0,0 +1,321 @@
1+-- | This module generates code in the core imperative representation from
2+-- elaborated PureScript code.
3+module CodeGen.IL
4+ ( module AST
5+ , module Common
6+ , moduleToIL
7+ ) where
8+
9+import Prelude.Compat
10+import Protolude (ordNub)
11+
12+import Control.Arrow ((&&&))
13+import Control.Monad (forM, liftM, replicateM, void)
14+import Control.Monad.Supply.Class
15+
16+import Data.List ((\\), delete, intersect, nub)
17+import qualified Data.Foldable as F
18+import qualified Data.Map as M
19+import Data.Maybe (fromMaybe, isNothing, mapMaybe)
20+import Data.Monoid ((<>))
21+import Data.String (fromString)
22+import Data.Text (Text)
23+import qualified Data.Text as T
24+
25+import Language.PureScript.AST.SourcePos
26+import Language.PureScript.CoreImp.AST (AST)
27+import qualified Language.PureScript.CoreImp.AST as AST
28+import Language.PureScript.CoreFn
29+import Language.PureScript.Crash
30+import Language.PureScript.Names
31+import Language.PureScript.Options
32+import Language.PureScript.PSString (PSString, mkString)
33+import Language.PureScript.Traversals (sndM)
34+import qualified Language.PureScript.Constants as C
35+
36+import System.FilePath.Posix ((</>))
37+
38+import CodeGen.IL.Common as Common
39+import CodeGen.IL.Optimizer
40+import CodeGen.IL.Printer
41+
42+data DeclType = ModuleDecl | LetDecl | RecLetDecl deriving (Eq)
43+
44+-- | Generate code in the simplified intermediate representation for all declarations in a
45+-- module.
46+moduleToIL
47+ :: forall m
48+ -- . (Monad m, MonadReader Options m, MonadSupply m, MonadError MultipleErrors m)
49+ . (Monad m, MonadSupply m)
50+ => Module Ann
51+ -> Text
52+ -> m (Text, [Text], [AST], Text, Text)
53+moduleToIL (Module _ coms mn _ imps _ foreigns decls) project =
54+ do
55+ ilDecls <- mapM (bindToIL ModuleDecl) decls
56+ optimized <- traverse (traverse (optimize modName')) ilDecls
57+ let optimized' = concat optimized
58+ values = annotValue <$> optimized'
59+ foreigns' = moduleIdentToIL <$> foreigns
60+ interface = interfaceSource modName values foreigns
61+ imports = nub . concat $ importToIL <$> optimized'
62+ implHeader = implHeaderSource modName imports project
63+ implFooter = implFooterSource (runModuleName mn) foreigns
64+ return $ (interface, foreigns', optimized', implHeader, implFooter)
65+ where
66+ modName = moduleNameToIL mn
67+ modName' = AST.Var Nothing modName
68+
69+ annotValue :: AST -> (Text, Bool)
70+ annotValue (AST.Function _ (Just name) [] (AST.Block _ [AST.Return _ ret]))
71+ | isLiteral ret = (name, True)
72+ annotValue (AST.Function _ (Just name) [] _) = (name, False)
73+ annotValue _ = error "Unexpected top-level value form"
74+
75+ -- | Extracts all declaration names from a binding group.
76+ getNames :: Bind Ann -> [Ident]
77+ getNames (NonRec _ ident _) = [ident]
78+ getNames (Rec vals) = map (snd . fst) vals
79+
80+ -- | Generates IL code for a module import
81+ --
82+ importToIL :: AST -> [Text]
83+ importToIL = AST.everything (++) modRef
84+ where
85+ modRef (AST.Indexer _ (AST.Var _ _) (AST.Var _ mname))
86+ | not $ T.null mname = [extract mname]
87+ modRef _ = []
88+ extract :: Text -> Text
89+ extract = T.replace "_" "." . T.dropWhileEnd (=='_')
90+
91+ -- |
92+ -- Generate code in the simplified intermediate representation for a declaration
93+ --
94+ bindToIL :: DeclType -> Bind Ann -> m [AST]
95+ bindToIL dt (NonRec ann ident val) = return <$> nonRecToIL dt ann ident val
96+ bindToIL dt (Rec vals) = forM vals (uncurry . uncurry $ nonRecToIL dt')
97+ where
98+ dt' = if dt == LetDecl then RecLetDecl else dt
99+
100+ -- | Generate code in the simplified intermediate representation for a single non-recursive
101+ -- declaration.
102+ --
103+ -- The main purpose of this function is to handle code generation for comments.
104+ nonRecToIL :: DeclType -> Ann -> Ident -> Expr Ann -> m AST
105+ nonRecToIL dt a i e@(extractAnn -> (_, com, _, _)) | not (null com) = do
106+ -- withoutComment <- asks optionsNoComments
107+ let withoutComment = False
108+ if withoutComment
109+ then nonRecToIL dt a i (modifyAnn removeComments e)
110+ else AST.Comment Nothing com <$> nonRecToIL dt a i (modifyAnn removeComments e)
111+ nonRecToIL ModuleDecl (ss, _, _, _) ident val = do
112+ il <- valueToIL val
113+ pure $ AST.Function Nothing (Just $ moduleIdentToIL ident) [] (AST.Block Nothing [AST.Return Nothing il])
114+ nonRecToIL RecLetDecl (ss, _, _, _) ident val = do
115+ ilExpr <- valueToIL val
116+ pure $ AST.Assignment Nothing (AST.Var Nothing $ identToIL ident) ilExpr
117+ nonRecToIL _ (ss, _, _, _) ident val = do
118+ il <- valueToIL val
119+ pure $ AST.VariableIntroduction Nothing (identToIL ident) (Just il)
120+
121+ -- | Generate code in the simplified intermediate representation for a variable based on a
122+ -- PureScript identifier.
123+ var :: Ident -> AST
124+ var = AST.Var Nothing . identToIL
125+
126+ accessorString :: PSString -> AST -> AST
127+ accessorString prop = AST.Indexer Nothing (AST.StringLiteral Nothing prop)
128+
129+ -- | Generate code in the simplified intermediate representation for a value or expression.
130+
131+ valueToIL :: Expr Ann -> m AST
132+ valueToIL (Literal (pos, _, _, _) l) = literalToValueIL pos l
133+ valueToIL (Accessor _ prop val) =
134+ accessorString prop <$> valueToIL val
135+ valueToIL (ObjectUpdate _ o ps) = do
136+ obj <- valueToIL o
137+ updates <- mapM (sndM valueToIL) ps
138+ obj' <- freshName'
139+ let objVar = AST.Var Nothing obj'
140+ copy = AST.VariableIntroduction Nothing obj' (Just $ copyDict obj)
141+ assign (k, v) = AST.Assignment Nothing (accessorString k objVar) v
142+ sts = copy : (assign <$> updates) ++ [AST.Return Nothing objVar]
143+ return $ AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing sts)) []
144+ valueToIL (Abs _ arg val) = do
145+ ret <- valueToIL val
146+ let ilArg = case arg of
147+ UnusedIdent -> []
148+ _ -> [identToIL arg]
149+ return $ AST.Function Nothing Nothing ilArg (AST.Block Nothing [AST.Return Nothing ret])
150+ valueToIL e@App{} = do
151+ let (f, args) = unApp e []
152+ args' <- mapM valueToIL args
153+ fn <- valueToIL f
154+ case f of
155+ Var (_, _, _, Just IsNewtype) _ -> return (head args')
156+ _ -> flip (foldl (\fn a -> AST.App Nothing fn [a])) args' <$> valueToIL f
157+ where
158+ unApp :: Expr Ann -> [Expr Ann] -> (Expr Ann, [Expr Ann])
159+ unApp (App _ val arg) args = unApp val (arg : args)
160+ unApp other args = (other, args)
161+ valueToIL (Var _ ident) = return $ varToIL ident
162+ valueToIL (Case (ss, _, _, _) values binders) = do
163+ vals <- mapM valueToIL values
164+ bindersToIL ss binders vals
165+ valueToIL (Let _ ds val) = do
166+ let recurs = concatMap getNames $ filter isRec ds
167+ recurDs = (\v -> AST.VariableIntroduction Nothing (identToIL v) Nothing) <$> recurs
168+ ds' <- concat <$> mapM (bindToIL LetDecl) ds
169+ ret <- valueToIL val
170+ return $ AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing (recurDs ++ ds' ++ [AST.Return Nothing ret]))) []
171+ where
172+ isRec :: Bind Ann -> Bool
173+ isRec (Rec _) = True
174+ isRec _ = False
175+ valueToIL (Constructor (_, _, _, Just IsNewtype) _ (ProperName ctor) _) = error "IsNewtype"
176+ valueToIL (Constructor _ _ (ProperName ctor) fields) =
177+ let body = AST.ObjectLiteral Nothing $ (mkString ctor, AST.BooleanLiteral Nothing True) :
178+ ((\field -> (mkString (identToIL field), var field)) `map` fields)
179+ fn = foldr (\f inner -> AST.Function Nothing Nothing [identToIL f] (AST.Block Nothing [AST.Return Nothing inner])) body fields
180+ in return fn
181+
182+
183+ iife :: Text -> [AST] -> AST
184+ iife v exprs = AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing $ exprs ++ [AST.Return Nothing $ AST.Var Nothing v])) []
185+
186+ literalToValueIL :: SourceSpan -> Literal (Expr Ann) -> m AST
187+ literalToValueIL ss (NumericLiteral (Left i)) = return $ AST.NumericLiteral (Just ss) (Left i)
188+ literalToValueIL ss (NumericLiteral (Right n)) = return $ AST.NumericLiteral (Just ss) (Right n)
189+ literalToValueIL ss (StringLiteral s) = return $ AST.StringLiteral (Just ss) s
190+ literalToValueIL ss (CharLiteral c) = return $ AST.StringLiteral (Just ss) (fromString [c])
191+ literalToValueIL ss (BooleanLiteral b) = return $ AST.BooleanLiteral (Just ss) b
192+ literalToValueIL ss (ArrayLiteral xs) = AST.ArrayLiteral (Just ss) <$> mapM valueToIL xs
193+ literalToValueIL ss (ObjectLiteral ps) = AST.ObjectLiteral (Just ss) <$> mapM (sndM valueToIL) ps
194+
195+ -- | Generate code in the simplified intermediate representation for a reference to a
196+ -- variable.
197+ varToIL :: Qualified Ident -> AST
198+ varToIL (Qualified Nothing ident) = var ident
199+ varToIL qual = qualifiedToIL id qual
200+
201+ -- | Generate code in the simplified intermediate representation for a reference to a
202+ -- variable that may have a qualified name.
203+ qualifiedToIL :: (a -> Ident) -> Qualified a -> AST
204+ qualifiedToIL f (Qualified (Just (ModuleName mn')) a) | mn' == C.prim = AST.Var Nothing . moduleIdentToIL $ f a
205+ qualifiedToIL f (Qualified (Just mn') a) | mn /= mn' = AST.Indexer Nothing (AST.Var Nothing . moduleIdentToIL $ f a) (AST.Var Nothing (moduleNameToIL mn'))
206+ qualifiedToIL f (Qualified _ a) = AST.Indexer Nothing (AST.Var Nothing . moduleIdentToIL $ f a) (AST.Var Nothing "")
207+
208+ -- foreignIdent :: Ident -> AST
209+ -- foreignIdent ident = accessorString (mkString $ runIdent ident) (AST.Var Nothing "$foreign")
210+
211+ -- | Generate code in the simplified intermediate representation for pattern match binders
212+ -- and guards.
213+ bindersToIL :: SourceSpan -> [CaseAlternative Ann] -> [AST] -> m AST
214+ bindersToIL ss binders vals = do
215+ valNames <- replicateM (length vals) freshName'
216+ let assignments = zipWith (AST.VariableIntroduction Nothing) valNames (map Just vals)
217+ ils <- forM binders $ \(CaseAlternative bs result) -> do
218+ ret <- guardsToIL result
219+ go valNames ret bs
220+ return $ AST.App Nothing (AST.Function Nothing Nothing [] (AST.Block Nothing (assignments ++ concat ils ++ [AST.Throw Nothing (AST.StringLiteral Nothing $ mkString failedPatternMessage)])))
221+ []
222+ where
223+ go :: [Text] -> [AST] -> [Binder Ann] -> m [AST]
224+ go _ done [] = return done
225+ go (v:vs) done' (b:bs) = do
226+ done'' <- go vs done' bs
227+ binderToIL v done'' b
228+ go _ _ _ = internalError "Invalid arguments to bindersToIL"
229+
230+ failedPatternMessage :: Text
231+ failedPatternMessage = "Failed pattern match at " <> runModuleName mn <> " " <> displayStartEndPos ss
232+
233+ guardsToIL :: Either [(Guard Ann, Expr Ann)] (Expr Ann) -> m [AST]
234+ guardsToIL (Left gs) = traverse genGuard gs where
235+ genGuard (cond, val) = do
236+ cond' <- valueToIL cond
237+ val' <- valueToIL val
238+ return
239+ (AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo cond' (AST.BooleanLiteral Nothing True))
240+ (AST.Block Nothing [AST.Return Nothing val']) Nothing)
241+
242+ guardsToIL (Right v) = return . AST.Return Nothing <$> valueToIL v
243+
244+ -- | Generate code in the simplified intermediate representation for a pattern match
245+ -- binder.
246+ binderToIL :: Text -> [AST] -> Binder Ann -> m [AST]
247+ binderToIL _ done NullBinder{} = return done
248+ binderToIL varName done (LiteralBinder _ l) =
249+ literalToBinderIL varName done l
250+ binderToIL varName done (VarBinder _ ident) =
251+ return (AST.VariableIntroduction Nothing (identToIL ident) (Just (AST.Var Nothing varName)) : done)
252+ binderToIL varName done (ConstructorBinder (_, _, _, Just IsNewtype) _ _ [b]) =
253+ binderToIL varName done b
254+ binderToIL varName done (ConstructorBinder (_, _, _, Just (IsConstructor ctorType fields)) _ (Qualified _ (ProperName ctor)) bs) = do
255+ il <- go (zip fields bs) done
256+ return $ case ctorType of
257+ ProductType -> il
258+ SumType ->
259+ [AST.IfElse Nothing (AST.InstanceOf Nothing (AST.Var Nothing varName) (AST.StringLiteral Nothing (mkString ctor)))
260+ (AST.Block Nothing il)
261+ Nothing]
262+ where
263+ go :: [(Ident, Binder Ann)] -> [AST] -> m [AST]
264+ go [] done' = return done'
265+ go ((field, binder) : remain) done' = do
266+ argVar <- freshName'
267+ done'' <- go remain done'
268+ il <- binderToIL argVar done'' binder
269+ return (AST.VariableIntroduction Nothing argVar (Just $ accessorString (mkString $ identToIL field) $ AST.Var Nothing varName) : il)
270+
271+ binderToIL _ _ ConstructorBinder{} =
272+ internalError "binderToIL: Invalid ConstructorBinder in binderToIL"
273+ binderToIL varName done (NamedBinder _ ident binder) = do
274+ il <- binderToIL varName done binder
275+ return (AST.VariableIntroduction Nothing (identToIL ident) (Just (AST.Var Nothing varName)) : il)
276+
277+ literalToBinderIL :: Text -> [AST] -> Literal (Binder Ann) -> m [AST]
278+ literalToBinderIL varName done (NumericLiteral num) =
279+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.NumericLiteral Nothing num)) (AST.Block Nothing done) Nothing]
280+ literalToBinderIL varName done (CharLiteral c) =
281+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.StringLiteral Nothing (fromString [c]))) (AST.Block Nothing done) Nothing]
282+ literalToBinderIL varName done (StringLiteral str) =
283+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.StringLiteral Nothing str)) (AST.Block Nothing done) Nothing]
284+ literalToBinderIL varName done (BooleanLiteral True) =
285+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.BooleanLiteral Nothing True)) (AST.Block Nothing done) Nothing]
286+ literalToBinderIL varName done (BooleanLiteral False) =
287+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo (AST.Var Nothing varName) (AST.BooleanLiteral Nothing False)) (AST.Block Nothing done) Nothing]
288+ -- return [AST.IfElse Nothing (AST.Unary Nothing AST.Not (AST.Var Nothing varName)) (AST.Block Nothing done) Nothing]
289+ literalToBinderIL varName done (ObjectLiteral bs) = go done bs
290+ where
291+ go :: [AST] -> [(PSString, Binder Ann)] -> m [AST]
292+ go done' [] = return done'
293+ go done' ((prop, binder):bs') = do
294+ propVar <- freshName'
295+ done'' <- go done' bs'
296+ il <- binderToIL propVar done'' binder
297+ return (AST.VariableIntroduction Nothing propVar (Just (accessorString prop (AST.Var Nothing varName))) : il)
298+ literalToBinderIL varName done (ArrayLiteral bs) = do
299+ il <- go done 0 bs
300+ return [AST.IfElse Nothing (AST.Binary Nothing AST.EqualTo
301+ (arrayLength $ AST.Var Nothing varName)
302+ (AST.NumericLiteral Nothing (Left (fromIntegral $ length bs))))
303+ (AST.Block Nothing il) Nothing]
304+ where
305+ go :: [AST] -> Integer -> [Binder Ann] -> m [AST]
306+ go done' _ [] = return done'
307+ go done' index (binder:bs') = do
308+ elVar <- freshName'
309+ done'' <- go done' (index + 1) bs'
310+ il <- binderToIL elVar done'' binder
311+ return (AST.VariableIntroduction Nothing elVar (Just (AST.Indexer Nothing (AST.NumericLiteral Nothing (Left index)) (AST.Var Nothing varName))) : il)
312+
313+emptyAnn :: Ann
314+emptyAnn = (SourceSpan "" (SourcePos 0 0) (SourcePos 0 0), [], Nothing, Nothing)
315+
316+arrayLength :: AST -> AST
317+arrayLength a = AST.App Nothing (AST.Var Nothing arrayLengthFn) [a]
318+-- arrayLength a = AST.Var Nothing (arrayLengthFn <> "(" <> prettyPrintIL1 a <> ")")
319+
320+copyDict :: AST -> AST
321+copyDict a = AST.App Nothing (AST.Var Nothing copyDictFn) [a]
src/CodeGen/IL/Common.hsnew file+196
@@ -0,0 +1,196 @@
1+-- | Common code generation utility functions
2+module CodeGen.IL.Common where
3+
4+import Prelude.Compat
5+
6+import Control.Monad.Supply.Class (MonadSupply, freshName)
7+import Data.Char
8+import Data.Maybe (maybe)
9+import Data.Monoid ((<>))
10+import Data.Text (Text)
11+import qualified Data.Text as T
12+
13+import Language.PureScript.Crash
14+import Language.PureScript.Names
15+
16+import qualified Language.PureScript.Constants as C
17+
18+moduleNameToIL :: ModuleName -> Text
19+moduleNameToIL (ModuleName mn) =
20+ let name = T.replace "." "_" mn
21+ in if nameIsILBuiltIn name then (name <> moduleRenamerMarker) else name
22+
23+moduleNameToIL' :: ModuleName -> Text
24+moduleNameToIL' (ModuleName mn) = T.replace "_" "." mn
25+
26+-- | Convert an 'Ident' into a valid IL identifier:
27+--
28+-- * Alphanumeric characters are kept unmodified.
29+--
30+-- * Reserved IL identifiers are wrapped with '_'.
31+--
32+identToIL :: Ident -> Text
33+identToIL UnusedIdent = unusedName
34+identToIL (Ident "$__unused") = unusedName
35+identToIL (Ident name) | name == C.undefined = undefinedName -- Note: done in Printer.hs too
36+identToIL (Ident name) = properToIL name
37+identToIL (GenIdent _ _) = internalError "GenIdent in identToIL"
38+
39+moduleIdentToIL :: Ident -> Text
40+moduleIdentToIL UnusedIdent = unusedName
41+moduleIdentToIL (Ident name) | name == C.undefined = undefinedName
42+moduleIdentToIL (Ident name) = moduleProperToIL name
43+moduleIdentToIL (GenIdent _ _) = internalError "GenIdent in identToIL"
44+
45+undefinedName :: Text
46+undefinedName = "Undefined"
47+
48+unusedName :: Text
49+unusedName = "_"
50+
51+properToIL :: Text -> Text
52+properToIL name
53+ | nameIsILReserved name = "ˉ" <> name
54+ | otherwise = T.concatMap identCharToText name
55+
56+-- | Attempts to find a human-readable name for a symbol, if none has been specified returns the
57+-- ordinal value.
58+identCharToText :: Char -> Text
59+identCharToText 'ṩ' = "_ṩ"
60+identCharToText c | isAlphaNum c = T.singleton c
61+identCharToText '_' = "_"
62+identCharToText '\'' = "ꞌ" -- lowercase saltillo
63+identCharToText c = error (show (ord c)) -- TODO: should never occur now(?)
64+
65+moduleProperToIL :: Text -> Text
66+moduleProperToIL = T.concatMap identCharToText
67+
68+-- | Checks whether an identifier name is reserved in IL.
69+nameIsILReserved :: Text -> Bool
70+nameIsILReserved name =
71+ name `elem` ilAnyReserved
72+
73+-- | Checks whether a name matches a built-in value in IL.
74+nameIsILBuiltIn :: Text -> Bool
75+nameIsILBuiltIn name =
76+ name `elem`
77+ [ "Any"
78+ , "Apply"
79+ , "Contains"
80+ , "CopyDict"
81+ , "Dict"
82+ , "EffFn"
83+ , "Fn"
84+ , "Foreign"
85+ , "Get"
86+ , "Index"
87+ , "Is"
88+ , "Length"
89+ , "Once"
90+ , "Run"
91+ , "Undefined"
92+ ]
93+
94+ilAnyReserved :: [Text]
95+ilAnyReserved =
96+ concat
97+ [ ilKeywords
98+ , ilLiterals
99+ ]
100+
101+ilKeywords :: [Text]
102+ilKeywords =
103+ [ "break"
104+ , "case"
105+ , "chan"
106+ , "const"
107+ , "continue"
108+ , "default"
109+ , "defer"
110+ , "else"
111+ , "fallthrough"
112+ , "for"
113+ , "func"
114+ , "go"
115+ , "goto"
116+ , "if"
117+ , "import"
118+ , "interface"
119+ , "map"
120+ , "package"
121+ , "range"
122+ , "return"
123+ , "select"
124+ , "struct"
125+ , "switch"
126+ , "type"
127+ , "var"
128+ ]
129+
130+ilLiterals :: [Text]
131+ilLiterals =
132+ [ "init"
133+ , "nil"
134+ , "int"
135+ , "int8"
136+ , "int16"
137+ , "int32"
138+ , "int64"
139+ , "uint"
140+ , "uint8"
141+ , "uint16"
142+ , "uint32"
143+ , "uint64"
144+ , "uintptr"
145+ , "float32"
146+ , "float64"
147+ , "complex64"
148+ , "complex128"
149+ , "byte"
150+ , "rune"
151+ , "string"
152+ ]
153+
154+withPrefix :: Text -> Text
155+withPrefix s = "Ꞌ" <> s -- uppercase saltillo
156+
157+anyType :: Text
158+anyType = "Any"
159+
160+dictType :: Text
161+dictType = "Dict"
162+
163+arrayType :: Text
164+arrayType = "[]" <> anyType
165+
166+uncurriedFnType :: Int -> Text
167+uncurriedFnType i = "Fn" <> (T.pack . show $ i)
168+
169+int :: Text
170+int = "int"
171+
172+float :: Text
173+float = "float64"
174+
175+bool :: Text
176+bool = "bool"
177+
178+string :: Text
179+string = "string"
180+
181+arrayLengthFn :: Text
182+arrayLengthFn = "Length"
183+
184+indexFn :: Text
185+indexFn = "Index"
186+
187+copyDictFn :: Text
188+copyDictFn = "CopyDict"
189+
190+freshName' :: MonadSupply m => m Text
191+freshName' = do
192+ name <- freshName
193+ return $ T.replace "$" "ṩ" name
194+
195+moduleRenamerMarker :: Text
196+moduleRenamerMarker = "__"
src/CodeGen/IL/Optimizer.hsnew file+81
@@ -0,0 +1,81 @@
1+-- | This module optimizes code in the intermediate representation.
2+module CodeGen.IL.Optimizer (optimize) where
3+
4+import Prelude.Compat
5+
6+import Control.Monad.Supply.Class (MonadSupply)
7+import Data.Text (Text)
8+import Language.PureScript.CoreImp.AST
9+import Language.PureScript.CoreImp.Optimizer.Blocks
10+import Language.PureScript.CoreImp.Optimizer.Common hiding (isDict)
11+import Language.PureScript.CoreImp.Optimizer.Inliner (etaConvert, evaluateIifes, inlineVariables, unThunk)
12+import Language.PureScript.CoreImp.Optimizer.Unused
13+
14+import CodeGen.IL.Common (unusedName)
15+import CodeGen.IL.Optimizer.Inliner
16+import CodeGen.IL.Optimizer.MagicDo
17+import CodeGen.IL.Optimizer.TCO
18+
19+import qualified Language.PureScript.Constants as C
20+
21+-- | Apply a series of optimizer passes to simplified IL code
22+optimize :: MonadSupply m => AST -> AST -> m AST
23+optimize mn il = do
24+ il' <- untilFixedPoint (inlineFnComposition . inlineUnsafeCoerce . inlineUnsafePartial . tidyUp) il
25+ il'' <- untilFixedPoint (return . ignoreUnusedResults . inlineCommonValues . inlineCommonOperators . tidyUp) . tco mn . inlineST
26+ =<< untilFixedPoint (return . magicDoST)
27+ =<< untilFixedPoint (return . magicDoEff)
28+ =<< untilFixedPoint (return . magicDoEffect) il'
29+ untilFixedPoint (return . collapseVarDeclarations) il''
30+ where
31+ tidyUp :: AST -> AST
32+ tidyUp = applyAll
33+ [ collapseNestedBlocks
34+ , collapseNestedIfs
35+ , collapseIfChecks
36+ , removeCodeAfterReturnStatements
37+ , unThunk
38+ , etaConvert
39+ , evaluateIifes
40+ , inlineVariables
41+ ]
42+
43+untilFixedPoint :: (Monad m, Eq a) => (a -> m a) -> a -> m a
44+untilFixedPoint f = go
45+ where
46+ go a = do
47+ a' <- f a
48+ if a' == a then return a' else go a'
49+
50+collapseIfChecks :: AST -> AST
51+collapseIfChecks = everywhere collapse where
52+ collapse :: AST -> AST
53+ collapse (IfElse _ (Binary _ EqualTo (BooleanLiteral _ True) (BooleanLiteral _ True)) (Block _ [exprs]) _) = exprs
54+ collapse (IfElse _ (Binary _ EqualTo (Indexer _ (Var _ prop) (Var _ val)) (BooleanLiteral _ True)) (Block _ [exprs]) _)
55+ | prop == "otherwise" && val == "Data_Boolean" = exprs
56+ collapse exprs = exprs
57+
58+collapseVarDeclarations :: AST -> AST
59+collapseVarDeclarations = everywhere collapse where
60+ collapse :: AST -> AST
61+ collapse (Block ss sts) = Block ss (go Nothing sts)
62+ collapse s = s
63+
64+ go :: Maybe Text -> [AST] -> [AST]
65+ go _ [] = []
66+ go Nothing (decl@(VariableIntroduction _ var (Just _)) : sts) = decl : go (Just var) (go Nothing sts)
67+ go (Just var') ((VariableIntroduction ss var (Just val)) : sts)
68+ | var == var' = (Assignment ss (Var Nothing var) val) : go (Just var') sts
69+ go var' (s:sts) = s : go var' sts
70+
71+ignoreUnusedResults :: AST -> AST
72+ignoreUnusedResults = everywhere $ removeFromBlock go
73+ where
74+ go :: [AST] -> [AST]
75+ go [] = []
76+ go (VariableIntroduction ss var (Just s) : sts)
77+ | not $ any (everything (||) (isUsed var)) sts = sts'
78+ where
79+ sts' | App{} <- s = s : (go sts)
80+ | otherwise = go sts
81+ go (s:sts) = s : go sts
src/CodeGen/IL/Optimizer/Common.hsnew file+18
@@ -0,0 +1,18 @@
1+-- | Common functions used by the various optimizer phases
2+module CodeGen.IL.Optimizer.Common where
3+
4+import Prelude.Compat
5+
6+import Data.Text (Text)
7+
8+import Language.PureScript.CoreImp.AST
9+import Language.PureScript.PSString (PSString, decodeString)
10+
11+isDict :: (Text, PSString) -> AST -> Bool
12+isDict (moduleName, dictName) (Indexer _ (Var _ x) (Var _ y)) =
13+ Just x == decodeString dictName && y == moduleName
14+isDict _ _ = False
15+
16+isDict' :: [(Text, PSString)] -> AST -> Bool
17+isDict' xs il = any (`isDict` il) xs
18+
src/CodeGen/IL/Optimizer/Inliner.hsnew file+435
@@ -0,0 +1,435 @@
1+-- | This module performs basic inlining of known functions
2+module CodeGen.IL.Optimizer.Inliner
3+ ( inlineCommonValues
4+ , inlineCommonOperators
5+ , inlineFnComposition
6+ , inlineUnsafeCoerce
7+ , inlineUnsafePartial
8+ ) where
9+
10+import Prelude.Compat
11+
12+import Control.Monad.Supply.Class (MonadSupply)
13+
14+import Data.Either (rights)
15+import Data.Maybe (fromMaybe)
16+import Data.String (IsString, fromString)
17+import Data.Text (Text)
18+import qualified Data.Text as T
19+
20+import Language.PureScript.PSString (PSString, decodeString, mkString)
21+import Language.PureScript.CoreImp.AST
22+import Language.PureScript.CoreImp.Optimizer.Common hiding (isDict, isDict')
23+import Language.PureScript.AST (SourceSpan(..))
24+import qualified Language.PureScript.Constants as C
25+
26+import CodeGen.IL.Common
27+import CodeGen.IL.Optimizer.Common
28+
29+-- TODO: Potential bug:
30+-- Shouldn't just inline this case: { var x = 0; x.toFixed(10); }
31+-- Needs to be: { 0..toFixed(10); }
32+-- Probably needs to be fixed in pretty-printer instead.
33+shouldInline :: AST -> Bool
34+shouldInline (Var _ _) = True
35+shouldInline (NumericLiteral _ _) = True
36+shouldInline (StringLiteral _ _) = True
37+shouldInline (BooleanLiteral _ _) = True
38+shouldInline (Indexer _ index val) = shouldInline index && shouldInline val
39+shouldInline _ = False
40+
41+inlineCommonValues :: AST -> AST
42+inlineCommonValues = everywhere convert
43+ where
44+ convert :: AST -> AST
45+ convert (App ss fn [dict])
46+ | isDict' [semiringNumber, semiringInt] dict && isDict fnZero fn = NumericLiteral ss (Left 0)
47+ | isDict' [semiringNumber, semiringInt] dict && isDict fnOne fn = NumericLiteral ss (Left 1)
48+ | isDict boundedBoolean dict && isDict fnBottom fn = BooleanLiteral ss False
49+ | isDict boundedBoolean dict && isDict fnTop fn = BooleanLiteral ss True
50+ convert (App ss (App _ fn [dict]) [x])
51+ | isDict ringInt dict && isDict fnNegate fn = Unary ss Negate (unbox x $ snd ringInt)
52+ convert (App ss (App _ (App _ fn [dict]) [x]) [y])
53+ | isDict semiringInt dict && isDict fnAdd fn = intOp ss Add semiringInt x y
54+ | isDict semiringInt dict && isDict fnMultiply fn = intOp ss Multiply semiringInt x y
55+ | isDict ringInt dict && isDict fnSubtract fn = intOp ss Subtract ringInt x y
56+ convert other = other
57+ fnZero = (C.dataSemiring, C.zero)
58+ fnOne = (C.dataSemiring, C.one)
59+ fnBottom = (C.dataBounded, C.bottom)
60+ fnTop = (C.dataBounded, C.top)
61+ fnAdd = (C.dataSemiring, C.add)
62+ fnMultiply = (C.dataSemiring, C.mul)
63+ fnSubtract = (C.dataRing, C.sub)
64+ fnNegate = (C.dataRing, C.negate)
65+ intOp ss op (_, d) x y = Binary ss op (unbox x d) (unbox y d)
66+
67+inlineCommonOperators :: AST -> AST
68+inlineCommonOperators = everywhereTopDown $ applyAll $
69+ [ binary semiringNumber opAdd Add
70+ , binary semiringNumber opMul Multiply
71+
72+ , binary ringNumber opSub Subtract
73+ , unary ringNumber opNegate Negate
74+
75+ , binary euclideanRingNumber opDiv Divide
76+
77+ -- , binary eqNumber opEq EqualTo
78+ -- , binary eqNumber opNotEq NotEqualTo
79+ , binary eqInt opEq EqualTo
80+ , binary eqInt opNotEq NotEqualTo
81+ , binary eqString opEq EqualTo
82+ , binary eqString opNotEq NotEqualTo
83+ , binary eqChar opEq EqualTo
84+ , binary eqChar opNotEq NotEqualTo
85+ , binary eqBoolean opEq EqualTo
86+ , binary eqBoolean opNotEq NotEqualTo
87+
88+ , binary ordBoolean opLessThan LessThan
89+ , binary ordBoolean opLessThanOrEq LessThanOrEqualTo
90+ , binary ordBoolean opGreaterThan GreaterThan
91+ , binary ordBoolean opGreaterThanOrEq GreaterThanOrEqualTo
92+ , binary ordChar opLessThan LessThan
93+ , binary ordChar opLessThanOrEq LessThanOrEqualTo
94+ , binary ordChar opGreaterThan GreaterThan
95+ , binary ordChar opGreaterThanOrEq GreaterThanOrEqualTo
96+ , binary ordInt opLessThan LessThan
97+ , binary ordInt opLessThanOrEq LessThanOrEqualTo
98+ , binary ordInt opGreaterThan GreaterThan
99+ , binary ordInt opGreaterThanOrEq GreaterThanOrEqualTo
100+ , binary ordNumber opLessThan LessThan
101+ , binary ordNumber opLessThanOrEq LessThanOrEqualTo
102+ , binary ordNumber opGreaterThan GreaterThan
103+ , binary ordNumber opGreaterThanOrEq GreaterThanOrEqualTo
104+ , binary ordString opLessThan LessThan
105+ , binary ordString opLessThanOrEq LessThanOrEqualTo
106+ , binary ordString opGreaterThan GreaterThan
107+ , binary ordString opGreaterThanOrEq GreaterThanOrEqualTo
108+
109+ , binary semigroupString opAppend Add
110+
111+ , binary heytingAlgebraBoolean opConj And
112+ , binary heytingAlgebraBoolean opDisj Or
113+ , unary heytingAlgebraBoolean opNot Not
114+
115+ , binary' C.dataIntBits C.or BitwiseOr
116+ , binary' C.dataIntBits C.and BitwiseAnd
117+ , binary' C.dataIntBits C.xor BitwiseXor
118+ , binary' C.dataIntBits C.shl ShiftLeft
119+ , binary' C.dataIntBits C.shr ShiftRight
120+ , unary' C.dataIntBits C.complement BitwiseNot
121+
122+ , inlineNonClassFunction (isModFn (C.dataFunction, C.apply)) $ \f x -> App Nothing f [x]
123+ , inlineNonClassFunction (isModFn (C.dataFunction, C.applyFlipped)) $ \x f -> App Nothing f [x]
124+ , inlineUnsafeIndex (isModFnWithDict (C.dataArray, C.unsafeIndex)) $ flip (Indexer Nothing)
125+ ] ++
126+ [ fn | i <- [0..10], fn <- [ mkFn i, runFn i ] ] ++
127+ [ fn | i <- [0..10], fn <- [ mkEffFn C.controlMonadEffUncurried C.mkEffFn i, runEffFn C.controlMonadEffUncurried C.runEffFn i ] ] ++
128+ [ fn | i <- [0..10], fn <- [ mkEffFn C.effectUncurried C.mkEffectFn i, runEffFn C.effectUncurried C.runEffectFn i ] ]
129+ where
130+ binary :: (Text, PSString) -> (Text, PSString) -> BinaryOperator -> AST -> AST
131+ binary dict@(_, d) fns op = convert where
132+ convert :: AST -> AST
133+ convert (App ss (App _ (App _ fn [dict']) [x]) [y])
134+ | isDict dict dict' && isDict fns fn = Binary ss op (unbox x d) (unbox y d)
135+ convert other = other
136+ binary' :: Text -> PSString -> BinaryOperator -> AST -> AST
137+ binary' moduleName opString op = convert where
138+ convert :: AST -> AST
139+ convert (App ss (App _ fn [x]) [y]) | isDict (moduleName, opString) fn = Binary ss op (unbox x mn) (unbox y mn)
140+ convert other = other
141+ mn :: PSString
142+ mn = mkString moduleName
143+ unary :: (Text, PSString) -> (Text, PSString) -> UnaryOperator -> AST -> AST
144+ unary dicts@(_, d) fns op = convert where
145+ convert :: AST -> AST
146+ convert (App ss (App _ fn [dict']) [x]) | isDict dicts dict' && isDict fns fn = Unary ss op (unbox x d)
147+ convert other = other
148+ unary' :: Text -> PSString -> UnaryOperator -> AST -> AST
149+ unary' moduleName fnName op = convert where
150+ convert :: AST -> AST
151+ convert (App ss fn [x]) | isDict (moduleName, fnName) fn = Unary ss op (unbox x fnName)
152+ convert other = other
153+
154+ mkFn :: Int -> AST -> AST
155+ mkFn = mkFn' C.dataFunctionUncurried C.mkFn $ \ss1 ss2 ss3 args il ->
156+ Function ss1 Nothing args (Block ss2 [Return ss3 il])
157+
158+ mkEffFn :: Text -> Text -> Int -> AST -> AST
159+ mkEffFn modName fnName = mkFn' modName fnName $ \ss1 ss2 ss3 args il ->
160+ Function ss1 Nothing args (Block ss2 [Return ss3 (App ss3 il [])])
161+
162+ mkFn' :: Text -> Text -> (Maybe SourceSpan -> Maybe SourceSpan -> Maybe SourceSpan -> [Text] -> AST -> AST) -> Int -> AST -> AST
163+ mkFn' modName fnName res 0 = convert where
164+ convert :: AST -> AST
165+ convert (App _ mkFnN [Function s1 Nothing [_] (Block s2 [Return s3 il])]) | isNFn modName fnName 0 mkFnN =
166+ res s1 s2 s3 [] il
167+ convert other = other
168+ mkFn' modName fnName res n = convert where
169+ convert :: AST -> AST
170+ convert orig@(App ss mkFnN [fn]) | isNFn modName fnName n mkFnN =
171+ case collectArgs n [] fn of
172+ Just (args, [Return ss' ret]) -> res ss ss ss' args ret
173+ _ -> orig
174+ convert other = other
175+ collectArgs :: Int -> [Text] -> AST -> Maybe ([Text], [AST])
176+ collectArgs 1 acc (Function _ Nothing [oneArg] (Block _ il)) | length acc == n - 1 = Just (reverse (oneArg : acc), il)
177+ collectArgs m acc (Function _ Nothing [oneArg] (Block _ [Return _ ret])) = collectArgs (m - 1) (oneArg : acc) ret
178+ collectArgs _ _ _ = Nothing
179+
180+ isNFn :: Text -> Text -> Int -> AST -> Bool
181+ isNFn expectMod prefix n (Indexer _ (Var _ name) (Var _ modName)) | modName == expectMod =
182+ name == fromString (T.unpack prefix <> show n)
183+ isNFn _ _ _ _ = False
184+
185+ runFn :: Int -> AST -> AST
186+ runFn = runFn' C.dataFunctionUncurried C.runFn (\ss f args ->
187+ let len = length args
188+ typ = mkString $ uncurriedFnType len in
189+ if len > 0
190+ then App ss (App Nothing (StringLiteral Nothing typ) [f]) args
191+ else App ss f args)
192+ runEffFn :: Text -> Text -> Int -> AST -> AST
193+ runEffFn modName fnName = runFn' modName fnName $ \ss fn acc ->
194+ let typ = mkString . uncurriedFnType $ length acc in
195+ Function ss Nothing [] (Block ss [Return ss (App ss (App Nothing (StringLiteral Nothing typ) [fn]) acc)])
196+
197+ runFn' :: Text -> Text -> (Maybe SourceSpan -> AST -> [AST] -> AST) -> Int -> AST -> AST
198+ runFn' modName runFnName res n = convert where
199+ convert :: AST -> AST
200+ convert il = fromMaybe il $ go n [] il
201+
202+ go :: Int -> [AST] -> AST -> Maybe AST
203+ go 0 acc (App ss runFnN [fn]) | isNFn modName runFnName n runFnN && length acc == n =
204+ Just $ res ss fn acc
205+ go m acc (App _ lhs [arg]) = go (m - 1) (arg : acc) lhs
206+ go _ _ _ = Nothing
207+
208+ inlineNonClassFunction :: (AST -> Bool) -> (AST -> AST -> AST) -> AST -> AST
209+ inlineNonClassFunction p f = convert where
210+ convert :: AST -> AST
211+ convert (App _ (App _ op' [x]) [y]) | p op' = f x y
212+ convert other = other
213+
214+ inlineUnsafeIndex :: (AST -> Bool) -> (AST -> AST -> AST) -> AST -> AST
215+ inlineUnsafeIndex p _ = convert where
216+ convert :: AST -> AST
217+ convert (App _ (App ss op' [x]) [y@NumericLiteral{}])
218+ | p op' = Indexer ss y x
219+ convert (App _ (App ss op' [x]) [y])
220+ | p op' = App ss (Var Nothing indexFn) [x, y]
221+ convert other = other
222+
223+ isModFn :: (Text, PSString) -> AST -> Bool
224+ isModFn (m, op) (Indexer _ (Var _ op') (Var _ m')) =
225+ m == m' && decodeString op == Just op'
226+ isModFn _ _ = False
227+
228+ isModFnWithDict :: (Text, PSString) -> AST -> Bool
229+ isModFnWithDict (m, op) (App _ (Indexer _ (Var _ op') (Var _ m')) [Var _ _]) =
230+ m == m' && decodeString op == Just op'
231+ isModFnWithDict _ _ = False
232+
233+-- (f <<< g $ x) = f (g x)
234+-- (f <<< g) = \x -> f (g x)
235+inlineFnComposition :: forall m. MonadSupply m => AST -> m AST
236+inlineFnComposition = everywhereTopDownM convert where
237+ convert :: AST -> m AST
238+ convert (App s1 (App s2 (App _ (App _ fn [dict']) [x]) [y]) [z])
239+ | isFnCompose dict' fn = return $ App s1 x [App s2 y [z]]
240+ | isFnComposeFlipped dict' fn = return $ App s2 y [App s1 x [z]]
241+ convert app@(App ss (App _ (App _ fn [dict']) _) _)
242+ | isFnCompose dict' fn || isFnComposeFlipped dict' fn = mkApps ss <$> goApps app <*> freshName'
243+ convert other = return other
244+
245+ mkApps :: Maybe SourceSpan -> [Either AST (Text, AST)] -> Text -> AST
246+ mkApps ss fns a = App ss (Function ss Nothing [] (Block ss $ vars <> [Return Nothing comp])) []
247+ where
248+ vars = uncurry (VariableIntroduction ss) . fmap Just <$> rights fns
249+ comp = Function ss Nothing [a] (Block ss [Return Nothing apps])
250+ apps = foldr (\fn acc -> App ss (mkApp fn) [acc]) (Var ss a) fns
251+
252+ mkApp :: Either AST (Text, AST) -> AST
253+ mkApp = either id $ \(name, arg) -> Var (getSourceSpan arg) name
254+
255+ goApps :: AST -> m [Either AST (Text, AST)]
256+ goApps (App _ (App _ (App _ fn [dict']) [x]) [y])
257+ | isFnCompose dict' fn = mappend <$> goApps x <*> goApps y
258+ | isFnComposeFlipped dict' fn = mappend <$> goApps y <*> goApps x
259+ goApps app@(App {}) = pure . Right . (,app) <$> freshName'
260+ goApps other = pure [Left other]
261+
262+ isFnCompose :: AST -> AST -> Bool
263+ isFnCompose dict' fn = isDict semigroupoidFn dict' && isDict fnCompose fn
264+
265+ isFnComposeFlipped :: AST -> AST -> Bool
266+ isFnComposeFlipped dict' fn = isDict semigroupoidFn dict' && isDict fnComposeFlipped fn
267+
268+ fnCompose :: forall a b. (IsString a, IsString b) => (a, b)
269+ fnCompose = (C.controlSemigroupoid, C.compose)
270+
271+ fnComposeFlipped :: forall a b. (IsString a, IsString b) => (a, b)
272+ fnComposeFlipped = (C.controlSemigroupoid, C.composeFlipped)
273+
274+inlineUnsafeCoerce :: AST -> AST
275+inlineUnsafeCoerce = everywhereTopDown convert where
276+ convert (App _ (Indexer _ (Var _ unsafeCoerceFn) (Var _ unsafeCoerce)) [ comp ])
277+ | unsafeCoerceFn == C.unsafeCoerceFn && unsafeCoerce == C.unsafeCoerce
278+ = comp
279+ convert other = other
280+
281+inlineUnsafePartial :: AST -> AST
282+inlineUnsafePartial = everywhereTopDown convert where
283+ convert (App ss fn [ comp ])
284+ | isDict fnUnsafePartial fn
285+ = App ss comp []
286+ where
287+ fnUnsafePartial :: forall a b. (IsString a, IsString b) => (a, b)
288+ fnUnsafePartial = (C.partialUnsafe, C.unsafePartial)
289+ convert other = other
290+
291+semiringNumber :: forall a b. (IsString a, IsString b) => (a, b)
292+semiringNumber = (C.dataSemiring, C.semiringNumber)
293+
294+semiringInt :: forall a b. (IsString a, IsString b) => (a, b)
295+semiringInt = (C.dataSemiring, C.semiringInt)
296+
297+ringNumber :: forall a b. (IsString a, IsString b) => (a, b)
298+ringNumber = (C.dataRing, C.ringNumber)
299+
300+ringInt :: forall a b. (IsString a, IsString b) => (a, b)
301+ringInt = (C.dataRing, C.ringInt)
302+
303+euclideanRingNumber :: forall a b. (IsString a, IsString b) => (a, b)
304+euclideanRingNumber = (C.dataEuclideanRing, C.euclideanRingNumber)
305+
306+-- eqNumber :: forall a b. (IsString a, IsString b) => (a, b)
307+-- eqNumber = (C.dataEq, C.eqNumber)
308+
309+eqInt :: forall a b. (IsString a, IsString b) => (a, b)
310+eqInt = (C.dataEq, C.eqInt)
311+
312+eqString :: forall a b. (IsString a, IsString b) => (a, b)
313+eqString = (C.dataEq, C.eqString)
314+
315+eqChar :: forall a b. (IsString a, IsString b) => (a, b)
316+eqChar = (C.dataEq, C.eqChar)
317+
318+eqBoolean :: forall a b. (IsString a, IsString b) => (a, b)
319+eqBoolean = (C.dataEq, C.eqBoolean)
320+
321+ordBoolean :: forall a b. (IsString a, IsString b) => (a, b)
322+ordBoolean = (C.dataOrd, C.ordBoolean)
323+
324+ordNumber :: forall a b. (IsString a, IsString b) => (a, b)
325+ordNumber = (C.dataOrd, C.ordNumber)
326+
327+ordInt :: forall a b. (IsString a, IsString b) => (a, b)
328+ordInt = (C.dataOrd, C.ordInt)
329+
330+ordString :: forall a b. (IsString a, IsString b) => (a, b)
331+ordString = (C.dataOrd, C.ordString)
332+
333+ordChar :: forall a b. (IsString a, IsString b) => (a, b)
334+ordChar = (C.dataOrd, C.ordChar)
335+
336+semigroupString :: forall a b. (IsString a, IsString b) => (a, b)
337+semigroupString = (C.dataSemigroup, C.semigroupString)
338+
339+boundedBoolean :: forall a b. (IsString a, IsString b) => (a, b)
340+boundedBoolean = (C.dataBounded, C.boundedBoolean)
341+
342+heytingAlgebraBoolean :: forall a b. (IsString a, IsString b) => (a, b)
343+heytingAlgebraBoolean = (C.dataHeytingAlgebra, C.heytingAlgebraBoolean)
344+
345+semigroupoidFn :: forall a b. (IsString a, IsString b) => (a, b)
346+semigroupoidFn = (C.controlSemigroupoid, C.semigroupoidFn)
347+
348+opAdd :: forall a b. (IsString a, IsString b) => (a, b)
349+opAdd = (C.dataSemiring, C.add)
350+
351+opMul :: forall a b. (IsString a, IsString b) => (a, b)
352+opMul = (C.dataSemiring, C.mul)
353+
354+opEq :: forall a b. (IsString a, IsString b) => (a, b)
355+opEq = (C.dataEq, C.eq)
356+
357+opNotEq :: forall a b. (IsString a, IsString b) => (a, b)
358+opNotEq = (C.dataEq, C.notEq)
359+
360+opLessThan :: forall a b. (IsString a, IsString b) => (a, b)
361+opLessThan = (C.dataOrd, C.lessThan)
362+
363+opLessThanOrEq :: forall a b. (IsString a, IsString b) => (a, b)
364+opLessThanOrEq = (C.dataOrd, C.lessThanOrEq)
365+
366+opGreaterThan :: forall a b. (IsString a, IsString b) => (a, b)
367+opGreaterThan = (C.dataOrd, C.greaterThan)
368+
369+opGreaterThanOrEq :: forall a b. (IsString a, IsString b) => (a, b)
370+opGreaterThanOrEq = (C.dataOrd, C.greaterThanOrEq)
371+
372+opAppend :: forall a b. (IsString a, IsString b) => (a, b)
373+opAppend = (C.dataSemigroup, C.append)
374+
375+opSub :: forall a b. (IsString a, IsString b) => (a, b)
376+opSub = (C.dataRing, C.sub)
377+
378+opNegate :: forall a b. (IsString a, IsString b) => (a, b)
379+opNegate = (C.dataRing, C.negate)
380+
381+opDiv :: forall a b. (IsString a, IsString b) => (a, b)
382+opDiv = (C.dataEuclideanRing, C.div)
383+
384+opConj :: forall a b. (IsString a, IsString b) => (a, b)
385+opConj = (C.dataHeytingAlgebra, C.conj)
386+
387+opDisj :: forall a b. (IsString a, IsString b) => (a, b)
388+opDisj = (C.dataHeytingAlgebra, C.disj)
389+
390+opNot :: forall a b. (IsString a, IsString b) => (a, b)
391+opNot = (C.dataHeytingAlgebra, C.not)
392+
393+unbox :: AST -> PSString -> AST
394+unbox e d = select . inlineCommonValues $ inlineCommonOperators e
395+ where
396+ select :: AST -> AST
397+ select e' =
398+ case e' of
399+ Var{} -> unbox' e'
400+ App{} -> unbox' e'
401+ Indexer{} -> unbox' e'
402+ _ -> e'
403+ unbox' :: AST -> AST
404+ unbox' e' = maybe e' (\t -> App Nothing (StringLiteral Nothing t) [e']) $ unboxType d
405+
406+unboxType :: PSString -> Maybe PSString
407+unboxType s = do
408+ t <- decodeString s
409+ t' <- unboxType' t
410+ return $ mkString t'
411+ where
412+ unboxType' :: Text -> Maybe Text
413+ unboxType' t
414+ | t == C.eqInt ||
415+ t == C.semiringInt ||
416+ t == C.ringInt ||
417+ t == C.ordInt ||
418+ t == C.dataIntBits
419+ = Just int
420+ | t == C.semiringNumber ||
421+ t == C.ringNumber ||
422+ t == C.ordNumber ||
423+ t == C.euclideanRingNumber
424+ = Just float
425+ | t == C.eqBoolean ||
426+ t == C.ordBoolean ||
427+ t == C.heytingAlgebraBoolean
428+ = Just bool
429+ | t == C.eqChar ||
430+ t == C.eqString ||
431+ t == C.ordChar ||
432+ t == C.ordString ||
433+ t == C.semigroupString
434+ = Just string
435+ | otherwise = Nothing
src/CodeGen/IL/Optimizer/MagicDo.hsnew file+146
@@ -0,0 +1,146 @@
1+-- | This module implements the "Magic Do" optimization, which inlines calls to return
2+-- and bind for the Eff monad, as well as some of its actions.
3+module CodeGen.IL.Optimizer.MagicDo (magicDoEffect, magicDoEff, magicDoST, inlineST) where
4+
5+import Prelude.Compat
6+import Protolude (ordNub)
7+
8+import Data.Maybe (fromJust, isJust)
9+import Data.Text (Text)
10+
11+import Language.PureScript.CoreImp.AST
12+import Language.PureScript.CoreImp.Optimizer.Common hiding (isDict)
13+import Language.PureScript.PSString (PSString, decodeString, mkString)
14+import qualified Language.PureScript.Constants as C
15+
16+import CodeGen.IL.Common (undefinedName, unusedName)
17+import CodeGen.IL.Optimizer.Common
18+
19+-- | Inline type class dictionaries for >>= and return for the Eff monad
20+--
21+-- E.g.
22+--
23+-- Prelude[">>="](dict)(m1)(function(x) {
24+-- return ...;
25+-- })
26+--
27+-- becomes
28+--
29+-- function __do {
30+-- var x = m1();
31+-- ...
32+-- }
33+magicDoEff :: AST -> AST
34+magicDoEff = magicDo C.eff C.effDictionaries
35+
36+magicDoEffect :: AST -> AST
37+magicDoEffect = magicDo C.effect C.effectDictionaries
38+
39+magicDoST :: AST -> AST
40+magicDoST = magicDo C.st C.stDictionaries
41+
42+magicDo :: Text -> C.EffectDictionaries -> AST -> AST
43+magicDo effectModule C.EffectDictionaries{..} = everywhereTopDown convert
44+ where
45+ -- Desugar monomorphic calls to >>= and return for the Eff monad
46+ convert :: AST -> AST
47+ -- Desugar pure
48+ convert (App _ (App _ pure' [val]) []) | isPure pure' = val
49+ -- Desugar discard
50+ convert (App _ (App _ bind [m]) [Function s1 Nothing [unused] (Block s2 il)]) | isDiscard bind && unused == unusedName =
51+ Function s1 Nothing [] $ Block s2 (App s2 m [] : map applyReturns il )
52+ -- Desugar bind
53+ convert (App _ (App _ bind [m]) [Function s1 Nothing [arg] (Block s2 il)]) | isBind bind =
54+ Function s1 Nothing [] $ Block s2 (VariableIntroduction s2 arg (Just (App s2 m [])) : map applyReturns il)
55+ -- Desugar untilE
56+ convert (App s1 (App _ f [arg]) []) | isEffFunc edUntil f =
57+ App s1 (Function s1 Nothing [] (Block s1 [ While s1 (Unary s1 Not (App s1 arg [])) (Block s1 []), Return s1 $ ObjectLiteral s1 []])) []
58+ -- Desugar whileE
59+ convert (App _ (App _ (App s1 f [arg1]) [arg2]) []) | isEffFunc edWhile f =
60+ App s1 (Function s1 Nothing [] (Block s1 [ While s1 (App s1 arg1 []) (Block s1 [ App s1 arg2 [] ]), Return s1 $ ObjectLiteral s1 []])) []
61+ -- -- Inline __do returns
62+ -- convert (Return _ (App _ (Function _ (Just ident) [] body) [])) | ident == fnName = body
63+ -- Inline double applications
64+ convert (App _ (App s1 (Function s2 Nothing [] (Block ss body)) []) []) =
65+ App s1 (Function s2 Nothing [] (Block ss (applyReturns `fmap` body))) []
66+ convert other = other
67+ -- Check if an expression represents a monomorphic call to >>= for the Eff monad
68+ isBind (App _ fn [dict]) | isDict (effectModule, edBindDict) dict && isBindPoly fn = True
69+ isBind _ = False
70+ -- Check if an expression represents a call to @discard@
71+ isDiscard (App _ (App _ fn [dict1]) [dict2])
72+ | isDict (C.controlBind, C.discardUnitDictionary) dict1 &&
73+ isDict (effectModule, edBindDict) dict2 &&
74+ isDiscardPoly fn = True
75+ isDiscard _ = False
76+
77+ -- Check if an expression represents a monomorphic call to pure or return for the Eff applicative
78+ isPure (App _ fn [dict]) | isDict (effectModule, edApplicativeDict) dict && isPurePoly fn = True
79+ isPure _ = False
80+ -- Check if an expression represents the polymorphic >>= function
81+ isBindPoly = isDict (C.controlBind, C.bind)
82+ -- Check if an expression represents the polymorphic pure function
83+ isPurePoly = isDict (C.controlApplicative, C.pure')
84+ -- Check if an expression represents the polymorphic discard function
85+ isDiscardPoly = isDict (C.controlBind, C.discard)
86+ -- Check if an expression represents a function in the Effect module
87+ isEffFunc name (Indexer _ (StringLiteral _ name') (Var _ eff)) = eff == effectModule && name == name'
88+ isEffFunc _ _ = False
89+
90+ applyReturns :: AST -> AST
91+ applyReturns (Return ss ret) = Return ss (App ss ret [])
92+ applyReturns (Block ss ils) = Block ss (map applyReturns ils)
93+ applyReturns (While ss cond il) = While ss cond (applyReturns il)
94+ applyReturns (For ss v lo hi il) = For ss v lo hi (applyReturns il)
95+ applyReturns (ForIn ss v xs il) = ForIn ss v xs (applyReturns il)
96+ applyReturns (IfElse ss cond t f) = IfElse ss cond (applyReturns t) (applyReturns `fmap` f)
97+ applyReturns other = other
98+
99+-- | Inline functions in the ST module
100+inlineST :: AST -> AST
101+inlineST = everywhere convertBlock
102+ where
103+ -- Look for runST blocks and inline the STRefs there.
104+ -- If all STRefs are used in the scope of the same runST, only using { read, write, modify }STRef then
105+ -- we can be more aggressive about inlining, and actually turn STRefs into local variables.
106+ convertBlock (App s1 f [arg]) | isSTFunc C.runST f =
107+ let refs = ordNub . findSTRefsIn $ arg
108+ usages = findAllSTUsagesIn arg
109+ allUsagesAreLocalVars = all (\u -> let v = toVar u in isJust v && fromJust v `elem` refs) usages
110+ localVarsDoNotEscape = all (\r -> length (r `appearingIn` arg) == length (filter (\u -> let v = toVar u in v == Just r) usages)) refs
111+ in App s1 (everywhere (convert (allUsagesAreLocalVars && localVarsDoNotEscape)) arg) []
112+ convertBlock other = other
113+ -- Convert a block in a safe way, preserving object wrappers of references,
114+ -- or in a more aggressive way, turning wrappers into local variables depending on the
115+ -- agg(ressive) parameter.
116+ convert agg (App s1 f [arg]) | isSTFunc C.newSTRef f =
117+ Function s1 Nothing [] (Block s1 [Return s1 $ if agg then arg else ObjectLiteral s1 [(mkString C.stRefValue, arg)]])
118+ convert agg (App _ (App s1 f [ref]) []) | isSTFunc C.readSTRef f =
119+ if agg then ref else Indexer s1 (StringLiteral s1 C.stRefValue) ref
120+ convert agg (App _ (App _ (App s1 f [arg]) [ref]) []) | isSTFunc C.writeSTRef f =
121+ if agg then Assignment s1 ref arg else Assignment s1 (Indexer s1 (StringLiteral s1 C.stRefValue) ref) arg
122+ convert agg (App _ (App _ (App s1 f [func]) [ref]) []) | isSTFunc C.modifySTRef f =
123+ if agg then Assignment s1 ref (App s1 func [ref]) else Assignment s1 (Indexer s1 (StringLiteral s1 C.stRefValue) ref) (App s1 func [Indexer s1 (StringLiteral s1 C.stRefValue) ref])
124+ convert _ other = other
125+ -- Check if an expression represents a function in the ST module
126+ isSTFunc name (Indexer _ (StringLiteral _ name') (Var _ st)) = st == C.st && name == name'
127+ isSTFunc _ _ = False
128+ -- Find all ST Refs initialized in this block
129+ findSTRefsIn = everything (++) isSTRef
130+ where
131+ isSTRef (VariableIntroduction _ ident (Just (App _ (App _ f [_]) []))) | isSTFunc C.newSTRef f = [ident]
132+ isSTRef _ = []
133+ -- Find all STRefs used as arguments to readSTRef, writeSTRef, modifySTRef
134+ findAllSTUsagesIn = everything (++) isSTUsage
135+ where
136+ isSTUsage (App _ (App _ f [ref]) []) | isSTFunc C.readSTRef f = [ref]
137+ isSTUsage (App _ (App _ (App _ f [_]) [ref]) []) | isSTFunc C.writeSTRef f || isSTFunc C.modifySTRef f = [ref]
138+ isSTUsage _ = []
139+ -- Find all uses of a variable
140+ appearingIn ref = everything (++) isVar
141+ where
142+ isVar e@(Var _ v) | v == ref = [e]
143+ isVar _ = []
144+ -- Convert a AST value to a String if it is a Var
145+ toVar (Var _ v) = Just v
146+ toVar _ = Nothing
src/CodeGen/IL/Optimizer/TCO.hsnew file+141
@@ -0,0 +1,141 @@
1+module CodeGen.IL.Optimizer.TCO (tco, tcoLoop) where
2+
3+import Prelude.Compat
4+
5+import Data.Text (Text)
6+import Data.Monoid ((<>))
7+import Language.PureScript.CoreImp.AST
8+import Language.PureScript.AST.SourcePos (SourceSpan)
9+import Safe (headDef, tailSafe)
10+import CodeGen.IL.Common
11+
12+import qualified Language.PureScript.Constants as C
13+
14+tcoLoop :: Text
15+tcoLoop = "ṩtco_loop"
16+
17+tco :: AST -> AST -> AST
18+tco mn = everywhere convert where
19+ tcoVar :: Text -> Text
20+ tcoVar arg = "ṩtco_var_" <> arg
21+
22+ copyVar :: Text -> Text
23+ copyVar arg = "ṩcopy_" <> arg
24+
25+ tcoDone :: Text
26+ tcoDone = "ṩtco_done"
27+
28+ tcoResult :: Text
29+ tcoResult = "ṩtco_result"
30+
31+ convert :: AST -> AST
32+ convert fn@(Function ss (Just name) args _)
33+ | isTailRecursive name body'
34+ = replace (toLoop name outerArgs innerArgs body')
35+ where
36+ innerArgs = headDef [] argss
37+ outerArgs = concat . reverse $ tailSafe argss
38+ (argss, body', replace) = collectAllFunctionArgs [] id fn
39+ convert (Assignment ss (Var _ name) fn@(Function _ Nothing _ _))
40+ | isTailRecursive name body'
41+ = Assignment ss (Var ss name) (replace (toLoop name outerArgs innerArgs body'))
42+ where
43+ innerArgs = headDef [] argss
44+ outerArgs = concat . reverse $ tailSafe argss
45+ (argss, body', replace) = collectAllFunctionArgs [] id fn
46+ convert js = js
47+
48+ collectAllFunctionArgs :: [[Text]] -> (AST -> AST) -> AST -> ([[Text]], AST, AST -> AST)
49+ collectAllFunctionArgs allArgs f (Function s1 ident args (Block s2 (body@(Return _ _):_))) =
50+ collectAllFunctionArgs (args : allArgs) (\b -> f (Function s1 ident (map copyVar args) (Block s2 [b]))) body
51+ collectAllFunctionArgs allArgs f (Function ss ident args body@(Block _ _)) =
52+ (args : allArgs, body, f . Function ss ident (map copyVar args))
53+ collectAllFunctionArgs allArgs f (Return s1 (Function s2 ident args (Block s3 [body]))) =
54+ collectAllFunctionArgs (args : allArgs) (\b -> f (Return s1 (Function s2 ident (map copyVar args) (Block s3 [b])))) body
55+ collectAllFunctionArgs allArgs f (Return s1 (Function s2 ident args body@(Block _ _))) =
56+ (args : allArgs, body, f . Return s1 . Function s2 ident (map copyVar args))
57+ collectAllFunctionArgs allArgs f body = (allArgs, body, f)
58+
59+ isTailRecursive :: Text -> AST -> Bool
60+ isTailRecursive ident js = countSelfReferences js > 0 && allInTailPosition js where
61+ countSelfReferences = everything (+) match where
62+ match :: AST -> Int
63+ match (Var _ ident') | ident == ident' = 1
64+ match _ = 0
65+
66+ allInTailPosition (Return _ expr)
67+ | isSelfCall ident expr = countSelfReferences expr == 1
68+ | otherwise = countSelfReferences expr == 0
69+ allInTailPosition (While _ js1 body)
70+ = countSelfReferences js1 == 0 && allInTailPosition body
71+ allInTailPosition (For _ _ js1 js2 body)
72+ = countSelfReferences js1 == 0 && countSelfReferences js2 == 0 && allInTailPosition body
73+ allInTailPosition (ForIn _ _ js1 body)
74+ = countSelfReferences js1 == 0 && allInTailPosition body
75+ allInTailPosition (IfElse _ js1 body el)
76+ = countSelfReferences js1 == 0 && allInTailPosition body && all allInTailPosition el
77+ allInTailPosition (Block _ body)
78+ = all allInTailPosition body
79+ allInTailPosition (Throw _ js1)
80+ = countSelfReferences js1 == 0
81+ allInTailPosition (ReturnNoResult _)
82+ = True
83+ allInTailPosition (VariableIntroduction _ _ js1)
84+ = all ((== 0) . countSelfReferences) js1
85+ allInTailPosition (Assignment _ _ js1)
86+ = countSelfReferences js1 == 0
87+ allInTailPosition (Comment _ _ js1)
88+ = allInTailPosition js1
89+ allInTailPosition _
90+ = False
91+
92+ toLoop :: Text -> [Text] -> [Text] -> AST -> AST
93+ toLoop ident outerArgs innerArgs js =
94+ Block rootSS $
95+ concatMap (\arg -> [ VariableIntroduction rootSS (tcoVar arg) . Just $
96+ Var rootSS (copyVar arg) ]) (outerArgs ++ innerArgs) ++
97+ [ Assignment rootSS (Var rootSS $ "var " <> tcoDone) $ BooleanLiteral Nothing False
98+ , VariableIntroduction rootSS tcoResult Nothing
99+ , Assignment rootSS (Var rootSS $ "var " <> tcoLoop) (Function rootSS (Just tcoLoop) (outerArgs ++ innerArgs) (Block rootSS [loopify js]))
100+ , While rootSS (Unary Nothing Not (Var rootSS tcoDone))
101+ (Block rootSS
102+ [(Assignment rootSS (Var rootSS tcoResult) (App rootSS (Var rootSS tcoLoop) ((map (Var rootSS . tcoVar) outerArgs) ++ (map (Var rootSS . copyVar) innerArgs))))])
103+ , Return rootSS (Var rootSS tcoResult)
104+ ]
105+ where
106+ rootSS = Nothing
107+
108+ loopify :: AST -> AST
109+ loopify (Return ss ret)
110+ | isSelfCall ident ret =
111+ let
112+ allArgumentValues = concat $ collectArgs [] ret
113+ in
114+ Block ss $
115+ zipWith (\val arg ->
116+ Assignment ss (Var ss (tcoVar arg)) val) allArgumentValues outerArgs
117+ ++ zipWith (\val arg ->
118+ Assignment ss (Var ss (copyVar arg)) val) (drop (length outerArgs) allArgumentValues) innerArgs
119+ ++ [ ReturnNoResult ss ]
120+ | otherwise = Block ss [ markDone ss, Return ss ret ]
121+ loopify (ReturnNoResult ss) = Block ss [ markDone ss, ReturnNoResult ss ]
122+ loopify (While ss cond body) = While ss cond (loopify body)
123+ loopify (For ss i js1 js2 body) = For ss i js1 js2 (loopify body)
124+ loopify (ForIn ss i js1 body) = ForIn ss i js1 (loopify body)
125+ loopify (IfElse ss cond body el) = IfElse ss cond (loopify body) (fmap loopify el)
126+ loopify (Block ss body) = Block ss (map loopify body)
127+ loopify other = other
128+
129+ markDone :: Maybe SourceSpan -> AST
130+ markDone ss = Assignment ss (Var ss tcoDone) (BooleanLiteral ss True)
131+
132+ collectArgs :: [[AST]] -> AST -> [[AST]]
133+ collectArgs acc (App _ fn args') = collectArgs (args' : acc) fn
134+ collectArgs acc _ = acc
135+
136+ isSelfCall :: Text -> AST -> Bool
137+ isSelfCall ident (App _ (Var _ ident') _) = ident == ident'
138+ isSelfCall ident (App _ (Indexer _ (Var _ ident') (Var _ mn')) _) = mn' == "" && ident == ident'
139+ isSelfCall ident (App _ (Indexer _ (Var _ ident') mn') _) = mn' == mn && ident == ident'
140+ isSelfCall ident (App _ fn _) = isSelfCall ident fn
141+ isSelfCall _ _ = False
src/CodeGen/IL/Printer.hsnew file+527
@@ -0,0 +1,527 @@
1+-- | Pretty printer for the AST
2+module CodeGen.IL.Printer
3+ ( prettyPrintIL
4+ , prettyPrintIL1
5+ , prettyPrintILWithSourceMaps
6+ , interfaceSource
7+ , implHeaderSource
8+ , implFooterSource
9+ , isLiteral
10+ , modLabel
11+ , modPrefix
12+ , ffiLoader
13+ ) where
14+
15+import Prelude.Compat
16+
17+import Control.Arrow ((<+>))
18+import Control.Monad (forM, mzero)
19+import Control.Monad.State (StateT, evalStateT)
20+import Control.PatternArrows
21+import Data.List (filter, (\\))
22+import qualified Control.Arrow as A
23+
24+import Data.Maybe (fromMaybe)
25+import Data.Monoid ((<>))
26+import Data.Text (Text)
27+import qualified Data.Text as T
28+
29+import Language.PureScript.AST (SourceSpan(..))
30+import Language.PureScript.CoreImp.AST
31+import Language.PureScript.Comments
32+import Language.PureScript.Crash
33+import Language.PureScript.Names (Ident, runIdent)
34+import Language.PureScript.Pretty.Common
35+import Language.PureScript.PSString (PSString, decodeString, mkString)
36+
37+import CodeGen.IL.Common
38+import CodeGen.IL.Optimizer.TCO (tcoLoop)
39+
40+import qualified Language.PureScript.Constants as C
41+
42+-- TODO (Christoph): Get rid of T.unpack / pack
43+
44+literals :: (Emit gen) => Pattern PrinterState AST gen
45+literals = mkPattern' match'
46+ where
47+ match' :: (Emit gen) => AST -> StateT PrinterState Maybe gen
48+ match' il = (addMapping' (getSourceSpan il) <>) <$> match il
49+
50+ match :: (Emit gen) => AST -> StateT PrinterState Maybe gen
51+ match (NumericLiteral _ n) = return $ emit $ T.pack $ either show show n
52+ match (StringLiteral _ s) = return $ emit $ stringLiteral s
53+ match (BooleanLiteral _ True) = return $ emit "true"
54+ match (BooleanLiteral _ False) = return $ emit "false"
55+ match (ArrayLiteral _ xs) = mconcat <$> sequence
56+ [ return . emit $ arrayType <> "{"
57+ , intercalate (emit ", ") <$> forM xs prettyPrintIL'
58+ , return $ emit "}"
59+ ]
60+ -- match (ObjectLiteral _ []) = return $ emit "std::initializer_list<std::pair<const string, boxed>>{}"
61+ match (ObjectLiteral _ ps) = mconcat <$> sequence
62+ [ return . emit $ dictType <> "{"
63+ , withIndent $ do
64+ ils <- forM ps $ \(key, value) -> do
65+ value' <- prettyPrintIL' value
66+ return $ objectPropertyToString key <> value'
67+ return $ intercalate (emit " ") $ map (<> emit ",") ils
68+ , return $ emit "}"
69+ ]
70+ where
71+ objectPropertyToString :: (Emit gen) => PSString -> gen
72+ objectPropertyToString s = emit $ stringLiteral s <> ": "
73+ match (Block _ sts) = mconcat <$> sequence
74+ [ return $ emit "{\n"
75+ , withIndent $ prettyStatements sts
76+ , return $ emit "\n"
77+ , currentIndent
78+ , return $ emit "}"
79+ ]
80+ match (Var _ ident) | ident == C.undefined = return $ emit undefinedName
81+ match (Var _ ident) = return $ emit ident
82+ match (VariableIntroduction _ ident value) = mconcat <$> sequence
83+ [ return . emit $ varDecl <> " " <> ident <> " " <> anyType
84+ , maybe (return mempty) (fmap (emit " = " <>) . prettyPrintIL') value
85+ ]
86+ match (Assignment _ target value) = mconcat <$> sequence
87+ [ prettyPrintIL' target
88+ , return $ emit " = "
89+ , prettyPrintIL' value
90+ ]
91+ match (App _ val []) = mconcat <$> sequence
92+ [ return $ emit "Run("
93+ , prettyPrintIL' val
94+ , return $ emit ")"
95+ ]
96+ match (App _ (StringLiteral _ u) [arg])
97+ | Just ty <- decodeString u = mconcat <$> sequence
98+ [ prettyPrintIL' arg
99+ , return $ emit ".("
100+ , return $ emit ty
101+ , return $ emit ")"
102+ ]
103+ match (App _ (Var _ fn) [arg]) | fn == arrayLengthFn = mconcat <$> sequence
104+ [ return $ emit fn
105+ , return $ emit "("
106+ , prettyPrintIL' arg
107+ , return $ emit ")"
108+ ]
109+ match (App _ (Var _ fn) args) | fn == indexFn = mconcat <$> sequence
110+ [ return $ emit fn
111+ , return $ emit "("
112+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
113+ , return $ emit ")"
114+ ]
115+ match (App _ (Var _ fn) args) | fn == tcoLoop = mconcat <$> sequence
116+ [ return $ emit fn
117+ , return $ emit "("
118+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
119+ , return $ emit ")"
120+ ]
121+ match (App _ (App Nothing (StringLiteral Nothing fnx) [fn@Function{}]) args)
122+ | Just ftype <- decodeString fnx
123+ , "Fn" `T.isPrefixOf` ftype = mconcat <$> sequence
124+ [ prettyPrintIL' fn
125+ , return $ emit "("
126+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
127+ , return $ emit ")"
128+ ]
129+ match (App _ (App Nothing (StringLiteral Nothing fnx) [fn]) args)
130+ | Just ftype <- decodeString fnx
131+ , "Fn" `T.isPrefixOf` ftype = mconcat <$> sequence
132+ [ prettyPrintIL' fn
133+ , return $ emit ".("
134+ , return $ emit ftype
135+ , return $ emit ")("
136+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
137+ , return $ emit ")"
138+ ]
139+ match app@(App{})
140+ | (val, args) <- unApp app []
141+ , length args > 1
142+ = mconcat <$> sequence
143+ [ return $ emit "Apply("
144+ , prettyPrintIL' val
145+ , return $ emit ", "
146+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
147+ , return $ emit ")"
148+ ]
149+ match (App _ val args) = mconcat <$> sequence
150+ [ return $ emit "Apply("
151+ , prettyPrintIL' val
152+ , return $ emit ", "
153+ , intercalate (emit ", ") <$> forM args prettyPrintIL'
154+ , return $ emit ")"
155+ ]
156+ match (Function _ (Just name) [] (Block _ [Return _ ret]))
157+ | isComplexLiteral ret = mconcat <$> sequence
158+ [ return $ emit "\n"
159+ , return . emit $ varDecl <> " " <> initName name <> " Once\n"
160+ , prettyPrintIL' $ VariableIntroduction Nothing (valueName name) Nothing
161+ , return $ emit "\n\n"
162+ , return $ emit "func "
163+ , return . emit $ withPrefix name
164+ , return . emit $ "() " <> anyType <> " "
165+ , return $ emit "{\n"
166+ , withIndent $ do
167+ indentString <- currentIndent
168+ return $ indentString <> (emit $ initName name <> ".Do(func() {\n") <>
169+ indentString <> indentString <> (emit $ valueName name <> " = ")
170+ , withIndent $ do
171+ case ret of
172+ Function _ Nothing args body -> mconcat <$> sequence
173+ [ return $ emit "func("
174+ , return . emit $ intercalate ", " (renderArg anyType <$> args)
175+ , return . emit $ ") " <> anyType <> " "
176+ , prettyPrintIL' body
177+ ]
178+ _ -> do
179+ prettyPrintIL' ret
180+ , return $ emit "\n"
181+ , withIndent $ do
182+ indentString <- currentIndent
183+ return $ indentString <> (emit $ "})\n" <> "return " <> valueName name <>"\n")
184+ , return $ emit "}\n\n"
185+ ]
186+ match (Function _ (Just name) [] ret) = mconcat <$> sequence
187+ [ return $ emit "func "
188+ , return . emit $ withPrefix name
189+ , return . emit $ "() " <> anyType <> " "
190+ , prettyPrintIL' ret
191+ ]
192+ match (Function _ _ args ret) = mconcat <$> sequence
193+ [ return $ emit "func("
194+ , return . emit $ intercalate ", " (renderArg anyType <$> args)
195+ , return . emit $ ") " <> anyType <> " "
196+ , prettyPrintIL' ret
197+ ]
198+ match (Indexer _ (Var _ name) (Var _ "")) = mconcat <$> sequence
199+ [ prettyPrintIL' (Var Nothing $ withPrefix name)
200+ , return $ emit "()"
201+ ]
202+ match (Indexer _ (Var _ name) val) = mconcat <$> sequence
203+ [ prettyPrintIL' val
204+ , return $ emit "."
205+ , prettyPrintIL' (Var Nothing $ withPrefix name)
206+ , return $ emit "()"
207+ ]
208+ match (Indexer _ prop@StringLiteral{} val@ObjectLiteral{}) = mconcat <$> sequence
209+ [ prettyPrintIL' val
210+ , return $ emit "["
211+ , prettyPrintIL' prop
212+ , return $ emit "]"
213+ ]
214+ match (Indexer _ prop@StringLiteral{} val) = mconcat <$> sequence
215+ [ prettyPrintIL' val
216+ , return $ emit ".("
217+ , return $ emit dictType
218+ , return $ emit ")["
219+ , prettyPrintIL' prop
220+ , return $ emit "]"
221+ ]
222+ match (Indexer _ index val@ArrayLiteral{}) = mconcat <$> sequence
223+ [ prettyPrintIL' val
224+ , return $ emit "["
225+ , prettyPrintIL' index
226+ , return $ emit "]"
227+ ]
228+ match (Indexer _ index val) = mconcat <$> sequence
229+ [ prettyPrintIL' val
230+ , return $ emit ".("
231+ , return $ emit arrayType
232+ , return $ emit ")["
233+ , prettyPrintIL' index
234+ , return $ emit "]"
235+ ]
236+ match (InstanceOf _ val ty) = mconcat <$> sequence
237+ [ return $ emit "Is("
238+ , prettyPrintIL' val
239+ , return $ emit ", "
240+ , prettyPrintIL' ty
241+ , return $ emit ")"
242+ ]
243+ match (While _ cond sts) = mconcat <$> sequence
244+ [ return $ emit "for "
245+ , prettyPrintIL' cond
246+ , return $ emit " "
247+ , prettyPrintIL' sts
248+ ]
249+ match (For _ ident start end sts) = mconcat <$> sequence
250+ [ return $ emit $ "for var " <> ident <> " = "
251+ , prettyPrintIL' start
252+ , return $ emit $ "; " <> ident <> " < "
253+ , prettyPrintIL' end
254+ , return $ emit $ "; " <> ident <> "++ "
255+ , prettyPrintIL' sts
256+ ]
257+ match (ForIn _ ident obj sts) = mconcat <$> sequence
258+ [ return $ emit $ "for var " <> ident <> " in "
259+ , prettyPrintIL' obj
260+ , return $ emit " "
261+ , prettyPrintIL' sts
262+ ]
263+ match (IfElse _ (Binary _ EqualTo cond@Binary{} (BooleanLiteral Nothing True)) thens elses) = mconcat <$> sequence
264+ [ return $ emit "if "
265+ , prettyPrintIL' cond
266+ , return $ emit " "
267+ , prettyPrintIL' thens
268+ , maybe (return mempty) (fmap (emit " else " <>) . prettyPrintIL') elses
269+ ]
270+ match (IfElse _ (Binary _ EqualTo cond@Binary{} (BooleanLiteral Nothing False)) thens elses) = mconcat <$> sequence
271+ [ return $ emit "if !("
272+ , prettyPrintIL' cond
273+ , return $ emit ") "
274+ , prettyPrintIL' thens
275+ , maybe (return mempty) (fmap (emit " else " <>) . prettyPrintIL') elses
276+ ]
277+ match (IfElse _ cond thens elses) = mconcat <$> sequence
278+ [ return $ emit "if "
279+ , prettyPrintIL' cond
280+ , return $ emit " "
281+ , prettyPrintIL' thens
282+ , maybe (return mempty) (fmap (emit " else " <>) . prettyPrintIL') elses
283+ ]
284+ match (Return _ value) = mconcat <$> sequence
285+ [ return $ emit "return "
286+ , prettyPrintIL' value
287+ ]
288+ match (ReturnNoResult _) = return . emit $ "return " <> undefinedName
289+ -- match (Throw _ _) = return mempty
290+ match (Throw _ value) = mconcat <$> sequence
291+ [ return $ emit "panic("
292+ , prettyPrintIL' value
293+ , return $ emit ")"
294+ ]
295+ match (Comment _ com il) = mconcat <$> sequence
296+ [ return $ emit "\n"
297+ , mconcat <$> forM com comment
298+ , prettyPrintIL' il
299+ ]
300+ match _ = mzero
301+
302+ comment :: (Emit gen) => Comment -> StateT PrinterState Maybe gen
303+ comment (LineComment com) = fmap mconcat $ sequence $
304+ [ currentIndent
305+ , return $ emit "//" <> emit com <> emit "\n"
306+ ]
307+ comment (BlockComment com) = fmap mconcat $ sequence $
308+ [ currentIndent
309+ , return $ emit "/**\n"
310+ ] ++
311+ map asLine (T.lines com) ++
312+ [ currentIndent
313+ , return $ emit " */\n"
314+ , currentIndent
315+ ]
316+ where
317+ asLine :: (Emit gen) => Text -> StateT PrinterState Maybe gen
318+ asLine s = do
319+ i <- currentIndent
320+ return $ i <> emit " * " <> (emit . removeComments) s <> emit "\n"
321+
322+ removeComments :: Text -> Text
323+ removeComments t =
324+ case T.stripPrefix "*/" t of
325+ Just rest -> removeComments rest
326+ Nothing -> case T.uncons t of
327+ Just (x, xs) -> x `T.cons` removeComments xs
328+ Nothing -> ""
329+
330+unary' :: (Emit gen) => UnaryOperator -> (AST -> Text) -> Operator PrinterState AST gen
331+unary' op mkStr = Wrap match (<>)
332+ where
333+ match :: (Emit gen) => Pattern PrinterState AST (gen, AST)
334+ match = mkPattern match'
335+ where
336+ match' (Unary _ op' val) | op' == op = Just (emit $ mkStr val, val)
337+ match' _ = Nothing
338+
339+unary :: (Emit gen) => UnaryOperator -> Text -> Operator PrinterState AST gen
340+unary op str = unary' op (const str)
341+
342+negateOperator :: (Emit gen) => Operator PrinterState AST gen
343+negateOperator = unary' Negate (\v -> if isNegate v then "- " else "-")
344+ where
345+ isNegate (Unary _ Negate _) = True
346+ isNegate _ = False
347+
348+binary :: (Emit gen) => BinaryOperator -> Text -> Operator PrinterState AST gen
349+binary op str = AssocL match (\v1 v2 -> v1 <> emit (" " <> str <> " ") <> v2)
350+ where
351+ match :: Pattern PrinterState AST (AST, AST)
352+ match = mkPattern match'
353+ where
354+ match' (Binary _ op' v1 v2) | op' == op = Just (v1, v2)
355+ match' _ = Nothing
356+
357+isLiteral :: AST -> Bool
358+isLiteral Function{} = True
359+isLiteral NumericLiteral{} = True
360+isLiteral StringLiteral{} = True
361+isLiteral BooleanLiteral{} = True
362+isLiteral ObjectLiteral{} = True
363+isLiteral ArrayLiteral{} = True
364+isLiteral _ = False
365+
366+isComplexLiteral :: AST -> Bool
367+-- isComplexLiteral Function{} = True
368+isComplexLiteral ObjectLiteral{} = True
369+isComplexLiteral ArrayLiteral{} = True
370+isComplexLiteral _ = False
371+
372+unApp :: AST -> [AST] -> (AST, [AST])
373+unApp (App _ val [arg]) args = unApp val (arg : args)
374+unApp other args = (other, args)
375+
376+prettyStatements :: (Emit gen) => [AST] -> StateT PrinterState Maybe gen
377+prettyStatements sts = do
378+ ils <- forM sts prettyPrintIL'
379+ indentString <- currentIndent
380+ return $ intercalate (emit "\n") $ map (indentString <>) ils
381+
382+-- | Generate a pretty-printed string representing a collection of C++ expressions at the same indentation level
383+prettyPrintILWithSourceMaps :: [AST] -> (Text, [SMap])
384+prettyPrintILWithSourceMaps il =
385+ let StrPos (_, s, mp) = (fromMaybe (internalError "Incomplete pattern") . flip evalStateT (PrinterState 0) . prettyStatements) il
386+ in (s, mp)
387+
388+prettyPrintIL :: [AST] -> Text
389+prettyPrintIL = maybe (internalError "Incomplete pattern") runPlainString . flip evalStateT (PrinterState 0) . prettyStatements
390+
391+-- | Generate an indented, pretty-printed string representing a C++ expression
392+prettyPrintIL' :: (Emit gen) => AST -> StateT PrinterState Maybe gen
393+prettyPrintIL' = A.runKleisli $ runPattern matchValue
394+ where
395+ matchValue :: (Emit gen) => Pattern PrinterState AST gen
396+ matchValue = buildPrettyPrinter operators (literals <+> fmap parensPos matchValue)
397+ operators :: (Emit gen) => OperatorTable PrinterState AST gen
398+ operators =
399+ OperatorTable [ [ unary New "?" ]
400+ , [ unary Not "!"
401+ , unary BitwiseNot "~"
402+ , unary Positive "+"
403+ , negateOperator ]
404+ , [ binary Multiply "*"
405+ , binary Divide "/"
406+ , binary Modulus "%" ]
407+ , [ binary Add "+"
408+ , binary Subtract "-" ]
409+ , [ binary ShiftLeft "<<"
410+ , binary ShiftRight ">>" ]
411+ , [ binary LessThan "<"
412+ , binary LessThanOrEqualTo "<="
413+ , binary GreaterThan ">"
414+ , binary GreaterThanOrEqualTo ">=" ]
415+ , [ binary EqualTo "=="
416+ , binary NotEqualTo "!=" ]
417+ , [ binary BitwiseAnd "&" ]
418+ , [ binary BitwiseXor "^" ]
419+ , [ binary BitwiseOr "|" ]
420+ , [ binary And "&&" ]
421+ , [ binary Or "||" ]
422+ ]
423+
424+prettyPrintIL1 :: AST -> Text
425+prettyPrintIL1 = maybe (internalError "Incomplete pattern") runPlainString . flip evalStateT (PrinterState 0) . prettyPrintIL'
426+
427+stringLiteral :: PSString -> Text
428+stringLiteral pss | Just s <- decodeString pss = stringLiteral' s
429+ where
430+ stringLiteral' :: Text -> Text
431+ stringLiteral' s = "\"" <> T.concatMap encodeChar s <> "\""
432+ encodeChar :: Char -> Text
433+ encodeChar '\0' = "\\x00"
434+ encodeChar '\b' = "\\b"
435+ encodeChar '\t' = "\\t"
436+ encodeChar '\n' = "\\n"
437+ encodeChar '\v' = "\\v"
438+ encodeChar '\f' = "\\f"
439+ encodeChar '\r' = "\\r"
440+ encodeChar '"' = "\\\""
441+ encodeChar '\\' = "\\\\"
442+ encodeChar c = T.singleton $ c
443+stringLiteral _ = "\"\\uFFFD\""
444+
445+interfaceSource :: Text -> [(Text,Bool)] -> [Ident] -> Text
446+interfaceSource _ _ _ = ""
447+
448+implHeaderSource :: Text -> [Text] -> Text -> Text
449+implHeaderSource mn imports otherPrefix =
450+ "// Code generated by psgo. DO NOT EDIT.\n\n" <>
451+ "package " <> (if mn == "Main" || mn == "Test_Main" then "main" else mn) <> "\n\n" <>
452+ "import . \"" <> runtime <> "\"\n" <>
453+ (if mn == "Main" || mn == "Test_Main"
454+ then "import _ \"" <> otherPrefix <> "/" <> ffiLoader <> "\"\n"
455+ else "\n") <>
456+ "import (\n" <>
457+ (T.concat $ formatImport <$> imports) <> ")\n\n" <>
458+ "type _ = Any\n\n"
459+ where
460+ formatImport :: Text -> Text
461+ formatImport s =
462+ "\t\"" <> otherPrefix <> "/" <> modPrefix <> "/" <> moduleRenamer s <> "\"\n"
463+ moduleRenamer :: Text -> Text
464+ moduleRenamer s
465+ | (s', sfx) <- T.breakOn moduleRenamerMarker s,
466+ not $ T.null sfx = s'
467+ moduleRenamer s = s
468+
469+implFooterSource :: Text -> [Ident] -> Text
470+implFooterSource mn foreigns =
471+ "\n\n\n" <>
472+ (if null foreigns
473+ then ""
474+ else ("// Foreign values\n\n" <>
475+ "var " <> foreignDict <> " = "<> foreignMod <> "(\"" <> mn <> "\")\n\n" <>
476+ (T.concat $ (\foreign' ->
477+ let name = moduleIdentToIL foreign' in
478+ varDecl <> " " <> initName name <> " Once\n" <>
479+ varDecl <> " " <> valueName name <> " " <> anyType <> "\n\n" <>
480+ "func " <>
481+ withPrefix name <>
482+ "() Any { \n" <>
483+ " " <> initName name <> ".Do(func() {\n" <>
484+ " " <> valueName name <> " = " <>
485+ "Get(" <> foreignDict <> ", " <>
486+ (stringLiteral . mkString $ runIdent foreign') <> ")\n" <>
487+ " })\n" <>
488+ " return " <> valueName name <> "\n" <>
489+ "}\n\n") <$> foreigns))) <>
490+ if mn == "Main" || mn == "Test.Main" then mainSource else "\n"
491+ where
492+ mainSource :: Text
493+ mainSource = "\
494+ \func main() {\n\
495+ \ Run(Ꞌmain())\n\
496+ \}\n\n\
497+ \"
498+
499+varDecl :: Text
500+varDecl = "var"
501+
502+renderArg :: Text -> Text -> Text
503+renderArg decl arg = arg <> " " <> decl
504+
505+foreignMod :: Text
506+foreignMod = "Foreign"
507+
508+foreignDict :: Text
509+foreignDict = "foreign"
510+
511+modLabel :: Text
512+modLabel = "purescript-native"
513+
514+modPrefix :: Text
515+modPrefix = modLabel <> "/output"
516+
517+runtime :: Text
518+runtime = "github.com/" <> modLabel <> "/go-runtime"
519+
520+ffiLoader :: Text
521+ffiLoader = modLabel <> "/ffi-loader"
522+
523+initName :: Text -> Text
524+initName s = "ᛌ" <> s <> "_once"
525+
526+valueName :: Text -> Text
527+valueName s = "ᛧ" <> s
src/Control/Monad/Logger.hsdeleted−72
@@ -1,72 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Control.Monad.Logger
4−-- Author : Phil Freeman
5−-- License : MIT (http://opensource.org/licenses/MIT)
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | A replacement for WriterT IO which uses mutable references.
12−--
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE FlexibleInstances #-}
16−{-# LANGUAGE MultiParamTypeClasses #-}
17−{-# LANGUAGE TypeFamilies #-}
18−
19−module Control.Monad.Logger where
20−
21−import Prelude ()
22−import Prelude.Compat
23−
24−import Data.IORef
25−
26−import Control.Monad (ap)
27−import Control.Monad.IO.Class
28−import Control.Monad.Writer.Class
29−import Control.Monad.Base (MonadBase(..))
30−import Control.Monad.Trans.Control (MonadBaseControl(..))
31−
32−-- | A replacement for WriterT IO which uses mutable references.
33−newtype Logger w a = Logger { runLogger :: IORef w -> IO a }
34−
35−-- | Run a Logger computation, starting with an empty log.
36−runLogger' :: (Monoid w) => Logger w a -> IO (a, w)
37−runLogger' l = do
38− r <- newIORef mempty
39− a <- runLogger l r
40− w <- readIORef r
41− return (a, w)
42−
43−instance Functor (Logger w) where
44− fmap f (Logger l) = Logger $ \r -> fmap f (l r)
45−
46−instance (Monoid w) => Applicative (Logger w) where
47− pure = Logger . const . pure
48− (<*>) = ap
49−
50−instance (Monoid w) => Monad (Logger w) where
51− return = pure
52− Logger l >>= f = Logger $ \r -> l r >>= \a -> runLogger (f a) r
53−
54−instance (Monoid w) => MonadIO (Logger w) where
55− liftIO = Logger . const
56−
57−instance (Monoid w) => MonadWriter w (Logger w) where
58− tell w = Logger $ \r -> atomicModifyIORef' r $ \w' -> (mappend w' w, ())
59− listen l = Logger $ \r -> do
60− (a, w) <- liftIO (runLogger' l)
61− atomicModifyIORef' r $ \w' -> (mappend w' w, (a, w))
62− pass l = Logger $ \r -> do
63− ((a, f), w) <- liftIO (runLogger' l)
64− atomicModifyIORef' r $ \w' -> (mappend w' (f w), a)
65−
66−instance (Monoid w) => MonadBase IO (Logger w) where
67− liftBase = liftIO
68−
69−instance (Monoid w) => MonadBaseControl IO (Logger w) where
70− type StM (Logger w) a = a
71− liftBaseWith f = Logger $ \r -> liftBaseWith $ \q -> f (q . flip runLogger r)
72− restoreM = return
src/Control/Monad/Supply.hsdeleted−45
@@ -1,45 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Control.Monad.Supply
4−-- Copyright : (c) Phil Freeman 2014
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Fresh variable supply
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
17−
18−module Control.Monad.Supply where
19−
20−import Prelude ()
21−import Prelude.Compat
22−
23−import Data.Functor.Identity
24−
25−import Control.Monad.State
26−import Control.Monad.Error.Class (MonadError(..))
27−import Control.Monad.Reader
28−import Control.Monad.Writer
29−
30−newtype SupplyT m a = SupplyT { unSupplyT :: StateT Integer m a }
31− deriving (Functor, Applicative, Monad, MonadTrans, MonadError e, MonadWriter w, MonadReader r)
32−
33−runSupplyT :: Integer -> SupplyT m a -> m (a, Integer)
34−runSupplyT n = flip runStateT n . unSupplyT
35−
36−evalSupplyT :: (Functor m) => Integer -> SupplyT m a -> m a
37−evalSupplyT n = fmap fst . runSupplyT n
38−
39−type Supply = SupplyT Identity
40−
41−runSupply :: Integer -> Supply a -> (a, Integer)
42−runSupply n = runIdentity . runSupplyT n
43−
44−evalSupply :: Integer -> Supply a -> a
45−evalSupply n = runIdentity . evalSupplyT n
src/Control/Monad/Supply/Class.hsdeleted−24
@@ -1,24 +0,0 @@
1−{-# LANGUAGE MultiParamTypeClasses #-}
2−
3−-- |
4−-- A class for monads supporting a supply of fresh names
5−--
6−module Control.Monad.Supply.Class where
7−
8−import Control.Monad.Supply
9−import Control.Monad.State
10−
11−class (Monad m) => MonadSupply m where
12− fresh :: m Integer
13−
14−instance (Monad m) => MonadSupply (SupplyT m) where
15− fresh = SupplyT $ do
16− n <- get
17− put (n + 1)
18− return n
19−
20−instance (MonadSupply m) => MonadSupply (StateT s m) where
21− fresh = lift fresh
22−
23−freshName :: (MonadSupply m) => m String
24−freshName = liftM (('$' :) . show) fresh
src/Language/PureScript.hsdeleted−48
@@ -1,48 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- The main compiler module
13−--
14−-----------------------------------------------------------------------------
15−
16−{-# LANGUAGE FlexibleContexts #-}
17−{-# LANGUAGE ScopedTypeVariables #-}
18−
19−module Language.PureScript
20− ( module P
21− , version
22− ) where
23−
24−import Data.Version (Version)
25−
26−import Language.PureScript.AST as P
27−import Language.PureScript.Crash as P
28−import Language.PureScript.Comments as P
29−import Language.PureScript.Environment as P
30−import Language.PureScript.Errors as P hiding (indent)
31−import Language.PureScript.Kinds as P
32−import Language.PureScript.Linter as P
33−import Language.PureScript.Make as P
34−import Language.PureScript.ModuleDependencies as P
35−import Language.PureScript.Names as P
36−import Language.PureScript.Options as P
37−import Language.PureScript.Parser as P
38−import Language.PureScript.Pretty as P
39−import Language.PureScript.Renamer as P
40−import Language.PureScript.Sugar as P
41−import Control.Monad.Supply as P
42−import Language.PureScript.TypeChecker as P
43−import Language.PureScript.Types as P
44−
45−import qualified Paths_purescript as Paths
46−
47−version :: Version
48−version = Paths.version
src/Language/PureScript/AST.hsdeleted−24
@@ -1,24 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.AST
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The initial PureScript AST
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.AST (
16− module AST
17−) where
18−
19−import Language.PureScript.AST.Binders as AST
20−import Language.PureScript.AST.Declarations as AST
21−import Language.PureScript.AST.Operators as AST
22−import Language.PureScript.AST.SourcePos as AST
23−import Language.PureScript.AST.Traversals as AST
24−import Language.PureScript.AST.Exported as AST
src/Language/PureScript/AST/Binders.hsdeleted−98
@@ -1,98 +0,0 @@
1−-- |
2−-- Case binders
3−--
4−module Language.PureScript.AST.Binders where
5−
6−import Language.PureScript.AST.SourcePos
7−import Language.PureScript.Names
8−import Language.PureScript.Comments
9−import Language.PureScript.Types
10−
11−-- |
12−-- Data type for binders
13−--
14−data Binder
15− -- |
16− -- Wildcard binder
17− --
18− = NullBinder
19− -- |
20− -- A binder which matches a boolean literal
21− --
22− | BooleanBinder Bool
23− -- |
24− -- A binder which matches a string literal
25− --
26− | StringBinder String
27− -- |
28− -- A binder which matches a character literal
29− --
30− | CharBinder Char
31− -- |
32− -- A binder which matches a numeric literal
33− --
34− | NumberBinder (Either Integer Double)
35− -- |
36− -- A binder which binds an identifier
37− --
38− | VarBinder Ident
39− -- |
40− -- A binder which matches a data constructor
41− --
42− | ConstructorBinder (Qualified (ProperName 'ConstructorName)) [Binder]
43− -- |
44− -- A operator alias binder. During the rebracketing phase of desugaring,
45− -- this data constructor will be removed.
46− --
47− | OpBinder (Qualified Ident)
48− -- |
49− -- Binary operator application. During the rebracketing phase of desugaring,
50− -- this data constructor will be removed.
51− --
52− | BinaryNoParensBinder Binder Binder Binder
53− -- |
54− -- Explicit parentheses. During the rebracketing phase of desugaring, this
55− -- data constructor will be removed.
56− --
57− -- Note: although it seems this constructor is not used, it _is_ useful,
58− -- since it prevents certain traversals from matching.
59− --
60− | ParensInBinder Binder
61− -- |
62− -- A binder which matches a record and binds its properties
63− --
64− | ObjectBinder [(String, Binder)]
65− -- |
66− -- A binder which matches an array and binds its elements
67− --
68− | ArrayBinder [Binder]
69− -- |
70− -- A binder which binds its input to an identifier
71− --
72− | NamedBinder Ident Binder
73− -- |
74− -- A binder with source position information
75− --
76− | PositionedBinder SourceSpan [Comment] Binder
77− -- |
78− -- A binder with a type annotation
79− --
80− | TypedBinder Type Binder
81− deriving (Show, Read, Eq)
82−
83−-- |
84−-- Collect all names introduced in binders in an expression
85−--
86−binderNames :: Binder -> [Ident]
87−binderNames = go []
88− where
89− go ns (VarBinder name) = name : ns
90− go ns (ConstructorBinder _ bs) = foldl go ns bs
91− go ns (BinaryNoParensBinder b1 b2 b3) = foldl go ns [b1, b2, b3]
92− go ns (ParensInBinder b) = go ns b
93− go ns (ObjectBinder bs) = foldl go ns (map snd bs)
94− go ns (ArrayBinder bs) = foldl go ns bs
95− go ns (NamedBinder name b) = go (name : ns) b
96− go ns (PositionedBinder _ _ b) = go ns b
97− go ns (TypedBinder _ b) = go ns b
98− go ns _ = ns
src/Language/PureScript/AST/Declarations.hsdeleted−475
@@ -1,475 +0,0 @@
1−{-# LANGUAGE ScopedTypeVariables #-}
2−{-# LANGUAGE TemplateHaskell #-}
3−{-# LANGUAGE LambdaCase #-}
4−
5−-- |
6−-- Data types for modules and declarations
7−--
8−module Language.PureScript.AST.Declarations where
9−
10−import Prelude ()
11−import Prelude.Compat
12−
13−import Data.Aeson.TH
14−import Data.List (nub, (\\))
15−import Data.Maybe (mapMaybe)
16−
17−import qualified Data.Map as M
18−
19−import Control.Monad.Identity
20−
21−import Language.PureScript.AST.Binders
22−import Language.PureScript.AST.Operators
23−import Language.PureScript.AST.SourcePos
24−import Language.PureScript.Types
25−import Language.PureScript.Names
26−import Language.PureScript.Kinds
27−import Language.PureScript.TypeClassDictionaries
28−import Language.PureScript.Comments
29−import Language.PureScript.Environment
30−
31−-- |
32−-- A module declaration, consisting of comments about the module, a module name,
33−-- a list of declarations, and a list of the declarations that are
34−-- explicitly exported. If the export list is Nothing, everything is exported.
35−--
36−data Module = Module SourceSpan [Comment] ModuleName [Declaration] (Maybe [DeclarationRef])
37− deriving (Show, Read)
38−
39−-- | Return a module's name.
40−getModuleName :: Module -> ModuleName
41−getModuleName (Module _ _ name _ _) = name
42−
43−-- |
44−-- Add an import declaration for a module if it does not already explicitly import it.
45−--
46−addDefaultImport :: ModuleName -> Module -> Module
47−addDefaultImport toImport m@(Module ss coms mn decls exps) =
48− if isExistingImport `any` decls || mn == toImport then m
49− else Module ss coms mn (ImportDeclaration toImport Implicit Nothing False : decls) exps
50− where
51− isExistingImport (ImportDeclaration mn' _ _ _) | mn' == toImport = True
52− isExistingImport (PositionedDeclaration _ _ d) = isExistingImport d
53− isExistingImport _ = False
54−
55−-- |
56−-- An item in a list of explicit imports or exports
57−--
58−data DeclarationRef
59− -- |
60− -- A type constructor with data constructors
61− --
62− = TypeRef (ProperName 'TypeName) (Maybe [ProperName 'ConstructorName])
63− -- |
64− -- A value
65− --
66− | ValueRef Ident
67− -- |
68− -- A type class
69− --
70− | TypeClassRef (ProperName 'ClassName)
71− -- |
72− -- A type class instance, created during typeclass desugaring (name, class name, instance types)
73− --
74− | TypeInstanceRef Ident
75− -- |
76− -- A module, in its entirety
77− --
78− | ModuleRef ModuleName
79− -- |
80− -- An unspecified ProperName ref. This will be replaced with a TypeClassRef
81− -- or TypeRef during name desugaring.
82− | ProperRef String
83− -- |
84− -- A declaration reference with source position information
85− --
86− | PositionedDeclarationRef SourceSpan [Comment] DeclarationRef
87− deriving (Show, Read)
88−
89−instance Eq DeclarationRef where
90− (TypeRef name dctors) == (TypeRef name' dctors') = name == name' && dctors == dctors'
91− (ValueRef name) == (ValueRef name') = name == name'
92− (TypeClassRef name) == (TypeClassRef name') = name == name'
93− (TypeInstanceRef name) == (TypeInstanceRef name') = name == name'
94− (ModuleRef name) == (ModuleRef name') = name == name'
95− (ProperRef name) == (ProperRef name') = name == name'
96− (PositionedDeclarationRef _ _ r) == r' = r == r'
97− r == (PositionedDeclarationRef _ _ r') = r == r'
98− _ == _ = False
99−
100−isModuleRef :: DeclarationRef -> Bool
101−isModuleRef (PositionedDeclarationRef _ _ r) = isModuleRef r
102−isModuleRef (ModuleRef _) = True
103−isModuleRef _ = False
104−
105−-- |
106−-- Finds duplicate values in a list of declaration refs. The returned values
107−-- are the duplicate refs with data constructors elided, and then a separate
108−-- list of duplicate data constructors.
109−--
110−findDuplicateRefs :: [DeclarationRef] -> ([DeclarationRef], [ProperName 'ConstructorName])
111−findDuplicateRefs refs =
112− let positionless = stripPosInfo `map` refs
113− simplified = simplifyTypeRefs `map` positionless
114− dupeRefs = nub $ simplified \\ nub simplified
115− dupeCtors = concat $ flip mapMaybe positionless $ \case
116− TypeRef _ (Just dctors) ->
117− let dupes = dctors \\ nub dctors
118− in if null dupes then Nothing else Just dupes
119− _ -> Nothing
120− in (dupeRefs, dupeCtors)
121− where
122− stripPosInfo (PositionedDeclarationRef _ _ ref) = stripPosInfo ref
123− stripPosInfo other = other
124− simplifyTypeRefs (TypeRef pn _) = TypeRef pn Nothing
125− simplifyTypeRefs other = other
126−
127−-- |
128−-- The data type which specifies type of import declaration
129−--
130−data ImportDeclarationType
131− -- |
132− -- An import with no explicit list: `import M`.
133− --
134− = Implicit
135− -- |
136− -- An import with an explicit list of references to import: `import M (foo)`
137− --
138− | Explicit [DeclarationRef]
139− -- |
140− -- An import with a list of references to hide: `import M hiding (foo)`
141− --
142− | Hiding [DeclarationRef]
143− deriving (Eq, Show, Read)
144−
145−isImplicit :: ImportDeclarationType -> Bool
146−isImplicit Implicit = True
147−isImplicit _ = False
148−
149−isExplicit :: ImportDeclarationType -> Bool
150−isExplicit (Explicit _) = True
151−isExplicit _ = False
152−
153−-- |
154−-- The data type of declarations
155−--
156−data Declaration
157− -- |
158− -- A data type declaration (data or newtype, name, arguments, data constructors)
159− --
160− = DataDeclaration DataDeclType (ProperName 'TypeName) [(String, Maybe Kind)] [(ProperName 'ConstructorName, [Type])]
161− -- |
162− -- A minimal mutually recursive set of data type declarations
163− --
164− | DataBindingGroupDeclaration [Declaration]
165− -- |
166− -- A type synonym declaration (name, arguments, type)
167− --
168− | TypeSynonymDeclaration (ProperName 'TypeName) [(String, Maybe Kind)] Type
169− -- |
170− -- A type declaration for a value (name, ty)
171− --
172− | TypeDeclaration Ident Type
173− -- |
174− -- A value declaration (name, top-level binders, optional guard, value)
175− --
176− | ValueDeclaration Ident NameKind [Binder] (Either [(Guard, Expr)] Expr)
177− -- |
178− -- A minimal mutually recursive set of value declarations
179− --
180− | BindingGroupDeclaration [(Ident, NameKind, Expr)]
181− -- |
182− -- A foreign import declaration (name, type)
183− --
184− | ExternDeclaration Ident Type
185− -- |
186− -- A data type foreign import (name, kind)
187− --
188− | ExternDataDeclaration (ProperName 'TypeName) Kind
189− -- |
190− -- A fixity declaration (fixity data, operator name, value the operator is an alias for)
191− --
192− | FixityDeclaration Fixity String (Maybe (Either (Qualified Ident) (Qualified (ProperName 'ConstructorName))))
193− -- |
194− -- A module import (module name, qualified/unqualified/hiding, optional "qualified as" name)
195− -- TODO: also a boolean specifying whether the old `qualified` syntax was used, so a warning can be raised in desugaring (remove for 0.9)
196− --
197− | ImportDeclaration ModuleName ImportDeclarationType (Maybe ModuleName) Bool
198− -- |
199− -- A type class declaration (name, argument, implies, member declarations)
200− --
201− | TypeClassDeclaration (ProperName 'ClassName) [(String, Maybe Kind)] [Constraint] [Declaration]
202− -- |
203− -- A type instance declaration (name, dependencies, class name, instance types, member
204− -- declarations)
205− --
206− | TypeInstanceDeclaration Ident [Constraint] (Qualified (ProperName 'ClassName)) [Type] TypeInstanceBody
207− -- |
208− -- A declaration with source position information
209− --
210− | PositionedDeclaration SourceSpan [Comment] Declaration
211− deriving (Show, Read)
212−
213−-- | The members of a type class instance declaration
214−data TypeInstanceBody
215− -- | This is a derived instance
216− = DerivedInstance
217− -- | This is a regular (explicit) instance
218− | ExplicitInstance [Declaration]
219− deriving (Show, Read)
220−
221−mapTypeInstanceBody :: ([Declaration] -> [Declaration]) -> TypeInstanceBody -> TypeInstanceBody
222−mapTypeInstanceBody f = runIdentity . traverseTypeInstanceBody (Identity . f)
223−
224−-- | A traversal for TypeInstanceBody
225−traverseTypeInstanceBody :: (Applicative f) => ([Declaration] -> f [Declaration]) -> TypeInstanceBody -> f TypeInstanceBody
226−traverseTypeInstanceBody _ DerivedInstance = pure DerivedInstance
227−traverseTypeInstanceBody f (ExplicitInstance ds) = ExplicitInstance <$> f ds
228−
229−-- |
230−-- Test if a declaration is a value declaration
231−--
232−isValueDecl :: Declaration -> Bool
233−isValueDecl ValueDeclaration{} = True
234−isValueDecl (PositionedDeclaration _ _ d) = isValueDecl d
235−isValueDecl _ = False
236−
237−-- |
238−-- Test if a declaration is a data type or type synonym declaration
239−--
240−isDataDecl :: Declaration -> Bool
241−isDataDecl DataDeclaration{} = True
242−isDataDecl TypeSynonymDeclaration{} = True
243−isDataDecl (PositionedDeclaration _ _ d) = isDataDecl d
244−isDataDecl _ = False
245−
246−-- |
247−-- Test if a declaration is a module import
248−--
249−isImportDecl :: Declaration -> Bool
250−isImportDecl ImportDeclaration{} = True
251−isImportDecl (PositionedDeclaration _ _ d) = isImportDecl d
252−isImportDecl _ = False
253−
254−-- |
255−-- Test if a declaration is a data type foreign import
256−--
257−isExternDataDecl :: Declaration -> Bool
258−isExternDataDecl ExternDataDeclaration{} = True
259−isExternDataDecl (PositionedDeclaration _ _ d) = isExternDataDecl d
260−isExternDataDecl _ = False
261−
262−-- |
263−-- Test if a declaration is a fixity declaration
264−--
265−isFixityDecl :: Declaration -> Bool
266−isFixityDecl FixityDeclaration{} = True
267−isFixityDecl (PositionedDeclaration _ _ d) = isFixityDecl d
268−isFixityDecl _ = False
269−
270−-- |
271−-- Test if a declaration is a foreign import
272−--
273−isExternDecl :: Declaration -> Bool
274−isExternDecl ExternDeclaration{} = True
275−isExternDecl (PositionedDeclaration _ _ d) = isExternDecl d
276−isExternDecl _ = False
277−
278−-- |
279−-- Test if a declaration is a type class instance declaration
280−--
281−isTypeClassInstanceDeclaration :: Declaration -> Bool
282−isTypeClassInstanceDeclaration TypeInstanceDeclaration{} = True
283−isTypeClassInstanceDeclaration (PositionedDeclaration _ _ d) = isTypeClassInstanceDeclaration d
284−isTypeClassInstanceDeclaration _ = False
285−
286−-- |
287−-- Test if a declaration is a type class declaration
288−--
289−isTypeClassDeclaration :: Declaration -> Bool
290−isTypeClassDeclaration TypeClassDeclaration{} = True
291−isTypeClassDeclaration (PositionedDeclaration _ _ d) = isTypeClassDeclaration d
292−isTypeClassDeclaration _ = False
293−
294−-- |
295−-- Recursively flatten data binding groups in the list of declarations
296−flattenDecls :: [Declaration] -> [Declaration]
297−flattenDecls = concatMap flattenOne
298− where flattenOne :: Declaration -> [Declaration]
299− flattenOne (DataBindingGroupDeclaration decls) = concatMap flattenOne decls
300− flattenOne d = [d]
301−
302−-- |
303−-- A guard is just a boolean-valued expression that appears alongside a set of binders
304−--
305−type Guard = Expr
306−
307−-- |
308−-- Data type for expressions and terms
309−--
310−data Expr
311− -- |
312− -- A numeric literal
313− --
314− = NumericLiteral (Either Integer Double)
315− -- |
316− -- A string literal
317− --
318− | StringLiteral String
319− -- |
320− -- A character literal
321− --
322− | CharLiteral Char
323− -- |
324− -- A boolean literal
325− --
326− | BooleanLiteral Bool
327− -- |
328− -- A prefix -, will be desugared
329− --
330− | UnaryMinus Expr
331− -- |
332− -- Binary operator application. During the rebracketing phase of desugaring, this data constructor
333− -- will be removed.
334− --
335− | BinaryNoParens Expr Expr Expr
336− -- |
337− -- Explicit parentheses. During the rebracketing phase of desugaring, this data constructor
338− -- will be removed.
339− --
340− -- Note: although it seems this constructor is not used, it _is_ useful, since it prevents
341− -- certain traversals from matching.
342− --
343− | Parens Expr
344− -- |
345− -- Operator section. This will be removed during desugaring and replaced with a partially applied
346− -- operator or lambda to flip the arguments.
347− --
348− | OperatorSection Expr (Either Expr Expr)
349− -- |
350− -- An array literal
351− --
352− | ArrayLiteral [Expr]
353− -- |
354− -- An object literal
355− --
356− | ObjectLiteral [(String, Expr)]
357− -- |
358− -- An object property getter (e.g. `_.x`). This will be removed during
359− -- desugaring and expanded into a lambda that reads a property from an object.
360− --
361− | ObjectGetter String
362− -- |
363− -- An record property accessor expression
364− --
365− | Accessor String Expr
366− -- |
367− -- Partial record update
368− --
369− | ObjectUpdate Expr [(String, Expr)]
370− -- |
371− -- Function introduction
372− --
373− | Abs (Either Ident Binder) Expr
374− -- |
375− -- Function application
376− --
377− | App Expr Expr
378− -- |
379− -- Variable
380− --
381− | Var (Qualified Ident)
382− -- |
383− -- Conditional (if-then-else expression)
384− --
385− | IfThenElse Expr Expr Expr
386− -- |
387− -- A data constructor
388− --
389− | Constructor (Qualified (ProperName 'ConstructorName))
390− -- |
391− -- A case expression. During the case expansion phase of desugaring, top-level binders will get
392− -- desugared into case expressions, hence the need for guards and multiple binders per branch here.
393− --
394− | Case [Expr] [CaseAlternative]
395− -- |
396− -- A value with a type annotation
397− --
398− | TypedValue Bool Expr Type
399− -- |
400− -- A let binding
401− --
402− | Let [Declaration] Expr
403− -- |
404− -- A do-notation block
405− --
406− | Do [DoNotationElement]
407− -- |
408− -- An application of a typeclass dictionary constructor. The value should be
409− -- an ObjectLiteral.
410− --
411− | TypeClassDictionaryConstructorApp (Qualified (ProperName 'ClassName)) Expr
412− -- |
413− -- A placeholder for a type class dictionary to be inserted later. At the end of type checking, these
414− -- placeholders will be replaced with actual expressions representing type classes dictionaries which
415− -- can be evaluated at runtime. The constructor arguments represent (in order): whether or not to look
416− -- at superclass implementations when searching for a dictionary, the type class name and
417− -- instance type, and the type class dictionaries in scope.
418− --
419− | TypeClassDictionary Constraint (M.Map (Maybe ModuleName) (M.Map (Qualified (ProperName 'ClassName)) (M.Map (Qualified Ident) TypeClassDictionaryInScope)))
420− -- |
421− -- A typeclass dictionary accessor, the implementation is left unspecified until CoreFn desugaring.
422− --
423− | TypeClassDictionaryAccessor (Qualified (ProperName 'ClassName)) Ident
424− -- |
425− -- A placeholder for a superclass dictionary to be turned into a TypeClassDictionary during typechecking
426− --
427− | SuperClassDictionary (Qualified (ProperName 'ClassName)) [Type]
428− -- |
429− -- A placeholder for an anonymous function argument
430− --
431− | AnonymousArgument
432− -- |
433− -- A value with source position information
434− --
435− | PositionedValue SourceSpan [Comment] Expr
436− deriving (Show, Read)
437−
438−-- |
439−-- An alternative in a case statement
440−--
441−data CaseAlternative = CaseAlternative
442− { -- |
443− -- A collection of binders with which to match the inputs
444− --
445− caseAlternativeBinders :: [Binder]
446− -- |
447− -- The result expression or a collect of guarded expressions
448− --
449− , caseAlternativeResult :: Either [(Guard, Expr)] Expr
450− } deriving (Show, Read)
451−
452−-- |
453−-- A statement in a do-notation block
454−--
455−data DoNotationElement
456− -- |
457− -- A monadic value without a binder
458− --
459− = DoNotationValue Expr
460− -- |
461− -- A monadic value with a binder
462− --
463− | DoNotationBind Binder Expr
464− -- |
465− -- A let statement, i.e. a pure value with a binder
466− --
467− | DoNotationLet [Declaration]
468− -- |
469− -- A do notation element with source position information
470− --
471− | PositionedDoNotationElement SourceSpan [Comment] DoNotationElement
472− deriving (Show, Read)
473−
474−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''DeclarationRef)
475−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''ImportDeclarationType)
src/Language/PureScript/AST/Exported.hsdeleted−154
@@ -1,154 +0,0 @@
1−module Language.PureScript.AST.Exported
2− ( exportedDeclarations
3− , isExported
4− ) where
5−
6−import Control.Category ((>>>))
7−import Data.Maybe (mapMaybe)
8−
9−import Language.PureScript.AST.Declarations
10−import Language.PureScript.Types
11−import Language.PureScript.Names
12−
13−-- |
14−-- Return a list of all declarations which are exported from a module.
15−-- This function descends into data declarations to filter out unexported
16−-- data constructors, and also filters out type instance declarations if
17−-- they refer to classes or types which are not themselves exported.
18−--
19−-- Note that this function assumes that the module has already had its imports
20−-- desugared using 'Language.PureScript.Sugar.Names.desugarImports'. It will
21−-- produce incorrect results if this is not the case - for example, type class
22−-- instances will be incorrectly removed in some cases.
23−--
24−exportedDeclarations :: Module -> [Declaration]
25−exportedDeclarations (Module _ _ mn decls exps) = go decls
26− where
27− go = flattenDecls
28− >>> filter (isExported exps)
29− >>> map (filterDataConstructors exps)
30− >>> filterInstances mn exps
31−
32−-- |
33−-- Filter out all data constructors from a declaration which are not exported.
34−-- If the supplied declaration is not a data declaration, this function returns
35−-- it unchanged.
36−--
37−filterDataConstructors :: Maybe [DeclarationRef] -> Declaration -> Declaration
38−filterDataConstructors exps (DataDeclaration dType tyName tyArgs dctors) =
39− DataDeclaration dType tyName tyArgs $
40− filter (isDctorExported tyName exps . fst) dctors
41−filterDataConstructors exps (PositionedDeclaration srcSpan coms d) =
42− PositionedDeclaration srcSpan coms (filterDataConstructors exps d)
43−filterDataConstructors _ other = other
44−
45−-- |
46−-- Filter out all the type instances from a list of declarations which
47−-- reference a type or type class which is both local and not exported.
48−--
49−-- Note that this function assumes that the module has already had its imports
50−-- desugared using "Language.PureScript.Sugar.Names.desugarImports". It will
51−-- produce incorrect results if this is not the case - for example, type class
52−-- instances will be incorrectly removed in some cases.
53−--
54−filterInstances
55− :: ModuleName
56− -> Maybe [DeclarationRef]
57− -> [Declaration]
58− -> [Declaration]
59−filterInstances _ Nothing = id
60−filterInstances mn (Just exps) =
61− let refs = Left `map` mapMaybe typeClassName exps
62− ++ Right `map` mapMaybe typeName exps
63− in filter (all (visibleOutside refs) . typeInstanceConstituents)
64− where
65− -- Given a Qualified ProperName, and a list of all exported types and type
66− -- classes, returns whether the supplied Qualified ProperName is visible
67− -- outside this module. This is true if one of the following hold:
68− --
69− -- * the name is defined in the same module and is exported,
70− -- * the name is defined in a different module (and must be exported from
71− -- that module; the code would fail to compile otherwise).
72− visibleOutside
73− :: [Either (ProperName 'ClassName) (ProperName 'TypeName)]
74− -> Either (Qualified (ProperName 'ClassName)) (Qualified (ProperName 'TypeName))
75− -> Bool
76− visibleOutside refs q
77− | either checkQual checkQual q = True
78− | otherwise = either (Left . disqualify) (Right . disqualify) q `elem` refs
79−
80− -- Check that a qualified name is qualified for a different module
81− checkQual :: Qualified a -> Bool
82− checkQual q = isQualified q && not (isQualifiedWith mn q)
83−
84− typeName :: DeclarationRef -> Maybe (ProperName 'TypeName)
85− typeName (TypeRef n _) = Just n
86− typeName (PositionedDeclarationRef _ _ r) = typeName r
87− typeName _ = Nothing
88−
89− typeClassName :: DeclarationRef -> Maybe (ProperName 'ClassName)
90− typeClassName (TypeClassRef n) = Just n
91− typeClassName (PositionedDeclarationRef _ _ r) = typeClassName r
92− typeClassName _ = Nothing
93−
94−-- |
95−-- Get all type and type class names referenced by a type instance declaration.
96−--
97−typeInstanceConstituents :: Declaration -> [Either (Qualified (ProperName 'ClassName)) (Qualified (ProperName 'TypeName))]
98−typeInstanceConstituents (TypeInstanceDeclaration _ constraints className tys _) =
99− Left className : (concatMap fromConstraint constraints ++ concatMap fromType tys)
100− where
101−
102− fromConstraint (name, tys') = Left name : concatMap fromType tys'
103− fromType = everythingOnTypes (++) go
104−
105− -- Note that type synonyms are disallowed in instance declarations, so
106− -- we don't need to handle them here.
107− go (TypeConstructor n) = [Right n]
108− go (ConstrainedType cs _) = concatMap fromConstraint cs
109− go _ = []
110−
111−typeInstanceConstituents (PositionedDeclaration _ _ d) = typeInstanceConstituents d
112−typeInstanceConstituents _ = []
113−
114−
115−-- |
116−-- Test if a declaration is exported, given a module's export list. Note that
117−-- this function does not account for type instance declarations of
118−-- non-exported types, or non-exported data constructors. Therefore, you should
119−-- prefer 'exportedDeclarations' to this function, where possible.
120−--
121−isExported :: Maybe [DeclarationRef] -> Declaration -> Bool
122−isExported Nothing _ = True
123−isExported _ TypeInstanceDeclaration{} = True
124−isExported exps (PositionedDeclaration _ _ d) = isExported exps d
125−isExported (Just exps) decl = any (matches decl) exps
126− where
127− matches (TypeDeclaration ident _) (ValueRef ident') = ident == ident'
128− matches (ValueDeclaration ident _ _ _) (ValueRef ident') = ident == ident'
129− matches (ExternDeclaration ident _) (ValueRef ident') = ident == ident'
130− matches (FixityDeclaration _ name _) (ValueRef ident') = name == runIdent ident'
131− matches (DataDeclaration _ ident _ _) (TypeRef ident' _) = ident == ident'
132− matches (ExternDataDeclaration ident _) (TypeRef ident' _) = ident == ident'
133− matches (TypeSynonymDeclaration ident _ _) (TypeRef ident' _) = ident == ident'
134− matches (TypeClassDeclaration ident _ _ _) (TypeClassRef ident') = ident == ident'
135−
136− matches (DataDeclaration _ ident _ _) (ProperRef ident') = runProperName ident == ident'
137− matches (TypeClassDeclaration ident _ _ _) (ProperRef ident') = runProperName ident == ident'
138−
139− matches (PositionedDeclaration _ _ d) r = d `matches` r
140− matches d (PositionedDeclarationRef _ _ r) = d `matches` r
141− matches _ _ = False
142−
143−-- |
144−-- Test if a data constructor for a given type is exported, given a module's
145−-- export list. Prefer 'exportedDeclarations' to this function, where possible.
146−--
147−isDctorExported :: ProperName 'TypeName -> Maybe [DeclarationRef] -> ProperName 'ConstructorName -> Bool
148−isDctorExported _ Nothing _ = True
149−isDctorExported ident (Just exps) ctor = test `any` exps
150− where
151− test (PositionedDeclarationRef _ _ d) = test d
152− test (TypeRef ident' Nothing) = ident == ident'
153− test (TypeRef ident' (Just ctors)) = ident == ident' && ctor `elem` ctors
154− test _ = False
src/Language/PureScript/AST/Operators.hsdeleted−51
@@ -1,51 +0,0 @@
1−{-# LANGUAGE OverloadedStrings #-}
2−
3−-- |
4−-- Operators fixity and associativity
5−--
6−module Language.PureScript.AST.Operators where
7−
8−import Data.Aeson ((.=))
9−import qualified Data.Aeson as A
10−
11−import Language.PureScript.Crash
12−
13−-- |
14−-- A precedence level for an infix operator
15−--
16−type Precedence = Integer
17−
18−-- |
19−-- Associativity for infix operators
20−--
21−data Associativity = Infixl | Infixr | Infix
22− deriving (Show, Read, Eq, Ord)
23−
24−showAssoc :: Associativity -> String
25−showAssoc Infixl = "infixl"
26−showAssoc Infixr = "infixr"
27−showAssoc Infix = "infix"
28−
29−readAssoc :: String -> Associativity
30−readAssoc "infixl" = Infixl
31−readAssoc "infixr" = Infixr
32−readAssoc "infix" = Infix
33−readAssoc _ = internalError "readAssoc: no parse"
34−
35−instance A.ToJSON Associativity where
36− toJSON = A.toJSON . showAssoc
37−
38−instance A.FromJSON Associativity where
39− parseJSON = fmap readAssoc . A.parseJSON
40−
41−-- |
42−-- Fixity data for infix operators
43−--
44−data Fixity = Fixity Associativity Precedence
45− deriving (Show, Read, Eq, Ord)
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.hsdeleted−83
@@ -1,83 +0,0 @@
1−{-# LANGUAGE ScopedTypeVariables #-}
2−{-# LANGUAGE RecordWildCards #-}
3−{-# LANGUAGE OverloadedStrings #-}
4−
5−-- |
6−-- Source position information
7−--
8−module Language.PureScript.AST.SourcePos where
9−
10−import Prelude ()
11−import Prelude.Compat
12−
13−import Data.Aeson ((.=), (.:))
14−import qualified Data.Aeson as A
15−
16−-- |
17−-- Source position information
18−--
19−data SourcePos = SourcePos
20− { -- |
21− -- Line number
22− --
23− sourcePosLine :: Int
24− -- |
25− -- Column number
26− --
27− , sourcePosColumn :: Int
28− } deriving (Show, Read, Eq, Ord)
29−
30−displaySourcePos :: SourcePos -> String
31−displaySourcePos sp =
32− "line " ++ show (sourcePosLine sp) ++
33− ", column " ++ show (sourcePosColumn sp)
34−
35−instance A.ToJSON SourcePos where
36− toJSON SourcePos{..} =
37− A.toJSON [sourcePosLine, sourcePosColumn]
38−
39−instance A.FromJSON SourcePos where
40− parseJSON arr = do
41− [line, col] <- A.parseJSON arr
42− return $ SourcePos line col
43−
44−data SourceSpan = SourceSpan
45− { -- |
46− -- Source name
47− --
48− spanName :: String
49− -- |
50− -- Start of the span
51− --
52− , spanStart :: SourcePos
53− -- End of the span
54− --
55− , spanEnd :: SourcePos
56− } deriving (Show, Read, Eq, Ord)
57−
58−displayStartEndPos :: SourceSpan -> String
59−displayStartEndPos sp =
60− displaySourcePos (spanStart sp) ++ " - " ++
61− displaySourcePos (spanEnd sp)
62−
63−displaySourceSpan :: SourceSpan -> String
64−displaySourceSpan sp =
65− spanName sp ++ " " ++
66− displayStartEndPos sp
67−
68−instance A.ToJSON SourceSpan where
69− toJSON SourceSpan{..} =
70− A.object [ "name" .= spanName
71− , "start" .= spanStart
72− , "end" .= spanEnd
73− ]
74−
75−instance A.FromJSON SourceSpan where
76− parseJSON = A.withObject "SourceSpan" $ \o ->
77− SourceSpan <$>
78− o .: "name" <*>
79− o .: "start" <*>
80− o .: "end"
81−
82−internalModuleSourceSpan :: String -> SourceSpan
83−internalModuleSourceSpan name = SourceSpan name (SourcePos 0 0) (SourcePos 0 0)
src/Language/PureScript/AST/Traversals.hsdeleted−515
@@ -1,515 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.AST.Traversals
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | AST traversal helpers
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.AST.Traversals where
16−
17−import Prelude ()
18−import Prelude.Compat
19−
20−import Data.Maybe (mapMaybe)
21−import Data.List (mapAccumL)
22−import Data.Foldable (fold)
23−import qualified Data.Set as S
24−
25−import Control.Monad
26−import Control.Arrow ((***), (+++))
27−
28−import Language.PureScript.AST.Binders
29−import Language.PureScript.AST.Declarations
30−import Language.PureScript.Types
31−import Language.PureScript.Traversals
32−import Language.PureScript.Names
33−
34−everywhereOnValues :: (Declaration -> Declaration) ->
35− (Expr -> Expr) ->
36− (Binder -> Binder) ->
37− (Declaration -> Declaration, Expr -> Expr, Binder -> Binder)
38−everywhereOnValues f g h = (f', g', h')
39− where
40− f' :: Declaration -> Declaration
41− f' (DataBindingGroupDeclaration ds) = f (DataBindingGroupDeclaration (map f' ds))
42− f' (ValueDeclaration name nameKind bs val) = f (ValueDeclaration name nameKind (map h' bs) ((map (g' *** g') +++ g') val))
43− f' (BindingGroupDeclaration ds) = f (BindingGroupDeclaration (map (\(name, nameKind, val) -> (name, nameKind, g' val)) ds))
44− f' (TypeClassDeclaration name args implies ds) = f (TypeClassDeclaration name args implies (map f' ds))
45− f' (TypeInstanceDeclaration name cs className args ds) = f (TypeInstanceDeclaration name cs className args (mapTypeInstanceBody (map f') ds))
46− f' (PositionedDeclaration pos com d) = f (PositionedDeclaration pos com (f' d))
47− f' other = f other
48−
49− g' :: Expr -> Expr
50− g' (UnaryMinus v) = g (UnaryMinus (g' v))
51− g' (BinaryNoParens op v1 v2) = g (BinaryNoParens (g' op) (g' v1) (g' v2))
52− g' (Parens v) = g (Parens (g' v))
53− g' (OperatorSection op (Left v)) = g (OperatorSection (g' op) (Left $ g' v))
54− g' (OperatorSection op (Right v)) = g (OperatorSection (g' op) (Right $ g' v))
55− g' (ArrayLiteral vs) = g (ArrayLiteral (map g' vs))
56− g' (ObjectLiteral vs) = g (ObjectLiteral (map (fmap g') vs))
57− g' (TypeClassDictionaryConstructorApp name v) = g (TypeClassDictionaryConstructorApp name (g' v))
58− g' (Accessor prop v) = g (Accessor prop (g' v))
59− g' (ObjectUpdate obj vs) = g (ObjectUpdate (g' obj) (map (fmap g') vs))
60− g' (Abs name v) = g (Abs name (g' v))
61− g' (App v1 v2) = g (App (g' v1) (g' v2))
62− g' (IfThenElse v1 v2 v3) = g (IfThenElse (g' v1) (g' v2) (g' v3))
63− g' (Case vs alts) = g (Case (map g' vs) (map handleCaseAlternative alts))
64− g' (TypedValue check v ty) = g (TypedValue check (g' v) ty)
65− g' (Let ds v) = g (Let (map f' ds) (g' v))
66− g' (Do es) = g (Do (map handleDoNotationElement es))
67− g' (PositionedValue pos com v) = g (PositionedValue pos com (g' v))
68− g' other = g other
69−
70− h' :: Binder -> Binder
71− h' (ConstructorBinder ctor bs) = h (ConstructorBinder ctor (map h' bs))
72− h' (BinaryNoParensBinder b1 b2 b3) = h (BinaryNoParensBinder (h' b1) (h' b2) (h' b3))
73− h' (ParensInBinder b) = h (ParensInBinder (h' b))
74− h' (ObjectBinder bs) = h (ObjectBinder (map (fmap h') bs))
75− h' (ArrayBinder bs) = h (ArrayBinder (map h' bs))
76− h' (NamedBinder name b) = h (NamedBinder name (h' b))
77− h' (PositionedBinder pos com b) = h (PositionedBinder pos com (h' b))
78− h' (TypedBinder t b) = h (TypedBinder t (h' b))
79− h' other = h other
80−
81− handleCaseAlternative :: CaseAlternative -> CaseAlternative
82− handleCaseAlternative ca =
83− ca { caseAlternativeBinders = map h' (caseAlternativeBinders ca)
84− , caseAlternativeResult = (map (g' *** g') +++ g') (caseAlternativeResult ca)
85− }
86−
87− handleDoNotationElement :: DoNotationElement -> DoNotationElement
88− handleDoNotationElement (DoNotationValue v) = DoNotationValue (g' v)
89− handleDoNotationElement (DoNotationBind b v) = DoNotationBind (h' b) (g' v)
90− handleDoNotationElement (DoNotationLet ds) = DoNotationLet (map f' ds)
91− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com (handleDoNotationElement e)
92−
93−everywhereOnValuesTopDownM :: (Functor m, Applicative m, Monad m) =>
94− (Declaration -> m Declaration) ->
95− (Expr -> m Expr) ->
96− (Binder -> m Binder) ->
97− (Declaration -> m Declaration, Expr -> m Expr, Binder -> m Binder)
98−everywhereOnValuesTopDownM f g h = (f' <=< f, g' <=< g, h' <=< h)
99− where
100− f' (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> traverse (f' <=< f) ds
101− f' (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> traverse (h' <=< h) bs <*> eitherM (traverse (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
102− f' (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> traverse (\(name, nameKind, val) -> (,,) name nameKind <$> (g val >>= g')) ds
103− f' (TypeClassDeclaration name args implies ds) = TypeClassDeclaration name args implies <$> traverse (f' <=< f) ds
104− f' (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse (f' <=< f)) ds
105− f' (PositionedDeclaration pos com d) = PositionedDeclaration pos com <$> (f d >>= f')
106− f' other = f other
107−
108− g' (UnaryMinus v) = UnaryMinus <$> (g v >>= g')
109− g' (BinaryNoParens op v1 v2) = BinaryNoParens <$> (g op >>= g') <*> (g v1 >>= g') <*> (g v2 >>= g')
110− g' (Parens v) = Parens <$> (g v >>= g')
111− g' (OperatorSection op (Left v)) = OperatorSection <$> (g op >>= g') <*> (Left <$> (g v >>= g'))
112− g' (OperatorSection op (Right v)) = OperatorSection <$> (g op >>= g') <*> (Right <$> (g v >>= g'))
113− g' (ArrayLiteral vs) = ArrayLiteral <$> traverse (g' <=< g) vs
114− g' (ObjectLiteral vs) = ObjectLiteral <$> traverse (sndM (g' <=< g)) vs
115− g' (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> (g v >>= g')
116− g' (Accessor prop v) = Accessor prop <$> (g v >>= g')
117− g' (ObjectUpdate obj vs) = ObjectUpdate <$> (g obj >>= g') <*> traverse (sndM (g' <=< g)) vs
118− g' (Abs name v) = Abs name <$> (g v >>= g')
119− g' (App v1 v2) = App <$> (g v1 >>= g') <*> (g v2 >>= g')
120− g' (IfThenElse v1 v2 v3) = IfThenElse <$> (g v1 >>= g') <*> (g v2 >>= g') <*> (g v3 >>= g')
121− g' (Case vs alts) = Case <$> traverse (g' <=< g) vs <*> traverse handleCaseAlternative alts
122− g' (TypedValue check v ty) = TypedValue check <$> (g v >>= g') <*> pure ty
123− g' (Let ds v) = Let <$> traverse (f' <=< f) ds <*> (g v >>= g')
124− g' (Do es) = Do <$> traverse handleDoNotationElement es
125− g' (PositionedValue pos com v) = PositionedValue pos com <$> (g v >>= g')
126− g' other = g other
127−
128− h' (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> traverse (h' <=< h) bs
129− h' (BinaryNoParensBinder b1 b2 b3) = BinaryNoParensBinder <$> (h b1 >>= h') <*> (h b2 >>= h') <*> (h b3 >>= h')
130− h' (ParensInBinder b) = ParensInBinder <$> (h b >>= h')
131− h' (ObjectBinder bs) = ObjectBinder <$> traverse (sndM (h' <=< h)) bs
132− h' (ArrayBinder bs) = ArrayBinder <$> traverse (h' <=< h) bs
133− h' (NamedBinder name b) = NamedBinder name <$> (h b >>= h')
134− h' (PositionedBinder pos com b) = PositionedBinder pos com <$> (h b >>= h')
135− h' (TypedBinder t b) = TypedBinder t <$> (h b >>= h')
136− h' other = h other
137−
138− handleCaseAlternative (CaseAlternative bs val) = CaseAlternative <$> traverse (h' <=< h) bs
139− <*> eitherM (traverse (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
140−
141− handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> (g' <=< g) v
142− handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> (h' <=< h) b <*> (g' <=< g) v
143− handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> traverse (f' <=< f) ds
144− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
145−
146−everywhereOnValuesM :: (Functor m, Applicative m, Monad m) =>
147− (Declaration -> m Declaration) ->
148− (Expr -> m Expr) ->
149− (Binder -> m Binder) ->
150− (Declaration -> m Declaration, Expr -> m Expr, Binder -> m Binder)
151−everywhereOnValuesM f g h = (f', g', h')
152− where
153− f' (DataBindingGroupDeclaration ds) = (DataBindingGroupDeclaration <$> traverse f' ds) >>= f
154− f' (ValueDeclaration name nameKind bs val) = (ValueDeclaration name nameKind <$> traverse h' bs <*> eitherM (traverse (pairM g' g')) g' val) >>= f
155− f' (BindingGroupDeclaration ds) = (BindingGroupDeclaration <$> traverse (\(name, nameKind, val) -> (,,) name nameKind <$> g' val) ds) >>= f
156− f' (TypeClassDeclaration name args implies ds) = (TypeClassDeclaration name args implies <$> traverse f' ds) >>= f
157− f' (TypeInstanceDeclaration name cs className args ds) = (TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse f') ds) >>= f
158− f' (PositionedDeclaration pos com d) = (PositionedDeclaration pos com <$> f' d) >>= f
159− f' other = f other
160−
161− g' (UnaryMinus v) = (UnaryMinus <$> g' v) >>= g
162− g' (BinaryNoParens op v1 v2) = (BinaryNoParens <$> g' op <*> g' v1 <*> g' v2) >>= g
163− g' (Parens v) = (Parens <$> g' v) >>= g
164− g' (OperatorSection op (Left v)) = (OperatorSection <$> g' op <*> (Left <$> g' v)) >>= g
165− g' (OperatorSection op (Right v)) = (OperatorSection <$> g' op <*> (Right <$> g' v)) >>= g
166− g' (ArrayLiteral vs) = (ArrayLiteral <$> traverse g' vs) >>= g
167− g' (ObjectLiteral vs) = (ObjectLiteral <$> traverse (sndM g') vs) >>= g
168− g' (TypeClassDictionaryConstructorApp name v) = (TypeClassDictionaryConstructorApp name <$> g' v) >>= g
169− g' (Accessor prop v) = (Accessor prop <$> g' v) >>= g
170− g' (ObjectUpdate obj vs) = (ObjectUpdate <$> g' obj <*> traverse (sndM g') vs) >>= g
171− g' (Abs name v) = (Abs name <$> g' v) >>= g
172− g' (App v1 v2) = (App <$> g' v1 <*> g' v2) >>= g
173− g' (IfThenElse v1 v2 v3) = (IfThenElse <$> g' v1 <*> g' v2 <*> g' v3) >>= g
174− g' (Case vs alts) = (Case <$> traverse g' vs <*> traverse handleCaseAlternative alts) >>= g
175− g' (TypedValue check v ty) = (TypedValue check <$> g' v <*> pure ty) >>= g
176− g' (Let ds v) = (Let <$> traverse f' ds <*> g' v) >>= g
177− g' (Do es) = (Do <$> traverse handleDoNotationElement es) >>= g
178− g' (PositionedValue pos com v) = (PositionedValue pos com <$> g' v) >>= g
179− g' other = g other
180−
181− h' (ConstructorBinder ctor bs) = (ConstructorBinder ctor <$> traverse h' bs) >>= h
182− h' (BinaryNoParensBinder b1 b2 b3) = (BinaryNoParensBinder <$> h' b1 <*> h' b2 <*> h' b3) >>= h
183− h' (ParensInBinder b) = (ParensInBinder <$> h' b) >>= h
184− h' (ObjectBinder bs) = (ObjectBinder <$> traverse (sndM h') bs) >>= h
185− h' (ArrayBinder bs) = (ArrayBinder <$> traverse h' bs) >>= h
186− h' (NamedBinder name b) = (NamedBinder name <$> h' b) >>= h
187− h' (PositionedBinder pos com b) = (PositionedBinder pos com <$> h' b) >>= h
188− h' (TypedBinder t b) = (TypedBinder t <$> h' b) >>= h
189− h' other = h other
190−
191− handleCaseAlternative (CaseAlternative bs val) = CaseAlternative <$> traverse h' bs
192− <*> eitherM (traverse (pairM g' g')) g' val
193−
194− handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> g' v
195− handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> h' b <*> g' v
196− handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> traverse f' ds
197− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
198−
199−everythingOnValues :: (r -> r -> r) ->
200− (Declaration -> r) ->
201− (Expr -> r) ->
202− (Binder -> r) ->
203− (CaseAlternative -> r) ->
204− (DoNotationElement -> r) ->
205− (Declaration -> r, Expr -> r, Binder -> r, CaseAlternative -> r, DoNotationElement -> r)
206−everythingOnValues (<>) f g h i j = (f', g', h', i', j')
207− where
208− f' d@(DataBindingGroupDeclaration ds) = foldl (<>) (f d) (map f' ds)
209− f' d@(ValueDeclaration _ _ bs (Right val)) = foldl (<>) (f d) (map h' bs) <> g' val
210− f' d@(ValueDeclaration _ _ bs (Left gs)) = foldl (<>) (f d) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
211− f' d@(BindingGroupDeclaration ds) = foldl (<>) (f d) (map (\(_, _, val) -> g' val) ds)
212− f' d@(TypeClassDeclaration _ _ _ ds) = foldl (<>) (f d) (map f' ds)
213− f' d@(TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldl (<>) (f d) (map f' ds)
214− f' d@(PositionedDeclaration _ _ d1) = f d <> f' d1
215− f' d = f d
216−
217− g' v@(UnaryMinus v1) = g v <> g' v1
218− g' v@(BinaryNoParens op v1 v2) = g v <> g' op <> g' v1 <> g' v2
219− g' v@(Parens v1) = g v <> g' v1
220− g' v@(OperatorSection op (Left v1)) = g v <> g' op <> g' v1
221− g' v@(OperatorSection op (Right v1)) = g v <> g' op <> g' v1
222− g' v@(ArrayLiteral vs) = foldl (<>) (g v) (map g' vs)
223− g' v@(ObjectLiteral vs) = foldl (<>) (g v) (map (g' . snd) vs)
224− g' v@(TypeClassDictionaryConstructorApp _ v1) = g v <> g' v1
225− g' v@(Accessor _ v1) = g v <> g' v1
226− g' v@(ObjectUpdate obj vs) = foldl (<>) (g v <> g' obj) (map (g' . snd) vs)
227− g' v@(Abs _ v1) = g v <> g' v1
228− g' v@(App v1 v2) = g v <> g' v1 <> g' v2
229− g' v@(IfThenElse v1 v2 v3) = g v <> g' v1 <> g' v2 <> g' v3
230− g' v@(Case vs alts) = foldl (<>) (foldl (<>) (g v) (map g' vs)) (map i' alts)
231− g' v@(TypedValue _ v1 _) = g v <> g' v1
232− g' v@(Let ds v1) = foldl (<>) (g v) (map f' ds) <> g' v1
233− g' v@(Do es) = foldl (<>) (g v) (map j' es)
234− g' v@(PositionedValue _ _ v1) = g v <> g' v1
235− g' v = g v
236−
237− h' b@(ConstructorBinder _ bs) = foldl (<>) (h b) (map h' bs)
238− h' b@(BinaryNoParensBinder b1 b2 b3) = h b <> h' b1 <> h' b2 <> h' b3
239− h' b@(ParensInBinder b1) = h b <> h' b1
240− h' b@(ObjectBinder bs) = foldl (<>) (h b) (map (h' . snd) bs)
241− h' b@(ArrayBinder bs) = foldl (<>) (h b) (map h' bs)
242− h' b@(NamedBinder _ b1) = h b <> h' b1
243− h' b@(PositionedBinder _ _ b1) = h b <> h' b1
244− h' b@(TypedBinder _ b1) = h b <> h' b1
245− h' b = h b
246−
247− i' ca@(CaseAlternative bs (Right val)) = foldl (<>) (i ca) (map h' bs) <> g' val
248− i' ca@(CaseAlternative bs (Left gs)) = foldl (<>) (i ca) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
249−
250− j' e@(DoNotationValue v) = j e <> g' v
251− j' e@(DoNotationBind b v) = j e <> h' b <> g' v
252− j' e@(DoNotationLet ds) = foldl (<>) (j e) (map f' ds)
253− j' e@(PositionedDoNotationElement _ _ e1) = j e <> j' e1
254−
255−everythingWithContextOnValues ::
256− s ->
257− r ->
258− (r -> r -> r) ->
259− (s -> Declaration -> (s, r)) ->
260− (s -> Expr -> (s, r)) ->
261− (s -> Binder -> (s, r)) ->
262− (s -> CaseAlternative -> (s, r)) ->
263− (s -> DoNotationElement -> (s, r)) ->
264− ( Declaration -> r
265− , Expr -> r
266− , Binder -> r
267− , CaseAlternative -> r
268− , DoNotationElement -> r)
269−everythingWithContextOnValues s0 r0 (<>) f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
270− where
271− f'' s d = let (s', r) = f s d in r <> f' s' d
272−
273− f' s (DataBindingGroupDeclaration ds) = foldl (<>) r0 (map (f'' s) ds)
274− f' s (ValueDeclaration _ _ bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
275− f' s (ValueDeclaration _ _ bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
276− f' s (BindingGroupDeclaration ds) = foldl (<>) r0 (map (\(_, _, val) -> g'' s val) ds)
277− f' s (TypeClassDeclaration _ _ _ ds) = foldl (<>) r0 (map (f'' s) ds)
278− f' s (TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldl (<>) r0 (map (f'' s) ds)
279− f' s (PositionedDeclaration _ _ d1) = f'' s d1
280− f' _ _ = r0
281−
282− g'' s v = let (s', r) = g s v in r <> g' s' v
283−
284− g' s (UnaryMinus v1) = g'' s v1
285− g' s (BinaryNoParens op v1 v2) = g'' s op <> g'' s v1 <> g'' s v2
286− g' s (Parens v1) = g'' s v1
287− g' s (OperatorSection op (Left v)) = g'' s op <> g'' s v
288− g' s (OperatorSection op (Right v)) = g'' s op <> g'' s v
289− g' s (ArrayLiteral vs) = foldl (<>) r0 (map (g'' s) vs)
290− g' s (ObjectLiteral vs) = foldl (<>) r0 (map (g'' s . snd) vs)
291− g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
292− g' s (Accessor _ v1) = g'' s v1
293− g' s (ObjectUpdate obj vs) = foldl (<>) (g'' s obj) (map (g'' s . snd) vs)
294− g' s (Abs _ v1) = g'' s v1
295− g' s (App v1 v2) = g'' s v1 <> g'' s v2
296− g' s (IfThenElse v1 v2 v3) = g'' s v1 <> g'' s v2 <> g'' s v3
297− g' s (Case vs alts) = foldl (<>) (foldl (<>) r0 (map (g'' s) vs)) (map (i'' s) alts)
298− g' s (TypedValue _ v1 _) = g'' s v1
299− g' s (Let ds v1) = foldl (<>) r0 (map (f'' s) ds) <> g'' s v1
300− g' s (Do es) = foldl (<>) r0 (map (j'' s) es)
301− g' s (PositionedValue _ _ v1) = g'' s v1
302− g' _ _ = r0
303−
304− h'' s b = let (s', r) = h s b in r <> h' s' b
305−
306− h' s (ConstructorBinder _ bs) = foldl (<>) r0 (map (h'' s) bs)
307− h' s (BinaryNoParensBinder b1 b2 b3) = h'' s b1 <> h'' s b2 <> h'' s b3
308− h' s (ParensInBinder b) = h'' s b
309− h' s (ObjectBinder bs) = foldl (<>) r0 (map (h'' s . snd) bs)
310− h' s (ArrayBinder bs) = foldl (<>) r0 (map (h'' s) bs)
311− h' s (NamedBinder _ b1) = h'' s b1
312− h' s (PositionedBinder _ _ b1) = h'' s b1
313− h' s (TypedBinder _ b1) = h'' s b1
314− h' _ _ = r0
315−
316− i'' s ca = let (s', r) = i s ca in r <> i' s' ca
317−
318− i' s (CaseAlternative bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
319− i' s (CaseAlternative bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
320−
321− j'' s e = let (s', r) = j s e in r <> j' s' e
322−
323− j' s (DoNotationValue v) = g'' s v
324− j' s (DoNotationBind b v) = h'' s b <> g'' s v
325− j' s (DoNotationLet ds) = foldl (<>) r0 (map (f'' s) ds)
326− j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
327−
328−everywhereWithContextOnValuesM :: (Functor m, Applicative m, Monad m) =>
329− s ->
330− (s -> Declaration -> m (s, Declaration)) ->
331− (s -> Expr -> m (s, Expr)) ->
332− (s -> Binder -> m (s, Binder)) ->
333− (s -> CaseAlternative -> m (s, CaseAlternative)) ->
334− (s -> DoNotationElement -> m (s, DoNotationElement)) ->
335− ( Declaration -> m Declaration
336− , Expr -> m Expr
337− , Binder -> m Binder
338− , CaseAlternative -> m CaseAlternative
339− , DoNotationElement -> m DoNotationElement)
340−everywhereWithContextOnValuesM s0 f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
341− where
342− f'' s = uncurry f' <=< f s
343−
344− f' s (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> traverse (f'' s) ds
345− f' s (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> traverse (h'' s) bs <*> eitherM (traverse (pairM (g'' s) (g'' s))) (g'' s) val
346− f' s (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> traverse (thirdM (g'' s)) ds
347− f' s (TypeClassDeclaration name args implies ds) = TypeClassDeclaration name args implies <$> traverse (f'' s) ds
348− f' s (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse (f'' s)) ds
349− f' s (PositionedDeclaration pos com d1) = PositionedDeclaration pos com <$> f'' s d1
350− f' _ other = return other
351−
352− g'' s = uncurry g' <=< g s
353−
354− g' s (UnaryMinus v) = UnaryMinus <$> g'' s v
355− g' s (BinaryNoParens op v1 v2) = BinaryNoParens <$> g'' s op <*> g'' s v1 <*> g'' s v2
356− g' s (Parens v) = Parens <$> g'' s v
357− g' s (OperatorSection op (Left v)) = OperatorSection <$> g'' s op <*> (Left <$> g'' s v)
358− g' s (OperatorSection op (Right v)) = OperatorSection <$> g'' s op <*> (Right <$> g'' s v)
359− g' s (ArrayLiteral vs) = ArrayLiteral <$> traverse (g'' s) vs
360− g' s (ObjectLiteral vs) = ObjectLiteral <$> traverse (sndM (g'' s)) vs
361− g' s (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> g'' s v
362− g' s (Accessor prop v) = Accessor prop <$> g'' s v
363− g' s (ObjectUpdate obj vs) = ObjectUpdate <$> g'' s obj <*> traverse (sndM (g'' s)) vs
364− g' s (Abs name v) = Abs name <$> g'' s v
365− g' s (App v1 v2) = App <$> g'' s v1 <*> g'' s v2
366− g' s (IfThenElse v1 v2 v3) = IfThenElse <$> g'' s v1 <*> g'' s v2 <*> g'' s v3
367− g' s (Case vs alts) = Case <$> traverse (g'' s) vs <*> traverse (i'' s) alts
368− g' s (TypedValue check v ty) = TypedValue check <$> g'' s v <*> pure ty
369− g' s (Let ds v) = Let <$> traverse (f'' s) ds <*> g'' s v
370− g' s (Do es) = Do <$> traverse (j'' s) es
371− g' s (PositionedValue pos com v) = PositionedValue pos com <$> g'' s v
372− g' _ other = return other
373−
374− h'' s = uncurry h' <=< h s
375−
376− h' s (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> traverse (h'' s) bs
377− h' s (BinaryNoParensBinder b1 b2 b3) = BinaryNoParensBinder <$> h'' s b1 <*> h'' s b2 <*> h'' s b3
378− h' s (ParensInBinder b) = ParensInBinder <$> h'' s b
379− h' s (ObjectBinder bs) = ObjectBinder <$> traverse (sndM (h'' s)) bs
380− h' s (ArrayBinder bs) = ArrayBinder <$> traverse (h'' s) bs
381− h' s (NamedBinder name b) = NamedBinder name <$> h'' s b
382− h' s (PositionedBinder pos com b) = PositionedBinder pos com <$> h'' s b
383− h' s (TypedBinder t b) = TypedBinder t <$> h'' s b
384− h' _ other = return other
385−
386− i'' s = uncurry i' <=< i s
387−
388− i' s (CaseAlternative bs val) = CaseAlternative <$> traverse (h'' s) bs <*> eitherM (traverse (pairM (g'' s) (g'' s))) (g'' s) val
389−
390− j'' s = uncurry j' <=< j s
391−
392− j' s (DoNotationValue v) = DoNotationValue <$> g'' s v
393− j' s (DoNotationBind b v) = DoNotationBind <$> h'' s b <*> g'' s v
394− j' s (DoNotationLet ds) = DoNotationLet <$> traverse (f'' s) ds
395− j' s (PositionedDoNotationElement pos com e1) = PositionedDoNotationElement pos com <$> j'' s e1
396−
397−everythingWithScope ::
398− (Monoid r) =>
399− (S.Set Ident -> Declaration -> r) ->
400− (S.Set Ident -> Expr -> r) ->
401− (S.Set Ident -> Binder -> r) ->
402− (S.Set Ident -> CaseAlternative -> r) ->
403− (S.Set Ident -> DoNotationElement -> r) ->
404− ( S.Set Ident -> Declaration -> r
405− , S.Set Ident -> Expr -> r
406− , S.Set Ident -> Binder -> r
407− , S.Set Ident -> CaseAlternative -> r
408− , S.Set Ident -> DoNotationElement -> r)
409−everythingWithScope f g h i j = (f'', g'', h'', i'', \s -> snd . j'' s)
410− where
411− -- Avoid importing Data.Monoid and getting shadowed names above
412− (<>) = mappend
413−
414− f'' s a = f s a <> f' s a
415−
416− f' s (DataBindingGroupDeclaration ds) =
417− let s' = S.union s (S.fromList (mapMaybe getDeclIdent ds))
418− in foldMap (f'' s') ds
419− f' s (ValueDeclaration name _ bs (Right val)) =
420− let s' = S.insert name s
421− in foldMap (h'' s') bs <> g'' s' val
422− f' s (ValueDeclaration name _ bs (Left gs)) =
423− let s' = S.insert name s
424− s'' = S.union s' (S.fromList (concatMap binderNames bs))
425− in foldMap (h'' s') bs <> foldMap (\(grd, val) -> g'' s'' grd <> g'' s'' val) gs
426− f' s (BindingGroupDeclaration ds) =
427− let s' = S.union s (S.fromList (map (\(name, _, _) -> name) ds))
428− in foldMap (\(_, _, val) -> g'' s' val) ds
429− f' s (TypeClassDeclaration _ _ _ ds) = foldMap (f'' s) ds
430− f' s (TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldMap (f'' s) ds
431− f' s (PositionedDeclaration _ _ d) = f'' s d
432− f' _ _ = mempty
433−
434− g'' s a = g s a <> g' s a
435−
436− g' s (UnaryMinus v1) = g'' s v1
437− g' s (BinaryNoParens op v1 v2) = g' s op <> g' s v1 <> g' s v2
438− g' s (Parens v1) = g'' s v1
439− g' s (OperatorSection op (Left v)) = g'' s op <> g'' s v
440− g' s (OperatorSection op (Right v)) = g'' s op <> g'' s v
441− g' s (ArrayLiteral vs) = foldMap (g'' s) vs
442− g' s (ObjectLiteral vs) = foldMap (g'' s . snd) vs
443− g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
444− g' s (Accessor _ v1) = g'' s v1
445− g' s (ObjectUpdate obj vs) = g'' s obj <> foldMap (g'' s . snd) vs
446− g' s (Abs (Left name) v1) =
447− let s' = S.insert name s
448− in g'' s' v1
449− g' s (Abs (Right b) v1) =
450− let s' = S.union (S.fromList (binderNames b)) s
451− in g'' s' v1
452− g' s (App v1 v2) = g'' s v1 <> g'' s v2
453− g' s (IfThenElse v1 v2 v3) = g'' s v1 <> g'' s v2 <> g'' s v3
454− g' s (Case vs alts) = foldMap (g'' s) vs <> foldMap (i'' s) alts
455− g' s (TypedValue _ v1 _) = g'' s v1
456− g' s (Let ds v1) =
457− let s' = S.union s (S.fromList (mapMaybe getDeclIdent ds))
458− in foldMap (f'' s') ds <> g'' s' v1
459− g' s (Do es) = fold . snd . mapAccumL j'' s $ es
460− g' s (PositionedValue _ _ v1) = g'' s v1
461− g' _ _ = mempty
462−
463− h'' s a = h s a <> h' s a
464−
465− h' s (ConstructorBinder _ bs) = foldMap (h'' s) bs
466− h' s (BinaryNoParensBinder b1 b2 b3) = foldMap (h'' s) [b1, b2, b3]
467− h' s (ParensInBinder b) = h'' s b
468− h' s (ObjectBinder bs) = foldMap (h'' s . snd) bs
469− h' s (ArrayBinder bs) = foldMap (h'' s) bs
470− h' s (NamedBinder name b1) = h'' (S.insert name s) b1
471− h' s (PositionedBinder _ _ b1) = h'' s b1
472− h' s (TypedBinder _ b1) = h'' s b1
473− h' _ _ = mempty
474−
475− i'' s a = i s a <> i' s a
476−
477− i' s (CaseAlternative bs (Right val)) =
478− let s' = S.union s (S.fromList (concatMap binderNames bs))
479− in foldMap (h'' s) bs <> g'' s' val
480− i' s (CaseAlternative bs (Left gs)) =
481− let s' = S.union s (S.fromList (concatMap binderNames bs))
482− in foldMap (h'' s) bs <> foldMap (\(grd, val) -> g'' s' grd <> g'' s' val) gs
483−
484− j'' s a = let (s', r) = j' s a in (s', j s a <> r)
485−
486− j' s (DoNotationValue v) = (s, g'' s v)
487− j' s (DoNotationBind b v) =
488− let s' = S.union (S.fromList (binderNames b)) s
489− in (s', h'' s b <> g'' s' v)
490− j' s (DoNotationLet ds) =
491− let s' = S.union s (S.fromList (mapMaybe getDeclIdent ds))
492− in (s', foldMap (f'' s') ds)
493− j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
494−
495− getDeclIdent :: Declaration -> Maybe Ident
496− getDeclIdent (PositionedDeclaration _ _ d) = getDeclIdent d
497− getDeclIdent (ValueDeclaration ident _ _ _) = Just ident
498− getDeclIdent (TypeDeclaration ident _) = Just ident
499− getDeclIdent _ = Nothing
500−
501−accumTypes :: (Monoid r) => (Type -> r) -> (Declaration -> r, Expr -> r, Binder -> r, CaseAlternative -> r, DoNotationElement -> r)
502−accumTypes f = everythingOnValues mappend forDecls forValues (const mempty) (const mempty) (const mempty)
503− where
504− forDecls (DataDeclaration _ _ _ dctors) = mconcat (concatMap (map f . snd) dctors)
505− forDecls (ExternDeclaration _ ty) = f ty
506− forDecls (TypeClassDeclaration _ _ implies _) = mconcat (concatMap (map f . snd) implies)
507− forDecls (TypeInstanceDeclaration _ cs _ tys _) = mconcat (concatMap (map f . snd) cs) `mappend` mconcat (map f tys)
508− forDecls (TypeSynonymDeclaration _ _ ty) = f ty
509− forDecls (TypeDeclaration _ ty) = f ty
510− forDecls _ = mempty
511−
512− forValues (TypeClassDictionary (_, cs) _) = mconcat (map f cs)
513− forValues (SuperClassDictionary _ tys) = mconcat (map f tys)
514− forValues (TypedValue _ _ ty) = f ty
515− forValues _ = mempty
src/Language/PureScript/Bundle.hsdeleted−555
@@ -1,555 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : psc-bundle
4−-- Copyright : (c) Phil Freeman 2015
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Bundles compiled PureScript modules for the browser.
12−--
13−-- This module takes as input the individual generated modules from 'Language.PureScript.Make' and
14−-- performs dead code elimination, filters empty modules,
15−-- and generates the final Javascript bundle.
16−-----------------------------------------------------------------------------
17−
18−{-# LANGUAGE PatternGuards #-}
19−{-# LANGUAGE FlexibleContexts #-}
20−{-# LANGUAGE ScopedTypeVariables #-}
21−{-# LANGUAGE TupleSections #-}
22−
23−module Language.PureScript.Bundle (
24− bundle
25− , ModuleIdentifier(..)
26− , moduleName
27− , ModuleType(..)
28− , ErrorMessage(..)
29− , printErrorMessage
30−) where
31−
32−import Prelude ()
33−import Prelude.Compat
34−
35−import Data.List (nub, stripPrefix)
36−import Data.Maybe (mapMaybe, catMaybes, fromMaybe)
37−import Data.Generics (everything, everywhere, mkQ, mkT)
38−import Data.Graph
39−import Data.Version (showVersion)
40−
41−import qualified Data.Set as S
42−
43−import Control.Monad
44−import Control.Monad.Error.Class
45−import Language.JavaScript.Parser
46−
47−import qualified Paths_purescript as Paths
48−
49−-- | The type of error messages. We separate generation and rendering of errors using a data
50−-- type, in case we need to match on error types later.
51−data ErrorMessage
52− = UnsupportedModulePath String
53− | InvalidTopLevel
54− | UnableToParseModule String
55− | UnsupportedExport
56− | ErrorInModule ModuleIdentifier ErrorMessage
57− deriving (Show, Read)
58−
59−-- | Modules are either "regular modules" (i.e. those generated by psc) or foreign modules.
60−data ModuleType
61− = Regular
62− | Foreign
63− deriving (Show, Read, Eq, Ord)
64−
65−showModuleType :: ModuleType -> String
66−showModuleType Regular = "Regular"
67−showModuleType Foreign = "Foreign"
68−
69−-- | A module is identified by its module name and its type.
70−data ModuleIdentifier = ModuleIdentifier String ModuleType deriving (Show, Read, Eq, Ord)
71−
72−moduleName :: ModuleIdentifier -> String
73−moduleName (ModuleIdentifier name _) = name
74−
75−-- | A piece of code is identified by its module and its name. These keys are used to label vertices
76−-- in the dependency graph.
77−type Key = (ModuleIdentifier, String)
78−
79−-- | An export is either a "regular export", which exports a name from the regular module we are in,
80−-- or a reexport of a declaration in the corresponding foreign module.
81−--
82−-- Regular exports are labelled, since they might re-export an operator with another name.
83−data ExportType
84− = RegularExport String
85− | ForeignReexport
86− deriving (Show, Read, Eq, Ord)
87−
88−-- | There are four types of module element we are interested in:
89−--
90−-- 1) Require statements
91−-- 2) Member declarations
92−-- 3) Export lists
93−-- 4) Everything else
94−--
95−-- Each is labelled with the original AST node which generated it, so that we can dump it back
96−-- into the output during codegen.
97−data ModuleElement
98− = Require JSNode String (Either String ModuleIdentifier)
99− | Member JSNode Bool String [JSNode] [Key]
100− | ExportsList [(ExportType, String, JSNode, [Key])]
101− | Other JSNode
102− deriving (Show, Read)
103−
104−-- | A module is just a list of elements of the types listed above.
105−data Module = Module ModuleIdentifier [ModuleElement] deriving (Show, Read)
106−
107−-- | Prepare an error message for consumption by humans.
108−printErrorMessage :: ErrorMessage -> [String]
109−printErrorMessage (UnsupportedModulePath s) =
110− [ "A CommonJS module has an unsupported name (" ++ show s ++ ")."
111− , "The following file names are supported:"
112− , " 1) index.js (psc native modules)"
113− , " 2) foreign.js (psc foreign modules)"
114− ]
115−printErrorMessage InvalidTopLevel =
116− [ "Expected a list of source elements at the top level." ]
117−printErrorMessage (UnableToParseModule err) =
118− [ "The module could not be parsed:"
119− , err
120− ]
121−printErrorMessage UnsupportedExport =
122− [ "An export was unsupported. Exports can be defined in one of two ways: "
123− , " 1) exports.name = ..."
124− , " 2) exports = { ... }"
125− ]
126−printErrorMessage (ErrorInModule mid e) =
127− ("Error in module " ++ displayIdentifier mid ++ ":")
128− : ""
129− : map (" " ++) (printErrorMessage e)
130− where
131− displayIdentifier (ModuleIdentifier name ty) =
132− name ++ " (" ++ showModuleType ty ++ ")"
133−
134−-- | Unpack the node inside a JSNode. This is useful when pattern matching.
135−node :: JSNode -> Node
136−node (NN n) = n
137−node (NT n _ _) = n
138−
139−-- | Calculate the ModuleIdentifier which a require(...) statement imports.
140−checkImportPath :: Maybe FilePath -> String -> ModuleIdentifier -> S.Set String -> Either String ModuleIdentifier
141−checkImportPath _ "./foreign" m _ =
142− Right (ModuleIdentifier (moduleName m) Foreign)
143−checkImportPath requirePath name _ names
144− | Just name' <- stripPrefix (fromMaybe "" requirePath) name
145− , name' `S.member` names = Right (ModuleIdentifier name' Regular)
146−checkImportPath _ name _ _ = Left name
147−
148−-- | Compute the dependencies of all elements in a module, and add them to the tree.
149−--
150−-- Members and exports can have dependencies. A dependency is of one of the following forms:
151−--
152−-- 1) module.name or member["name"]
153−--
154−-- where module was imported using
155−--
156−-- var module = require("Module.Name");
157−--
158−-- 2) name
159−--
160−-- where name is the name of a member defined in the current module.
161−withDeps :: Module -> Module
162−withDeps (Module modulePath es) = Module modulePath (map expandDeps es)
163− where
164− -- | Collects all modules which are imported, so that we can identify dependencies of the first type.
165− imports :: [(String, ModuleIdentifier)]
166− imports = mapMaybe toImport es
167− where
168− toImport :: ModuleElement -> Maybe (String, ModuleIdentifier)
169− toImport (Require _ nm (Right mid)) = Just (nm, mid)
170− toImport _ = Nothing
171−
172− -- | Collects all member names in scope, so that we can identify dependencies of the second type.
173− boundNames :: [String]
174− boundNames = mapMaybe toBoundName es
175− where
176− toBoundName :: ModuleElement -> Maybe String
177− toBoundName (Member _ _ nm _ _) = Just nm
178− toBoundName _ = Nothing
179−
180− -- | Calculate dependencies and add them to the current element.
181− expandDeps :: ModuleElement -> ModuleElement
182− expandDeps (Member n f nm decl _) = Member n f nm decl (nub (concatMap (dependencies modulePath) decl))
183− expandDeps (ExportsList exps) = ExportsList (map expand exps)
184− where
185− expand (ty, nm, n1, _) = (ty, nm, n1, nub (dependencies modulePath n1))
186− expandDeps other = other
187−
188− dependencies :: ModuleIdentifier -> JSNode -> [(ModuleIdentifier, String)]
189− dependencies m = everything (++) (mkQ [] toReference)
190− where
191− toReference :: Node -> [(ModuleIdentifier, String)]
192− toReference (JSMemberDot [ mn ] _ nm)
193− | JSIdentifier mn' <- node mn
194− , JSIdentifier nm' <- node nm
195− , Just mid <- lookup mn' imports
196− = [(mid, nm')]
197− toReference (JSMemberSquare [ mn ] _ nm _)
198− | JSIdentifier mn' <- node mn
199− , JSExpression [ s ] <- node nm
200− , JSStringLiteral _ nm' <- node s
201− , Just mid <- lookup mn' imports
202− = [(mid, nm')]
203− toReference (JSIdentifier nm)
204− | nm `elem` boundNames
205− = [(m, nm)]
206− toReference _ = []
207−
208−-- | Attempt to create a Module from a Javascript AST.
209−--
210−-- Each type of module element is matched using pattern guards, and everything else is bundled into the
211−-- Other constructor.
212−toModule :: forall m. (Applicative m, MonadError ErrorMessage m) => Maybe FilePath -> S.Set String -> ModuleIdentifier -> JSNode -> m Module
213−toModule requirePath mids mid top
214− | JSSourceElementsTop ns <- node top = Module mid <$> traverse toModuleElement ns
215− | otherwise = err InvalidTopLevel
216− where
217− err = throwError . ErrorInModule mid
218−
219− toModuleElement :: JSNode -> m ModuleElement
220− toModuleElement n
221− | JSVariables var [ varIntro ] _ <- node n
222− , JSLiteral "var" <- node var
223− , JSVarDecl impN [ eq, req, impP ] <- node varIntro
224− , JSIdentifier importName <- node impN
225− , JSLiteral "=" <- node eq
226− , JSIdentifier "require" <- node req
227− , JSArguments _ [ impS ] _ <- node impP
228− , JSStringLiteral _ importPath <- node impS
229− , importPath' <- checkImportPath requirePath importPath mid mids
230− = pure (Require n importName importPath')
231− toModuleElement n
232− | JSVariables var [ varIntro ] _ <- node n
233− , JSLiteral "var" <- node var
234− , JSVarDecl declN (eq : decl) <- node varIntro
235− , JSIdentifier name <- node declN
236− , JSLiteral "=" <- node eq
237− = pure (Member n False name decl [])
238− toModuleElement n
239− | JSExpression (e : op : decl) <- node n
240− , Just name <- accessor (node e)
241− , JSOperator eq <- node op
242− , JSLiteral "=" <- node eq
243− = pure (Member n True name decl [])
244− where
245− accessor :: Node -> Maybe String
246− accessor (JSMemberDot [ exports ] _ nm)
247− | JSIdentifier "exports" <- node exports
248− , JSIdentifier name <- node nm
249− = Just name
250− accessor (JSMemberSquare [ exports ] _ nm _)
251− | JSIdentifier "exports" <- node exports
252− , JSExpression [e] <- node nm
253− , JSStringLiteral _ name <- node e
254− = Just name
255− accessor _ = Nothing
256− toModuleElement n
257− | JSExpression (mnExp : op : obj: _) <- node n
258− , JSMemberDot [ mn ] _ e <- node mnExp
259− , JSIdentifier "module" <- node mn
260− , JSIdentifier "exports" <- node e
261− , JSOperator eq <- node op
262− , JSLiteral "=" <- node eq
263− , JSObjectLiteral _ props _ <- node obj
264− = ExportsList <$> traverse toExport (filter (not . isSeparator) (map node props))
265− where
266− toExport :: Node -> m (ExportType, String, JSNode, [Key])
267− toExport (JSPropertyNameandValue name _ [val] ) =
268− (,,val,[]) <$> exportType (node val)
269− <*> extractLabel (node name)
270− toExport _ = err UnsupportedExport
271−
272− exportType :: Node -> m ExportType
273− exportType (JSMemberDot [f] _ _)
274− | JSIdentifier "$foreign" <- node f
275− = pure ForeignReexport
276− exportType (JSMemberSquare [f] _ _ _)
277− | JSIdentifier "$foreign" <- node f
278− = pure ForeignReexport
279− exportType (JSIdentifier s) = pure (RegularExport s)
280− exportType _ = err UnsupportedExport
281−
282− extractLabel :: Node -> m String
283− extractLabel (JSStringLiteral _ nm) = pure nm
284− extractLabel (JSIdentifier nm) = pure nm
285− extractLabel _ = err UnsupportedExport
286−
287− isSeparator :: Node -> Bool
288− isSeparator (JSLiteral ",") = True
289− isSeparator _ = False
290− toModuleElement other = pure (Other other)
291−
292−-- | Eliminate unused code based on the specified entry point set.
293−compile :: [Module] -> [ModuleIdentifier] -> [Module]
294−compile modules [] = modules
295−compile modules entryPoints = filteredModules
296− where
297− (graph, _, vertexFor) = graphFromEdges verts
298−
299− -- | The vertex set
300− verts :: [(ModuleElement, Key, [Key])]
301− verts = do
302− Module mid els <- modules
303− concatMap (toVertices mid) els
304− where
305− -- | Create a set of vertices for a module element.
306− --
307− -- Some special cases worth commenting on:
308− --
309− -- 1) Regular exports which simply export their own name do not count as dependencies.
310− -- Regular exports which rename and reexport an operator do count, however.
311− --
312− -- 2) Require statements don't contribute towards dependencies, since they effectively get
313− -- inlined wherever they are used inside other module elements.
314− toVertices :: ModuleIdentifier -> ModuleElement -> [(ModuleElement, Key, [Key])]
315− toVertices p m@(Member _ _ nm _ deps) = [(m, (p, nm), deps)]
316− toVertices p m@(ExportsList exps) = mapMaybe toVertex exps
317− where
318− toVertex (ForeignReexport, nm, _, ks) = Just (m, (p, nm), ks)
319− toVertex (RegularExport nm, nm1, _, ks) | nm /= nm1 = Just (m, (p, nm1), ks)
320− toVertex _ = Nothing
321− toVertices _ _ = []
322−
323− -- | The set of vertices whose connected components we are interested in keeping.
324− entryPointVertices :: [Vertex]
325− entryPointVertices = catMaybes $ do
326− (_, k@(mid, _), _) <- verts
327− guard $ mid `elem` entryPoints
328− return (vertexFor k)
329−
330− -- | The set of vertices reachable from an entry point
331− reachableSet :: S.Set Vertex
332− reachableSet = S.fromList (concatMap (reachable graph) entryPointVertices)
333−
334− filteredModules :: [Module]
335− filteredModules = map filterUsed modules
336− where
337− filterUsed :: Module -> Module
338− filterUsed (Module mid ds) = Module mid (map filterExports (go ds))
339− where
340− go :: [ModuleElement] -> [ModuleElement]
341− go [] = []
342− go (d : Other semi : rest)
343− | JSLiteral ";" <- node semi
344− , not (isDeclUsed d)
345− = go rest
346− go (d : rest)
347− | not (isDeclUsed d) = go rest
348− | otherwise = d : go rest
349−
350− -- | Filter out the exports for members which aren't used.
351− filterExports :: ModuleElement -> ModuleElement
352− filterExports (ExportsList exps) = ExportsList (filter (\(_, nm, _, _) -> isKeyUsed (mid, nm)) exps)
353− filterExports me = me
354−
355− isDeclUsed :: ModuleElement -> Bool
356− isDeclUsed (Member _ _ nm _ _) = isKeyUsed (mid, nm)
357− isDeclUsed _ = True
358−
359− isKeyUsed :: Key -> Bool
360− isKeyUsed k
361− | Just me <- vertexFor k = me `S.member` reachableSet
362− | otherwise = False
363−
364−-- | Topologically sort the module dependency graph, so that when we generate code, modules can be
365−-- defined in the right order.
366−sortModules :: [Module] -> [Module]
367−sortModules modules = map (\v -> case nodeFor v of (n, _, _) -> n) (reverse (topSort graph))
368− where
369− (graph, nodeFor, _) = graphFromEdges $ do
370− m@(Module mid els) <- modules
371− return (m, mid, mapMaybe getKey els)
372−
373− getKey :: ModuleElement -> Maybe ModuleIdentifier
374− getKey (Require _ _ (Right mi)) = Just mi
375− getKey _ = Nothing
376−
377−-- | A module is empty if it contains no exported members (in other words,
378−-- if the only things left after dead code elimination are module imports and
379−-- "other" foreign code).
380−--
381−-- If a module is empty, we don't want to generate code for it.
382−isModuleEmpty :: Module -> Bool
383−isModuleEmpty (Module _ els) = all isElementEmpty els
384− where
385− isElementEmpty :: ModuleElement -> Bool
386− isElementEmpty (ExportsList exps) = null exps
387− isElementEmpty Require{} = True
388− isElementEmpty (Other _) = True
389− isElementEmpty _ = False
390−
391−-- | Generate code for a set of modules, including a call to main().
392−--
393−-- Modules get defined on the global PS object, as follows:
394−--
395−-- var PS = { };
396−-- (function(exports) {
397−-- ...
398−-- })(PS["Module.Name"] = PS["Module.Name"] || {});
399−--
400−-- In particular, a module and its foreign imports share the same namespace inside PS.
401−-- This saves us from having to generate unique names for a module and its foreign imports,
402−-- and is safe since a module shares a namespace with its foreign imports in PureScript as well
403−-- (so there is no way to have overlaps in code generated by psc).
404−codeGen :: Maybe String -- ^ main module
405− -> String -- ^ namespace
406− -> [Module] -- ^ input modules
407− -> String
408−codeGen optionsMainModule optionsNamespace ms = renderToString (NN (JSSourceElementsTop (prelude ++ concatMap moduleToJS ms ++ maybe [] runMain optionsMainModule)))
409− where
410− moduleToJS :: Module -> [JSNode]
411− moduleToJS (Module mn ds) = wrap (moduleName mn) (indent (concatMap declToJS ds))
412− where
413− declToJS :: ModuleElement -> [JSNode]
414− declToJS (Member n _ _ _ _) = [n]
415− declToJS (Other n) = [n]
416− declToJS (Require _ nm req) =
417− [ NN (JSVariables (NT (JSLiteral "var") tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n " ])
418− [ NN (JSVarDecl (sp (JSIdentifier nm))
419− (sp (JSLiteral "=") : either require (return . moduleReference sp . moduleName) req))
420− ]
421− (nt (JSLiteral ";"))) ]
422− declToJS (ExportsList exps) = map toExport exps
423−
424− where
425− toExport :: (ExportType, String, JSNode, [Key]) -> JSNode
426− toExport (_, nm, val, _) =
427− NN (JSExpression [ NN (JSMemberSquare [ NT (JSIdentifier "exports") tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n " ] ]
428− (nt (JSLiteral "["))
429− (NN (JSExpression [ nt (JSStringLiteral '"' nm) ]))
430− (nt (JSLiteral "]")))
431− , NN (JSOperator (sp (JSLiteral "=")))
432− , reindent val
433− , nt (JSLiteral ";")
434− ])
435−
436− reindent :: JSNode -> JSNode
437− reindent (NT n _ _) = sp n
438− reindent nn = nn
439−
440− indent :: [JSNode] -> [JSNode]
441− indent = everywhere (mkT squash)
442− where
443− squash (NT n pos ann) = NT n (keepCol pos) (map splat ann)
444− squash nn = nn
445−
446− splat (CommentA pos s) = CommentA (keepCol pos) s
447− splat (WhiteSpace pos w) = WhiteSpace (keepCol pos) w
448− splat ann = ann
449−
450− keepCol (TokenPn _ _ c) = TokenPn 0 0 (c + 2)
451−
452− prelude :: [JSNode]
453− prelude =
454− [ NN (JSVariables (NT (JSLiteral "var") tokenPosnEmpty [ CommentA tokenPosnEmpty ("// Generated by psc-bundle " ++ showVersion Paths.version)
455− , WhiteSpace tokenPosnEmpty "\n"
456− ])
457− [ NN (JSVarDecl (sp (JSIdentifier optionsNamespace))
458− [ sp (JSLiteral "=")
459− , NN (JSObjectLiteral (sp (JSLiteral "{"))
460− []
461− (sp (JSLiteral "}")))
462− ])
463− ]
464− (nt (JSLiteral ";")))
465− , lf
466− ]
467−
468− require :: String -> [JSNode]
469− require mn = [ sp (JSIdentifier "require")
470− , NN (JSArguments (nt (JSLiteral "(")) [ nt (JSStringLiteral '"' mn) ] (nt (JSLiteral ")")))
471− ]
472−
473− moduleReference :: (Node -> JSNode) -> String -> JSNode
474− moduleReference f mn =
475− NN (JSMemberSquare [ f (JSIdentifier optionsNamespace) ]
476− (nt (JSLiteral "["))
477− (NN (JSExpression [ nt (JSStringLiteral '"' mn) ]))
478− (nt (JSLiteral "]")))
479−
480− wrap :: String -> [JSNode] -> [JSNode]
481− wrap mn ds =
482− [ NN (JSExpression [ NN (JSExpressionParen (nt (JSLiteral "("))
483− (NN (JSExpression [ NN (JSFunctionExpression (nt (JSLiteral "function"))
484− []
485− (nt (JSLiteral "(") ) [nt (JSIdentifier "exports")] (nt (JSLiteral ")"))
486− (NN (JSBlock [sp (JSLiteral "{")]
487− (lf : ds)
488− [nl (JSLiteral "}")])))]))
489− (nt (JSLiteral ")")))
490− , NN (JSArguments (nt (JSLiteral "("))
491− [ NN (JSExpression [ moduleReference nt mn
492− , NN (JSOperator (sp (JSLiteral "=")))
493− , NN (JSExpressionBinary "||"
494− [ moduleReference sp mn ]
495− (sp (JSLiteral "||"))
496− [ emptyObj ])
497− ])
498− ]
499− (nt (JSLiteral ")")))
500− ])
501− , nt (JSLiteral ";")
502− , lf
503− ]
504− where
505− emptyObj = NN (JSObjectLiteral (sp (JSLiteral "{")) [] (nt (JSLiteral "}")))
506−
507− runMain :: String -> [JSNode]
508− runMain mn =
509− [ NN (JSExpression [ NN (JSMemberDot [ NN (JSMemberSquare [ nl (JSIdentifier optionsNamespace) ]
510− (nt (JSLiteral "["))
511− (NN (JSExpression [ nt (JSStringLiteral '"' mn) ]))
512− (nt (JSLiteral "]")))
513− ]
514− (nt (JSLiteral "."))
515− (nt (JSIdentifier "main")))
516− , NN (JSArguments (nt (JSLiteral "(")) [] (nt (JSLiteral ")")))
517− ])
518− , nt (JSLiteral ";")
519− ]
520−
521− nt :: Node -> JSNode
522− nt n = NT n tokenPosnEmpty []
523−
524− lf :: JSNode
525− lf = NT (JSLiteral "") tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n" ]
526−
527− sp :: Node -> JSNode
528− sp n = NT n tokenPosnEmpty [ WhiteSpace tokenPosnEmpty " " ]
529−
530− nl :: Node -> JSNode
531− nl n = NT n tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n" ]
532−
533−-- | The bundling function.
534−-- This function performs dead code elimination, filters empty modules
535−-- and generates and prints the final Javascript bundle.
536−bundle :: (Applicative m, MonadError ErrorMessage m)
537− => [(ModuleIdentifier, String)] -- ^ The input modules. Each module should be javascript rendered from 'Language.PureScript.Make' or @psc@.
538− -> [ModuleIdentifier] -- ^ Entry points. These module identifiers are used as the roots for dead-code elimination
539− -> Maybe String -- ^ An optional main module.
540− -> String -- ^ The namespace (e.g. PS).
541− -> Maybe FilePath -- ^ The require path prefix
542− -> m String
543−bundle inputStrs entryPoints mainModule namespace requirePath = do
544− input <- forM inputStrs $ \(ident, js) -> do
545− ast <- either (throwError . ErrorInModule ident . UnableToParseModule) pure $ parse js (moduleName ident)
546− return (ident, ast)
547−
548− let mids = S.fromList (map (moduleName . fst) input)
549−
550− modules <- traverse (fmap withDeps . uncurry (toModule requirePath mids)) input
551−
552− let compiled = compile modules entryPoints
553− sorted = sortModules (filter (not . isModuleEmpty) compiled)
554−
555− return (codeGen mainModule namespace sorted)
src/Language/PureScript/CodeGen.hsdeleted−20
@@ -1,20 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen
4−-- Copyright : (c) Phil Freeman 2013
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- A collection of modules related to code generation:
13−--
14−-- [@Language.PureScript.CodeGen.JS@] Code generator for Javascript
15−--
16−-----------------------------------------------------------------------------
17−
18−module Language.PureScript.CodeGen (module C) where
19−
20−import Language.PureScript.CodeGen.JS as C
src/Language/PureScript/CodeGen/JS.hsdeleted−452
@@ -1,452 +0,0 @@
1−{-# LANGUAGE GADTs #-}
2−{-# LANGUAGE ViewPatterns #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE ScopedTypeVariables #-}
5−
6−-- |
7−-- This module generates code in the simplified Javascript intermediate representation from Purescript code
8−--
9−module Language.PureScript.CodeGen.JS
10− ( module AST
11− , module Common
12− , moduleToJs
13− ) where
14−
15−import Prelude ()
16−import Prelude.Compat
17−
18−import Data.List ((\\), delete, intersect)
19−import Data.Maybe (isNothing, fromMaybe)
20−import qualified Data.Map as M
21−import qualified Data.Foldable as F
22−import qualified Data.Traversable as T
23−
24−import Control.Arrow ((&&&))
25−import Control.Monad (replicateM, forM, void)
26−import Control.Monad.Error.Class (MonadError(..))
27−import Control.Monad.Reader (MonadReader, asks)
28−import Control.Monad.Supply.Class
29−
30−import Language.PureScript.Crash
31−import Language.PureScript.AST.SourcePos
32−import Language.PureScript.CodeGen.JS.AST as AST
33−import Language.PureScript.CodeGen.JS.Common as Common
34−import Language.PureScript.CoreFn
35−import Language.PureScript.Names
36−import Language.PureScript.Errors
37−import Language.PureScript.CodeGen.JS.Optimizer
38−import Language.PureScript.Options
39−import Language.PureScript.Traversals (sndM)
40−import qualified Language.PureScript.Constants as C
41−
42−import System.FilePath.Posix ((</>))
43−
44−-- |
45−-- Generate code in the simplified Javascript intermediate representation for all declarations in a
46−-- module.
47−--
48−moduleToJs
49− :: forall m
50− . (Applicative m, Monad m, MonadReader Options m, MonadSupply m, MonadError MultipleErrors m)
51− => Module Ann
52− -> Maybe JS
53− -> m [JS]
54−moduleToJs (Module coms mn imps exps foreigns decls) foreign_ =
55− rethrow (addHint (ErrorInModule mn)) $ do
56− let usedNames = concatMap getNames decls
57− let mnLookup = renameImports usedNames imps
58− jsImports <- T.traverse (importToJs mnLookup) . delete (ModuleName [ProperName C.prim]) . (\\ [mn]) $ map snd $ imps
59− let decls' = renameModules mnLookup decls
60− jsDecls <- mapM bindToJs decls'
61− optimized <- T.traverse (T.traverse optimize) jsDecls
62− F.traverse_ (F.traverse_ checkIntegers) optimized
63− comments <- not <$> asks optionsNoComments
64− let strict = JSStringLiteral Nothing "use strict"
65− let header = if comments && not (null coms) then JSComment Nothing coms strict else strict
66− let foreign' = [JSVariableIntroduction Nothing "$foreign" foreign_ | not $ null foreigns || isNothing foreign_]
67− let moduleBody = header : foreign' ++ jsImports ++ concat optimized
68− let foreignExps = exps `intersect` (fst `map` foreigns)
69− let standardExps = exps \\ foreignExps
70− let exps' = JSObjectLiteral Nothing $ map (runIdent &&& (JSVar Nothing) . identToJs) standardExps
71− ++ map (runIdent &&& foreignIdent) foreignExps
72− return $ moduleBody ++ [JSAssignment Nothing (JSAccessor Nothing "exports" (JSVar Nothing "module")) exps']
73−
74− where
75−
76− -- |
77− -- Extracts all declaration names from a binding group.
78− --
79− getNames :: Bind Ann -> [Ident]
80− getNames (NonRec _ ident _) = [ident]
81− getNames (Rec vals) = map (snd . fst) vals
82−
83− -- |
84− -- Creates alternative names for each module to ensure they don't collide
85− -- with declaration names.
86− --
87− renameImports :: [Ident] -> [(Ann, ModuleName)] -> M.Map ModuleName (Ann, ModuleName)
88− renameImports ids mns = go M.empty ids mns
89− where
90− go :: M.Map ModuleName (Ann, ModuleName) -> [Ident] -> [(Ann, ModuleName)] -> M.Map ModuleName (Ann, ModuleName)
91− go acc used ((ann, mn') : mns') =
92− let mni = Ident $ runModuleName mn'
93− in if mn' /= mn && mni `elem` used
94− then let newName = freshModuleName 1 mn' used
95− in go (M.insert mn' (ann, newName) acc) (Ident (runModuleName newName) : used) mns'
96− else go (M.insert mn' (ann, mn') acc) (mni : used) mns'
97− go acc _ [] = acc
98−
99− freshModuleName :: Integer -> ModuleName -> [Ident] -> ModuleName
100− freshModuleName i mn'@(ModuleName pns) used =
101− let newName = ModuleName $ init pns ++ [ProperName $ runProperName (last pns) ++ "_" ++ show i]
102− in if Ident (runModuleName newName) `elem` used
103− then freshModuleName (i + 1) mn' used
104− else newName
105−
106− -- |
107− -- Generates Javascript code for a module import, binding the required module
108− -- to the alternative
109− --
110− importToJs :: M.Map ModuleName (Ann, ModuleName) -> ModuleName -> m JS
111− importToJs mnLookup mn' = do
112− path <- asks optionsRequirePath
113− let ((ss, _, _, _), mnSafe) = fromMaybe (internalError "Missing value in mnLookup") $ M.lookup mn' mnLookup
114− let moduleBody = JSApp Nothing (JSVar Nothing "require") [JSStringLiteral Nothing (maybe id (</>) path $ runModuleName mn')]
115− withPos ss $ JSVariableIntroduction Nothing (moduleNameToJs mnSafe) (Just moduleBody)
116−
117− -- |
118− -- Replaces the `ModuleName`s in the AST so that the generated code refers to
119− -- the collision-avoiding renamed module imports.
120− --
121− renameModules :: M.Map ModuleName (Ann, ModuleName) -> [Bind Ann] -> [Bind Ann]
122− renameModules mnLookup binds =
123− let (f, _, _) = everywhereOnValues id goExpr goBinder
124− in map f binds
125− where
126− goExpr :: Expr a -> Expr a
127− goExpr (Var ann q) = Var ann (renameQual q)
128− goExpr e = e
129− goBinder :: Binder a -> Binder a
130− goBinder (ConstructorBinder ann q1 q2 bs) = ConstructorBinder ann (renameQual q1) (renameQual q2) bs
131− goBinder b = b
132− renameQual :: Qualified a -> Qualified a
133− renameQual (Qualified (Just mn') a) =
134− let (_,mnSafe) = fromMaybe (internalError "Missing value in mnLookup") $ M.lookup mn' mnLookup
135− in Qualified (Just mnSafe) a
136− renameQual q = q
137−
138− -- |
139− -- Generate code in the simplified Javascript intermediate representation for a declaration
140− --
141− bindToJs :: Bind Ann -> m [JS]
142− bindToJs (NonRec ann ident val) = return <$> nonRecToJS ann ident val
143− bindToJs (Rec vals) = forM vals (uncurry . uncurry $ nonRecToJS)
144−
145− -- |
146− -- Generate code in the simplified Javascript intermediate representation for a single non-recursive
147− -- declaration.
148− --
149− -- The main purpose of this function is to handle code generation for comments.
150− --
151− nonRecToJS :: Ann -> Ident -> Expr Ann -> m JS
152− nonRecToJS a i e@(extractAnn -> (_, com, _, _)) | not (null com) = do
153− withoutComment <- asks optionsNoComments
154− if withoutComment
155− then nonRecToJS a i (modifyAnn removeComments e)
156− else JSComment Nothing com <$> nonRecToJS a i (modifyAnn removeComments e)
157− nonRecToJS (ss, _, _, _) ident val = do
158− js <- valueToJs val
159− withPos ss $ JSVariableIntroduction Nothing (identToJs ident) (Just js)
160−
161− withPos :: Maybe SourceSpan -> JS -> m JS
162− withPos (Just ss) js = do
163− withSM <- asks optionsSourceMaps
164− return $ if withSM
165− then withSourceSpan ss js
166− else js
167− withPos Nothing js = return js
168−
169− -- |
170− -- Generate code in the simplified Javascript intermediate representation for a variable based on a
171− -- PureScript identifier.
172− --
173− var :: Ident -> JS
174− var = JSVar Nothing . identToJs
175−
176− -- |
177− -- Generate code in the simplified Javascript intermediate representation for an accessor based on
178− -- a PureScript identifier. If the name is not valid in Javascript (symbol based, reserved name) an
179− -- indexer is returned.
180− --
181− accessor :: Ident -> JS -> JS
182− accessor (Ident prop) = accessorString prop
183− accessor (Op op) = JSIndexer Nothing (JSStringLiteral Nothing op)
184− accessor (GenIdent _ _) = internalError "GenIdent in accessor"
185−
186− accessorString :: String -> JS -> JS
187− accessorString prop | identNeedsEscaping prop = JSIndexer Nothing (JSStringLiteral Nothing prop)
188− | otherwise = JSAccessor Nothing prop
189−
190− -- |
191− -- Generate code in the simplified Javascript intermediate representation for a value or expression.
192− --
193− valueToJs :: Expr Ann -> m JS
194− valueToJs e =
195− let (ss, _, _, _) = extractAnn e in
196− withPos ss =<< valueToJs' e
197−
198− valueToJs' :: Expr Ann -> m JS
199− valueToJs' (Literal (pos, _, _, _) l) =
200− maybe id rethrowWithPosition pos $ literalToValueJS l
201− valueToJs' (Var (_, _, _, Just (IsConstructor _ [])) name) =
202− return $ JSAccessor Nothing "value" $ qualifiedToJS id name
203− valueToJs' (Var (_, _, _, Just (IsConstructor _ _)) name) =
204− return $ JSAccessor Nothing "create" $ qualifiedToJS id name
205− valueToJs' (Accessor _ prop val) =
206− accessorString prop <$> valueToJs val
207− valueToJs' (ObjectUpdate _ o ps) = do
208− obj <- valueToJs o
209− sts <- mapM (sndM valueToJs) ps
210− extendObj obj sts
211− valueToJs' e@(Abs (_, _, _, Just IsTypeClassConstructor) _ _) =
212− let args = unAbs e
213− in return $ JSFunction Nothing Nothing (map identToJs args) (JSBlock Nothing $ map assign args)
214− where
215− unAbs :: Expr Ann -> [Ident]
216− unAbs (Abs _ arg val) = arg : unAbs val
217− unAbs _ = []
218− assign :: Ident -> JS
219− assign name = JSAssignment Nothing (accessorString (runIdent name) (JSVar Nothing "this"))
220− (var name)
221− valueToJs' (Abs _ arg val) = do
222− ret <- valueToJs val
223− return $ JSFunction Nothing Nothing [identToJs arg] (JSBlock Nothing [JSReturn Nothing ret])
224− valueToJs' e@App{} = do
225− let (f, args) = unApp e []
226− args' <- mapM valueToJs args
227− case f of
228− Var (_, _, _, Just IsNewtype) _ -> return (head args')
229− Var (_, _, _, Just (IsConstructor _ fields)) name | length args == length fields ->
230− return $ JSUnary Nothing JSNew $ JSApp Nothing (qualifiedToJS id name) args'
231− Var (_, _, _, Just IsTypeClassConstructor) name ->
232− return $ JSUnary Nothing JSNew $ JSApp Nothing (qualifiedToJS id name) args'
233− _ -> flip (foldl (\fn a -> JSApp Nothing fn [a])) args' <$> valueToJs f
234− where
235− unApp :: Expr Ann -> [Expr Ann] -> (Expr Ann, [Expr Ann])
236− unApp (App _ val arg) args = unApp val (arg : args)
237− unApp other args = (other, args)
238− valueToJs' (Var (_, _, _, Just IsForeign) qi@(Qualified (Just mn') ident)) =
239− return $ if mn' == mn
240− then foreignIdent ident
241− else varToJs qi
242− valueToJs' (Var (_, _, _, Just IsForeign) ident) =
243− error $ "Encountered an unqualified reference to a foreign ident " ++ showQualified showIdent ident
244− valueToJs' (Var _ ident) = return $ varToJs ident
245− valueToJs' (Case (maybeSpan, _, _, _) values binders) = do
246− vals <- mapM valueToJs values
247− bindersToJs maybeSpan binders vals
248− valueToJs' (Let _ ds val) = do
249− ds' <- concat <$> mapM bindToJs ds
250− ret <- valueToJs val
251− return $ JSApp Nothing (JSFunction Nothing Nothing [] (JSBlock Nothing (ds' ++ [JSReturn Nothing ret]))) []
252− valueToJs' (Constructor (_, _, _, Just IsNewtype) _ (ProperName ctor) _) =
253− return $ JSVariableIntroduction Nothing ctor (Just $
254− JSObjectLiteral Nothing [("create",
255− JSFunction Nothing Nothing ["value"]
256− (JSBlock Nothing [JSReturn Nothing $ JSVar Nothing "value"]))])
257− valueToJs' (Constructor _ _ (ProperName ctor) []) =
258− return $ iife ctor [ JSFunction Nothing (Just ctor) [] (JSBlock Nothing [])
259− , JSAssignment Nothing (JSAccessor Nothing "value" (JSVar Nothing ctor))
260− (JSUnary Nothing JSNew $ JSApp Nothing (JSVar Nothing ctor) []) ]
261− valueToJs' (Constructor _ _ (ProperName ctor) fields) =
262− let constructor =
263− let body = [ JSAssignment Nothing (JSAccessor Nothing (identToJs f) (JSVar Nothing "this")) (var f) | f <- fields ]
264− in JSFunction Nothing (Just ctor) (identToJs `map` fields) (JSBlock Nothing body)
265− createFn =
266− let body = JSUnary Nothing JSNew $ JSApp Nothing (JSVar Nothing ctor) (var `map` fields)
267− in foldr (\f inner -> JSFunction Nothing Nothing [identToJs f] (JSBlock Nothing [JSReturn Nothing inner])) body fields
268− in return $ iife ctor [ constructor
269− , JSAssignment Nothing (JSAccessor Nothing "create" (JSVar Nothing ctor)) createFn
270− ]
271−
272− iife :: String -> [JS] -> JS
273− iife v exprs = JSApp Nothing (JSFunction Nothing Nothing [] (JSBlock Nothing $ exprs ++ [JSReturn Nothing $ JSVar Nothing v])) []
274−
275− literalToValueJS :: Literal (Expr Ann) -> m JS
276− literalToValueJS (NumericLiteral (Left i)) = return $ JSNumericLiteral Nothing (Left i)
277− literalToValueJS (NumericLiteral (Right n)) = return $ JSNumericLiteral Nothing (Right n)
278− literalToValueJS (StringLiteral s) = return $ JSStringLiteral Nothing s
279− literalToValueJS (CharLiteral c) = return $ JSStringLiteral Nothing [c]
280− literalToValueJS (BooleanLiteral b) = return $ JSBooleanLiteral Nothing b
281− literalToValueJS (ArrayLiteral xs) = JSArrayLiteral Nothing <$> mapM valueToJs xs
282− literalToValueJS (ObjectLiteral ps) = JSObjectLiteral Nothing <$> mapM (sndM valueToJs) ps
283−
284− -- |
285− -- Shallow copy an object.
286− --
287− extendObj :: JS -> [(String, JS)] -> m JS
288− extendObj obj sts = do
289− newObj <- freshName
290− key <- freshName
291− let
292− jsKey = JSVar Nothing key
293− jsNewObj = JSVar Nothing newObj
294− block = JSBlock Nothing (objAssign:copy:extend ++ [JSReturn Nothing jsNewObj])
295− objAssign = JSVariableIntroduction Nothing newObj (Just $ JSObjectLiteral Nothing [])
296− copy = JSForIn Nothing key obj $ JSBlock Nothing [JSIfElse Nothing cond assign Nothing]
297− cond = JSApp Nothing (JSAccessor Nothing "hasOwnProperty" obj) [jsKey]
298− assign = JSBlock Nothing [JSAssignment Nothing (JSIndexer Nothing jsKey jsNewObj) (JSIndexer Nothing jsKey obj)]
299− stToAssign (s, js) = JSAssignment Nothing (JSAccessor Nothing s jsNewObj) js
300− extend = map stToAssign sts
301− return $ JSApp Nothing (JSFunction Nothing Nothing [] block) []
302−
303− -- |
304− -- Generate code in the simplified Javascript intermediate representation for a reference to a
305− -- variable.
306− --
307− varToJs :: Qualified Ident -> JS
308− varToJs (Qualified Nothing ident) = var ident
309− varToJs qual = qualifiedToJS id qual
310−
311− -- |
312− -- Generate code in the simplified Javascript intermediate representation for a reference to a
313− -- variable that may have a qualified name.
314− --
315− qualifiedToJS :: (a -> Ident) -> Qualified a -> JS
316− qualifiedToJS f (Qualified (Just (ModuleName [ProperName mn'])) a) | mn' == C.prim = JSVar Nothing . runIdent $ f a
317− qualifiedToJS f (Qualified (Just mn') a) | mn /= mn' = accessor (f a) (JSVar Nothing (moduleNameToJs mn'))
318− qualifiedToJS f (Qualified _ a) = JSVar Nothing $ identToJs (f a)
319−
320− foreignIdent :: Ident -> JS
321− foreignIdent ident = accessorString (runIdent ident) (JSVar Nothing "$foreign")
322−
323− -- |
324− -- Generate code in the simplified Javascript intermediate representation for pattern match binders
325− -- and guards.
326− --
327− bindersToJs :: Maybe SourceSpan -> [CaseAlternative Ann] -> [JS] -> m JS
328− bindersToJs maybeSpan binders vals = do
329− valNames <- replicateM (length vals) freshName
330− let assignments = zipWith (JSVariableIntroduction Nothing) valNames (map Just vals)
331− jss <- forM binders $ \(CaseAlternative bs result) -> do
332− ret <- guardsToJs result
333− go valNames ret bs
334− return $ JSApp Nothing (JSFunction Nothing Nothing [] (JSBlock Nothing (assignments ++ concat jss ++ [JSThrow Nothing $ failedPatternError valNames])))
335− []
336− where
337− go :: [String] -> [JS] -> [Binder Ann] -> m [JS]
338− go _ done [] = return done
339− go (v:vs) done' (b:bs) = do
340− done'' <- go vs done' bs
341− binderToJs v done'' b
342− go _ _ _ = internalError "Invalid arguments to bindersToJs"
343−
344− failedPatternError :: [String] -> JS
345− failedPatternError names = JSUnary Nothing JSNew $ JSApp Nothing (JSVar Nothing "Error") [JSBinary Nothing Add (JSStringLiteral Nothing failedPatternMessage) (JSArrayLiteral Nothing $ zipWith valueError names vals)]
346−
347− failedPatternMessage :: String
348− failedPatternMessage = "Failed pattern match" ++ maybe "" (((" at " ++ runModuleName mn ++ " ") ++) . displayStartEndPos) maybeSpan ++ ": "
349−
350− valueError :: String -> JS -> JS
351− valueError _ l@(JSNumericLiteral _ _) = l
352− valueError _ l@(JSStringLiteral _ _) = l
353− valueError _ l@(JSBooleanLiteral _ _) = l
354− valueError s _ = JSAccessor Nothing "name" . JSAccessor Nothing "constructor" $ JSVar Nothing s
355−
356− guardsToJs :: Either [(Guard Ann, Expr Ann)] (Expr Ann) -> m [JS]
357− guardsToJs (Left gs) = forM gs $ \(cond, val) -> do
358− cond' <- valueToJs cond
359− done <- valueToJs val
360− return $ JSIfElse Nothing cond' (JSBlock Nothing [JSReturn Nothing done]) Nothing
361− guardsToJs (Right v) = return . JSReturn Nothing <$> valueToJs v
362−
363− binderToJs :: String -> [JS] -> Binder Ann -> m [JS]
364− binderToJs s done binder =
365− let (ss, _, _, _) = extractBinderAnn binder in
366− traverse (withPos ss) =<< binderToJs' s done binder
367−
368− -- |
369− -- Generate code in the simplified Javascript intermediate representation for a pattern match
370− -- binder.
371− --
372− binderToJs' :: String -> [JS] -> Binder Ann -> m [JS]
373− binderToJs' _ done (NullBinder{}) = return done
374− binderToJs' varName done (LiteralBinder _ l) =
375− literalToBinderJS varName done l
376− binderToJs' varName done (VarBinder _ ident) =
377− return (JSVariableIntroduction Nothing (identToJs ident) (Just (JSVar Nothing varName)) : done)
378− binderToJs' varName done (ConstructorBinder (_, _, _, Just IsNewtype) _ _ [b]) =
379− binderToJs varName done b
380− binderToJs' varName done (ConstructorBinder (_, _, _, Just (IsConstructor ctorType fields)) _ ctor bs) = do
381− js <- go (zip fields bs) done
382− return $ case ctorType of
383− ProductType -> js
384− SumType ->
385− [JSIfElse Nothing (JSInstanceOf Nothing (JSVar Nothing varName) (qualifiedToJS (Ident . runProperName) ctor))
386− (JSBlock Nothing js)
387− Nothing]
388− where
389− go :: [(Ident, Binder Ann)] -> [JS] -> m [JS]
390− go [] done' = return done'
391− go ((field, binder) : remain) done' = do
392− argVar <- freshName
393− done'' <- go remain done'
394− js <- binderToJs argVar done'' binder
395− return (JSVariableIntroduction Nothing argVar (Just (JSAccessor Nothing (identToJs field) (JSVar Nothing varName))) : js)
396− binderToJs' _ _ ConstructorBinder{} =
397− internalError "binderToJs: Invalid ConstructorBinder in binderToJs"
398− binderToJs' varName done (NamedBinder _ ident binder) = do
399− js <- binderToJs varName done binder
400− return (JSVariableIntroduction Nothing (identToJs ident) (Just (JSVar Nothing varName)) : js)
401−
402− literalToBinderJS :: String -> [JS] -> Literal (Binder Ann) -> m [JS]
403− literalToBinderJS varName done (NumericLiteral num) =
404− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSVar Nothing varName) (JSNumericLiteral Nothing num)) (JSBlock Nothing done) Nothing]
405− literalToBinderJS varName done (CharLiteral c) =
406− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSVar Nothing varName) (JSStringLiteral Nothing [c])) (JSBlock Nothing done) Nothing]
407− literalToBinderJS varName done (StringLiteral str) =
408− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSVar Nothing varName) (JSStringLiteral Nothing str)) (JSBlock Nothing done) Nothing]
409− literalToBinderJS varName done (BooleanLiteral True) =
410− return [JSIfElse Nothing (JSVar Nothing varName) (JSBlock Nothing done) Nothing]
411− literalToBinderJS varName done (BooleanLiteral False) =
412− return [JSIfElse Nothing (JSUnary Nothing Not (JSVar Nothing varName)) (JSBlock Nothing done) Nothing]
413− literalToBinderJS varName done (ObjectLiteral bs) = go done bs
414− where
415− go :: [JS] -> [(String, Binder Ann)] -> m [JS]
416− go done' [] = return done'
417− go done' ((prop, binder):bs') = do
418− propVar <- freshName
419− done'' <- go done' bs'
420− js <- binderToJs propVar done'' binder
421− return (JSVariableIntroduction Nothing propVar (Just (accessorString prop (JSVar Nothing varName))) : js)
422− literalToBinderJS varName done (ArrayLiteral bs) = do
423− js <- go done 0 bs
424− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSAccessor Nothing "length" (JSVar Nothing varName)) (JSNumericLiteral Nothing (Left (fromIntegral $ length bs)))) (JSBlock Nothing js) Nothing]
425− where
426− go :: [JS] -> Integer -> [Binder Ann] -> m [JS]
427− go done' _ [] = return done'
428− go done' index (binder:bs') = do
429− elVar <- freshName
430− done'' <- go done' (index + 1) bs'
431− js <- binderToJs elVar done'' binder
432− return (JSVariableIntroduction Nothing elVar (Just (JSIndexer Nothing (JSNumericLiteral Nothing (Left index)) (JSVar Nothing varName))) : js)
433−
434− -- Check that all integers fall within the valid int range for JavaScript.
435− checkIntegers :: JS -> m ()
436− checkIntegers = void . everywhereOnJSTopDownM go
437− where
438− go :: JS -> m JS
439− go (JSUnary _ Negate (JSNumericLiteral ss (Left i))) =
440− -- Move the negation inside the literal; since this is a top-down
441− -- traversal doing this replacement will stop the next case from raising
442− -- the error when attempting to use -2147483648, as if left unrewritten
443− -- the value is `JSUnary Negate (JSNumericLiteral (Left 2147483648))`, and
444− -- 2147483648 is larger than the maximum allowed int.
445− return $ JSNumericLiteral ss (Left (-i))
446− go js@(JSNumericLiteral _ (Left i)) =
447− let minInt = -2147483648
448− maxInt = 2147483647
449− in if i < minInt || i > maxInt
450− then throwError . errorMessage $ IntOutOfRange i "JavaScript" minInt maxInt
451− else return js
452− go other = return other
src/Language/PureScript/CodeGen/JS/AST.hsdeleted−404
@@ -1,404 +0,0 @@
1−-- |
2−-- Data types for the intermediate simplified-Javascript AST
3−--
4−module Language.PureScript.CodeGen.JS.AST where
5−
6−import Prelude ()
7−import Prelude.Compat
8−
9−import Control.Monad.Identity
10−
11−import Language.PureScript.Comments
12−import Language.PureScript.Traversals
13−import Language.PureScript.AST (SourceSpan(..))
14−
15−-- |
16−-- Built-in unary operators
17−--
18−data UnaryOperator
19− -- |
20− -- Numeric negation
21− --
22− = Negate
23− -- |
24− -- Boolean negation
25− --
26− | Not
27− -- |
28− -- Bitwise negation
29− --
30− | BitwiseNot
31− -- |
32− -- Numeric unary \'plus\'
33− --
34− | Positive
35− -- |
36− -- Constructor
37− --
38− | JSNew
39− deriving (Show, Read, Eq)
40−
41−-- |
42−-- Built-in binary operators
43−--
44−data BinaryOperator
45− -- |
46− -- Numeric addition
47− --
48− = Add
49− -- |
50− -- Numeric subtraction
51− --
52− | Subtract
53− -- |
54− -- Numeric multiplication
55− --
56− | Multiply
57− -- |
58− -- Numeric division
59− --
60− | Divide
61− -- |
62− -- Remainder
63− --
64− | Modulus
65− -- |
66− -- Generic equality test
67− --
68− | EqualTo
69− -- |
70− -- Generic inequality test
71− --
72− | NotEqualTo
73− -- |
74− -- Numeric less-than
75− --
76− | LessThan
77− -- |
78− -- Numeric less-than-or-equal
79− --
80− | LessThanOrEqualTo
81− -- |
82− -- Numeric greater-than
83− --
84− | GreaterThan
85− -- |
86− -- Numeric greater-than-or-equal
87− --
88− | GreaterThanOrEqualTo
89− -- |
90− -- Boolean and
91− --
92− | And
93− -- |
94− -- Boolean or
95− --
96− | Or
97− -- |
98− -- Bitwise and
99− --
100− | BitwiseAnd
101− -- |
102− -- Bitwise or
103− --
104− | BitwiseOr
105− -- |
106− -- Bitwise xor
107− --
108− | BitwiseXor
109− -- |
110− -- Bitwise left shift
111− --
112− | ShiftLeft
113− -- |
114− -- Bitwise right shift
115− --
116− | ShiftRight
117− -- |
118− -- Bitwise right shift with zero-fill
119− --
120− | ZeroFillShiftRight
121− deriving (Show, Read, Eq)
122−
123−-- |
124−-- Data type for simplified Javascript expressions
125−--
126−data JS
127− -- |
128− -- A numeric literal
129− --
130− = JSNumericLiteral (Maybe SourceSpan) (Either Integer Double)
131− -- |
132− -- A string literal
133− --
134− | JSStringLiteral (Maybe SourceSpan) String
135− -- |
136− -- A boolean literal
137− --
138− | JSBooleanLiteral (Maybe SourceSpan) Bool
139− -- |
140− -- A unary operator application
141− --
142− | JSUnary (Maybe SourceSpan) UnaryOperator JS
143− -- |
144− -- A binary operator application
145− --
146− | JSBinary (Maybe SourceSpan) BinaryOperator JS JS
147− -- |
148− -- An array literal
149− --
150− | JSArrayLiteral (Maybe SourceSpan) [JS]
151− -- |
152− -- An array indexer expression
153− --
154− | JSIndexer (Maybe SourceSpan) JS JS
155− -- |
156− -- An object literal
157− --
158− | JSObjectLiteral (Maybe SourceSpan) [(String, JS)]
159− -- |
160− -- An object property accessor expression
161− --
162− | JSAccessor (Maybe SourceSpan) String JS
163− -- |
164− -- A function introduction (optional name, arguments, body)
165− --
166− | JSFunction (Maybe SourceSpan) (Maybe String) [String] JS
167− -- |
168− -- Function application
169− --
170− | JSApp (Maybe SourceSpan) JS [JS]
171− -- |
172− -- Variable
173− --
174− | JSVar (Maybe SourceSpan) String
175− -- |
176− -- Conditional expression
177− --
178− | JSConditional (Maybe SourceSpan) JS JS JS
179− -- |
180− -- A block of expressions in braces
181− --
182− | JSBlock (Maybe SourceSpan) [JS]
183− -- |
184− -- A variable introduction and optional initialization
185− --
186− | JSVariableIntroduction (Maybe SourceSpan) String (Maybe JS)
187− -- |
188− -- A variable assignment
189− --
190− | JSAssignment (Maybe SourceSpan) JS JS
191− -- |
192− -- While loop
193− --
194− | JSWhile (Maybe SourceSpan) JS JS
195− -- |
196− -- For loop
197− --
198− | JSFor (Maybe SourceSpan) String JS JS JS
199− -- |
200− -- ForIn loop
201− --
202− | JSForIn (Maybe SourceSpan) String JS JS
203− -- |
204− -- If-then-else statement
205− --
206− | JSIfElse (Maybe SourceSpan) JS JS (Maybe JS)
207− -- |
208− -- Return statement
209− --
210− | JSReturn (Maybe SourceSpan) JS
211− -- |
212− -- Throw statement
213− --
214− | JSThrow (Maybe SourceSpan) JS
215− -- |
216− -- Type-Of operator
217− --
218− | JSTypeOf (Maybe SourceSpan) JS
219− -- |
220− -- InstanceOf test
221− --
222− | JSInstanceOf (Maybe SourceSpan) JS JS
223− -- |
224− -- Labelled statement
225− --
226− | JSLabel (Maybe SourceSpan) String JS
227− -- |
228− -- Break statement
229− --
230− | JSBreak (Maybe SourceSpan) String
231− -- |
232− -- Continue statement
233− --
234− | JSContinue (Maybe SourceSpan) String
235− -- |
236− -- Raw Javascript (generated when parsing fails for an inline foreign import declaration)
237− --
238− | JSRaw (Maybe SourceSpan) String
239− -- |
240− -- Commented Javascript
241− --
242− | JSComment (Maybe SourceSpan) [Comment] JS deriving (Show, Read, Eq)
243−
244−withSourceSpan :: SourceSpan -> JS -> JS
245−withSourceSpan withSpan = go
246− where
247− ss :: Maybe SourceSpan
248− ss = Just withSpan
249−
250− go :: JS -> JS
251− go (JSNumericLiteral _ n) = JSNumericLiteral ss n
252− go (JSStringLiteral _ s) = JSStringLiteral ss s
253− go (JSBooleanLiteral _ b) = JSBooleanLiteral ss b
254− go (JSUnary _ op j) = JSUnary ss op j
255− go (JSBinary _ op j1 j2) = JSBinary ss op j1 j2
256− go (JSArrayLiteral _ js) = JSArrayLiteral ss js
257− go (JSIndexer _ j1 j2) = JSIndexer ss j1 j2
258− go (JSObjectLiteral _ js) = JSObjectLiteral ss js
259− go (JSAccessor _ prop j) = JSAccessor ss prop j
260− go (JSFunction _ name args j) = JSFunction ss name args j
261− go (JSApp _ j js) = JSApp ss j js
262− go (JSVar _ s) = JSVar ss s
263− go (JSConditional _ j1 j2 j3) = JSConditional ss j1 j2 j3
264− go (JSBlock _ js) = JSBlock ss js
265− go (JSVariableIntroduction _ name j) = JSVariableIntroduction ss name j
266− go (JSAssignment _ j1 j2) = JSAssignment ss j1 j2
267− go (JSWhile _ j1 j2) = JSWhile ss j1 j2
268− go (JSFor _ name j1 j2 j3) = JSFor ss name j1 j2 j3
269− go (JSForIn _ name j1 j2) = JSForIn ss name j1 j2
270− go (JSIfElse _ j1 j2 j3) = JSIfElse ss j1 j2 j3
271− go (JSReturn _ js) = JSReturn ss js
272− go (JSThrow _ js) = JSThrow ss js
273− go (JSTypeOf _ js) = JSTypeOf ss js
274− go (JSInstanceOf _ j1 j2) = JSInstanceOf ss j1 j2
275− go (JSLabel _ name js) = JSLabel ss name js
276− go (JSBreak _ s) = JSBreak ss s
277− go (JSContinue _ s) = JSContinue ss s
278− go (JSRaw _ s) = JSRaw ss s
279− go (JSComment _ com j) = JSComment ss com j
280−
281−getSourceSpan :: JS -> Maybe SourceSpan
282−getSourceSpan = go
283− where
284− go :: JS -> Maybe SourceSpan
285− go (JSNumericLiteral ss _) = ss
286− go (JSStringLiteral ss _) = ss
287− go (JSBooleanLiteral ss _) = ss
288− go (JSUnary ss _ _) = ss
289− go (JSBinary ss _ _ _) = ss
290− go (JSArrayLiteral ss _) = ss
291− go (JSIndexer ss _ _) = ss
292− go (JSObjectLiteral ss _) = ss
293− go (JSAccessor ss _ _) = ss
294− go (JSFunction ss _ _ _) = ss
295− go (JSApp ss _ _) = ss
296− go (JSVar ss _) = ss
297− go (JSConditional ss _ _ _) = ss
298− go (JSBlock ss _) = ss
299− go (JSVariableIntroduction ss _ _) = ss
300− go (JSAssignment ss _ _) = ss
301− go (JSWhile ss _ _) = ss
302− go (JSFor ss _ _ _ _) = ss
303− go (JSForIn ss _ _ _) = ss
304− go (JSIfElse ss _ _ _) = ss
305− go (JSReturn ss _) = ss
306− go (JSThrow ss _) = ss
307− go (JSTypeOf ss _) = ss
308− go (JSInstanceOf ss _ _) = ss
309− go (JSLabel ss _ _) = ss
310− go (JSBreak ss _) = ss
311− go (JSContinue ss _) = ss
312− go (JSRaw ss _) = ss
313− go (JSComment ss _ _) = ss
314−
315−--
316−-- Traversals
317−--
318−
319−everywhereOnJS :: (JS -> JS) -> JS -> JS
320−everywhereOnJS f = go
321− where
322− go :: JS -> JS
323− go (JSUnary ss op j) = f (JSUnary ss op (go j))
324− go (JSBinary ss op j1 j2) = f (JSBinary ss op (go j1) (go j2))
325− go (JSArrayLiteral ss js) = f (JSArrayLiteral ss (map go js))
326− go (JSIndexer ss j1 j2) = f (JSIndexer ss (go j1) (go j2))
327− go (JSObjectLiteral ss js) = f (JSObjectLiteral ss (map (fmap go) js))
328− go (JSAccessor ss prop j) = f (JSAccessor ss prop (go j))
329− go (JSFunction ss name args j) = f (JSFunction ss name args (go j))
330− go (JSApp ss j js) = f (JSApp ss (go j) (map go js))
331− go (JSConditional ss j1 j2 j3) = f (JSConditional ss (go j1) (go j2) (go j3))
332− go (JSBlock ss js) = f (JSBlock ss (map go js))
333− go (JSVariableIntroduction ss name j) = f (JSVariableIntroduction ss name (fmap go j))
334− go (JSAssignment ss j1 j2) = f (JSAssignment ss (go j1) (go j2))
335− go (JSWhile ss j1 j2) = f (JSWhile ss (go j1) (go j2))
336− go (JSFor ss name j1 j2 j3) = f (JSFor ss name (go j1) (go j2) (go j3))
337− go (JSForIn ss name j1 j2) = f (JSForIn ss name (go j1) (go j2))
338− go (JSIfElse ss j1 j2 j3) = f (JSIfElse ss (go j1) (go j2) (fmap go j3))
339− go (JSReturn ss js) = f (JSReturn ss (go js))
340− go (JSThrow ss js) = f (JSThrow ss (go js))
341− go (JSTypeOf ss js) = f (JSTypeOf ss (go js))
342− go (JSLabel ss name js) = f (JSLabel ss name (go js))
343− go (JSInstanceOf ss j1 j2) = f (JSInstanceOf ss (go j1) (go j2))
344− go (JSComment ss com j) = f (JSComment ss com (go j))
345− go other = f other
346−
347−everywhereOnJSTopDown :: (JS -> JS) -> JS -> JS
348−everywhereOnJSTopDown f = runIdentity . everywhereOnJSTopDownM (Identity . f)
349−
350−everywhereOnJSTopDownM :: (Applicative m, Monad m) => (JS -> m JS) -> JS -> m JS
351−everywhereOnJSTopDownM f = f >=> go
352− where
353− f' = f >=> go
354− go (JSUnary ss op j) = JSUnary ss op <$> f' j
355− go (JSBinary ss op j1 j2) = JSBinary ss op <$> f' j1 <*> f' j2
356− go (JSArrayLiteral ss js) = JSArrayLiteral ss <$> traverse f' js
357− go (JSIndexer ss j1 j2) = JSIndexer ss <$> f' j1 <*> f' j2
358− go (JSObjectLiteral ss js) = JSObjectLiteral ss <$> traverse (sndM f') js
359− go (JSAccessor ss prop j) = JSAccessor ss prop <$> f' j
360− go (JSFunction ss name args j) = JSFunction ss name args <$> f' j
361− go (JSApp ss j js) = JSApp ss <$> f' j <*> traverse f' js
362− go (JSConditional ss j1 j2 j3) = JSConditional ss <$> f' j1 <*> f' j2 <*> f' j3
363− go (JSBlock ss js) = JSBlock ss <$> traverse f' js
364− go (JSVariableIntroduction ss name j) = JSVariableIntroduction ss name <$> traverse f' j
365− go (JSAssignment ss j1 j2) = JSAssignment ss <$> f' j1 <*> f' j2
366− go (JSWhile ss j1 j2) = JSWhile ss <$> f' j1 <*> f' j2
367− go (JSFor ss name j1 j2 j3) = JSFor ss name <$> f' j1 <*> f' j2 <*> f' j3
368− go (JSForIn ss name j1 j2) = JSForIn ss name <$> f' j1 <*> f' j2
369− go (JSIfElse ss j1 j2 j3) = JSIfElse ss <$> f' j1 <*> f' j2 <*> traverse f' j3
370− go (JSReturn ss j) = JSReturn ss <$> f' j
371− go (JSThrow ss j) = JSThrow ss <$> f' j
372− go (JSTypeOf ss j) = JSTypeOf ss <$> f' j
373− go (JSLabel ss name j) = JSLabel ss name <$> f' j
374− go (JSInstanceOf ss j1 j2) = JSInstanceOf ss <$> f' j1 <*> f' j2
375− go (JSComment ss com j) = JSComment ss com <$> f' j
376− go other = f other
377−
378−everythingOnJS :: (r -> r -> r) -> (JS -> r) -> JS -> r
379−everythingOnJS (<>) f = go
380− where
381− go j@(JSUnary _ _ j1) = f j <> go j1
382− go j@(JSBinary _ _ j1 j2) = f j <> go j1 <> go j2
383− go j@(JSArrayLiteral _ js) = foldl (<>) (f j) (map go js)
384− go j@(JSIndexer _ j1 j2) = f j <> go j1 <> go j2
385− go j@(JSObjectLiteral _ js) = foldl (<>) (f j) (map (go . snd) js)
386− go j@(JSAccessor _ _ j1) = f j <> go j1
387− go j@(JSFunction _ _ _ j1) = f j <> go j1
388− go j@(JSApp _ j1 js) = foldl (<>) (f j <> go j1) (map go js)
389− go j@(JSConditional _ j1 j2 j3) = f j <> go j1 <> go j2 <> go j3
390− go j@(JSBlock _ js) = foldl (<>) (f j) (map go js)
391− go j@(JSVariableIntroduction _ _ (Just j1)) = f j <> go j1
392− go j@(JSAssignment _ j1 j2) = f j <> go j1 <> go j2
393− go j@(JSWhile _ j1 j2) = f j <> go j1 <> go j2
394− go j@(JSFor _ _ j1 j2 j3) = f j <> go j1 <> go j2 <> go j3
395− go j@(JSForIn _ _ j1 j2) = f j <> go j1 <> go j2
396− go j@(JSIfElse _ j1 j2 Nothing) = f j <> go j1 <> go j2
397− go j@(JSIfElse _ j1 j2 (Just j3)) = f j <> go j1 <> go j2 <> go j3
398− go j@(JSReturn _ j1) = f j <> go j1
399− go j@(JSThrow _ j1) = f j <> go j1
400− go j@(JSTypeOf _ j1) = f j <> go j1
401− go j@(JSLabel _ _ j1) = f j <> go j1
402− go j@(JSInstanceOf _ j1 j2) = f j <> go j1 <> go j2
403− go j@(JSComment _ _ j1) = f j <> go j1
404− go other = f other
src/Language/PureScript/CodeGen/JS/Common.hsdeleted−231
@@ -1,231 +0,0 @@
1−-- |
2−-- Common code generation utility functions
3−--
4−module Language.PureScript.CodeGen.JS.Common where
5−
6−import Data.Char
7−import Data.List (intercalate)
8−
9−import Language.PureScript.Crash
10−import Language.PureScript.Names
11−
12−moduleNameToJs :: ModuleName -> String
13−moduleNameToJs (ModuleName pns) =
14− let name = intercalate "_" (runProperName `map` pns)
15− in if nameIsJsBuiltIn name then "$$" ++ name else name
16−
17−-- |
18−-- Convert an Ident into a valid Javascript identifier:
19−--
20−-- * Alphanumeric characters are kept unmodified.
21−--
22−-- * Reserved javascript identifiers are prefixed with '$$'.
23−--
24−-- * Symbols are prefixed with '$' followed by a symbol name or their ordinal value.
25−--
26−identToJs :: Ident -> String
27−identToJs (Ident name)
28− | nameIsJsReserved name || nameIsJsBuiltIn name = "$$" ++ name
29− | otherwise = concatMap identCharToString name
30−identToJs (Op op) = concatMap identCharToString op
31−identToJs (GenIdent _ _) = internalError "GenIdent in identToJs"
32−
33−-- |
34−-- Test if a string is a valid JS identifier without escaping.
35−--
36−identNeedsEscaping :: String -> Bool
37−identNeedsEscaping s = s /= identToJs (Ident s)
38−
39−-- |
40−-- Attempts to find a human-readable name for a symbol, if none has been specified returns the
41−-- ordinal value.
42−--
43−identCharToString :: Char -> String
44−identCharToString c | isAlphaNum c = [c]
45−identCharToString '_' = "_"
46−identCharToString '.' = "$dot"
47−identCharToString '$' = "$dollar"
48−identCharToString '~' = "$tilde"
49−identCharToString '=' = "$eq"
50−identCharToString '<' = "$less"
51−identCharToString '>' = "$greater"
52−identCharToString '!' = "$bang"
53−identCharToString '#' = "$hash"
54−identCharToString '%' = "$percent"
55−identCharToString '^' = "$up"
56−identCharToString '&' = "$amp"
57−identCharToString '|' = "$bar"
58−identCharToString '*' = "$times"
59−identCharToString '/' = "$div"
60−identCharToString '+' = "$plus"
61−identCharToString '-' = "$minus"
62−identCharToString ':' = "$colon"
63−identCharToString '\\' = "$bslash"
64−identCharToString '?' = "$qmark"
65−identCharToString '@' = "$at"
66−identCharToString '\'' = "$prime"
67−identCharToString c = '$' : show (ord c)
68−
69−-- |
70−-- Checks whether an identifier name is reserved in Javascript.
71−--
72−nameIsJsReserved :: String -> Bool
73−nameIsJsReserved name =
74− name `elem` jsAnyReserved
75−
76−-- |
77−-- Checks whether a name matches a built-in value in Javascript.
78−--
79−nameIsJsBuiltIn :: String -> Bool
80−nameIsJsBuiltIn name =
81− elem name
82− [ "arguments"
83− , "Array"
84− , "ArrayBuffer"
85− , "Boolean"
86− , "DataView"
87− , "Date"
88− , "decodeURI"
89− , "decodeURIComponent"
90− , "encodeURI"
91− , "encodeURIComponent"
92− , "Error"
93− , "escape"
94− , "eval"
95− , "EvalError"
96− , "Float32Array"
97− , "Float64Array"
98− , "Function"
99− , "Infinity"
100− , "Int16Array"
101− , "Int32Array"
102− , "Int8Array"
103− , "Intl"
104− , "isFinite"
105− , "isNaN"
106− , "JSON"
107− , "Map"
108− , "Math"
109− , "NaN"
110− , "Number"
111− , "Object"
112− , "parseFloat"
113− , "parseInt"
114− , "Promise"
115− , "Proxy"
116− , "RangeError"
117− , "ReferenceError"
118− , "Reflect"
119− , "RegExp"
120− , "Set"
121− , "SIMD"
122− , "String"
123− , "Symbol"
124− , "SyntaxError"
125− , "TypeError"
126− , "Uint16Array"
127− , "Uint32Array"
128− , "Uint8Array"
129− , "Uint8ClampedArray"
130− , "undefined"
131− , "unescape"
132− , "URIError"
133− , "WeakMap"
134− , "WeakSet"
135− ]
136−
137−jsAnyReserved :: [String]
138−jsAnyReserved =
139− concat
140− [ jsKeywords
141− , jsSometimesReserved
142− , jsFutureReserved
143− , jsFutureReservedStrict
144− , jsOldReserved
145− , jsLiterals
146− ]
147−
148−jsKeywords :: [String]
149−jsKeywords =
150− [ "break"
151− , "case"
152− , "catch"
153− , "class"
154− , "const"
155− , "continue"
156− , "debugger"
157− , "default"
158− , "delete"
159− , "do"
160− , "else"
161− , "export"
162− , "extends"
163− , "finally"
164− , "for"
165− , "function"
166− , "if"
167− , "import"
168− , "in"
169− , "instanceof"
170− , "new"
171− , "return"
172− , "super"
173− , "switch"
174− , "this"
175− , "throw"
176− , "try"
177− , "typeof"
178− , "var"
179− , "void"
180− , "while"
181− , "with"
182− ]
183−
184−jsSometimesReserved :: [String]
185−jsSometimesReserved =
186− [ "await"
187− , "let"
188− , "static"
189− , "yield"
190− ]
191−
192−jsFutureReserved :: [String]
193−jsFutureReserved =
194− [ "enum" ]
195−
196−jsFutureReservedStrict :: [String]
197−jsFutureReservedStrict =
198− [ "implements"
199− , "interface"
200− , "package"
201− , "private"
202− , "protected"
203− , "public"
204− ]
205−
206−jsOldReserved :: [String]
207−jsOldReserved =
208− [ "abstract"
209− , "boolean"
210− , "byte"
211− , "char"
212− , "double"
213− , "final"
214− , "float"
215− , "goto"
216− , "int"
217− , "long"
218− , "native"
219− , "short"
220− , "synchronized"
221− , "throws"
222− , "transient"
223− , "volatile"
224− ]
225−
226−jsLiterals :: [String]
227−jsLiterals =
228− [ "null"
229− , "true"
230− , "false"
231− ]
src/Language/PureScript/CodeGen/JS/Optimizer.hsdeleted−83
@@ -1,83 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−
3−-- |
4−-- This module optimizes code in the simplified-Javascript intermediate representation.
5−--
6−-- The following optimizations are supported:
7−--
8−-- * Collapsing nested blocks
9−--
10−-- * Tail call elimination
11−--
12−-- * Inlining of (>>=) and ret for the Eff monad
13−--
14−-- * Removal of unnecessary thunks
15−--
16−-- * Eta conversion
17−--
18−-- * Inlining variables
19−--
20−-- * Inline Prelude.($), Prelude.(#), Prelude.(++), Prelude.(!!)
21−--
22−-- * Inlining primitive Javascript operators
23−--
24−module Language.PureScript.CodeGen.JS.Optimizer (optimize) where
25−
26−import Prelude ()
27−import Prelude.Compat
28−
29−import Control.Monad.Reader (MonadReader, ask, asks)
30−import Control.Monad.Supply.Class (MonadSupply)
31−
32−import Language.PureScript.CodeGen.JS.AST
33−import Language.PureScript.Options
34−import qualified Language.PureScript.Constants as C
35−
36−import Language.PureScript.CodeGen.JS.Optimizer.Common
37−import Language.PureScript.CodeGen.JS.Optimizer.TCO
38−import Language.PureScript.CodeGen.JS.Optimizer.MagicDo
39−import Language.PureScript.CodeGen.JS.Optimizer.Inliner
40−import Language.PureScript.CodeGen.JS.Optimizer.Unused
41−import Language.PureScript.CodeGen.JS.Optimizer.Blocks
42−
43−-- |
44−-- Apply a series of optimizer passes to simplified Javascript code
45−--
46−optimize :: (Monad m, MonadReader Options m, Applicative m, MonadSupply m) => JS -> m JS
47−optimize js = do
48− noOpt <- asks optionsNoOptimizations
49− if noOpt then return js else optimize' js
50−
51−optimize' :: (Monad m, MonadReader Options m, Applicative m, MonadSupply m) => JS -> m JS
52−optimize' js = do
53− opts <- ask
54− js' <- untilFixedPoint (inlineFnComposition . tidyUp . applyAll
55− [ inlineCommonValues
56− , inlineOperator (C.prelude, (C.$)) $ \f x -> JSApp Nothing f [x]
57− , inlineOperator (C.dataFunction, C.apply) $ \f x -> JSApp Nothing f [x]
58− , inlineOperator (C.prelude, (C.#)) $ \x f -> JSApp Nothing f [x]
59− , inlineOperator (C.dataFunction, C.applyFlipped) $ \x f -> JSApp Nothing f [x]
60− , inlineOperator (C.dataArrayUnsafe, C.unsafeIndex) $ flip (JSIndexer Nothing)
61− , inlineCommonOperators
62− ]) js
63− untilFixedPoint (return . tidyUp) . tco opts . magicDo opts $ js'
64− where
65− tidyUp :: JS -> JS
66− tidyUp = applyAll
67− [ collapseNestedBlocks
68− , collapseNestedIfs
69− , removeCodeAfterReturnStatements
70− , removeUnusedArg
71− , removeUndefinedApp
72− , unThunk
73− , etaConvert
74− , evaluateIifes
75− , inlineVariables
76− ]
77−
78−untilFixedPoint :: (Monad m, Eq a) => (a -> m a) -> a -> m a
79−untilFixedPoint f = go
80− where
81− go a = do
82− a' <- f a
83− if a' == a then return a' else go a'
src/Language/PureScript/CodeGen/JS/Optimizer/Blocks.hsdeleted−42
@@ -1,42 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer.Blocks
4−-- Copyright : (c) Phil Freeman 2013-14
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Optimizer steps for simplifying Javascript blocks
13−--
14−-----------------------------------------------------------------------------
15−
16−module Language.PureScript.CodeGen.JS.Optimizer.Blocks
17− ( collapseNestedBlocks
18− , collapseNestedIfs
19− ) where
20−
21−import Language.PureScript.CodeGen.JS.AST
22−
23−-- |
24−-- Collapse blocks which appear nested directly below another block
25−--
26−collapseNestedBlocks :: JS -> JS
27−collapseNestedBlocks = everywhereOnJS collapse
28− where
29− collapse :: JS -> JS
30− collapse (JSBlock ss sts) = JSBlock ss (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 s1 cond1 (JSBlock _ [JSIfElse s2 cond2 body Nothing]) Nothing) =
41− JSIfElse s1 (JSBinary s2 And cond1 cond2) body Nothing
42− collapse js = js
src/Language/PureScript/CodeGen/JS/Optimizer/Common.hsdeleted−81
@@ -1,81 +0,0 @@
1−-- |
2−-- Common functions used by the various optimizer phases
3−--
4−module Language.PureScript.CodeGen.JS.Optimizer.Common where
5−
6−import Data.Maybe (fromMaybe)
7−
8−import Language.PureScript.Crash
9−import Language.PureScript.CodeGen.JS.AST
10−
11−applyAll :: [a -> a] -> a -> a
12−applyAll = foldl1 (.)
13−
14−replaceIdent :: String -> JS -> JS -> JS
15−replaceIdent var1 js = everywhereOnJS replace
16− where
17− replace (JSVar _ var2) | var1 == var2 = js
18− replace other = other
19−
20−replaceIdents :: [(String, JS)] -> JS -> JS
21−replaceIdents vars = everywhereOnJS replace
22− where
23− replace v@(JSVar _ var) = fromMaybe v $ lookup var vars
24− replace other = other
25−
26−isReassigned :: String -> JS -> Bool
27−isReassigned var1 = everythingOnJS (||) check
28− where
29− check :: JS -> Bool
30− check (JSFunction _ _ args _) | var1 `elem` args = True
31− check (JSVariableIntroduction _ arg _) | var1 == arg = True
32− check (JSAssignment _ (JSVar _ arg) _) | var1 == arg = True
33− check (JSFor _ arg _ _ _) | var1 == arg = True
34− check (JSForIn _ arg _ _) | var1 == arg = True
35− check _ = False
36−
37−isRebound :: JS -> JS -> Bool
38−isRebound js d = any (\v -> isReassigned v d || isUpdated v d) (everythingOnJS (++) variablesOf js)
39− where
40− variablesOf (JSVar _ var) = [var]
41− variablesOf _ = []
42−
43−isUsed :: String -> JS -> Bool
44−isUsed var1 = everythingOnJS (||) check
45− where
46− check :: JS -> Bool
47− check (JSVar _ var2) | var1 == var2 = True
48− check (JSAssignment _ target _) | var1 == targetVariable target = True
49− check _ = False
50−
51−targetVariable :: JS -> String
52−targetVariable (JSVar _ var) = var
53−targetVariable (JSAccessor _ _ tgt) = targetVariable tgt
54−targetVariable (JSIndexer _ _ tgt) = targetVariable tgt
55−targetVariable _ = internalError "Invalid argument to targetVariable"
56−
57−isUpdated :: String -> JS -> Bool
58−isUpdated var1 = everythingOnJS (||) check
59− where
60− check :: JS -> Bool
61− check (JSAssignment _ target _) | var1 == targetVariable target = True
62− check _ = False
63−
64−removeFromBlock :: ([JS] -> [JS]) -> JS -> JS
65−removeFromBlock go (JSBlock ss sts) = JSBlock ss (go sts)
66−removeFromBlock _ js = js
67−
68−isFn :: (String, String) -> JS -> Bool
69−isFn (moduleName, fnName) (JSAccessor _ x (JSVar _ y)) = x == fnName && y == moduleName
70−isFn (moduleName, fnName) (JSIndexer _ (JSStringLiteral _ x) (JSVar _ y)) = x == fnName && y == moduleName
71−isFn _ _ = False
72−
73−isFn' :: [(String, String)] -> JS -> Bool
74−isFn' xs js = any (`isFn` js) xs
75−
76−isDict :: (String, String) -> JS -> Bool
77−isDict (moduleName, dictName) (JSAccessor _ x (JSVar _ y)) = x == dictName && y == moduleName
78−isDict _ _ = False
79−
80−isDict' :: [(String, String)] -> JS -> Bool
81−isDict' xs js = any (`isDict` js) xs
src/Language/PureScript/CodeGen/JS/Optimizer/Inliner.hsdeleted−368
@@ -1,368 +0,0 @@
1−-- |
2−-- This module provides basic inlining capabilities
3−--
4−module Language.PureScript.CodeGen.JS.Optimizer.Inliner
5− ( inlineVariables
6− , inlineCommonValues
7− , inlineOperator
8− , inlineCommonOperators
9− , inlineFnComposition
10− , etaConvert
11− , unThunk
12− , evaluateIifes
13− ) where
14−
15−import Prelude ()
16−import Prelude.Compat
17−
18−import Control.Monad.Supply.Class (MonadSupply, freshName)
19−import Data.Maybe (fromMaybe)
20−
21−import Language.PureScript.CodeGen.JS.AST
22−import Language.PureScript.CodeGen.JS.Common
23−import Language.PureScript.Names
24−import Language.PureScript.CodeGen.JS.Optimizer.Common
25−import qualified Language.PureScript.Constants as C
26−
27−-- TODO: Potential bug:
28−-- Shouldn't just inline this case: { var x = 0; x.toFixed(10); }
29−-- Needs to be: { 0..toFixed(10); }
30−-- Probably needs to be fixed in pretty-printer instead.
31−shouldInline :: JS -> Bool
32−shouldInline (JSVar _ _) = True
33−shouldInline (JSNumericLiteral _ _) = True
34−shouldInline (JSStringLiteral _ _) = True
35−shouldInline (JSBooleanLiteral _ _) = True
36−shouldInline (JSAccessor _ _ val) = shouldInline val
37−shouldInline (JSIndexer _ index val) = shouldInline index && shouldInline val
38−shouldInline _ = False
39−
40−etaConvert :: JS -> JS
41−etaConvert = everywhereOnJS convert
42− where
43− convert :: JS -> JS
44− convert (JSBlock ss [JSReturn _ (JSApp _ (JSFunction _ Nothing idents block@(JSBlock _ body)) args)])
45− | all shouldInline args &&
46− not (any (`isRebound` block) (map (JSVar Nothing) idents)) &&
47− not (any (`isRebound` block) args)
48− = JSBlock ss (map (replaceIdents (zip idents args)) body)
49− convert (JSFunction _ Nothing [] (JSBlock _ [JSReturn _ (JSApp _ fn [])])) = fn
50− convert js = js
51−
52−unThunk :: JS -> JS
53−unThunk = everywhereOnJS convert
54− where
55− convert :: JS -> JS
56− convert (JSBlock ss []) = JSBlock ss []
57− convert (JSBlock ss jss) =
58− case last jss of
59− JSReturn _ (JSApp _ (JSFunction _ Nothing [] (JSBlock _ body)) []) -> JSBlock ss $ init jss ++ body
60− _ -> JSBlock ss jss
61− convert js = js
62−
63−evaluateIifes :: JS -> JS
64−evaluateIifes = everywhereOnJS convert
65− where
66− convert :: JS -> JS
67− convert (JSApp _ (JSFunction _ Nothing [] (JSBlock _ [JSReturn _ ret])) []) = ret
68− convert js = js
69−
70−inlineVariables :: JS -> JS
71−inlineVariables = everywhereOnJS $ removeFromBlock go
72− where
73− go :: [JS] -> [JS]
74− go [] = []
75− go (JSVariableIntroduction _ var (Just js) : sts)
76− | shouldInline js && not (any (isReassigned var) sts) && not (any (isRebound js) sts) && not (any (isUpdated var) sts) =
77− go (map (replaceIdent var js) sts)
78− go (s:sts) = s : go sts
79−
80−inlineCommonValues :: JS -> JS
81−inlineCommonValues = everywhereOnJS convert
82− where
83− convert :: JS -> JS
84− convert (JSApp ss fn [dict])
85− | isDict' (semiringNumber ++ semiringInt) dict && isFn' fnZero fn = JSNumericLiteral ss (Left 0)
86− | isDict' (semiringNumber ++ semiringInt) dict && isFn' fnOne fn = JSNumericLiteral ss (Left 1)
87− | isDict' boundedBoolean dict && isFn' fnBottom fn = JSBooleanLiteral ss False
88− | isDict' boundedBoolean dict && isFn' fnTop fn = JSBooleanLiteral ss True
89− convert (JSApp ss (JSApp _ (JSApp _ fn [dict]) [x]) [y])
90− | isDict' semiringInt dict && isFn' fnAdd fn = intOp ss Add x y
91− | isDict' semiringInt dict && isFn' fnMultiply fn = intOp ss Multiply x y
92− | isDict' moduloSemiringInt dict && isFn' fnDivide fn = intOp ss Divide x y
93− | isDict' ringInt dict && isFn' fnSubtract fn = intOp ss Subtract x y
94− convert other = other
95− fnZero = [(C.prelude, C.zero), (C.dataSemiring, C.zero)]
96− fnOne = [(C.prelude, C.one), (C.dataSemiring, C.one)]
97− fnBottom = [(C.prelude, C.bottom), (C.dataBounded, C.bottom)]
98− fnTop = [(C.prelude, C.top), (C.dataBounded, C.top)]
99− fnAdd = [(C.prelude, (C.+)), (C.prelude, (C.add)), (C.dataSemiring, (C.+)), (C.dataSemiring, (C.add))]
100− fnDivide = [(C.prelude, (C./)), (C.prelude, (C.div)), (C.dataModuloSemiring, C.div)]
101− fnMultiply = [(C.prelude, (C.*)), (C.prelude, (C.mul)), (C.dataSemiring, (C.*)), (C.dataSemiring, (C.mul))]
102− fnSubtract = [(C.prelude, (C.-)), (C.prelude, C.sub), (C.dataRing, C.sub)]
103− intOp ss op x y = JSBinary ss BitwiseOr (JSBinary ss op x y) (JSNumericLiteral ss (Left 0))
104−
105−inlineOperator :: (String, String) -> (JS -> JS -> JS) -> JS -> JS
106−inlineOperator (m, op) f = everywhereOnJS convert
107− where
108− convert :: JS -> JS
109− convert (JSApp _ (JSApp _ op' [x]) [y]) | isOp op' = f x y
110− convert other = other
111− isOp (JSAccessor _ longForm (JSVar _ m')) = m == m' && longForm == identToJs (Op op)
112− isOp (JSIndexer _ (JSStringLiteral _ op') (JSVar _ m')) = m == m' && op == op'
113− isOp _ = False
114−
115−inlineCommonOperators :: JS -> JS
116−inlineCommonOperators = applyAll $
117− [ binary semiringNumber opAdd Add
118− , binary semiringNumber opMul Multiply
119−
120− , binary ringNumber opSub Subtract
121− , unary ringNumber opNegate Negate
122− , binary ringInt opSub Subtract
123− , unary ringInt opNegate Negate
124−
125− , binary moduloSemiringNumber opDiv Divide
126− , binary moduloSemiringInt opMod Modulus
127−
128− , binary eqNumber opEq EqualTo
129− , binary eqNumber opNotEq NotEqualTo
130− , binary eqInt opEq EqualTo
131− , binary eqInt opNotEq NotEqualTo
132− , binary eqString opEq EqualTo
133− , binary eqString opNotEq NotEqualTo
134− , binary eqChar opEq EqualTo
135− , binary eqChar opNotEq NotEqualTo
136− , binary eqBoolean opEq EqualTo
137− , binary eqBoolean opNotEq NotEqualTo
138−
139− , binary ordBoolean opLessThan LessThan
140− , binary ordBoolean opLessThanOrEq LessThanOrEqualTo
141− , binary ordBoolean opGreaterThan GreaterThan
142− , binary ordBoolean opGreaterThanOrEq GreaterThanOrEqualTo
143− , binary ordChar opLessThan LessThan
144− , binary ordChar opLessThanOrEq LessThanOrEqualTo
145− , binary ordChar opGreaterThan GreaterThan
146− , binary ordChar opGreaterThanOrEq GreaterThanOrEqualTo
147− , binary ordInt opLessThan LessThan
148− , binary ordInt opLessThanOrEq LessThanOrEqualTo
149− , binary ordInt opGreaterThan GreaterThan
150− , binary ordInt opGreaterThanOrEq GreaterThanOrEqualTo
151− , binary ordNumber opLessThan LessThan
152− , binary ordNumber opLessThanOrEq LessThanOrEqualTo
153− , binary ordNumber opGreaterThan GreaterThan
154− , binary ordNumber opGreaterThanOrEq GreaterThanOrEqualTo
155− , binary ordString opLessThan LessThan
156− , binary ordString opLessThanOrEq LessThanOrEqualTo
157− , binary ordString opGreaterThan GreaterThan
158− , binary ordString opGreaterThanOrEq GreaterThanOrEqualTo
159−
160− , binary semigroupString opAppend Add
161−
162− , binary booleanAlgebraBoolean opConj And
163− , binary booleanAlgebraBoolean opDisj Or
164− , unary booleanAlgebraBoolean opNot Not
165−
166− , binary' C.dataIntBits (C..|.) BitwiseOr
167− , binary' C.dataIntBits (C..&.) BitwiseAnd
168− , binary' C.dataIntBits (C..^.) BitwiseXor
169− , binary' C.dataIntBits C.shl ShiftLeft
170− , binary' C.dataIntBits C.shr ShiftRight
171− , binary' C.dataIntBits C.zshr ZeroFillShiftRight
172− , unary' C.dataIntBits C.complement BitwiseNot
173− ] ++
174− [ fn | i <- [0..10], fn <- [ mkFn i, runFn i ] ]
175− where
176− binary :: [(String, String)] -> [(String, String)] -> BinaryOperator -> JS -> JS
177− binary dict fns op = everywhereOnJS convert
178− where
179− convert :: JS -> JS
180− convert (JSApp ss (JSApp _ (JSApp _ fn [dict']) [x]) [y]) | isDict' dict dict' && isFn' fns fn = JSBinary ss op x y
181− convert other = other
182− binary' :: String -> String -> BinaryOperator -> JS -> JS
183− binary' moduleName opString op = everywhereOnJS convert
184− where
185− convert :: JS -> JS
186− convert (JSApp ss (JSApp _ fn [x]) [y]) | isFn (moduleName, opString) fn = JSBinary ss op x y
187− convert other = other
188− unary :: [(String, String)] -> [(String, String)] -> UnaryOperator -> JS -> JS
189− unary dicts fns op = everywhereOnJS convert
190− where
191− convert :: JS -> JS
192− convert (JSApp ss (JSApp _ fn [dict']) [x]) | isDict' dicts dict' && isFn' fns fn = JSUnary ss op x
193− convert other = other
194− unary' :: String -> String -> UnaryOperator -> JS -> JS
195− unary' moduleName fnName op = everywhereOnJS convert
196− where
197− convert :: JS -> JS
198− convert (JSApp ss fn [x]) | isFn (moduleName, fnName) fn = JSUnary ss op x
199− convert other = other
200− mkFn :: Int -> JS -> JS
201− mkFn 0 = everywhereOnJS convert
202− where
203− convert :: JS -> JS
204− convert (JSApp _ mkFnN [JSFunction s1 Nothing [_] (JSBlock s2 js)]) | isNFn C.mkFn 0 mkFnN =
205− JSFunction s1 Nothing [] (JSBlock s2 js)
206− convert other = other
207− mkFn n = everywhereOnJS convert
208− where
209− convert :: JS -> JS
210− convert orig@(JSApp ss mkFnN [fn]) | isNFn C.mkFn n mkFnN =
211− case collectArgs n [] fn of
212− Just (args, js) -> JSFunction ss Nothing args (JSBlock ss js)
213− Nothing -> orig
214− convert other = other
215− collectArgs :: Int -> [String] -> JS -> Maybe ([String], [JS])
216− collectArgs 1 acc (JSFunction _ Nothing [oneArg] (JSBlock _ js)) | length acc == n - 1 = Just (reverse (oneArg : acc), js)
217− collectArgs m acc (JSFunction _ Nothing [oneArg] (JSBlock _ [JSReturn _ ret])) = collectArgs (m - 1) (oneArg : acc) ret
218− collectArgs _ _ _ = Nothing
219−
220− isNFn :: String -> Int -> JS -> Bool
221− isNFn prefix n (JSVar _ name) = name == (prefix ++ show n)
222− isNFn prefix n (JSAccessor _ name (JSVar _ dataFunction)) | dataFunction == C.dataFunction = name == (prefix ++ show n)
223− isNFn _ _ _ = False
224−
225− runFn :: Int -> JS -> JS
226− runFn n = everywhereOnJS convert
227− where
228− convert :: JS -> JS
229− convert js = fromMaybe js $ go n [] js
230−
231− go :: Int -> [JS] -> JS -> Maybe JS
232− go 0 acc (JSApp ss runFnN [fn]) | isNFn C.runFn n runFnN && length acc == n = Just (JSApp ss fn acc)
233− go m acc (JSApp _ lhs [arg]) = go (m - 1) (arg : acc) lhs
234− go _ _ _ = Nothing
235−
236−-- (f <<< g $ x) = f (g x)
237−-- (f <<< g) = \x -> f (g x)
238−inlineFnComposition :: (Applicative m, MonadSupply m) => JS -> m JS
239−inlineFnComposition = everywhereOnJSTopDownM convert
240− where
241− convert :: (MonadSupply m) => JS -> m JS
242− convert (JSApp s1 (JSApp s2 (JSApp _ (JSApp _ fn [dict']) [x]) [y]) [z])
243− | isFnCompose dict' fn = return $ JSApp s1 x [JSApp s2 y [z]]
244− | isFnComposeFlipped dict' fn = return $ JSApp s2 y [JSApp s1 x [z]]
245− convert (JSApp ss (JSApp _ (JSApp _ fn [dict']) [x]) [y])
246− | isFnCompose dict' fn = do
247− arg <- freshName
248− return $ JSFunction ss Nothing [arg] (JSBlock ss [JSReturn Nothing $ JSApp Nothing x [JSApp Nothing y [JSVar Nothing arg]]])
249− | isFnComposeFlipped dict' fn = do
250− arg <- freshName
251− return $ JSFunction ss Nothing [arg] (JSBlock ss [JSReturn Nothing $ JSApp Nothing y [JSApp Nothing x [JSVar Nothing arg]]])
252− convert other = return other
253− isFnCompose :: JS -> JS -> Bool
254− isFnCompose dict' fn = isDict' semigroupoidFn dict' && isFn' fnCompose fn
255− isFnComposeFlipped :: JS -> JS -> Bool
256− isFnComposeFlipped dict' fn = isDict' semigroupoidFn dict' && isFn' fnComposeFlipped fn
257− fnCompose :: [(String, String)]
258− fnCompose = [(C.prelude, C.compose), (C.prelude, (C.<<<)), (C.controlSemigroupoid, C.compose)]
259− fnComposeFlipped :: [(String, String)]
260− fnComposeFlipped = [(C.prelude, (C.>>>)), (C.controlSemigroupoid, C.composeFlipped)]
261−
262−semiringNumber :: [(String, String)]
263−semiringNumber = [(C.prelude, C.semiringNumber), (C.dataSemiring, C.semiringNumber)]
264−
265−semiringInt :: [(String, String)]
266−semiringInt = [(C.prelude, C.semiringInt), (C.dataSemiring, C.semiringInt)]
267−
268−ringNumber :: [(String, String)]
269−ringNumber = [(C.prelude, C.ringNumber), (C.dataRing, C.ringNumber)]
270−
271−ringInt :: [(String, String)]
272−ringInt = [(C.prelude, C.ringInt), (C.dataRing, C.ringInt)]
273−
274−moduloSemiringNumber :: [(String, String)]
275−moduloSemiringNumber = [(C.prelude, C.moduloSemiringNumber), (C.dataModuloSemiring, C.moduloSemiringNumber)]
276−
277−moduloSemiringInt :: [(String, String)]
278−moduloSemiringInt = [(C.prelude, C.moduloSemiringInt), (C.dataModuloSemiring, C.moduloSemiringInt)]
279−
280−eqNumber :: [(String, String)]
281−eqNumber = [(C.prelude, C.eqNumber), (C.dataEq, C.eqNumber)]
282−
283−eqInt :: [(String, String)]
284−eqInt = [(C.prelude, C.eqInt), (C.dataEq, C.eqInt)]
285−
286−eqString :: [(String, String)]
287−eqString = [(C.prelude, C.eqString), (C.dataEq, C.eqString)]
288−
289−eqChar :: [(String, String)]
290−eqChar = [(C.prelude, C.eqChar), (C.dataEq, C.eqChar)]
291−
292−eqBoolean :: [(String, String)]
293−eqBoolean = [(C.prelude, C.eqBoolean), (C.dataEq, C.eqBoolean)]
294−
295−ordBoolean :: [(String, String)]
296−ordBoolean = [(C.prelude, C.ordBoolean), (C.dataOrd, C.ordBoolean)]
297−
298−ordNumber :: [(String, String)]
299−ordNumber = [(C.prelude, C.ordNumber), (C.dataOrd, C.ordNumber)]
300−
301−ordInt :: [(String, String)]
302−ordInt = [(C.prelude, C.ordInt), (C.dataOrd, C.ordInt)]
303−
304−ordString :: [(String, String)]
305−ordString = [(C.prelude, C.ordString), (C.dataOrd, C.ordString)]
306−
307−ordChar :: [(String, String)]
308−ordChar = [(C.prelude, C.ordChar), (C.dataOrd, C.ordChar)]
309−
310−semigroupString :: [(String, String)]
311−semigroupString = [(C.prelude, C.semigroupString), (C.dataSemigroup, C.semigroupString)]
312−
313−boundedBoolean :: [(String, String)]
314−boundedBoolean = [(C.prelude, C.boundedBoolean), (C.dataBounded, C.boundedBoolean)]
315−
316−booleanAlgebraBoolean :: [(String, String)]
317−booleanAlgebraBoolean = [(C.prelude, C.booleanAlgebraBoolean), (C.dataBooleanAlgebra, C.booleanAlgebraBoolean)]
318−
319−semigroupoidFn :: [(String, String)]
320−semigroupoidFn = [(C.prelude, C.semigroupoidFn), (C.controlSemigroupoid, C.semigroupoidFn)]
321−
322−opAdd :: [(String, String)]
323−opAdd = [(C.prelude, (C.+)), (C.prelude, C.add), (C.dataSemiring, C.add)]
324−
325−opMul :: [(String, String)]
326−opMul = [(C.prelude, (C.*)), (C.prelude, C.mul), (C.dataSemiring, C.mul)]
327−
328−opEq :: [(String, String)]
329−opEq = [(C.prelude, (C.==)), (C.prelude, C.eq), (C.dataEq, C.eq)]
330−
331−opNotEq :: [(String, String)]
332−opNotEq = [(C.prelude, (C./=)), (C.dataEq, C.notEq)]
333−
334−opLessThan :: [(String, String)]
335−opLessThan = [(C.prelude, (C.<)), (C.dataOrd, C.lessThan)]
336−
337−opLessThanOrEq :: [(String, String)]
338−opLessThanOrEq = [(C.prelude, (C.<=)), (C.dataOrd, C.lessThanOrEq)]
339−
340−opGreaterThan :: [(String, String)]
341−opGreaterThan = [(C.prelude, (C.>)), (C.dataOrd, C.greaterThan)]
342−
343−opGreaterThanOrEq :: [(String, String)]
344−opGreaterThanOrEq = [(C.prelude, (C.>=)), (C.dataOrd, C.greaterThanOrEq)]
345−
346−opAppend :: [(String, String)]
347−opAppend = [(C.prelude, (C.<>)), (C.prelude, (C.++)), (C.prelude, C.append), (C.dataSemigroup, C.append)]
348−
349−opSub :: [(String, String)]
350−opSub = [(C.prelude, (C.-)), (C.prelude, C.sub), (C.dataRing, C.sub)]
351−
352−opNegate :: [(String, String)]
353−opNegate = [(C.prelude, C.negate), (C.dataRing, C.negate)]
354−
355−opDiv :: [(String, String)]
356−opDiv = [(C.prelude, (C./)), (C.prelude, C.div), (C.dataModuloSemiring, C.div)]
357−
358−opMod :: [(String, String)]
359−opMod = [(C.prelude, C.mod), (C.dataModuloSemiring, C.mod)]
360−
361−opConj :: [(String, String)]
362−opConj = [(C.prelude, (C.&&)), (C.prelude, C.conj), (C.dataBooleanAlgebra, C.conj)]
363−
364−opDisj :: [(String, String)]
365−opDisj = [(C.prelude, (C.||)), (C.prelude, C.disj), (C.dataBooleanAlgebra, C.disj)]
366−
367−opNot :: [(String, String)]
368−opNot = [(C.prelude, C.not), (C.dataBooleanAlgebra, C.not)]
src/Language/PureScript/CodeGen/JS/Optimizer/MagicDo.hsdeleted−134
@@ -1,134 +0,0 @@
1−-- |
2−-- This module implements the "Magic Do" optimization, which inlines calls to return
3−-- and bind for the Eff monad, as well as some of its actions.
4−--
5−module Language.PureScript.CodeGen.JS.Optimizer.MagicDo (magicDo) where
6−
7−import Data.List (nub)
8−import Data.Maybe (fromJust, isJust)
9−
10−import Language.PureScript.CodeGen.JS.AST
11−import Language.PureScript.CodeGen.JS.Optimizer.Common
12−import Language.PureScript.Options
13−import qualified Language.PureScript.Constants as C
14−
15−magicDo :: Options -> JS -> JS
16−magicDo opts | optionsNoMagicDo opts = id
17− | otherwise = inlineST . magicDo'
18−
19−-- |
20−-- Inline type class dictionaries for >>= and return for the Eff monad
21−--
22−-- E.g.
23−--
24−-- Prelude[">>="](dict)(m1)(function(x) {
25−-- return ...;
26−-- })
27−--
28−-- becomes
29−--
30−-- function __do {
31−-- var x = m1();
32−-- ...
33−-- }
34−--
35−magicDo' :: JS -> JS
36−magicDo' = everywhereOnJS undo . everywhereOnJSTopDown convert
37− where
38− -- The name of the function block which is added to denote a do block
39− fnName = "__do"
40− -- Desugar monomorphic calls to >>= and return for the Eff monad
41− convert :: JS -> JS
42− -- Desugar pure & return
43− convert (JSApp _ (JSApp _ pure' [val]) []) | isPure pure' = val
44− -- Desugar >>
45− convert (JSApp _ (JSApp _ bind [m]) [JSFunction s1 Nothing [] (JSBlock s2 js)]) | isBind bind =
46− JSFunction s1 (Just fnName) [] $ JSBlock s2 (JSApp s2 m [] : map applyReturns js )
47− -- Desugar >>=
48− convert (JSApp _ (JSApp _ bind [m]) [JSFunction s1 Nothing [arg] (JSBlock s2 js)]) | isBind bind =
49− JSFunction s1 (Just fnName) [] $ JSBlock s2 (JSVariableIntroduction s2 arg (Just (JSApp s2 m [])) : map applyReturns js)
50− -- Desugar untilE
51− convert (JSApp s1 (JSApp _ f [arg]) []) | isEffFunc C.untilE f =
52− JSApp s1 (JSFunction s1 Nothing [] (JSBlock s1 [ JSWhile s1 (JSUnary s1 Not (JSApp s1 arg [])) (JSBlock s1 []), JSReturn s1 $ JSObjectLiteral s1 []])) []
53− -- Desugar whileE
54− convert (JSApp _ (JSApp _ (JSApp s1 f [arg1]) [arg2]) []) | isEffFunc C.whileE f =
55− JSApp s1 (JSFunction s1 Nothing [] (JSBlock s1 [ JSWhile s1 (JSApp s1 arg1 []) (JSBlock s1 [ JSApp s1 arg2 [] ]), JSReturn s1 $ JSObjectLiteral s1 []])) []
56− convert other = other
57− -- Check if an expression represents a monomorphic call to >>= for the Eff monad
58− isBind (JSApp _ fn [dict]) | isDict (C.eff, C.bindEffDictionary) dict && isBindPoly fn = True
59− isBind _ = False
60− -- Check if an expression represents a monomorphic call to pure or return for the Eff applicative
61− isPure (JSApp _ fn [dict]) | isDict (C.eff, C.applicativeEffDictionary) dict && isPurePoly fn = True
62− isPure _ = False
63− -- Check if an expression represents the polymorphic >>= function
64− isBindPoly = isFn' [(C.prelude, C.bind), (C.prelude, (C.>>=)), (C.controlBind, C.bind)]
65− -- Check if an expression represents the polymorphic pure or return function
66− isPurePoly = isFn' [(C.prelude, C.pure'), (C.prelude, C.return), (C.controlApplicative, C.pure')]
67− -- Check if an expression represents a function in the Eff module
68− isEffFunc name (JSAccessor _ name' (JSVar _ eff)) = eff == C.eff && name == name'
69− isEffFunc _ _ = False
70−
71− -- Remove __do function applications which remain after desugaring
72− undo :: JS -> JS
73− undo (JSReturn _ (JSApp _ (JSFunction _ (Just ident) [] body) [])) | ident == fnName = body
74− undo other = other
75−
76− applyReturns :: JS -> JS
77− applyReturns (JSReturn ss ret) = JSReturn ss (JSApp ss ret [])
78− applyReturns (JSBlock ss jss) = JSBlock ss (map applyReturns jss)
79− applyReturns (JSWhile ss cond js) = JSWhile ss cond (applyReturns js)
80− applyReturns (JSFor ss v lo hi js) = JSFor ss v lo hi (applyReturns js)
81− applyReturns (JSForIn ss v xs js) = JSForIn ss v xs (applyReturns js)
82− applyReturns (JSIfElse ss cond t f) = JSIfElse ss cond (applyReturns t) (applyReturns `fmap` f)
83− applyReturns other = other
84−
85−-- |
86−-- Inline functions in the ST module
87−--
88−inlineST :: JS -> JS
89−inlineST = everywhereOnJS convertBlock
90− where
91− -- Look for runST blocks and inline the STRefs there.
92− -- If all STRefs are used in the scope of the same runST, only using { read, write, modify }STRef then
93− -- we can be more aggressive about inlining, and actually turn STRefs into local variables.
94− convertBlock (JSApp _ f [arg]) | isSTFunc C.runST f =
95− let refs = nub . findSTRefsIn $ arg
96− usages = findAllSTUsagesIn arg
97− allUsagesAreLocalVars = all (\u -> let v = toVar u in isJust v && fromJust v `elem` refs) usages
98− localVarsDoNotEscape = all (\r -> length (r `appearingIn` arg) == length (filter (\u -> let v = toVar u in v == Just r) usages)) refs
99− in everywhereOnJS (convert (allUsagesAreLocalVars && localVarsDoNotEscape)) arg
100− convertBlock other = other
101− -- Convert a block in a safe way, preserving object wrappers of references,
102− -- or in a more aggressive way, turning wrappers into local variables depending on the
103− -- agg(ressive) parameter.
104− convert agg (JSApp s1 f [arg]) | isSTFunc C.newSTRef f =
105− JSFunction s1 Nothing [] (JSBlock s1 [JSReturn s1 $ if agg then arg else JSObjectLiteral s1 [(C.stRefValue, arg)]])
106− convert agg (JSApp _ (JSApp s1 f [ref]) []) | isSTFunc C.readSTRef f =
107− if agg then ref else JSAccessor s1 C.stRefValue ref
108− convert agg (JSApp _ (JSApp _ (JSApp s1 f [ref]) [arg]) []) | isSTFunc C.writeSTRef f =
109− if agg then JSAssignment s1 ref arg else JSAssignment s1 (JSAccessor s1 C.stRefValue ref) arg
110− convert agg (JSApp _ (JSApp _ (JSApp s1 f [ref]) [func]) []) | isSTFunc C.modifySTRef f =
111− if agg then JSAssignment s1 ref (JSApp s1 func [ref]) else JSAssignment s1 (JSAccessor s1 C.stRefValue ref) (JSApp s1 func [JSAccessor s1 C.stRefValue ref])
112− convert _ other = other
113− -- Check if an expression represents a function in the ST module
114− isSTFunc name (JSAccessor _ name' (JSVar _ st)) = st == C.st && name == name'
115− isSTFunc _ _ = False
116− -- Find all ST Refs initialized in this block
117− findSTRefsIn = everythingOnJS (++) isSTRef
118− where
119− isSTRef (JSVariableIntroduction _ ident (Just (JSApp _ (JSApp _ f [_]) []))) | isSTFunc C.newSTRef f = [ident]
120− isSTRef _ = []
121− -- Find all STRefs used as arguments to readSTRef, writeSTRef, modifySTRef
122− findAllSTUsagesIn = everythingOnJS (++) isSTUsage
123− where
124− isSTUsage (JSApp _ (JSApp _ f [ref]) []) | isSTFunc C.readSTRef f = [ref]
125− isSTUsage (JSApp _ (JSApp _ (JSApp _ f [ref]) [_]) []) | isSTFunc C.writeSTRef f || isSTFunc C.modifySTRef f = [ref]
126− isSTUsage _ = []
127− -- Find all uses of a variable
128− appearingIn ref = everythingOnJS (++) isVar
129− where
130− isVar e@(JSVar _ v) | v == ref = [e]
131− isVar _ = []
132− -- Convert a JS value to a String if it is a JSVar
133− toVar (JSVar _ v) = Just v
134− toVar _ = Nothing
src/Language/PureScript/CodeGen/JS/Optimizer/TCO.hsdeleted−130
@@ -1,130 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer.TCO
4−-- Copyright : (c) Phil Freeman 2013-14
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- This module implements tail call elimination.
13−--
14−-----------------------------------------------------------------------------
15−
16−module Language.PureScript.CodeGen.JS.Optimizer.TCO (tco) where
17−
18−import Data.Monoid
19−
20−import Language.PureScript.Options
21−import Language.PureScript.CodeGen.JS.AST
22−
23−-- |
24−-- Eliminate tail calls
25−--
26−tco :: Options -> JS -> JS
27−tco opts | optionsNoTco opts = id
28− | otherwise = tco'
29−
30−tco' :: JS -> JS
31−tco' = everywhereOnJS convert
32− where
33− tcoLabel :: String
34− tcoLabel = "tco"
35−
36− tcoVar :: String -> String
37− tcoVar arg = "__tco_" ++ arg
38−
39− copyVar :: String -> String
40− copyVar arg = "__copy_" ++ arg
41−
42− convert :: JS -> JS
43− convert js@(JSVariableIntroduction ss 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 ss 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 s1 ident args (JSBlock s2 (body@(JSReturn _ _):_))) =
57− collectAllFunctionArgs (args : allArgs) (\b -> f (JSFunction s1 ident (map copyVar args) (JSBlock s2 [b]))) body
58− collectAllFunctionArgs allArgs f (JSFunction ss ident args body@(JSBlock _ _)) =
59− (args : allArgs, body, f . JSFunction ss ident (map copyVar args))
60− collectAllFunctionArgs allArgs f (JSReturn s1 (JSFunction s2 ident args (JSBlock s3 [body]))) =
61− collectAllFunctionArgs (args : allArgs) (\b -> f (JSReturn s1 (JSFunction s2 ident (map copyVar args) (JSBlock s3 [b])))) body
62− collectAllFunctionArgs allArgs f (JSReturn s1 (JSFunction s2 ident args body@(JSBlock _ _))) =
63− (args : allArgs, body, f . JSReturn s1 . JSFunction s2 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 rootSS $
96− map (\arg -> JSVariableIntroduction rootSS arg (Just (JSVar rootSS (copyVar arg)))) allArgs ++
97− [ JSLabel rootSS tcoLabel $ JSWhile rootSS (JSBooleanLiteral rootSS True) (JSBlock rootSS [ everywhereOnJS loopify js ]) ]
98− where
99− rootSS = Nothing
100−
101− loopify :: JS -> JS
102− loopify (JSReturn ss ret) | isSelfCall ident ret =
103− let
104− allArgumentValues = concat $ collectSelfCallArgs [] ret
105− in
106− JSBlock ss $ zipWith (\val arg ->
107− JSVariableIntroduction ss (tcoVar arg) (Just val)) allArgumentValues allArgs
108− ++ map (\arg ->
109− JSAssignment ss (JSVar ss arg) (JSVar ss (tcoVar arg))) allArgs
110− ++ [ JSContinue ss tcoLabel ]
111− loopify other = other
112− collectSelfCallArgs :: [[JS]] -> JS -> [[JS]]
113− collectSelfCallArgs allArgumentValues (JSApp _ fn args') = collectSelfCallArgs (args' : allArgumentValues) fn
114− collectSelfCallArgs allArgumentValues _ = allArgumentValues
115−
116− isSelfCall :: String -> JS -> Bool
117− isSelfCall ident (JSApp _ (JSVar _ ident') _) = ident == ident'
118− isSelfCall ident (JSApp _ fn _) = isSelfCall ident fn
119− isSelfCall _ _ = False
120−
121− isSelfCallWithFnArgs :: String -> JS -> [JS] -> Bool
122− isSelfCallWithFnArgs ident (JSVar _ ident') args | ident == ident' && any hasFunction args = True
123− isSelfCallWithFnArgs ident (JSApp _ fn args) acc = isSelfCallWithFnArgs ident fn (args ++ acc)
124− isSelfCallWithFnArgs _ _ _ = False
125−
126− hasFunction :: JS -> Bool
127− hasFunction = getAny . everythingOnJS mappend (Any . isFunction)
128− where
129− isFunction JSFunction{} = True
130− isFunction _ = False
src/Language/PureScript/CodeGen/JS/Optimizer/Unused.hsdeleted−46
@@ -1,46 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CodeGen.JS.Optimizer.Unused
4−-- Copyright : (c) Phil Freeman 2013-14
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- |
12−-- Removes unused variables
13−--
14−-----------------------------------------------------------------------------
15−
16−module Language.PureScript.CodeGen.JS.Optimizer.Unused
17− ( removeCodeAfterReturnStatements
18− , removeUnusedArg
19− , removeUndefinedApp
20− ) where
21−
22−import Language.PureScript.CodeGen.JS.AST
23−import Language.PureScript.CodeGen.JS.Optimizer.Common
24−
25−import qualified Language.PureScript.Constants as C
26−
27−removeCodeAfterReturnStatements :: JS -> JS
28−removeCodeAfterReturnStatements = everywhereOnJS (removeFromBlock go)
29− where
30− go :: [JS] -> [JS]
31− go jss | not (any isJSReturn jss) = jss
32− | otherwise = let (body, ret : _) = break isJSReturn jss in body ++ [ret]
33− isJSReturn (JSReturn _ _) = True
34− isJSReturn _ = False
35−
36−removeUnusedArg :: JS -> JS
37−removeUnusedArg = everywhereOnJS convert
38− where
39− convert (JSFunction ss name [arg] body) | arg == C.__unused = JSFunction ss name [] body
40− convert js = js
41−
42−removeUndefinedApp :: JS -> JS
43−removeUndefinedApp = everywhereOnJS convert
44− where
45− convert (JSApp ss fn [JSVar _ arg]) | arg == C.undefined = JSApp ss fn []
46− convert js = js
src/Language/PureScript/Comments.hsdeleted−15
@@ -1,15 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−
3−-- |
4−-- Defines the types of source code comments
5−--
6−module Language.PureScript.Comments where
7−
8−import Data.Aeson.TH
9−
10−data Comment
11− = LineComment String
12− | BlockComment String
13− deriving (Show, Read, Eq, Ord)
14−
15−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''Comment)
src/Language/PureScript/Constants.hsdeleted−373
@@ -1,373 +0,0 @@
1−-- |
2−-- Various constants which refer to things in the Prelude
3−--
4−module Language.PureScript.Constants where
5−
6−-- Operators
7−
8−($) :: String
9−($) = "$"
10−
11−apply :: String
12−apply = "apply"
13−
14−(#) :: String
15−(#) = "#"
16−
17−applyFlipped :: String
18−applyFlipped = "applyFlipped"
19−
20−(<>) :: String
21−(<>) = "<>"
22−
23−(++) :: String
24−(++) = "++"
25−
26−append :: String
27−append = "append"
28−
29−(>>=) :: String
30−(>>=) = ">>="
31−
32−bind :: String
33−bind = "bind"
34−
35−(+) :: String
36−(+) = "+"
37−
38−add :: String
39−add = "add"
40−
41−(-) :: String
42−(-) = "-"
43−
44−sub :: String
45−sub = "sub"
46−
47−(*) :: String
48−(*) = "*"
49−
50−mul :: String
51−mul = "mul"
52−
53−(/) :: String
54−(/) = "/"
55−
56−div :: String
57−div = "div"
58−
59−(%) :: String
60−(%) = "%"
61−
62−mod :: String
63−mod = "mod"
64−
65−(<) :: String
66−(<) = "<"
67−
68−lessThan :: String
69−lessThan = "lessThan"
70−
71−(>) :: String
72−(>) = ">"
73−
74−greaterThan :: String
75−greaterThan = "greaterThan"
76−
77−(<=) :: String
78−(<=) = "<="
79−
80−lessThanOrEq :: String
81−lessThanOrEq = "lessThanOrEq"
82−
83−(>=) :: String
84−(>=) = ">="
85−
86−greaterThanOrEq :: String
87−greaterThanOrEq = "greaterThanOrEq"
88−
89−(==) :: String
90−(==) = "=="
91−
92−eq :: String
93−eq = "eq"
94−
95−(/=) :: String
96−(/=) = "/="
97−
98−notEq :: String
99−notEq = "notEq"
100−
101−compare :: String
102−compare = "compare"
103−
104−(&&) :: String
105−(&&) = "&&"
106−
107−conj :: String
108−conj = "conj"
109−
110−(||) :: String
111−(||) = "||"
112−
113−disj :: String
114−disj = "disj"
115−
116−unsafeIndex :: String
117−unsafeIndex = "unsafeIndex"
118−
119−(.|.) :: String
120−(.|.) = ".|."
121−
122−(.&.) :: String
123−(.&.) = ".&."
124−
125−(.^.) :: String
126−(.^.) = ".^."
127−
128−(<<<) :: String
129−(<<<) = "<<<"
130−
131−compose :: String
132−compose = "compose"
133−
134−(>>>) :: String
135−(>>>) = ">>>"
136−
137−composeFlipped :: String
138−composeFlipped = "composeFlipped"
139−
140−-- Functions
141−
142−negate :: String
143−negate = "negate"
144−
145−not :: String
146−not = "not"
147−
148−shl :: String
149−shl = "shl"
150−
151−shr :: String
152−shr = "shr"
153−
154−zshr :: String
155−zshr = "zshr"
156−
157−complement :: String
158−complement = "complement"
159−
160−-- Prelude Values
161−
162−zero :: String
163−zero = "zero"
164−
165−one :: String
166−one = "one"
167−
168−bottom :: String
169−bottom = "bottom"
170−
171−top :: String
172−top = "top"
173−
174−return :: String
175−return = "return"
176−
177−pure' :: String
178−pure' = "pure"
179−
180−returnEscaped :: String
181−returnEscaped = "$return"
182−
183−untilE :: String
184−untilE = "untilE"
185−
186−whileE :: String
187−whileE = "whileE"
188−
189−runST :: String
190−runST = "runST"
191−
192−stRefValue :: String
193−stRefValue = "value"
194−
195−newSTRef :: String
196−newSTRef = "newSTRef"
197−
198−readSTRef :: String
199−readSTRef = "readSTRef"
200−
201−writeSTRef :: String
202−writeSTRef = "writeSTRef"
203−
204−modifySTRef :: String
205−modifySTRef = "modifySTRef"
206−
207−mkFn :: String
208−mkFn = "mkFn"
209−
210−runFn :: String
211−runFn = "runFn"
212−
213−unit :: String
214−unit = "unit"
215−
216−-- Prim values
217−
218−undefined :: String
219−undefined = "undefined"
220−
221−-- Type Class Dictionary Names
222−
223−monadEffDictionary :: String
224−monadEffDictionary = "monadEff"
225−
226−applicativeEffDictionary :: String
227−applicativeEffDictionary = "applicativeEff"
228−
229−bindEffDictionary :: String
230−bindEffDictionary = "bindEff"
231−
232−semiringNumber :: String
233−semiringNumber = "semiringNumber"
234−
235−semiringInt :: String
236−semiringInt = "semiringInt"
237−
238−ringNumber :: String
239−ringNumber = "ringNumber"
240−
241−ringInt :: String
242−ringInt = "ringInt"
243−
244−moduloSemiringNumber :: String
245−moduloSemiringNumber = "moduloSemiringNumber"
246−
247−moduloSemiringInt :: String
248−moduloSemiringInt = "moduloSemiringInt"
249−
250−ordBoolean :: String
251−ordBoolean = "ordBoolean"
252−
253−ordNumber :: String
254−ordNumber = "ordNumber"
255−
256−ordInt :: String
257−ordInt = "ordInt"
258−
259−ordString :: String
260−ordString = "ordString"
261−
262−ordChar :: String
263−ordChar = "ordChar"
264−
265−eqNumber :: String
266−eqNumber = "eqNumber"
267−
268−eqInt :: String
269−eqInt = "eqInt"
270−
271−eqString :: String
272−eqString = "eqString"
273−
274−eqChar :: String
275−eqChar = "eqChar"
276−
277−eqBoolean :: String
278−eqBoolean = "eqBoolean"
279−
280−boundedBoolean :: String
281−boundedBoolean = "boundedBoolean"
282−
283−booleanAlgebraBoolean :: String
284−booleanAlgebraBoolean = "booleanAlgebraBoolean"
285−
286−semigroupString :: String
287−semigroupString = "semigroupString"
288−
289−semigroupoidFn :: String
290−semigroupoidFn = "semigroupoidFn"
291−
292−-- Generic Deriving
293−
294−generic :: String
295−generic = "Generic"
296−
297−toSpine :: String
298−toSpine = "toSpine"
299−
300−fromSpine :: String
301−fromSpine = "fromSpine"
302−
303−toSignature :: String
304−toSignature = "toSignature"
305−
306−-- Main module
307−
308−main :: String
309−main = "main"
310−
311−-- Code Generation
312−
313−__superclass_ :: String
314−__superclass_ = "__superclass_"
315−
316−__unused :: String
317−__unused = "__unused"
318−
319−-- Modules
320−
321−prim :: String
322−prim = "Prim"
323−
324−prelude :: String
325−prelude = "Prelude"
326−
327−dataArrayUnsafe :: String
328−dataArrayUnsafe = "Data_Array_Unsafe"
329−
330−eff :: String
331−eff = "Control_Monad_Eff"
332−
333−st :: String
334−st = "Control_Monad_ST"
335−
336−controlApplicative :: String
337−controlApplicative = "Control_Applicative"
338−
339−controlSemigroupoid :: String
340−controlSemigroupoid = "Control_Semigroupoid"
341−
342−controlBind :: String
343−controlBind = "Control_Bind"
344−
345−dataBounded :: String
346−dataBounded = "Data_Bounded"
347−
348−dataSemigroup :: String
349−dataSemigroup = "Data_Semigroup"
350−
351−dataModuloSemiring :: String
352−dataModuloSemiring = "Data_ModuloSemiring"
353−
354−dataBooleanAlgebra :: String
355−dataBooleanAlgebra = "Data_BooleanAlgebra"
356−
357−dataEq :: String
358−dataEq = "Data_Eq"
359−
360−dataOrd :: String
361−dataOrd = "Data_Ord"
362−
363−dataSemiring :: String
364−dataSemiring = "Data_Semiring"
365−
366−dataRing :: String
367−dataRing = "Data_Ring"
368−
369−dataFunction :: String
370−dataFunction = "Data_Function"
371−
372−dataIntBits :: String
373−dataIntBits = "Data_Int_Bits"
src/Language/PureScript/CoreFn.hsdeleted−26
@@ -1,26 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The core functional representation
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.CoreFn (
16− module C
17−) where
18−
19−import Language.PureScript.CoreFn.Ann as C
20−import Language.PureScript.CoreFn.Binders as C
21−import Language.PureScript.CoreFn.Desugar as C
22−import Language.PureScript.CoreFn.Expr as C
23−import Language.PureScript.CoreFn.Literals as C
24−import Language.PureScript.CoreFn.Meta as C
25−import Language.PureScript.CoreFn.Module as C
26−import Language.PureScript.CoreFn.Traversals as C
src/Language/PureScript/CoreFn/Ann.hsdeleted−37
@@ -1,37 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Ann
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | Type alias for basic annotations
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.CoreFn.Ann where
16−
17−import Language.PureScript.AST.SourcePos
18−import Language.PureScript.CoreFn.Meta
19−import Language.PureScript.Types
20−import Language.PureScript.Comments
21−
22−-- |
23−-- Type alias for basic annotations
24−--
25−type Ann = (Maybe SourceSpan, [Comment], Maybe Type, Maybe Meta)
26−
27−-- |
28−-- Initial annotation with no metadata
29−--
30−nullAnn :: Ann
31−nullAnn = (Nothing, [], Nothing, Nothing)
32−
33−-- |
34−-- Remove the comments from an annotation
35−--
36−removeComments :: Ann -> Ann
37−removeComments (ss, _, ty, meta) = (ss, [], ty, meta)
src/Language/PureScript/CoreFn/Binders.hsdeleted−42
@@ -1,42 +0,0 @@
1−{-# LANGUAGE DeriveFunctor #-}
2−
3−-- |
4−-- The core functional representation for binders
5−--
6−module Language.PureScript.CoreFn.Binders where
7−
8−import Language.PureScript.CoreFn.Literals
9−import Language.PureScript.Names
10−
11−-- |
12−-- Data type for binders
13−--
14−data Binder a
15− -- |
16− -- Wildcard binder
17− --
18− = NullBinder a
19− -- |
20− -- A binder which matches a literal value
21− --
22− | LiteralBinder a (Literal (Binder a))
23− -- |
24− -- A binder which binds an identifier
25− --
26− | VarBinder a Ident
27− -- |
28− -- A binder which matches a data constructor
29− --
30− | ConstructorBinder a (Qualified (ProperName 'TypeName)) (Qualified (ProperName 'ConstructorName)) [Binder a]
31− -- |
32− -- A binder which binds its input to an identifier
33− --
34− | NamedBinder a Ident (Binder a) deriving (Show, Read, Functor)
35−
36−
37−extractBinderAnn :: Binder a -> a
38−extractBinderAnn (NullBinder a) = a
39−extractBinderAnn (LiteralBinder a _) = a
40−extractBinderAnn (VarBinder a _) = a
41−extractBinderAnn (ConstructorBinder a _ _ _) = a
42−extractBinderAnn (NamedBinder a _ _) = a
src/Language/PureScript/CoreFn/Desugar.hsdeleted−296
@@ -1,296 +0,0 @@
1−module Language.PureScript.CoreFn.Desugar (moduleToCoreFn) where
2−
3−import Prelude ()
4−import Prelude.Compat
5−
6−
7−import Data.Function (on)
8−import Data.List (sort, sortBy, nub)
9−import Data.Maybe (mapMaybe)
10−import qualified Data.Map as M
11−
12−import Control.Arrow (second, (***))
13−
14−import Language.PureScript.Crash
15−import Language.PureScript.AST.SourcePos
16−import Language.PureScript.AST.Traversals
17−import Language.PureScript.CoreFn.Ann
18−import Language.PureScript.CoreFn.Binders
19−import Language.PureScript.CoreFn.Expr
20−import Language.PureScript.CoreFn.Literals
21−import Language.PureScript.CoreFn.Meta
22−import Language.PureScript.CoreFn.Module
23−import Language.PureScript.Environment
24−import Language.PureScript.Names
25−import Language.PureScript.Sugar.TypeClasses (typeClassMemberName, superClassDictionaryNames)
26−import Language.PureScript.Types
27−import Language.PureScript.Comments
28−import qualified Language.PureScript.AST as A
29−
30−-- |
31−-- Desugars a module from AST to CoreFn representation.
32−--
33−moduleToCoreFn :: Environment -> A.Module -> Module Ann
34−moduleToCoreFn _ (A.Module _ _ _ _ Nothing) =
35− internalError "Module exports were not elaborated before moduleToCoreFn"
36−moduleToCoreFn env (A.Module _ coms mn decls (Just exps)) =
37− let imports = mapMaybe importToCoreFn decls ++ findQualModules decls
38− imports' = nub $ filter (keepImp imports) imports-- TODO could be more efficient
39− exps' = nub $ concatMap exportToCoreFn exps
40− externs = nub $ mapMaybe externToCoreFn decls
41− decls' = concatMap (declToCoreFn Nothing []) decls
42− in Module coms mn imports' exps' externs decls'
43−
44− where
45−
46− -- Remove duplicate imports favoring the one containing sourcespan info
47− keepImp :: [(Ann, ModuleName)] -> (Ann, ModuleName) -> Bool
48− keepImp imps (a, i) = hasSS a || not (any hasDup imps)
49− where
50− hasDup (a', i') = i == i' && hasSS a'
51−
52− hasSS :: Ann -> Bool
53− hasSS (Just _, _, _, _) = True
54− hasSS _ = False
55−
56− ssA :: Maybe SourceSpan -> Ann
57− ssA ss = (ss, [], Nothing, Nothing)
58−
59− -- |
60− -- Desugars member declarations from AST to CoreFn representation.
61− --
62− declToCoreFn :: Maybe SourceSpan -> [Comment] -> A.Declaration -> [Bind Ann]
63− declToCoreFn ss com (A.DataDeclaration Newtype _ _ [(ctor, _)]) =
64− [NonRec (ssA ss) (properToIdent ctor) $
65− Abs (ss, com, Nothing, Just IsNewtype) (Ident "x") (Var nullAnn $ Qualified Nothing (Ident "x"))]
66− declToCoreFn _ _ d@(A.DataDeclaration Newtype _ _ _) =
67− error $ "Found newtype with multiple constructors: " ++ show d
68− declToCoreFn ss com (A.DataDeclaration Data tyName _ ctors) =
69− flip map ctors $ \(ctor, _) ->
70− let (_, _, _, fields) = lookupConstructor env (Qualified (Just mn) ctor)
71− in NonRec (ssA ss) (properToIdent ctor) $ Constructor (ss, com, Nothing, Nothing) tyName ctor fields
72− declToCoreFn ss _ (A.DataBindingGroupDeclaration ds) = concatMap (declToCoreFn ss []) ds
73− declToCoreFn ss com (A.ValueDeclaration name _ _ (Right e)) =
74− [NonRec (ssA ss) name (exprToCoreFn ss com Nothing e)]
75− declToCoreFn ss com (A.FixityDeclaration _ name (Just alias)) =
76− let meta = either getValueMeta (Just . getConstructorMeta) alias
77− alias' = either id (fmap properToIdent) alias
78− in [NonRec (ssA ss) (Op name) (Var (ss, com, Nothing, meta) alias')]
79− declToCoreFn ss _ (A.BindingGroupDeclaration ds) =
80− [Rec $ map (\(name, _, e) -> ((ssA ss, name), exprToCoreFn ss [] Nothing e)) ds]
81− declToCoreFn ss com (A.TypeClassDeclaration name _ supers members) =
82− [NonRec (ssA ss) (properToIdent name) $ mkTypeClassConstructor ss com supers members]
83− declToCoreFn _ com (A.PositionedDeclaration ss com1 d) =
84− declToCoreFn (Just ss) (com ++ com1) d
85− declToCoreFn _ _ _ = []
86−
87− -- |
88− -- Desugars expressions from AST to CoreFn representation.
89− --
90− exprToCoreFn :: Maybe SourceSpan -> [Comment] -> Maybe Type -> A.Expr -> Expr Ann
91− exprToCoreFn ss com ty (A.NumericLiteral v) =
92− Literal (ss, com, ty, Nothing) (NumericLiteral v)
93− exprToCoreFn ss com ty (A.StringLiteral v) =
94− Literal (ss, com, ty, Nothing) (StringLiteral v)
95− exprToCoreFn ss com ty (A.CharLiteral v) =
96− Literal (ss, com, ty, Nothing) (CharLiteral v)
97− exprToCoreFn ss com ty (A.BooleanLiteral v) =
98− Literal (ss, com, ty, Nothing) (BooleanLiteral v)
99− exprToCoreFn ss com ty (A.ArrayLiteral vs) =
100− Literal (ss, com, ty, Nothing) (ArrayLiteral $ map (exprToCoreFn ss [] Nothing) vs)
101− exprToCoreFn ss com ty (A.ObjectLiteral vs) =
102− Literal (ss, com, ty, Nothing) (ObjectLiteral $ map (second (exprToCoreFn ss [] Nothing)) vs)
103− exprToCoreFn ss com ty (A.Accessor name v) =
104− Accessor (ss, com, ty, Nothing) name (exprToCoreFn ss [] Nothing v)
105− exprToCoreFn ss com ty (A.ObjectUpdate obj vs) =
106− ObjectUpdate (ss, com, ty, Nothing) (exprToCoreFn ss [] Nothing obj) $ map (second (exprToCoreFn ss [] Nothing)) vs
107− exprToCoreFn ss com ty (A.Abs (Left name) v) =
108− Abs (ss, com, ty, Nothing) name (exprToCoreFn ss [] Nothing v)
109− exprToCoreFn _ _ _ (A.Abs _ _) =
110− internalError "Abs with Binder argument was not desugared before exprToCoreFn mn"
111− exprToCoreFn ss com ty (A.App v1 v2) =
112− App (ss, com, ty, Nothing) (exprToCoreFn ss [] Nothing v1) (exprToCoreFn ss [] Nothing v2)
113− exprToCoreFn ss com ty (A.Var ident) =
114− Var (ss, com, ty, getValueMeta ident) ident
115− exprToCoreFn ss com ty (A.IfThenElse v1 v2 v3) =
116− Case (ss, com, ty, Nothing) [exprToCoreFn ss [] Nothing v1]
117− [ CaseAlternative [LiteralBinder nullAnn $ BooleanLiteral True]
118− (Right $ exprToCoreFn Nothing [] Nothing v2)
119− , CaseAlternative [LiteralBinder nullAnn $ BooleanLiteral False]
120− (Right $ exprToCoreFn Nothing [] Nothing v3) ]
121− exprToCoreFn ss com ty (A.Constructor name) =
122− Var (ss, com, ty, Just $ getConstructorMeta name) $ fmap properToIdent name
123− exprToCoreFn ss com ty (A.Case vs alts) =
124− Case (ss, com, ty, Nothing) (map (exprToCoreFn ss [] Nothing) vs) (map (altToCoreFn ss) alts)
125− exprToCoreFn ss com _ (A.TypedValue _ v ty) =
126− exprToCoreFn ss com (Just ty) v
127− exprToCoreFn ss com ty (A.Let ds v) =
128− Let (ss, com, ty, Nothing) (concatMap (declToCoreFn ss []) ds) (exprToCoreFn ss [] Nothing v)
129− exprToCoreFn ss com _ (A.TypeClassDictionaryConstructorApp name (A.TypedValue _ (A.ObjectLiteral vs) _)) =
130− let args = map (exprToCoreFn ss [] Nothing . snd) $ sortBy (compare `on` fst) vs
131− ctor = Var (ss, [], Nothing, Just IsTypeClassConstructor) (fmap properToIdent name)
132− in foldl (App (ss, com, Nothing, Nothing)) ctor args
133− exprToCoreFn ss com ty (A.TypeClassDictionaryAccessor _ ident) =
134− Abs (ss, com, ty, Nothing) (Ident "dict")
135− (Accessor nullAnn (runIdent ident) (Var nullAnn $ Qualified Nothing (Ident "dict")))
136− exprToCoreFn _ com ty (A.PositionedValue ss com1 v) =
137− exprToCoreFn (Just ss) (com ++ com1) ty v
138− exprToCoreFn _ _ _ e =
139− error $ "Unexpected value in exprToCoreFn mn: " ++ show e
140−
141− -- |
142− -- Desugars case alternatives from AST to CoreFn representation.
143− --
144− altToCoreFn :: Maybe SourceSpan -> A.CaseAlternative -> CaseAlternative Ann
145− altToCoreFn ss (A.CaseAlternative bs vs) = CaseAlternative (map (binderToCoreFn ss []) bs) (go vs)
146− where
147− go :: Either [(A.Guard, A.Expr)] A.Expr -> Either [(Guard Ann, Expr Ann)] (Expr Ann)
148− go (Left ges) = Left $ map (exprToCoreFn ss [] Nothing *** exprToCoreFn ss [] Nothing) ges
149− go (Right e) = Right (exprToCoreFn ss [] Nothing e)
150−
151− -- |
152− -- Desugars case binders from AST to CoreFn representation.
153− --
154− binderToCoreFn :: Maybe SourceSpan -> [Comment] -> A.Binder -> Binder Ann
155− binderToCoreFn ss com (A.NullBinder) =
156− NullBinder (ss, com, Nothing, Nothing)
157− binderToCoreFn ss com (A.BooleanBinder b) =
158− LiteralBinder (ss, com, Nothing, Nothing) (BooleanLiteral b)
159− binderToCoreFn ss com (A.StringBinder s) =
160− LiteralBinder (ss, com, Nothing, Nothing) (StringLiteral s)
161− binderToCoreFn ss com (A.CharBinder c) =
162− LiteralBinder (ss, com, Nothing, Nothing) (CharLiteral c)
163− binderToCoreFn ss com (A.NumberBinder n) =
164− LiteralBinder (ss, com, Nothing, Nothing) (NumericLiteral n)
165− binderToCoreFn ss com (A.VarBinder name) =
166− VarBinder (ss, com, Nothing, Nothing) name
167− binderToCoreFn ss com (A.ConstructorBinder dctor@(Qualified mn' _) bs) =
168− let (_, tctor, _, _) = lookupConstructor env dctor
169− in ConstructorBinder (ss, com, Nothing, Just $ getConstructorMeta dctor) (Qualified mn' tctor) dctor (map (binderToCoreFn ss []) bs)
170− binderToCoreFn ss com (A.ObjectBinder bs) =
171− LiteralBinder (ss, com, Nothing, Nothing) (ObjectLiteral $ map (second (binderToCoreFn ss [])) bs)
172− binderToCoreFn ss com (A.ArrayBinder bs) =
173− LiteralBinder (ss, com, Nothing, Nothing) (ArrayLiteral $ map (binderToCoreFn ss []) bs)
174− binderToCoreFn ss com (A.NamedBinder name b) =
175− NamedBinder (ss, com, Nothing, Nothing) name (binderToCoreFn ss [] b)
176− binderToCoreFn _ com (A.PositionedBinder ss com1 b) =
177− binderToCoreFn (Just ss) (com ++ com1) b
178− binderToCoreFn ss com (A.TypedBinder _ b) =
179− binderToCoreFn ss com b
180− binderToCoreFn _ _ A.OpBinder{} =
181− internalError "OpBinder should have been desugared before binderToCoreFn"
182− binderToCoreFn _ _ A.BinaryNoParensBinder{} =
183− internalError "BinaryNoParensBinder should have been desugared before binderToCoreFn"
184− binderToCoreFn _ _ A.ParensInBinder{} =
185− internalError "ParensInBinder should have been desugared before binderToCoreFn"
186−
187− -- |
188− -- Gets metadata for values.
189− --
190− getValueMeta :: Qualified Ident -> Maybe Meta
191− getValueMeta name =
192− case lookupValue env name of
193− Just (_, External, _) -> Just IsForeign
194− _ -> Nothing
195−
196− -- |
197− -- Gets metadata for data constructors.
198− --
199− getConstructorMeta :: Qualified (ProperName 'ConstructorName) -> Meta
200− getConstructorMeta ctor =
201− case lookupConstructor env ctor of
202− (Newtype, _, _, _) -> IsNewtype
203− dc@(Data, _, _, fields) ->
204− let constructorType = if numConstructors (ctor, dc) == 1 then ProductType else SumType
205− in IsConstructor constructorType fields
206− where
207−
208− numConstructors
209− :: (Qualified (ProperName 'ConstructorName), (DataDeclType, ProperName 'TypeName, Type, [Ident]))
210− -> Int
211− numConstructors ty = length $ filter (((==) `on` typeConstructor) ty) $ M.toList $ dataConstructors env
212−
213− typeConstructor
214− :: (Qualified (ProperName 'ConstructorName), (DataDeclType, ProperName 'TypeName, Type, [Ident]))
215− -> (ModuleName, ProperName 'TypeName)
216− typeConstructor (Qualified (Just mn') _, (_, tyCtor, _, _)) = (mn', tyCtor)
217− typeConstructor _ = internalError "Invalid argument to typeConstructor"
218−
219−-- |
220−-- Find module names from qualified references to values. This is used to
221−-- ensure instances are imported from any module that is referenced by the
222−-- current module, not just from those that are imported explicitly (#667).
223−--
224−findQualModules :: [A.Declaration] -> [(Ann, ModuleName)]
225−findQualModules decls =
226− let (f, _, _, _, _) = everythingOnValues (++) fqDecls fqValues fqBinders (const []) (const [])
227− in f `concatMap` decls
228− where
229− fqDecls :: A.Declaration -> [(Ann, ModuleName)]
230− fqDecls (A.TypeInstanceDeclaration _ _ q _ _) = getQual q
231− fqDecls (A.FixityDeclaration _ _ (Just eq)) = either getQual getQual eq
232− fqDecls _ = []
233−
234− fqValues :: A.Expr -> [(Ann, ModuleName)]
235− fqValues (A.Var q) = getQual q
236− fqValues (A.Constructor q) = getQual q
237− fqValues _ = []
238−
239− fqBinders :: A.Binder -> [(Ann, ModuleName)]
240− fqBinders (A.ConstructorBinder q _) = getQual q
241− fqBinders _ = []
242−
243− getQual :: Qualified a -> [(Ann, ModuleName)]
244− getQual (Qualified (Just mn) _) = [(nullAnn, mn)]
245− getQual _ = []
246−
247−-- |
248−-- Desugars import declarations from AST to CoreFn representation.
249−--
250−importToCoreFn :: A.Declaration -> Maybe (Ann, ModuleName)
251−importToCoreFn (A.ImportDeclaration name _ _ _) = Just (nullAnn, name)
252−importToCoreFn (A.PositionedDeclaration ss _ d) =
253− ((,) (Just ss, [], Nothing, Nothing) . snd) <$> importToCoreFn d
254−importToCoreFn _ = Nothing
255−
256−-- |
257−-- Desugars foreign declarations from AST to CoreFn representation.
258−--
259−externToCoreFn :: A.Declaration -> Maybe ForeignDecl
260−externToCoreFn (A.ExternDeclaration name ty) = Just (name, ty)
261−externToCoreFn (A.PositionedDeclaration _ _ d) = externToCoreFn d
262−externToCoreFn _ = Nothing
263−
264−-- |
265−-- Desugars export declarations references from AST to CoreFn representation.
266−-- CoreFn modules only export values, so all data constructors, class
267−-- constructor, instances and values are flattened into one list.
268−--
269−exportToCoreFn :: A.DeclarationRef -> [Ident]
270−exportToCoreFn (A.TypeRef _ (Just dctors)) = map properToIdent dctors
271−exportToCoreFn (A.ValueRef name) = [name]
272−exportToCoreFn (A.TypeClassRef name) = [properToIdent name]
273−exportToCoreFn (A.TypeInstanceRef name) = [name]
274−exportToCoreFn (A.PositionedDeclarationRef _ _ d) = exportToCoreFn d
275−exportToCoreFn _ = []
276−
277−-- |
278−-- Makes a typeclass dictionary constructor function. The returned expression
279−-- is a function that accepts the superclass instances and member
280−-- implementations and returns a record for the instance dictionary.
281−--
282−mkTypeClassConstructor :: Maybe SourceSpan -> [Comment] -> [Constraint] -> [A.Declaration] -> Expr Ann
283−mkTypeClassConstructor ss com [] [] = Literal (ss, com, Nothing, Just IsTypeClassConstructor) (ObjectLiteral [])
284−mkTypeClassConstructor ss com supers members =
285− let args@(a:as) = sort $ map typeClassMemberName members ++ superClassDictionaryNames supers
286− props = [ (arg, Var nullAnn $ Qualified Nothing (Ident arg)) | arg <- args ]
287− dict = Literal nullAnn (ObjectLiteral props)
288− in Abs (ss, com, Nothing, Just IsTypeClassConstructor)
289− (Ident a)
290− (foldr (Abs nullAnn . Ident) dict as)
291−
292−-- |
293−-- Converts a ProperName to an Ident.
294−--
295−properToIdent :: ProperName a -> Ident
296−properToIdent = Ident . runProperName
src/Language/PureScript/CoreFn/Expr.hsdeleted−121
@@ -1,121 +0,0 @@
1−{-# LANGUAGE DeriveFunctor #-}
2−
3−-- |
4−-- The core functional representation
5−--
6−module Language.PureScript.CoreFn.Expr where
7−
8−import Control.Arrow ((***))
9−
10−import Language.PureScript.CoreFn.Binders
11−import Language.PureScript.CoreFn.Literals
12−import Language.PureScript.Names
13−
14−-- |
15−-- Data type for expressions and terms
16−--
17−data Expr a
18− -- |
19− -- A literal value
20− --
21− = Literal a (Literal (Expr a))
22− -- |
23− -- A data constructor (type name, constructor name, field names)
24− --
25− | Constructor a (ProperName 'TypeName) (ProperName 'ConstructorName) [Ident]
26− -- |
27− -- A record property accessor
28− --
29− | Accessor a String (Expr a)
30− -- |
31− -- Partial record update
32− --
33− | ObjectUpdate a (Expr a) [(String, Expr a)]
34− -- |
35− -- Function introduction
36− --
37− | Abs a Ident (Expr a)
38− -- |
39− -- Function application
40− --
41− | App a (Expr a) (Expr a)
42− -- |
43− -- Variable
44− --
45− | Var a (Qualified Ident)
46− -- |
47− -- A case expression
48− --
49− | Case a [Expr a] [CaseAlternative a]
50− -- |
51− -- A let binding
52− --
53− | Let a [Bind a] (Expr a)
54− deriving (Show, Read, Functor)
55−
56−-- |
57−-- A let or module binding.
58−--
59−data Bind a
60− -- |
61− -- Non-recursive binding for a single value
62− --
63− = NonRec a Ident (Expr a)
64− -- |
65− -- Mutually recursive binding group for several values
66− --
67− | Rec [((a, Ident), Expr a)] deriving (Show, Read, Functor)
68−
69−-- |
70−-- A guard is just a boolean-valued expression that appears alongside a set of binders
71−--
72−type Guard a = Expr a
73−
74−-- |
75−-- An alternative in a case statement
76−--
77−data CaseAlternative a = CaseAlternative
78− { -- |
79− -- A collection of binders with which to match the inputs
80− --
81− caseAlternativeBinders :: [Binder a]
82− -- |
83− -- The result expression or a collect of guarded expressions
84− --
85− , caseAlternativeResult :: Either [(Guard a, Expr a)] (Expr a)
86− } deriving (Show, Read)
87−
88−instance Functor CaseAlternative where
89−
90− fmap f (CaseAlternative cabs car) = CaseAlternative
91− (fmap (fmap f) cabs)
92− (either (Left . fmap (fmap f *** fmap f)) (Right . fmap f) car)
93−
94−-- |
95−-- Extract the annotation from a term
96−--
97−extractAnn :: Expr a -> a
98−extractAnn (Literal a _) = a
99−extractAnn (Constructor a _ _ _) = a
100−extractAnn (Accessor a _ _) = a
101−extractAnn (ObjectUpdate a _ _) = a
102−extractAnn (Abs a _ _) = a
103−extractAnn (App a _ _) = a
104−extractAnn (Var a _) = a
105−extractAnn (Case a _ _) = a
106−extractAnn (Let a _ _) = a
107−
108−
109−-- |
110−-- Modify the annotation on a term
111−--
112−modifyAnn :: (a -> a) -> Expr a -> Expr a
113−modifyAnn f (Literal a b) = Literal (f a) b
114−modifyAnn f (Constructor a b c d) = Constructor (f a) b c d
115−modifyAnn f (Accessor a b c) = Accessor (f a) b c
116−modifyAnn f (ObjectUpdate a b c) = ObjectUpdate (f a) b c
117−modifyAnn f (Abs a b c) = Abs (f a) b c
118−modifyAnn f (App a b c) = App (f a) b c
119−modifyAnn f (Var a b) = Var (f a) b
120−modifyAnn f (Case a b c) = Case (f a) b c
121−modifyAnn f (Let a b c) = Let (f a) b c
src/Language/PureScript/CoreFn/Literals.hsdeleted−37
@@ -1,37 +0,0 @@
1−{-# LANGUAGE DeriveFunctor #-}
2−
3−-- |
4−-- The core functional representation for literal values.
5−--
6−module Language.PureScript.CoreFn.Literals where
7−
8−-- |
9−-- Data type for literal values. Parameterised so it can be used for Exprs and
10−-- Binders.
11−--
12−data Literal a
13− -- |
14− -- A numeric literal
15− --
16− = NumericLiteral (Either Integer Double)
17− -- |
18− -- A string literal
19− --
20− | StringLiteral String
21− -- |
22− -- A character literal
23− --
24− | CharLiteral Char
25− -- |
26− -- A boolean literal
27− --
28− | BooleanLiteral Bool
29− -- |
30− -- An array literal
31− --
32− | ArrayLiteral [a]
33− -- |
34− -- An object literal
35− --
36− | ObjectLiteral [(String, a)]
37− deriving (Show, Read, Functor)
src/Language/PureScript/CoreFn/Meta.hsdeleted−40
@@ -1,40 +0,0 @@
1−-- |
2−-- Metadata annotations for core functional representation
3−--
4−module Language.PureScript.CoreFn.Meta where
5−
6−import Language.PureScript.Names
7−
8−-- |
9−-- Metadata annotations
10−--
11−data Meta
12− -- |
13− -- The contained value is a data constructor
14− --
15− = IsConstructor ConstructorType [Ident]
16− -- |
17− -- The contained value is a newtype
18− --
19− | IsNewtype
20− -- |
21− -- The contained value is a typeclass dictionary constructor
22− --
23− | IsTypeClassConstructor
24− -- |
25− -- The contained reference is for a foreign member
26− --
27− | IsForeign deriving (Show, Read, Eq)
28−
29−-- |
30−-- Data constructor metadata
31−--
32−data ConstructorType
33− -- |
34− -- The constructor is for a type with a single construcor
35− --
36− = ProductType
37− -- |
38− -- The constructor is for a type with multiple construcors
39− --
40− | SumType deriving (Show, Read, Eq)
src/Language/PureScript/CoreFn/Module.hsdeleted−31
@@ -1,31 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Module
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | The CoreFn module representation
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.CoreFn.Module where
16−
17−import Language.PureScript.Comments
18−import Language.PureScript.CoreFn.Expr
19−import Language.PureScript.Names
20−import Language.PureScript.Types
21−
22−data Module a = Module
23− { moduleComments :: [Comment]
24− , moduleName :: ModuleName
25− , moduleImports :: [(a, ModuleName)]
26− , moduleExports :: [Ident]
27− , moduleForeign :: [ForeignDecl]
28− , moduleDecls :: [Bind a]
29− } deriving (Show, Read)
30−
31−type ForeignDecl = (Ident, Type)
src/Language/PureScript/CoreFn/Traversals.hsdeleted−86
@@ -1,86 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Language.PureScript.CoreFn.Traversals
4−-- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors
5−-- License : MIT
6−--
7−-- Maintainer : Phil Freeman <paf31@cantab.net>, Gary Burgess <gary.burgess@gmail.com>
8−-- Stability : experimental
9−-- Portability :
10−--
11−-- | CoreFn traversal helpers
12−--
13−-----------------------------------------------------------------------------
14−
15−module Language.PureScript.CoreFn.Traversals where
16−
17−import Control.Arrow (second, (***), (+++))
18−
19−import Language.PureScript.CoreFn.Binders
20−import Language.PureScript.CoreFn.Expr
21−import Language.PureScript.CoreFn.Literals
22−
23−everywhereOnValues :: (Bind a -> Bind a) ->
24− (Expr a -> Expr a) ->
25− (Binder a -> Binder a) ->
26− (Bind a -> Bind a, Expr a -> Expr a, Binder a -> Binder a)
27−everywhereOnValues f g h = (f', g', h')
28− where
29− f' (NonRec a name e) = f (NonRec a 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' (ConstructorBinder a q1 q2 bs) = h (ConstructorBinder a q1 q2 (map h' bs))
44− h' b = h b
45−
46− handleCaseAlternative ca =
47− ca { caseAlternativeBinders = map h' (caseAlternativeBinders ca)
48− , caseAlternativeResult = (map (g' *** g') +++ g') (caseAlternativeResult ca)
49− }
50−
51− handleLiteral :: (a -> a) -> Literal a -> Literal a
52− handleLiteral i (ArrayLiteral ls) = ArrayLiteral (map i ls)
53− handleLiteral i (ObjectLiteral ls) = ObjectLiteral (map (fmap i) ls)
54− handleLiteral _ other = other
55−
56−everythingOnValues :: (r -> r -> r) ->
57− (Bind a -> r) ->
58− (Expr a -> r) ->
59− (Binder a -> r) ->
60− (CaseAlternative a -> r) ->
61− (Bind a -> r, Expr a -> r, Binder a -> r, CaseAlternative a -> r)
62−everythingOnValues (<>) f g h i = (f', g', h', i')
63− where
64− f' b@(NonRec _ _ e) = f b <> g' e
65− f' b@(Rec es) = foldl (<>) (f b) (map (g' . snd) es)
66−
67− g' v@(Literal _ l) = foldl (<>) (g v) (map g' (extractLiteral l))
68− g' v@(Accessor _ _ e1) = g v <> g' e1
69− g' v@(ObjectUpdate _ obj vs) = foldl (<>) (g v <> g' obj) (map (g' . snd) vs)
70− g' v@(Abs _ _ e1) = g v <> g' e1
71− g' v@(App _ e1 e2) = g v <> g' e1 <> g' e2
72− g' v@(Case _ vs alts) = foldl (<>) (foldl (<>) (g v) (map g' vs)) (map i' alts)
73− g' v@(Let _ ds e1) = foldl (<>) (g v) (map f' ds) <> g' e1
74− g' v = g v
75−
76− h' b@(LiteralBinder _ l) = foldl (<>) (h b) (map h' (extractLiteral l))
77− h' b@(ConstructorBinder _ _ _ bs) = foldl (<>) (h b) (map h' bs)
78− h' b@(NamedBinder _ _ b1) = h b <> h' b1
79− h' b = h b
80−
81− i' ca@(CaseAlternative bs (Right val)) = foldl (<>) (i ca) (map h' bs) <> g' val
82− i' ca@(CaseAlternative bs (Left gs)) = foldl (<>) (i ca) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
83−
84− extractLiteral (ArrayLiteral xs) = xs
85− extractLiteral (ObjectLiteral xs) = map snd xs
86− extractLiteral _ = []
src/Language/PureScript/Crash.hsdeleted−9
@@ -1,9 +0,0 @@
1−module Language.PureScript.Crash where
2−
3−-- | Exit with an error message and a crash report link.
4−internalError :: String -> a
5−internalError =
6− error
7− . ("An internal error ocurred during compilation: " ++)
8− . (++ "\nPlease report this at https://github.com/purescript/purescript/issues")
9− . show
src/Language/PureScript/Docs.hsdeleted−14
@@ -1,14 +0,0 @@
1−
2−-- | Data types and functions for rendering generated documentation from
3−-- PureScript code, in a variety of formats.
4−
5−module Language.PureScript.Docs (
6− module Docs
7−) where
8−
9−import Language.PureScript.Docs.Types as Docs
10−import Language.PureScript.Docs.RenderedCode.Types as Docs
11−import Language.PureScript.Docs.RenderedCode.Render as Docs
12−import Language.PureScript.Docs.Convert as Docs
13−import Language.PureScript.Docs.Render as Docs
14−import Language.PureScript.Docs.ParseAndBookmark as Docs
src/Language/PureScript/Docs/AsMarkdown.hsdeleted−142
@@ -1,142 +0,0 @@
1−{-# LANGUAGE RecordWildCards #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−
4−module Language.PureScript.Docs.AsMarkdown
5− ( renderModulesAsMarkdown
6− , Docs
7− , runDocs
8− , modulesAsMarkdown
9− ) where
10−
11−import Prelude ()
12−import Prelude.Compat
13−
14−import Control.Monad (unless, zipWithM_)
15−import Control.Monad.Writer (Writer, tell, execWriter)
16−import Control.Monad.Error.Class (MonadError)
17−import Data.Foldable (for_)
18−import Data.List (partition)
19−
20−import qualified Language.PureScript as P
21−
22−import Language.PureScript.Docs.Types
23−import Language.PureScript.Docs.RenderedCode
24−import qualified Language.PureScript.Docs.Convert as Convert
25−import qualified Language.PureScript.Docs.Render as Render
26−
27−-- |
28−-- Take a list of modules and render them all in order, returning a single
29−-- Markdown-formatted String.
30−--
31−renderModulesAsMarkdown ::
32− (Functor m, Applicative m,
33− MonadError P.MultipleErrors m) =>
34− [P.Module] ->
35− m String
36−renderModulesAsMarkdown =
37− fmap (runDocs . modulesAsMarkdown) . Convert.convertModules
38−
39−modulesAsMarkdown :: [Module] -> Docs
40−modulesAsMarkdown = mapM_ moduleAsMarkdown
41−
42−moduleAsMarkdown :: Module -> Docs
43−moduleAsMarkdown Module{..} = do
44− headerLevel 2 $ "Module " ++ P.runModuleName modName
45− spacer
46− for_ modComments tell'
47− mapM_ (declAsMarkdown modName) modDeclarations
48− spacer
49− for_ modReExports $ \(mn, decls) -> do
50− headerLevel 3 $ "Re-exported from " ++ P.runModuleName mn ++ ":"
51− spacer
52− mapM_ (declAsMarkdown mn) decls
53−
54−declAsMarkdown :: P.ModuleName -> Declaration -> Docs
55−declAsMarkdown mn decl@Declaration{..} = do
56− let options = defaultRenderTypeOptions { currentModule = Just mn }
57− headerLevel 4 (ticks declTitle)
58− spacer
59−
60− let (instances, children) = partition (isChildInstance . cdeclInfo) declChildren
61− fencedBlock $ do
62− tell' (codeToString $ Render.renderDeclarationWithOptions options decl)
63− zipWithM_ (\f c -> tell' (childToString f c)) (First : repeat NotFirst) children
64− spacer
65−
66− for_ declFixity (\fixity -> fixityAsMarkdown fixity >> spacer)
67−
68− for_ declComments tell'
69−
70− unless (null instances) $ do
71− headerLevel 5 "Instances"
72− fencedBlock $ mapM_ (tell' . childToString NotFirst) instances
73− spacer
74−
75− where
76− isChildInstance (ChildInstance _ _) = True
77− isChildInstance _ = False
78−
79−codeToString :: RenderedCode -> String
80−codeToString = outputWith elemAsMarkdown
81− where
82− elemAsMarkdown (Syntax x) = x
83− elemAsMarkdown (Ident x) = x
84− elemAsMarkdown (Ctor x _) = x
85− elemAsMarkdown (Kind x) = x
86− elemAsMarkdown (Keyword x) = x
87− elemAsMarkdown Space = " "
88−
89−fixityAsMarkdown :: P.Fixity -> Docs
90−fixityAsMarkdown (P.Fixity associativity precedence) =
91− tell' $ concat [ "_"
92− , associativityStr
93− , " / precedence "
94− , show precedence
95− , "_"
96− ]
97− where
98− associativityStr = case associativity of
99− P.Infixl -> "left-associative"
100− P.Infixr -> "right-associative"
101− P.Infix -> "non-associative"
102−
103−childToString :: First -> ChildDeclaration -> String
104−childToString f decl@ChildDeclaration{..} =
105− case cdeclInfo of
106− ChildDataConstructor _ ->
107− let c = if f == First then "=" else "|"
108− in " " ++ c ++ " " ++ str
109− ChildTypeClassMember _ ->
110− " " ++ str
111− ChildInstance _ _ ->
112− str
113− where
114− str = codeToString $ Render.renderChildDeclaration decl
115−
116−data First
117− = First
118− | NotFirst
119− deriving (Show, Read, Eq, Ord)
120−
121−type Docs = Writer [String] ()
122−
123−runDocs :: Docs -> String
124−runDocs = unlines . execWriter
125−
126−tell' :: String -> Docs
127−tell' = tell . (:[])
128−
129−spacer :: Docs
130−spacer = tell' ""
131−
132−headerLevel :: Int -> String -> Docs
133−headerLevel level hdr = tell' (replicate level '#' ++ ' ' : hdr)
134−
135−fencedBlock :: Docs -> Docs
136−fencedBlock inner = do
137− tell' "``` purescript"
138− inner
139− tell' "```"
140−
141−ticks :: String -> String
142−ticks = ("`" ++) . (++ "`")
src/Language/PureScript/Docs/Convert.hsdeleted−196
@@ -1,196 +0,0 @@
1−{-# LANGUAGE TupleSections #-}
2−{-# LANGUAGE OverloadedStrings #-}
3−{-# LANGUAGE RecordWildCards #-}
4−{-# LANGUAGE ViewPatterns #-}
5−{-# LANGUAGE FlexibleContexts #-}
6−
7−-- | Functions for converting PureScript ASTs into values of the data types
8−-- from Language.PureScript.Docs.
9−
10−module Language.PureScript.Docs.Convert
11− ( convertModules
12− , convertModulesInPackage
13− , collectBookmarks
14− ) where
15−
16−import Prelude ()
17−import Prelude.Compat
18−
19−import Control.Arrow ((&&&), second)
20−import Control.Category ((>>>))
21−import Control.Monad
22−import Control.Monad.State (runStateT)
23−import Control.Monad.Writer.Strict (runWriterT)
24−import Control.Monad.Error.Class (MonadError)
25−import qualified Data.Map as Map
26−
27−import Text.Parsec (eof)
28−import qualified Language.PureScript as P
29−import qualified Language.PureScript.Constants as C
30−
31−import Language.PureScript.Docs.Types
32−import Language.PureScript.Docs.Convert.Single (convertSingleModule, collectBookmarks)
33−import Language.PureScript.Docs.Convert.ReExports (updateReExports)
34−
35−-- |
36−-- Like convertModules, except that it takes a list of modules, together with
37−-- their dependency status, and discards dependency modules in the resulting
38−-- documentation.
39−--
40−convertModulesInPackage ::
41− (Functor m, Applicative m, MonadError P.MultipleErrors m) =>
42− [InPackage P.Module] ->
43− m [Module]
44−convertModulesInPackage modules =
45− go modules
46− where
47− localNames =
48− map P.getModuleName (takeLocals modules)
49− go =
50− map ignorePackage
51− >>> convertModules
52− >>> fmap (filter ((`elem` localNames) . modName))
53−
54−-- |
55−-- Convert a group of modules to the intermediate format, designed for
56−-- producing documentation from. It is also necessary to pass an Env containing
57−-- imports/exports information about the list of modules, which is needed for
58−-- documenting re-exports.
59−--
60−-- Note that the whole module dependency graph must be included in the list; if
61−-- some modules import things from other modules, then those modules must also
62−-- be included.
63−--
64−-- For value declarations, if explicit type signatures are omitted, or a
65−-- wildcard type is used, then we typecheck the modules and use the inferred
66−-- types.
67−--
68−convertModules ::
69− (Functor m, Applicative m, MonadError P.MultipleErrors m) =>
70− [P.Module] ->
71− m [Module]
72−convertModules =
73− P.sortModules
74− >>> fmap (fst >>> map importPrim)
75− >=> convertSorted
76−
77−importPrim :: P.Module -> P.Module
78−importPrim = P.addDefaultImport (P.ModuleName [P.ProperName C.prim])
79−
80−-- |
81−-- Convert a sorted list of modules.
82−--
83−convertSorted ::
84− (Functor m, Applicative m, MonadError P.MultipleErrors m) =>
85− [P.Module] ->
86− m [Module]
87−convertSorted modules = do
88− (env, convertedModules) <- second (map convertSingleModule) <$> partiallyDesugar modules
89−
90− modulesWithTypes <- typeCheckIfNecessary modules convertedModules
91− let moduleMap = Map.fromList (map (modName &&& id) modulesWithTypes)
92−
93− let traversalOrder = map P.getModuleName modules
94− pure (Map.elems (updateReExports env traversalOrder moduleMap))
95−
96−-- |
97−-- If any exported value declarations have either wildcard type signatures, or
98−-- none at all, then typecheck in order to fill them in with the inferred
99−-- types.
100−--
101−typeCheckIfNecessary ::
102− (Functor m, Applicative m, MonadError P.MultipleErrors m) =>
103− [P.Module] ->
104− [Module] ->
105− m [Module]
106−typeCheckIfNecessary modules convertedModules =
107− if any hasWildcards convertedModules
108− then go
109− else pure convertedModules
110−
111− where
112− hasWildcards =
113− any ((==) (ValueDeclaration P.TypeWildcard) . declInfo) . modDeclarations
114−
115− go = do
116− checkEnv <- snd <$> typeCheck modules
117− pure (map (insertValueTypes checkEnv) convertedModules)
118−
119−-- |
120−-- Typechecks all the modules together. Also returns the final 'P.Environment',
121−-- which is useful for adding in inferred types where explicit declarations
122−-- were not provided.
123−--
124−typeCheck ::
125− (Functor m, MonadError P.MultipleErrors m) =>
126− [P.Module] ->
127− m ([P.Module], P.Environment)
128−typeCheck =
129− (P.desugar [] >=> check)
130− >>> fmap (second P.checkEnv)
131− >>> P.evalSupplyT 0
132− >>> ignoreWarnings
133−
134− where
135− check ms =
136− runStateT
137− (traverse P.typeCheckModule ms)
138− (P.emptyCheckState P.initEnvironment)
139−
140− ignoreWarnings =
141− fmap fst . runWriterT
142−
143−-- |
144−-- Updates all the types of the ValueDeclarations inside the module based on
145−-- their types inside the given Environment.
146−--
147−insertValueTypes ::
148− P.Environment -> Module -> Module
149−insertValueTypes env m =
150− m { modDeclarations = map go (modDeclarations m) }
151− where
152− go (d@Declaration { declInfo = ValueDeclaration P.TypeWildcard }) =
153− let
154− ident = parseIdent (declTitle d)
155− ty = lookupName ident
156− in
157− d { declInfo = ValueDeclaration ty }
158− go other =
159− other
160−
161− parseIdent =
162− either (err . ("failed to parse Ident: " ++)) id . runParser P.parseIdent
163−
164− lookupName name =
165− let key = (modName m, name)
166− in case Map.lookup key (P.names env) of
167− Just (ty, _, _) ->
168− ty
169− Nothing ->
170− err ("name not found: " ++ show key)
171−
172− err msg =
173− P.internalError ("Docs.Convert.insertValueTypes: " ++ msg)
174−
175−runParser :: P.TokenParser a -> String -> Either String a
176−runParser p s = either (Left . show) Right $ do
177− ts <- P.lex "" s
178− P.runTokenParser "" (p <* eof) ts
179−
180−-- |
181−-- Partially desugar modules so that they are suitable for extracting
182−-- documentation information from.
183−--
184−partiallyDesugar ::
185− (Functor m, Applicative m, MonadError P.MultipleErrors m) =>
186− [P.Module]
187− -> m (P.Env, [P.Module])
188−partiallyDesugar = P.evalSupplyT 0 . desugar'
189− where
190− desugar' =
191− traverse P.desugarDoModule
192− >=> P.desugarCasesModule
193− >=> P.desugarTypeDeclarationsModule
194− >=> ignoreWarnings . P.desugarImportsWithEnv []
195−
196− ignoreWarnings = fmap fst . runWriterT
src/Language/PureScript/Docs/Convert/ReExports.hsdeleted−486
@@ -1,486 +0,0 @@
1−{-# LANGUAGE ViewPatterns #-}
2−{-# LANGUAGE TupleSections #-}
3−{-# LANGUAGE RecordWildCards #-}
4−{-# LANGUAGE FlexibleContexts #-}
5−
6−module Language.PureScript.Docs.Convert.ReExports
7− ( updateReExports
8− ) where
9−
10−import Prelude ()
11−import Prelude.Compat
12−
13−import Control.Monad
14−import Control.Monad.Trans.State.Strict (execState)
15−import Control.Monad.State.Class (MonadState, gets, modify)
16−import Control.Monad.Trans.Reader (runReaderT)
17−import Control.Monad.Reader.Class (MonadReader, ask)
18−import Control.Arrow ((&&&), first, second)
19−import Data.Either
20−import Data.Maybe (mapMaybe)
21−import Data.Map (Map)
22−import qualified Data.Map as Map
23−import Data.Monoid ((<>))
24−
25−import qualified Language.PureScript as P
26−
27−import Language.PureScript.Docs.Types
28−
29−-- |
30−-- Given:
31−--
32−-- * The Imports/Exports Env
33−-- * An order to traverse the modules (which must be topological)
34−-- * A map of modules, indexed by their names, which are assumed to not
35−-- have their re-exports listed yet
36−--
37−-- This function adds all the missing re-exports.
38−--
39−updateReExports ::
40− P.Env ->
41− [P.ModuleName] ->
42− Map P.ModuleName Module ->
43− Map P.ModuleName Module
44−updateReExports env order modules =
45− execState action modules
46− where
47− action =
48− void (traverse go order)
49−
50− go mn = do
51− mdl <- lookup' mn
52− reExports <- getReExports env mn
53− let mdl' = mdl { modReExports = reExports }
54− modify (Map.insert mn mdl')
55−
56− lookup' mn = do
57− v <- gets (Map.lookup mn)
58− case v of
59− Just v' ->
60− pure v'
61− Nothing ->
62− internalError ("Module missing: " ++ P.runModuleName mn)
63−
64−-- |
65−-- Collect all of the re-exported declarations for a single module.
66−--
67−-- We require that modules have already been sorted (P.sortModules) in order to
68−-- ensure that by the time we convert a particular module, all its dependencies
69−-- have already been converted.
70−--
71−getReExports ::
72− (Functor m, Applicative m,
73− MonadState (Map P.ModuleName Module) m) =>
74− P.Env ->
75− P.ModuleName ->
76− m [(P.ModuleName, [Declaration])]
77−getReExports env mn =
78− case Map.lookup mn env of
79− Nothing ->
80− internalError ("Module missing: " ++ P.runModuleName mn)
81− Just (_, imports, exports) -> do
82− allExports <- runReaderT (collectDeclarations imports exports) mn
83− pure (filter notLocal allExports)
84−
85− where
86− notLocal = (/= mn) . fst
87−
88−-- |
89−-- Assemble a list of declarations re-exported from a particular module, based
90−-- on the Imports and Exports value for that module, and by extracting the
91−-- declarations from the current state.
92−--
93−-- This function works by searching through the lists of exported declarations
94−-- in the Exports, and looking them up in the associated Imports value to find
95−-- the module they were imported from.
96−--
97−-- Additionally:
98−--
99−-- * Attempts to move re-exported type class members under their parent
100−-- type classes, if possible, or otherwise, "promote" them from
101−-- ChildDeclarations to proper Declarations.
102−-- * Filters data declarations to ensure that only re-exported data
103−-- constructors are listed.
104−-- * Filters type class declarations to ensure that only re-exported type
105−-- class members are listed.
106−--
107−collectDeclarations ::
108− (Functor m, Applicative m,
109− MonadState (Map P.ModuleName Module) m,
110− MonadReader P.ModuleName m) =>
111− P.Imports ->
112− P.Exports ->
113− m [(P.ModuleName, [Declaration])]
114−collectDeclarations imports exports = do
115− valsAndMembers <- collect lookupValueDeclaration impVals expVals
116− typeClasses <- collect lookupTypeClassDeclaration impTCs expTCs
117− types <- collect lookupTypeDeclaration impTypes expTypes
118−
119− (vals, classes) <- handleTypeClassMembers valsAndMembers typeClasses
120−
121− let filteredTypes = filterDataConstructors expCtors types
122− let filteredClasses = filterTypeClassMembers (map fst expVals) classes
123−
124− pure (Map.toList (Map.unionsWith (<>) [filteredTypes, filteredClasses, vals]))
125−
126− where
127− collect lookup' imps exps = do
128− imps' <- traverse (findImport imps) exps
129− Map.fromListWith (<>) <$> traverse (uncurry lookup') imps'
130−
131− expVals = P.exportedValues exports
132− impVals = concat (Map.elems (P.importedValues imports))
133−
134− expTypes = map (first fst) (P.exportedTypes exports)
135− impTypes = concat (Map.elems (P.importedTypes imports))
136−
137− expCtors = concatMap (snd . fst) (P.exportedTypes exports)
138−
139− expTCs = P.exportedTypeClasses exports
140− impTCs = concat (Map.elems (P.importedTypeClasses imports))
141−
142−-- |
143−-- Given a list of imported declarations (of a particular kind, ie. type, data,
144−-- class, value, etc), and the name of an exported declaration of the same
145−-- kind, together with the module it was originally defined in, return a tuple
146−-- of:
147−--
148−-- * the module that exported declaration was imported from (note that
149−-- this can be different from the module it was originally defined in, if
150−-- it is a re-export),
151−-- * that same declaration's name.
152−--
153−-- This function uses a type variable for names because we want to be able to
154−-- instantiate @name@ as both 'P.Ident' and 'P.ProperName'.
155−--
156−findImport ::
157− (Show name, Eq name, Applicative m, MonadReader P.ModuleName m) =>
158− [P.ImportRecord name] ->
159− (name, P.ModuleName) ->
160− m (P.ModuleName, name)
161−findImport imps (name, orig) =
162− let
163− matches (P.ImportRecord qual mn _) = P.disqualify qual == name && mn == orig
164− matching = filter matches imps
165− getQualified (P.Qualified mname _) = mname
166− in
167− case mapMaybe (getQualified . P.importName) matching of
168− -- A value can occur more than once if it is imported twice (eg, if it is
169− -- exported by A, re-exported from A by B, and C imports it from both A
170− -- and B). In this case, we just take its first appearance.
171− (importedFrom:_) ->
172− pure (importedFrom, name)
173− [] ->
174− internalErrorInModule ("findImport: not found: " ++ show (name, orig))
175−
176−lookupValueDeclaration ::
177− (Applicative m,
178− MonadState (Map P.ModuleName Module) m,
179− MonadReader P.ModuleName m) =>
180− P.ModuleName ->
181− P.Ident ->
182− m (P.ModuleName, [Either (String, P.Constraint, ChildDeclaration) Declaration])
183−lookupValueDeclaration importedFrom ident = do
184− decls <- lookupModuleDeclarations "lookupValueDeclaration" importedFrom
185− let
186− rs =
187− filter (\d -> declTitle d == P.showIdent ident
188− && (isValue d || isAlias d)) decls
189− errOther other =
190− internalErrorInModule
191− ("lookupValueDeclaration: unexpected result:\n" ++
192− "other: " ++ show other ++ "\n" ++
193− "ident: " ++ show ident ++ "\n" ++
194− "decls: " ++ show decls)
195−
196− case rs of
197− [r] ->
198− pure (importedFrom, [Right r])
199− [] ->
200− -- It's a type class member.
201− -- Note that we need to filter based on the child declaration info using
202− -- `isTypeClassMember` anyway, because child declarations of type classes
203− -- are not necessarily members; they could also be instances.
204− let
205− allTypeClassChildDecls =
206− decls
207− |> mapMaybe (\d -> (d,) <$> typeClassConstraintFor d)
208− |> concatMap (\(d, constr) ->
209− map (declTitle d, constr,)
210− (declChildren d))
211−
212− matchesIdent cdecl =
213− cdeclTitle cdecl == P.showIdent ident
214−
215− matchesAndIsTypeClassMember =
216− uncurry (&&) . (matchesIdent &&& isTypeClassMember)
217−
218− in
219− case filter (matchesAndIsTypeClassMember . thd) allTypeClassChildDecls of
220− [r'] ->
221− pure (importedFrom, [Left r'])
222− other ->
223− errOther other
224− other -> do
225− errOther other
226−
227− where
228− thd :: (a, b, c) -> c
229− thd (_, _, x) = x
230−
231−-- |
232−-- Extract a particular type declaration. For data declarations, constructors
233−-- are only included in the output if they are listed in the arguments.
234−--
235−lookupTypeDeclaration ::
236− (Applicative m,
237− MonadState (Map P.ModuleName Module) m,
238− MonadReader P.ModuleName m) =>
239− P.ModuleName ->
240− P.ProperName 'P.TypeName ->
241− m (P.ModuleName, [Declaration])
242−lookupTypeDeclaration importedFrom ty = do
243− decls <- lookupModuleDeclarations "lookupTypeDeclaration" importedFrom
244− let
245− ds = filter (\d -> declTitle d == P.runProperName ty && isType d) decls
246− case ds of
247− [d] ->
248− pure (importedFrom, [d])
249− other ->
250− internalErrorInModule
251− ("lookupTypeDeclaration: unexpected result: " ++ show other)
252−
253−lookupTypeClassDeclaration ::
254− (Applicative m,
255− MonadState (Map P.ModuleName Module) m,
256− MonadReader P.ModuleName m) =>
257− P.ModuleName ->
258− P.ProperName 'P.ClassName ->
259− m (P.ModuleName, [Declaration])
260−lookupTypeClassDeclaration importedFrom tyClass = do
261− decls <- lookupModuleDeclarations "lookupTypeClassDeclaration" importedFrom
262− let
263− ds = filter (\d -> declTitle d == P.runProperName tyClass
264− && isTypeClass d)
265− decls
266− case ds of
267− [d] ->
268− pure (importedFrom, [d])
269− other ->
270− internalErrorInModule
271− ("lookupTypeClassDeclaration: unexpected result: "
272− ++ (unlines . map show) other)
273−
274−-- |
275−-- Get the full list of declarations for a particular module out of the
276−-- state, or raise an internal error if it is not there.
277−--
278−lookupModuleDeclarations ::
279− (Applicative m,
280− MonadState (Map P.ModuleName Module) m,
281− MonadReader P.ModuleName m) =>
282− String ->
283− P.ModuleName ->
284− m [Declaration]
285−lookupModuleDeclarations definedIn moduleName = do
286− mmdl <- gets (Map.lookup moduleName)
287− case mmdl of
288− Nothing ->
289− internalErrorInModule
290− (definedIn ++ ": module missing: "
291− ++ P.runModuleName moduleName)
292− Just mdl ->
293− pure (allDeclarations mdl)
294−
295−handleTypeClassMembers ::
296− (Functor m, Applicative m,
297− MonadReader P.ModuleName m) =>
298− Map P.ModuleName [Either (String, P.Constraint, ChildDeclaration) Declaration] ->
299− Map P.ModuleName [Declaration] ->
300− m (Map P.ModuleName [Declaration], Map P.ModuleName [Declaration])
301−handleTypeClassMembers valsAndMembers typeClasses =
302− let
303− moduleEnvs =
304− Map.unionWith (<>)
305− (fmap valsAndMembersToEnv valsAndMembers)
306− (fmap typeClassesToEnv typeClasses)
307− in
308− moduleEnvs
309− |> traverse handleEnv
310− |> fmap splitMap
311−
312−valsAndMembersToEnv ::
313− [Either (String, P.Constraint, ChildDeclaration) Declaration] -> TypeClassEnv
314−valsAndMembersToEnv xs =
315− let (envUnhandledMembers, envValues) = partitionEithers xs
316− envTypeClasses = []
317− in TypeClassEnv{..}
318−
319−typeClassesToEnv :: [Declaration] -> TypeClassEnv
320−typeClassesToEnv classes =
321− TypeClassEnv
322− { envUnhandledMembers = []
323− , envValues = []
324− , envTypeClasses = classes
325− }
326−
327−-- |
328−-- An intermediate data type, used for either moving type class members under
329−-- their parent type classes, or promoting them to normal Declaration values
330−-- if their parent type class has not been re-exported.
331−--
332−data TypeClassEnv = TypeClassEnv
333− { -- |
334− -- Type class members which have not yet been dealt with. The String is the
335− -- name of the type class they belong to, and the constraint is used to
336− -- make sure that they have the correct type if they get promoted.
337− --
338− envUnhandledMembers :: [(String, P.Constraint, ChildDeclaration)]
339− -- |
340− -- A list of normal value declarations. Type class members will be added to
341− -- this list if their parent type class is not available.
342− --
343− , envValues :: [Declaration]
344− -- |
345− -- A list of type class declarations. Type class members will be added to
346− -- their parents in this list, if they exist.
347− --
348− , envTypeClasses :: [Declaration]
349− }
350− deriving (Show)
351−
352−instance Monoid TypeClassEnv where
353− mempty =
354− TypeClassEnv mempty mempty mempty
355− mappend (TypeClassEnv a1 b1 c1)
356− (TypeClassEnv a2 b2 c2) =
357− TypeClassEnv (a1 <> a2) (b1 <> b2) (c1 <> c2)
358−
359−-- |
360−-- Take a TypeClassEnv and handle all of the type class members in it, either
361−-- adding them to their parent classes, or promoting them to normal Declaration
362−-- values.
363−--
364−-- Returns a tuple of (values, type classes).
365−--
366−handleEnv ::
367− (Functor m, Applicative m,
368− MonadReader P.ModuleName m) =>
369− TypeClassEnv ->
370− m ([Declaration], [Declaration])
371−handleEnv TypeClassEnv{..} =
372− envUnhandledMembers
373− |> foldM go (envValues, mkMap envTypeClasses)
374− |> fmap (second Map.elems)
375−
376− where
377− mkMap =
378− Map.fromList . map (declTitle &&& id)
379−
380− go (values, tcs) (title, constraint, childDecl) =
381− case Map.lookup title tcs of
382− Just _ ->
383− -- Leave the state unchanged; if the type class is there, the child
384− -- will be too.
385− pure (values, tcs)
386− Nothing -> do
387− c <- promoteChild constraint childDecl
388− pure (c : values, tcs)
389−
390− promoteChild constraint ChildDeclaration{..} =
391− case cdeclInfo of
392− ChildTypeClassMember typ ->
393− pure $ Declaration
394− { declTitle = cdeclTitle
395− , declComments = cdeclComments
396− , declSourceSpan = cdeclSourceSpan
397− , declChildren = []
398− , declFixity = Nothing
399− , declInfo = ValueDeclaration (addConstraint constraint typ)
400− }
401− _ ->
402− internalErrorInModule
403− ("handleEnv: Bad child declaration passed to promoteChild: "
404− ++ cdeclTitle)
405−
406− addConstraint constraint =
407− P.quantify . P.moveQuantifiersToFront . P.ConstrainedType [constraint]
408−
409−splitMap :: (Ord k) => Map k (v1, v2) -> (Map k v1, Map k v2)
410−splitMap = foldl go (Map.empty, Map.empty) . Map.toList
411− where
412− go (m1, m2) (k, (v1, v2)) =
413− (Map.insert k v1 m1, Map.insert k v2 m2)
414−
415−-- |
416−-- Given a list of exported constructor names, remove any data constructor
417−-- names in the provided Map of declarations which are not in the list.
418−--
419−filterDataConstructors ::
420− [P.ProperName 'P.ConstructorName] ->
421− Map P.ModuleName [Declaration] ->
422− Map P.ModuleName [Declaration]
423−filterDataConstructors =
424− filterExportedChildren isDataConstructor P.runProperName
425−
426−-- |
427−-- Given a list of exported type class member names, remove any data
428−-- type class member names in the provided Map of declarations which are not in
429−-- the list.
430−--
431−filterTypeClassMembers ::
432− [P.Ident] ->
433− Map P.ModuleName [Declaration] ->
434− Map P.ModuleName [Declaration]
435−filterTypeClassMembers =
436− filterExportedChildren isTypeClassMember P.showIdent
437−
438−filterExportedChildren ::
439− (Functor f) =>
440− (ChildDeclaration -> Bool) ->
441− (name -> String) ->
442− [name] ->
443− f [Declaration] ->
444− f [Declaration]
445−filterExportedChildren isTargetedKind runName expNames =
446− fmap filterDecls
447− where
448− filterDecls =
449− map (filterChildren (\c -> not (isTargetedKind c) ||
450− cdeclTitle c `elem` expNames'))
451−
452− expNames' = map runName expNames
453−
454−allDeclarations :: Module -> [Declaration]
455−allDeclarations Module{..} =
456− modDeclarations ++ concatMap snd modReExports
457−
458−(|>) :: a -> (a -> b) -> b
459−x |> f = f x
460−
461−internalError :: String -> a
462−internalError = P.internalError . ("Docs.Convert.ReExports: " ++)
463−
464−internalErrorInModule ::
465− (MonadReader P.ModuleName m) =>
466− String ->
467− m a
468−internalErrorInModule msg = do
469− mn <- ask
470− internalError
471− ("while collecting re-exports for module: " ++ P.runModuleName mn ++
472− ", " ++ msg)
473−
474−-- |
475−-- If the provided Declaration is a TypeClassDeclaration, construct an
476−-- appropriate Constraint for use with the types of its members.
477−--
478−typeClassConstraintFor :: Declaration -> Maybe P.Constraint
479−typeClassConstraintFor Declaration{..} =
480− case declInfo of
481− TypeClassDeclaration tyArgs _ ->
482− Just (P.Qualified Nothing (P.ProperName declTitle), mkConstraint tyArgs)
483− _ ->
484− Nothing
485− where
486− mkConstraint = map (P.TypeVar . fst)
src/Language/PureScript/Docs/Convert/Single.hsdeleted−236
@@ -1,236 +0,0 @@
1−{-# LANGUAGE TupleSections #-}
2−{-# LANGUAGE OverloadedStrings #-}
3−{-# LANGUAGE RecordWildCards #-}
4−{-# LANGUAGE ViewPatterns #-}
5−{-# LANGUAGE FlexibleContexts #-}
6−
7−module Language.PureScript.Docs.Convert.Single
8− ( convertSingleModule
9− , collectBookmarks
10− ) where
11−
12−import Prelude ()
13−import Prelude.Compat
14−import Data.Maybe (catMaybes)
15−
16−import Control.Monad
17−import Control.Category ((>>>))
18−import Data.Maybe (mapMaybe, isNothing)
19−import Data.Either
20−import Data.List (nub, isPrefixOf, isSuffixOf)
21−
22−import qualified Language.PureScript as P
23−
24−import Language.PureScript.Docs.Types
25−
26−-- |
27−-- Convert a single Module, but ignore re-exports; any re-exported types or
28−-- values will not appear in the result.
29−--
30−convertSingleModule :: P.Module -> Module
31−convertSingleModule m@(P.Module _ coms moduleName _ _) =
32− Module moduleName comments (declarations m) []
33− where
34− comments = convertComments coms
35− declarations =
36− P.exportedDeclarations
37− >>> mapMaybe (\d -> getDeclarationTitle d >>= convertDeclaration d)
38− >>> augmentDeclarations
39− >>> map addDefaultFixity
40−
41−-- | The data type for an intermediate stage which we go through during
42−-- converting.
43−--
44−-- In the first pass, we take all top level declarations in the module, and
45−-- collect other information which will later be used to augment the top level
46−-- declarations. These two situation correspond to the Right and Left
47−-- constructors, respectively.
48−--
49−-- In the second pass, we go over all of the Left values and augment the
50−-- relevant declarations, leaving only the augmented Right values.
51−--
52−-- Note that in the Left case, we provide a [String] as well as augment
53−-- information. The [String] value should be a list of titles of declarations
54−-- that the augmentation should apply to. For example, for a type instance
55−-- declaration, that would be any types or type classes mentioned in the
56−-- instance. For a fixity declaration, it would be just the relevant operator's
57−-- name.
58−type IntermediateDeclaration
59− = Either ([String], DeclarationAugment) Declaration
60−
61−-- | Some data which will be used to augment a Declaration in the
62−-- output.
63−--
64−-- The AugmentChild constructor allows us to move all children under their
65−-- respective parents. It is only necessary for type instance declarations,
66−-- since they appear at the top level in the AST, and since they might need to
67−-- appear as children in two places (for example, if a data type defined in a
68−-- module is an instance of a type class also defined in that module).
69−--
70−-- The AugmentFixity constructor allows us to augment operator definitions
71−-- with their associativity and precedence.
72−data DeclarationAugment
73− = AugmentChild ChildDeclaration
74− | AugmentFixity P.Fixity
75−
76−-- | Augment top-level declarations; the second pass. See the comments under
77−-- the type synonym IntermediateDeclaration for more information.
78−augmentDeclarations :: [IntermediateDeclaration] -> [Declaration]
79−augmentDeclarations (partitionEithers -> (augments, toplevels)) =
80− foldl go toplevels augments
81− where
82− go ds (parentTitles, a) =
83− map (\d ->
84− if declTitle d `elem` parentTitles
85− then augmentWith a d
86− else d) ds
87−
88− augmentWith a d =
89− case a of
90− AugmentChild child ->
91− d { declChildren = declChildren d ++ [child] }
92− AugmentFixity fixity ->
93− d { declFixity = Just fixity }
94−
95−-- | Add the default operator fixity for operators which do not have associated
96−-- fixity declarations.
97−--
98−-- TODO: This may no longer be necessary after issue 806 is resolved, hopefully
99−-- in 0.9.
100−addDefaultFixity :: Declaration -> Declaration
101−addDefaultFixity decl@Declaration{..}
102− | isOp declTitle && isNothing declFixity =
103− decl { declFixity = Just defaultFixity }
104− | otherwise =
105− decl
106− where
107− isOp :: String -> Bool
108− isOp str = "(" `isPrefixOf` str && ")" `isSuffixOf` str
109− defaultFixity = P.Fixity P.Infixl (-1)
110−
111−getDeclarationTitle :: P.Declaration -> Maybe String
112−getDeclarationTitle (P.ValueDeclaration name _ _ _) = Just (P.showIdent name)
113−getDeclarationTitle (P.ExternDeclaration name _) = Just (P.showIdent name)
114−getDeclarationTitle (P.DataDeclaration _ name _ _) = Just (P.runProperName name)
115−getDeclarationTitle (P.ExternDataDeclaration name _) = Just (P.runProperName name)
116−getDeclarationTitle (P.TypeSynonymDeclaration name _ _) = Just (P.runProperName name)
117−getDeclarationTitle (P.TypeClassDeclaration name _ _ _) = Just (P.runProperName name)
118−getDeclarationTitle (P.TypeInstanceDeclaration name _ _ _ _) = Just (P.showIdent name)
119−getDeclarationTitle (P.FixityDeclaration _ name _) = Just ("(" ++ name ++ ")")
120−getDeclarationTitle (P.PositionedDeclaration _ _ d) = getDeclarationTitle d
121−getDeclarationTitle _ = Nothing
122−
123−-- | Create a basic Declaration value.
124−mkDeclaration :: String -> DeclarationInfo -> Declaration
125−mkDeclaration title info =
126− Declaration { declTitle = title
127− , declComments = Nothing
128− , declSourceSpan = Nothing
129− , declChildren = []
130− , declFixity = Nothing
131− , declInfo = info
132− }
133−
134−basicDeclaration :: String -> DeclarationInfo -> Maybe IntermediateDeclaration
135−basicDeclaration title info = Just $ Right $ mkDeclaration title info
136−
137−convertDeclaration :: P.Declaration -> String -> Maybe IntermediateDeclaration
138−convertDeclaration (P.ValueDeclaration _ _ _ (Right (P.TypedValue _ _ ty))) title =
139− basicDeclaration title (ValueDeclaration ty)
140−convertDeclaration (P.ValueDeclaration _ _ _ _) title =
141− -- If no explicit type declaration was provided, insert a wildcard, so that
142− -- the actual type will be added during type checking.
143− basicDeclaration title (ValueDeclaration P.TypeWildcard)
144−convertDeclaration (P.ExternDeclaration _ ty) title =
145− basicDeclaration title (ValueDeclaration ty)
146−convertDeclaration (P.DataDeclaration dtype _ args ctors) title =
147− Just (Right (mkDeclaration title info) { declChildren = children })
148− where
149− info = DataDeclaration dtype args
150− children = map convertCtor ctors
151− convertCtor (ctor', tys) =
152− ChildDeclaration (P.runProperName ctor') Nothing Nothing (ChildDataConstructor tys)
153−convertDeclaration (P.ExternDataDeclaration _ kind') title =
154− basicDeclaration title (ExternDataDeclaration kind')
155−convertDeclaration (P.TypeSynonymDeclaration _ args ty) title =
156− basicDeclaration title (TypeSynonymDeclaration args ty)
157−convertDeclaration (P.TypeClassDeclaration _ args implies ds) title =
158− Just (Right (mkDeclaration title info) { declChildren = children })
159− where
160− info = TypeClassDeclaration args implies
161− children = map convertClassMember ds
162− convertClassMember (P.PositionedDeclaration _ _ d) =
163− convertClassMember d
164− convertClassMember (P.TypeDeclaration ident' ty) =
165− ChildDeclaration (P.showIdent ident') Nothing Nothing (ChildTypeClassMember ty)
166− convertClassMember _ =
167− P.internalError "convertDeclaration: Invalid argument to convertClassMember."
168−convertDeclaration (P.TypeInstanceDeclaration _ constraints className tys _) title =
169− Just (Left (classNameString : typeNameStrings, AugmentChild childDecl))
170− where
171− classNameString = unQual className
172− typeNameStrings = nub (concatMap (P.everythingOnTypes (++) extractProperNames) tys)
173− unQual x = let (P.Qualified _ y) = x in P.runProperName y
174−
175− extractProperNames (P.TypeConstructor n) = [unQual n]
176− extractProperNames _ = []
177−
178− childDecl = ChildDeclaration title Nothing Nothing (ChildInstance constraints classApp)
179− classApp = foldl P.TypeApp (P.TypeConstructor (fmap P.coerceProperName className)) tys
180−convertDeclaration (P.FixityDeclaration fixity _ Nothing) title =
181− Just (Left ([title], AugmentFixity fixity))
182−convertDeclaration (P.FixityDeclaration fixity _ (Just alias)) title =
183− Just $ Right $ (mkDeclaration title (AliasDeclaration alias fixity)) { declFixity = Just fixity }
184−convertDeclaration (P.PositionedDeclaration srcSpan com d') title =
185− fmap (addComments . addSourceSpan) (convertDeclaration d' title)
186− where
187− addComments (Right d) =
188− Right (d { declComments = convertComments com })
189− addComments (Left augment) =
190− Left (withAugmentChild (\d -> d { cdeclComments = convertComments com })
191− augment)
192−
193− addSourceSpan (Right d) =
194− Right (d { declSourceSpan = Just srcSpan })
195− addSourceSpan (Left augment) =
196− Left (withAugmentChild (\d -> d { cdeclSourceSpan = Just srcSpan })
197− augment)
198−
199− withAugmentChild f (t, a) =
200− case a of
201− AugmentChild d -> (t, AugmentChild (f d))
202− _ -> (t, a)
203−convertDeclaration _ _ = Nothing
204−
205−convertComments :: [P.Comment] -> Maybe String
206−convertComments cs = do
207− let raw = concatMap toLines cs
208− let docs = catMaybes (map stripPipe raw)
209− guard (not (null docs))
210− pure (unlines docs)
211−
212− where
213− toLines (P.LineComment s) = [s]
214− toLines (P.BlockComment s) = lines s
215−
216− stripPipe s' =
217− case dropWhile (== ' ') s' of
218− ('|':' ':s) ->
219− Just s
220− ('|':s) ->
221− Just s
222− _ ->
223− Nothing
224−
225−-- | Go through a PureScript module and extract a list of Bookmarks; references
226−-- to data types or values, to be used as a kind of index. These are used for
227−-- generating links in the HTML documentation, for example.
228−collectBookmarks :: InPackage P.Module -> [Bookmark]
229−collectBookmarks (Local m) = map Local (collectBookmarks' m)
230−collectBookmarks (FromDep pkg m) = map (FromDep pkg) (collectBookmarks' m)
231−
232−collectBookmarks' :: P.Module -> [(P.ModuleName, String)]
233−collectBookmarks' m =
234− map (P.getModuleName m, )
235− (mapMaybe getDeclarationTitle
236− (P.exportedDeclarations m))
src/Language/PureScript/Docs/ParseAndBookmark.hsdeleted−100
@@ -1,100 +0,0 @@
1−{-# LANGUAGE TupleSections #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−
4−module Language.PureScript.Docs.ParseAndBookmark
5− ( parseAndBookmark
6− ) where
7−
8−import Prelude ()
9−import Prelude.Compat
10−
11−import qualified Data.Map as M
12−import Control.Arrow (first)
13−
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 Language.PureScript.Docs.Types
21−import Language.PureScript.Docs.Convert (collectBookmarks)
22−
23−-- |
24−-- Given:
25−--
26−-- * A list of local source files
27−-- * A list of source files from external dependencies, together with their
28−-- package names
29−--
30−-- This function does the following:
31−--
32−-- * Parse all of the input and dependency source files
33−-- * Associate each dependency module with its package name, thereby
34−-- distinguishing these from local modules
35−-- * Collect a list of bookmarks from the whole set of source files
36−-- * Return the parsed modules and the bookmarks
37−parseAndBookmark ::
38− (Functor m, Applicative m, MonadError P.MultipleErrors m, MonadIO m) =>
39− [FilePath]
40− -> [(PackageName, FilePath)]
41− -> m ([InPackage P.Module], [Bookmark])
42−parseAndBookmark inputFiles depsFiles = do
43− inputFiles' <- traverse (parseAs Local) inputFiles
44− depsFiles' <- traverse (\(pkgName, f) -> parseAs (FromDep pkgName) f) depsFiles
45−
46− addBookmarks <$> parseFiles (inputFiles' ++ depsFiles')
47−
48−parseFiles ::
49− (MonadError P.MultipleErrors m, MonadIO m) =>
50− [(FileInfo, FilePath)]
51− -> m [(FileInfo, P.Module)]
52−parseFiles =
53− throwLeft . P.parseModulesFromFiles fileInfoToString
54−
55−addBookmarks ::
56− [(FileInfo, P.Module)]
57− -> ([InPackage P.Module], [Bookmark])
58−addBookmarks msInfo =
59− let
60− msDeps = getDepsModuleNames (map (\(fp, m) -> (,m) <$> fp) msInfo)
61− msPackages = map (addPackage msDeps . snd) msInfo
62− bookmarks = concatMap collectBookmarks msPackages
63− in
64− (msPackages, bookmarks)
65−
66−throwLeft :: (MonadError l m) => Either l r -> m r
67−throwLeft = either throwError return
68−
69−-- | Specifies whether a PureScript source file is considered as:
70−--
71−-- 1) with the `Local` constructor, a target source file, i.e., we want to see
72−-- its modules in the output
73−-- 2) with the `FromDep` constructor, a dependencies source file, i.e. we do
74−-- not want its modules in the output; it is there to enable desugaring, and
75−-- to ensure that links between modules are constructed correctly.
76−type FileInfo = InPackage FilePath
77−
78−fileInfoToString :: FileInfo -> FilePath
79−fileInfoToString (Local fn) = fn
80−fileInfoToString (FromDep _ fn) = fn
81−
82−parseFile :: FilePath -> IO (FilePath, String)
83−parseFile input' = (,) input' <$> readFile input'
84−
85−parseAs :: (Functor m, MonadIO m) => (FilePath -> a) -> FilePath -> m (a, String)
86−parseAs g = fmap (first g) . liftIO . parseFile
87−
88−getDepsModuleNames :: [InPackage (FilePath, P.Module)] -> M.Map P.ModuleName PackageName
89−getDepsModuleNames = foldl go M.empty
90− where
91− go deps p = deps # case p of
92− Local _ -> id
93− FromDep pkgName (_, m) -> M.insert (P.getModuleName m) pkgName
94− (#) = flip ($)
95−
96−addPackage :: M.Map P.ModuleName PackageName -> P.Module -> InPackage P.Module
97−addPackage depsModules m =
98− case M.lookup (P.getModuleName m) depsModules of
99− Just pkgName -> FromDep pkgName m
100− Nothing -> Local m
src/Language/PureScript/Docs/Render.hsdeleted−134
@@ -1,134 +0,0 @@
1−{-# LANGUAGE RecordWildCards #-}
2−
3−-- | Functions for creating `RenderedCode` values from data types in
4−-- Language.PureScript.Docs.Types.
5−--
6−-- These functions are the ones that are used in markdown/html documentation
7−-- generation, but the intention is that you are able to supply your own
8−-- instead if necessary. For example, the Hoogle input file generator
9−-- substitutes some of these
10−
11−module Language.PureScript.Docs.Render where
12−
13−import Data.Maybe (maybeToList)
14−import Data.Monoid ((<>))
15−import qualified Language.PureScript as P
16−
17−import Language.PureScript.Docs.Types
18−import Language.PureScript.Docs.RenderedCode
19−import Language.PureScript.Docs.Utils.MonoidExtras
20−
21−renderDeclaration :: Declaration -> RenderedCode
22−renderDeclaration = renderDeclarationWithOptions defaultRenderTypeOptions
23−
24−renderDeclarationWithOptions :: RenderTypeOptions -> Declaration -> RenderedCode
25−renderDeclarationWithOptions opts Declaration{..} =
26− mintersperse sp $ case declInfo of
27− ValueDeclaration ty ->
28− [ ident declTitle
29− , syntax "::"
30− , renderType' ty
31− ]
32− DataDeclaration dtype args ->
33− [ keyword (P.showDataDeclType dtype)
34− , renderType' (typeApp declTitle args)
35− ]
36− ExternDataDeclaration kind' ->
37− [ keywordData
38− , renderType' (P.TypeConstructor (notQualified declTitle))
39− , syntax "::"
40− , renderKind kind'
41− ]
42− TypeSynonymDeclaration args ty ->
43− [ keywordType
44− , renderType' (typeApp declTitle args)
45− , syntax "="
46− , renderType' ty
47− ]
48− TypeClassDeclaration args implies ->
49− [ keywordClass ]
50− ++ maybeToList superclasses
51− ++ [renderType' (typeApp declTitle args)]
52− ++ [keywordWhere | any isTypeClassMember declChildren]
53−
54− where
55− superclasses
56− | null implies = Nothing
57− | otherwise = Just $
58− syntax "("
59− <> mintersperse (syntax "," <> sp) (map renderConstraint implies)
60− <> syntax ")" <> sp <> syntax "<="
61− AliasDeclaration for (P.Fixity associativity precedence) ->
62− [ keywordFixity associativity
63− , syntax $ show precedence
64− , ident $
65− either
66− (P.showQualified P.runIdent . dequalifyCurrentModule)
67− (P.showQualified P.runProperName . dequalifyCurrentModule)
68− for
69− , keyword "as"
70− , ident . tail . init $ declTitle
71− ]
72−
73− where
74− renderType' = renderTypeWithOptions opts
75− dequalifyCurrentModule (P.Qualified mn a)
76− | mn == currentModule opts = P.Qualified Nothing a
77− | otherwise = P.Qualified mn a
78−
79−renderChildDeclaration :: ChildDeclaration -> RenderedCode
80−renderChildDeclaration = renderChildDeclarationWithOptions defaultRenderTypeOptions
81−
82−renderChildDeclarationWithOptions :: RenderTypeOptions -> ChildDeclaration -> RenderedCode
83−renderChildDeclarationWithOptions opts ChildDeclaration{..} =
84− mintersperse sp $ case cdeclInfo of
85− ChildInstance constraints ty ->
86− maybeToList (renderConstraints constraints) ++ [ renderType' ty ]
87− ChildDataConstructor args ->
88− [ renderType' typeApp' ]
89− where
90− typeApp' = foldl P.TypeApp ctor' args
91− ctor' = P.TypeConstructor (notQualified cdeclTitle)
92−
93− ChildTypeClassMember ty ->
94− [ ident cdeclTitle
95− , syntax "::"
96− , renderType' ty
97− ]
98− where
99− renderType' = renderTypeWithOptions opts
100−
101−renderConstraint :: P.Constraint -> RenderedCode
102−renderConstraint = renderConstraintWithOptions defaultRenderTypeOptions
103−
104−renderConstraintWithOptions :: RenderTypeOptions -> P.Constraint -> RenderedCode
105−renderConstraintWithOptions opts (pn, tys) =
106− renderTypeWithOptions opts $ foldl P.TypeApp (P.TypeConstructor (fmap P.coerceProperName pn)) tys
107−
108−renderConstraints :: [P.Constraint] -> Maybe RenderedCode
109−renderConstraints = renderConstraintsWithOptions defaultRenderTypeOptions
110−
111−renderConstraintsWithOptions :: RenderTypeOptions -> [P.Constraint] -> Maybe RenderedCode
112−renderConstraintsWithOptions opts constraints
113− | null constraints = Nothing
114− | otherwise = Just $
115− syntax "("
116− <> renderedConstraints
117− <> syntax ")" <> sp <> syntax "=>"
118− where
119− renderedConstraints =
120− mintersperse (syntax "," <> sp)
121− (map (renderConstraintWithOptions opts) constraints)
122−
123−notQualified :: String -> P.Qualified (P.ProperName a)
124−notQualified = P.Qualified Nothing . P.ProperName
125−
126−typeApp :: String -> [(String, Maybe P.Kind)] -> P.Type
127−typeApp title typeArgs =
128− foldl P.TypeApp
129− (P.TypeConstructor (notQualified title))
130− (map toTypeVar typeArgs)
131−
132−toTypeVar :: (String, Maybe P.Kind) -> P.Type
133−toTypeVar (s, Nothing) = P.TypeVar s
134−toTypeVar (s, Just k) = P.KindedType (P.TypeVar s) k
src/Language/PureScript/Docs/RenderedCode.hsdeleted−11
@@ -1,11 +0,0 @@
1−
2−-- | Data types and functions for representing a simplified form of PureScript
3−-- code, intended for use in e.g. HTML documentation.
4−
5−module Language.PureScript.Docs.RenderedCode (
6− module RenderedCode
7−) where
8−
9−import Language.PureScript.Docs.RenderedCode.Types as RenderedCode
10−import Language.PureScript.Docs.RenderedCode.Render as RenderedCode
11−
src/Language/PureScript/Docs/RenderedCode/Render.hsdeleted−188

This diff is too big to show here.

src/Language/PureScript/Docs/RenderedCode/Types.hsdeleted−197

This diff is too big to show here.

src/Language/PureScript/Docs/Types.hsdeleted−590

This diff is too big to show here.

src/Language/PureScript/Docs/Utils/MonoidExtras.hsdeleted−9

This diff is too big to show here.

src/Language/PureScript/Environment.hsdeleted−274

This diff is too big to show here.

src/Language/PureScript/Errors.hsdeleted−1322

This diff is too big to show here.

src/Language/PureScript/Externs.hsdeleted−207

This diff is too big to show here.

src/Language/PureScript/Ide.hsdeleted−199

This diff is too big to show here.

src/Language/PureScript/Ide/CaseSplit.hsdeleted−157

This diff is too big to show here.

src/Language/PureScript/Ide/CodecJSON.hsdeleted−13

This diff is too big to show here.

src/Language/PureScript/Ide/Command.hsdeleted−101

This diff is too big to show here.

src/Language/PureScript/Ide/Completion.hsdeleted−35

This diff is too big to show here.

src/Language/PureScript/Ide/Error.hsdeleted−43

This diff is too big to show here.

src/Language/PureScript/Ide/Externs.hsdeleted−102

This diff is too big to show here.

src/Language/PureScript/Ide/Filter.hsdeleted−110

This diff is too big to show here.

src/Language/PureScript/Ide/Matcher.hsdeleted−100

This diff is too big to show here.

src/Language/PureScript/Ide/Pursuit.hsdeleted−65

This diff is too big to show here.

src/Language/PureScript/Ide/Reexports.hsdeleted−73

This diff is too big to show here.

src/Language/PureScript/Ide/SourceFile.hsdeleted−106

This diff is too big to show here.

src/Language/PureScript/Ide/State.hsdeleted−80

This diff is too big to show here.

src/Language/PureScript/Ide/Types.hsdeleted−240

This diff is too big to show here.

src/Language/PureScript/Ide/Watcher.hsdeleted−40

This diff is too big to show here.

src/Language/PureScript/Kinds.hsdeleted−57

This diff is too big to show here.

src/Language/PureScript/Linter.hsdeleted−114

This diff is too big to show here.

src/Language/PureScript/Linter/Exhaustive.hsdeleted−313

This diff is too big to show here.

src/Language/PureScript/Linter/Imports.hsdeleted−332

This diff is too big to show here.

src/Language/PureScript/Make.hsdeleted−397

This diff is too big to show here.

src/Language/PureScript/ModuleDependencies.hsdeleted−84

This diff is too big to show here.

src/Language/PureScript/Names.hsdeleted−143

This diff is too big to show here.

src/Language/PureScript/Options.hsdeleted−52

This diff is too big to show here.

src/Language/PureScript/Parser.hsdeleted−36

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Pretty.hsdeleted−29

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Publish.hsdeleted−388

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Renamer.hsdeleted−197

This diff is too big to show here.

src/Language/PureScript/Sugar.hsdeleted−78

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Sugar/Operators/Binders.hsdeleted−43

This diff is too big to show here.

src/Language/PureScript/Sugar/Operators/Common.hsdeleted−53

This diff is too big to show here.

src/Language/PureScript/Sugar/Operators/Expr.hsdeleted−52

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Traversals.hsdeleted−42

This diff is too big to show here.

src/Language/PureScript/TypeChecker.hsdeleted−464

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/TypeClassDictionaries.hsdeleted−45

This diff is too big to show here.

src/Language/PureScript/Types.hsdeleted−302

This diff is too big to show here.

src/System/IO/UTF8.hsdeleted−25

This diff is too big to show here.

src/Tests.hsnew file+141

This diff is too big to show here.

stack-lts-2.yamldeleted−13

This diff is too big to show here.

stack-lts-3.yamldeleted−6

This diff is too big to show here.

stack-lts-5.yamldeleted−5

This diff is too big to show here.

stack-nightly.yamldeleted−5

This diff is too big to show here.

stack.nixnew file+23

This diff is too big to show here.

stack.yamlmode 120000 → 100644+24−1

This diff is too big to show here.

support/ffi-loader.gonew file+30

This diff is too big to show here.

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

This diff is too big to show here.

support/go.mod.outputnew file+2

This diff is too big to show here.

support/go.mod.workingnew file+1

This diff is too big to show here.

test/Spec.hsnew file+2

This diff is too big to show here.

tests/Language/PureScript/Ide/FilterSpec.hsdeleted−59

This diff is too big to show here.

tests/Language/PureScript/Ide/MatcherSpec.hsdeleted−31

This diff is too big to show here.

tests/Language/PureScript/Ide/ReexportsSpec.hsdeleted−77

This diff is too big to show here.

tests/Language/PureScript/IdeSpec.hsdeleted−35

This diff is too big to show here.

tests/Main.hsdeleted−49

This diff is too big to show here.

tests/PscIdeSpec.hsdeleted−1

This diff is too big to show here.

tests/TestCompiler.hsdeleted−194

This diff is too big to show here.

tests/TestDocs.hsdeleted−269

This diff is too big to show here.

tests/TestPscIde.hsdeleted−7

This diff is too big to show here.

tests/TestPscPublish.hsdeleted−66

This diff is too big to show here.

tests/TestPsci.hsdeleted−159

This diff is too big to show here.

tests/TestUtils.hsdeleted−65

This diff is too big to show here.

tests/support/.gitignoredeleted−2

This diff is too big to show here.

tests/support/bower.jsondeleted−11

This diff is too big to show here.

tests/support/flattened/Control-Monad-Eff-Class.pursdeleted−24

This diff is too big to show here.

tests/support/flattened/Control-Monad-Eff-Console.jsdeleted−18

This diff is too big to show here.

tests/support/flattened/Control-Monad-Eff-Console.pursdeleted−18

This diff is too big to show here.

tests/support/flattened/Control-Monad-Eff-Unsafe.jsdeleted−8

This diff is too big to show here.

tests/support/flattened/Control-Monad-Eff-Unsafe.pursdeleted−10

This diff is too big to show here.

tests/support/flattened/Control-Monad-Eff.jsdeleted−62

This diff is too big to show here.

tests/support/flattened/Control-Monad-Eff.pursdeleted−67

This diff is too big to show here.

tests/support/flattened/Control-Monad-ST.jsdeleted−38

This diff is too big to show here.

tests/support/flattened/Control-Monad-ST.pursdeleted−42

This diff is too big to show here.

tests/support/flattened/Data-Function.jsdeleted−233

This diff is too big to show here.

tests/support/flattened/Data-Function.pursdeleted−113

This diff is too big to show here.

tests/support/flattened/Prelude.jsdeleted−228

This diff is too big to show here.

tests/support/flattened/Prelude.pursdeleted−872

This diff is too big to show here.

tests/support/flattened/Test-Assert.jsdeleted−27

This diff is too big to show here.

tests/support/flattened/Test-Assert.pursdeleted−46

This diff is too big to show here.

tests/support/package.jsondeleted−7

This diff is too big to show here.

tests/support/preludedeleted−1

This diff is too big to show here.

tests/support/psci/Sample.pursdeleted

No changes to the content.

tests/support/setup-win.cmddeleted−3

This diff is too big to show here.

tests/support/setup.jsdeleted−22

This diff is too big to show here.

travis/after.shdeleted−13

This diff is too big to show here.

travis/configure.shdeleted−17

This diff is too big to show here.

travis/test-install.shdeleted−18

This diff is too big to show here.