git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
swap
355eb9b1006 ahead, 0 behind
559 files changed+2701−37646
since splitsnapshots
unifiedsplit
.gitignore+4 .travis.yml−73 CONTRIBUTING.md−39 CONTRIBUTORS.md−76 ChangeLog.md+3 INSTALL.md−53 LICENSE+20−3554 README-go.md+48 README.md+32−20 Setup.hs−4 app/Main.hs+250 appveyor.yml−57 bundle/.gitignore−4 bundle/README−24 bundle/build-stack.sh−63 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−20 examples/docs/bower_components/purescript-prelude/src/Prelude.purs−8 examples/docs/src/Clash.purs−32 examples/docs/src/ConstrainedArgument.purs−9 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/TypeOpAliases.purs−18 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/ConstraintInference.purs−10 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/Generalization1.purs−11 examples/failing/Generalization2.purs−8 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/OperatorSections.purs−8 examples/failing/OrphanInstance.purs−12 examples/failing/OverlappingArguments.purs−6 examples/failing/OverlappingBinders.purs−9 examples/failing/OverlappingReExport.purs−10 examples/failing/OverlappingVars.purs−15 examples/failing/Rank2Types.purs−8 examples/failing/Reserved.purs−7 examples/failing/RowConstructors1.purs−9 examples/failing/RowConstructors2.purs−9 examples/failing/RowConstructors3.purs−9 examples/failing/SkolemEscape.purs−8 examples/failing/SkolemEscape2.purs−10 examples/failing/SuggestComposition.purs−7 examples/failing/Superclasses1.purs−14 examples/failing/Superclasses2.purs−13 examples/failing/Superclasses3.purs−8 examples/failing/Superclasses5.purs−26 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/TypeOperatorAliasNoExport.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/TypedHole.purs−9 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/1991.purs−20 examples/passing/2018.purs−25 examples/passing/2049.purs−13 examples/passing/652.purs−17 examples/passing/810.purs−13 examples/passing/862.purs−8 examples/passing/922.purs−20 examples/passing/Applicative.purs−16 examples/passing/ArrayType.purs−11 examples/passing/Auto.purs−15 examples/passing/AutoPrelude.purs−9 examples/passing/AutoPrelude2.purs−10 examples/passing/BindersInFunctions.purs−11 examples/passing/BindingGroups.purs−10 examples/passing/BlockString.purs−8 examples/passing/CaseInDo.purs−19 examples/passing/CaseInputWildcard.purs−18 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/ConstraintInference.purs−7 examples/passing/ContextSimplification.purs−13 examples/passing/DataAndType.purs−9 examples/passing/DctorOperatorAlias.purs−40 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/Generalization1.purs−10 examples/passing/Guards.purs−29 examples/passing/HoistError.purs−12 examples/passing/IfThenElseMaybe.purs−11 examples/passing/IfWildcard.purs−19 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−61 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−46 examples/passing/OperatorSections.purs−17 examples/passing/Operators.purs−99 examples/passing/OptimizerBug.purs−9 examples/passing/OptionalQualified.purs−12 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−12 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/TypeOperators.purs−34 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−116 license-generator/generate.hs−46 license-generator/header.txt−23 logo.png make_release_notes−2 package.yaml+86 psc-bundle/Main.hs−127 psc-bundle/README.md−18 psc-docs/Ctags.hs−13 psc-docs/Etags.hs−13 psc-docs/Main.hs−250 psc-docs/Tags.hs−18 psc-ide-client/Main.hs−56 psc-ide-server/Main.hs−173 psc-ide-server/PROTOCOL.md−525 psc-ide-server/README.md−40 psc-publish/Main.hs−50 psc/Main.hs−194 psci/PSCi.hs−372 psci/PSCi/Completion.hs−223 psci/PSCi/Directive.hs−119 psci/PSCi/IO.hs−68 psci/PSCi/Message.hs−53 psci/PSCi/Module.hs−107 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−378 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−14 src/Language/PureScript/AST/Binders.hs−81 src/Language/PureScript/AST/Declarations.hs−485 src/Language/PureScript/AST/Exported.hs−157 src/Language/PureScript/AST/Literals.hs−37 src/Language/PureScript/AST/Operators.hs−51 src/Language/PureScript/AST/SourcePos.hs−83 src/Language/PureScript/AST/Traversals.hs−591 src/Language/PureScript/Bundle.hs−605 src/Language/PureScript/CodeGen.hs−20 src/Language/PureScript/CodeGen/JS.hs−451 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−382 src/Language/PureScript/CoreFn.hs−15 src/Language/PureScript/CoreFn/Ann.hs−37 src/Language/PureScript/CoreFn/Binders.hs−42 src/Language/PureScript/CoreFn/Desugar.hs−278 src/Language/PureScript/CoreFn/Expr.hs−121 src/Language/PureScript/CoreFn/Meta.hs−40 src/Language/PureScript/CoreFn/Module.hs−31 src/Language/PureScript/CoreFn/Traversals.hs−75 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−195 src/Language/PureScript/Docs/Convert/ReExports.hs−496 src/Language/PureScript/Docs/Convert/Single.hs−236 src/Language/PureScript/Docs/ParseAndBookmark.hs−102 src/Language/PureScript/Docs/Render.hs−139 src/Language/PureScript/Docs/RenderedCode.hs−11 src/Language/PureScript/Docs/RenderedCode/Render.hs−211 src/Language/PureScript/Docs/RenderedCode/Types.hs−202 src/Language/PureScript/Docs/Types.hs−597 src/Language/PureScript/Docs/Utils/MonoidExtras.hs−9 src/Language/PureScript/Environment.hs−274 src/Language/PureScript/Errors.hs−1375 src/Language/PureScript/Errors/JSON.hs−88 src/Language/PureScript/Externs.hs−208 src/Language/PureScript/Ide.hs−245 src/Language/PureScript/Ide/CaseSplit.hs−162 src/Language/PureScript/Ide/Command.hs−157 src/Language/PureScript/Ide/Completion.hs−32 src/Language/PureScript/Ide/Error.hs−57 src/Language/PureScript/Ide/Externs.hs−115 src/Language/PureScript/Ide/Filter.hs−127 src/Language/PureScript/Ide/Imports.hs−354 src/Language/PureScript/Ide/Matcher.hs−131 src/Language/PureScript/Ide/Pursuit.hs−79 src/Language/PureScript/Ide/Rebuild.hs−85 src/Language/PureScript/Ide/Reexports.hs−91 src/Language/PureScript/Ide/SourceFile.hs−122 src/Language/PureScript/Ide/State.hs−98 src/Language/PureScript/Ide/Types.hs−238 src/Language/PureScript/Ide/Util.hs−65 src/Language/PureScript/Ide/Watcher.hs−48 src/Language/PureScript/Kinds.hs−57 src/Language/PureScript/Linter.hs−113 src/Language/PureScript/Linter/Exhaustive.hs−314 src/Language/PureScript/Linter/Imports.hs−344 src/Language/PureScript/Make.hs−472 src/Language/PureScript/ModuleDependencies.hs−96 src/Language/PureScript/Names.hs−143 src/Language/PureScript/Options.hs−49 src/Language/PureScript/Parser.hs−36 src/Language/PureScript/Parser/Common.hs−130 src/Language/PureScript/Parser/Declarations.hs−559 src/Language/PureScript/Parser/JS.hs−60 src/Language/PureScript/Parser/Kinds.hs−48 src/Language/PureScript/Parser/Lexer.hs−558 src/Language/PureScript/Parser/State.hs−30 src/Language/PureScript/Parser/Types.hs−124 src/Language/PureScript/Pretty.hs−29 src/Language/PureScript/Pretty/Common.hs−167 src/Language/PureScript/Pretty/JS.hs−323 src/Language/PureScript/Pretty/Kinds.hs−59 src/Language/PureScript/Pretty/Types.hs−161 src/Language/PureScript/Pretty/Values.hs−185 src/Language/PureScript/Publish.hs−409 src/Language/PureScript/Publish/BoxesHelpers.hs−41 src/Language/PureScript/Publish/ErrorsWarnings.hs−425 src/Language/PureScript/Publish/Utils.hs−38 src/Language/PureScript/Renamer.hs−197 src/Language/PureScript/Sugar.hs−77 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−413 src/Language/PureScript/Sugar/Names/Env.hs−279 src/Language/PureScript/Sugar/Names/Exports.hs−304 src/Language/PureScript/Sugar/Names/Imports.hs−325 src/Language/PureScript/Sugar/ObjectWildcards.hs−97 src/Language/PureScript/Sugar/Operators.hs−308 src/Language/PureScript/Sugar/Operators/Binders.hs−27 src/Language/PureScript/Sugar/Operators/Common.hs−84 src/Language/PureScript/Sugar/Operators/Expr.hs−48 src/Language/PureScript/Sugar/Operators/Types.hs−28 src/Language/PureScript/Sugar/TypeClasses.hs−334 src/Language/PureScript/Sugar/TypeClasses/Deriving.hs−425 src/Language/PureScript/Sugar/TypeDeclarations.hs−73 src/Language/PureScript/Traversals.hs−42 src/Language/PureScript/TypeChecker.hs−473 src/Language/PureScript/TypeChecker/Entailment.hs−217 src/Language/PureScript/TypeChecker/Kinds.hs−271 src/Language/PureScript/TypeChecker/Monad.hs−254 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−765 src/Language/PureScript/TypeChecker/Unify.hs−229 src/Language/PureScript/TypeClassDictionaries.hs−45 src/Language/PureScript/Types.hs−336 src/System/IO/UTF8.hs−25 src/Tests.hs+141 stack-lts-5.yaml−7 stack-nightly.yaml−6 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−63 tests/Language/PureScript/Ide/Imports/IntegrationSpec.hs−101 tests/Language/PureScript/Ide/ImportsSpec.hs−128 tests/Language/PureScript/Ide/Integration.hs−250 tests/Language/PureScript/Ide/MatcherSpec.hs−56 tests/Language/PureScript/Ide/RebuildSpec.hs−62 tests/Language/PureScript/Ide/ReexportsSpec.hs−81 tests/Language/PureScript/IdeSpec.hs−35 tests/Main.hs−44 tests/PscIdeSpec.hs−1 tests/TestCompiler.hs−182 tests/TestDocs.hs−314 tests/TestPscIde.hs−7 tests/TestPscPublish.hs−78 tests/TestPsci.hs−148 tests/TestUtils.hs−88 tests/support/.gitignore−2 tests/support/bower.json−11 tests/support/package.json−8 tests/support/psci/Sample.purs tests/support/pscide/.gitignore−7 tests/support/pscide/src/ImportsSpec.purs−5 tests/support/pscide/src/ImportsSpec1.purs−32 tests/support/pscide/src/Main.purs−7 tests/support/pscide/src/RebuildSpecDep.purs−3 tests/support/pscide/src/RebuildSpecSingleModule.fail−3 tests/support/pscide/src/RebuildSpecSingleModule.purs−4 tests/support/pscide/src/RebuildSpecWithDeps.purs−5 tests/support/pscide/src/RebuildSpecWithForeign.js−3 tests/support/pscide/src/RebuildSpecWithForeign.purs−3 tests/support/pscide/src/RebuildSpecWithMissingForeign.fail−3 tests/support/setup-win.cmd−3 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
.travis.ymldeleted−73
@@ -1,73 +0,0 @@
1−language: c
2−dist: trusty
3−sudo: required
4−matrix:
5− include:
6− - env: GHCVER=7.10.3 CABALVER=1.22 STACKAGE=lts-5.4 RUNSDISTTESTS=YES
7− compiler: ": #GHC 7.10.3 lts-5.4"
8− addons: {apt: {packages: [cabal-install-1.22,ghc-7.10.3,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
9− - env: GHCVER=7.10.3 CABALVER=1.22 STACKAGE=nightly-2016-02-25
10− compiler: ": #GHC 7.10.3 nightly-2016-02-25"
11− addons: {apt: {packages: [cabal-install-1.22,ghc-7.10.3,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
12− - env: GHCVER=7.10.3 CABALVER=1.22 DEPLOY=yes
13− compiler: ": #GHC 7.10.3"
14− addons: {apt: {packages: [cabal-install-1.22,ghc-7.10.3,happy-1.19.5,alex-3.1.4], sources: [hvr-ghc]}}
15−before_install:
16− - unset CC
17− - export PATH="/opt/ghc/$GHCVER/bin:$PATH"
18− - export PATH="/opt/cabal/$CABALVER/bin:$PATH"
19− - export PATH="$HOME/.cabal/bin:$PATH"
20− - export PATH="/opt/happy/1.19.5/bin:/$PATH"
21− - export PATH="/opt/alex/3.1.4/bin:/$PATH"
22− - export PATH="$HOME/build/purescript/purescript/dist/build/psc:/$PATH"
23− - export PATH="$HOME/build/purescript/purescript/dist/build/psc-ide-server:/$PATH"
24− - export PATH="$HOME/build/purescript/purescript/dist/build/psc-ide-client:/$PATH"
25−install:
26− - cabal --version
27− - echo "$(ghc --version) [$(ghc --print-project-git-commit-id 2> /dev/null || echo '?')]"
28− - travis_retry cabal update
29− # Run sequentially
30− # Travis container infrastructure seems to expose all host CPUs (16?), thus
31− # cabal and ghc tries to use them all. Which is bad idea on a shared box.
32− # See also: https://ghc.haskell.org/trac/ghc/ticket/9221
33− - sed -i 's/^jobs:/-- jobs:/' ${HOME}/.cabal/config
34− # Cache sandboxes in ~/cabal-sandboxes
35− # Move right sandbox to .cabal-sandbox if exists
36− - if [ -d ~/cabal-sandboxes/$GHCVER-${STACKAGE:-none} ]; then
37− mv ~/cabal-sandboxes/$GHCVER-${STACKAGE:-none} .cabal-sandbox;
38− fi
39− - mkdir -p .cabal-sandbox
40− - cabal sandbox init --sandbox .cabal-sandbox
41− # Download stackage cabal.config. Filter this package and 'extra deps'
42− - if [ -n "$STACKAGE" ]; then curl https://www.stackage.org/$STACKAGE/cabal.config | egrep -v 'purescript|language-javascript|bower-json' > cabal.config; fi
43− - cabal install --only-dependencies --enable-tests
44− - cabal install hpc-coveralls
45− # Snapshot state of the sandbox now, so we don't need to make new one for test install
46− - rm -rf ~/cabal-sandboxes/$GHCVER-${STACKAGE:-none}
47− - cp -r .cabal-sandbox ~/cabal-sandboxes/$GHCVER-${STACKAGE:-none}
48− # Install bower globally (for psc-docs/psc-publish tests)
49− - npm install -g bower
50−script:
51− - ./travis/configure.sh
52− - cabal build --ghc-options="-Werror"
53− - cabal test
54− - ./travis/test-install.sh
55−after_script:
56− - ./travis/after.sh
57−notifications:
58− email: true
59−before_deploy: "./bundle/build.sh linux64"
60−deploy:
61− provider: releases
62− api_key: $RELEASE_KEY
63− file:
64− - bundle/linux64.tar.gz
65− - bundle/linux64.sha
66− skip_cleanup: true
67− on:
68− all_branches: true
69− tags: true
70− condition: "$DEPLOY = yes"
71−cache:
72− directories:
73− - ~/cabal-sandboxes
CONTRIBUTING.mddeleted−39
@@ -1,39 +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−This can be automated; see the `license-generator/generate.hs` file.
31−
32−## Writing Issues
33−
34−- If the issue is actually a question, please consider asking on Reddit, Stack Overflow or IRC first.
35−- Please include a minimal, repeatable test case with any bug report.
36−
37−## Copyright and Licensing
38−
39−For any code change, please append a copyright and licensing notice to the [CONTRIBUTORS.md](CONTRIBUTORS.md) file.
CONTRIBUTORS.mddeleted−76
@@ -1,76 +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−- [@bagl](https://github.com/bagl) (Petr Vapenka) My existing contributions and all future contributions until further notice are Copyright Petr Vapenka, 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).
13−- [@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.
14−- [@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.
15−- [@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).
16−- [@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).
17−- [@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).
18−- [@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).
19−- [@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).
20−- [@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).
21−- [@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).
22−- [@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).
23−- [@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.
24−- [@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
25−- [@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).
26−- [@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).
27−- [@faineance](https://github.com/faineance) My existing contributions and all future contributions until further notice are Copyright faineance, 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−- [@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).
29−- [@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).
30−- [@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).
31−- [@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).
32−- [@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).
33−- [@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.
34−- [@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.
35−- [@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).
36−- [@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).
37−- [@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).
38−- [@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).
39−- [@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).
40−- [@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.
41−- [@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).
42−- [@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).
43−- [@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).
44−- [@nagisa](https://github.com/nagisa) I hereby release my [only contribution](https://github.com/purescript/purescript/commit/80287a5d0de619862d3b4cda9c1ee276d18fdcd8) into public domain.
45−- [@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).
46−- [@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).
47−- [@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).
48−- [@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).
49−- [@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.
50−- [@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).
51−- [@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).
52−- [@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).
53−- [@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).
54−- [@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).
55−- [@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).
56−- [@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).
57−- [@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.
58−- [@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).
59−- [@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).
60−- [@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.
61−- [@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).
62−- [@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).
63−- [@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).
64−- [@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).
65−- [@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).
66−- [@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).
67−- [@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).
68−- [@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).
69−- [@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.
70−- [@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).
71−- [@LiamGoodacre](https://github.com/LiamGoodacre) (Liam Goodacre) My existing contributions and all future contributions until further notice are Copyright Liam Goodacre, 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).
72−- [@bsermons](https://github.com/bsermons) (Brian Sermons) My existing contributions and all future contributions until further notice are Copyright Brian Sermons, 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).
73−
74−### Companies
75−
76−- [@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−53
@@ -1,53 +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.10.3, and therefore they should
10−run on any operating system supported by GHC 7.10.3, such as:
11−
12−* Windows 2000 or later,
13−* OS X 10.7 or later,
14−* Linux ??? (we're not sure what the minimum version is).
15−
16−This list is not exhaustive. If your OS is too old or not listed, or if the
17−binaries fail to run, you may be able to install the compiler by building it
18−from source; see below.
19−
20−It's probably safe to assume that other prebuilt distributions (eg, Homebrew,
21−Chocolatey, AUR, npm) use the same binaries, and therefore have the same
22−requirements.
23−
24−## Compiling from source
25−
26−GHC 7.10.1 or newer is required to compile from source. The easiest way is to
27−use stack:
28−
29−```
30−$ stack install --resolver=nightly 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 "curses" library
43−
44−`psci` depends on the `curses` library (via the Haskell package `terminfo`). If
45−you are having difficulty running the compiler, it may be because the `curses`
46−library is missing.
47−
48−On Linux, you will probably need to install `ncurses` manually. On Ubuntu, for
49−example, this can be done by running:
50−
51−```
52−$ sudo apt-get install libncurses5-dev
53−```
LICENSE+20−3554
@@ -1,3564 +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− aeson
27− aeson-better-errors
28− ansi-terminal
29− ansi-wl-pprint
30− array
31− asn1-encoding
32− asn1-parse
33− asn1-types
34− async
35− attoparsec
36− auto-update
37− base
38− base-compat
39− base64-bytestring
40− binary
41− blaze-builder
42− bower-json
43− boxes
44− byteable
45− bytestring
46− bytestring-builder
47− case-insensitive
48− cereal
49− conduit
50− conduit-extra
51− connection
52− containers
53− cookie
54− cryptonite
55− data-default-class
56− deepseq
57− directory
58− dlist
59− edit-distance
60− exceptions
61− fast-logger
62− filepath
63− fsnotify
64− ghc-prim
65− hashable
66− haskeline
67− hinotify
68− hourglass
69− http-client
70− http-client-tls
71− http-types
72− integer-gmp
73− language-javascript
74− lifted-base
75− memory
76− mime-types
77− mmorph
78− monad-control
79− monad-logger
80− monad-loops
81− mtl
82− network
83− network-uri
84− old-locale
85− optparse-applicative
86− parallel
87− parsec
88− pattern-arrows
89− pem
90− pipes
91− pipes-http
92− primitive
93− process
94− random
95− regex-base
96− regex-tdfa
97− resourcet
98− safe
99− scientific
100− semigroups
101− socks
102− sourcemap
103− spdx
104− split
105− stm
106− stm-chans
107− streaming-commons
108− syb
109− tagged
110− template-haskell
111− terminfo
112− text
113− time
114− tls
115− transformers
116− transformers-base
117− transformers-compat
118− unix
119− unix-compat
120− unordered-containers
121− utf8-string
122− vector
123− void
124− x509
125− x509-store
126− x509-system
127− x509-validation
128− zlib
129−
130−Glob LICENSE file:
131−
132− The code in Glob is released under the license below. Copyrights to parts of
133− the code are held by whoever wrote the code in question: see CREDITS.txt for a
134− list of authors.
135−
136− Copyright (c) 2008-2012 <authors>
137− All rights reserved.
138−
139− Redistribution and use in source and binary forms, with or without
140− modification, are permitted provided that the following conditions are met:
141− * Redistributions of source code must retain the above copyright
142− notice, this list of conditions and the following disclaimer.
143− * Redistributions in binary form must reproduce the above copyright
144− notice, this list of conditions and the following disclaimer in the
145− documentation and/or other materials provided with the distribution.
146− * Neither the name of the project nor the names of its contributors may be
147− used to endorse or promote products derived from this software without
148− specific prior written permission.
149−
150− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR IMPLIED
151− WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
152− MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
153− EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
154− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
155− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
156− PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
157− LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
158− OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
159− ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
160−
161−aeson LICENSE file:
162−
163− Copyright (c) 2011, MailRank, Inc.
164−
165− All rights reserved.
166−
167− Redistribution and use in source and binary forms, with or without
168− modification, are permitted provided that the following conditions
169− are met:
170−
171− 1. Redistributions of source code must retain the above copyright
172− notice, this list of conditions and the following disclaimer.
173−
174− 2. Redistributions in binary form must reproduce the above copyright
175− notice, this list of conditions and the following disclaimer in the
176− documentation and/or other materials provided with the distribution.
177−
178− 3. Neither the name of the author nor the names of his contributors
179− may be used to endorse or promote products derived from this software
180− without specific prior written permission.
181−
182− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
183− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
184− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
185− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
186− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
187− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
188− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
189− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
190− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
191− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
192− POSSIBILITY OF SUCH DAMAGE.
193−
194−aeson-better-errors LICENSE file:
195−
196− Copyright (c) 2015 Harry Garrood
197−
198− Permission is hereby granted, free of charge, to any person obtaining
199− a copy of this software and associated documentation files (the
200− "Software"), to deal in the Software without restriction, including
201− without limitation the rights to use, copy, modify, merge, publish,
202− distribute, sublicense, and/or sell copies of the Software, and to
203− permit persons to whom the Software is furnished to do so, subject to
204− the following conditions:
205−
206− The above copyright notice and this permission notice shall be included
207− in all copies or substantial portions of the Software.
208−
209− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
210− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
211− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
212− IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
213− CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
214− TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
215− SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
216−
217−ansi-terminal LICENSE file:
218−
219− Copyright (c) 2008, Maximilian Bolingbroke
220− All rights reserved.
221−
222− Redistribution and use in source and binary forms, with or without modification, are permitted
223− provided that the following conditions are met:
224−
225− * Redistributions of source code must retain the above copyright notice, this list of
226− conditions and the following disclaimer.
227− * Redistributions in binary form must reproduce the above copyright notice, this list of
228− conditions and the following disclaimer in the documentation and/or other materials
229− provided with the distribution.
230− * Neither the name of Maximilian Bolingbroke nor the names of other contributors may be used to
231− endorse or promote products derived from this software without specific prior written permission.
232−
233− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
234− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
235− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
236− CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
237− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
238− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
239− IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
240− OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
241−
242−ansi-wl-pprint LICENSE file:
243−
244− Copyright 2008, Daan Leijen and Max Bolingbroke. All rights reserved.
245−
246− Redistribution and use in source and binary forms, with or without
247− modification, are permitted provided that the following conditions are
248− met:
5+Redistribution and use in source and binary forms, with or without
6+modification, are permitted provided that the following conditions are met:
2497
2508 * Redistributions of source code must retain the above copyright
2519 notice, this list of conditions and the following disclaimer.
25210
253− * Redistributions in binary form must reproduce the above copyright
254− notice, this list of conditions and the following disclaimer in
255− the documentation and/or other materials provided with the
256− distribution.
257−
258− This software is provided by the copyright holders "as is" and any
259− express or implied warranties, including, but not limited to, the
260− implied warranties of merchantability and fitness for a particular
261− purpose are disclaimed. In no event shall the copyright holders be
262− liable for any direct, indirect, incidental, special, exemplary, or
263− consequential damages (including, but not limited to, procurement of
264− substitute goods or services; loss of use, data, or profits; or
265− business interruption) however caused and on any theory of liability,
266− whether in contract, strict liability, or tort (including negligence
267− or otherwise) arising in any way out of the use of this software, even
268− if advised of the possibility of such damage.
269−
270−array LICENSE file:
271−
272− This library (libraries/base) is derived from code from several
273− sources:
274−
275− * Code from the GHC project which is largely (c) The University of
276− Glasgow, and distributable under a BSD-style license (see below),
277−
278− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
279− and freely redistributable (but see the full license for
280− restrictions).
281−
282− * Code from the Haskell Foreign Function Interface specification,
283− which is (c) Manuel M. T. Chakravarty and freely redistributable
284− (but see the full license for restrictions).
285−
286− The full text of these licenses is reproduced below. All of the
287− licenses are BSD-style or compatible.
288−
289− -----------------------------------------------------------------------------
290−
291− The Glasgow Haskell Compiler License
292−
293− Copyright 2004, The University Court of the University of Glasgow.
294− All rights reserved.
295−
296− Redistribution and use in source and binary forms, with or without
297− modification, are permitted provided that the following conditions are met:
298−
299− - Redistributions of source code must retain the above copyright notice,
300− this list of conditions and the following disclaimer.
301−
302− - Redistributions in binary form must reproduce the above copyright notice,
303− this list of conditions and the following disclaimer in the documentation
304− and/or other materials provided with the distribution.
305−
306− - Neither name of the University nor the names of its contributors may be
307− used to endorse or promote products derived from this software without
308− specific prior written permission.
309−
310− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
311− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
312− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
313− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
314− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
315− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
316− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
317− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
318− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
319− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
320− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
321− DAMAGE.
322−
323− -----------------------------------------------------------------------------
324−
325− Code derived from the document "Report on the Programming Language
326− Haskell 98", is distributed under the following license:
327−
328− Copyright (c) 2002 Simon Peyton Jones
329−
330− The authors intend this Report to belong to the entire Haskell
331− community, and so we grant permission to copy and distribute it for
332− any purpose, provided that it is reproduced in its entirety,
333− including this Notice. Modified versions of this Report may also be
334− copied and distributed for any purpose, provided that the modified
335− version is clearly presented as such, and that it does not claim to
336− be a definition of the Haskell 98 Language.
337−
338− -----------------------------------------------------------------------------
339−
340− Code derived from the document "The Haskell 98 Foreign Function
341− Interface, An Addendum to the Haskell 98 Report" is distributed under
342− the following license:
343−
344− Copyright (c) 2002 Manuel M. T. Chakravarty
345−
346− The authors intend this Report to belong to the entire Haskell
347− community, and so we grant permission to copy and distribute it for
348− any purpose, provided that it is reproduced in its entirety,
349− including this Notice. Modified versions of this Report may also be
350− copied and distributed for any purpose, provided that the modified
351− version is clearly presented as such, and that it does not claim to
352− be a definition of the Haskell 98 Foreign Function Interface.
353−
354− -----------------------------------------------------------------------------
355−
356−asn1-encoding LICENSE file:
357−
358− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
359−
360− All rights reserved.
361−
362− Redistribution and use in source and binary forms, with or without
363− modification, are permitted provided that the following conditions
364− are met:
365− 1. Redistributions of source code must retain the above copyright
366− notice, this list of conditions and the following disclaimer.
367− 2. Redistributions in binary form must reproduce the above copyright
368− notice, this list of conditions and the following disclaimer in the
369− documentation and/or other materials provided with the distribution.
370− 3. Neither the name of the author nor the names of his contributors
371− may be used to endorse or promote products derived from this software
372− without specific prior written permission.
373−
374− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
375− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
376− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
377− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
378− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
379− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
380− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
381− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
382− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
383− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
384− SUCH DAMAGE.
385−
386−asn1-parse LICENSE file:
387−
388− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
389−
390− All rights reserved.
391−
392− Redistribution and use in source and binary forms, with or without
393− modification, are permitted provided that the following conditions
394− are met:
395− 1. Redistributions of source code must retain the above copyright
396− notice, this list of conditions and the following disclaimer.
397− 2. Redistributions in binary form must reproduce the above copyright
398− notice, this list of conditions and the following disclaimer in the
399− documentation and/or other materials provided with the distribution.
400− 3. Neither the name of the author nor the names of his contributors
401− may be used to endorse or promote products derived from this software
402− without specific prior written permission.
403−
404− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
405− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
406− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
407− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
408− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
409− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
410− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
411− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
412− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
413− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
414− SUCH DAMAGE.
415−
416−asn1-types LICENSE file:
417−
418− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
419−
420− All rights reserved.
421−
422− Redistribution and use in source and binary forms, with or without
423− modification, are permitted provided that the following conditions
424− are met:
425− 1. Redistributions of source code must retain the above copyright
426− notice, this list of conditions and the following disclaimer.
427− 2. Redistributions in binary form must reproduce the above copyright
428− notice, this list of conditions and the following disclaimer in the
429− documentation and/or other materials provided with the distribution.
430− 3. Neither the name of the author nor the names of his contributors
431− may be used to endorse or promote products derived from this software
432− without specific prior written permission.
433−
434− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
435− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
436− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
437− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
438− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
439− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
440− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
441− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
442− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
443− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
444− SUCH DAMAGE.
445−
446−async LICENSE file:
447−
448− Copyright (c) 2012, Simon Marlow
449−
450− All rights reserved.
451−
452− Redistribution and use in source and binary forms, with or without
453− modification, are permitted provided that the following conditions are met:
454−
455− * Redistributions of source code must retain the above copyright
456− notice, this list of conditions and the following disclaimer.
457−
458− * Redistributions in binary form must reproduce the above
459− copyright notice, this list of conditions and the following
460− disclaimer in the documentation and/or other materials provided
461− with the distribution.
462−
463− * Neither the name of Simon Marlow nor the names of other
464− contributors may be used to endorse or promote products derived
465− from this software without specific prior written permission.
466−
467− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
468− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
469− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
470− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
471− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
472− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
473− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
474− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
475− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
476− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
477− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
478−
479−attoparsec LICENSE file:
480−
481− Copyright (c) Lennart Kolmodin
482−
483− All rights reserved.
484−
485− Redistribution and use in source and binary forms, with or without
486− modification, are permitted provided that the following conditions
487− are met:
488−
489− 1. Redistributions of source code must retain the above copyright
490− notice, this list of conditions and the following disclaimer.
491−
492− 2. Redistributions in binary form must reproduce the above copyright
493− notice, this list of conditions and the following disclaimer in the
494− documentation and/or other materials provided with the distribution.
495−
496− 3. Neither the name of the author nor the names of his contributors
497− may be used to endorse or promote products derived from this software
498− without specific prior written permission.
499−
500− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
501− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
502− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
503− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
504− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
505− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
506− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
507− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
508− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
509− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
510− POSSIBILITY OF SUCH DAMAGE.
511−
512−auto-update LICENSE file:
513−
514− Copyright (c) 2014 Michael Snoyman
515−
516− Permission is hereby granted, free of charge, to any person obtaining
517− a copy of this software and associated documentation files (the
518− "Software"), to deal in the Software without restriction, including
519− without limitation the rights to use, copy, modify, merge, publish,
520− distribute, sublicense, and/or sell copies of the Software, and to
521− permit persons to whom the Software is furnished to do so, subject to
522− the following conditions:
523−
524− The above copyright notice and this permission notice shall be included
525− in all copies or substantial portions of the Software.
526−
527− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
528− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
529− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
530− IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
531− CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
532− TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
533− SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
534−
535−base LICENSE file:
536−
537− This library (libraries/base) is derived from code from several
538− sources:
539−
540− * Code from the GHC project which is largely (c) The University of
541− Glasgow, and distributable under a BSD-style license (see below),
542−
543− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
544− and freely redistributable (but see the full license for
545− restrictions).
546−
547− * Code from the Haskell Foreign Function Interface specification,
548− which is (c) Manuel M. T. Chakravarty and freely redistributable
549− (but see the full license for restrictions).
550−
551− The full text of these licenses is reproduced below. All of the
552− licenses are BSD-style or compatible.
553−
554− -----------------------------------------------------------------------------
555−
556− The Glasgow Haskell Compiler License
557−
558− Copyright 2004, The University Court of the University of Glasgow.
559− All rights reserved.
560−
561− Redistribution and use in source and binary forms, with or without
562− modification, are permitted provided that the following conditions are met:
563−
564− - Redistributions of source code must retain the above copyright notice,
565− this list of conditions and the following disclaimer.
566−
567− - Redistributions in binary form must reproduce the above copyright notice,
568− this list of conditions and the following disclaimer in the documentation
569− and/or other materials provided with the distribution.
570−
571− - Neither name of the University nor the names of its contributors may be
572− used to endorse or promote products derived from this software without
573− specific prior written permission.
574−
575− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
576− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
577− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
578− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
579− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
580− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
581− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
582− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
583− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
584− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
585− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
586− DAMAGE.
587−
588− -----------------------------------------------------------------------------
589−
590− Code derived from the document "Report on the Programming Language
591− Haskell 98", is distributed under the following license:
592−
593− Copyright (c) 2002 Simon Peyton Jones
594−
595− The authors intend this Report to belong to the entire Haskell
596− community, and so we grant permission to copy and distribute it for
597− any purpose, provided that it is reproduced in its entirety,
598− including this Notice. Modified versions of this Report may also be
599− copied and distributed for any purpose, provided that the modified
600− version is clearly presented as such, and that it does not claim to
601− be a definition of the Haskell 98 Language.
602−
603− -----------------------------------------------------------------------------
604−
605− Code derived from the document "The Haskell 98 Foreign Function
606− Interface, An Addendum to the Haskell 98 Report" is distributed under
607− the following license:
608−
609− Copyright (c) 2002 Manuel M. T. Chakravarty
610−
611− The authors intend this Report to belong to the entire Haskell
612− community, and so we grant permission to copy and distribute it for
613− any purpose, provided that it is reproduced in its entirety,
614− including this Notice. Modified versions of this Report may also be
615− copied and distributed for any purpose, provided that the modified
616− version is clearly presented as such, and that it does not claim to
617− be a definition of the Haskell 98 Foreign Function Interface.
618−
619− -----------------------------------------------------------------------------
620−
621−base-compat LICENSE file:
622−
623− Copyright (c) 2012-2016 Simon Hengel <sol@typeful.net> and Ryan Scott <ryan.gl.scott@gmail.com>
624−
625− Permission is hereby granted, free of charge, to any person obtaining a copy
626− of this software and associated documentation files (the "Software"), to deal
627− in the Software without restriction, including without limitation the rights
628− to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
629− copies of the Software, and to permit persons to whom the Software is
630− furnished to do so, subject to the following conditions:
631−
632− The above copyright notice and this permission notice shall be included in
633− all copies or substantial portions of the Software.
634−
635− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
636− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
637− FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
638− AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
639− LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
640− OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
641− THE SOFTWARE.
642−
643−base64-bytestring LICENSE file:
644−
645− Copyright (c) 2010 Bryan O'Sullivan <bos@serpentine.com>
646−
647− All rights reserved.
648−
649− Redistribution and use in source and binary forms, with or without
650− modification, are permitted provided that the following conditions
651− are met:
652−
653− 1. Redistributions of source code must retain the above copyright
654− notice, this list of conditions and the following disclaimer.
655−
656− 2. Redistributions in binary form must reproduce the above copyright
657− notice, this list of conditions and the following disclaimer in the
658− documentation and/or other materials provided with the distribution.
659−
660− 3. Neither the name of the author nor the names of his contributors
661− may be used to endorse or promote products derived from this software
662− without specific prior written permission.
663−
664− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
665− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
666− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
667− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
668− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
669− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
670− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
671− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
672− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
673− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
674− POSSIBILITY OF SUCH DAMAGE.
675−
676−binary LICENSE file:
677−
678− Copyright (c) Lennart Kolmodin
679−
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
684− are met:
685−
686− 1. Redistributions of source code must retain the above copyright
687− notice, this list of conditions and the following disclaimer.
688−
689− 2. Redistributions in binary form must reproduce the above copyright
690− notice, this list of conditions and the following disclaimer in the
691− documentation and/or other materials provided with the distribution.
692−
693− 3. Neither the name of the author nor the names of his contributors
694− may be used to endorse or promote products derived from this software
695− without specific prior written permission.
696−
697− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
698− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
699− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
700− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
701− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
702− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
703− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
704− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
705− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
706− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
707− POSSIBILITY OF SUCH DAMAGE.
708−
709−blaze-builder LICENSE file:
710−
711− Copyright Jasper Van der Jeugt 2010, Simon Meier 2010 & 2011
712−
713− All rights reserved.
714−
715− Redistribution and use in source and binary forms, with or without
716− modification, are permitted provided that the following conditions are met:
717−
718− * Redistributions of source code must retain the above copyright
719− notice, this list of conditions and the following disclaimer.
720−
721− * Redistributions in binary form must reproduce the above
722− copyright notice, this list of conditions and the following
723− disclaimer in the documentation and/or other materials provided
724− with the distribution.
725−
726− * Neither the name of Jasper Van der Jeugt nor the names of other
727− contributors may be used to endorse or promote products derived
728− from this software without specific prior written permission.
729−
730− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
731− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
732− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
733− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
734− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
735− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
736− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
737− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
738− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
739− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
740− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
741−
742−bower-json LICENSE file:
743−
744− Copyright (c) 2015 Harry Garrood
745−
746− Permission is hereby granted, free of charge, to any person obtaining
747− a copy of this software and associated documentation files (the
748− "Software"), to deal in the Software without restriction, including
749− without limitation the rights to use, copy, modify, merge, publish,
750− distribute, sublicense, and/or sell copies of the Software, and to
751− permit persons to whom the Software is furnished to do so, subject to
752− the following conditions:
753−
754− The above copyright notice and this permission notice shall be included
755− in all copies or substantial portions of the Software.
756−
757− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
758− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
759− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
760− IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
761− CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
762− TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
763− SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
764−
765−boxes LICENSE file:
766−
767− Copyright (c) Brent Yorgey 2008
768−
769− Redistribution and use in source and binary forms, with or without
770− modification, are permitted provided that the following conditions
771− are met:
772− 1. Redistributions of source code must retain the above copyright
773− notice, this list of conditions and the following disclaimer.
774− 2. Redistributions in binary form must reproduce the above copyright
775− notice, this list of conditions and the following disclaimer in the
776− documentation and/or other materials provided with the distribution.
777− 3. Neither the name of the author nor the names of other contributors
778− may be used to endorse or promote products derived from this software
779− without specific prior written permission.
780−
781− All other rights are reserved.
782−
783− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND
784− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
785− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
786− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
787− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
788− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
789− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
790− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
791− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
792− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
793− SUCH DAMAGE.
794−
795−byteable LICENSE file:
796−
797− Copyright (c) 2013 Vincent Hanquez <vincent@snarc.org>
798−
799− All rights reserved.
800−
801− Redistribution and use in source and binary forms, with or without
802− modification, are permitted provided that the following conditions
803− are met:
804− 1. Redistributions of source code must retain the above copyright
805− notice, this list of conditions and the following disclaimer.
806− 2. Redistributions in binary form must reproduce the above copyright
807− notice, this list of conditions and the following disclaimer in the
808− documentation and/or other materials provided with the distribution.
809− 3. Neither the name of the author nor the names of his contributors
810− may be used to endorse or promote products derived from this software
811− without specific prior written permission.
812−
813− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS AS IS'' AND
814− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
815− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
816− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
817− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
818− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
819− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
820− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
821− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
822− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
823− SUCH DAMAGE.
824−
825−bytestring LICENSE file:
826−
827− Copyright (c) Don Stewart 2005-2009
828− (c) Duncan Coutts 2006-2015
829− (c) David Roundy 2003-2005
830− (c) Simon Meier 2010-2011
831−
832− All rights reserved.
833−
834− Redistribution and use in source and binary forms, with or without
835− modification, are permitted provided that the following conditions
836− are met:
837− 1. Redistributions of source code must retain the above copyright
838− notice, this list of conditions and the following disclaimer.
839− 2. Redistributions in binary form must reproduce the above copyright
840− notice, this list of conditions and the following disclaimer in the
841− documentation and/or other materials provided with the distribution.
842− 3. Neither the name of the author nor the names of his contributors
843− may be used to endorse or promote products derived from this software
844− without specific prior written permission.
845−
846− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
847− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
848− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
849− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
850− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
851− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
852− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
853− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
854− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
855− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
856− SUCH DAMAGE.
857−
858−bytestring-builder LICENSE file:
859−
860− Copyright Jasper Van der Jeugt 2010, Simon Meier 2010-2013
861−
862− All rights reserved.
863−
864− Redistribution and use in source and binary forms, with or without
865− modification, are permitted provided that the following conditions are met:
866−
867− * Redistributions of source code must retain the above copyright
868− notice, this list of conditions and the following disclaimer.
869−
870− * Redistributions in binary form must reproduce the above
871− copyright notice, this list of conditions and the following
872− disclaimer in the documentation and/or other materials provided
873− with the distribution.
874−
875− * Neither the name of Jasper Van der Jeugt nor the names of other
876− contributors may be used to endorse or promote products derived
877− from this software without specific prior written permission.
878−
879− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
880− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
881− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
882− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
883− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
884− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
885− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
886− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
887− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
888− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
889− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
890−
891−case-insensitive LICENSE file:
892−
893− Copyright (c) 2011-2013 Bas van Dijk
894−
895− All rights reserved.
896−
897− Redistribution and use in source and binary forms, with or without
898− modification, are permitted provided that the following conditions are
899− met:
900−
901− * Redistributions of source code must retain the above copyright
902− notice, this list of conditions and the following disclaimer.
903−
904− * Redistributions in binary form must reproduce the above
905− copyright notice, this list of conditions and the following
906− disclaimer in the documentation and/or other materials provided
907− with the distribution.
908−
909− * The name of Bas van Dijk and the names of contributors may NOT
910− be used to endorse or promote products derived from this
911− software without specific prior written permission.
912−
913− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
914− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
915− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
916− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
917− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
918− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
919− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
920− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
921− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
922− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
923− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
924−
925−cereal LICENSE file:
926−
927− Copyright (c) Lennart Kolmodin, Galois, Inc.
928−
929− All rights reserved.
930−
931− Redistribution and use in source and binary forms, with or without
932− modification, are permitted provided that the following conditions
933− are met:
934−
935− 1. Redistributions of source code must retain the above copyright
936− notice, this list of conditions and the following disclaimer.
937−
938− 2. Redistributions in binary form must reproduce the above copyright
939− notice, this list of conditions and the following disclaimer in the
940− documentation and/or other materials provided with the distribution.
941−
942− 3. Neither the name of the author nor the names of his contributors
943− may be used to endorse or promote products derived from this software
944− without specific prior written permission.
945−
946− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
947− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
948− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
949− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
950− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
951− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
952− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
953− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
954− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
955− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
956− POSSIBILITY OF SUCH DAMAGE.
957−
958−conduit LICENSE file:
959−
960− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
961−
962− Permission is hereby granted, free of charge, to any person obtaining
963− a copy of this software and associated documentation files (the
964− "Software"), to deal in the Software without restriction, including
965− without limitation the rights to use, copy, modify, merge, publish,
966− distribute, sublicense, and/or sell copies of the Software, and to
967− permit persons to whom the Software is furnished to do so, subject to
968− the following conditions:
969−
970− The above copyright notice and this permission notice shall be
971− included in all copies or substantial portions of the Software.
972−
973− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
974− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
975− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
976− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
977− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
978− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
979− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
980−
981−conduit-extra LICENSE file:
982−
983− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
984−
985− Permission is hereby granted, free of charge, to any person obtaining
986− a copy of this software and associated documentation files (the
987− "Software"), to deal in the Software without restriction, including
988− without limitation the rights to use, copy, modify, merge, publish,
989− distribute, sublicense, and/or sell copies of the Software, and to
990− permit persons to whom the Software is furnished to do so, subject to
991− the following conditions:
992−
993− The above copyright notice and this permission notice shall be
994− included in all copies or substantial portions of the Software.
995−
996− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
997− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
998− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
999− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
1000− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
1001− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
1002− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1003−
1004−connection LICENSE file:
1005−
1006− Copyright (c) 2012 Vincent Hanquez <vincent@snarc.org>
1007−
1008− All rights reserved.
1009−
1010− Redistribution and use in source and binary forms, with or without
1011− modification, are permitted provided that the following conditions
1012− are met:
1013− 1. Redistributions of source code must retain the above copyright
1014− notice, this list of conditions and the following disclaimer.
1015− 2. Redistributions in binary form must reproduce the above copyright
1016− notice, this list of conditions and the following disclaimer in the
1017− documentation and/or other materials provided with the distribution.
1018− 3. Neither the name of the author nor the names of his contributors
1019− may be used to endorse or promote products derived from this software
1020− without specific prior written permission.
1021−
1022− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
1023− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1024− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1025− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1026− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1027− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1028− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1029− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1030− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1031− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1032− SUCH DAMAGE.
1033−
1034−containers LICENSE file:
1035−
1036− The Glasgow Haskell Compiler License
1037−
1038− Copyright 2004, The University Court of the University of Glasgow.
1039− All rights reserved.
1040−
1041− Redistribution and use in source and binary forms, with or without
1042− modification, are permitted provided that the following conditions are met:
1043−
1044− - Redistributions of source code must retain the above copyright notice,
1045− this list of conditions and the following disclaimer.
1046−
1047− - Redistributions in binary form must reproduce the above copyright notice,
1048− this list of conditions and the following disclaimer in the documentation
1049− and/or other materials provided with the distribution.
1050−
1051− - Neither name of the University nor the names of its contributors may be
1052− used to endorse or promote products derived from this software without
1053− specific prior written permission.
1054−
1055− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1056− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1057− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1058− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1059− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1060− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1061− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1062− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1063− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1064− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1065− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1066− DAMAGE.
1067−
1068−cookie LICENSE file:
1069−
1070− The following license covers this documentation, and the source code, except
1071− where otherwise indicated.
1072−
1073− Copyright 2010, Michael Snoyman. All rights reserved.
1074−
1075− Redistribution and use in source and binary forms, with or without
1076− modification, are permitted provided that the following conditions are met:
1077−
1078− * Redistributions of source code must retain the above copyright notice, this
1079− list of conditions and the following disclaimer.
1080−
1081− * Redistributions in binary form must reproduce the above copyright notice,
1082− this list of conditions and the following disclaimer in the documentation
1083− and/or other materials provided with the distribution.
1084−
1085− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS "AS IS" AND ANY EXPRESS OR
1086− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
1087− MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
1088− EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY DIRECT, INDIRECT,
1089− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
1090− NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
1091− OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
1092− LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
1093− OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
1094− ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1095−
1096−cryptonite LICENSE file:
1097−
1098− Copyright (c) 2006-2015 Vincent Hanquez <vincent@snarc.org>
1099−
1100− All rights reserved.
1101−
1102− Redistribution and use in source and binary forms, with or without
1103− modification, are permitted provided that the following conditions
1104− are met:
1105−
1106− 1. Redistributions of source code must retain the above copyright
1107− notice, this list of conditions and the following disclaimer.
1108− 2. Redistributions in binary form must reproduce the above copyright
1109− notice, this list of conditions and the following disclaimer in the
1110− documentation and/or other materials provided with the distribution.
1111− 3. Neither the name of the author nor the names of his contributors
1112− may be used to endorse or promote products derived from this software
1113− without specific prior written permission.
1114−
1115− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS AS IS'' AND
1116− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1117− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1118− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1119− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1120− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1121− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1122− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1123− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1124− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1125− SUCH DAMAGE.
1126−
1127−data-default-class LICENSE file:
1128−
1129− Copyright (c) 2013 Lukas Mai
1130−
1131− All rights reserved.
1132−
1133− Redistribution and use in source and binary forms, with or without modification,
1134− are permitted provided that the following conditions are met:
1135−
1136− * Redistributions of source code must retain the above copyright notice, this
1137− list of conditions and the following disclaimer.
1138− * Redistributions in binary form must reproduce the above copyright notice,
1139− this list of conditions and the following disclaimer in the documentation
1140− and/or other materials provided with the distribution.
1141− * Neither the name of the author nor the names of his contributors
1142− may be used to endorse or promote products derived from this software
1143− without specific prior written permission.
1144−
1145− THIS SOFTWARE IS PROVIDED BY LUKAS MAI AND CONTRIBUTORS "AS IS" AND ANY
1146− EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1147− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1148− DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
1149− DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
1150− (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
1151− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
1152− ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1153− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
1154− SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1155−
1156−deepseq LICENSE file:
1157−
1158− This library (deepseq) is derived from code from the GHC project which
1159− is largely (c) The University of Glasgow, and distributable under a
1160− BSD-style license (see below).
1161−
1162− -----------------------------------------------------------------------------
1163−
1164− The Glasgow Haskell Compiler License
1165−
1166− Copyright 2001-2009, The University Court of the University of Glasgow.
1167− All rights reserved.
1168−
1169− Redistribution and use in source and binary forms, with or without
1170− modification, are permitted provided that the following conditions are met:
1171−
1172− - Redistributions of source code must retain the above copyright notice,
1173− this list of conditions and the following disclaimer.
1174−
1175− - Redistributions in binary form must reproduce the above copyright notice,
1176− this list of conditions and the following disclaimer in the documentation
1177− and/or other materials provided with the distribution.
1178−
1179− - Neither name of the University nor the names of its contributors may be
1180− used to endorse or promote products derived from this software without
1181− specific prior written permission.
1182−
1183− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1184− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1185− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1186− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1187− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1188− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1189− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1190− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1191− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1192− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1193− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1194− DAMAGE.
1195−
1196− -----------------------------------------------------------------------------
1197−
1198−directory LICENSE file:
1199−
1200− This library (libraries/base) is derived from code from two
1201− sources:
1202−
1203− * Code from the GHC project which is largely (c) The University of
1204− Glasgow, and distributable under a BSD-style license (see below),
1205−
1206− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
1207− and freely redistributable (but see the full license for
1208− restrictions).
1209−
1210− The full text of these licenses is reproduced below. Both of the
1211− licenses are BSD-style or compatible.
1212−
1213− -----------------------------------------------------------------------------
1214−
1215− The Glasgow Haskell Compiler License
1216−
1217− Copyright 2004, The University Court of the University of Glasgow.
1218− All rights reserved.
1219−
1220− Redistribution and use in source and binary forms, with or without
1221− modification, are permitted provided that the following conditions are met:
1222−
1223− - Redistributions of source code must retain the above copyright notice,
1224− this list of conditions and the following disclaimer.
1225−
1226− - Redistributions in binary form must reproduce the above copyright notice,
1227− this list of conditions and the following disclaimer in the documentation
1228− and/or other materials provided with the distribution.
1229−
1230− - Neither name of the University nor the names of its contributors may be
1231− used to endorse or promote products derived from this software without
1232− specific prior written permission.
1233−
1234− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1235− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1236− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1237− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1238− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1239− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1240− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1241− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1242− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1243− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1244− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1245− DAMAGE.
1246−
1247− -----------------------------------------------------------------------------
1248−
1249− Code derived from the document "Report on the Programming Language
1250− Haskell 98", is distributed under the following license:
1251−
1252− Copyright (c) 2002 Simon Peyton Jones
1253−
1254− The authors intend this Report to belong to the entire Haskell
1255− community, and so we grant permission to copy and distribute it for
1256− any purpose, provided that it is reproduced in its entirety,
1257− including this Notice. Modified versions of this Report may also be
1258− copied and distributed for any purpose, provided that the modified
1259− version is clearly presented as such, and that it does not claim to
1260− be a definition of the Haskell 98 Language.
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.
126115
1262− -----------------------------------------------------------------------------
1263−
1264−dlist LICENSE file:
1265−
1266− Copyright (c) 2006-2009 Don Stewart, 2013-2014 Sean Leather
1267−
1268− All rights reserved.
1269−
1270− Redistribution and use in source and binary forms, with or without
1271− modification, are permitted provided that the following conditions are
1272− met:
1273−
1274− * Redistributions of source code must retain the above copyright
1275− notice, this list of conditions and the following disclaimer.
1276−
1277− * Redistributions in binary form must reproduce the above
1278− copyright notice, this list of conditions and the following
1279− disclaimer in the documentation and/or other materials provided
1280− with the distribution.
1281−
1282− * Neither the name of Don Stewart nor the names of other
1283− contributors may be used to endorse or promote products derived
1284− from this software without specific prior written permission.
1285−
1286− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1287− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1288− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1289− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1290− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1291− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1292− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1293− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1294− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1295− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1296− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1297−
1298−edit-distance LICENSE file:
1299−
1300− Copyright (c) 2008-2013 Maximilian Bolingbroke
1301− All rights reserved.
1302−
1303− Redistribution and use in source and binary forms, with or without modification, are permitted
1304− provided that the following conditions are met:
1305−
1306− * Redistributions of source code must retain the above copyright notice, this list of
1307− conditions and the following disclaimer.
1308− * Redistributions in binary form must reproduce the above copyright notice, this list of
1309− conditions and the following disclaimer in the documentation and/or other materials
1310− provided with the distribution.
1311− * Neither the name of Maximilian Bolingbroke nor the names of other contributors may be used to
1312− endorse or promote products derived from this software without specific prior written permission.
1313−
1314− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
1315− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1316− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
1317− CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1318− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1319− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
1320− IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
1321− OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1322−
1323−exceptions LICENSE file:
1324−
1325− Copyright 2013-2015 Edward Kmett
1326− Copyright 2012 Google Inc.
1327−
1328− All rights reserved.
1329−
1330− Redistribution and use in source and binary forms, with or without
1331− modification, are permitted provided that the following conditions
1332− are met:
1333−
1334− 1. Redistributions of source code must retain the above copyright
1335− notice, this list of conditions and the following disclaimer.
1336−
1337− 2. Redistributions in binary form must reproduce the above copyright
1338− notice, this list of conditions and the following disclaimer in the
1339− documentation and/or other materials provided with the distribution.
1340−
1341− 3. Neither the name of the author nor the names of his contributors
1342− may be used to endorse or promote products derived from this software
1343− without specific prior written permission.
1344−
1345− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1346− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1347− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1348− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1349− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1350− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1351− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1352− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1353− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1354− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1355− POSSIBILITY OF SUCH DAMAGE.
1356−
1357−fast-logger LICENSE file:
1358−
1359− Copyright (c) 2009, IIJ Innovation Institute Inc.
1360− All rights reserved.
1361−
1362− Redistribution and use in source and binary forms, with or without
1363− modification, are permitted provided that the following conditions
1364− are met:
1365−
1366− * Redistributions of source code must retain the above copyright
1367− notice, this list of conditions and the following disclaimer.
1368− * Redistributions in binary form must reproduce the above copyright
1369− notice, this list of conditions and the following disclaimer in
1370− the documentation and/or other materials provided with the
1371− distribution.
1372− * Neither the name of the copyright holders nor the names of its
16+ * Neither the name of Author name here nor the names of other
137317 contributors may be used to endorse or promote products derived
137418 from this software without specific prior written permission.
137519
1376− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1377− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1378− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
1379− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1380− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
1381− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
1382− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
1383− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1384− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1385− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1386− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1387− POSSIBILITY OF SUCH DAMAGE.
1388−
1389−filepath LICENSE file:
1390−
1391− Copyright Neil Mitchell 2005-2015.
1392− All rights reserved.
1393−
1394− Redistribution and use in source and binary forms, with or without
1395− modification, are permitted provided that the following conditions are
1396− met:
1397−
1398− * Redistributions of source code must retain the above copyright
1399− notice, this list of conditions and the following disclaimer.
1400−
1401− * Redistributions in binary form must reproduce the above
1402− copyright notice, this list of conditions and the following
1403− disclaimer in the documentation and/or other materials provided
1404− with the distribution.
1405−
1406− * Neither the name of Neil Mitchell nor the names of other
1407− contributors may be used to endorse or promote products derived
1408− from this software without specific prior written permission.
1409−
1410− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1411− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1412− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1413− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1414− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1415− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1416− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1417− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1418− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1419− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1420− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1421−
1422−fsnotify LICENSE file:
1423−
1424− Copyright (c) 2012, Mark Dittmer
1425−
1426− All rights reserved.
1427−
1428− Redistribution and use in source and binary forms, with or without
1429− modification, are permitted provided that the following conditions are met:
1430−
1431− * Redistributions of source code must retain the above copyright
1432− notice, this list of conditions and the following disclaimer.
1433−
1434− * Redistributions in binary form must reproduce the above
1435− copyright notice, this list of conditions and the following
1436− disclaimer in the documentation and/or other materials provided
1437− with the distribution.
1438−
1439− * Neither the name of Mark Dittmer nor the names of other
1440− contributors may be used to endorse or promote products derived
1441− from this software without specific prior written permission.
1442−
1443− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1444− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1445− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1446− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1447− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1448− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1449− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1450− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1451− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1452− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1453− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1454−
1455−ghc-prim LICENSE file:
1456−
1457− This library (libraries/ghc-prim) is derived from code from several
1458− sources:
1459−
1460− * Code from the GHC project which is largely (c) The University of
1461− Glasgow, and distributable under a BSD-style license (see below),
1462−
1463− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
1464− and freely redistributable (but see the full license for
1465− restrictions).
1466−
1467− The full text of these licenses is reproduced below. All of the
1468− licenses are BSD-style or compatible.
1469−
1470− -----------------------------------------------------------------------------
1471−
1472− The Glasgow Haskell Compiler License
1473−
1474− Copyright 2004, The University Court of the University of Glasgow.
1475− All rights reserved.
1476−
1477− Redistribution and use in source and binary forms, with or without
1478− modification, are permitted provided that the following conditions are met:
1479−
1480− - Redistributions of source code must retain the above copyright notice,
1481− this list of conditions and the following disclaimer.
1482−
1483− - Redistributions in binary form must reproduce the above copyright notice,
1484− this list of conditions and the following disclaimer in the documentation
1485− and/or other materials provided with the distribution.
1486−
1487− - Neither name of the University nor the names of its contributors may be
1488− used to endorse or promote products derived from this software without
1489− specific prior written permission.
1490−
1491− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1492− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1493− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1494− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1495− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1496− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1497− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1498− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1499− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1500− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1501− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1502− DAMAGE.
1503−
1504− -----------------------------------------------------------------------------
1505−
1506− Code derived from the document "Report on the Programming Language
1507− Haskell 98", is distributed under the following license:
1508−
1509− Copyright (c) 2002 Simon Peyton Jones
1510−
1511− The authors intend this Report to belong to the entire Haskell
1512− community, and so we grant permission to copy and distribute it for
1513− any purpose, provided that it is reproduced in its entirety,
1514− including this Notice. Modified versions of this Report may also be
1515− copied and distributed for any purpose, provided that the modified
1516− version is clearly presented as such, and that it does not claim to
1517− be a definition of the Haskell 98 Language.
1518−
1519−
1520−hashable LICENSE file:
1521−
1522− Copyright Milan Straka 2010
1523−
1524− All rights reserved.
1525−
1526− Redistribution and use in source and binary forms, with or without
1527− modification, are permitted provided that the following conditions are met:
1528−
1529− * Redistributions of source code must retain the above copyright
1530− notice, this list of conditions and the following disclaimer.
1531−
1532− * Redistributions in binary form must reproduce the above
1533− copyright notice, this list of conditions and the following
1534− disclaimer in the documentation and/or other materials provided
1535− with the distribution.
1536−
1537− * Neither the name of Milan Straka nor the names of other
1538− contributors may be used to endorse or promote products derived
1539− from this software without specific prior written permission.
1540−
1541− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1542− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1543− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1544− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1545− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1546− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1547− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1548− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1549− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1550− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1551− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1552−
1553−haskeline LICENSE file:
1554−
1555− Copyright 2007-2009, Judah Jacobson.
1556− All Rights Reserved.
1557−
1558− Redistribution and use in source and binary forms, with or without
1559− modification, are permitted provided that the following conditions are met:
1560−
1561− - Redistribution of source code must retain the above copyright notice,
1562− this list of conditions and the following disclaimer.
1563−
1564− - Redistribution in binary form must reproduce the above copyright notice,
1565− this list of conditions and the following disclaimer in the documentation
1566− and/or other materials provided with the distribution.
1567−
1568− THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY
1569− EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1570− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1571− DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR THE CONTRIBUTORS BE LIABLE
1572− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1573− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1574− SERVICES; LOSS OF USE, DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1575− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
1576− OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
1577− USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1578−
1579−hinotify LICENSE file:
1580−
1581− Copyright (c) Lennart Kolmodin
1582−
1583− All rights reserved.
1584−
1585− Redistribution and use in source and binary forms, with or without
1586− modification, are permitted provided that the following conditions
1587− are met:
1588−
1589− 1. Redistributions of source code must retain the above copyright
1590− notice, this list of conditions and the following disclaimer.
1591−
1592− 2. Redistributions in binary form must reproduce the above copyright
1593− notice, this list of conditions and the following disclaimer in the
1594− documentation and/or other materials provided with the distribution.
1595−
1596− 3. Neither the name of the author nor the names of his contributors
1597− may be used to endorse or promote products derived from this software
1598− without specific prior written permission.
1599−
1600− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
1601− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1602− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1603− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1604− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1605− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1606− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1607− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1608− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1609− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1610− POSSIBILITY OF SUCH DAMAGE.
1611−
1612−hourglass LICENSE file:
1613−
1614− Copyright (c) 2014 Vincent Hanquez <vincent@snarc.org>
1615−
1616− All rights reserved.
1617−
1618− Redistribution and use in source and binary forms, with or without
1619− modification, are permitted provided that the following conditions
1620− are met:
1621− 1. Redistributions of source code must retain the above copyright
1622− notice, this list of conditions and the following disclaimer.
1623− 2. Redistributions in binary form must reproduce the above copyright
1624− notice, this list of conditions and the following disclaimer in the
1625− documentation and/or other materials provided with the distribution.
1626− 3. Neither the name of the author nor the names of his contributors
1627− may be used to endorse or promote products derived from this software
1628− without specific prior written permission.
1629−
1630− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS AS IS'' AND
1631− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1632− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1633− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1634− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1635− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1636− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1637− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1638− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1639− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1640− SUCH DAMAGE.
1641−
1642−http-client LICENSE file:
1643−
1644− The MIT License (MIT)
1645−
1646− Copyright (c) 2013 Michael Snoyman
1647−
1648− Permission is hereby granted, free of charge, to any person obtaining a copy of
1649− this software and associated documentation files (the "Software"), to deal in
1650− the Software without restriction, including without limitation the rights to
1651− use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
1652− the Software, and to permit persons to whom the Software is furnished to do so,
1653− subject to the following conditions:
1654−
1655− The above copyright notice and this permission notice shall be included in all
1656− copies or substantial portions of the Software.
1657−
1658− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
1659− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
1660− FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
1661− COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
1662− IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
1663− CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1664−
1665−http-client-tls LICENSE file:
1666−
1667− The MIT License (MIT)
1668−
1669− Copyright (c) 2013 Michael Snoyman
1670−
1671− Permission is hereby granted, free of charge, to any person obtaining a copy of
1672− this software and associated documentation files (the "Software"), to deal in
1673− the Software without restriction, including without limitation the rights to
1674− use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
1675− the Software, and to permit persons to whom the Software is furnished to do so,
1676− subject to the following conditions:
1677−
1678− The above copyright notice and this permission notice shall be included in all
1679− copies or substantial portions of the Software.
1680−
1681− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
1682− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
1683− FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
1684− COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
1685− IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
1686− CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1687−
1688−http-types LICENSE file:
1689−
1690− Copyright (c) 2011, Aristid Breitkreuz
1691− Copyright (c) 2011, Michael Snoyman
1692−
1693− All rights reserved.
1694−
1695− Redistribution and use in source and binary forms, with or without
1696− modification, are permitted provided that the following conditions are met:
1697−
1698− * Redistributions of source code must retain the above copyright
1699− notice, this list of conditions and the following disclaimer.
1700−
1701− * Redistributions in binary form must reproduce the above
1702− copyright notice, this list of conditions and the following
1703− disclaimer in the documentation and/or other materials provided
1704− with the distribution.
1705−
1706− * Neither the name of Aristid Breitkreuz nor the names of other
1707− contributors may be used to endorse or promote products derived
1708− from this software without specific prior written permission.
1709−
1710− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1711− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1712− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1713− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1714− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1715− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1716− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1717− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1718− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1719− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1720− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1721−
1722−integer-gmp LICENSE file:
1723−
1724− Copyright (c) 2014, Herbert Valerio Riedel
1725−
1726− All rights reserved.
1727−
1728− Redistribution and use in source and binary forms, with or without
1729− modification, are permitted provided that the following conditions are met:
1730−
1731− * Redistributions of source code must retain the above copyright
1732− notice, this list of conditions and the following disclaimer.
1733−
1734− * Redistributions in binary form must reproduce the above
1735− copyright notice, this list of conditions and the following
1736− disclaimer in the documentation and/or other materials provided
1737− with the distribution.
1738−
1739− * Neither the name of Herbert Valerio Riedel nor the names of other
1740− contributors may be used to endorse or promote products derived
1741− from this software without specific prior written permission.
1742−
1743− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1744− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1745− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1746− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1747− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1748− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1749− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1750− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1751− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1752− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1753− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1754−
1755−language-javascript LICENSE file:
1756−
1757− Copyright (c)2010, Alan Zimmerman
1758−
1759− All rights reserved.
1760−
1761− Redistribution and use in source and binary forms, with or without
1762− modification, are permitted provided that the following conditions are met:
1763−
1764− * Redistributions of source code must retain the above copyright
1765− notice, this list of conditions and the following disclaimer.
1766−
1767− * Redistributions in binary form must reproduce the above
1768− copyright notice, this list of conditions and the following
1769− disclaimer in the documentation and/or other materials provided
1770− with the distribution.
1771−
1772− * Neither the name of Alan Zimmerman nor the names of other
1773− contributors may be used to endorse or promote products derived
1774− from this software without specific prior written permission.
1775−
1776− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1777− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1778− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1779− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1780− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1781− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1782− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1783− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1784− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1785− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1786− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1787−
1788−lifted-base LICENSE file:
1789−
1790− Copyright © 2010-2012, Bas van Dijk, Anders Kaseorg
1791− All rights reserved.
1792−
1793− Redistribution and use in source and binary forms, with or without
1794− modification, are permitted provided that the following conditions are
1795− met:
1796−
1797− • Redistributions of source code must retain the above copyright
1798− notice, this list of conditions and the following disclaimer.
1799−
1800− • Redistributions in binary form must reproduce the above copyright
1801− notice, this list of conditions and the following disclaimer in the
1802− documentation and/or other materials provided with the distribution.
1803−
1804− • Neither the name of the author nor the names of other contributors
1805− may be used to endorse or promote products derived from this
1806− software without specific prior written permission.
1807−
1808− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1809− “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1810− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1811− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1812− HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1813− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1814− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1815− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1816− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1817− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1818− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1819−
1820−memory LICENSE file:
1821−
1822− Copyright (c) 2015 Vincent Hanquez <vincent@snarc.org>
1823−
1824− All rights reserved.
1825−
1826− Redistribution and use in source and binary forms, with or without
1827− modification, are permitted provided that the following conditions
1828− are met:
1829−
1830− 1. Redistributions of source code must retain the above copyright
1831− notice, this list of conditions and the following disclaimer.
1832− 2. Redistributions in binary form must reproduce the above copyright
1833− notice, this list of conditions and the following disclaimer in the
1834− documentation and/or other materials provided with the distribution.
1835− 3. Neither the name of the author nor the names of his contributors
1836− may be used to endorse or promote products derived from this software
1837− without specific prior written permission.
1838−
1839− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS AS IS'' AND
1840− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1841− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1842− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1843− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1844− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1845− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1846− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1847− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1848− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1849− SUCH DAMAGE.
1850−
1851−mime-types LICENSE file:
1852−
1853− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
1854−
1855− Permission is hereby granted, free of charge, to any person obtaining
1856− a copy of this software and associated documentation files (the
1857− "Software"), to deal in the Software without restriction, including
1858− without limitation the rights to use, copy, modify, merge, publish,
1859− distribute, sublicense, and/or sell copies of the Software, and to
1860− permit persons to whom the Software is furnished to do so, subject to
1861− the following conditions:
1862−
1863− The above copyright notice and this permission notice shall be
1864− included in all copies or substantial portions of the Software.
1865−
1866− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
1867− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
1868− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
1869− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
1870− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
1871− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
1872− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1873−
1874−mmorph LICENSE file:
1875−
1876− Copyright (c) 2013, Gabriel Gonzalez
1877− All rights reserved.
1878−
1879− Redistribution and use in source and binary forms, with or without modification,
1880− are permitted provided that the following conditions are met:
1881−
1882− * Redistributions of source code must retain the above copyright notice, this
1883− list of conditions and the following disclaimer.
1884− * Redistributions in binary form must reproduce the above copyright notice, this
1885− list of conditions and the following disclaimer in the documentation and/or
1886− other materials provided with the distribution.
1887− * Neither the name of Gabriel Gonzalez nor the names of other contributors may
1888− be used to endorse or promote products derived from this software without
1889− specific prior written permission.
1890−
1891− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
1892− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1893− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1894− DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
1895− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
1896− (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
1897− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
1898− ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1899− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
1900− SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1901−
1902−monad-control LICENSE file:
1903−
1904− Copyright © 2010, Bas van Dijk, Anders Kaseorg
1905− All rights reserved.
1906−
1907− Redistribution and use in source and binary forms, with or without
1908− modification, are permitted provided that the following conditions are
1909− met:
1910−
1911− • Redistributions of source code must retain the above copyright
1912− notice, this list of conditions and the following disclaimer.
1913−
1914− • Redistributions in binary form must reproduce the above copyright
1915− notice, this list of conditions and the following disclaimer in the
1916− documentation and/or other materials provided with the distribution.
1917−
1918− • Neither the name of the author nor the names of other contributors
1919− may be used to endorse or promote products derived from this
1920− software without specific prior written permission.
1921−
1922− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1923− “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1924− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1925− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1926− HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1927− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1928− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1929− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1930− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1931− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1932− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1933−
1934−monad-logger LICENSE file:
1935−
1936− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
1937−
1938− Permission is hereby granted, free of charge, to any person obtaining
1939− a copy of this software and associated documentation files (the
1940− "Software"), to deal in the Software without restriction, including
1941− without limitation the rights to use, copy, modify, merge, publish,
1942− distribute, sublicense, and/or sell copies of the Software, and to
1943− permit persons to whom the Software is furnished to do so, subject to
1944− the following conditions:
1945−
1946− The above copyright notice and this permission notice shall be
1947− included in all copies or substantial portions of the Software.
1948−
1949− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
1950− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
1951− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
1952− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
1953− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
1954− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
1955− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1956−
1957−monad-loops LICENSE file:
1958−
1959− Page not found: Sorry, it's just not here.
1960−
1961−mtl LICENSE file:
1962−
1963− The Glasgow Haskell Compiler License
1964−
1965− Copyright 2004, The University Court of the University of Glasgow.
1966− All rights reserved.
1967−
1968− Redistribution and use in source and binary forms, with or without
1969− modification, are permitted provided that the following conditions are met:
1970−
1971− - Redistributions of source code must retain the above copyright notice,
1972− this list of conditions and the following disclaimer.
1973−
1974− - Redistributions in binary form must reproduce the above copyright notice,
1975− this list of conditions and the following disclaimer in the documentation
1976− and/or other materials provided with the distribution.
1977−
1978− - Neither name of the University nor the names of its contributors may be
1979− used to endorse or promote products derived from this software without
1980− specific prior written permission.
1981−
1982− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1983− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1984− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1985− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1986− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1987− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1988− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1989− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1990− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1991− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1992− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1993− DAMAGE.
1994−
1995−network LICENSE file:
1996−
1997− Copyright (c) 2002-2010, The University Court of the University of Glasgow.
1998− Copyright (c) 2007-2010, Johan Tibell
1999−
2000− Redistribution and use in source and binary forms, with or without
2001− modification, are permitted provided that the following conditions are met:
2002−
2003− - Redistributions of source code must retain the above copyright notice,
2004− this list of conditions and the following disclaimer.
2005−
2006− - Redistributions in binary form must reproduce the above copyright notice,
2007− this list of conditions and the following disclaimer in the documentation
2008− and/or other materials provided with the distribution.
2009−
2010− - Neither name of the University nor the names of its contributors may be
2011− used to endorse or promote products derived from this software without
2012− specific prior written permission.
2013−
2014− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2015− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2016− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2017− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2018− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2019− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2020− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2021− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2022− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2023− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2024− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2025− DAMAGE.
2026−
2027−network-uri LICENSE file:
2028−
2029− Copyright (c) 2002-2010, The University Court of the University of Glasgow.
2030− Copyright (c) 2007-2010, Johan Tibell
2031−
2032− Redistribution and use in source and binary forms, with or without
2033− modification, are permitted provided that the following conditions are met:
2034−
2035− - Redistributions of source code must retain the above copyright notice,
2036− this list of conditions and the following disclaimer.
2037−
2038− - Redistributions in binary form must reproduce the above copyright notice,
2039− this list of conditions and the following disclaimer in the documentation
2040− and/or other materials provided with the distribution.
2041−
2042− - Neither name of the University nor the names of its contributors may be
2043− used to endorse or promote products derived from this software without
2044− specific prior written permission.
2045−
2046− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2047− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2048− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2049− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2050− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2051− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2052− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2053− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2054− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2055− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2056− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2057− DAMAGE.
2058−
2059−old-locale LICENSE file:
2060−
2061− This library (libraries/base) is derived from code from two
2062− sources:
2063−
2064− * Code from the GHC project which is largely (c) The University of
2065− Glasgow, and distributable under a BSD-style license (see below),
2066−
2067− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
2068− and freely redistributable (but see the full license for
2069− restrictions).
2070−
2071− The full text of these licenses is reproduced below. Both of the
2072− licenses are BSD-style or compatible.
2073−
2074− -----------------------------------------------------------------------------
2075−
2076− The Glasgow Haskell Compiler License
2077−
2078− Copyright 2004, The University Court of the University of Glasgow.
2079− All rights reserved.
2080−
2081− Redistribution and use in source and binary forms, with or without
2082− modification, are permitted provided that the following conditions are met:
2083−
2084− - Redistributions of source code must retain the above copyright notice,
2085− this list of conditions and the following disclaimer.
2086−
2087− - Redistributions in binary form must reproduce the above copyright notice,
2088− this list of conditions and the following disclaimer in the documentation
2089− and/or other materials provided with the distribution.
2090−
2091− - Neither name of the University nor the names of its contributors may be
2092− used to endorse or promote products derived from this software without
2093− specific prior written permission.
2094−
2095− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2096− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2097− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2098− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2099− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2100− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2101− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2102− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2103− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2104− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2105− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2106− DAMAGE.
2107−
2108− -----------------------------------------------------------------------------
2109−
2110− Code derived from the document "Report on the Programming Language
2111− Haskell 98", is distributed under the following license:
2112−
2113− Copyright (c) 2002 Simon Peyton Jones
2114−
2115− The authors intend this Report to belong to the entire Haskell
2116− community, and so we grant permission to copy and distribute it for
2117− any purpose, provided that it is reproduced in its entirety,
2118− including this Notice. Modified versions of this Report may also be
2119− copied and distributed for any purpose, provided that the modified
2120− version is clearly presented as such, and that it does not claim to
2121− be a definition of the Haskell 98 Language.
2122−
2123− -----------------------------------------------------------------------------
2124−
2125−optparse-applicative LICENSE file:
2126−
2127− Copyright (c) 2012, Paolo Capriotti
2128−
2129− All rights reserved.
2130−
2131− Redistribution and use in source and binary forms, with or without
2132− modification, are permitted provided that the following conditions are met:
2133−
2134− * Redistributions of source code must retain the above copyright
2135− notice, this list of conditions and the following disclaimer.
2136−
2137− * Redistributions in binary form must reproduce the above
2138− copyright notice, this list of conditions and the following
2139− disclaimer in the documentation and/or other materials provided
2140− with the distribution.
2141−
2142− * Neither the name of Paolo Capriotti nor the names of other
2143− contributors may be used to endorse or promote products derived
2144− from this software without specific prior written permission.
2145−
2146− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2147− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2148− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2149− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2150− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2151− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2152− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2153− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2154− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2155− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2156− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2157−
2158−parallel LICENSE file:
2159−
2160− This library (libraries/parallel) is derived from code from
2161− the GHC project which is largely (c) The University of
2162− Glasgow, and distributable under a BSD-style license (see below).
2163−
2164− -----------------------------------------------------------------------------
2165−
2166− The Glasgow Haskell Compiler License
2167−
2168− Copyright 2004, The University Court of the University of Glasgow.
2169− All rights reserved.
2170−
2171− Redistribution and use in source and binary forms, with or without
2172− modification, are permitted provided that the following conditions are met:
2173−
2174− - Redistributions of source code must retain the above copyright notice,
2175− this list of conditions and the following disclaimer.
2176−
2177− - Redistributions in binary form must reproduce the above copyright notice,
2178− this list of conditions and the following disclaimer in the documentation
2179− and/or other materials provided with the distribution.
2180−
2181− - Neither name of the University nor the names of its contributors may be
2182− used to endorse or promote products derived from this software without
2183− specific prior written permission.
2184−
2185− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2186− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2187− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2188− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2189− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2190− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2191− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2192− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2193− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2194− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2195− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2196− DAMAGE.
2197−
2198− -----------------------------------------------------------------------------
2199−
2200−parsec LICENSE file:
2201−
2202− Copyright 1999-2000, Daan Leijen; 2007, Paolo Martini. All rights reserved.
2203−
2204− Redistribution and use in source and binary forms, with or without
2205− modification, are permitted provided that the following conditions are met:
2206−
2207− * Redistributions of source code must retain the above copyright notice,
2208− this list of conditions and the following disclaimer.
2209− * Redistributions in binary form must reproduce the above copyright
2210− notice, this list of conditions and the following disclaimer in the
2211− documentation and/or other materials provided with the distribution.
2212−
2213− This software is provided by the copyright holders "as is" and any express or
2214− implied warranties, including, but not limited to, the implied warranties of
2215− merchantability and fitness for a particular purpose are disclaimed. In no
2216− event shall the copyright holders be liable for any direct, indirect,
2217− incidental, special, exemplary, or consequential damages (including, but not
2218− limited to, procurement of substitute goods or services; loss of use, data,
2219− or profits; or business interruption) however caused and on any theory of
2220− liability, whether in contract, strict liability, or tort (including
2221− negligence or otherwise) arising in any way out of the use of this software,
2222− even if advised of the possibility of such damage.
2223−
2224−pattern-arrows LICENSE file:
2225−
2226− The MIT License (MIT)
2227−
2228− Copyright (c) 2013 Phil Freeman
2229−
2230− Permission is hereby granted, free of charge, to any person obtaining a copy of
2231− this software and associated documentation files (the "Software"), to deal in
2232− the Software without restriction, including without limitation the rights to
2233− use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
2234− the Software, and to permit persons to whom the Software is furnished to do so,
2235− subject to the following conditions:
2236−
2237− The above copyright notice and this permission notice shall be included in all
2238− copies or substantial portions of the Software.
2239−
2240− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
2241− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
2242− FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
2243− COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
2244− IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
2245− CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
2246−
2247−pem LICENSE file:
2248−
2249− Copyright (c) 2010-2012 Vincent Hanquez <vincent@snarc.org>
2250−
2251− All rights reserved.
2252−
2253− Redistribution and use in source and binary forms, with or without
2254− modification, are permitted provided that the following conditions
2255− are met:
2256− 1. Redistributions of source code must retain the above copyright
2257− notice, this list of conditions and the following disclaimer.
2258− 2. Redistributions in binary form must reproduce the above copyright
2259− notice, this list of conditions and the following disclaimer in the
2260− documentation and/or other materials provided with the distribution.
2261− 3. Neither the name of the author nor the names of his contributors
2262− may be used to endorse or promote products derived from this software
2263− without specific prior written permission.
2264−
2265− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
2266− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2267− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2268− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
2269− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2270− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2271− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2272− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2273− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2274− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2275− SUCH DAMAGE.
2276−
2277−pipes LICENSE file:
2278−
2279− Copyright (c) 2012-2014 Gabriel Gonzalez
2280− All rights reserved.
2281−
2282− Redistribution and use in source and binary forms, with or without modification,
2283− are permitted provided that the following conditions are met:
2284− * Redistributions of source code must retain the above copyright notice,
2285− this list of conditions and the following disclaimer.
2286− * Redistributions in binary form must reproduce the above copyright notice,
2287− this list of conditions and the following disclaimer in the documentation
2288− and/or other materials provided with the distribution.
2289− * Neither the name of Gabriel Gonzalez nor the names of other contributors
2290− may be used to endorse or promote products derived from this software
2291− without specific prior written permission.
2292−
2293− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
2294− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
2295− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
2296− DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
2297− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
2298− (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2299− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
2300− ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2301− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
2302− SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2303−
2304−pipes-http LICENSE file:
2305−
2306− Copyright (c) 2014 Gabriel Gonzalez
2307− All rights reserved.
2308−
2309− Redistribution and use in source and binary forms, with or without modification,
2310− are permitted provided that the following conditions are met:
2311− * Redistributions of source code must retain the above copyright notice,
2312− this list of conditions and the following disclaimer.
2313− * Redistributions in binary form must reproduce the above copyright notice,
2314− this list of conditions and the following disclaimer in the documentation
2315− and/or other materials provided with the distribution.
2316− * Neither the name of Gabriel Gonzalez nor the names of other contributors
2317− may be used to endorse or promote products derived from this software
2318− without specific prior written permission.
2319−
2320− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
2321− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
2322− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
2323− DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
2324− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
2325− (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2326− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
2327− ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2328− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
2329− SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2330−
2331−primitive LICENSE file:
2332−
2333− Copyright (c) 2008-2009, Roman Leshchinskiy
2334− All rights reserved.
2335−
2336− Redistribution and use in source and binary forms, with or without
2337− modification, are permitted provided that the following conditions are met:
2338−
2339− - Redistributions of source code must retain the above copyright notice,
2340− this list of conditions and the following disclaimer.
2341−
2342− - Redistributions in binary form must reproduce the above copyright notice,
2343− this list of conditions and the following disclaimer in the documentation
2344− and/or other materials provided with the distribution.
2345−
2346− - Neither name of the University nor the names of its contributors may be
2347− used to endorse or promote products derived from this software without
2348− specific prior written permission.
2349−
2350− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2351− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2352− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2353− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2354− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2355− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2356− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2357− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2358− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2359− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2360− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2361− DAMAGE.
2362−
2363−
2364−process LICENSE file:
2365−
2366− This library (libraries/process) is derived from code from two
2367− sources:
2368−
2369− * Code from the GHC project which is largely (c) The University of
2370− Glasgow, and distributable under a BSD-style license (see below),
2371−
2372− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
2373− and freely redistributable (but see the full license for
2374− restrictions).
2375−
2376− The full text of these licenses is reproduced below. Both of the
2377− licenses are BSD-style or compatible.
2378−
2379− -----------------------------------------------------------------------------
2380−
2381− The Glasgow Haskell Compiler License
2382−
2383− Copyright 2004, The University Court of the University of Glasgow.
2384− All rights reserved.
2385−
2386− Redistribution and use in source and binary forms, with or without
2387− modification, are permitted provided that the following conditions are met:
2388−
2389− - Redistributions of source code must retain the above copyright notice,
2390− this list of conditions and the following disclaimer.
2391−
2392− - Redistributions in binary form must reproduce the above copyright notice,
2393− this list of conditions and the following disclaimer in the documentation
2394− and/or other materials provided with the distribution.
2395−
2396− - Neither name of the University nor the names of its contributors may be
2397− used to endorse or promote products derived from this software without
2398− specific prior written permission.
2399−
2400− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2401− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2402− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2403− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2404− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2405− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2406− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2407− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2408− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2409− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2410− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2411− DAMAGE.
2412−
2413− -----------------------------------------------------------------------------
2414−
2415− Code derived from the document "Report on the Programming Language
2416− Haskell 98", is distributed under the following license:
2417−
2418− Copyright (c) 2002 Simon Peyton Jones
2419−
2420− The authors intend this Report to belong to the entire Haskell
2421− community, and so we grant permission to copy and distribute it for
2422− any purpose, provided that it is reproduced in its entirety,
2423− including this Notice. Modified versions of this Report may also be
2424− copied and distributed for any purpose, provided that the modified
2425− version is clearly presented as such, and that it does not claim to
2426− be a definition of the Haskell 98 Language.
2427−
2428− -----------------------------------------------------------------------------
2429−
2430−random LICENSE file:
2431−
2432− This library (libraries/base) is derived from code from two
2433− sources:
2434−
2435− * Code from the GHC project which is largely (c) The University of
2436− Glasgow, and distributable under a BSD-style license (see below),
2437−
2438− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
2439− and freely redistributable (but see the full license for
2440− restrictions).
2441−
2442− The full text of these licenses is reproduced below. Both of the
2443− licenses are BSD-style or compatible.
2444−
2445− -----------------------------------------------------------------------------
2446−
2447− The Glasgow Haskell Compiler License
2448−
2449− Copyright 2004, The University Court of the University of Glasgow.
2450− All rights reserved.
2451−
2452− Redistribution and use in source and binary forms, with or without
2453− modification, are permitted provided that the following conditions are met:
2454−
2455− - Redistributions of source code must retain the above copyright notice,
2456− this list of conditions and the following disclaimer.
2457−
2458− - Redistributions in binary form must reproduce the above copyright notice,
2459− this list of conditions and the following disclaimer in the documentation
2460− and/or other materials provided with the distribution.
2461−
2462− - Neither name of the University nor the names of its contributors may be
2463− used to endorse or promote products derived from this software without
2464− specific prior written permission.
2465−
2466− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2467− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2468− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2469− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2470− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2471− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2472− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2473− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2474− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2475− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2476− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2477− DAMAGE.
2478−
2479− -----------------------------------------------------------------------------
2480−
2481− Code derived from the document "Report on the Programming Language
2482− Haskell 98", is distributed under the following license:
2483−
2484− Copyright (c) 2002 Simon Peyton Jones
2485−
2486− The authors intend this Report to belong to the entire Haskell
2487− community, and so we grant permission to copy and distribute it for
2488− any purpose, provided that it is reproduced in its entirety,
2489− including this Notice. Modified versions of this Report may also be
2490− copied and distributed for any purpose, provided that the modified
2491− version is clearly presented as such, and that it does not claim to
2492− be a definition of the Haskell 98 Language.
2493−
2494− -----------------------------------------------------------------------------
2495−
2496−regex-base LICENSE file:
2497−
2498− This modile is under this "3 clause" BSD license:
2499−
2500− Copyright (c) 2007, Christopher Kuklewicz
2501− All rights reserved.
2502−
2503− Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
2504−
2505− * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
2506− * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
2507− * The names of the contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
2508−
2509− 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.
2510−
2511−regex-tdfa LICENSE file:
2512−
2513− This modile is under this "3 clause" BSD license:
2514−
2515− Copyright (c) 2007-2009, Christopher Kuklewicz
2516− All rights reserved.
2517−
2518− Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
2519−
2520− * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
2521− * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
2522− * The names of the contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
2523−
2524− 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.
2525−
2526−resourcet LICENSE file:
2527−
2528− Copyright (c)2011, Michael Snoyman
2529−
2530− All rights reserved.
2531−
2532− Redistribution and use in source and binary forms, with or without
2533− modification, are permitted provided that the following conditions are met:
2534−
2535− * Redistributions of source code must retain the above copyright
2536− notice, this list of conditions and the following disclaimer.
2537−
2538− * Redistributions in binary form must reproduce the above
2539− copyright notice, this list of conditions and the following
2540− disclaimer in the documentation and/or other materials provided
2541− with the distribution.
2542−
2543− * Neither the name of Michael Snoyman nor the names of other
2544− contributors may be used to endorse or promote products derived
2545− from this software without specific prior written permission.
2546−
2547− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2548− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2549− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2550− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2551− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2552− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2553− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2554− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2555− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2556− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2557− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2558−
2559−safe LICENSE file:
2560−
2561− Copyright Neil Mitchell 2007-2015.
2562− All rights reserved.
2563−
2564− Redistribution and use in source and binary forms, with or without
2565− modification, are permitted provided that the following conditions are
2566− met:
2567−
2568− * Redistributions of source code must retain the above copyright
2569− notice, this list of conditions and the following disclaimer.
2570−
2571− * Redistributions in binary form must reproduce the above
2572− copyright notice, this list of conditions and the following
2573− disclaimer in the documentation and/or other materials provided
2574− with the distribution.
2575−
2576− * Neither the name of Neil Mitchell nor the names of other
2577− contributors may be used to endorse or promote products derived
2578− from this software without specific prior written permission.
2579−
2580− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2581− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2582− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2583− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2584− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2585− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2586− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2587− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2588− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2589− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2590− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2591−
2592−scientific LICENSE file:
2593−
2594− Copyright (c) 2013, Bas van Dijk
2595−
2596− All rights reserved.
2597−
2598− Redistribution and use in source and binary forms, with or without
2599− modification, are permitted provided that the following conditions are met:
2600−
2601− * Redistributions of source code must retain the above copyright
2602− notice, this list of conditions and the following disclaimer.
2603−
2604− * Redistributions in binary form must reproduce the above
2605− copyright notice, this list of conditions and the following
2606− disclaimer in the documentation and/or other materials provided
2607− with the distribution.
2608−
2609− * Neither the name of Bas van Dijk nor the names of other
2610− contributors may be used to endorse or promote products derived
2611− from this software without specific prior written permission.
2612−
2613− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2614− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2615− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2616− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2617− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2618− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2619− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2620− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2621− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2622− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2623− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2624−
2625−semigroups LICENSE file:
2626−
2627− Copyright 2011-2015 Edward Kmett
2628−
2629− All rights reserved.
2630−
2631− Redistribution and use in source and binary forms, with or without
2632− modification, are permitted provided that the following conditions
2633− are met:
2634−
2635− 1. Redistributions of source code must retain the above copyright
2636− notice, this list of conditions and the following disclaimer.
2637−
2638− 2. Redistributions in binary form must reproduce the above copyright
2639− notice, this list of conditions and the following disclaimer in the
2640− documentation and/or other materials provided with the distribution.
2641−
2642− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
2643− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
2644− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
2645− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
2646− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2647− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2648− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2649− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
2650− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
2651− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
2652− POSSIBILITY OF SUCH DAMAGE.
2653−
2654−socks LICENSE file:
2655−
2656− Copyright (c) 2010-2011 Vincent Hanquez <vincent@snarc.org>
2657−
2658− All rights reserved.
2659−
2660− Redistribution and use in source and binary forms, with or without
2661− modification, are permitted provided that the following conditions
2662− are met:
2663− 1. Redistributions of source code must retain the above copyright
2664− notice, this list of conditions and the following disclaimer.
2665− 2. Redistributions in binary form must reproduce the above copyright
2666− notice, this list of conditions and the following disclaimer in the
2667− documentation and/or other materials provided with the distribution.
2668− 3. Neither the name of the author nor the names of his contributors
2669− may be used to endorse or promote products derived from this software
2670− without specific prior written permission.
2671−
2672− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
2673− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2674− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2675− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
2676− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2677− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2678− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2679− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2680− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2681− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2682− SUCH DAMAGE.
2683−
2684−sourcemap LICENSE file:
2685−
2686− Copyright (c) 2012, Chris Done
2687−
2688− All rights reserved.
2689−
2690− Redistribution and use in source and binary forms, with or without
2691− modification, are permitted provided that the following conditions are met:
2692−
2693− * Redistributions of source code must retain the above copyright
2694− notice, this list of conditions and the following disclaimer.
2695−
2696− * Redistributions in binary form must reproduce the above
2697− copyright notice, this list of conditions and the following
2698− disclaimer in the documentation and/or other materials provided
2699− with the distribution.
2700−
2701− * Neither the name of Chris Done nor the names of other
2702− contributors may be used to endorse or promote products derived
2703− from this software without specific prior written permission.
2704−
2705− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2706− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2707− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2708− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2709− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2710− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2711− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2712− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2713− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2714− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2715− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2716−
2717−spdx LICENSE file:
2718−
2719− Copyright (c) 2015, Oleg Grenrus
2720−
2721− All rights reserved.
2722−
2723− Redistribution and use in source and binary forms, with or without
2724− modification, are permitted provided that the following conditions are met:
2725−
2726− * Redistributions of source code must retain the above copyright
2727− notice, this list of conditions and the following disclaimer.
2728−
2729− * Redistributions in binary form must reproduce the above
2730− copyright notice, this list of conditions and the following
2731− disclaimer in the documentation and/or other materials provided
2732− with the distribution.
2733−
2734− * Neither the name of Oleg Grenrus nor the names of other
2735− contributors may be used to endorse or promote products derived
2736− from this software without specific prior written permission.
2737−
2738− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2739− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2740− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2741− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2742− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2743− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2744− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2745− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2746− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2747− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2748− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2749−
2750−split LICENSE file:
2751−
2752− Copyright (c) 2008 Brent Yorgey, Louis Wasserman
2753−
2754− All rights reserved.
2755−
2756− Redistribution and use in source and binary forms, with or without
2757− modification, are permitted provided that the following conditions
2758− are met:
2759− 1. Redistributions of source code must retain the above copyright
2760− notice, this list of conditions and the following disclaimer.
2761− 2. Redistributions in binary form must reproduce the above copyright
2762− notice, this list of conditions and the following disclaimer in the
2763− documentation and/or other materials provided with the distribution.
2764− 3. Neither the name of the author nor the names of other contributors
2765− may be used to endorse or promote products derived from this software
2766− without specific prior written permission.
2767−
2768− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND
2769− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2770− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2771− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
2772− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2773− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2774− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2775− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2776− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2777− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2778− SUCH DAMAGE.
2779−
2780−stm LICENSE file:
2781−
2782− The Glasgow Haskell Compiler License
2783−
2784− Copyright 2004, The University Court of the University of Glasgow.
2785− All rights reserved.
2786−
2787− Redistribution and use in source and binary forms, with or without
2788− modification, are permitted provided that the following conditions are met:
2789−
2790− - Redistributions of source code must retain the above copyright notice,
2791− this list of conditions and the following disclaimer.
2792−
2793− - Redistributions in binary form must reproduce the above copyright notice,
2794− this list of conditions and the following disclaimer in the documentation
2795− and/or other materials provided with the distribution.
2796−
2797− - Neither name of the University nor the names of its contributors may be
2798− used to endorse or promote products derived from this software without
2799− specific prior written permission.
2800−
2801− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2802− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2803− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2804− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2805− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2806− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2807− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2808− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2809− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2810− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2811− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2812− DAMAGE.
2813−
2814−stm-chans LICENSE file:
2815−
2816− === stm-chans license ===
2817−
2818− Copyright (c) 2011--2013, wren gayle romano.
2819− ALL RIGHTS RESERVED.
2820−
2821− Redistribution and use in source and binary forms, with or without
2822− modification, are permitted provided that the following conditions
2823− are met:
2824−
2825− * Redistributions of source code must retain the above copyright
2826− notice, this list of conditions and the following disclaimer.
2827−
2828− * Redistributions in binary form must reproduce the above
2829− copyright notice, this list of conditions and the following
2830− disclaimer in the documentation and/or other materials provided
2831− with the distribution.
2832−
2833− * Neither the name of the copyright holders nor the names of
2834− other contributors may be used to endorse or promote products
2835− derived from this software without specific prior written
2836− permission.
2837−
2838− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2839− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2840− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
2841− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2842− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
2843− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
2844− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2845− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2846− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2847− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
2848− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
2849− POSSIBILITY OF SUCH DAMAGE.
2850−
2851−
2852−streaming-commons LICENSE file:
2853−
2854− The MIT License (MIT)
2855−
2856− Copyright (c) 2014 FP Complete
2857−
2858− Permission is hereby granted, free of charge, to any person obtaining a copy
2859− of this software and associated documentation files (the "Software"), to deal
2860− in the Software without restriction, including without limitation the rights
2861− to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
2862− copies of the Software, and to permit persons to whom the Software is
2863− furnished to do so, subject to the following conditions:
2864−
2865− The above copyright notice and this permission notice shall be included in all
2866− copies or substantial portions of the Software.
2867−
2868− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
2869− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
2870− FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
2871− AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
2872− LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
2873− OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
2874− SOFTWARE.
2875−
2876−syb LICENSE file:
2877−
2878− This library (libraries/syb) is derived from code from several
2879− sources:
2880−
2881− * Code from the GHC project which is largely (c) The University of
2882− Glasgow, and distributable under a BSD-style license (see below),
2883−
2884− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
2885− and freely redistributable (but see the full license for
2886− restrictions).
2887−
2888− * Code from the Haskell Foreign Function Interface specification,
2889− which is (c) Manuel M. T. Chakravarty and freely redistributable
2890− (but see the full license for restrictions).
2891−
2892− The full text of these licenses is reproduced below. All of the
2893− licenses are BSD-style or compatible.
2894−
2895− -----------------------------------------------------------------------------
2896−
2897− The Glasgow Haskell Compiler License
2898−
2899− Copyright 2004, The University Court of the University of Glasgow.
2900− All rights reserved.
2901−
2902− Redistribution and use in source and binary forms, with or without
2903− modification, are permitted provided that the following conditions are met:
2904−
2905− - Redistributions of source code must retain the above copyright notice,
2906− this list of conditions and the following disclaimer.
2907−
2908− - Redistributions in binary form must reproduce the above copyright notice,
2909− this list of conditions and the following disclaimer in the documentation
2910− and/or other materials provided with the distribution.
2911−
2912− - Neither name of the University nor the names of its contributors may be
2913− used to endorse or promote products derived from this software without
2914− specific prior written permission.
2915−
2916− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2917− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2918− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2919− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2920− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2921− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2922− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2923− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2924− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2925− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2926− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2927− DAMAGE.
2928−
2929− -----------------------------------------------------------------------------
2930−
2931− Code derived from the document "Report on the Programming Language
2932− Haskell 98", is distributed under the following license:
2933−
2934− Copyright (c) 2002 Simon Peyton Jones
2935−
2936− The authors intend this Report to belong to the entire Haskell
2937− community, and so we grant permission to copy and distribute it for
2938− any purpose, provided that it is reproduced in its entirety,
2939− including this Notice. Modified versions of this Report may also be
2940− copied and distributed for any purpose, provided that the modified
2941− version is clearly presented as such, and that it does not claim to
2942− be a definition of the Haskell 98 Language.
2943−
2944− -----------------------------------------------------------------------------
2945−
2946− Code derived from the document "The Haskell 98 Foreign Function
2947− Interface, An Addendum to the Haskell 98 Report" is distributed under
2948− the following license:
2949−
2950− Copyright (c) 2002 Manuel M. T. Chakravarty
2951−
2952− The authors intend this Report to belong to the entire Haskell
2953− community, and so we grant permission to copy and distribute it for
2954− any purpose, provided that it is reproduced in its entirety,
2955− including this Notice. Modified versions of this Report may also be
2956− copied and distributed for any purpose, provided that the modified
2957− version is clearly presented as such, and that it does not claim to
2958− be a definition of the Haskell 98 Foreign Function Interface.
2959−
2960− -----------------------------------------------------------------------------
2961−
2962−tagged LICENSE file:
2963−
2964− Copyright (c) 2009-2015 Edward Kmett
2965− All rights reserved.
2966−
2967− Redistribution and use in source and binary forms, with or without
2968− modification, are permitted provided that the following conditions are
2969− met:
2970−
2971− * Redistributions of source code must retain the above copyright
2972− notice, this list of conditions and the following disclaimer.
2973−
2974− * Redistributions in binary form must reproduce the above
2975− copyright notice, this list of conditions and the following
2976− disclaimer in the documentation and/or other materials provided
2977− with the distribution.
2978−
2979− * Neither the name of Edward Kmett nor the names of other
2980− contributors may be used to endorse or promote products derived
2981− from this software without specific prior written permission.
2982−
2983− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2984− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2985− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2986− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2987− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2988− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2989− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2990− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2991− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2992− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2993− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2994−
2995−template-haskell LICENSE file:
2996−
2997−
2998− The Glasgow Haskell Compiler License
2999−
3000− Copyright 2002-2007, The University Court of the University of Glasgow.
3001− All rights reserved.
3002−
3003− Redistribution and use in source and binary forms, with or without
3004− modification, are permitted provided that the following conditions are met:
3005−
3006− - Redistributions of source code must retain the above copyright notice,
3007− this list of conditions and the following disclaimer.
3008−
3009− - Redistributions in binary form must reproduce the above copyright notice,
3010− this list of conditions and the following disclaimer in the documentation
3011− and/or other materials provided with the distribution.
3012−
3013− - Neither name of the University nor the names of its contributors may be
3014− used to endorse or promote products derived from this software without
3015− specific prior written permission.
3016−
3017− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3018− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3019− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3020− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3021− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3022− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3023− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3024− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3025− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3026− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3027− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3028− DAMAGE.
3029−
3030−
3031−terminfo LICENSE file:
3032−
3033− Copyright 2007, Judah Jacobson.
3034− All Rights Reserved.
3035−
3036− Redistribution and use in source and binary forms, with or without
3037− modification, are permitted provided that the following conditions are met:
3038−
3039− - Redistribution of source code must retain the above copyright notice,
3040− this list of conditions and the following disclamer.
3041−
3042− - Redistribution in binary form must reproduce the above copyright notice,
3043− this list of conditions and the following disclamer in the documentation
3044− and/or other materials provided with the distribution.
3045−
3046− THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY
3047− EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
3048− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
3049− DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR THE CONTRIBUTORS BE LIABLE
3050− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3051− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3052− SERVICES; LOSS OF USE, DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3053− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
3054− OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
3055− USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3056−
3057−text LICENSE file:
3058−
3059− Copyright (c) 2008-2009, Tom Harper
3060− All rights reserved.
3061−
3062− Redistribution and use in source and binary forms, with or without
3063− modification, are permitted provided that the following conditions
3064− are met:
3065−
3066− * Redistributions of source code must retain the above copyright
3067− notice, this list of conditions and the following disclaimer.
3068−
3069− * Redistributions in binary form must reproduce the above
3070− copyright notice, this list of conditions and the following
3071− disclaimer in the documentation and/or other materials provided
3072− with the distribution.
3073−
3074− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3075− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3076− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3077− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3078− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3079− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3080− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3081− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3082− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3083− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3084− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3085−
3086−time LICENSE file:
3087−
3088− TimeLib is Copyright (c) Ashley Yakeley, 2004-2014. All rights reserved.
3089− Certain sections are Copyright 2004, The University Court of the University of Glasgow. All rights reserved.
3090−
3091− Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
3092−
3093− - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
3094−
3095− - 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.
3096−
3097− 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.
3098−
3099−tls LICENSE file:
3100−
3101− Copyright (c) 2010-2015 Vincent Hanquez <vincent@snarc.org>
3102−
3103− All rights reserved.
3104−
3105− Redistribution and use in source and binary forms, with or without
3106− modification, are permitted provided that the following conditions
3107− are met:
3108− 1. Redistributions of source code must retain the above copyright
3109− notice, this list of conditions and the following disclaimer.
3110− 2. Redistributions in binary form must reproduce the above copyright
3111− notice, this list of conditions and the following disclaimer in the
3112− documentation and/or other materials provided with the distribution.
3113− 3. Neither the name of the author nor the names of his contributors
3114− may be used to endorse or promote products derived from this software
3115− without specific prior written permission.
3116−
3117− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
3118− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3119− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
3120− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
3121− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3122− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3123− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3124− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3125− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3126− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3127− SUCH DAMAGE.
3128−
3129−transformers LICENSE file:
3130−
3131− The Glasgow Haskell Compiler License
3132−
3133− Copyright 2004, The University Court of the University of Glasgow.
3134− All rights reserved.
3135−
3136− Redistribution and use in source and binary forms, with or without
3137− modification, are permitted provided that the following conditions are met:
3138−
3139− - Redistributions of source code must retain the above copyright notice,
3140− this list of conditions and the following disclaimer.
3141−
3142− - Redistributions in binary form must reproduce the above copyright notice,
3143− this list of conditions and the following disclaimer in the documentation
3144− and/or other materials provided with the distribution.
3145−
3146− - Neither name of the University nor the names of its contributors may be
3147− used to endorse or promote products derived from this software without
3148− specific prior written permission.
3149−
3150− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3151− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3152− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3153− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3154− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3155− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3156− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3157− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3158− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3159− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3160− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3161− DAMAGE.
3162−
3163−transformers-base LICENSE file:
3164−
3165− Copyright (c) 2011, Mikhail Vorozhtsov, Bas van Dijk
3166− All rights reserved.
3167−
3168− Redistribution and use in source and binary forms, with or without
3169− modification, are permitted provided that the following conditions are met:
3170−
3171− - Redistributions of source code must retain the above copyright notice,
3172− this list of conditions and the following disclaimer.
3173− - Redistributions in binary form must reproduce the above copyright
3174− notice, this list of conditions and the following disclaimer in the
3175− documentation and/or other materials provided with the distribution.
3176− - Neither the names of the copyright owners nor the names of the
3177− contributors may be used to endorse or promote products derived
3178− from this software without specific prior written permission.
3179−
3180− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3181− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3182− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3183− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3184− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3185− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3186− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3187− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3188− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3189− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3190− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3191−
3192−
3193−transformers-compat LICENSE file:
3194−
3195− Copyright 2012-2015 Edward Kmett
3196−
3197− All rights reserved.
3198−
3199− Redistribution and use in source and binary forms, with or without
3200− modification, are permitted provided that the following conditions
3201− are met:
3202−
3203− 1. Redistributions of source code must retain the above copyright
3204− notice, this list of conditions and the following disclaimer.
3205−
3206− 2. Redistributions in binary form must reproduce the above copyright
3207− notice, this list of conditions and the following disclaimer in the
3208− documentation and/or other materials provided with the distribution.
3209−
3210− 3. Neither the name of the author nor the names of his contributors
3211− may be used to endorse or promote products derived from this software
3212− without specific prior written permission.
3213−
3214− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
3215− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
3216− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
3217− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
3218− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3219− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3220− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3221− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
3222− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
3223− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
3224− POSSIBILITY OF SUCH DAMAGE.
3225−
3226−unix LICENSE file:
3227−
3228− The Glasgow Haskell Compiler License
3229−
3230− Copyright 2004, The University Court of the University of Glasgow.
3231− All rights reserved.
3232−
3233− Redistribution and use in source and binary forms, with or without
3234− modification, are permitted provided that the following conditions are met:
3235−
3236− - Redistributions of source code must retain the above copyright notice,
3237− this list of conditions and the following disclaimer.
3238−
3239− - Redistributions in binary form must reproduce the above copyright notice,
3240− this list of conditions and the following disclaimer in the documentation
3241− and/or other materials provided with the distribution.
3242−
3243− - Neither name of the University nor the names of its contributors may be
3244− used to endorse or promote products derived from this software without
3245− specific prior written permission.
3246−
3247− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3248− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3249− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3250− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3251− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3252− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3253− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3254− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3255− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3256− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3257− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3258− DAMAGE.
3259−
3260−unix-compat LICENSE file:
3261−
3262− Copyright (c) 2007-2008, Björn Bringert
3263− Copyright (c) 2007-2009, Duncan Coutts
3264− Copyright (c) 2010-2011, Jacob Stanley
3265− Copyright (c) 2011, Bryan O'Sullivan
3266− All rights reserved.
3267−
3268− Redistribution and use in source and binary forms, with or without
3269− modification, are permitted provided that the following conditions are met:
3270−
3271− - Redistributions of source code must retain the above copyright notice,
3272− this list of conditions and the following disclaimer.
3273− - Redistributions in binary form must reproduce the above copyright
3274− notice, this list of conditions and the following disclaimer in the
3275− documentation and/or other materials provided with the distribution.
3276− - Neither the names of the copyright owners nor the names of the
3277− contributors may be used to endorse or promote products derived
3278− from this software without specific prior written permission.
3279−
3280− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3281− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3282− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3283− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3284− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3285− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3286− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3287− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3288− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3289− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3290− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3291−
3292−unordered-containers LICENSE file:
3293−
3294− Copyright (c) 2010, Johan Tibell
3295−
3296− All rights reserved.
3297−
3298− Redistribution and use in source and binary forms, with or without
3299− modification, are permitted provided that the following conditions are met:
3300−
3301− * Redistributions of source code must retain the above copyright
3302− notice, this list of conditions and the following disclaimer.
3303−
3304− * Redistributions in binary form must reproduce the above
3305− copyright notice, this list of conditions and the following
3306− disclaimer in the documentation and/or other materials provided
3307− with the distribution.
3308−
3309− * Neither the name of Johan Tibell nor the names of other
3310− contributors may be used to endorse or promote products derived
3311− from this software without specific prior written permission.
3312−
3313− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3314− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3315− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3316− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3317− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3318− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3319− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3320− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3321− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3322− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3323− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3324−
3325−utf8-string LICENSE file:
3326−
3327− * Copyright (c) 2007, Galois Inc.
3328− * All rights reserved.
3329− *
3330− * Redistribution and use in source and binary forms, with or without
3331− * modification, are permitted provided that the following conditions are met:
3332− * * Redistributions of source code must retain the above copyright
3333− * notice, this list of conditions and the following disclaimer.
3334− * * Redistributions in binary form must reproduce the above copyright
3335− * notice, this list of conditions and the following disclaimer in the
3336− * documentation and/or other materials provided with the distribution.
3337− * * Neither the name of Galois Inc. nor the
3338− * names of its contributors may be used to endorse or promote products
3339− * derived from this software without specific prior written permission.
3340− *
3341− * THIS SOFTWARE IS PROVIDED BY Galois Inc. ``AS IS'' AND ANY
3342− * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
3343− * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
3344− * DISCLAIMED. IN NO EVENT SHALL Galois Inc. BE LIABLE FOR ANY
3345− * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
3346− * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
3347− * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
3348− * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3349− * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
3350− * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3351−
3352−vector LICENSE file:
3353−
3354− Copyright (c) 2008-2012, Roman Leshchinskiy
3355− All rights reserved.
3356−
3357− Redistribution and use in source and binary forms, with or without
3358− modification, are permitted provided that the following conditions are met:
3359−
3360− - Redistributions of source code must retain the above copyright notice,
3361− this list of conditions and the following disclaimer.
3362−
3363− - Redistributions in binary form must reproduce the above copyright notice,
3364− this list of conditions and the following disclaimer in the documentation
3365− and/or other materials provided with the distribution.
3366−
3367− - Neither name of the University nor the names of its contributors may be
3368− used to endorse or promote products derived from this software without
3369− specific prior written permission.
3370−
3371− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3372− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3373− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3374− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3375− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3376− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3377− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3378− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3379− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3380− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3381− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3382− DAMAGE.
3383−
3384−
3385−void LICENSE file:
3386−
3387− Copyright 2015 Edward Kmett
3388−
3389− All rights reserved.
3390−
3391− Redistribution and use in source and binary forms, with or without
3392− modification, are permitted provided that the following conditions
3393− are met:
3394−
3395− 1. Redistributions of source code must retain the above copyright
3396− notice, this list of conditions and the following disclaimer.
3397−
3398− 2. Redistributions in binary form must reproduce the above copyright
3399− notice, this list of conditions and the following disclaimer in the
3400− documentation and/or other materials provided with the distribution.
3401−
3402− 3. Neither the name of the author nor the names of his contributors
3403− may be used to endorse or promote products derived from this software
3404− without specific prior written permission.
3405−
3406− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
3407− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
3408− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
3409− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
3410− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3411− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3412− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3413− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
3414− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
3415− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
3416− POSSIBILITY OF SUCH DAMAGE.
3417−
3418−x509 LICENSE file:
3419−
3420− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
3421−
3422− All rights reserved.
3423−
3424− Redistribution and use in source and binary forms, with or without
3425− modification, are permitted provided that the following conditions
3426− are met:
3427− 1. Redistributions of source code must retain the above copyright
3428− notice, this list of conditions and the following disclaimer.
3429− 2. Redistributions in binary form must reproduce the above copyright
3430− notice, this list of conditions and the following disclaimer in the
3431− documentation and/or other materials provided with the distribution.
3432− 3. Neither the name of the author nor the names of his contributors
3433− may be used to endorse or promote products derived from this software
3434− without specific prior written permission.
3435−
3436− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
3437− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3438− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
3439− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
3440− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3441− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3442− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3443− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3444− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3445− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3446− SUCH DAMAGE.
3447−
3448−x509-store LICENSE file:
3449−
3450− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
3451−
3452− All rights reserved.
3453−
3454− Redistribution and use in source and binary forms, with or without
3455− modification, are permitted provided that the following conditions
3456− are met:
3457− 1. Redistributions of source code must retain the above copyright
3458− notice, this list of conditions and the following disclaimer.
3459− 2. Redistributions in binary form must reproduce the above copyright
3460− notice, this list of conditions and the following disclaimer in the
3461− documentation and/or other materials provided with the distribution.
3462− 3. Neither the name of the author nor the names of his contributors
3463− may be used to endorse or promote products derived from this software
3464− without specific prior written permission.
3465−
3466− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
3467− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3468− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
3469− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
3470− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3471− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3472− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3473− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3474− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3475− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3476− SUCH DAMAGE.
3477−
3478−x509-system LICENSE file:
3479−
3480− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
3481−
3482− All rights reserved.
3483−
3484− Redistribution and use in source and binary forms, with or without
3485− modification, are permitted provided that the following conditions
3486− are met:
3487− 1. Redistributions of source code must retain the above copyright
3488− notice, this list of conditions and the following disclaimer.
3489− 2. Redistributions in binary form must reproduce the above copyright
3490− notice, this list of conditions and the following disclaimer in the
3491− documentation and/or other materials provided with the distribution.
3492− 3. Neither the name of the author nor the names of his contributors
3493− may be used to endorse or promote products derived from this software
3494− without specific prior written permission.
3495−
3496− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
3497− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3498− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
3499− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
3500− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3501− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3502− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3503− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3504− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3505− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3506− SUCH DAMAGE.
3507−
3508−x509-validation LICENSE file:
3509−
3510− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
3511−
3512− All rights reserved.
3513−
3514− Redistribution and use in source and binary forms, with or without
3515− modification, are permitted provided that the following conditions
3516− are met:
3517− 1. Redistributions of source code must retain the above copyright
3518− notice, this list of conditions and the following disclaimer.
3519− 2. Redistributions in binary form must reproduce the above copyright
3520− notice, this list of conditions and the following disclaimer in the
3521− documentation and/or other materials provided with the distribution.
3522− 3. Neither the name of the author nor the names of his contributors
3523− may be used to endorse or promote products derived from this software
3524− without specific prior written permission.
3525−
3526− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
3527− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3528− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
3529− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
3530− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3531− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3532− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3533− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3534− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3535− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3536− SUCH DAMAGE.
3537−
3538−zlib LICENSE file:
3539−
3540− Copyright (c) 2006-2015, Duncan Coutts
3541− All rights reserved.
3542−
3543− Redistribution and use in source and binary forms, with or without
3544− modification, are permitted provided that the following conditions are met:
3545−
3546− 1. Redistributions of source code must retain the above copyright notice,
3547− this list of conditions and the following disclaimer.
3548− 2. Redistributions in binary form must reproduce the above copyright
3549− notice, this list of conditions and the following disclaimer in the
3550− documentation and/or other materials provided with the distribution.
3551− 3. This clause is intentionally left blank.
3552−
3553− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
3554− AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3555− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
3556− ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
3557− LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
3558− CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
3559− SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
3560− INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
3561− CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
3562− ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
3563− POSSIBILITY OF SUCH DAMAGE.
3564−
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"
appveyor.ymldeleted−57
@@ -1,57 +0,0 @@
1−platform: x64
2−version: '{build}'
3−environment:
4− # Keep the path as short as possible, just in case.
5− STACK_ROOT: c:\s
6− # Appveyor does not seem to be able to cope with the symbolic link
7− # stack.yaml, so this is a workaround.
8− STACK_YAML: stack-lts-5.yaml
9− RELEASE_USER: purescript
10− RELEASE_REPO: purescript
11−cache:
12−- c:\s
13−install:
14−- git submodule update --init
15−- ps: Install-Product node 5
16−- npm install -g bower
17−
18−- ps: |
19− New-Item -ItemType Directory -Force -Path C:\tools
20− $env:Path += ";C:\tools"
21− (New-Object Net.WebClient).DownloadFile('https://www.stackage.org/stack/windows-x86_64', 'c:\tools\stack.zip')
22− pushd c:\tools
23− 7z x c:\tools\stack.zip stack.exe
24− popd
25−
26−- stack --no-terminal --verbosity=error setup 1>stack-setup.log 2>&1 || type stack-setup.log
27−
28−build_script:
29−# Override the default build script.
30−- echo ""
31−test_script:
32−- stack -j1 --no-terminal test --pedantic
33−on_success:
34−# this seems to be necessary; if omitted, the bash script fails to find the
35−# tool 'strip'.
36−- copy C:\MinGW\bin\strip.exe C:\tools\strip.exe
37−- ps: |
38− function UploadFile
39− {
40− github-release upload --user $env:RELEASE_USER --repo $env:RELEASE_REPO --tag $env:APPVEYOR_REPO_TAG_NAME --file $args[0] --name $args[0]
41− }
42−
43− if ($env:APPVEYOR_REPO_TAG_NAME)
44− {
45− bash ./bundle/build-stack.sh win64
46−
47− (New-Object Net.WebClient).DownloadFile('https://github.com/aktau/github-release/releases/download/v0.6.2/windows-amd64-github-release.zip', 'c:\tools\github-release.zip')
48− pushd c:\tools
49− 7z x github-release.zip bin/windows/amd64/github-release.exe
50− Copy-Item bin/windows/amd64/github-release.exe github-release.exe
51− popd
52−
53− pushd bundle
54− UploadFile win64.tar.gz
55− UploadFile win64.sha
56− popd
57− }
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−63
@@ -1,63 +0,0 @@
1−## This script can be run on any supported OS to create a binary .tar.gz
2−## bundle.
3−## For Windows, msysgit contains all of the pieces needed to run this script.
4−set -e
5−
6−OS=$1
7−
8−if [ -z $OS ]
9−then
10− echo "Usage: build.sh osname"
11− exit 1
12−fi
13−
14−pushd $(stack path --project-root)
15−
16−LOCAL_INSTALL_ROOT=$(stack path --local-install-root)
17−
18−if [ "$OS" = "win64" ]
19−then
20− BIN_EXT=".exe"
21−else
22− BIN_EXT=""
23−fi
24−
25−# Make the staging directory
26−mkdir -p bundle/build/purescript
27−
28−# Strip the binaries, and copy them to the staging directory
29−for BIN in psc psci psc-docs psc-publish psc-bundle psc-ide-server psc-ide-client
30−do
31− FULL_BIN="$LOCAL_INSTALL_ROOT/bin/${BIN}${BIN_EXT}"
32− strip "$FULL_BIN" || true # not the end of the world if this fails, and
33− # AppVeyor can't seem to handle it for some reason
34− cp "$FULL_BIN" bundle/build/purescript
35−done
36−
37−# Copy extra files to the staging directory
38−cp bundle/README bundle/build/purescript/
39−cp LICENSE bundle/build/purescript/
40−cp INSTALL.md bundle/build/purescript/
41−
42−stack list-dependencies >bundle/build/purescript/dependencies.txt
43−
44−# Make the binary bundle
45−pushd bundle/build > /dev/null
46−tar -zcvf ../${OS}.tar.gz purescript
47−popd > /dev/null
48−
49−# Calculate the SHA hash
50−if [ "$OS" = "win64" ]
51−then
52− # msys/mingw does not include shasum. :(
53− SHASUM="openssl dgst -sha1"
54−else
55− SHASUM="shasum"
56−fi
57−
58−$SHASUM bundle/${OS}.tar.gz > bundle/${OS}.sha
59−
60−# Remove the staging directory
61−rm -rf build/
62−
63−popd > /dev/null
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−20
@@ -1,20 +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− "license": "MIT"
20−}
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/ConstrainedArgument.pursdeleted−9
@@ -1,9 +0,0 @@
1−module ConstrainedArgument where
2−
3−class Foo t
4−
5−type WithoutArgs = forall a. (Partial => a) -> a
6−type WithArgs = forall a. (Foo a => a) -> a
7−type MultiWithoutArgs = forall a. ((Partial, Partial) => a) -> a
8−type MultiWithArgs = forall a b. ((Foo a, Foo b) => a) -> a
9−
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/TypeOpAliases.pursdeleted−18
@@ -1,18 +0,0 @@
1−module TypeOpAliases where
2−
3−type AltFn a b = a -> b
4−
5−infixr 6 type AltFn as ~>
6−
7−foreign import test1 :: forall a b. a ~> b
8−foreign import test2 :: forall a b c. a ~> b ~> c
9−foreign import test3 :: forall a b c d. a ~> (b ~> c) ~> d
10−foreign import test4 :: forall a b c d. ((a ~> b) ~> c) ~> d
11−
12−data Tuple a b = Tuple a b
13−
14−infixl 6 Tuple as ×
15−infixl 6 type Tuple as ×
16−
17−third ∷ ∀ a b c. a × b × c → c
18−third (a × b × c) = c
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/ConstraintInference.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−
3−module Main where
4−
5−import Prelude
6−
7−spin :: forall a b. a -> b
8−spin x = spin x
9−
10−test = show <<< spin
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 pure 1
12− pure 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/Generalization1.pursdeleted−11
@@ -1,11 +0,0 @@
1−-- @shouldFailWith CannotGeneralizeRecursiveFunction
2−module Main where
3−
4−import Prelude
5−
6−foo 0 x _ = x
7−foo n x y = x <> bar (n - 1) x y
8−
9−bar 0 x _ = x
10−bar n x y = y <> foo (n - 1) x y
11−
examples/failing/Generalization2.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith CannotGeneralizeRecursiveFunction
2−module Main where
3−
4−import Prelude
5−
6−test n m | n <= 1 = m
7− | otherwise = test (n - 1) (m <> m)
8−
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/OperatorSections.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith CannotApplyFunction
2−module Main where
3−
4−import Prelude
5−
6−main = do
7− (true `not` _)
8−
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 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− pure 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−26
@@ -1,26 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−
3−module Main where
4−
5−import Prelude
6−import Control.Monad.Eff.Console (logShow)
7−
8−class Su a where
9− su :: a -> a
10−
11−class (Su (Array a)) <= Cl a where
12− cl :: a -> a -> a
13−
14−instance suNumber :: Su Number where
15− su n = n + 1.0
16−
17−instance suArray :: (Su a) => Su (Array a) where
18− su [x] = [su x]
19−
20−instance clNumber :: Cl Number where
21− cl n m = n + m
22−
23−test :: forall a. (Cl a) => a -> Array a
24−test x = su [cl x x]
25−
26−main = logShow $ 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/TypeOperatorAliasNoExport.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith TransitiveExportError
2−module Test (type (×)) where
3−
4−data Tuple a b = Tuple a b
5−
6−infixl 6 type Tuple as ×
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/TypedHole.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith HoleInferredType
2−module Main where
3−
4−import Prelude
5−import Control.Monad.Eff (Eff)
6−import Control.Monad.Eff.Console (CONSOLE, log)
7−
8−main :: forall e. Eff (console :: CONSOLE | e) Unit
9−main = ?ummm
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− logShow (middle unit)
23− trace "Done"
24− pure 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− pure $ 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/1991.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−singleton :: forall a. a -> Array a
6−singleton x = [x]
7−
8−empty :: forall a. Array a
9−empty = []
10−
11−foldMap :: forall a m. (Semigroup m) => (a -> m) -> Array a -> m
12−foldMap f [a, b, c, d, e] = f a <> f b <> f c <> f d <> f e
13−
14−regression :: Array Int
15−regression =
16− let as = [1,2,3,4,5]
17− as' = foldMap (\x -> if 1 < x && x < 4 then singleton x else empty) as
18− in as'
19−
20−main = Control.Monad.Eff.Console.log "Done"
examples/passing/2018.pursdeleted−25
@@ -1,25 +0,0 @@
1−module B where
2−
3− data Foo = X | Y
4−
5−module A where
6−
7− import B as Main
8−
9− -- Prior to the 2018 fix this would be detected as a cycle between A and Main.
10− foo ∷ Main.Foo → Main.Foo
11− foo x = x
12−
13−module Main where
14−
15−import Prelude
16−import A (foo)
17−import B (Foo(..))
18−import Control.Monad.Eff (Eff)
19−import Control.Monad.Eff.Console (CONSOLE, log)
20−
21−main :: forall e. Eff (console :: CONSOLE | e) Unit
22−main = do
23− let tmp = foo X
24− log "Done"
25−
examples/passing/2049.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data List a = Cons a (List a) | Nil
7−
8−infixr 6 Cons as :
9−
10−f :: List { x :: Int, y :: Int } -> Int
11−f ( r@{ x } : _) = x + r.y
12−
13−main = 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 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 = pure true
9−
10−set = do
11− log "Testing..."
12− case 0 of
13− 0 -> doIt
14− _ -> pure false
15−
16−main = do
17− b <- set
18− case b of
19− true -> log "Done"
examples/passing/CaseInputWildcard.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff (Eff)
5−import Control.Monad.Eff.Console (log, CONSOLE)
6−
7−data Foo = X | Y
8−
9−what ∷ Foo → Int → Boolean → Foo
10−what x = case _, x, _ of
11− 0, X, true → X
12− 0, Y, true → X
13− _, _, _ → Y
14−
15−main :: forall e. Eff (console :: CONSOLE | e) Unit
16−main = do
17− let tmp = what Y 0 true
18− 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 = pure true
9−
10−set = do
11− log "Testing..."
12− case 42, 10 of
13− 42, 10 -> doIt
14− _ , _ -> pure 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− pure $ m == 1
16− readSTRef count))
17−
18−main = Control.Monad.Eff.Console.logShow $ 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 _ = pure {}
9−replicateM_ n act = do
10− act
11− replicateM_ (n - 1.0) act
12−
13−main = replicateM_ 10.0 (log "Hello World!")
examples/passing/ConstraintInference.pursdeleted−7
@@ -1,7 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−shout = Control.Monad.Eff.Console.log <<< (_ <> "!") <<< show
6−
7−main = shout "Done"
examples/passing/ContextSimplification.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−shout = log <<< (_ <> "!") <<< show
7−
8−-- Here, we should simplify the context so that only one Show
9−-- constraint is added.
10−usesShowTwice true = shout
11−usesShowTwice false = logShow
12−
13−main = usesShowTwice true "Done"
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−40
@@ -1,40 +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− import Data.List as L
15−
16− -- unqualified
17− infixl 6 Cons as !
18−
19− -- qualified
20− infixl 6 L.Cons as !!
21−
22− get1 ∷ ∀ a. a → List a → a
23− get1 y xs = case xs of
24− _ : x : _ → x
25− _ → y
26−
27− get2 ∷ ∀ a. a → List a → a
28− get2 _ (_ : x : _) = x
29− get2 y _ = y
30−
31− get3 ∷ ∀ a. a → List a → a
32− get3 _ (_ ! (x ! _)) = x
33− get3 y _ = y
34−
35− main ∷ Eff (assert ∷ ASSERT, console ∷ CONSOLE) Unit
36− main = do
37− assert' "Incorrect result!" (get1 0 (1 : 2 : 3 : Nil) == 2)
38− assert' "Incorrect result!" (get2 0 (1 ! (2 ! (3 ! Nil))) == 2)
39− assert' "Incorrect result!" (get3 0.0 (1.0 : 2.0 : (3.0 ! Nil)) == 2.0)
40− 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 = logShow $ 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.logShow test2
25− Control.Monad.Eff.Console.logShow 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.logShow $ 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.logShow 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.logShow 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.logShow $ 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/Generalization1.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (logShow)
5−
6−main = do
7− logShow (sum 1.0 2.0)
8− logShow (sum 1 2)
9−
10−sum x y = x + y
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/IfWildcard.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff (Eff)
5−import Control.Monad.Eff.Console (log, CONSOLE)
6−
7−data Foo = X | Y
8−
9−cond ∷ ∀ a. Boolean → a → a → a
10−cond = if _ then _ else _
11−
12−what ∷ Boolean → Foo
13−what = if _ then X else Y
14−
15−main :: forall e. Eff (console :: CONSOLE | e) Unit
16−main = do
17− let tmp1 = what true
18− tmp2 = cond true 0 1
19− 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− logShow 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.logShow $ 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.logShow (test1 1.0)
48− Control.Monad.Eff.Console.logShow (test2 1.0 2.0)
49− Control.Monad.Eff.Console.logShow test3
50− Control.Monad.Eff.Console.logShow test4
51− Control.Monad.Eff.Console.logShow test5
52− Control.Monad.Eff.Console.logShow test7
53− Control.Monad.Eff.Console.logShow (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.logShow 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− logShow (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− logShow (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− logShow "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 A as B
7−
8− main = do
9− logShow (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− logShow (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−61
@@ -1,61 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−data Tuple a b = Tuple a b
7−
8−instance showTuple :: (Show a, Show b) => Show (Tuple a b) where
9− show (Tuple a b) = "(" <> show a <> ", " <> show b <> ")"
10−
11−class Monad m <= MonadState s m where
12− get :: m s
13− put :: s -> m Unit
14−
15−data State s a = State (s -> Tuple s a)
16−
17−runState s (State f) = f s
18−
19−instance functorState :: Functor (State s) where
20− map = liftM1
21−
22−instance applyState :: Apply (State s) where
23− apply = ap
24−
25−instance applicativeState :: Applicative (State s) where
26− pure a = State $ \s -> Tuple s a
27−
28−instance bindState :: Bind (State s) where
29− bind f g = State $ \s -> case runState s f of
30− Tuple s1 a -> runState s1 (g a)
31−
32−instance monadState :: Monad (State s)
33−
34−instance monadStateState :: MonadState s (State s) where
35− get = State (\s -> Tuple s s)
36− put s = State (\_ -> Tuple s unit)
37−
38−-- Without the call to same, the following strange (but correct, in the absence of
39−-- functional dependencies) type:
40−--
41−-- forall m t1 t2.
42−-- ( Bind m
43−-- , MonadState t1 m
44−-- , MonadState t2 m
45−-- ) => (t1 -> t2) -> m Unit
46−--
47−-- With the type hint, the inferred type is more sensible:
48−--
49−-- forall m t.
50−-- ( Bind m
51−-- , MonadState t m
52−-- ) => (t -> t) -> m Unit
53−modify f =
54− do
55− s <- get
56− put (same f s)
57− where
58− same :: forall a. (a -> a) -> (a -> a)
59− same = id
60−
61−main = logShow $ runState 0 (modify (_ + 1))
examples/passing/MultiArgFunctions.pursdeleted−27
@@ -1,27 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Data.Function.Uncurried
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− logShow $ 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.logShow (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− logShow $ Thing "hello"
21− logShow $ Box 42.0
22− logShow $ 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.logShow $ 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 = pure 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 = pure true
12−
13−main = do
14− obj <- { value: _ } <$> getValue
15− logShow obj.value
16− let x = 1.0
17− point <- { x: _, y: x } <$> pure 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−46
@@ -1,46 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−
6−main = do
7−
8− -- semiringNumber
9− logShow (1.0 + 2.0)
10− logShow (1.0 * 2.0)
11−
12− -- ringNumber
13− logShow (1.0 - 2.0)
14− logShow (negate 1.0)
15−
16− -- moduleSemiringNumber
17− logShow (1.0 / 2.0)
18−
19− -- ordNumber
20− logShow (1.0 > 2.0)
21− logShow (1.0 < 2.0)
22− logShow (1.0 <= 2.0)
23− logShow (1.0 >= 2.0)
24− logShow (1.0 == 2.0)
25−
26− -- eqNumber
27− logShow (1.0 == 2.0)
28− logShow (1.0 /= 2.0)
29−
30− -- eqString
31− logShow ("foo" == "bar")
32− logShow ("foo" /= "bar")
33−
34− -- eqBoolean
35− logShow (true == false)
36− logShow (true /= false)
37−
38− -- semigroupString
39− logShow ("foo" <> "bar")
40−
41− -- latticeBoolean
42− logShow (top && true)
43− logShow (bottom || false)
44−
45− -- complementedLatticeBoolean
46− logShow (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. (Semiring 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−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude as P
4−
5−-- qualified import without the "qualified" keyword
6−import Control.Monad.Eff.Console as Console
7−
8−bind = P.bind
9−
10−main = do
11− message <- P.pure "success!"
12− 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−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Person = Person { name :: String, age :: Number }
7−
8−showPerson :: Person -> String
9−showPerson = \p -> case p of
10− Person o -> o.name <> ", aged " <> show o.age
11−
12−main = 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 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.logShow 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 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.logShow $ 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.logShow $ 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 <<< pure
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 (logShow)
5−
6−main = do
7− let f x = x + 1
8− let v = 0
9− logShow (applyN 0 f v)
10− logShow (applyN 1 f v)
11− logShow (applyN 2 f v)
12− logShow (applyN 3 f v)
13− logShow (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.logShow (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 = \_ -> pure 1.0
57−
58−test5 = \_ -> Just 1.0 >>= \n -> pure (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− pure $ 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/TypeOperators.pursdeleted−34
@@ -1,34 +0,0 @@
1−module A
2− ( Tuple(..)
3− , type (/\)
4− , (/\)
5− , Natural
6− , type (~>)
7− ) where
8−
9− data Tuple a b = Tuple a b
10−
11− infixl 6 Tuple as /\
12− infixl 6 type Tuple as /\
13−
14− type Natural f g = ∀ a. f a → g a
15−
16− infixr 0 type Natural as ~>
17−
18− tup ∷ ∀ a b. a → b → b /\ a
19− tup a b = b /\ a
20−
21− tupX ∷ ∀ a b c. a /\ b /\ c → c
22− tupX (a /\ b /\ c) = c
23−
24−module Main where
25−
26− import A (type (~>), type (/\), (/\))
27−
28− natty ∷ ∀ f. f ~> f
29− natty x = x
30−
31− swap ∷ ∀ a b. a /\ b → b /\ a
32− swap (a /\ b) = b /\ a
33−
34− 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− pure 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' ← pure n
14− pure n'
15−
16−f' :: forall m. Monad m => Int -> m Int
17−f' n = do
18− n' <- pure n
19− pure 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 = logShow (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.logShow (test1 1.0)
44− Control.Monad.Eff.Console.logShow (test2 1.0 2.0)
45− Control.Monad.Eff.Console.logShow test3
46− Control.Monad.Eff.Console.logShow test4
47− Control.Monad.Eff.Console.logShow test5
48− Control.Monad.Eff.Console.logShow test6
49− Control.Monad.Eff.Console.logShow (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−116
@@ -1,116 +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−import System.IO.UTF8 (readUTF8File)
34−
35−import qualified Language.PureScript as P
36−import qualified Paths_purescript as Paths
37−
38−data HierarchyOptions = HierarchyOptions
39− { hierachyInput :: FilePath
40− , hierarchyOutput :: Maybe FilePath
41− }
42−
43−newtype SuperMap = SuperMap { unSuperMap :: Either (P.ProperName 'P.ClassName) ((P.ProperName 'P.ClassName), (P.ProperName 'P.ClassName)) }
44− deriving Eq
45−
46−instance Show SuperMap where
47− show (SuperMap (Left sub)) = show sub
48− show (SuperMap (Right (super, sub))) = show super ++ " -> " ++ show sub
49−
50−instance Ord SuperMap where
51− compare (SuperMap s) (SuperMap s') = getCls s `compare` getCls s'
52− where
53− getCls = either id snd
54−
55−runModuleName :: P.ModuleName -> String
56−runModuleName (P.ModuleName pns) = intercalate "_" (P.runProperName `map` pns)
57−
58−readInput :: [FilePath] -> IO (Either P.MultipleErrors [P.Module])
59−readInput paths = do
60− content <- mapM (\path -> (path, ) <$> readUTF8File path) paths
61− return $ map snd <$> P.parseModulesFromFiles id content
62−
63−compile :: HierarchyOptions -> IO ()
64−compile (HierarchyOptions inputGlob mOutput) = do
65− input <- glob inputGlob
66− modules <- readInput input
67− case modules of
68− Left errs -> hPutStr stderr (P.prettyPrintMultipleErrors False errs) >> exitFailure
69− Right ms -> do
70− for_ ms $ \(P.Module _ _ moduleName decls _) ->
71− let name = runModuleName moduleName
72− tcs = filter P.isTypeClassDeclaration decls
73− supers = sort . nub . filter (not . null) $ fmap superClasses tcs
74− prologue = "digraph " ++ name ++ " {\n"
75− body = intercalate "\n" (concatMap (fmap (\s -> " " ++ show s ++ ";")) supers)
76− epilogue = "\n}"
77− hier = prologue ++ body ++ epilogue
78− in unless (null supers) $ case mOutput of
79− Just output -> do
80− createDirectoryIfMissing True output
81− writeFile (output </> name) hier
82− Nothing -> putStrLn hier
83− exitSuccess
84−
85−superClasses :: P.Declaration -> [SuperMap]
86−superClasses (P.TypeClassDeclaration sub _ supers@(_:_) _) =
87− fmap (\(P.Qualified _ super, _) -> SuperMap (Right (super, sub))) supers
88−superClasses (P.TypeClassDeclaration sub _ _ _) = [SuperMap (Left sub)]
89−superClasses (P.PositionedDeclaration _ _ decl) = superClasses decl
90−superClasses _ = []
91−
92−inputFile :: Parser FilePath
93−inputFile = strArgument $
94− metavar "FILE"
95− <> value "main.purs"
96− <> showDefault
97− <> help "The input file to generate a hierarchy from"
98−
99−outputFile :: Parser (Maybe FilePath)
100−outputFile = optional . strOption $
101− short 'o'
102− <> long "output"
103− <> help "The output directory"
104−
105−pscOptions :: Parser HierarchyOptions
106−pscOptions = HierarchyOptions <$> inputFile
107− <*> outputFile
108−
109−main :: IO ()
110−main = execParser opts >>= compile
111− where
112− opts = info (helper <*> pscOptions) infoModList
113− infoModList = fullDesc <> headerInfo <> footerInfo
114− headerInfo = header "hierarchy - Creates a GraphViz directed graph of PureScript TypeClasses"
115− footerInfo = footer $ "hierarchy " ++ showVersion Paths.version
116−
license-generator/generate.hsdeleted−46
@@ -1,46 +0,0 @@
1−-- |
2−-- A small script which regenerates the LICENSE file with all
3−-- dependencies' licenses, when the dependencies are provided via standard
4−-- input.
5−--
6−-- It is recommended to run this as follows:
7−--
8−-- stack list-dependencies | cut -f 1 -d ' ' | stack exec runhaskell license-generator/generate.hs > LICENSE
9−--
10−
11−module Main (main) where
12−
13−import Control.Monad (forM_)
14−import Data.Char (isSpace)
15−import Data.List
16−import System.Process
17−import System.IO (hPutStrLn, stderr, getContents)
18−
19−echoHeader :: IO ()
20−echoHeader =
21− readFile "license-generator/header.txt" >>= putStr
22−
23−depsNames :: IO [String]
24−depsNames =
25− fmap (filter (/= "purescript") . lines) getContents
26−
27−depsLicense :: String -> IO ()
28−depsLicense dep = do
29− let licenseFile = if dep == "Glob" then "LICENSE.txt" else "LICENSE"
30− hPutStrLn stderr dep
31− license <- readProcess "curl" ["--silent", "https://hackage.haskell.org/package/" ++ dep ++ "/src/" ++ licenseFile] ""
32− putStrLn $ dep ++ " LICENSE file:"
33− putStrLn ""
34− putStrLn $ f license
35− where
36− f = unlines . map (trimEnd . (" " ++)) . lines
37− trimEnd = reverse . dropWhile isSpace . reverse
38−
39−main :: IO ()
40−main = do
41− deps <-depsNames
42− echoHeader
43− putStrLn ""
44− forM_ deps $ \d -> putStr " " >> putStrLn d
45− putStrLn ""
46− 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−127
@@ -1,127 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−{-# LANGUAGE ScopedTypeVariables #-}
3−{-# LANGUAGE TupleSections #-}
4−{-# LANGUAGE RecordWildCards #-}
5−
6−-- | Bundles compiled PureScript modules for the browser.
7−module Main (main) where
8−
9−import Data.Traversable (for)
10−import Data.Version (showVersion)
11−
12−import Control.Applicative
13−import Control.Monad
14−import Control.Monad.Error.Class
15−import Control.Monad.Trans.Except
16−import Control.Monad.IO.Class
17−
18−import System.FilePath (takeFileName, takeDirectory)
19−import System.FilePath.Glob (glob)
20−import System.Exit (exitFailure)
21−import System.IO (stderr, stdout, hPutStrLn, hSetEncoding, utf8)
22−import System.IO.UTF8 (readUTF8File)
23−import System.Directory (createDirectoryIfMissing)
24−
25−import Language.PureScript.Bundle
26−
27−import Options.Applicative as Opts
28−
29−import qualified Paths_purescript as Paths
30−
31−-- | Command line options.
32−data Options = Options
33− { optionsInputFiles :: [FilePath]
34− , optionsOutputFile :: Maybe FilePath
35− , optionsEntryPoints :: [String]
36− , optionsMainModule :: Maybe String
37− , optionsNamespace :: String
38− } deriving Show
39−
40−-- | Given a filename, assuming it is in the correct place on disk, infer a ModuleIdentifier.
41−guessModuleIdentifier :: (MonadError ErrorMessage m) => FilePath -> m ModuleIdentifier
42−guessModuleIdentifier filename = ModuleIdentifier (takeFileName (takeDirectory filename)) <$> guessModuleType (takeFileName filename)
43− where
44− guessModuleType "index.js" = pure Regular
45− guessModuleType "foreign.js" = pure Foreign
46− guessModuleType name = throwError $ UnsupportedModulePath name
47−
48−-- | The main application function.
49−-- This function parses the input files, performs dead code elimination, filters empty modules
50−-- and generates and prints the final Javascript bundle.
51−app :: (MonadError ErrorMessage m, MonadIO m) => Options -> m String
52−app Options{..} = do
53− inputFiles <- concat <$> mapM (liftIO . glob) optionsInputFiles
54− when (null inputFiles) . liftIO $ do
55− hPutStrLn stderr "psc-bundle: No input files."
56− exitFailure
57− input <- for inputFiles $ \filename -> do
58− js <- liftIO (readUTF8File filename)
59− mid <- guessModuleIdentifier filename
60− length js `seq` return (mid, js) -- evaluate readFile till EOF before returning, not to exhaust file handles
61−
62− let entryIds = map (`ModuleIdentifier` Regular) optionsEntryPoints
63−
64− bundle input entryIds optionsMainModule optionsNamespace
65−
66−-- | Command line options parser.
67−options :: Parser Options
68−options = Options <$> some inputFile
69− <*> optional outputFile
70− <*> many entryPoint
71− <*> optional mainModule
72− <*> namespace
73− where
74− inputFile :: Parser FilePath
75− inputFile = strArgument $
76− metavar "FILE"
77− <> help "The input .js file(s)"
78−
79− outputFile :: Parser FilePath
80− outputFile = strOption $
81− short 'o'
82− <> long "output"
83− <> help "The output .js file"
84−
85− entryPoint :: Parser String
86− entryPoint = strOption $
87− short 'm'
88− <> long "module"
89− <> help "Entry point module name(s). All code which is not a transitive dependency of an entry point module will be removed."
90−
91− mainModule :: Parser String
92− mainModule = strOption $
93− long "main"
94− <> help "Generate code to run the main method in the specified module."
95−
96− namespace :: Parser String
97− namespace = strOption $
98− short 'n'
99− <> long "namespace"
100− <> Opts.value "PS"
101− <> showDefault
102− <> help "Specify the namespace that PureScript modules will be exported to when running in the browser."
103−
104−-- | Make it go.
105−main :: IO ()
106−main = do
107− hSetEncoding stdout utf8
108− hSetEncoding stderr utf8
109− opts <- execParser (info (version <*> helper <*> options) infoModList)
110− output <- runExceptT (app opts)
111− case output of
112− Left err -> do
113− hPutStrLn stderr (unlines (printErrorMessage err))
114− exitFailure
115− Right js ->
116− case optionsOutputFile opts of
117− Just outputFile -> do
118− createDirectoryIfMissing True (takeDirectory outputFile)
119− writeFile outputFile js
120− Nothing -> putStrLn js
121− where
122− infoModList = fullDesc <> headerInfo <> footerInfo
123− headerInfo = header "psc-bundle - Bundles compiled PureScript modules for the browser"
124− footerInfo = footer $ "psc-bundle " ++ showVersion Paths.version
125−
126− version :: Parser (a -> a)
127− 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−250
@@ -1,250 +0,0 @@
1−{-# LANGUAGE TupleSections #-}
2−
3−module Main where
4−
5−import Control.Applicative
6−import Control.Monad.Trans.Except (runExceptT)
7−import Control.Arrow (first, second)
8−import Control.Category ((>>>))
9−import Control.Monad.Writer
10−import Data.Function (on)
11−import Data.List
12−import Data.Maybe (fromMaybe)
13−import Data.Tuple (swap)
14−import Data.Version (showVersion)
15−
16−import Options.Applicative
17−import qualified Text.PrettyPrint.ANSI.Leijen as PP
18−
19−import qualified Language.PureScript as P
20−import qualified Paths_purescript as Paths
21−import System.Exit (exitFailure)
22−import System.IO (hPutStrLn, hPrint, hSetEncoding, stderr, stdout, utf8)
23−import System.IO.UTF8 (readUTF8File)
24−import System.Directory (createDirectoryIfMissing)
25−import System.FilePath (takeDirectory)
26−import System.FilePath.Glob (glob)
27−
28−import Etags
29−import Ctags
30−import qualified Language.PureScript.Docs as D
31−import qualified Language.PureScript.Docs.AsMarkdown as D
32−
33−-- Available output formats
34−data Format = Markdown -- Output documentation in Markdown format
35− | Ctags -- Output ctags symbol index suitable for use with vi
36− | Etags -- Output etags symbol index suitable for use with emacs
37− deriving (Show, Eq, Ord)
38−
39−-- | Available methods of outputting Markdown documentation
40−data DocgenOutput
41− = EverythingToStdOut
42− | ToStdOut [P.ModuleName]
43− | ToFiles [(P.ModuleName, FilePath)]
44− deriving (Show)
45−
46−data PSCDocsOptions = PSCDocsOptions
47− { pscdFormat :: Format
48− , pscdInputFiles :: [FilePath]
49− , pscdDocgen :: DocgenOutput
50− }
51− deriving (Show)
52−
53−docgen :: PSCDocsOptions -> IO ()
54−docgen (PSCDocsOptions fmt inputGlob output) = do
55− input <- concat <$> mapM glob inputGlob
56− case fmt of
57− Etags -> dumpTags input dumpEtags
58− Ctags -> dumpTags input dumpCtags
59− Markdown -> do
60− ms <- runExceptT (D.parseAndBookmark input []
61− >>= (fst >>> D.convertModulesInPackage))
62− >>= successOrExit
63−
64− case output of
65− EverythingToStdOut ->
66− putStrLn (D.runDocs (D.modulesAsMarkdown ms))
67− ToStdOut names -> do
68− let (ms', missing) = takeByName ms names
69− guardMissing missing
70− putStrLn (D.runDocs (D.modulesAsMarkdown ms'))
71− ToFiles names -> do
72− let (ms', missing) = takeByName' ms names
73− guardMissing missing
74−
75− let ms'' = groupBy ((==) `on` fst) . sortBy (compare `on` fst) $ map swap ms'
76− forM_ ms'' $ \grp -> do
77− let fp = fst (head grp)
78− createDirectoryIfMissing True (takeDirectory fp)
79− writeFile fp (D.runDocs (D.modulesAsMarkdown (map snd grp)))
80−
81− where
82− guardMissing [] = return ()
83− guardMissing [mn] = do
84− hPutStrLn stderr ("psc-docs: error: unknown module \"" ++ P.runModuleName mn ++ "\"")
85− exitFailure
86− guardMissing mns = do
87− hPutStrLn stderr "psc-docs: error: unknown modules:"
88− forM_ mns $ \mn ->
89− hPutStrLn stderr (" * " ++ P.runModuleName mn)
90− exitFailure
91−
92− successOrExit :: Either P.MultipleErrors a -> IO a
93− successOrExit act =
94− case act of
95− Right x ->
96− return x
97− Left err -> do
98− hPutStrLn stderr $ P.prettyPrintMultipleErrors False err
99− exitFailure
100−
101− takeByName = takeModulesByName D.modName
102− takeByName' = takeModulesByName' D.modName
103−
104−-- |
105−-- Given a list of module names and a list of modules, return a list of modules
106−-- whose names appeared in the given name list, together with a list of names
107−-- for which no module could be found in the module list.
108−--
109−takeModulesByName :: (Eq n) => (m -> n) -> [m] -> [n] -> ([m], [n])
110−takeModulesByName getModuleName modules names =
111− first (map fst) (takeModulesByName' getModuleName modules (map (,()) names))
112−
113−-- |
114−-- Like takeModulesByName, but also keeps some extra information with each
115−-- module.
116−--
117−takeModulesByName' :: (Eq n) => (m -> n) -> [m] -> [(n, a)] -> ([(m, a)], [n])
118−takeModulesByName' getModuleName modules = foldl go ([], [])
119− where
120− go (ms, missing) (name, x) =
121− case find ((== name) . getModuleName) modules of
122− Just m -> ((m, x) : ms, missing)
123− Nothing -> (ms, name : missing)
124−
125−dumpTags :: [FilePath] -> ([(String, P.Module)] -> [String]) -> IO ()
126−dumpTags input renderTags = do
127− e <- P.parseModulesFromFiles (fromMaybe "") <$> mapM (fmap (first Just) . parseFile) (nub input)
128− case e of
129− Left err -> do
130− hPrint stderr err
131− exitFailure
132− Right ms ->
133− ldump (renderTags (pairs ms))
134−
135− where
136− pairs :: [(Maybe String, m)] -> [(String, m)]
137− pairs = map (first (fromMaybe ""))
138−
139− ldump :: [String] -> IO ()
140− ldump = mapM_ putStrLn
141−
142−parseFile :: FilePath -> IO (FilePath, String)
143−parseFile input = (,) input <$> readUTF8File input
144−
145−inputFile :: Parser FilePath
146−inputFile = strArgument $
147− metavar "FILE"
148− <> help "The input .purs file(s)"
149−
150−instance Read Format where
151− readsPrec _ "etags" = [(Etags, "")]
152− readsPrec _ "ctags" = [(Ctags, "")]
153− readsPrec _ "markdown" = [(Markdown, "")]
154− readsPrec _ _ = []
155−
156−format :: Parser Format
157−format = option auto $ value Markdown
158− <> long "format"
159− <> metavar "FORMAT"
160− <> help "Set output FORMAT (markdown | etags | ctags)"
161−
162−docgenModule :: Parser String
163−docgenModule = strOption $
164− long "docgen"
165− <> 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."
166−
167−pscDocsOptions :: Parser (Format, [FilePath], [String])
168−pscDocsOptions = (,,) <$> format <*> many inputFile <*> many docgenModule
169−
170−parseDocgen :: [String] -> Either String DocgenOutput
171−parseDocgen [] = Right EverythingToStdOut
172−parseDocgen xs = go xs
173− where
174− go = intersperse " "
175− >>> concat
176− >>> words
177− >>> map parseItem
178− >>> combine
179−
180−data DocgenOutputItem
181− = IToStdOut P.ModuleName
182− | IToFile (P.ModuleName, FilePath)
183−
184−parseItem :: String -> DocgenOutputItem
185−parseItem s = case elemIndex ':' s of
186− Just i ->
187− s # splitAt i
188− >>> first P.moduleNameFromString
189− >>> second (drop 1)
190− >>> IToFile
191− Nothing ->
192− IToStdOut (P.moduleNameFromString s)
193−
194− where
195− infixr 1 #
196− (#) = flip ($)
197−
198−combine :: [DocgenOutputItem] -> Either String DocgenOutput
199−combine [] = Right EverythingToStdOut
200−combine (x:xs) = foldM go (initial x) xs
201− where
202− initial (IToStdOut m) = ToStdOut [m]
203− initial (IToFile m) = ToFiles [m]
204−
205− go (ToStdOut ms) (IToStdOut m) = Right (ToStdOut (m:ms))
206− go (ToFiles ms) (IToFile m) = Right (ToFiles (m:ms))
207− go _ _ = Left "Can't mix module names and module name/file path pairs in the same invocation."
208−
209−buildOptions :: (Format, [FilePath], [String]) -> IO PSCDocsOptions
210−buildOptions (fmt, input, mapping) =
211− case parseDocgen mapping of
212− Right mapping' -> return (PSCDocsOptions fmt input mapping')
213− Left err -> do
214− hPutStrLn stderr "psc-docs: error in --docgen option:"
215− hPutStrLn stderr (" " ++ err)
216− exitFailure
217−
218−main :: IO ()
219−main = do
220− hSetEncoding stdout utf8
221− hSetEncoding stderr utf8
222− execParser opts >>= buildOptions >>= docgen
223− where
224− opts = info (version <*> helper <*> pscDocsOptions) infoModList
225− infoModList = fullDesc <> headerInfo <> footerInfo
226− headerInfo = header "psc-docs - Generate Markdown documentation from PureScript source files"
227− footerInfo = footerDoc $ Just $ PP.vcat
228− [ examples, PP.empty, PP.text ("psc-docs " ++ showVersion Paths.version) ]
229−
230− version :: Parser (a -> a)
231− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
232−
233−examples :: PP.Doc
234−examples =
235− PP.vcat $ map PP.text
236− [ "Examples:"
237− , " print documentation for Data.List to stdout:"
238− , " psc-docs \"src/**/*.purs\" \"bower_components/*/src/**/*.purs\" \\"
239− , " --docgen Data.List"
240− , ""
241− , " write documentation for Data.List to docs/Data.List.md:"
242− , " psc-docs \"src/**/*.purs\" \"bower_components/*/src/**/*.purs\" \\"
243− , " --docgen Data.List:docs/Data.List.md"
244− , ""
245− , " write documentation for Data.List to docs/Data.List.md, and"
246− , " documentation for Data.List.Lazy to docs/Data.List.Lazy.md:"
247− , " psc-docs \"src/**/*.purs\" \"bower_components/*/src/**/*.purs\" \\"
248− , " --docgen Data.List:docs/Data.List.md \\"
249− , " --docgen Data.List.Lazy:docs/Data.List.Lazy.md"
250− ]
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−56
@@ -1,56 +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.Text (Text)
9−import qualified Data.Text as T
10−import qualified Data.Text.IO as T
11−import Data.Version (showVersion)
12−import Network
13−import Options.Applicative
14−import System.Exit
15−import System.IO
16−
17−import qualified Paths_purescript as Paths
18−
19−data Options = Options
20− { optionsPort :: PortID
21− }
22−
23−main :: IO ()
24−main = do
25− Options port <- execParser opts
26− client port
27− where
28− parser =
29− Options <$>
30− (PortNumber . fromIntegral <$>
31− option auto (long "port" <> short 'p' <> value (4242 :: Integer)))
32− opts = info (version <*> helper <*> parser) mempty
33− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
34−
35−client :: PortID -> IO ()
36−client port = do
37− h <-
38− connectTo "localhost" port `catch`
39− (\(SomeException e) ->
40− putStrLn
41− ("Couldn't connect to psc-ide-server on port: " ++
42− show port ++ " Error: " ++ show e) >>
43− exitFailure)
44− cmd <- T.getLine
45− -- Temporary fix for emacs windows bug
46− let cleanedCmd = removeSurroundingTicks cmd
47− --
48− T.hPutStrLn h cleanedCmd
49− res <- T.hGetLine h
50− putStrLn (T.unpack res)
51− hFlush stdout
52− hClose h
53−
54−-- TODO: Fix this in the emacs plugin by using a real process over shellcommands
55−removeSurroundingTicks :: Text -> Text
56−removeSurroundingTicks = T.dropWhile (== '\'') . T.dropWhileEnd (== '\'')
psc-ide-server/Main.hsdeleted−173
@@ -1,173 +0,0 @@
1−-----------------------------------------------------------------------------
2−--
3−-- Module : Main
4−-- Description : The server accepting commands for psc-ide
5−-- Copyright : Christoph Hegemann 2016
6−-- License : MIT (http://opensource.org/licenses/MIT)
7−--
8−-- Maintainer : Christoph Hegemann <christoph.hegemann1337@gmail.com>
9−-- Stability : experimental
10−--
11−-- |
12−-- The server accepting commands for psc-ide
13−-----------------------------------------------------------------------------
14−
15−{-# LANGUAGE ConstraintKinds #-}
16−{-# LANGUAGE FlexibleContexts #-}
17−{-# LANGUAGE MultiParamTypeClasses #-}
18−{-# LANGUAGE OverloadedStrings #-}
19−{-# LANGUAGE PackageImports #-}
20−{-# LANGUAGE TemplateHaskell #-}
21−
22−module Main where
23−
24−import Prelude ()
25−import Prelude.Compat
26−
27−import Control.Concurrent (forkFinally)
28−import Control.Concurrent.STM
29−import Control.Exception (bracketOnError, catchJust)
30−import Control.Monad
31−import Control.Monad.Error.Class
32−import "monad-logger" Control.Monad.Logger
33−import Control.Monad.Reader
34−import Control.Monad.Trans.Except
35−import qualified Data.Text as T
36−import qualified Data.Text.IO as T
37−import Data.Version (showVersion)
38−import Language.PureScript.Ide
39−import Language.PureScript.Ide.Util
40−import Language.PureScript.Ide.Error
41−import Language.PureScript.Ide.Types
42−import Language.PureScript.Ide.Watcher
43−import Network hiding (socketPort)
44−import Network.BSD (getProtocolNumber)
45−import Network.Socket hiding (PortNumber, Type,
46− accept, sClose)
47−import Options.Applicative
48−import System.Directory
49−import System.FilePath
50−import System.IO
51−import System.IO.Error (isEOFError)
52−
53−import qualified Paths_purescript as Paths
54−
55−-- "Borrowed" from the Idris Compiler
56−-- Copied from upstream impl of listenOn
57−-- bound to localhost interface instead of iNADDR_ANY
58−listenOnLocalhost :: PortID -> IO Socket
59−listenOnLocalhost (PortNumber port) = do
60− proto <- getProtocolNumber "tcp"
61− localhost <- inet_addr "127.0.0.1"
62− bracketOnError
63− (socket AF_INET Stream proto)
64− sClose
65− (\sock -> do
66− setSocketOption sock ReuseAddr 1
67− bindSocket sock (SockAddrInet port localhost)
68− listen sock maxListenQueue
69− pure sock)
70−listenOnLocalhost _ = error "Wrong Porttype"
71−
72−data Options = Options
73− { optionsDirectory :: Maybe FilePath
74− , optionsOutputPath :: FilePath
75− , optionsPort :: PortID
76− , optionsDebug :: Bool
77− }
78−
79−main :: IO ()
80−main = do
81− Options dir outputPath port debug <- execParser opts
82− maybe (pure ()) setCurrentDirectory dir
83− serverState <- newTVarIO emptyPscIdeState
84− cwd <- getCurrentDirectory
85− let fullOutputPath = cwd </> outputPath
86−
87− doesDirectoryExist fullOutputPath
88− >>= flip unless
89− (do putStrLn ("Your output directory didn't exist. I'll create it at: " <> fullOutputPath)
90− createDirectory fullOutputPath
91− putStrLn "This usually means you didn't compile your project yet."
92− putStrLn "psc-ide needs you to compile your project (for example by running pulp build)"
93− )
94−
95− _ <- forkFinally (watcher serverState fullOutputPath) print
96− let conf =
97− Configuration
98− {
99− confDebug = debug
100− , confOutputPath = outputPath
101− }
102− let env =
103− PscIdeEnvironment
104− {
105− envStateVar = serverState
106− , envConfiguration = conf
107− }
108− startServer port env
109− where
110− parser =
111− Options <$>
112− optional (strOption (long "directory" <> short 'd')) <*>
113− strOption (long "output-directory" <> value "output/") <*>
114− (PortNumber . fromIntegral <$>
115− option auto (long "port" <> short 'p' <> value (4242 :: Integer))) <*>
116− switch (long "debug")
117− opts = info (version <*> helper <*> parser) mempty
118− version = abortOption
119− (InfoMsg (showVersion Paths.version))
120− (long "version" <> help "Show the version number")
121−
122−startServer :: PortID -> PscIdeEnvironment -> IO ()
123−startServer port env = withSocketsDo $ do
124− sock <- listenOnLocalhost port
125− runLogger (runReaderT (forever (loop sock)) env)
126− where
127− runLogger = runStdoutLoggingT . filterLogger (\_ _ -> confDebug (envConfiguration env))
128−
129− loop :: (PscIde m, MonadLogger m) => Socket -> m ()
130− loop sock = do
131− accepted <- runExceptT $ acceptCommand sock
132− case accepted of
133− Left err -> $(logDebug) err
134− Right (cmd, h) -> do
135− case decodeT cmd of
136− Just cmd' -> do
137− result <- runExceptT (handleCommand cmd')
138− -- $(logDebug) ("Answer was: " <> T.pack (show result))
139− liftIO (hFlush stdout)
140− case result of
141− -- What function can I use to clean this up?
142− Right r -> liftIO $ T.hPutStrLn h (encodeT r)
143− Left err -> liftIO $ T.hPutStrLn h (encodeT err)
144− Nothing -> do
145− $(logDebug) ("Parsing the command failed. Command: " <> cmd)
146− liftIO $ do
147− T.hPutStrLn h (encodeT (GeneralError "Error parsing Command."))
148− hFlush stdout
149− liftIO (hClose h)
150−
151−
152−acceptCommand :: (MonadIO m, MonadLogger m, MonadError T.Text m)
153− => Socket -> m (T.Text, Handle)
154−acceptCommand sock = do
155− h <- acceptConnection
156− $(logDebug) "Accepted a connection"
157− cmd' <- liftIO (catchJust
158− -- this means that the connection was
159− -- terminated without receiving any input
160− (\e -> if isEOFError e then Just () else Nothing)
161− (Just <$> T.hGetLine h)
162− (const (pure Nothing)))
163− case cmd' of
164− Nothing -> throwError "Connection was closed before any input arrived"
165− Just cmd -> do
166− $(logDebug) cmd
167− pure (cmd, h)
168− where
169− acceptConnection = liftIO $ do
170− (h,_,_) <- accept sock
171− hSetEncoding h utf8
172− hSetBuffering h LineBuffering
173− pure h
psc-ide-server/PROTOCOL.mddeleted−525
@@ -1,525 +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 for completion
12−and type info. If the `params` object is left off, the `load` command will try
13−to detect all the compiled modules in your project and load them.
14−
15−**Params:**
16− - `modules :: (optional) [ModuleName]`: A list of modules to load.
17− psc-ide-server will try to parse all the declarations in these modules
18− - `dependencies :: (optional) [ModuleName]`: A list of modules to load
19− including their dependencies. In contrast to the `module` field, all the
20− imports in these Modules will also be loaded.
21−
22−```json
23−{
24− "command": "load",
25− "params": (optional) {
26− "modules": (optional)["Module.Name1", "Module.Name2"],
27− "dependencies": (optional)["Module.Name3"]
28− }
29−}
30−```
31−
32−**Result:**
33−
34−The Load Command returns a string.
35−
36−### Type
37−The `type` command looks up the type for a given identifier.
38−
39−**Params:**
40− - `search :: String`: The identifier to look for. Only matches on equality.
41− - `filters :: [Filter]`: These filters will be applied before looking for the
42− identifier. These filters get combined with *AND*, so a candidate must match *ALL*
43− of them to be eligible.
44−```json
45−{
46− "command": "type",
47− "params": {
48− "search": "filterM",
49− "filters": [Filter]
50− }
51−}
52−```
53−
54−**Result:**
55−The possible types are returned in the same format as completions
56−
57−### Complete
58−The `complete` command looks up possible completions/corrections.
59−
60−**Params**:
61− - `filters :: [Filter]`: The same as for the `type` command. A candidate must match
62− all filters.
63− - `matcher :: (optional) Matcher`: The strategy used for matching candidates after filtering.
64− Results are scored internally and will be returned in the descending order where
65− the nth element is better then the n+1-th.
66−
67− If no matcher is given every candidate, that passes the filters, is returned in no
68− particular order.
69−```json
70−{
71− "command": "complete",
72− "params": {
73− "filters": [Filter],
74− "matcher": (optional) Matcher
75− }
76−}
77−```
78−
79−**Result:**
80−
81−The following format is returned as the Result:
82−
83−```json
84−[
85− {
86− "module": "Data.Array",
87− "identifier": "filter",
88− "type": "forall a. (a -> Boolean) -> Array a -> Array a"
89− }
90−]
91−```
92−
93−
94−### CaseSplit
95−
96−The CaseSplit command takes a line of source code, an area in that line of code
97−and replaces it with all patterns for a given type. The parameter `annotations`
98−is used to turn type annotations on or off for the constructor fields.
99−
100−```json
101−{
102− "command": "caseSplit",
103− "params": {
104− "line": "elem a as",
105− "begin": 8,
106− "end": 10,
107− "annotations": true,
108− "type": "List"
109− }
110−}
111−```
112−
113−**Result:**
114−
115−The following format is returned as the Result:
116−
117−```json
118−[
119− "elem a Nil",
120− "elem a (Cons (_ :: a) (_ :: List a))"
121−]
122−```
123−You should then be able to replace the affected line of code in the editor with the new suggestions.
124−
125−### Add Clause
126−
127−The AddClause command takes a typedeclaration and generates a function template for the given type.
128−The `annotations` option turns type annotations on or off for the function arguments.
129−
130−```json
131−{
132− "command": "addClause",
133− "params": {
134− "line": "elem :: forall a. (Eq a) => a -> List a",
135− "annotations": true
136− }
137−}
138−```
139−
140−**Result:**
141−
142−The following format is returned as the Result:
143−
144−```json
145−[
146− "elem :: forall a. (Eq a) => a -> List a",
147− "elem ( _ :: a) = ?elem"
148−]
149−```
150−You should then be able to replace the affected line of code in the editor with the new suggestions.
151−
152−### Import
153−
154−For now all of the import related commands work with a file on the filesystem.
155−
156−You can specify it with the `file` parameter.
157−
158−If you supply the optional `outfile` parameter, the output will be written to
159−that file, and an info message will be returned from the client.
160−
161−If you don't supply `outfile`, the server responds with a list of strings which,
162−when inserted into a file linewise create the module with the applied changes.
163−
164−Arguments:
165−
166−- `file` :: String
167−- `outfile` :: Maybe String
168−- `filters` :: Maybe [Filter]
169−
170−Example:
171−
172−```json
173−{
174− "command": "import",
175− "params": {
176− "file": "/home/creek/Documents/chromacannon/src/Main.purs",
177− "outfile": "/home/creek/Documents/chromacannon/src/Main.purs",
178− "filters": [{
179− "filter": "modules",
180− "params": {
181− "modules": ["My.Module"]
182− }
183− }],
184− "importCommand": {
185− "yadda": "yadda"
186− }
187− }
188−}
189−```
190−
191−
192−#### Subcommand `addImplicitImport`
193−
194−This command just adds an unqualified import for the given modulename.
195−
196−Arguments:
197−- `moduleName :: String`
198−
199−Example:
200−```json
201−{
202− "command": "import",
203− "params": {
204− "file": "/home/creek/Documents/chromacannon/src/Main.purs",
205− "importCommand": {
206− "importCommand": "addImplicitImport",
207− "module": "Data.Array.LOL"
208− }
209− }
210−}
211−```
212−#### Subcommand `addImport`
213−
214−This command takes an identifier and searches the currently loaded modules for
215−it. If it finds no matches it responds with an Error. If it finds exactly one
216−match it adds the import and returns. If it finds more than one match it
217−responds with a list of the found matches as completions like the complete
218−command.
219−
220−You can also supply a list of filters like the ones for completion. This way you
221−can narrow down the search to a certain module and resolve the case in which
222−more then one match was found.
223−
224−Arguments:
225−- `moduleName :: String`
226−- `filters :: [Filter]`
227−
228−Example:
229−```json
230−{
231− "command": "import",
232− "params": {
233− "file": "/home/creek/Documents/chromacannon/src/Demo.purs",
234− "outfile": "/home/creek/Documents/chromacannon/src/Demo.purs",
235− "importCommand": {
236− "importCommand": "addImport",
237− "identifier": "bind"
238− }
239− }
240−}
241−```
242−
243−### Rebuild
244−
245−The `rebuild` command provides a fast rebuild for a single module. It doesn't
246−recompile the entire project though. All the modules dependencies need to be
247−loaded.
248−
249−Arguments:
250−- `file :: String` the path to the module to rebuild
251−
252−```json
253−{
254− "command": "rebuild",
255− "params": {
256− "file": "/path/to/file.purs"
257− }
258−}
259−```
260−
261−**Result**
262−
263−In the Success case you get a list of warnings in the compilers json format.
264−
265−In the Error case you get the errors in the compilers json format
266−
267−### Pursuit
268−The `pursuit` command looks up the packages/completions for a given identifier from Pursuit.
269−
270−**Params:**
271− - `query :: String`: With `type: "package"` this should be a module name. With
272− `type: "completion"` this can be any string to look up.
273− - `type :: String`: Takes the following values:
274− - `package`: Looks for packages that contain the given module name.
275− - `completion` Looks for declarations for the query from Pursuit.
276−
277−```json
278−{
279− "command": "pursuit",
280− "params": {
281− "query": "Data.Array",
282− "type": "package"
283− }
284−}
285−```
286−
287−**Result:**
288−
289−`package` returns:
290−
291−```json
292−[
293− {
294− "module": "Module1.Name",
295− "package": "purescript-packagename"
296− }
297−]
298−```
299−
300−`completion` returns:
301−
302−```json
303−[
304− {
305− "module": "Data.Array",
306− "identifier": "filter",
307− "type": "forall a. (a -> Boolean) -> Array a -> Array a",
308− "package": "purescript-arrays"
309− }
310−]
311−```
312−
313−### List
314−
315−#### Loaded Modules
316−
317−`list` of type `loadedModules` lists all loaded modules (This means they can be searched for completions etc)
318−
319−```json
320−{
321− "command": "list",
322− "params": {
323− "type": "loadedModules"
324− }
325−}
326−```
327−
328−#### Response:
329−
330−The list loadedModules command returns a list of strings.
331−
332−#### Available Modules
333−
334−`list` of type `availableModules` lists all available modules. (This basically
335−means the contents of the `output/` folder.))
336−
337−```json
338−{
339− "command": "list",
340− "params": {
341− "type": "availableModules"
342− }
343−}
344−```
345−
346−#### Response:
347−
348−The list availableModules command returns a list of strings.
349−
350−#### Imports
351−
352−The list commmand can also list the imports for a given file.
353−
354−```json
355−{
356− "command": "list",
357− "params": {
358− "type": "import",
359− "file": "/home/kritzcreek/Documents/psc-ide/examples/Main.purs"
360− }
361−}
362−```
363−
364−#### Response:
365−
366−The list import command returns a list of imports where imports are of the following form:
367−
368−Implicit Import(`import Data.Array`):
369−```json
370−[
371− {
372− "module": "Data.Array",
373− "importType": "implicit"
374− }
375−]
376−```
377−
378−Implicit qualified Import(`import qualified Data.Array as A`):
379−```json
380−[
381− {
382− "module": "Data.Array",
383− "importType": "implicit",
384− "qualifier": "A"
385− }
386−]
387−```
388−
389−Explicit Import(`import Data.Array (filter, filterM, join)`):
390−```json
391−[
392− {
393− "module": "Data.Array",
394− "importType": "explicit",
395− "identifiers": ["filter", "filterM", "join"]
396− }
397−]
398−```
399−
400−Hiding Import(`import Data.Array hiding (filter, filterM, join)`):
401−```json
402−[
403− {
404− "module": "Data.Array",
405− "importType": "hiding",
406− "identifiers": ["filter", "filterM", "join"]
407− }
408−]
409−```
410−### Cwd/Quit
411−`cwd` returns the working directory of the server(should be your project root).
412−
413−`quit` quits the server.
414−
415−```json
416−{
417− "command": "cwd|quit"
418−}
419−```
420−
421−**Result:**
422−These commands return strings.
423−
424−## Filter:
425−
426−### Exact filter
427−The Exact filter only keeps identifiers that are equal to the search term.
428−
429−```json
430−{
431− "filter": "exact",
432− "params": {
433− "search": "filterM"
434− }
435−}
436−```
437−### Prefix filter
438−The Prefix filter keeps identifiers/modules/data declarations that
439−are prefixed by the search term.
440−
441−```json
442−{
443− "filter": "prefix",
444− "params": {
445− "search": "filt"
446− }
447−}
448−```
449−
450−### Module filter
451−The Module filter only keeps identifiers that appear in the listed modules.
452−
453−```json
454−{
455− "filter": "modules",
456− "params": {
457− "modules": ["My.Module"]
458− }
459−}
460−```
461−
462−### Dependency filter
463−The Dependency filter only keeps identifiers that appear in the listed modules
464−and in any of their dependencies/imports.
465−
466−```json
467−{
468− "filter": "dependencies",
469− "params": {
470− "modules": ["My.Module"]
471− }
472−}
473−```
474−
475−## Matcher:
476−
477−### Flex matcher
478−Matches any occurence of the search string with intersections
479−
480−The scoring measures how far the matches span the string, where
481−closer is better. The matches then get sorted with highest score first.
482−
483−Examples:
484−- flMa matches **fl**ex**Ma**tcher. Score: 14.28
485−- sons matches **so**rtCompletio**ns**. Score: 6.25
486−```json
487−
488−{
489− "matcher": "flex",
490− "params": {
491− "search": "filt"
492− }
493−}
494−```
495−
496−### Distance Matcher
497−
498−The Distance matcher is meant to provide corrections for typos. It calculates
499−the edit distance in between the search and the loaded identifiers.
500−
501−```json
502−{
503− "matcher": "distance",
504− "params": {
505− "search": "dilterM",
506− "maximumDistance": 3
507− }
508−}
509−```
510−
511−## Responses
512−
513−All Responses are wrapped in the following format:
514−
515−```json
516−{
517− "resultType": "success|error",
518− "result": Result|Error
519−}
520−```
521−
522−### Error
523−
524−Errors at this point are merely Error strings. Newlines are escaped like `\n`
525−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−50
@@ -1,50 +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 System.IO (hSetEncoding, stderr, stdout, utf8)
11−
12−import qualified Paths_purescript as Paths
13−import Language.PureScript.Publish
14−import Language.PureScript.Publish.ErrorsWarnings
15−
16−dryRun :: Parser Bool
17−dryRun = switch $
18− long "dry-run"
19− <> help "Produce no output, and don't require a tagged version to be checked out."
20−
21−dryRunOptions :: PublishOptions
22−dryRunOptions = defaultPublishOptions
23− { publishGetVersion = return dummyVersion
24− , publishWorkingTreeDirty = warn DirtyWorkingTree_Warn
25− }
26− where dummyVersion = ("0.0.0", Version [0,0,0] [])
27−
28−main :: IO ()
29−main = do
30− hSetEncoding stdout utf8
31− hSetEncoding stderr utf8
32− execParser opts >>= publish
33− where
34− opts = info (version <*> helper <*> dryRun) infoModList
35− infoModList = fullDesc <> headerInfo <> footerInfo
36− headerInfo = header "psc-publish - Generates documentation packages for upload to http://pursuit.purescript.org"
37− footerInfo = footer $ "psc-publish " ++ showVersion Paths.version
38−
39− version :: Parser (a -> a)
40− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
41−
42−publish :: Bool -> IO ()
43−publish isDryRun =
44− if isDryRun
45− then do
46− _ <- unsafePreparePackage dryRunOptions
47− putStrLn "Dry run completed, no errors."
48− else do
49− pkg <- unsafePreparePackage defaultPublishOptions
50− BL.putStrLn (A.encode pkg)
psc/Main.hsdeleted−194
@@ -1,194 +0,0 @@
1−{-# LANGUAGE DataKinds #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE RecordWildCards #-}
4−{-# LANGUAGE TupleSections #-}
5−
6−module Main where
7−
8−import Control.Applicative
9−import Control.Monad
10−import Control.Monad.Error.Class (MonadError(..))
11−import Control.Monad.Writer.Strict
12−
13−import Data.List (isSuffixOf, partition)
14−import Data.Version (showVersion)
15−import qualified Data.Map as M
16−import qualified Data.Aeson as A
17−import qualified Data.ByteString.Lazy as B
18−import qualified Data.ByteString.UTF8 as BU8
19−
20−import Options.Applicative as Opts
21−
22−import System.Exit (exitSuccess, exitFailure)
23−import System.IO (hSetEncoding, hPutStrLn, stdout, stderr, utf8)
24−import System.IO.UTF8
25−import System.FilePath.Glob (glob)
26−
27−import qualified Language.PureScript as P
28−import qualified Paths_purescript as Paths
29−
30−import Language.PureScript.Make
31−import Language.PureScript.Errors.JSON
32−
33−data PSCMakeOptions = PSCMakeOptions
34− { pscmInput :: [FilePath]
35− , pscmForeignInput :: [FilePath]
36− , pscmOutputDir :: FilePath
37− , pscmOpts :: P.Options
38− , pscmUsePrefix :: Bool
39− , pscmJSONErrors :: Bool
40− }
41−
42−data InputOptions = InputOptions
43− { ioInputFiles :: [FilePath]
44− }
45−
46−-- | Argumnets: verbose, use JSON, warnings, errors
47−printWarningsAndErrors :: Bool -> Bool -> P.MultipleErrors -> Either P.MultipleErrors a -> IO ()
48−printWarningsAndErrors verbose False warnings errors = do
49− when (P.nonEmpty warnings) $
50− hPutStrLn stderr (P.prettyPrintMultipleWarnings verbose warnings)
51− case errors of
52− Left errs -> do
53− hPutStrLn stderr (P.prettyPrintMultipleErrors verbose errs)
54− exitFailure
55− Right _ -> return ()
56−printWarningsAndErrors verbose True warnings errors = do
57− hPutStrLn stderr . BU8.toString . B.toStrict . A.encode $
58− JSONResult (toJSONErrors verbose P.Warning warnings)
59− (either (toJSONErrors verbose P.Error) (const []) errors)
60− either (const exitFailure) (const (return ())) errors
61−
62−compile :: PSCMakeOptions -> IO ()
63−compile PSCMakeOptions{..} = do
64− input <- globWarningOnMisses (unless pscmJSONErrors . warnFileTypeNotFound) pscmInput
65− when (null input && not pscmJSONErrors) $ do
66− hPutStrLn stderr "psc: No input files."
67− exitFailure
68− let (jsFiles, pursFiles) = partition (isSuffixOf ".js") input
69− moduleFiles <- readInput (InputOptions pursFiles)
70− inputForeign <- globWarningOnMisses (unless pscmJSONErrors . warnFileTypeNotFound) pscmForeignInput
71− foreignFiles <- forM (inputForeign ++ jsFiles) (\inFile -> (inFile,) <$> readUTF8File inFile)
72− (makeErrors, makeWarnings) <- runMake pscmOpts $ do
73− (ms, foreigns) <- parseInputs moduleFiles foreignFiles
74− let filePathMap = M.fromList $ map (\(fp, P.Module _ _ mn _ _) -> (mn, fp)) ms
75− makeActions = buildMakeActions pscmOutputDir filePathMap foreigns pscmUsePrefix
76− P.make makeActions (map snd ms)
77− printWarningsAndErrors (P.optionsVerboseErrors pscmOpts) pscmJSONErrors makeWarnings makeErrors
78− exitSuccess
79−
80−warnFileTypeNotFound :: String -> IO ()
81−warnFileTypeNotFound = hPutStrLn stderr . ("psc: No files found using pattern: " ++)
82−
83−globWarningOnMisses :: (String -> IO ()) -> [FilePath] -> IO [FilePath]
84−globWarningOnMisses warn = concatMapM globWithWarning
85− where
86− globWithWarning pattern = do
87− paths <- glob pattern
88− when (null paths) $ warn pattern
89− return paths
90− concatMapM f = liftM concat . mapM f
91−
92−readInput :: InputOptions -> IO [(Either P.RebuildPolicy FilePath, String)]
93−readInput InputOptions{..} = forM ioInputFiles $ \inFile -> (Right inFile, ) <$> readUTF8File inFile
94−
95−parseInputs :: (MonadError P.MultipleErrors m, MonadWriter P.MultipleErrors m)
96− => [(Either P.RebuildPolicy FilePath, String)]
97− -> [(FilePath, P.ForeignJS)]
98− -> m ([(Either P.RebuildPolicy FilePath, P.Module)], M.Map P.ModuleName FilePath)
99−parseInputs modules foreigns =
100− (,) <$> P.parseModulesFromFiles (either (const "") id) modules
101− <*> P.parseForeignModulesFromFiles foreigns
102−
103−inputFile :: Parser FilePath
104−inputFile = strArgument $
105− metavar "FILE"
106− <> help "The input .purs file(s)"
107−
108−inputForeignFile :: Parser FilePath
109−inputForeignFile = strOption $
110− short 'f'
111− <> long "ffi"
112− <> help "The input .js file(s) providing foreign import implementations"
113−
114−outputDirectory :: Parser FilePath
115−outputDirectory = strOption $
116− short 'o'
117− <> long "output"
118− <> Opts.value "output"
119− <> showDefault
120− <> help "The output directory"
121−
122−noTco :: Parser Bool
123−noTco = switch $
124− long "no-tco"
125− <> help "Disable tail call optimizations"
126−
127−noMagicDo :: Parser Bool
128−noMagicDo = switch $
129− long "no-magic-do"
130− <> help "Disable the optimization that overloads the do keyword to generate efficient code specifically for the Eff monad"
131−
132−noOpts :: Parser Bool
133−noOpts = switch $
134− long "no-opts"
135− <> help "Skip the optimization phase"
136−
137−comments :: Parser Bool
138−comments = switch $
139− short 'c'
140− <> long "comments"
141− <> help "Include comments in the generated code"
142−
143−verboseErrors :: Parser Bool
144−verboseErrors = switch $
145− short 'v'
146− <> long "verbose-errors"
147− <> help "Display verbose error messages"
148−
149−noPrefix :: Parser Bool
150−noPrefix = switch $
151− short 'p'
152− <> long "no-prefix"
153− <> help "Do not include comment header"
154−
155−jsonErrors :: Parser Bool
156−jsonErrors = switch $
157− long "json-errors"
158− <> help "Print errors to stderr as JSON"
159−sourceMaps :: Parser Bool
160−sourceMaps = switch $
161− long "source-maps"
162− <> help "Generate source maps"
163−
164−
165−options :: Parser P.Options
166−options = P.Options <$> noTco
167− <*> noMagicDo
168− <*> pure Nothing
169− <*> noOpts
170− <*> verboseErrors
171− <*> (not <$> comments)
172− <*> sourceMaps
173−
174−pscMakeOptions :: Parser PSCMakeOptions
175−pscMakeOptions = PSCMakeOptions <$> many inputFile
176− <*> many inputForeignFile
177− <*> outputDirectory
178− <*> options
179− <*> (not <$> noPrefix)
180− <*> jsonErrors
181−
182−main :: IO ()
183−main = do
184− hSetEncoding stdout utf8
185− hSetEncoding stderr utf8
186− execParser opts >>= compile
187− where
188− opts = info (version <*> helper <*> pscMakeOptions) infoModList
189− infoModList = fullDesc <> headerInfo <> footerInfo
190− headerInfo = header "psc - Compiles PureScript to Javascript"
191− footerInfo = footer $ "psc " ++ showVersion Paths.version
192−
193− version :: Parser (a -> a)
194− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
psci/PSCi.hsdeleted−372
@@ -1,372 +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−import System.IO.UTF8 (readUTF8File)
37−
38−import qualified Language.PureScript as P
39−import qualified Language.PureScript.Names as N
40−
41−import PSCi.Completion (completion)
42−import PSCi.Parser (parseCommand)
43−import PSCi.Option
44−import PSCi.Types
45−import PSCi.Message
46−import PSCi.IO
47−import PSCi.Printer
48−import PSCi.Module
49−
50−-- |
51−-- PSCI monad
52−--
53−newtype PSCI a = PSCI { runPSCI :: InputT (StateT PSCiState IO) a } deriving (Functor, Applicative, Monad)
54−
55−psciIO :: IO a -> PSCI a
56−psciIO io = PSCI . lift $ lift io
57−
58−-- |
59−-- The runner
60−--
61−runPSCi :: IO ()
62−runPSCi = getOpt >>= loop
63−
64−-- |
65−-- The PSCI main loop.
66−--
67−loop :: PSCiOptions -> IO ()
68−loop PSCiOptions{..} = do
69− config <- loadUserConfig
70− inputFiles <- concat <$> traverse glob psciInputFile
71− foreignFiles <- concat <$> traverse glob psciForeignInputFiles
72− modulesOrFirstError <- loadAllModules inputFiles
73− case modulesOrFirstError of
74− Left errs -> putStrLn (P.prettyPrintMultipleErrors False errs) >> exitFailure
75− Right modules -> do
76− historyFilename <- getHistoryFilename
77− let settings = defaultSettings { historyFile = Just historyFilename }
78− foreignsOrError <- runMake $ do
79− foreignFilesContent <- forM foreignFiles (\inFile -> (inFile,) <$> makeIO (const (P.ErrorMessage [] $ P.CannotReadFile inFile)) (readUTF8File inFile))
80− P.parseForeignModulesFromFiles foreignFilesContent
81− case foreignsOrError of
82− Left errs -> putStrLn (P.prettyPrintMultipleErrors False errs) >> exitFailure
83− Right foreigns ->
84− flip evalStateT (mkPSCiState [] modules foreigns [] psciInputNodeFlags) . runInputT (setComplete completion settings) $ do
85− outputStrLn prologueMessage
86− traverse_ (traverse_ (runPSCI . handleCommand)) config
87− modules' <- lift $ gets psciLoadedModules
88− unless (consoleIsDefined (map snd modules')) . outputStrLn $ unlines
89− [ "PSCi requires the purescript-console module to be installed."
90− , "For help getting started, visit http://wiki.purescript.org/PSCi"
91− ]
92− go
93− where
94− go :: InputT (StateT PSCiState IO) ()
95− go = do
96− c <- getCommand (not psciMultiLineMode)
97− case c of
98− Left err -> outputStrLn err >> go
99− Right Nothing -> go
100− Right (Just QuitPSCi) -> outputStrLn quitMessage
101− Right (Just c') -> do
102− handleInterrupt (outputStrLn "Interrupted.")
103− (withInterrupt (runPSCI (loadAllImportedModules >> handleCommand c')))
104− go
105−
106−-- Compile the module
107−
108−-- |
109−-- Load all modules, updating the application state
110−--
111−loadAllImportedModules :: PSCI ()
112−loadAllImportedModules = do
113− files <- PSCI . lift $ fmap psciImportedFilenames get
114− modulesOrFirstError <- psciIO $ loadAllModules files
115− case modulesOrFirstError of
116− Left errs -> PSCI $ printErrors errs
117− Right modules -> PSCI . lift . modify $ updateModules modules
118−
119−-- | This is different than the runMake in 'Language.PureScript.Make' in that it specifies the
120−-- options and ignores the warning messages.
121−runMake :: P.Make a -> IO (Either P.MultipleErrors a)
122−runMake mk = fst <$> P.runMake P.defaultOptions mk
123−
124−makeIO :: (IOError -> P.ErrorMessage) -> IO a -> P.Make a
125−makeIO f io = do
126− e <- liftIO $ tryIOError io
127− either (throwError . P.singleError . f) return e
128−
129−make :: PSCiState -> [P.Module] -> P.Make P.Environment
130−make st@PSCiState{..} ms = P.make actions' (map snd loadedModules ++ ms)
131− where
132− filePathMap = M.fromList $ (first P.getModuleName . swap) `map` allModules
133− actions = P.buildMakeActions modulesDir filePathMap psciForeignFiles False
134− actions' = actions { P.progress = const (return ()) }
135− loadedModules = psciLoadedModules st
136− allModules = map (first Right) loadedModules ++ map (Left P.RebuildAlways,) ms
137−
138−
139−-- Commands
140−
141−-- |
142−-- Parses the input and returns either a Metacommand, or an error as a string.
143−--
144−getCommand :: Bool -> InputT (StateT PSCiState IO) (Either String (Maybe Command))
145−getCommand singleLineMode = handleInterrupt (return (Right Nothing)) $ do
146− firstLine <- withInterrupt $ getInputLine "> "
147− case firstLine of
148− Nothing -> return (Right (Just QuitPSCi)) -- Ctrl-D when input is empty
149− Just "" -> return (Right Nothing)
150− Just s | singleLineMode || head s == ':' -> return .fmap Just $ parseCommand s
151− Just s -> fmap Just . parseCommand <$> go [s]
152− where
153− go :: [String] -> InputT (StateT PSCiState IO) String
154− go ls = maybe (return . unlines $ reverse ls) (go . (:ls)) =<< getInputLine " "
155−
156−-- |
157−-- Performs an action for each meta-command given, and also for expressions.
158−--
159−handleCommand :: Command -> PSCI ()
160−handleCommand (Expression val) = handleExpression val
161−handleCommand ShowHelp = PSCI $ outputStrLn helpMessage
162−handleCommand (Import im) = handleImport im
163−handleCommand (Decls l) = handleDecls l
164−handleCommand (LoadFile filePath) = PSCI $ whenFileExists filePath $ \absPath -> do
165− m <- lift . lift $ loadModule absPath
166− case m of
167− Left err -> outputStrLn err
168− Right mods -> lift $ modify (updateModules (map (absPath,) mods))
169−handleCommand (LoadForeign filePath) = PSCI $ whenFileExists filePath $ \absPath -> do
170− foreignsOrError <- lift . lift . runMake $ do
171− foreignFile <- makeIO (const (P.ErrorMessage [] $ P.CannotReadFile absPath)) (readUTF8File absPath)
172− P.parseForeignModulesFromFiles [(absPath, foreignFile)]
173− case foreignsOrError of
174− Left err -> outputStrLn $ P.prettyPrintMultipleErrors False err
175− Right foreigns -> lift $ modify (updateForeignFiles foreigns)
176−handleCommand ResetState = do
177− PSCI . lift . modify $ \st ->
178− st { psciImportedModules = []
179− , psciLetBindings = []
180− }
181− loadAllImportedModules
182−handleCommand (TypeOf val) = handleTypeOf val
183−handleCommand (KindOf typ) = handleKindOf typ
184−handleCommand (BrowseModule moduleName) = handleBrowse moduleName
185−handleCommand (ShowInfo QueryLoaded) = handleShowLoadedModules
186−handleCommand (ShowInfo QueryImport) = handleShowImportedModules
187−handleCommand QuitPSCi = P.internalError "`handleCommand QuitPSCi` was called. This is a bug."
188−
189−
190−-- |
191−-- Takes a value expression and evaluates it with the current state.
192−--
193−handleExpression :: P.Expr -> PSCI ()
194−handleExpression val = do
195− st <- PSCI $ lift get
196− let m = createTemporaryModule True st val
197− let nodeArgs = psciNodeFlags st ++ [indexFile]
198− e <- psciIO . runMake $ make st [supportModule, m]
199− case e of
200− Left errs -> PSCI $ printErrors errs
201− Right _ -> do
202− psciIO $ writeFile indexFile "require('$PSCI')['$main']();"
203− process <- psciIO findNodeProcess
204− result <- psciIO $ traverse (\node -> readProcessWithExitCode node nodeArgs "") process
205− case result of
206− Just (ExitSuccess, out, _) -> PSCI $ outputStrLn out
207− Just (ExitFailure _, _, err) -> PSCI $ outputStrLn err
208− Nothing -> PSCI $ outputStrLn "Couldn't find node.js"
209−
210−-- |
211−-- Takes a list of declarations and updates the environment, then run a make. If the declaration fails,
212−-- restore the original environment.
213−--
214−handleDecls :: [P.Declaration] -> PSCI ()
215−handleDecls ds = do
216− st <- PSCI $ lift get
217− let st' = updateLets ds st
218− let m = createTemporaryModule False st' (P.Literal (P.ObjectLiteral []))
219− e <- psciIO . runMake $ make st' [m]
220− case e of
221− Left err -> PSCI $ printErrors err
222− Right _ -> PSCI $ lift (put st')
223−
224−-- |
225−-- Show actual loaded modules in psci.
226−--
227−handleShowLoadedModules :: PSCI ()
228−handleShowLoadedModules = do
229− loadedModules <- PSCI $ lift $ gets psciLoadedModules
230− psciIO $ readModules loadedModules >>= putStrLn
231− return ()
232− where readModules = return . unlines . sort . nub . map toModuleName
233− toModuleName = N.runModuleName . (\ (P.Module _ _ mdName _ _) -> mdName) . snd
234−
235−-- |
236−-- Show the imported modules in psci.
237−--
238−handleShowImportedModules :: PSCI ()
239−handleShowImportedModules = do
240− PSCiState { psciImportedModules = importedModules } <- PSCI $ lift get
241− psciIO $ showModules importedModules >>= putStrLn
242− return ()
243− where
244− showModules = return . unlines . sort . map showModule
245− showModule (mn, declType, asQ) =
246− "import " ++ N.runModuleName mn ++ showDeclType declType ++
247− foldMap (\mn' -> " as " ++ N.runModuleName mn') asQ
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.TypeOpRef ident) = "type (" ++ N.runIdent ident ++ ")"
257− showRef (P.ValueRef ident) = N.runIdent ident
258− showRef (P.TypeClassRef pn) = "class " ++ N.runProperName pn
259− showRef (P.ProperRef pn) = pn
260− showRef (P.TypeInstanceRef ident) = N.runIdent ident
261− showRef (P.ModuleRef name) = "module " ++ N.runModuleName name
262− showRef (P.PositionedDeclarationRef _ _ ref) = showRef ref
263−
264− commaList :: [String] -> String
265− commaList = intercalate ", "
266−
267−-- |
268−-- Imports a module, preserving the initial state on failure.
269−--
270−handleImport :: ImportedModule -> PSCI ()
271−handleImport im = do
272− st <- updateImportedModules im <$> PSCI (lift get)
273− let m = createTemporaryModuleForImports st
274− e <- psciIO . runMake $ make st [m]
275− case e of
276− Left errs -> PSCI $ printErrors errs
277− Right _ -> do
278− PSCI $ lift $ put st
279− return ()
280−
281−-- |
282−-- Takes a value and prints its type
283−--
284−handleTypeOf :: P.Expr -> PSCI ()
285−handleTypeOf val = do
286− st <- PSCI $ lift get
287− let m = createTemporaryModule False st val
288− e <- psciIO . runMake $ make st [m]
289− case e of
290− Left errs -> PSCI $ printErrors errs
291− Right env' ->
292− case M.lookup (P.ModuleName [P.ProperName "$PSCI"], P.Ident "it") (P.names env') of
293− Just (ty, _, _) -> PSCI . outputStrLn . P.prettyPrintType $ ty
294− Nothing -> PSCI $ outputStrLn "Could not find type"
295−
296−-- |
297−-- Browse a module and displays its signature (if module exists).
298−--
299−handleBrowse :: P.ModuleName -> PSCI ()
300−handleBrowse moduleName = do
301− st <- PSCI $ lift get
302− env <- psciIO . runMake $ make st []
303− case env of
304− Left errs -> PSCI $ printErrors errs
305− Right env' ->
306− if isModInEnv moduleName st
307− then PSCI $ printModuleSignatures moduleName env'
308− else case lookupUnQualifiedModName moduleName st of
309− Just unQualifiedName ->
310− if isModInEnv unQualifiedName st
311− then PSCI $ printModuleSignatures unQualifiedName env'
312− else failNotInEnv moduleName
313− Nothing ->
314− failNotInEnv moduleName
315− where
316− isModInEnv modName =
317− any ((== modName) . P.getModuleName . snd) . psciLoadedModules
318− failNotInEnv modName =
319− PSCI $ outputStrLn $ "Module '" ++ N.runModuleName modName ++ "' is not valid."
320− lookupUnQualifiedModName quaModName st =
321− (\(modName,_,_) -> modName) <$> find ( \(_, _, mayQuaName) -> mayQuaName == Just quaModName) (psciImportedModules st)
322−
323−-- |
324−-- Takes a value and prints its kind
325−--
326−handleKindOf :: P.Type -> PSCI ()
327−handleKindOf typ = do
328− st <- PSCI $ lift get
329− let m = createTemporaryModuleForKind st typ
330− mName = P.ModuleName [P.ProperName "$PSCI"]
331− e <- psciIO . runMake $ make st [m]
332− case e of
333− Left errs -> PSCI $ printErrors errs
334− Right env' ->
335− case M.lookup (P.Qualified (Just mName) $ P.ProperName "IT") (P.typeSynonyms env') of
336− Just (_, typ') -> do
337− let chk = (P.emptyCheckState env') { P.checkCurrentModule = Just mName }
338− k = check (P.kindOf typ') chk
339−
340− check :: StateT P.CheckState (ExceptT P.MultipleErrors (Writer P.MultipleErrors)) a -> P.CheckState -> Either P.MultipleErrors (a, P.CheckState)
341− check sew = fst . runWriter . runExceptT . runStateT sew
342− case k of
343− Left errStack -> PSCI . outputStrLn . P.prettyPrintMultipleErrors False $ errStack
344− Right (kind, _) -> PSCI . outputStrLn . P.prettyPrintKind $ kind
345− Nothing -> PSCI $ outputStrLn "Could not find kind"
346−
347−-- Misc
348−
349−-- |
350−-- Attempts to read initial commands from '.psci' in the present working
351−-- directory then the user's home
352−--
353−loadUserConfig :: IO (Maybe [Command])
354−loadUserConfig = onFirstFileMatching readCommands pathGetters
355− where
356− pathGetters = [getCurrentDirectory, getHomeDirectory]
357− readCommands :: IO FilePath -> IO (Maybe [Command])
358− readCommands path = do
359− configFile <- (</> ".psci") <$> path
360− exists <- doesFileExist configFile
361− if exists
362− then do
363− ls <- lines <$> readUTF8File configFile
364− case traverse parseCommand ls of
365− Left err -> print err >> exitFailure
366− Right cs -> return $ Just cs
367− else
368− return Nothing
369−
370−-- | Checks if the Console module is defined
371−consoleIsDefined :: [P.Module] -> Bool
372−consoleIsDefined = any ((== P.ModuleName (map P.ProperName [ "Control", "Monad", "Eff", "Console" ])) . P.getModuleName)
psci/PSCi/Completion.hsdeleted−223
@@ -1,223 +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.Function (on)
11−
12−import Control.Arrow (second)
13−import Control.Monad.Trans.Reader (asks, runReaderT, ReaderT)
14−import Control.Monad.Trans.State.Strict
15−
16−import System.Console.Haskeline
17−
18−import qualified Language.PureScript as P
19−import qualified Language.PureScript.Names as N
20−
21−import qualified PSCi.Directive as D
22−import PSCi.Types
23−
24−-- Completions may read the state, but not modify it.
25−type CompletionM = ReaderT PSCiState IO
26−
27−-- Lift a `CompletionM` action to a `StateT PSCiState IO` one.
28−liftCompletionM :: CompletionM a -> StateT PSCiState IO a
29−liftCompletionM act = StateT (\s -> (\a -> (a, s)) <$> runReaderT act s)
30−
31−-- Haskeline completions
32−
33−data CompletionContext
34− = CtxDirective String
35− | CtxFilePath String
36− | CtxModule
37− | CtxIdentifier
38− | CtxType
39− | CtxFixed String
40− deriving (Show, Read)
41−
42−-- |
43−-- Loads module, function, and file completions.
44−--
45−completion :: CompletionFunc (StateT PSCiState IO)
46−completion = liftCompletionM . completion'
47−
48−completion' :: CompletionFunc CompletionM
49−completion' = completeWordWithPrev Nothing " \t\n\r" findCompletions
50−
51−-- |
52−-- Decide what kind of completion we need based on input. This function expects
53−-- a list of complete words (to the left of the cursor) as the first argument,
54−-- and the current word as the second argument.
55−completionContext :: [String] -> String -> [CompletionContext]
56−completionContext [] _ = [CtxDirective "", CtxIdentifier, CtxFixed "import"]
57−completionContext ws w | headSatisfies (":" `isPrefixOf`) ws = completeDirective ws w
58−completionContext ws w | headSatisfies (== "import") ws = completeImport ws w
59−completionContext _ _ = [CtxIdentifier]
60−
61−completeDirective :: [String] -> String -> [CompletionContext]
62−completeDirective ws w =
63− case ws of
64− [] -> [CtxDirective w]
65− [dir] -> case D.directivesFor <$> stripPrefix ":" dir of
66− -- only offer completions if the directive is unambiguous
67− Just [dir'] -> directiveArg w dir'
68− _ -> []
69−
70− -- All directives take exactly one argument. If we haven't yet matched,
71− -- that means one argument has already been supplied. So don't complete
72− -- any others.
73− _ -> []
74−
75−directiveArg :: String -> Directive -> [CompletionContext]
76−directiveArg _ Browse = [CtxModule]
77−directiveArg w Load = [CtxFilePath w]
78−directiveArg w Foreign = [CtxFilePath w]
79−directiveArg _ Quit = []
80−directiveArg _ Reset = []
81−directiveArg _ Help = []
82−directiveArg _ Show = map CtxFixed replQueryStrings
83−directiveArg _ Type = [CtxIdentifier]
84−directiveArg _ Kind = [CtxType]
85−
86−completeImport :: [String] -> String -> [CompletionContext]
87−completeImport ws w' =
88− case (ws, w') of
89− (["import"], _) -> [CtxModule]
90− _ -> []
91−
92−headSatisfies :: (a -> Bool) -> [a] -> Bool
93−headSatisfies p str =
94− case str of
95− (c:_) -> p c
96− _ -> False
97−
98−-- | Callback for Haskeline's `completeWordWithPrev`.
99−-- Expects:
100−-- * Line contents to the left of the word, reversed
101−-- * Word to be completed
102−findCompletions :: String -> String -> CompletionM [Completion]
103−findCompletions prev word = do
104− let ctx = completionContext (words (reverse prev)) word
105− completions <- concat <$> traverse getCompletions ctx
106− return $ sortBy directivesFirst completions
107− where
108− getCompletions :: CompletionContext -> CompletionM [Completion]
109− getCompletions = fmap (mapMaybe (either (prefixedBy word) Just)) . getCompletion
110−
111− prefixedBy :: String -> String -> Maybe Completion
112− prefixedBy w cand = if w `isPrefixOf` cand
113− then Just (simpleCompletion cand)
114− else Nothing
115−
116−getCompletion :: CompletionContext -> CompletionM [Either String Completion]
117−getCompletion ctx =
118− case ctx of
119− CtxFilePath f -> map Right <$> listFiles f
120− CtxModule -> map Left <$> getModuleNames
121− CtxIdentifier -> map Left <$> ((++) <$> getIdentNames <*> getDctorNames)
122− CtxType -> map Left <$> getTypeNames
123− CtxFixed str -> return [Left str]
124− CtxDirective d -> return (map Left (completeDirectives d))
125−
126− where
127− completeDirectives :: String -> [String]
128− completeDirectives = map (':' :) . D.directiveStringsFor
129−
130−
131−getLoadedModules :: CompletionM [P.Module]
132−getLoadedModules = asks (map snd . psciLoadedModules)
133−
134−getImportedModules :: CompletionM [ImportedModule]
135−getImportedModules = asks psciImportedModules
136−
137−getModuleNames :: CompletionM [String]
138−getModuleNames = moduleNames <$> getLoadedModules
139−
140−mapLoadedModulesAndQualify :: (a -> String) -> (P.Module -> [(a, P.Declaration)]) -> CompletionM [String]
141−mapLoadedModulesAndQualify sho f = do
142− ms <- getLoadedModules
143− let argPairs = do m <- ms
144− fm <- f m
145− return (m, fm)
146− concat <$> traverse (uncurry (getAllQualifications sho)) argPairs
147−
148−getIdentNames :: CompletionM [String]
149−getIdentNames = mapLoadedModulesAndQualify P.showIdent identNames
150−
151−getDctorNames :: CompletionM [String]
152−getDctorNames = mapLoadedModulesAndQualify P.runProperName dctorNames
153−
154−getTypeNames :: CompletionM [String]
155−getTypeNames = mapLoadedModulesAndQualify P.runProperName typeDecls
156−
157−-- | Given a module and a declaration in that module, return all possible ways
158−-- it could have been referenced given the current PSCiState - including fully
159−-- qualified, qualified using an alias, and unqualified.
160−getAllQualifications :: (a -> String) -> P.Module -> (a, P.Declaration) -> CompletionM [String]
161−getAllQualifications sho m (declName, decl) = do
162− imports <- getAllImportsOf m
163− let fullyQualified = qualifyWith (Just (P.getModuleName m))
164− let otherQuals = nub (concatMap qualificationsUsing imports)
165− return $ fullyQualified : otherQuals
166− where
167− qualifyWith mMod = P.showQualified sho (P.Qualified mMod declName)
168− referencedBy refs = P.isExported (Just refs) decl
169−
170− qualificationsUsing (_, importType, asQ') =
171− let q = qualifyWith asQ'
172− in case importType of
173− P.Implicit -> [q]
174− P.Explicit refs -> [q | referencedBy refs]
175− P.Hiding refs -> [q | not $ referencedBy refs]
176−
177−
178−-- | Returns all the ImportedModule values referring to imports of a particular
179−-- module.
180−getAllImportsOf :: P.Module -> CompletionM [ImportedModule]
181−getAllImportsOf = asks . allImportsOf
182−
183−nubOnFst :: Eq a => [(a, b)] -> [(a, b)]
184−nubOnFst = nubBy ((==) `on` fst)
185−
186−typeDecls :: P.Module -> [(N.ProperName 'N.TypeName, P.Declaration)]
187−typeDecls = mapMaybe getTypeName . filter P.isDataDecl . P.exportedDeclarations
188− where
189− getTypeName :: P.Declaration -> Maybe (N.ProperName 'N.TypeName, P.Declaration)
190− getTypeName d@(P.TypeSynonymDeclaration name _ _) = Just (name, d)
191− getTypeName d@(P.DataDeclaration _ name _ _) = Just (name, d)
192− getTypeName (P.PositionedDeclaration _ _ d) = getTypeName d
193− getTypeName _ = Nothing
194−
195−identNames :: P.Module -> [(N.Ident, P.Declaration)]
196−identNames = nubOnFst . concatMap getDeclNames . P.exportedDeclarations
197− where
198− getDeclNames :: P.Declaration -> [(P.Ident, P.Declaration)]
199− getDeclNames d@(P.ValueDeclaration ident _ _ _) = [(ident, d)]
200− getDeclNames d@(P.TypeDeclaration ident _ ) = [(ident, d)]
201− getDeclNames d@(P.ExternDeclaration ident _) = [(ident, d)]
202− getDeclNames d@(P.TypeClassDeclaration _ _ _ ds) = map (second (const d)) $ concatMap getDeclNames ds
203− getDeclNames (P.PositionedDeclaration _ _ d) = getDeclNames d
204− getDeclNames _ = []
205−
206−dctorNames :: P.Module -> [(N.ProperName 'N.ConstructorName, P.Declaration)]
207−dctorNames = nubOnFst . concatMap go . P.exportedDeclarations
208− where
209− go :: P.Declaration -> [(N.ProperName 'N.ConstructorName, P.Declaration)]
210− go decl@(P.DataDeclaration _ _ _ ctors) = map (\n -> (n, decl)) (map fst ctors)
211− go (P.PositionedDeclaration _ _ d) = go d
212− go _ = []
213−
214−moduleNames :: [P.Module] -> [String]
215−moduleNames ms = nub [P.runModuleName moduleName | P.Module _ _ moduleName _ _ <- ms]
216−
217−directivesFirst :: Completion -> Completion -> Ordering
218−directivesFirst (Completion _ d1 _) (Completion _ d2 _) = go d1 d2
219− where
220− go (':' : xs) (':' : ys) = compare xs ys
221− go (':' : _) _ = LT
222− go _ (':' : _) = GT
223− 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−107
@@ -1,107 +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 System.IO.UTF8 (readUTF8File)
10−import Control.Monad
11−
12−-- | The name of the PSCI support module
13−supportModuleName :: P.ModuleName
14−supportModuleName = P.ModuleName [P.ProperName "$PSCI", P.ProperName "Support"]
15−
16−-- | Support module, contains code to evaluate terms
17−supportModule :: P.Module
18−supportModule =
19− case P.parseModulesFromFiles id [("", code)] of
20− Right [(_, P.Module ss cs _ ds exps)] -> P.Module ss cs supportModuleName ds exps
21− _ -> P.internalError "Support module could not be parsed"
22− where
23− code :: String
24− code = unlines
25− [ "module S where"
26− , ""
27− , "import Prelude"
28− , "import Control.Monad.Eff (Eff)"
29− , "import Control.Monad.Eff.Console (CONSOLE, logShow)"
30− , "import Control.Monad.Eff.Unsafe (unsafeInterleaveEff)"
31− , ""
32− , "class Eval a where"
33− , " eval :: a -> Eff (console :: CONSOLE) Unit"
34− , ""
35− , "instance evalShow :: (Show a) => Eval a where"
36− , " eval = logShow"
37− , ""
38− , "instance evalEff :: (Eval a) => Eval (Eff eff a) where"
39− , " eval x = unsafeInterleaveEff x >>= eval"
40− ]
41−
42−-- Module Management
43−
44−-- |
45−-- Loads a file for use with imports.
46−--
47−loadModule :: FilePath -> IO (Either String [P.Module])
48−loadModule filename = do
49− content <- readUTF8File filename
50− return $ either (Left . P.prettyPrintMultipleErrors False) (Right . map snd) $ P.parseModulesFromFiles id [(filename, content)]
51−
52−-- |
53−-- Load all modules.
54−--
55−loadAllModules :: [FilePath] -> IO (Either P.MultipleErrors [(FilePath, P.Module)])
56−loadAllModules files = do
57− filesAndContent <- forM files $ \filename -> do
58− content <- readUTF8File filename
59− return (filename, content)
60− return $ P.parseModulesFromFiles id filesAndContent
61−
62−
63−-- |
64−-- Makes a volatile module to execute the current expression.
65−--
66−createTemporaryModule :: Bool -> PSCiState -> P.Expr -> P.Module
67−createTemporaryModule exec PSCiState{psciImportedModules = imports, psciLetBindings = lets} val =
68− let
69− moduleName = P.ModuleName [P.ProperName "$PSCI"]
70− trace = P.Var (P.Qualified (Just supportModuleName) (P.Ident "eval"))
71− mainValue = P.App trace (P.Var (P.Qualified Nothing (P.Ident "it")))
72− itDecl = P.ValueDeclaration (P.Ident "it") P.Public [] $ Right val
73− mainDecl = P.ValueDeclaration (P.Ident "$main") P.Public [] $ Right mainValue
74− decls = if exec then [itDecl, mainDecl] else [itDecl]
75− in
76− P.Module (P.internalModuleSourceSpan "<internal>") [] moduleName ((importDecl `map` imports) ++ lets ++ decls) Nothing
77−
78−
79−-- |
80−-- Makes a volatile module to hold a non-qualified type synonym for a fully-qualified data type declaration.
81−--
82−createTemporaryModuleForKind :: PSCiState -> P.Type -> P.Module
83−createTemporaryModuleForKind PSCiState{psciImportedModules = imports, psciLetBindings = lets} typ =
84− let
85− moduleName = P.ModuleName [P.ProperName "$PSCI"]
86− itDecl = P.TypeSynonymDeclaration (P.ProperName "IT") [] typ
87− in
88− P.Module (P.internalModuleSourceSpan "<internal>") [] moduleName ((importDecl `map` imports) ++ lets ++ [itDecl]) Nothing
89−
90−-- |
91−-- Makes a volatile module to execute the current imports.
92−--
93−createTemporaryModuleForImports :: PSCiState -> P.Module
94−createTemporaryModuleForImports PSCiState{psciImportedModules = imports} =
95− let
96− moduleName = P.ModuleName [P.ProperName "$PSCI"]
97− in
98− P.Module (P.internalModuleSourceSpan "<internal>") [] moduleName (importDecl `map` imports) Nothing
99−
100−importDecl :: ImportedModule -> P.Declaration
101−importDecl (mn, declType, asQ) = P.ImportDeclaration mn declType asQ
102−
103−indexFile :: FilePath
104−indexFile = ".psci_modules" ++ pathSeparator : "index.js"
105−
106−modulesDir :: FilePath
107−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−378
@@ -1,378 +0,0 @@
1−name: purescript
2−version: 0.8.5.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.10.3
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/package.json
28− , tests/support/bower.json
29− , tests/support/setup-win.cmd
30− , tests/support/psci/*.purs
31− , tests/support/pscide/src/*.purs
32− , tests/support/pscide/src/*.js
33− , tests/support/pscide/src/*.fail
34− , stack.yaml
35− , stack-lts-5.yaml
36− , stack-nightly.yaml
37− , README.md
38− , INSTALL.md
39− , CONTRIBUTORS.md
40− , CONTRIBUTING.md
41−
42−source-repository head
43− type: git
44− location: https://github.com/purescript/purescript.git
45−
46−library
47− build-depends: base >=4.8 && <5,
48− base-compat >=0.6.0,
49− lifted-base >= 0.2.3 && < 0.2.4,
50− monad-control >= 1.0.0.0 && < 1.1,
51− transformers-base >= 0.4.0 && < 0.5,
52− containers -any,
53− unordered-containers -any,
54− dlist -any,
55− directory >= 1.2,
56− filepath -any,
57− mtl >= 2.1.0 && < 2.3.0,
58− parsec -any,
59− transformers >= 0.3.0 && < 0.6,
60− transformers-compat >= 0.3.0,
61− utf8-string >= 1 && < 2,
62− pattern-arrows >= 0.0.2 && < 0.1,
63− time -any,
64− boxes >= 0.1.4 && < 0.2.0,
65− aeson >= 0.8 && < 0.12,
66− vector -any,
67− bower-json >= 0.8,
68− aeson-better-errors >= 0.8,
69− bytestring -any,
70− text -any,
71− split -any,
72− language-javascript == 0.6.*,
73− syb -any,
74− Glob >= 0.7 && < 0.8,
75− process >= 1.2.0 && < 1.5,
76− safe >= 0.3.9 && < 0.4,
77− semigroups >= 0.16.2 && < 0.19,
78− parallel >= 3.2 && < 3.3,
79− sourcemap >= 0.1.6,
80− stm >= 0.2.4.0,
81− regex-tdfa -any,
82− edit-distance -any,
83− fsnotify >= 0.2.1,
84− monad-logger >= 0.3 && < 0.4,
85− pipes >= 4.0.0 && < 4.2.0 ,
86− pipes-http -any,
87− http-types -any,
88− spdx == 0.2.*
89−
90− exposed-modules: Language.PureScript
91− Language.PureScript.AST
92− Language.PureScript.AST.Binders
93− Language.PureScript.AST.Declarations
94− Language.PureScript.AST.Operators
95− Language.PureScript.AST.Literals
96− Language.PureScript.AST.SourcePos
97− Language.PureScript.AST.Traversals
98− Language.PureScript.AST.Exported
99− Language.PureScript.Bundle
100− Language.PureScript.Crash
101− Language.PureScript.Externs
102− Language.PureScript.CodeGen
103− Language.PureScript.CodeGen.JS
104− Language.PureScript.CodeGen.JS.AST
105− Language.PureScript.CodeGen.JS.Common
106− Language.PureScript.CodeGen.JS.Optimizer
107− Language.PureScript.CodeGen.JS.Optimizer.Blocks
108− Language.PureScript.CodeGen.JS.Optimizer.Common
109− Language.PureScript.CodeGen.JS.Optimizer.Inliner
110− Language.PureScript.CodeGen.JS.Optimizer.MagicDo
111− Language.PureScript.CodeGen.JS.Optimizer.TCO
112− Language.PureScript.CodeGen.JS.Optimizer.Unused
113− Language.PureScript.Constants
114− Language.PureScript.CoreFn
115− Language.PureScript.CoreFn.Ann
116− Language.PureScript.CoreFn.Binders
117− Language.PureScript.CoreFn.Desugar
118− Language.PureScript.CoreFn.Expr
119− Language.PureScript.CoreFn.Meta
120− Language.PureScript.CoreFn.Module
121− Language.PureScript.CoreFn.Traversals
122− Language.PureScript.Comments
123− Language.PureScript.Environment
124− Language.PureScript.Errors
125− Language.PureScript.Errors.JSON
126− Language.PureScript.Kinds
127− Language.PureScript.Linter
128− Language.PureScript.Linter.Exhaustive
129− Language.PureScript.Linter.Imports
130− Language.PureScript.Make
131− Language.PureScript.ModuleDependencies
132− Language.PureScript.Names
133− Language.PureScript.Options
134− Language.PureScript.Parser
135− Language.PureScript.Parser.Lexer
136− Language.PureScript.Parser.Common
137− Language.PureScript.Parser.Declarations
138− Language.PureScript.Parser.JS
139− Language.PureScript.Parser.Kinds
140− Language.PureScript.Parser.State
141− Language.PureScript.Parser.Types
142− Language.PureScript.Pretty
143− Language.PureScript.Pretty.Common
144− Language.PureScript.Pretty.JS
145− Language.PureScript.Pretty.Kinds
146− Language.PureScript.Pretty.Types
147− Language.PureScript.Pretty.Values
148− Language.PureScript.Renamer
149− Language.PureScript.Sugar
150− Language.PureScript.Sugar.BindingGroups
151− Language.PureScript.Sugar.CaseDeclarations
152− Language.PureScript.Sugar.DoNotation
153− Language.PureScript.Sugar.Names
154− Language.PureScript.Sugar.Names.Env
155− Language.PureScript.Sugar.Names.Imports
156− Language.PureScript.Sugar.Names.Exports
157− Language.PureScript.Sugar.ObjectWildcards
158− Language.PureScript.Sugar.Operators
159− Language.PureScript.Sugar.Operators.Common
160− Language.PureScript.Sugar.Operators.Expr
161− Language.PureScript.Sugar.Operators.Binders
162− Language.PureScript.Sugar.Operators.Types
163− Language.PureScript.Sugar.TypeClasses
164− Language.PureScript.Sugar.TypeClasses.Deriving
165− Language.PureScript.Sugar.TypeDeclarations
166− Language.PureScript.Traversals
167− Language.PureScript.TypeChecker
168− Language.PureScript.TypeChecker.Entailment
169− Language.PureScript.TypeChecker.Kinds
170− Language.PureScript.TypeChecker.Monad
171− Language.PureScript.TypeChecker.Rows
172− Language.PureScript.TypeChecker.Skolems
173− Language.PureScript.TypeChecker.Subsumption
174− Language.PureScript.TypeChecker.Synonyms
175− Language.PureScript.TypeChecker.Types
176− Language.PureScript.TypeChecker.Unify
177− Language.PureScript.TypeClassDictionaries
178− Language.PureScript.Types
179−
180− Language.PureScript.Docs
181− Language.PureScript.Docs.Convert
182− Language.PureScript.Docs.Convert.Single
183− Language.PureScript.Docs.Convert.ReExports
184− Language.PureScript.Docs.Render
185− Language.PureScript.Docs.Types
186− Language.PureScript.Docs.RenderedCode
187− Language.PureScript.Docs.RenderedCode.Types
188− Language.PureScript.Docs.RenderedCode.Render
189− Language.PureScript.Docs.AsMarkdown
190− Language.PureScript.Docs.ParseAndBookmark
191− Language.PureScript.Docs.Utils.MonoidExtras
192−
193− Language.PureScript.Publish
194− Language.PureScript.Publish.Utils
195− Language.PureScript.Publish.ErrorsWarnings
196− Language.PureScript.Publish.BoxesHelpers
197−
198− Language.PureScript.Ide
199− Language.PureScript.Ide.Command
200− Language.PureScript.Ide.Externs
201− Language.PureScript.Ide.Error
202− Language.PureScript.Ide.Pursuit
203− Language.PureScript.Ide.Completion
204− Language.PureScript.Ide.Matcher
205− Language.PureScript.Ide.Filter
206− Language.PureScript.Ide.Types
207− Language.PureScript.Ide.State
208− Language.PureScript.Ide.CaseSplit
209− Language.PureScript.Ide.SourceFile
210− Language.PureScript.Ide.Watcher
211− Language.PureScript.Ide.Reexports
212− Language.PureScript.Ide.Imports
213− Language.PureScript.Ide.Util
214− Language.PureScript.Ide.Rebuild
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.12.1, 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: 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.12.1, 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.12.1, 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.12.1,
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.12.1,
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: Paths_purescript
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.12.1
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: Paths_purescript
337− other-extensions:
338− build-depends: base >=4 && <5
339− , mtl -any
340− , text -any
341− , optparse-applicative >= 0.12.1
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− vector -any, utf8-string -any
355− ghc-options: -Wall
356− type: exitcode-stdio-1.0
357− main-is: Main.hs
358− other-modules: TestUtils
359− TestCompiler
360− TestDocs
361− TestPscPublish
362− TestPsci
363− TestPscIde
364− PscIdeSpec
365− Language.PureScript.Ide.FilterSpec
366− Language.PureScript.Ide.ImportsSpec
367− Language.PureScript.Ide.Imports.IntegrationSpec
368− Language.PureScript.Ide.Integration
369− Language.PureScript.Ide.MatcherSpec
370− Language.PureScript.Ide.RebuildSpec
371− Language.PureScript.Ide.ReexportsSpec
372− Language.PureScript.IdeSpec
373− PSCi.Completion
374− PSCi.Directive
375− PSCi.Module
376− PSCi.Types
377− buildable: True
378− 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 = fmap (('$' :) . 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−14
@@ -1,14 +0,0 @@
1−-- |
2−-- The initial PureScript AST
3−--
4−module Language.PureScript.AST (
5− module AST
6−) where
7−
8−import Language.PureScript.AST.Binders as AST
9−import Language.PureScript.AST.Declarations as AST
10−import Language.PureScript.AST.Exported as AST
11−import Language.PureScript.AST.Literals as AST
12−import Language.PureScript.AST.Operators as AST
13−import Language.PureScript.AST.SourcePos as AST
14−import Language.PureScript.AST.Traversals as AST
src/Language/PureScript/AST/Binders.hsdeleted−81
@@ -1,81 +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.AST.Literals
8−import Language.PureScript.Names
9−import Language.PureScript.Comments
10−import Language.PureScript.Types
11−
12−-- |
13−-- Data type for binders
14−--
15−data Binder
16− -- |
17− -- Wildcard binder
18− --
19− = NullBinder
20− -- |
21− -- A binder which matches a literal
22− --
23− | LiteralBinder (Literal Binder)
24− -- |
25− -- A binder which binds an identifier
26− --
27− | VarBinder Ident
28− -- |
29− -- A binder which matches a data constructor
30− --
31− | ConstructorBinder (Qualified (ProperName 'ConstructorName)) [Binder]
32− -- |
33− -- A operator alias binder. During the rebracketing phase of desugaring,
34− -- this data constructor will be removed.
35− --
36− | OpBinder (Qualified Ident)
37− -- |
38− -- Binary operator application. During the rebracketing phase of desugaring,
39− -- this data constructor will be removed.
40− --
41− | BinaryNoParensBinder Binder Binder Binder
42− -- |
43− -- Explicit parentheses. During the rebracketing phase of desugaring, this
44− -- data constructor will be removed.
45− --
46− -- Note: although it seems this constructor is not used, it _is_ useful,
47− -- since it prevents certain traversals from matching.
48− --
49− | ParensInBinder Binder
50− -- |
51− -- A binder which binds its input to an identifier
52− --
53− | NamedBinder Ident Binder
54− -- |
55− -- A binder with source position information
56− --
57− | PositionedBinder SourceSpan [Comment] Binder
58− -- |
59− -- A binder with a type annotation
60− --
61− | TypedBinder Type Binder
62− deriving (Show, Read, Eq)
63−
64−-- |
65−-- Collect all names introduced in binders in an expression
66−--
67−binderNames :: Binder -> [Ident]
68−binderNames = go []
69− where
70− go ns (LiteralBinder b) = lit ns b
71− go ns (VarBinder name) = name : ns
72− go ns (ConstructorBinder _ bs) = foldl go ns bs
73− go ns (BinaryNoParensBinder b1 b2 b3) = foldl go ns [b1, b2, b3]
74− go ns (ParensInBinder b) = go ns b
75− go ns (NamedBinder name b) = go (name : ns) b
76− go ns (PositionedBinder _ _ b) = go ns b
77− go ns (TypedBinder _ b) = go ns b
78− go ns _ = ns
79− lit ns (ObjectLiteral bs) = foldl go ns (map snd bs)
80− lit ns (ArrayLiteral bs) = foldl go ns bs
81− lit ns _ = ns
src/Language/PureScript/AST/Declarations.hsdeleted−485
@@ -1,485 +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.Literals
23−import Language.PureScript.AST.Operators
24−import Language.PureScript.AST.SourcePos
25−import Language.PureScript.Types
26−import Language.PureScript.Names
27−import Language.PureScript.Kinds
28−import Language.PureScript.TypeClassDictionaries
29−import Language.PureScript.Comments
30−import Language.PureScript.Environment
31−
32−-- |
33−-- A module declaration, consisting of comments about the module, a module name,
34−-- a list of declarations, and a list of the declarations that are
35−-- explicitly exported. If the export list is Nothing, everything is exported.
36−--
37−data Module = Module SourceSpan [Comment] ModuleName [Declaration] (Maybe [DeclarationRef])
38− deriving (Show, Read)
39−
40−-- | Return a module's name.
41−getModuleName :: Module -> ModuleName
42−getModuleName (Module _ _ name _ _) = name
43−
44−-- |
45−-- Add an import declaration for a module if it does not already explicitly import it.
46−--
47−addDefaultImport :: ModuleName -> Module -> Module
48−addDefaultImport toImport m@(Module ss coms mn decls exps) =
49− if isExistingImport `any` decls || mn == toImport then m
50− else Module ss coms mn (ImportDeclaration toImport Implicit Nothing : decls) exps
51− where
52− isExistingImport (ImportDeclaration mn' _ _) | mn' == toImport = True
53− isExistingImport (PositionedDeclaration _ _ d) = isExistingImport d
54− isExistingImport _ = False
55−
56−-- |
57−-- An item in a list of explicit imports or exports
58−--
59−data DeclarationRef
60− -- |
61− -- A type constructor with data constructors
62− --
63− = TypeRef (ProperName 'TypeName) (Maybe [ProperName 'ConstructorName])
64− -- |
65− -- A type operator
66− --
67− | TypeOpRef Ident
68− -- |
69− -- A value
70− --
71− | ValueRef Ident
72− -- |
73− -- A type class
74− --
75− | TypeClassRef (ProperName 'ClassName)
76− -- |
77− -- A type class instance, created during typeclass desugaring (name, class name, instance types)
78− --
79− | TypeInstanceRef Ident
80− -- |
81− -- A module, in its entirety
82− --
83− | ModuleRef ModuleName
84− -- |
85− -- An unspecified ProperName ref. This will be replaced with a TypeClassRef
86− -- or TypeRef during name desugaring.
87− | ProperRef String
88− -- |
89− -- A declaration reference with source position information
90− --
91− | PositionedDeclarationRef SourceSpan [Comment] DeclarationRef
92− deriving (Show, Read)
93−
94−instance Eq DeclarationRef where
95− (TypeRef name dctors) == (TypeRef name' dctors') = name == name' && dctors == dctors'
96− (TypeOpRef name) == (TypeOpRef name') = name == name'
97− (ValueRef name) == (ValueRef name') = name == name'
98− (TypeClassRef name) == (TypeClassRef name') = name == name'
99− (TypeInstanceRef name) == (TypeInstanceRef name') = name == name'
100− (ModuleRef name) == (ModuleRef name') = name == name'
101− (ProperRef name) == (ProperRef name') = name == name'
102− (PositionedDeclarationRef _ _ r) == r' = r == r'
103− r == (PositionedDeclarationRef _ _ r') = r == r'
104− _ == _ = False
105−
106−isModuleRef :: DeclarationRef -> Bool
107−isModuleRef (PositionedDeclarationRef _ _ r) = isModuleRef r
108−isModuleRef (ModuleRef _) = True
109−isModuleRef _ = False
110−
111−-- |
112−-- Finds duplicate values in a list of declaration refs. The returned values
113−-- are the duplicate refs with data constructors elided, and then a separate
114−-- list of duplicate data constructors.
115−--
116−findDuplicateRefs :: [DeclarationRef] -> ([DeclarationRef], [ProperName 'ConstructorName])
117−findDuplicateRefs refs =
118− let positionless = stripPosInfo `map` refs
119− simplified = simplifyTypeRefs `map` positionless
120− dupeRefs = nub $ simplified \\ nub simplified
121− dupeCtors = concat $ flip mapMaybe positionless $ \case
122− TypeRef _ (Just dctors) ->
123− let dupes = dctors \\ nub dctors
124− in if null dupes then Nothing else Just dupes
125− _ -> Nothing
126− in (dupeRefs, dupeCtors)
127− where
128− stripPosInfo (PositionedDeclarationRef _ _ ref) = stripPosInfo ref
129− stripPosInfo other = other
130− simplifyTypeRefs (TypeRef pn _) = TypeRef pn Nothing
131− simplifyTypeRefs other = other
132−
133−-- |
134−-- The data type which specifies type of import declaration
135−--
136−data ImportDeclarationType
137− -- |
138− -- An import with no explicit list: `import M`.
139− --
140− = Implicit
141− -- |
142− -- An import with an explicit list of references to import: `import M (foo)`
143− --
144− | Explicit [DeclarationRef]
145− -- |
146− -- An import with a list of references to hide: `import M hiding (foo)`
147− --
148− | Hiding [DeclarationRef]
149− deriving (Eq, Show, Read)
150−
151−isImplicit :: ImportDeclarationType -> Bool
152−isImplicit Implicit = True
153−isImplicit _ = False
154−
155−isExplicit :: ImportDeclarationType -> Bool
156−isExplicit (Explicit _) = True
157−isExplicit _ = False
158−
159−-- |
160−-- The data type of declarations
161−--
162−data Declaration
163− -- |
164− -- A data type declaration (data or newtype, name, arguments, data constructors)
165− --
166− = DataDeclaration DataDeclType (ProperName 'TypeName) [(String, Maybe Kind)] [(ProperName 'ConstructorName, [Type])]
167− -- |
168− -- A minimal mutually recursive set of data type declarations
169− --
170− | DataBindingGroupDeclaration [Declaration]
171− -- |
172− -- A type synonym declaration (name, arguments, type)
173− --
174− | TypeSynonymDeclaration (ProperName 'TypeName) [(String, Maybe Kind)] Type
175− -- |
176− -- A type declaration for a value (name, ty)
177− --
178− | TypeDeclaration Ident Type
179− -- |
180− -- A value declaration (name, top-level binders, optional guard, value)
181− --
182− | ValueDeclaration Ident NameKind [Binder] (Either [(Guard, Expr)] Expr)
183− -- |
184− -- A minimal mutually recursive set of value declarations
185− --
186− | BindingGroupDeclaration [(Ident, NameKind, Expr)]
187− -- |
188− -- A foreign import declaration (name, type)
189− --
190− | ExternDeclaration Ident Type
191− -- |
192− -- A data type foreign import (name, kind)
193− --
194− | ExternDataDeclaration (ProperName 'TypeName) Kind
195− -- |
196− -- A fixity declaration (fixity data, operator name, value the operator is an alias for)
197− --
198− | FixityDeclaration Fixity String (Maybe (Qualified FixityAlias))
199− -- |
200− -- A module import (module name, qualified/unqualified/hiding, optional "qualified as" name)
201− --
202− | ImportDeclaration ModuleName ImportDeclarationType (Maybe ModuleName)
203− -- |
204− -- A type class declaration (name, argument, implies, member declarations)
205− --
206− | TypeClassDeclaration (ProperName 'ClassName) [(String, Maybe Kind)] [Constraint] [Declaration]
207− -- |
208− -- A type instance declaration (name, dependencies, class name, instance types, member
209− -- declarations)
210− --
211− | TypeInstanceDeclaration Ident [Constraint] (Qualified (ProperName 'ClassName)) [Type] TypeInstanceBody
212− -- |
213− -- A declaration with source position information
214− --
215− | PositionedDeclaration SourceSpan [Comment] Declaration
216− deriving (Show, Read)
217−
218−data FixityAlias
219− = AliasValue Ident
220− | AliasConstructor (ProperName 'ConstructorName)
221− | AliasType (ProperName 'TypeName)
222− deriving (Eq, Ord, Show, Read)
223−
224−foldFixityAlias
225− :: (Ident -> a)
226− -> (ProperName 'ConstructorName -> a)
227− -> (ProperName 'TypeName -> a)
228− -> FixityAlias
229− -> a
230−foldFixityAlias f _ _ (AliasValue name) = f name
231−foldFixityAlias _ g _ (AliasConstructor name) = g name
232−foldFixityAlias _ _ h (AliasType name) = h name
233−
234−getValueAlias :: FixityAlias -> Maybe (Either Ident (ProperName 'ConstructorName))
235−getValueAlias (AliasValue name) = Just $ Left name
236−getValueAlias (AliasConstructor name) = Just $ Right name
237−getValueAlias _ = Nothing
238−
239−getTypeAlias :: FixityAlias -> Maybe (ProperName 'TypeName)
240−getTypeAlias (AliasType name) = Just name
241−getTypeAlias _ = Nothing
242−
243−-- | The members of a type class instance declaration
244−data TypeInstanceBody
245− -- | This is a derived instance
246− = DerivedInstance
247− -- | This is a regular (explicit) instance
248− | ExplicitInstance [Declaration]
249− deriving (Show, Read)
250−
251−mapTypeInstanceBody :: ([Declaration] -> [Declaration]) -> TypeInstanceBody -> TypeInstanceBody
252−mapTypeInstanceBody f = runIdentity . traverseTypeInstanceBody (Identity . f)
253−
254−-- | A traversal for TypeInstanceBody
255−traverseTypeInstanceBody :: (Applicative f) => ([Declaration] -> f [Declaration]) -> TypeInstanceBody -> f TypeInstanceBody
256−traverseTypeInstanceBody _ DerivedInstance = pure DerivedInstance
257−traverseTypeInstanceBody f (ExplicitInstance ds) = ExplicitInstance <$> f ds
258−
259−-- |
260−-- Test if a declaration is a value declaration
261−--
262−isValueDecl :: Declaration -> Bool
263−isValueDecl ValueDeclaration{} = True
264−isValueDecl (PositionedDeclaration _ _ d) = isValueDecl d
265−isValueDecl _ = False
266−
267−-- |
268−-- Test if a declaration is a data type or type synonym declaration
269−--
270−isDataDecl :: Declaration -> Bool
271−isDataDecl DataDeclaration{} = True
272−isDataDecl TypeSynonymDeclaration{} = True
273−isDataDecl (PositionedDeclaration _ _ d) = isDataDecl d
274−isDataDecl _ = False
275−
276−-- |
277−-- Test if a declaration is a module import
278−--
279−isImportDecl :: Declaration -> Bool
280−isImportDecl ImportDeclaration{} = True
281−isImportDecl (PositionedDeclaration _ _ d) = isImportDecl d
282−isImportDecl _ = False
283−
284−-- |
285−-- Test if a declaration is a data type foreign import
286−--
287−isExternDataDecl :: Declaration -> Bool
288−isExternDataDecl ExternDataDeclaration{} = True
289−isExternDataDecl (PositionedDeclaration _ _ d) = isExternDataDecl d
290−isExternDataDecl _ = False
291−
292−-- |
293−-- Test if a declaration is a fixity declaration
294−--
295−isFixityDecl :: Declaration -> Bool
296−isFixityDecl FixityDeclaration{} = True
297−isFixityDecl (PositionedDeclaration _ _ d) = isFixityDecl d
298−isFixityDecl _ = False
299−
300−-- |
301−-- Test if a declaration is a foreign import
302−--
303−isExternDecl :: Declaration -> Bool
304−isExternDecl ExternDeclaration{} = True
305−isExternDecl (PositionedDeclaration _ _ d) = isExternDecl d
306−isExternDecl _ = False
307−
308−-- |
309−-- Test if a declaration is a type class instance declaration
310−--
311−isTypeClassInstanceDeclaration :: Declaration -> Bool
312−isTypeClassInstanceDeclaration TypeInstanceDeclaration{} = True
313−isTypeClassInstanceDeclaration (PositionedDeclaration _ _ d) = isTypeClassInstanceDeclaration d
314−isTypeClassInstanceDeclaration _ = False
315−
316−-- |
317−-- Test if a declaration is a type class declaration
318−--
319−isTypeClassDeclaration :: Declaration -> Bool
320−isTypeClassDeclaration TypeClassDeclaration{} = True
321−isTypeClassDeclaration (PositionedDeclaration _ _ d) = isTypeClassDeclaration d
322−isTypeClassDeclaration _ = False
323−
324−-- |
325−-- Recursively flatten data binding groups in the list of declarations
326−flattenDecls :: [Declaration] -> [Declaration]
327−flattenDecls = concatMap flattenOne
328− where flattenOne :: Declaration -> [Declaration]
329− flattenOne (DataBindingGroupDeclaration decls) = concatMap flattenOne decls
330− flattenOne d = [d]
331−
332−-- |
333−-- A guard is just a boolean-valued expression that appears alongside a set of binders
334−--
335−type Guard = Expr
336−
337−-- |
338−-- Data type for expressions and terms
339−--
340−data Expr
341− -- |
342− -- A literal value
343− --
344− = Literal (Literal Expr)
345− -- |
346− -- A prefix -, will be desugared
347− --
348− | UnaryMinus Expr
349− -- |
350− -- Binary operator application. During the rebracketing phase of desugaring, this data constructor
351− -- will be removed.
352− --
353− | BinaryNoParens Expr Expr Expr
354− -- |
355− -- Explicit parentheses. During the rebracketing phase of desugaring, this data constructor
356− -- will be removed.
357− --
358− -- Note: although it seems this constructor is not used, it _is_ useful, since it prevents
359− -- certain traversals from matching.
360− --
361− | Parens Expr
362− -- |
363− -- An object property getter (e.g. `_.x`). This will be removed during
364− -- desugaring and expanded into a lambda that reads a property from an object.
365− --
366− | ObjectGetter String
367− -- |
368− -- An record property accessor expression
369− --
370− | Accessor String Expr
371− -- |
372− -- Partial record update
373− --
374− | ObjectUpdate Expr [(String, Expr)]
375− -- |
376− -- Function introduction
377− --
378− | Abs (Either Ident Binder) Expr
379− -- |
380− -- Function application
381− --
382− | App Expr Expr
383− -- |
384− -- Variable
385− --
386− | Var (Qualified Ident)
387− -- |
388− -- Conditional (if-then-else expression)
389− --
390− | IfThenElse Expr Expr Expr
391− -- |
392− -- A data constructor
393− --
394− | Constructor (Qualified (ProperName 'ConstructorName))
395− -- |
396− -- A case expression. During the case expansion phase of desugaring, top-level binders will get
397− -- desugared into case expressions, hence the need for guards and multiple binders per branch here.
398− --
399− | Case [Expr] [CaseAlternative]
400− -- |
401− -- A value with a type annotation
402− --
403− | TypedValue Bool Expr Type
404− -- |
405− -- A let binding
406− --
407− | Let [Declaration] Expr
408− -- |
409− -- A do-notation block
410− --
411− | Do [DoNotationElement]
412− -- |
413− -- An application of a typeclass dictionary constructor. The value should be
414− -- an ObjectLiteral.
415− --
416− | TypeClassDictionaryConstructorApp (Qualified (ProperName 'ClassName)) Expr
417− -- |
418− -- A placeholder for a type class dictionary to be inserted later. At the end of type checking, these
419− -- placeholders will be replaced with actual expressions representing type classes dictionaries which
420− -- can be evaluated at runtime. The constructor arguments represent (in order): whether or not to look
421− -- at superclass implementations when searching for a dictionary, the type class name and
422− -- instance type, and the type class dictionaries in scope.
423− --
424− | TypeClassDictionary Constraint (M.Map (Maybe ModuleName) (M.Map (Qualified (ProperName 'ClassName)) (M.Map (Qualified Ident) TypeClassDictionaryInScope)))
425− -- |
426− -- A typeclass dictionary accessor, the implementation is left unspecified until CoreFn desugaring.
427− --
428− | TypeClassDictionaryAccessor (Qualified (ProperName 'ClassName)) Ident
429− -- |
430− -- A placeholder for a superclass dictionary to be turned into a TypeClassDictionary during typechecking
431− --
432− | SuperClassDictionary (Qualified (ProperName 'ClassName)) [Type]
433− -- |
434− -- A placeholder for an anonymous function argument
435− --
436− | AnonymousArgument
437− -- |
438− -- A typed hole that will be turned into a hint/error duing typechecking
439− --
440− | Hole String
441− -- |
442− -- A value with source position information
443− --
444− | PositionedValue SourceSpan [Comment] Expr
445− deriving (Show, Read)
446−
447−-- |
448−-- An alternative in a case statement
449−--
450−data CaseAlternative = CaseAlternative
451− { -- |
452− -- A collection of binders with which to match the inputs
453− --
454− caseAlternativeBinders :: [Binder]
455− -- |
456− -- The result expression or a collect of guarded expressions
457− --
458− , caseAlternativeResult :: Either [(Guard, Expr)] Expr
459− } deriving (Show, Read)
460−
461−-- |
462−-- A statement in a do-notation block
463−--
464−data DoNotationElement
465− -- |
466− -- A monadic value without a binder
467− --
468− = DoNotationValue Expr
469− -- |
470− -- A monadic value with a binder
471− --
472− | DoNotationBind Binder Expr
473− -- |
474− -- A let statement, i.e. a pure value with a binder
475− --
476− | DoNotationLet [Declaration]
477− -- |
478− -- A do notation element with source position information
479− --
480− | PositionedDoNotationElement SourceSpan [Comment] DoNotationElement
481− deriving (Show, Read)
482−
483−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''DeclarationRef)
484−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''ImportDeclarationType)
485−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''FixityAlias)
src/Language/PureScript/AST/Exported.hsdeleted−157
@@ -1,157 +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 (DataDeclaration _ ident _ _) (TypeRef ident' _) = ident == ident'
131− matches (ExternDataDeclaration ident _) (TypeRef ident' _) = ident == ident'
132− matches (TypeSynonymDeclaration ident _ _) (TypeRef ident' _) = ident == ident'
133− matches (TypeClassDeclaration ident _ _ _) (TypeClassRef ident') = ident == ident'
134−
135− matches (DataDeclaration _ ident _ _) (ProperRef ident') = runProperName ident == ident'
136− matches (TypeClassDeclaration ident _ _ _) (ProperRef ident') = runProperName ident == ident'
137−
138− matches (FixityDeclaration _ name (Just (Qualified _ (AliasValue _)))) (ValueRef ident') = name == runIdent ident'
139− matches (FixityDeclaration _ name (Just (Qualified _ (AliasConstructor _)))) (ValueRef ident') = name == runIdent ident'
140− matches (FixityDeclaration _ name (Just (Qualified _ (AliasType _)))) (TypeOpRef ident') = name == runIdent ident'
141−
142− matches (PositionedDeclaration _ _ d) r = d `matches` r
143− matches d (PositionedDeclarationRef _ _ r) = d `matches` r
144− matches _ _ = False
145−
146−-- |
147−-- Test if a data constructor for a given type is exported, given a module's
148−-- export list. Prefer 'exportedDeclarations' to this function, where possible.
149−--
150−isDctorExported :: ProperName 'TypeName -> Maybe [DeclarationRef] -> ProperName 'ConstructorName -> Bool
151−isDctorExported _ Nothing _ = True
152−isDctorExported ident (Just exps) ctor = test `any` exps
153− where
154− test (PositionedDeclarationRef _ _ d) = test d
155− test (TypeRef ident' Nothing) = ident == ident'
156− test (TypeRef ident' (Just ctors)) = ident == ident' && ctor `elem` ctors
157− test _ = False
src/Language/PureScript/AST/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.AST.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 (Eq, Ord, Show, Read, Functor)
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−591
@@ -1,591 +0,0 @@
1−{-# LANGUAGE ScopedTypeVariables #-}
2−
3−-- |
4−-- AST traversal helpers
5−--
6−module Language.PureScript.AST.Traversals where
7−
8−import Prelude ()
9−import Prelude.Compat
10−
11−import Data.Maybe (mapMaybe)
12−import Data.List (mapAccumL)
13−import Data.Foldable (fold)
14−import qualified Data.Set as S
15−
16−import Control.Monad
17−import Control.Arrow ((***), (+++))
18−
19−import Language.PureScript.AST.Binders
20−import Language.PureScript.AST.Literals
21−import Language.PureScript.AST.Declarations
22−import Language.PureScript.Types
23−import Language.PureScript.Traversals
24−import Language.PureScript.Names
25−
26−everywhereOnValues
27− :: (Declaration -> Declaration)
28− -> (Expr -> Expr)
29− -> (Binder -> Binder)
30− -> ( Declaration -> Declaration
31− , Expr -> Expr
32− , Binder -> Binder
33− )
34−everywhereOnValues f g h = (f', g', h')
35− where
36− f' :: Declaration -> Declaration
37− f' (DataBindingGroupDeclaration ds) = f (DataBindingGroupDeclaration (map f' ds))
38− f' (ValueDeclaration name nameKind bs val) = f (ValueDeclaration name nameKind (map h' bs) ((map (g' *** g') +++ g') val))
39− f' (BindingGroupDeclaration ds) = f (BindingGroupDeclaration (map (\(name, nameKind, val) -> (name, nameKind, g' val)) ds))
40− f' (TypeClassDeclaration name args implies ds) = f (TypeClassDeclaration name args implies (map f' ds))
41− f' (TypeInstanceDeclaration name cs className args ds) = f (TypeInstanceDeclaration name cs className args (mapTypeInstanceBody (map f') ds))
42− f' (PositionedDeclaration pos com d) = f (PositionedDeclaration pos com (f' d))
43− f' other = f other
44−
45− g' :: Expr -> Expr
46− g' (Literal l) = g (Literal (lit g' l))
47− g' (UnaryMinus v) = g (UnaryMinus (g' v))
48− g' (BinaryNoParens op v1 v2) = g (BinaryNoParens (g' op) (g' v1) (g' v2))
49− g' (Parens v) = g (Parens (g' v))
50− g' (TypeClassDictionaryConstructorApp name v) = g (TypeClassDictionaryConstructorApp name (g' v))
51− g' (Accessor prop v) = g (Accessor prop (g' v))
52− g' (ObjectUpdate obj vs) = g (ObjectUpdate (g' obj) (map (fmap g') vs))
53− g' (Abs name v) = g (Abs name (g' v))
54− g' (App v1 v2) = g (App (g' v1) (g' v2))
55− g' (IfThenElse v1 v2 v3) = g (IfThenElse (g' v1) (g' v2) (g' v3))
56− g' (Case vs alts) = g (Case (map g' vs) (map handleCaseAlternative alts))
57− g' (TypedValue check v ty) = g (TypedValue check (g' v) ty)
58− g' (Let ds v) = g (Let (map f' ds) (g' v))
59− g' (Do es) = g (Do (map handleDoNotationElement es))
60− g' (PositionedValue pos com v) = g (PositionedValue pos com (g' v))
61− g' other = g other
62−
63− h' :: Binder -> Binder
64− h' (ConstructorBinder ctor bs) = h (ConstructorBinder ctor (map h' bs))
65− h' (BinaryNoParensBinder b1 b2 b3) = h (BinaryNoParensBinder (h' b1) (h' b2) (h' b3))
66− h' (ParensInBinder b) = h (ParensInBinder (h' b))
67− h' (LiteralBinder l) = h (LiteralBinder (lit h' l))
68− h' (NamedBinder name b) = h (NamedBinder name (h' b))
69− h' (PositionedBinder pos com b) = h (PositionedBinder pos com (h' b))
70− h' (TypedBinder t b) = h (TypedBinder t (h' b))
71− h' other = h other
72−
73− lit :: (a -> a) -> Literal a -> Literal a
74− lit go (ArrayLiteral as) = ArrayLiteral (map go as)
75− lit go (ObjectLiteral as) = ObjectLiteral (map (fmap go) as)
76− lit _ other = other
77−
78− handleCaseAlternative :: CaseAlternative -> CaseAlternative
79− handleCaseAlternative ca =
80− ca { caseAlternativeBinders = map h' (caseAlternativeBinders ca)
81− , caseAlternativeResult = (map (g' *** g') +++ g') (caseAlternativeResult ca)
82− }
83−
84− handleDoNotationElement :: DoNotationElement -> DoNotationElement
85− handleDoNotationElement (DoNotationValue v) = DoNotationValue (g' v)
86− handleDoNotationElement (DoNotationBind b v) = DoNotationBind (h' b) (g' v)
87− handleDoNotationElement (DoNotationLet ds) = DoNotationLet (map f' ds)
88− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com (handleDoNotationElement e)
89−
90−everywhereOnValuesTopDownM
91− :: forall m
92− . (Monad m)
93− => (Declaration -> m Declaration)
94− -> (Expr -> m Expr)
95− -> (Binder -> m Binder)
96− -> ( Declaration -> m Declaration
97− , Expr -> m Expr
98− , Binder -> m Binder
99− )
100−everywhereOnValuesTopDownM f g h = (f' <=< f, g' <=< g, h' <=< h)
101− where
102−
103− f' :: Declaration -> m Declaration
104− f' (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> traverse (f' <=< f) ds
105− f' (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> traverse (h' <=< h) bs <*> eitherM (traverse (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
106− f' (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> traverse (\(name, nameKind, val) -> (,,) name nameKind <$> (g val >>= g')) ds
107− f' (TypeClassDeclaration name args implies ds) = TypeClassDeclaration name args implies <$> traverse (f' <=< f) ds
108− f' (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse (f' <=< f)) ds
109− f' (PositionedDeclaration pos com d) = PositionedDeclaration pos com <$> (f d >>= f')
110− f' other = f other
111−
112− g' :: Expr -> m Expr
113− g' (Literal l) = Literal <$> lit (g >=> g') l
114− g' (UnaryMinus v) = UnaryMinus <$> (g v >>= g')
115− g' (BinaryNoParens op v1 v2) = BinaryNoParens <$> (g op >>= g') <*> (g v1 >>= g') <*> (g v2 >>= g')
116− g' (Parens v) = Parens <$> (g v >>= g')
117− g' (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> (g v >>= g')
118− g' (Accessor prop v) = Accessor prop <$> (g v >>= g')
119− g' (ObjectUpdate obj vs) = ObjectUpdate <$> (g obj >>= g') <*> traverse (sndM (g' <=< g)) vs
120− g' (Abs name v) = Abs name <$> (g v >>= g')
121− g' (App v1 v2) = App <$> (g v1 >>= g') <*> (g v2 >>= g')
122− g' (IfThenElse v1 v2 v3) = IfThenElse <$> (g v1 >>= g') <*> (g v2 >>= g') <*> (g v3 >>= g')
123− g' (Case vs alts) = Case <$> traverse (g' <=< g) vs <*> traverse handleCaseAlternative alts
124− g' (TypedValue check v ty) = TypedValue check <$> (g v >>= g') <*> pure ty
125− g' (Let ds v) = Let <$> traverse (f' <=< f) ds <*> (g v >>= g')
126− g' (Do es) = Do <$> traverse handleDoNotationElement es
127− g' (PositionedValue pos com v) = PositionedValue pos com <$> (g v >>= g')
128− g' other = g other
129−
130− h' :: Binder -> m Binder
131− h' (LiteralBinder l) = LiteralBinder <$> lit (h >=> h') l
132− h' (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> traverse (h' <=< h) bs
133− h' (BinaryNoParensBinder b1 b2 b3) = BinaryNoParensBinder <$> (h b1 >>= h') <*> (h b2 >>= h') <*> (h b3 >>= h')
134− h' (ParensInBinder b) = ParensInBinder <$> (h b >>= h')
135− h' (NamedBinder name b) = NamedBinder name <$> (h b >>= h')
136− h' (PositionedBinder pos com b) = PositionedBinder pos com <$> (h b >>= h')
137− h' (TypedBinder t b) = TypedBinder t <$> (h b >>= h')
138− h' other = h other
139−
140− lit :: (a -> m a) -> Literal a -> m (Literal a)
141− lit go (ObjectLiteral as) = ObjectLiteral <$> traverse (sndM go) as
142− lit go (ArrayLiteral as) = ArrayLiteral <$> traverse go as
143− lit _ other = pure other
144−
145− handleCaseAlternative :: CaseAlternative -> m CaseAlternative
146− handleCaseAlternative (CaseAlternative bs val) =
147− CaseAlternative
148− <$> traverse (h' <=< h) bs
149− <*> eitherM (traverse (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
150−
151− handleDoNotationElement :: DoNotationElement -> m DoNotationElement
152− handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> (g' <=< g) v
153− handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> (h' <=< h) b <*> (g' <=< g) v
154− handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> traverse (f' <=< f) ds
155− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
156−
157−everywhereOnValuesM
158− :: forall m
159− . (Monad m)
160− => (Declaration -> m Declaration)
161− -> (Expr -> m Expr)
162− -> (Binder -> m Binder)
163− -> ( Declaration -> m Declaration
164− , Expr -> m Expr
165− , Binder -> m Binder
166− )
167−everywhereOnValuesM f g h = (f', g', h')
168− where
169−
170− f' :: Declaration -> m Declaration
171− f' (DataBindingGroupDeclaration ds) = (DataBindingGroupDeclaration <$> traverse f' ds) >>= f
172− f' (ValueDeclaration name nameKind bs val) = (ValueDeclaration name nameKind <$> traverse h' bs <*> eitherM (traverse (pairM g' g')) g' val) >>= f
173− f' (BindingGroupDeclaration ds) = (BindingGroupDeclaration <$> traverse (\(name, nameKind, val) -> (,,) name nameKind <$> g' val) ds) >>= f
174− f' (TypeClassDeclaration name args implies ds) = (TypeClassDeclaration name args implies <$> traverse f' ds) >>= f
175− f' (TypeInstanceDeclaration name cs className args ds) = (TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse f') ds) >>= f
176− f' (PositionedDeclaration pos com d) = (PositionedDeclaration pos com <$> f' d) >>= f
177− f' other = f other
178−
179− g' :: Expr -> m Expr
180− g' (Literal l) = (Literal <$> lit g' l) >>= g
181− g' (UnaryMinus v) = (UnaryMinus <$> g' v) >>= g
182− g' (BinaryNoParens op v1 v2) = (BinaryNoParens <$> g' op <*> g' v1 <*> g' v2) >>= g
183− g' (Parens v) = (Parens <$> g' v) >>= g
184− g' (TypeClassDictionaryConstructorApp name v) = (TypeClassDictionaryConstructorApp name <$> g' v) >>= g
185− g' (Accessor prop v) = (Accessor prop <$> g' v) >>= g
186− g' (ObjectUpdate obj vs) = (ObjectUpdate <$> g' obj <*> traverse (sndM g') vs) >>= g
187− g' (Abs name v) = (Abs name <$> g' v) >>= g
188− g' (App v1 v2) = (App <$> g' v1 <*> g' v2) >>= g
189− g' (IfThenElse v1 v2 v3) = (IfThenElse <$> g' v1 <*> g' v2 <*> g' v3) >>= g
190− g' (Case vs alts) = (Case <$> traverse g' vs <*> traverse handleCaseAlternative alts) >>= g
191− g' (TypedValue check v ty) = (TypedValue check <$> g' v <*> pure ty) >>= g
192− g' (Let ds v) = (Let <$> traverse f' ds <*> g' v) >>= g
193− g' (Do es) = (Do <$> traverse handleDoNotationElement es) >>= g
194− g' (PositionedValue pos com v) = (PositionedValue pos com <$> g' v) >>= g
195− g' other = g other
196−
197− h' :: Binder -> m Binder
198− h' (LiteralBinder l) = (LiteralBinder <$> lit h' l) >>= h
199− h' (ConstructorBinder ctor bs) = (ConstructorBinder ctor <$> traverse h' bs) >>= h
200− h' (BinaryNoParensBinder b1 b2 b3) = (BinaryNoParensBinder <$> h' b1 <*> h' b2 <*> h' b3) >>= h
201− h' (ParensInBinder b) = (ParensInBinder <$> h' b) >>= h
202− h' (NamedBinder name b) = (NamedBinder name <$> h' b) >>= h
203− h' (PositionedBinder pos com b) = (PositionedBinder pos com <$> h' b) >>= h
204− h' (TypedBinder t b) = (TypedBinder t <$> h' b) >>= h
205− h' other = h other
206−
207− lit :: (a -> m a) -> Literal a -> m (Literal a)
208− lit go (ObjectLiteral as) = ObjectLiteral <$> traverse (sndM go) as
209− lit go (ArrayLiteral as) = ArrayLiteral <$> traverse go as
210− lit _ other = pure other
211−
212− handleCaseAlternative :: CaseAlternative -> m CaseAlternative
213− handleCaseAlternative (CaseAlternative bs val) =
214− CaseAlternative
215− <$> traverse h' bs
216− <*> eitherM (traverse (pairM g' g')) g' val
217−
218− handleDoNotationElement :: DoNotationElement -> m DoNotationElement
219− handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> g' v
220− handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> h' b <*> g' v
221− handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> traverse f' ds
222− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
223−
224−everythingOnValues
225− :: forall r
226− . (r -> r -> r)
227− -> (Declaration -> r)
228− -> (Expr -> r)
229− -> (Binder -> r)
230− -> (CaseAlternative -> r)
231− -> (DoNotationElement -> r)
232− -> ( Declaration -> r
233− , Expr -> r
234− , Binder -> r
235− , CaseAlternative -> r
236− , DoNotationElement -> r
237− )
238−everythingOnValues (<>) f g h i j = (f', g', h', i', j')
239− where
240−
241− f' :: Declaration -> r
242− f' d@(DataBindingGroupDeclaration ds) = foldl (<>) (f d) (map f' ds)
243− f' d@(ValueDeclaration _ _ bs (Right val)) = foldl (<>) (f d) (map h' bs) <> g' val
244− f' d@(ValueDeclaration _ _ bs (Left gs)) = foldl (<>) (f d) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
245− f' d@(BindingGroupDeclaration ds) = foldl (<>) (f d) (map (\(_, _, val) -> g' val) ds)
246− f' d@(TypeClassDeclaration _ _ _ ds) = foldl (<>) (f d) (map f' ds)
247− f' d@(TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldl (<>) (f d) (map f' ds)
248− f' d@(PositionedDeclaration _ _ d1) = f d <> f' d1
249− f' d = f d
250−
251− g' :: Expr -> r
252− g' v@(Literal l) = lit (g v) g' l
253− g' v@(UnaryMinus v1) = g v <> g' v1
254− g' v@(BinaryNoParens op v1 v2) = g v <> g' op <> g' v1 <> g' v2
255− g' v@(Parens v1) = g v <> g' v1
256− g' v@(TypeClassDictionaryConstructorApp _ v1) = g v <> g' v1
257− g' v@(Accessor _ v1) = g v <> g' v1
258− g' v@(ObjectUpdate obj vs) = foldl (<>) (g v <> g' obj) (map (g' . snd) vs)
259− g' v@(Abs _ v1) = g v <> g' v1
260− g' v@(App v1 v2) = g v <> g' v1 <> g' v2
261− g' v@(IfThenElse v1 v2 v3) = g v <> g' v1 <> g' v2 <> g' v3
262− g' v@(Case vs alts) = foldl (<>) (foldl (<>) (g v) (map g' vs)) (map i' alts)
263− g' v@(TypedValue _ v1 _) = g v <> g' v1
264− g' v@(Let ds v1) = foldl (<>) (g v) (map f' ds) <> g' v1
265− g' v@(Do es) = foldl (<>) (g v) (map j' es)
266− g' v@(PositionedValue _ _ v1) = g v <> g' v1
267− g' v = g v
268−
269− h' :: Binder -> r
270− h' b@(LiteralBinder l) = lit (h b) h' l
271− h' b@(ConstructorBinder _ bs) = foldl (<>) (h b) (map h' bs)
272− h' b@(BinaryNoParensBinder b1 b2 b3) = h b <> h' b1 <> h' b2 <> h' b3
273− h' b@(ParensInBinder b1) = h b <> h' b1
274− h' b@(NamedBinder _ b1) = h b <> h' b1
275− h' b@(PositionedBinder _ _ b1) = h b <> h' b1
276− h' b@(TypedBinder _ b1) = h b <> h' b1
277− h' b = h b
278−
279− lit :: r -> (a -> r) -> Literal a -> r
280− lit r go (ArrayLiteral as) = foldl (<>) r (map go as)
281− lit r go (ObjectLiteral as) = foldl (<>) r (map (go . snd) as)
282− lit r _ _ = r
283−
284− i' :: CaseAlternative -> r
285− i' ca@(CaseAlternative bs (Right val)) = foldl (<>) (i ca) (map h' bs) <> g' val
286− i' ca@(CaseAlternative bs (Left gs)) = foldl (<>) (i ca) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
287−
288− j' :: DoNotationElement -> r
289− j' e@(DoNotationValue v) = j e <> g' v
290− j' e@(DoNotationBind b v) = j e <> h' b <> g' v
291− j' e@(DoNotationLet ds) = foldl (<>) (j e) (map f' ds)
292− j' e@(PositionedDoNotationElement _ _ e1) = j e <> j' e1
293−
294−everythingWithContextOnValues
295− :: forall s r
296− . s
297− -> r
298− -> (r -> r -> r)
299− -> (s -> Declaration -> (s, r))
300− -> (s -> Expr -> (s, r))
301− -> (s -> Binder -> (s, r))
302− -> (s -> CaseAlternative -> (s, r))
303− -> (s -> DoNotationElement -> (s, r))
304− -> ( Declaration -> r
305− , Expr -> r
306− , Binder -> r
307− , CaseAlternative -> r
308− , DoNotationElement -> r)
309−everythingWithContextOnValues s0 r0 (<>) f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
310− where
311−
312− f'' :: s -> Declaration -> r
313− f'' s d = let (s', r) = f s d in r <> f' s' d
314−
315− f' :: s -> Declaration -> r
316− f' s (DataBindingGroupDeclaration ds) = foldl (<>) r0 (map (f'' s) ds)
317− f' s (ValueDeclaration _ _ bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
318− f' s (ValueDeclaration _ _ bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
319− f' s (BindingGroupDeclaration ds) = foldl (<>) r0 (map (\(_, _, val) -> g'' s val) ds)
320− f' s (TypeClassDeclaration _ _ _ ds) = foldl (<>) r0 (map (f'' s) ds)
321− f' s (TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldl (<>) r0 (map (f'' s) ds)
322− f' s (PositionedDeclaration _ _ d1) = f'' s d1
323− f' _ _ = r0
324−
325− g'' :: s -> Expr -> r
326− g'' s v = let (s', r) = g s v in r <> g' s' v
327−
328− g' :: s -> Expr -> r
329− g' s (Literal l) = lit g'' s l
330− g' s (UnaryMinus v1) = g'' s v1
331− g' s (BinaryNoParens op v1 v2) = g'' s op <> g'' s v1 <> g'' s v2
332− g' s (Parens v1) = g'' s v1
333− g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
334− g' s (Accessor _ v1) = g'' s v1
335− g' s (ObjectUpdate obj vs) = foldl (<>) (g'' s obj) (map (g'' s . snd) vs)
336− g' s (Abs _ v1) = g'' s v1
337− g' s (App v1 v2) = g'' s v1 <> g'' s v2
338− g' s (IfThenElse v1 v2 v3) = g'' s v1 <> g'' s v2 <> g'' s v3
339− g' s (Case vs alts) = foldl (<>) (foldl (<>) r0 (map (g'' s) vs)) (map (i'' s) alts)
340− g' s (TypedValue _ v1 _) = g'' s v1
341− g' s (Let ds v1) = foldl (<>) r0 (map (f'' s) ds) <> g'' s v1
342− g' s (Do es) = foldl (<>) r0 (map (j'' s) es)
343− g' s (PositionedValue _ _ v1) = g'' s v1
344− g' _ _ = r0
345−
346− h'' :: s -> Binder -> r
347− h'' s b = let (s', r) = h s b in r <> h' s' b
348−
349− h' :: s -> Binder -> r
350− h' s (LiteralBinder l) = lit h'' s l
351− h' s (ConstructorBinder _ bs) = foldl (<>) r0 (map (h'' s) bs)
352− h' s (BinaryNoParensBinder b1 b2 b3) = h'' s b1 <> h'' s b2 <> h'' s b3
353− h' s (ParensInBinder b) = h'' s b
354− h' s (NamedBinder _ b1) = h'' s b1
355− h' s (PositionedBinder _ _ b1) = h'' s b1
356− h' s (TypedBinder _ b1) = h'' s b1
357− h' _ _ = r0
358−
359− lit :: (s -> a -> r) -> s -> Literal a -> r
360− lit go s (ArrayLiteral as) = foldl (<>) r0 (map (go s) as)
361− lit go s (ObjectLiteral as) = foldl (<>) r0 (map (go s . snd) as)
362− lit _ _ _ = r0
363−
364− i'' :: s -> CaseAlternative -> r
365− i'' s ca = let (s', r) = i s ca in r <> i' s' ca
366−
367− i' :: s -> CaseAlternative -> r
368− i' s (CaseAlternative bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
369− i' s (CaseAlternative bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
370−
371− j'' :: s -> DoNotationElement -> r
372− j'' s e = let (s', r) = j s e in r <> j' s' e
373−
374− j' :: s -> DoNotationElement -> r
375− j' s (DoNotationValue v) = g'' s v
376− j' s (DoNotationBind b v) = h'' s b <> g'' s v
377− j' s (DoNotationLet ds) = foldl (<>) r0 (map (f'' s) ds)
378− j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
379−
380−everywhereWithContextOnValuesM
381− :: forall m s
382− . (Monad m)
383− => s
384− -> (s -> Declaration -> m (s, Declaration))
385− -> (s -> Expr -> m (s, Expr))
386− -> (s -> Binder -> m (s, Binder))
387− -> (s -> CaseAlternative -> m (s, CaseAlternative))
388− -> (s -> DoNotationElement -> m (s, DoNotationElement))
389− -> ( Declaration -> m Declaration
390− , Expr -> m Expr
391− , Binder -> m Binder
392− , CaseAlternative -> m CaseAlternative
393− , DoNotationElement -> m DoNotationElement)
394−everywhereWithContextOnValuesM s0 f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
395− where
396− f'' s = uncurry f' <=< f s
397−
398− f' s (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> traverse (f'' s) ds
399− f' s (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> traverse (h'' s) bs <*> eitherM (traverse (pairM (g'' s) (g'' s))) (g'' s) val
400− f' s (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> traverse (thirdM (g'' s)) ds
401− f' s (TypeClassDeclaration name args implies ds) = TypeClassDeclaration name args implies <$> traverse (f'' s) ds
402− f' s (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse (f'' s)) ds
403− f' s (PositionedDeclaration pos com d1) = PositionedDeclaration pos com <$> f'' s d1
404− f' _ other = return other
405−
406− g'' s = uncurry g' <=< g s
407−
408− g' s (Literal l) = Literal <$> lit g'' s l
409− g' s (UnaryMinus v) = UnaryMinus <$> g'' s v
410− g' s (BinaryNoParens op v1 v2) = BinaryNoParens <$> g'' s op <*> g'' s v1 <*> g'' s v2
411− g' s (Parens v) = Parens <$> g'' s v
412− g' s (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> g'' s v
413− g' s (Accessor prop v) = Accessor prop <$> g'' s v
414− g' s (ObjectUpdate obj vs) = ObjectUpdate <$> g'' s obj <*> traverse (sndM (g'' s)) vs
415− g' s (Abs name v) = Abs name <$> g'' s v
416− g' s (App v1 v2) = App <$> g'' s v1 <*> g'' s v2
417− g' s (IfThenElse v1 v2 v3) = IfThenElse <$> g'' s v1 <*> g'' s v2 <*> g'' s v3
418− g' s (Case vs alts) = Case <$> traverse (g'' s) vs <*> traverse (i'' s) alts
419− g' s (TypedValue check v ty) = TypedValue check <$> g'' s v <*> pure ty
420− g' s (Let ds v) = Let <$> traverse (f'' s) ds <*> g'' s v
421− g' s (Do es) = Do <$> traverse (j'' s) es
422− g' s (PositionedValue pos com v) = PositionedValue pos com <$> g'' s v
423− g' _ other = return other
424−
425− h'' s = uncurry h' <=< h s
426−
427− h' s (LiteralBinder l) = LiteralBinder <$> lit h'' s l
428− h' s (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> traverse (h'' s) bs
429− h' s (BinaryNoParensBinder b1 b2 b3) = BinaryNoParensBinder <$> h'' s b1 <*> h'' s b2 <*> h'' s b3
430− h' s (ParensInBinder b) = ParensInBinder <$> h'' s b
431− h' s (NamedBinder name b) = NamedBinder name <$> h'' s b
432− h' s (PositionedBinder pos com b) = PositionedBinder pos com <$> h'' s b
433− h' s (TypedBinder t b) = TypedBinder t <$> h'' s b
434− h' _ other = return other
435−
436− lit :: (s -> a -> m a) -> s -> Literal a -> m (Literal a)
437− lit go s (ArrayLiteral as) = ArrayLiteral <$> traverse (go s) as
438− lit go s (ObjectLiteral as) = ObjectLiteral <$> traverse (sndM (go s)) as
439− lit _ _ other = return other
440−
441− i'' s = uncurry i' <=< i s
442−
443− i' s (CaseAlternative bs val) = CaseAlternative <$> traverse (h'' s) bs <*> eitherM (traverse (pairM (g'' s) (g'' s))) (g'' s) val
444−
445− j'' s = uncurry j' <=< j s
446−
447− j' s (DoNotationValue v) = DoNotationValue <$> g'' s v
448− j' s (DoNotationBind b v) = DoNotationBind <$> h'' s b <*> g'' s v
449− j' s (DoNotationLet ds) = DoNotationLet <$> traverse (f'' s) ds
450− j' s (PositionedDoNotationElement pos com e1) = PositionedDoNotationElement pos com <$> j'' s e1
451−
452−everythingWithScope
453− :: forall r
454− . (Monoid r)
455− => (S.Set Ident -> Declaration -> r)
456− -> (S.Set Ident -> Expr -> r)
457− -> (S.Set Ident -> Binder -> r)
458− -> (S.Set Ident -> CaseAlternative -> r)
459− -> (S.Set Ident -> DoNotationElement -> r)
460− -> ( S.Set Ident -> Declaration -> r
461− , S.Set Ident -> Expr -> r
462− , S.Set Ident -> Binder -> r
463− , S.Set Ident -> CaseAlternative -> r
464− , S.Set Ident -> DoNotationElement -> r
465− )
466−everythingWithScope f g h i j = (f'', g'', h'', i'', \s -> snd . j'' s)
467− where
468− -- Avoid importing Data.Monoid and getting shadowed names above
469− (<>) = mappend
470−
471− f'' :: S.Set Ident -> Declaration -> r
472− f'' s a = f s a <> f' s a
473−
474− f' :: S.Set Ident -> Declaration -> r
475− f' s (DataBindingGroupDeclaration ds) =
476− let s' = S.union s (S.fromList (mapMaybe getDeclIdent ds))
477− in foldMap (f'' s') ds
478− f' s (ValueDeclaration name _ bs (Right val)) =
479− let s' = S.insert name s
480− in foldMap (h'' s') bs <> g'' s' val
481− f' s (ValueDeclaration name _ bs (Left gs)) =
482− let s' = S.insert name s
483− s'' = S.union s' (S.fromList (concatMap binderNames bs))
484− in foldMap (h'' s') bs <> foldMap (\(grd, val) -> g'' s'' grd <> g'' s'' val) gs
485− f' s (BindingGroupDeclaration ds) =
486− let s' = S.union s (S.fromList (map (\(name, _, _) -> name) ds))
487− in foldMap (\(_, _, val) -> g'' s' val) ds
488− f' s (TypeClassDeclaration _ _ _ ds) = foldMap (f'' s) ds
489− f' s (TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldMap (f'' s) ds
490− f' s (PositionedDeclaration _ _ d) = f'' s d
491− f' _ _ = mempty
492−
493− g'' :: S.Set Ident -> Expr -> r
494− g'' s a = g s a <> g' s a
495−
496− g' :: S.Set Ident -> Expr -> r
497− g' s (Literal l) = lit g'' s l
498− g' s (UnaryMinus v1) = g'' s v1
499− g' s (BinaryNoParens op v1 v2) = g'' s op <> g'' s v1 <> g'' s v2
500− g' s (Parens v1) = g'' s v1
501− g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
502− g' s (Accessor _ v1) = g'' s v1
503− g' s (ObjectUpdate obj vs) = g'' s obj <> foldMap (g'' s . snd) vs
504− g' s (Abs (Left name) v1) =
505− let s' = S.insert name s
506− in g'' s' v1
507− g' s (Abs (Right b) v1) =
508− let s' = S.union (S.fromList (binderNames b)) s
509− in g'' s' v1
510− g' s (App v1 v2) = g'' s v1 <> g'' s v2
511− g' s (IfThenElse v1 v2 v3) = g'' s v1 <> g'' s v2 <> g'' s v3
512− g' s (Case vs alts) = foldMap (g'' s) vs <> foldMap (i'' s) alts
513− g' s (TypedValue _ v1 _) = g'' s v1
514− g' s (Let ds v1) =
515− let s' = S.union s (S.fromList (mapMaybe getDeclIdent ds))
516− in foldMap (f'' s') ds <> g'' s' v1
517− g' s (Do es) = fold . snd . mapAccumL j'' s $ es
518− g' s (PositionedValue _ _ v1) = g'' s v1
519− g' _ _ = mempty
520−
521− h'' :: S.Set Ident -> Binder -> r
522− h'' s a = h s a <> h' s a
523−
524− h' :: S.Set Ident -> Binder -> r
525− h' s (LiteralBinder l) = lit h'' s l
526− h' s (ConstructorBinder _ bs) = foldMap (h'' s) bs
527− h' s (BinaryNoParensBinder b1 b2 b3) = foldMap (h'' s) [b1, b2, b3]
528− h' s (ParensInBinder b) = h'' s b
529− h' s (NamedBinder name b1) = h'' (S.insert name s) b1
530− h' s (PositionedBinder _ _ b1) = h'' s b1
531− h' s (TypedBinder _ b1) = h'' s b1
532− h' _ _ = mempty
533−
534− lit :: (S.Set Ident -> a -> r) -> S.Set Ident -> Literal a -> r
535− lit go s (ArrayLiteral as) = foldMap (go s) as
536− lit go s (ObjectLiteral as) = foldMap (go s . snd) as
537− lit _ _ _ = mempty
538−
539− i'' :: S.Set Ident -> CaseAlternative -> r
540− i'' s a = i s a <> i' s a
541−
542− i' :: S.Set Ident -> CaseAlternative -> r
543− i' s (CaseAlternative bs (Right val)) =
544− let s' = S.union s (S.fromList (concatMap binderNames bs))
545− in foldMap (h'' s) bs <> g'' s' val
546− i' s (CaseAlternative bs (Left gs)) =
547− let s' = S.union s (S.fromList (concatMap binderNames bs))
548− in foldMap (h'' s) bs <> foldMap (\(grd, val) -> g'' s' grd <> g'' s' val) gs
549−
550− j'' :: S.Set Ident -> DoNotationElement -> (S.Set Ident, r)
551− j'' s a = let (s', r) = j' s a in (s', j s a <> r)
552−
553− j' :: S.Set Ident -> DoNotationElement -> (S.Set Ident, r)
554− j' s (DoNotationValue v) = (s, g'' s v)
555− j' s (DoNotationBind b v) =
556− let s' = S.union (S.fromList (binderNames b)) s
557− in (s', h'' s b <> g'' s' v)
558− j' s (DoNotationLet ds) =
559− let s' = S.union s (S.fromList (mapMaybe getDeclIdent ds))
560− in (s', foldMap (f'' s') ds)
561− j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
562−
563− getDeclIdent :: Declaration -> Maybe Ident
564− getDeclIdent (PositionedDeclaration _ _ d) = getDeclIdent d
565− getDeclIdent (ValueDeclaration ident _ _ _) = Just ident
566− getDeclIdent (TypeDeclaration ident _) = Just ident
567− getDeclIdent _ = Nothing
568−
569−accumTypes
570− :: (Monoid r)
571− => (Type -> r)
572− -> ( Declaration -> r
573− , Expr -> r
574− , Binder -> r
575− , CaseAlternative -> r
576− , DoNotationElement -> r
577− )
578−accumTypes f = everythingOnValues mappend forDecls forValues (const mempty) (const mempty) (const mempty)
579− where
580− forDecls (DataDeclaration _ _ _ dctors) = mconcat (concatMap (map f . snd) dctors)
581− forDecls (ExternDeclaration _ ty) = f ty
582− forDecls (TypeClassDeclaration _ _ implies _) = mconcat (concatMap (map f . snd) implies)
583− forDecls (TypeInstanceDeclaration _ cs _ tys _) = mconcat (concatMap (map f . snd) cs) `mappend` mconcat (map f tys)
584− forDecls (TypeSynonymDeclaration _ _ ty) = f ty
585− forDecls (TypeDeclaration _ ty) = f ty
586− forDecls _ = mempty
587−
588− forValues (TypeClassDictionary (_, cs) _) = mconcat (map f cs)
589− forValues (SuperClassDictionary _ tys) = mconcat (map f tys)
590− forValues (TypedValue _ _ ty) = f ty
591− forValues _ = mempty
src/Language/PureScript/Bundle.hsdeleted−605
@@ -1,605 +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− , getExportedIdentifiers
31−) where
32−
33−import Prelude ()
34−import Prelude.Compat
35−
36−import Data.List (nub, stripPrefix)
37−import Data.Maybe (mapMaybe, catMaybes)
38−import Data.Generics (everything, everywhere, mkQ, mkT)
39−import Data.Graph
40−import Data.Version (showVersion)
41−
42−import qualified Data.Set as S
43−
44−import Control.Monad
45−import Control.Monad.Error.Class
46−import Language.JavaScript.Parser
47−import Language.JavaScript.Parser.AST
48−
49−import qualified Paths_purescript as Paths
50−
51−-- | The type of error messages. We separate generation and rendering of errors using a data
52−-- type, in case we need to match on error types later.
53−data ErrorMessage
54− = UnsupportedModulePath String
55− | InvalidTopLevel
56− | UnableToParseModule String
57− | UnsupportedExport
58− | ErrorInModule ModuleIdentifier ErrorMessage
59− deriving (Show, Read)
60−
61−-- | Modules are either "regular modules" (i.e. those generated by psc) or foreign modules.
62−data ModuleType
63− = Regular
64− | Foreign
65− deriving (Show, Read, Eq, Ord)
66−
67−showModuleType :: ModuleType -> String
68−showModuleType Regular = "Regular"
69−showModuleType Foreign = "Foreign"
70−
71−-- | A module is identified by its module name and its type.
72−data ModuleIdentifier = ModuleIdentifier String ModuleType deriving (Show, Read, Eq, Ord)
73−
74−moduleName :: ModuleIdentifier -> String
75−moduleName (ModuleIdentifier name _) = name
76−
77−-- | A piece of code is identified by its module and its name. These keys are used to label vertices
78−-- in the dependency graph.
79−type Key = (ModuleIdentifier, String)
80−
81−-- | An export is either a "regular export", which exports a name from the regular module we are in,
82−-- or a reexport of a declaration in the corresponding foreign module.
83−--
84−-- Regular exports are labelled, since they might re-export an operator with another name.
85−data ExportType
86− = RegularExport String
87− | ForeignReexport
88− deriving (Show, Eq, Ord)
89−
90−-- | There are four types of module element we are interested in:
91−--
92−-- 1) Require statements
93−-- 2) Member declarations
94−-- 3) Export lists
95−-- 4) Everything else
96−--
97−-- Each is labelled with the original AST node which generated it, so that we can dump it back
98−-- into the output during codegen.
99−data ModuleElement
100− = Require JSStatement String (Either String ModuleIdentifier)
101− | Member JSStatement Bool String JSExpression [Key]
102− | ExportsList [(ExportType, String, JSExpression, [Key])]
103− | Other JSStatement
104− deriving (Show)
105−
106−-- | A module is just a list of elements of the types listed above.
107−data Module = Module ModuleIdentifier [ModuleElement] deriving (Show)
108−
109−-- | Prepare an error message for consumption by humans.
110−printErrorMessage :: ErrorMessage -> [String]
111−printErrorMessage (UnsupportedModulePath s) =
112− [ "A CommonJS module has an unsupported name (" ++ show s ++ ")."
113− , "The following file names are supported:"
114− , " 1) index.js (psc native modules)"
115− , " 2) foreign.js (psc foreign modules)"
116− ]
117−printErrorMessage InvalidTopLevel =
118− [ "Expected a list of source elements at the top level." ]
119−printErrorMessage (UnableToParseModule err) =
120− [ "The module could not be parsed:"
121− , err
122− ]
123−printErrorMessage UnsupportedExport =
124− [ "An export was unsupported. Exports can be defined in one of two ways: "
125− , " 1) exports.name = ..."
126− , " 2) exports = { ... }"
127− ]
128−printErrorMessage (ErrorInModule mid e) =
129− ("Error in module " ++ displayIdentifier mid ++ ":")
130− : ""
131− : map (" " ++) (printErrorMessage e)
132− where
133− displayIdentifier (ModuleIdentifier name ty) =
134− name ++ " (" ++ showModuleType ty ++ ")"
135−
136−-- | Calculate the ModuleIdentifier which a require(...) statement imports.
137−checkImportPath :: String -> ModuleIdentifier -> S.Set String -> Either String ModuleIdentifier
138−checkImportPath "./foreign" m _ =
139− Right (ModuleIdentifier (moduleName m) Foreign)
140−checkImportPath name _ names
141− | Just name' <- stripPrefix "../" name
142− , name' `S.member` names = Right (ModuleIdentifier name' Regular)
143−checkImportPath name _ _ = Left name
144−
145−-- | Compute the dependencies of all elements in a module, and add them to the tree.
146−--
147−-- Members and exports can have dependencies. A dependency is of one of the following forms:
148−--
149−-- 1) module.name or member["name"]
150−--
151−-- where module was imported using
152−--
153−-- var module = require("Module.Name");
154−--
155−-- 2) name
156−--
157−-- where name is the name of a member defined in the current module.
158−withDeps :: Module -> Module
159−withDeps (Module modulePath es) = Module modulePath (map expandDeps es)
160− where
161− -- | Collects all modules which are imported, so that we can identify dependencies of the first type.
162− imports :: [(String, ModuleIdentifier)]
163− imports = mapMaybe toImport es
164− where
165− toImport :: ModuleElement -> Maybe (String, ModuleIdentifier)
166− toImport (Require _ nm (Right mid)) = Just (nm, mid)
167− toImport _ = Nothing
168−
169− -- | Collects all member names in scope, so that we can identify dependencies of the second type.
170− boundNames :: [String]
171− boundNames = mapMaybe toBoundName es
172− where
173− toBoundName :: ModuleElement -> Maybe String
174− toBoundName (Member _ _ nm _ _) = Just nm
175− toBoundName _ = Nothing
176−
177− -- | Calculate dependencies and add them to the current element.
178− expandDeps :: ModuleElement -> ModuleElement
179− expandDeps (Member n f nm decl _) = Member n f nm decl (nub $ dependencies modulePath decl)
180− expandDeps (ExportsList exps) = ExportsList (map expand exps)
181− where
182− expand (ty, nm, n1, _) = (ty, nm, n1, nub (dependencies modulePath n1))
183− expandDeps other = other
184−
185− dependencies :: ModuleIdentifier -> JSExpression -> [(ModuleIdentifier, String)]
186− dependencies m = everything (++) (mkQ [] toReference)
187− where
188− toReference :: JSExpression -> [(ModuleIdentifier, String)]
189− toReference (JSMemberDot mn _ nm)
190− | JSIdentifier _ mn' <- mn
191− , JSIdentifier _ nm' <- nm
192− , Just mid <- lookup mn' imports
193− = [(mid, nm')]
194− toReference (JSMemberSquare mn _ nm _)
195− | JSIdentifier _ mn' <- mn
196− , Just nm' <- fromStringLiteral nm
197− , Just mid <- lookup mn' imports
198− = [(mid, nm')]
199− toReference (JSIdentifier _ nm)
200− | nm `elem` boundNames
201− = [(m, nm)]
202− toReference _ = []
203−
204−-- String literals include the quote chars
205−fromStringLiteral :: JSExpression -> Maybe String
206−fromStringLiteral (JSStringLiteral _ str) = Just $ trimStringQuotes str
207−fromStringLiteral _ = Nothing
208−
209−trimStringQuotes :: String -> String
210−trimStringQuotes str = reverse $ drop 1 $ reverse $ drop 1 $ str
211−
212−commaList :: JSCommaList a -> [a]
213−commaList JSLNil = []
214−commaList (JSLOne x) = [x]
215−commaList (JSLCons l _ x) = commaList l ++ [x]
216−
217−trailingCommaList :: JSCommaTrailingList a -> [a]
218−trailingCommaList (JSCTLComma l _) = commaList l
219−trailingCommaList (JSCTLNone l) = commaList l
220−
221−-- | Attempt to create a Module from a Javascript AST.
222−--
223−-- Each type of module element is matched using pattern guards, and everything else is bundled into the
224−-- Other constructor.
225−toModule :: forall m. (MonadError ErrorMessage m) => S.Set String -> ModuleIdentifier -> JSAST -> m Module
226−toModule mids mid top
227− | JSAstProgram smts _ <- top = Module mid <$> traverse toModuleElement smts
228− | otherwise = err InvalidTopLevel
229− where
230− err = throwError . ErrorInModule mid
231−
232− toModuleElement :: JSStatement -> m ModuleElement
233− toModuleElement stmt
234− | Just (importName, importPath) <- matchRequire mids mid stmt
235− = pure (Require stmt importName importPath)
236− toModuleElement stmt
237− | Just (exported, name, decl) <- matchMember stmt
238− = pure (Member stmt exported name decl [])
239− toModuleElement stmt
240− | Just props <- matchExportsAssignment stmt
241− = (ExportsList <$> traverse toExport (trailingCommaList props))
242− where
243− toExport :: JSObjectProperty -> m (ExportType, String, JSExpression, [Key])
244− toExport (JSPropertyNameandValue name _ [val]) =
245− (,,val,[]) <$> exportType val
246− <*> extractLabel' name
247− toExport _ = err UnsupportedExport
248−
249− exportType :: JSExpression -> m ExportType
250− exportType (JSMemberDot f _ _)
251− | JSIdentifier _ "$foreign" <- f
252− = pure ForeignReexport
253− exportType (JSMemberSquare f _ _ _)
254− | JSIdentifier _ "$foreign" <- f
255− = pure ForeignReexport
256− exportType (JSIdentifier _ s) = pure (RegularExport s)
257− exportType _ = err UnsupportedExport
258−
259− extractLabel' = maybe (err UnsupportedExport) pure . extractLabel
260−
261− toModuleElement other = pure (Other other)
262−
263−-- Get a list of all the exported identifiers from a foreign module.
264−--
265−-- TODO: what if we assign to exports.foo and then later assign to
266−-- module.exports (presumably overwriting exports.foo)?
267−getExportedIdentifiers :: (MonadError ErrorMessage m)
268− => String
269− -> JSAST
270− -> m [String]
271−getExportedIdentifiers mname top
272− | JSAstProgram stmts _ <- top = concat <$> traverse go stmts
273− | otherwise = err InvalidTopLevel
274− where
275− err = throwError . ErrorInModule (ModuleIdentifier mname Foreign)
276−
277− go stmt
278− | Just props <- matchExportsAssignment stmt
279− = traverse toIdent (trailingCommaList props)
280− | Just (True, name, _) <- matchMember stmt
281− = pure [name]
282− | otherwise
283− = pure []
284−
285− toIdent (JSPropertyNameandValue name _ [_]) =
286− extractLabel' name
287− toIdent _ =
288− err UnsupportedExport
289−
290− extractLabel' = maybe (err UnsupportedExport) pure . extractLabel
291−
292−-- Matches JS statements like this:
293−-- var ModuleName = require("file");
294−matchRequire :: S.Set String
295− -> ModuleIdentifier
296− -> JSStatement
297− -> Maybe (String, Either String ModuleIdentifier)
298−matchRequire mids mid stmt
299− | JSVariable _ jsInit _ <- stmt
300− , [JSVarInitExpression var varInit] <- commaList jsInit
301− , JSIdentifier _ importName <- var
302− , JSVarInit _ jsInitEx <- varInit
303− , JSMemberExpression req _ argsE _ <- jsInitEx
304− , JSIdentifier _ "require" <- req
305− , [ Just importPath ] <- map fromStringLiteral (commaList argsE)
306− , importPath' <- checkImportPath importPath mid mids
307− = Just (importName, importPath')
308− | otherwise
309− = Nothing
310−
311−-- Matches JS member declarations.
312−matchMember :: JSStatement -> Maybe (Bool, String, JSExpression)
313−matchMember stmt
314− -- var foo = expr;
315− | JSVariable _ jsInit _ <- stmt
316− , [JSVarInitExpression var varInit] <- commaList jsInit
317− , JSIdentifier _ name <- var
318− , JSVarInit _ decl <- varInit
319− = Just (False, name, decl)
320− -- exports.foo = expr; exports["foo"] = expr;
321− | JSAssignStatement e (JSAssign _) decl _ <- stmt
322− , Just name <- accessor e
323− = Just (True, name, decl)
324− | otherwise
325− = Nothing
326− where
327− accessor :: JSExpression -> Maybe String
328− accessor (JSMemberDot exports _ nm)
329− | JSIdentifier _ "exports" <- exports
330− , JSIdentifier _ name <- nm
331− = Just name
332− accessor (JSMemberSquare exports _ nm _)
333− | JSIdentifier _ "exports" <- exports
334− , Just name <- fromStringLiteral nm
335− = Just name
336− accessor _ = Nothing
337−
338−-- Matches assignments to module.exports, like this:
339−-- module.exports = { ... }
340−matchExportsAssignment :: JSStatement -> Maybe JSObjectPropertyList
341−matchExportsAssignment stmt
342− | JSAssignStatement e (JSAssign _) decl _ <- stmt
343− , JSMemberDot module' _ exports <- e
344− , JSIdentifier _ "module" <- module'
345− , JSIdentifier _ "exports" <- exports
346− , JSObjectLiteral _ props _ <- decl
347− = Just props
348− | otherwise
349− = Nothing
350−
351−extractLabel :: JSPropertyName -> Maybe String
352−extractLabel (JSPropertyString _ nm) = Just (trimStringQuotes nm)
353−extractLabel (JSPropertyIdent _ nm) = Just nm
354−extractLabel _ = Nothing
355−
356−-- | Eliminate unused code based on the specified entry point set.
357−compile :: [Module] -> [ModuleIdentifier] -> [Module]
358−compile modules [] = modules
359−compile modules entryPoints = filteredModules
360− where
361− (graph, _, vertexFor) = graphFromEdges verts
362−
363− -- | The vertex set
364− verts :: [(ModuleElement, Key, [Key])]
365− verts = do
366− Module mid els <- modules
367− concatMap (toVertices mid) els
368− where
369− -- | Create a set of vertices for a module element.
370− --
371− -- Some special cases worth commenting on:
372− --
373− -- 1) Regular exports which simply export their own name do not count as dependencies.
374− -- Regular exports which rename and reexport an operator do count, however.
375− --
376− -- 2) Require statements don't contribute towards dependencies, since they effectively get
377− -- inlined wherever they are used inside other module elements.
378− toVertices :: ModuleIdentifier -> ModuleElement -> [(ModuleElement, Key, [Key])]
379− toVertices p m@(Member _ _ nm _ deps) = [(m, (p, nm), deps)]
380− toVertices p m@(ExportsList exps) = mapMaybe toVertex exps
381− where
382− toVertex (ForeignReexport, nm, _, ks) = Just (m, (p, nm), ks)
383− toVertex (RegularExport nm, nm1, _, ks) | nm /= nm1 = Just (m, (p, nm1), ks)
384− toVertex _ = Nothing
385− toVertices _ _ = []
386−
387− -- | The set of vertices whose connected components we are interested in keeping.
388− entryPointVertices :: [Vertex]
389− entryPointVertices = catMaybes $ do
390− (_, k@(mid, _), _) <- verts
391− guard $ mid `elem` entryPoints
392− return (vertexFor k)
393−
394− -- | The set of vertices reachable from an entry point
395− reachableSet :: S.Set Vertex
396− reachableSet = S.fromList (concatMap (reachable graph) entryPointVertices)
397−
398− filteredModules :: [Module]
399− filteredModules = map filterUsed modules
400− where
401− filterUsed :: Module -> Module
402− filterUsed (Module mid ds) = Module mid (map filterExports (go ds))
403− where
404− go :: [ModuleElement] -> [ModuleElement]
405− go [] = []
406− go (d : rest)
407− | not (isDeclUsed d) = go rest
408− | otherwise = d : go rest
409−
410− -- | Filter out the exports for members which aren't used.
411− filterExports :: ModuleElement -> ModuleElement
412− filterExports (ExportsList exps) = ExportsList (filter (\(_, nm, _, _) -> isKeyUsed (mid, nm)) exps)
413− filterExports me = me
414−
415− isDeclUsed :: ModuleElement -> Bool
416− isDeclUsed (Member _ _ nm _ _) = isKeyUsed (mid, nm)
417− isDeclUsed _ = True
418−
419− isKeyUsed :: Key -> Bool
420− isKeyUsed k
421− | Just me <- vertexFor k = me `S.member` reachableSet
422− | otherwise = False
423−
424−-- | Topologically sort the module dependency graph, so that when we generate code, modules can be
425−-- defined in the right order.
426−sortModules :: [Module] -> [Module]
427−sortModules modules = map (\v -> case nodeFor v of (n, _, _) -> n) (reverse (topSort graph))
428− where
429− (graph, nodeFor, _) = graphFromEdges $ do
430− m@(Module mid els) <- modules
431− return (m, mid, mapMaybe getKey els)
432−
433− getKey :: ModuleElement -> Maybe ModuleIdentifier
434− getKey (Require _ _ (Right mi)) = Just mi
435− getKey _ = Nothing
436−
437−-- | A module is empty if it contains no exported members (in other words,
438−-- if the only things left after dead code elimination are module imports and
439−-- "other" foreign code).
440−--
441−-- If a module is empty, we don't want to generate code for it.
442−isModuleEmpty :: Module -> Bool
443−isModuleEmpty (Module _ els) = all isElementEmpty els
444− where
445− isElementEmpty :: ModuleElement -> Bool
446− isElementEmpty (ExportsList exps) = null exps
447− isElementEmpty Require{} = True
448− isElementEmpty (Other _) = True
449− isElementEmpty _ = False
450−
451−-- | Generate code for a set of modules, including a call to main().
452−--
453−-- Modules get defined on the global PS object, as follows:
454−--
455−-- var PS = { };
456−-- (function(exports) {
457−-- ...
458−-- })(PS["Module.Name"] = PS["Module.Name"] || {});
459−--
460−-- In particular, a module and its foreign imports share the same namespace inside PS.
461−-- This saves us from having to generate unique names for a module and its foreign imports,
462−-- and is safe since a module shares a namespace with its foreign imports in PureScript as well
463−-- (so there is no way to have overlaps in code generated by psc).
464−codeGen :: Maybe String -- ^ main module
465− -> String -- ^ namespace
466− -> [Module] -- ^ input modules
467− -> String
468−codeGen optionsMainModule optionsNamespace ms = renderToString (JSAstProgram (prelude : concatMap moduleToJS ms ++ maybe [] runMain optionsMainModule) JSNoAnnot)
469− where
470− moduleToJS :: Module -> [JSStatement]
471− moduleToJS (Module mn ds) = wrap (moduleName mn) (indent (concatMap declToJS ds))
472− where
473− declToJS :: ModuleElement -> [JSStatement]
474− declToJS (Member n _ _ _ _) = [n]
475− declToJS (Other n) = [n]
476− declToJS (Require _ nm req) =
477− [
478− JSVariable lfsp
479− (cList [
480− JSVarInitExpression (JSIdentifier sp nm)
481− (JSVarInit sp $ either require (moduleReference sp . moduleName) req )
482− ]) (JSSemi JSNoAnnot)
483− ]
484− declToJS (ExportsList exps) = map toExport exps
485−
486− where
487− toExport :: (ExportType, String, JSExpression, [Key]) -> JSStatement
488− toExport (_, nm, val, _) =
489− JSAssignStatement
490− (JSMemberSquare (JSIdentifier lfsp "exports") JSNoAnnot
491− (str nm) JSNoAnnot)
492− (JSAssign sp)
493− val
494− (JSSemi JSNoAnnot)
495−
496− -- comma lists are reverse-consed
497− cList :: [a] -> JSCommaList a
498− cList [] = JSLNil
499− cList [x] = JSLOne x
500− cList l = go $ reverse l
501− where
502− go [x] = JSLOne x
503− go (h:t)= JSLCons (go t) JSNoAnnot h
504− go [] = error "Invalid case in comma-list"
505−
506− indent :: [JSStatement] -> [JSStatement]
507− indent = everywhere (mkT squash)
508− where
509− squash JSNoAnnot = (JSAnnot (TokenPn 0 0 2) [])
510− squash (JSAnnot pos ann) = JSAnnot (keepCol pos) (map splat ann)
511−
512− splat (CommentA pos s) = CommentA (keepCol pos) s
513− splat (WhiteSpace pos w) = WhiteSpace (keepCol pos) w
514− splat ann = ann
515−
516− keepCol (TokenPn _ _ c) = TokenPn 0 0 (if c >= 0 then c + 2 else 2)
517−
518− prelude :: JSStatement
519− prelude = JSVariable (JSAnnot tokenPosnEmpty [ CommentA tokenPosnEmpty $ "// Generated by psc-bundle " ++ showVersion Paths.version
520− , WhiteSpace tokenPosnEmpty "\n" ])
521− (cList [
522− JSVarInitExpression (JSIdentifier sp optionsNamespace)
523− (JSVarInit sp (emptyObj sp))
524− ]) (JSSemi JSNoAnnot)
525−
526− require :: String -> JSExpression
527− require mn =
528− JSMemberExpression (JSIdentifier JSNoAnnot "require") JSNoAnnot (cList [ str mn ]) JSNoAnnot
529−
530− moduleReference :: JSAnnot -> String -> JSExpression
531− moduleReference a mn =
532− JSMemberSquare (JSIdentifier a optionsNamespace) JSNoAnnot
533− (str mn) JSNoAnnot
534−
535− str :: String -> JSExpression
536− str s = JSStringLiteral JSNoAnnot $ "\"" ++ s ++ "\""
537−
538−
539− emptyObj :: JSAnnot -> JSExpression
540− emptyObj a = JSObjectLiteral a (JSCTLNone JSLNil) JSNoAnnot
541−
542− wrap :: String -> [JSStatement] -> [JSStatement]
543− wrap mn ds =
544− [
545− JSMethodCall (JSExpressionParen lf (JSFunctionExpression JSNoAnnot JSIdentNone JSNoAnnot
546− (JSLOne (JSIdentName JSNoAnnot "exports")) JSNoAnnot
547− (JSBlock sp (lfHead ds) lf)) -- \n not quite in right place
548− JSNoAnnot)
549− JSNoAnnot
550− (JSLOne (JSAssignExpression (moduleReference JSNoAnnot mn) (JSAssign sp)
551− (JSExpressionBinary (moduleReference sp mn) (JSBinOpOr sp) (emptyObj sp))))
552− JSNoAnnot
553− (JSSemi JSNoAnnot)
554− ]
555− where
556− lfHead (h:t) = (addAnn (WhiteSpace tokenPosnEmpty "\n ") h) : t
557− lfHead x = x
558−
559− addAnn :: CommentAnnotation -> JSStatement -> JSStatement
560− addAnn a (JSExpressionStatement (JSStringLiteral ann s) _) =
561− (JSExpressionStatement (JSStringLiteral (appendAnn a ann) s) (JSSemi JSNoAnnot))
562− addAnn _ x = x
563−
564− appendAnn a JSNoAnnot = (JSAnnot tokenPosnEmpty [a])
565− appendAnn a (JSAnnot _ anns) = JSAnnot tokenPosnEmpty (a:anns ++ [WhiteSpace tokenPosnEmpty " "])
566−
567− runMain :: String -> [JSStatement]
568− runMain mn =
569− [JSMethodCall
570− (JSMemberDot (moduleReference lf mn) JSNoAnnot
571− (JSIdentifier JSNoAnnot "main"))
572− JSNoAnnot (cList []) JSNoAnnot (JSSemi JSNoAnnot)]
573−
574− lf :: JSAnnot
575− lf = JSAnnot tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n" ]
576−
577−
578− lfsp :: JSAnnot
579− lfsp = JSAnnot tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n " ]
580−
581− sp :: JSAnnot
582− sp = JSAnnot tokenPosnEmpty [ WhiteSpace tokenPosnEmpty " " ]
583−
584−-- | The bundling function.
585−-- This function performs dead code elimination, filters empty modules
586−-- and generates and prints the final Javascript bundle.
587−bundle :: (MonadError ErrorMessage m)
588− => [(ModuleIdentifier, String)] -- ^ The input modules. Each module should be javascript rendered from 'Language.PureScript.Make' or @psc@.
589− -> [ModuleIdentifier] -- ^ Entry points. These module identifiers are used as the roots for dead-code elimination
590− -> Maybe String -- ^ An optional main module.
591− -> String -- ^ The namespace (e.g. PS).
592− -> m String
593−bundle inputStrs entryPoints mainModule namespace = do
594− input <- forM inputStrs $ \(ident, js) -> do
595− ast <- either (throwError . ErrorInModule ident . UnableToParseModule) pure $ parse js (moduleName ident)
596− return (ident, ast)
597−
598− let mids = S.fromList (map (moduleName . fst) input)
599−
600− modules <- traverse (fmap withDeps . uncurry (toModule mids)) input
601−
602− let compiled = compile modules entryPoints
603− sorted = sortModules (filter (not . isModuleEmpty) compiled)
604−
605− 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−451
@@ -1,451 +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− . (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 = go M.empty
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− let ((ss, _, _, _), mnSafe) = fromMaybe (internalError "Missing value in mnLookup") $ M.lookup mn' mnLookup
113− let moduleBody = JSApp Nothing (JSVar Nothing "require") [JSStringLiteral Nothing (".." </> runModuleName mn')]
114− withPos ss $ JSVariableIntroduction Nothing (moduleNameToJs mnSafe) (Just moduleBody)
115−
116− -- |
117− -- Replaces the `ModuleName`s in the AST so that the generated code refers to
118− -- the collision-avoiding renamed module imports.
119− --
120− renameModules :: M.Map ModuleName (Ann, ModuleName) -> [Bind Ann] -> [Bind Ann]
121− renameModules mnLookup binds =
122− let (f, _, _) = everywhereOnValues id goExpr goBinder
123− in map f binds
124− where
125− goExpr :: Expr a -> Expr a
126− goExpr (Var ann q) = Var ann (renameQual q)
127− goExpr e = e
128− goBinder :: Binder a -> Binder a
129− goBinder (ConstructorBinder ann q1 q2 bs) = ConstructorBinder ann (renameQual q1) (renameQual q2) bs
130− goBinder b = b
131− renameQual :: Qualified a -> Qualified a
132− renameQual (Qualified (Just mn') a) =
133− let (_,mnSafe) = fromMaybe (internalError "Missing value in mnLookup") $ M.lookup mn' mnLookup
134− in Qualified (Just mnSafe) a
135− renameQual q = q
136−
137− -- |
138− -- Generate code in the simplified Javascript intermediate representation for a declaration
139− --
140− bindToJs :: Bind Ann -> m [JS]
141− bindToJs (NonRec ann ident val) = return <$> nonRecToJS ann ident val
142− bindToJs (Rec vals) = forM vals (uncurry . uncurry $ nonRecToJS)
143−
144− -- |
145− -- Generate code in the simplified Javascript intermediate representation for a single non-recursive
146− -- declaration.
147− --
148− -- The main purpose of this function is to handle code generation for comments.
149− --
150− nonRecToJS :: Ann -> Ident -> Expr Ann -> m JS
151− nonRecToJS a i e@(extractAnn -> (_, com, _, _)) | not (null com) = do
152− withoutComment <- asks optionsNoComments
153− if withoutComment
154− then nonRecToJS a i (modifyAnn removeComments e)
155− else JSComment Nothing com <$> nonRecToJS a i (modifyAnn removeComments e)
156− nonRecToJS (ss, _, _, _) ident val = do
157− js <- valueToJs val
158− withPos ss $ JSVariableIntroduction Nothing (identToJs ident) (Just js)
159−
160− withPos :: Maybe SourceSpan -> JS -> m JS
161− withPos (Just ss) js = do
162− withSM <- asks optionsSourceMaps
163− return $ if withSM
164− then withSourceSpan ss js
165− else js
166− withPos Nothing js = return js
167−
168− -- |
169− -- Generate code in the simplified Javascript intermediate representation for a variable based on a
170− -- PureScript identifier.
171− --
172− var :: Ident -> JS
173− var = JSVar Nothing . identToJs
174−
175− -- |
176− -- Generate code in the simplified Javascript intermediate representation for an accessor based on
177− -- a PureScript identifier. If the name is not valid in Javascript (symbol based, reserved name) an
178− -- indexer is returned.
179− --
180− accessor :: Ident -> JS -> JS
181− accessor (Ident prop) = accessorString prop
182− accessor (Op op) = JSIndexer Nothing (JSStringLiteral Nothing op)
183− accessor (GenIdent _ _) = internalError "GenIdent in accessor"
184−
185− accessorString :: String -> JS -> JS
186− accessorString prop | identNeedsEscaping prop = JSIndexer Nothing (JSStringLiteral Nothing prop)
187− | otherwise = JSAccessor Nothing prop
188−
189− -- |
190− -- Generate code in the simplified Javascript intermediate representation for a value or expression.
191− --
192− valueToJs :: Expr Ann -> m JS
193− valueToJs e =
194− let (ss, _, _, _) = extractAnn e in
195− withPos ss =<< valueToJs' e
196−
197− valueToJs' :: Expr Ann -> m JS
198− valueToJs' (Literal (pos, _, _, _) l) =
199− maybe id rethrowWithPosition pos $ literalToValueJS l
200− valueToJs' (Var (_, _, _, Just (IsConstructor _ [])) name) =
201− return $ JSAccessor Nothing "value" $ qualifiedToJS id name
202− valueToJs' (Var (_, _, _, Just (IsConstructor _ _)) name) =
203− return $ JSAccessor Nothing "create" $ qualifiedToJS id name
204− valueToJs' (Accessor _ prop val) =
205− accessorString prop <$> valueToJs val
206− valueToJs' (ObjectUpdate _ o ps) = do
207− obj <- valueToJs o
208− sts <- mapM (sndM valueToJs) ps
209− extendObj obj sts
210− valueToJs' e@(Abs (_, _, _, Just IsTypeClassConstructor) _ _) =
211− let args = unAbs e
212− in return $ JSFunction Nothing Nothing (map identToJs args) (JSBlock Nothing $ map assign args)
213− where
214− unAbs :: Expr Ann -> [Ident]
215− unAbs (Abs _ arg val) = arg : unAbs val
216− unAbs _ = []
217− assign :: Ident -> JS
218− assign name = JSAssignment Nothing (accessorString (runIdent name) (JSVar Nothing "this"))
219− (var name)
220− valueToJs' (Abs _ arg val) = do
221− ret <- valueToJs val
222− return $ JSFunction Nothing Nothing [identToJs arg] (JSBlock Nothing [JSReturn Nothing ret])
223− valueToJs' e@App{} = do
224− let (f, args) = unApp e []
225− args' <- mapM valueToJs args
226− case f of
227− Var (_, _, _, Just IsNewtype) _ -> return (head args')
228− Var (_, _, _, Just (IsConstructor _ fields)) name | length args == length fields ->
229− return $ JSUnary Nothing JSNew $ JSApp Nothing (qualifiedToJS id name) args'
230− Var (_, _, _, Just IsTypeClassConstructor) name ->
231− return $ JSUnary Nothing JSNew $ JSApp Nothing (qualifiedToJS id name) args'
232− _ -> flip (foldl (\fn a -> JSApp Nothing fn [a])) args' <$> valueToJs f
233− where
234− unApp :: Expr Ann -> [Expr Ann] -> (Expr Ann, [Expr Ann])
235− unApp (App _ val arg) args = unApp val (arg : args)
236− unApp other args = (other, args)
237− valueToJs' (Var (_, _, _, Just IsForeign) qi@(Qualified (Just mn') ident)) =
238− return $ if mn' == mn
239− then foreignIdent ident
240− else varToJs qi
241− valueToJs' (Var (_, _, _, Just IsForeign) ident) =
242− error $ "Encountered an unqualified reference to a foreign ident " ++ showQualified showIdent ident
243− valueToJs' (Var _ ident) = return $ varToJs ident
244− valueToJs' (Case (maybeSpan, _, _, _) values binders) = do
245− vals <- mapM valueToJs values
246− bindersToJs maybeSpan binders vals
247− valueToJs' (Let _ ds val) = do
248− ds' <- concat <$> mapM bindToJs ds
249− ret <- valueToJs val
250− return $ JSApp Nothing (JSFunction Nothing Nothing [] (JSBlock Nothing (ds' ++ [JSReturn Nothing ret]))) []
251− valueToJs' (Constructor (_, _, _, Just IsNewtype) _ (ProperName ctor) _) =
252− return $ JSVariableIntroduction Nothing ctor (Just $
253− JSObjectLiteral Nothing [("create",
254− JSFunction Nothing Nothing ["value"]
255− (JSBlock Nothing [JSReturn Nothing $ JSVar Nothing "value"]))])
256− valueToJs' (Constructor _ _ (ProperName ctor) []) =
257− return $ iife ctor [ JSFunction Nothing (Just ctor) [] (JSBlock Nothing [])
258− , JSAssignment Nothing (JSAccessor Nothing "value" (JSVar Nothing ctor))
259− (JSUnary Nothing JSNew $ JSApp Nothing (JSVar Nothing ctor) []) ]
260− valueToJs' (Constructor _ _ (ProperName ctor) fields) =
261− let constructor =
262− let body = [ JSAssignment Nothing (JSAccessor Nothing (identToJs f) (JSVar Nothing "this")) (var f) | f <- fields ]
263− in JSFunction Nothing (Just ctor) (identToJs `map` fields) (JSBlock Nothing body)
264− createFn =
265− let body = JSUnary Nothing JSNew $ JSApp Nothing (JSVar Nothing ctor) (var `map` fields)
266− in foldr (\f inner -> JSFunction Nothing Nothing [identToJs f] (JSBlock Nothing [JSReturn Nothing inner])) body fields
267− in return $ iife ctor [ constructor
268− , JSAssignment Nothing (JSAccessor Nothing "create" (JSVar Nothing ctor)) createFn
269− ]
270−
271− iife :: String -> [JS] -> JS
272− iife v exprs = JSApp Nothing (JSFunction Nothing Nothing [] (JSBlock Nothing $ exprs ++ [JSReturn Nothing $ JSVar Nothing v])) []
273−
274− literalToValueJS :: Literal (Expr Ann) -> m JS
275− literalToValueJS (NumericLiteral (Left i)) = return $ JSNumericLiteral Nothing (Left i)
276− literalToValueJS (NumericLiteral (Right n)) = return $ JSNumericLiteral Nothing (Right n)
277− literalToValueJS (StringLiteral s) = return $ JSStringLiteral Nothing s
278− literalToValueJS (CharLiteral c) = return $ JSStringLiteral Nothing [c]
279− literalToValueJS (BooleanLiteral b) = return $ JSBooleanLiteral Nothing b
280− literalToValueJS (ArrayLiteral xs) = JSArrayLiteral Nothing <$> mapM valueToJs xs
281− literalToValueJS (ObjectLiteral ps) = JSObjectLiteral Nothing <$> mapM (sndM valueToJs) ps
282−
283− -- |
284− -- Shallow copy an object.
285− --
286− extendObj :: JS -> [(String, JS)] -> m JS
287− extendObj obj sts = do
288− newObj <- freshName
289− key <- freshName
290− let
291− jsKey = JSVar Nothing key
292− jsNewObj = JSVar Nothing newObj
293− block = JSBlock Nothing (objAssign:copy:extend ++ [JSReturn Nothing jsNewObj])
294− objAssign = JSVariableIntroduction Nothing newObj (Just $ JSObjectLiteral Nothing [])
295− copy = JSForIn Nothing key obj $ JSBlock Nothing [JSIfElse Nothing cond assign Nothing]
296− cond = JSApp Nothing (JSAccessor Nothing "hasOwnProperty" obj) [jsKey]
297− assign = JSBlock Nothing [JSAssignment Nothing (JSIndexer Nothing jsKey jsNewObj) (JSIndexer Nothing jsKey obj)]
298− stToAssign (s, js) = JSAssignment Nothing (JSAccessor Nothing s jsNewObj) js
299− extend = map stToAssign sts
300− return $ JSApp Nothing (JSFunction Nothing Nothing [] block) []
301−
302− -- |
303− -- Generate code in the simplified Javascript intermediate representation for a reference to a
304− -- variable.
305− --
306− varToJs :: Qualified Ident -> JS
307− varToJs (Qualified Nothing ident) = var ident
308− varToJs qual = qualifiedToJS id qual
309−
310− -- |
311− -- Generate code in the simplified Javascript intermediate representation for a reference to a
312− -- variable that may have a qualified name.
313− --
314− qualifiedToJS :: (a -> Ident) -> Qualified a -> JS
315− qualifiedToJS f (Qualified (Just (ModuleName [ProperName mn'])) a) | mn' == C.prim = JSVar Nothing . runIdent $ f a
316− qualifiedToJS f (Qualified (Just mn') a) | mn /= mn' = accessor (f a) (JSVar Nothing (moduleNameToJs mn'))
317− qualifiedToJS f (Qualified _ a) = JSVar Nothing $ identToJs (f a)
318−
319− foreignIdent :: Ident -> JS
320− foreignIdent ident = accessorString (runIdent ident) (JSVar Nothing "$foreign")
321−
322− -- |
323− -- Generate code in the simplified Javascript intermediate representation for pattern match binders
324− -- and guards.
325− --
326− bindersToJs :: Maybe SourceSpan -> [CaseAlternative Ann] -> [JS] -> m JS
327− bindersToJs maybeSpan binders vals = do
328− valNames <- replicateM (length vals) freshName
329− let assignments = zipWith (JSVariableIntroduction Nothing) valNames (map Just vals)
330− jss <- forM binders $ \(CaseAlternative bs result) -> do
331− ret <- guardsToJs result
332− go valNames ret bs
333− return $ JSApp Nothing (JSFunction Nothing Nothing [] (JSBlock Nothing (assignments ++ concat jss ++ [JSThrow Nothing $ failedPatternError valNames])))
334− []
335− where
336− go :: [String] -> [JS] -> [Binder Ann] -> m [JS]
337− go _ done [] = return done
338− go (v:vs) done' (b:bs) = do
339− done'' <- go vs done' bs
340− binderToJs v done'' b
341− go _ _ _ = internalError "Invalid arguments to bindersToJs"
342−
343− failedPatternError :: [String] -> JS
344− failedPatternError names = JSUnary Nothing JSNew $ JSApp Nothing (JSVar Nothing "Error") [JSBinary Nothing Add (JSStringLiteral Nothing failedPatternMessage) (JSArrayLiteral Nothing $ zipWith valueError names vals)]
345−
346− failedPatternMessage :: String
347− failedPatternMessage = "Failed pattern match" ++ maybe "" (((" at " ++ runModuleName mn ++ " ") ++) . displayStartEndPos) maybeSpan ++ ": "
348−
349− valueError :: String -> JS -> JS
350− valueError _ l@(JSNumericLiteral _ _) = l
351− valueError _ l@(JSStringLiteral _ _) = l
352− valueError _ l@(JSBooleanLiteral _ _) = l
353− valueError s _ = JSAccessor Nothing "name" . JSAccessor Nothing "constructor" $ JSVar Nothing s
354−
355− guardsToJs :: Either [(Guard Ann, Expr Ann)] (Expr Ann) -> m [JS]
356− guardsToJs (Left gs) = forM gs $ \(cond, val) -> do
357− cond' <- valueToJs cond
358− done <- valueToJs val
359− return $ JSIfElse Nothing cond' (JSBlock Nothing [JSReturn Nothing done]) Nothing
360− guardsToJs (Right v) = return . JSReturn Nothing <$> valueToJs v
361−
362− binderToJs :: String -> [JS] -> Binder Ann -> m [JS]
363− binderToJs s done binder =
364− let (ss, _, _, _) = extractBinderAnn binder in
365− traverse (withPos ss) =<< binderToJs' s done binder
366−
367− -- |
368− -- Generate code in the simplified Javascript intermediate representation for a pattern match
369− -- binder.
370− --
371− binderToJs' :: String -> [JS] -> Binder Ann -> m [JS]
372− binderToJs' _ done (NullBinder{}) = return done
373− binderToJs' varName done (LiteralBinder _ l) =
374− literalToBinderJS varName done l
375− binderToJs' varName done (VarBinder _ ident) =
376− return (JSVariableIntroduction Nothing (identToJs ident) (Just (JSVar Nothing varName)) : done)
377− binderToJs' varName done (ConstructorBinder (_, _, _, Just IsNewtype) _ _ [b]) =
378− binderToJs varName done b
379− binderToJs' varName done (ConstructorBinder (_, _, _, Just (IsConstructor ctorType fields)) _ ctor bs) = do
380− js <- go (zip fields bs) done
381− return $ case ctorType of
382− ProductType -> js
383− SumType ->
384− [JSIfElse Nothing (JSInstanceOf Nothing (JSVar Nothing varName) (qualifiedToJS (Ident . runProperName) ctor))
385− (JSBlock Nothing js)
386− Nothing]
387− where
388− go :: [(Ident, Binder Ann)] -> [JS] -> m [JS]
389− go [] done' = return done'
390− go ((field, binder) : remain) done' = do
391− argVar <- freshName
392− done'' <- go remain done'
393− js <- binderToJs argVar done'' binder
394− return (JSVariableIntroduction Nothing argVar (Just (JSAccessor Nothing (identToJs field) (JSVar Nothing varName))) : js)
395− binderToJs' _ _ ConstructorBinder{} =
396− internalError "binderToJs: Invalid ConstructorBinder in binderToJs"
397− binderToJs' varName done (NamedBinder _ ident binder) = do
398− js <- binderToJs varName done binder
399− return (JSVariableIntroduction Nothing (identToJs ident) (Just (JSVar Nothing varName)) : js)
400−
401− literalToBinderJS :: String -> [JS] -> Literal (Binder Ann) -> m [JS]
402− literalToBinderJS varName done (NumericLiteral num) =
403− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSVar Nothing varName) (JSNumericLiteral Nothing num)) (JSBlock Nothing done) Nothing]
404− literalToBinderJS varName done (CharLiteral c) =
405− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSVar Nothing varName) (JSStringLiteral Nothing [c])) (JSBlock Nothing done) Nothing]
406− literalToBinderJS varName done (StringLiteral str) =
407− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSVar Nothing varName) (JSStringLiteral Nothing str)) (JSBlock Nothing done) Nothing]
408− literalToBinderJS varName done (BooleanLiteral True) =
409− return [JSIfElse Nothing (JSVar Nothing varName) (JSBlock Nothing done) Nothing]
410− literalToBinderJS varName done (BooleanLiteral False) =
411− return [JSIfElse Nothing (JSUnary Nothing Not (JSVar Nothing varName)) (JSBlock Nothing done) Nothing]
412− literalToBinderJS varName done (ObjectLiteral bs) = go done bs
413− where
414− go :: [JS] -> [(String, Binder Ann)] -> m [JS]
415− go done' [] = return done'
416− go done' ((prop, binder):bs') = do
417− propVar <- freshName
418− done'' <- go done' bs'
419− js <- binderToJs propVar done'' binder
420− return (JSVariableIntroduction Nothing propVar (Just (accessorString prop (JSVar Nothing varName))) : js)
421− literalToBinderJS varName done (ArrayLiteral bs) = do
422− js <- go done 0 bs
423− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSAccessor Nothing "length" (JSVar Nothing varName)) (JSNumericLiteral Nothing (Left (fromIntegral $ length bs)))) (JSBlock Nothing js) Nothing]
424− where
425− go :: [JS] -> Integer -> [Binder Ann] -> m [JS]
426− go done' _ [] = return done'
427− go done' index (binder:bs') = do
428− elVar <- freshName
429− done'' <- go done' (index + 1) bs'
430− js <- binderToJs elVar done'' binder
431− return (JSVariableIntroduction Nothing elVar (Just (JSIndexer Nothing (JSNumericLiteral Nothing (Left index)) (JSVar Nothing varName))) : js)
432−
433− -- Check that all integers fall within the valid int range for JavaScript.
434− checkIntegers :: JS -> m ()
435− checkIntegers = void . everywhereOnJSTopDownM go
436− where
437− go :: JS -> m JS
438− go (JSUnary _ Negate (JSNumericLiteral ss (Left i))) =
439− -- Move the negation inside the literal; since this is a top-down
440− -- traversal doing this replacement will stop the next case from raising
441− -- the error when attempting to use -2147483648, as if left unrewritten
442− -- the value is `JSUnary Negate (JSNumericLiteral (Left 2147483648))`, and
443− -- 2147483648 is larger than the maximum allowed int.
444− return $ JSNumericLiteral ss (Left (-i))
445− go js@(JSNumericLiteral _ (Left i)) =
446− let minInt = -2147483648
447− maxInt = 2147483647
448− in if i < minInt || i > maxInt
449− then throwError . errorMessage $ IntOutOfRange i "JavaScript" minInt maxInt
450− else return js
451− 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 :: (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− name `elem`
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, 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, 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' euclideanRingInt 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.dataEuclideanRing, 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 euclideanRingNumber opDiv Divide
126− , binary euclideanRingInt 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 heytingAlgebraBoolean opConj And
163− , binary heytingAlgebraBoolean opDisj Or
164− , unary heytingAlgebraBoolean 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 :: (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−euclideanRingNumber :: [(String, String)]
275−euclideanRingNumber = [(C.prelude, C.moduloSemiringNumber), (C.dataEuclideanRing, C.euclideanRingNumber)]
276−
277−euclideanRingInt :: [(String, String)]
278−euclideanRingInt = [(C.prelude, C.moduloSemiringInt), (C.dataEuclideanRing, C.euclideanRingInt)]
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−heytingAlgebraBoolean :: [(String, String)]
317−heytingAlgebraBoolean = [(C.prelude, C.booleanAlgebraBoolean), (C.dataHeytingAlgebra, C.heytingAlgebraBoolean)]
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.dataEuclideanRing, C.div)]
357−
358−opMod :: [(String, String)]
359−opMod = [(C.prelude, C.mod), (C.dataEuclideanRing, C.mod)]
360−
361−opConj :: [(String, String)]
362−opConj = [(C.prelude, (C.&&)), (C.prelude, C.conj), (C.dataHeytingAlgebra, C.conj)]
363−
364−opDisj :: [(String, String)]
365−opDisj = [(C.prelude, (C.||)), (C.prelude, C.disj), (C.dataHeytingAlgebra, C.disj)]
366−
367−opNot :: [(String, String)]
368−opNot = [(C.prelude, C.not), (C.dataHeytingAlgebra, 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−382
@@ -1,382 +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−euclideanRingNumber :: String
251−euclideanRingNumber = "euclideanRingNumber"
252−
253−euclideanRingInt :: String
254−euclideanRingInt = "euclideanRingInt"
255−
256−ordBoolean :: String
257−ordBoolean = "ordBoolean"
258−
259−ordNumber :: String
260−ordNumber = "ordNumber"
261−
262−ordInt :: String
263−ordInt = "ordInt"
264−
265−ordString :: String
266−ordString = "ordString"
267−
268−ordChar :: String
269−ordChar = "ordChar"
270−
271−eqNumber :: String
272−eqNumber = "eqNumber"
273−
274−eqInt :: String
275−eqInt = "eqInt"
276−
277−eqString :: String
278−eqString = "eqString"
279−
280−eqChar :: String
281−eqChar = "eqChar"
282−
283−eqBoolean :: String
284−eqBoolean = "eqBoolean"
285−
286−boundedBoolean :: String
287−boundedBoolean = "boundedBoolean"
288−
289−booleanAlgebraBoolean :: String
290−booleanAlgebraBoolean = "booleanAlgebraBoolean"
291−
292−heytingAlgebraBoolean :: String
293−heytingAlgebraBoolean = "heytingAlgebraBoolean"
294−
295−semigroupString :: String
296−semigroupString = "semigroupString"
297−
298−semigroupoidFn :: String
299−semigroupoidFn = "semigroupoidFn"
300−
301−-- Generic Deriving
302−
303−generic :: String
304−generic = "Generic"
305−
306−toSpine :: String
307−toSpine = "toSpine"
308−
309−fromSpine :: String
310−fromSpine = "fromSpine"
311−
312−toSignature :: String
313−toSignature = "toSignature"
314−
315−-- Main module
316−
317−main :: String
318−main = "main"
319−
320−-- Code Generation
321−
322−__superclass_ :: String
323−__superclass_ = "__superclass_"
324−
325−__unused :: String
326−__unused = "__unused"
327−
328−-- Modules
329−
330−prim :: String
331−prim = "Prim"
332−
333−prelude :: String
334−prelude = "Prelude"
335−
336−dataArrayUnsafe :: String
337−dataArrayUnsafe = "Data_Array_Unsafe"
338−
339−eff :: String
340−eff = "Control_Monad_Eff"
341−
342−st :: String
343−st = "Control_Monad_ST"
344−
345−controlApplicative :: String
346−controlApplicative = "Control_Applicative"
347−
348−controlSemigroupoid :: String
349−controlSemigroupoid = "Control_Semigroupoid"
350−
351−controlBind :: String
352−controlBind = "Control_Bind"
353−
354−dataBounded :: String
355−dataBounded = "Data_Bounded"
356−
357−dataSemigroup :: String
358−dataSemigroup = "Data_Semigroup"
359−
360−dataHeytingAlgebra :: String
361−dataHeytingAlgebra = "Data_HeytingAlgebra"
362−
363−dataEq :: String
364−dataEq = "Data_Eq"
365−
366−dataOrd :: String
367−dataOrd = "Data_Ord"
368−
369−dataSemiring :: String
370−dataSemiring = "Data_Semiring"
371−
372−dataRing :: String
373−dataRing = "Data_Ring"
374−
375−dataEuclideanRing :: String
376−dataEuclideanRing = "Data_EuclideanRing"
377−
378−dataFunction :: String
379−dataFunction = "Data_Function"
380−
381−dataIntBits :: String
382−dataIntBits = "Data_Int_Bits"
src/Language/PureScript/CoreFn.hsdeleted−15
@@ -1,15 +0,0 @@
1−-- |
2−-- The core functional representation
3−--
4−module Language.PureScript.CoreFn (
5− module C
6−) where
7−
8−import Language.PureScript.CoreFn.Ann as C
9−import Language.PureScript.CoreFn.Binders as C
10−import Language.PureScript.CoreFn.Desugar as C
11−import Language.PureScript.CoreFn.Expr as C
12−import Language.PureScript.AST.Literals as C
13−import Language.PureScript.CoreFn.Meta as C
14−import Language.PureScript.CoreFn.Module as C
15−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.AST.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−278

This diff is too big to show here.

src/Language/PureScript/CoreFn/Expr.hsdeleted−121

This diff is too big to show here.

src/Language/PureScript/CoreFn/Meta.hsdeleted−40

This diff is too big to show here.

src/Language/PureScript/CoreFn/Module.hsdeleted−31

This diff is too big to show here.

src/Language/PureScript/CoreFn/Traversals.hsdeleted−75

This diff is too big to show here.

src/Language/PureScript/Crash.hsdeleted−9

This diff is too big to show here.

src/Language/PureScript/Docs.hsdeleted−14

This diff is too big to show here.

src/Language/PureScript/Docs/AsMarkdown.hsdeleted−142

This diff is too big to show here.

src/Language/PureScript/Docs/Convert.hsdeleted−195

This diff is too big to show here.

src/Language/PureScript/Docs/Convert/ReExports.hsdeleted−496

This diff is too big to show here.

src/Language/PureScript/Docs/Convert/Single.hsdeleted−236

This diff is too big to show here.

src/Language/PureScript/Docs/ParseAndBookmark.hsdeleted−102

This diff is too big to show here.

src/Language/PureScript/Docs/Render.hsdeleted−139

This diff is too big to show here.

src/Language/PureScript/Docs/RenderedCode.hsdeleted−11

This diff is too big to show here.

src/Language/PureScript/Docs/RenderedCode/Render.hsdeleted−211

This diff is too big to show here.

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

This diff is too big to show here.

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

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−1375

This diff is too big to show here.

src/Language/PureScript/Errors/JSON.hsdeleted−88

This diff is too big to show here.

src/Language/PureScript/Externs.hsdeleted−208

This diff is too big to show here.

src/Language/PureScript/Ide.hsdeleted−245

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Ide/Imports.hsdeleted−354

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Ide/Rebuild.hsdeleted−85

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

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−113

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Make.hsdeleted−472

This diff is too big to show here.

src/Language/PureScript/ModuleDependencies.hsdeleted−96

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−49

This diff is too big to show here.

src/Language/PureScript/Parser.hsdeleted−36

This diff is too big to show here.

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

This diff is too big to show here.

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

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−558

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−124

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−323

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−161

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Publish.hsdeleted−409

This diff is too big to show here.

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

This diff is too big to show here.

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

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−77

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−413

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Sugar/Operators/Types.hsdeleted−28

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−425

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−473

This diff is too big to show here.

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

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−254

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−765

This diff is too big to show here.

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

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−336

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-5.yamldeleted−7

This diff is too big to show here.

stack-nightly.yamldeleted−6

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−63

This diff is too big to show here.

tests/Language/PureScript/Ide/Imports/IntegrationSpec.hsdeleted−101

This diff is too big to show here.

tests/Language/PureScript/Ide/ImportsSpec.hsdeleted−128

This diff is too big to show here.

tests/Language/PureScript/Ide/Integration.hsdeleted−250

This diff is too big to show here.

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

This diff is too big to show here.

tests/Language/PureScript/Ide/RebuildSpec.hsdeleted−62

This diff is too big to show here.

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

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−44

This diff is too big to show here.

tests/PscIdeSpec.hsdeleted−1

This diff is too big to show here.

tests/TestCompiler.hsdeleted−182

This diff is too big to show here.

tests/TestDocs.hsdeleted−314

This diff is too big to show here.

tests/TestPscIde.hsdeleted−7

This diff is too big to show here.

tests/TestPscPublish.hsdeleted−78

This diff is too big to show here.

tests/TestPsci.hsdeleted−148

This diff is too big to show here.

tests/TestUtils.hsdeleted−88

This diff is too big to show here.

tests/support/.gitignoredeleted−2

This diff is too big to show here.

tests/support/bower.jsondeleted−11

This diff is too big to show here.

tests/support/package.jsondeleted−8

This diff is too big to show here.

tests/support/psci/Sample.pursdeleted

No changes to the content.

tests/support/pscide/.gitignoredeleted−7

This diff is too big to show here.

tests/support/pscide/src/ImportsSpec.pursdeleted−5

This diff is too big to show here.

tests/support/pscide/src/ImportsSpec1.pursdeleted−32

This diff is too big to show here.

tests/support/pscide/src/Main.pursdeleted−7

This diff is too big to show here.

tests/support/pscide/src/RebuildSpecDep.pursdeleted−3

This diff is too big to show here.

tests/support/pscide/src/RebuildSpecSingleModule.faildeleted−3

This diff is too big to show here.

tests/support/pscide/src/RebuildSpecSingleModule.pursdeleted−4

This diff is too big to show here.

tests/support/pscide/src/RebuildSpecWithDeps.pursdeleted−5

This diff is too big to show here.

tests/support/pscide/src/RebuildSpecWithForeign.jsdeleted−3

This diff is too big to show here.

tests/support/pscide/src/RebuildSpecWithForeign.pursdeleted−3

This diff is too big to show here.

tests/support/pscide/src/RebuildSpecWithMissingForeign.faildeleted−3

This diff is too big to show here.

tests/support/setup-win.cmddeleted−3

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.