git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
731 files changed+2699−41167
since splitsnapshots
unifiedsplit
.gitignore+3 .travis.yml−86 CONTRIBUTING.md−38 CONTRIBUTORS.md−87 ChangeLog.md+3 INSTALL.md−56 LICENSE+20−4516 README-go.md+48 README.md+32−20 Setup.hs−4 app/Main.hs+250 appveyor.yml−51 appveyor/cache-buster.txt−8 bundle/.gitignore−4 bundle/README−24 bundle/build.sh−65 core-tests/.gitignore−3 core-tests/bower.json−60 core-tests/test-everything.sh−33 core-tests/tests/GenericDeriving.purs−30 core-tests/tests/Main.purs−9 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−4 examples/docs/src/Clash1.purs−3 examples/docs/src/Clash1a.purs−9 examples/docs/src/Clash2.purs−3 examples/docs/src/Clash2a.purs−9 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−18 examples/docs/src/ImportedTwice.purs−13 examples/docs/src/ImportedTwiceA.purs−8 examples/docs/src/ImportedTwiceB.purs−4 examples/docs/src/MultiVirtual.purs−6 examples/docs/src/MultiVirtual1.purs−4 examples/docs/src/MultiVirtual2.purs−9 examples/docs/src/MultiVirtual3.purs−4 examples/docs/src/NewOperators.purs−5 examples/docs/src/NewOperators2.purs−6 examples/docs/src/NotAllCtors.purs−5 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−5 examples/docs/src/TypeClassWithoutMembersIntermediate.purs−5 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−6 examples/failing/1733/Thingy.purs−4 examples/failing/1825.purs−9 examples/failing/1881.purs−6 examples/failing/2128-class.purs−5 examples/failing/2128-instance.purs−8 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/ArgLengthMismatch.purs−7 examples/failing/ArrayType.purs−14 examples/failing/Arrays.purs−6 examples/failing/CannotDeriveNewtypeForData.purs−8 examples/failing/CaseBinderLengthsDiffer.purs−6 examples/failing/CaseDoesNotMatchAllConstructorArgs.purs−15 examples/failing/ConflictingExports.purs−6 examples/failing/ConflictingExports/A.purs−4 examples/failing/ConflictingExports/B.purs−4 examples/failing/ConflictingImports.purs−9 examples/failing/ConflictingImports/A.purs−4 examples/failing/ConflictingImports/B.purs−4 examples/failing/ConflictingImports2.purs−10 examples/failing/ConflictingImports2/A.purs−4 examples/failing/ConflictingImports2/B.purs−4 examples/failing/ConflictingQualifiedImports.purs−7 examples/failing/ConflictingQualifiedImports/A.purs−4 examples/failing/ConflictingQualifiedImports/B.purs−4 examples/failing/ConflictingQualifiedImports2.purs−5 examples/failing/ConflictingQualifiedImports2/A.purs−4 examples/failing/ConflictingQualifiedImports2/B.purs−4 examples/failing/ConstraintInference.purs−10 examples/failing/DctorOperatorAliasExport.purs−6 examples/failing/DeclConflictClassCtor.purs−6 examples/failing/DeclConflictClassSynonym.purs−8 examples/failing/DeclConflictClassType.purs−6 examples/failing/DeclConflictCtorClass.purs−6 examples/failing/DeclConflictCtorCtor.purs−6 examples/failing/DeclConflictSynonymClass.purs−8 examples/failing/DeclConflictSynonymType.purs−8 examples/failing/DeclConflictTypeClass.purs−6 examples/failing/DeclConflictTypeSynonym.purs−8 examples/failing/DeclConflictTypeType.purs−6 examples/failing/Do.purs−12 examples/failing/DoNotSuggestComposition.purs−13 examples/failing/DoNotSuggestComposition2.purs−7 examples/failing/DuplicateDeclarationsInLet.purs−12 examples/failing/DuplicateModule.purs−2 examples/failing/DuplicateModule/M1.purs−1 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/ExportConflictClass.purs−5 examples/failing/ExportConflictClass/A.purs−3 examples/failing/ExportConflictClass/B.purs−3 examples/failing/ExportConflictCtor.purs−5 examples/failing/ExportConflictCtor/A.purs−3 examples/failing/ExportConflictCtor/B.purs−3 examples/failing/ExportConflictType.purs−5 examples/failing/ExportConflictType/A.purs−3 examples/failing/ExportConflictType/B.purs−3 examples/failing/ExportConflictTypeOp.purs−5 examples/failing/ExportConflictTypeOp/A.purs−5 examples/failing/ExportConflictTypeOp/B.purs−5 examples/failing/ExportConflictValue.purs−5 examples/failing/ExportConflictValue/A.purs−4 examples/failing/ExportConflictValue/B.purs−4 examples/failing/ExportConflictValueOp.purs−5 examples/failing/ExportConflictValueOp/A.purs−6 examples/failing/ExportConflictValueOp/B.purs−6 examples/failing/ExportExplicit.purs−8 examples/failing/ExportExplicit1.purs−12 examples/failing/ExportExplicit1/M1.purs−3 examples/failing/ExportExplicit2.purs−8 examples/failing/ExportExplicit3.purs−10 examples/failing/ExportExplicit3/M1.purs−4 examples/failing/ExtraRecordField.purs−9 examples/failing/Foldable.purs−17 examples/failing/Generalization1.purs−11 examples/failing/Generalization2.purs−8 examples/failing/ImportExplicit.purs−4 examples/failing/ImportExplicit/M1.purs−3 examples/failing/ImportExplicit2.purs−4 examples/failing/ImportExplicit2/M1.purs−3 examples/failing/ImportHidingModule.purs−4 examples/failing/ImportHidingModule/A.purs−2 examples/failing/ImportHidingModule/B.purs−3 examples/failing/ImportModule.purs−4 examples/failing/ImportModule/M2.purs−3 examples/failing/InfiniteKind.purs−5 examples/failing/InfiniteType.purs−5 examples/failing/InstanceExport.purs−7 examples/failing/InstanceExport/InstanceExport.purs−11 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/MultipleTypeOpFixities.purs−9 examples/failing/MultipleValueOpFixities.purs−9 examples/failing/MutRec.purs−9 examples/failing/MutRec2.purs−6 examples/failing/NewtypeInstance.purs−8 examples/failing/NewtypeInstance2.purs−8 examples/failing/NewtypeInstance3.purs−8 examples/failing/NewtypeInstance4.purs−8 examples/failing/NewtypeInstance5.purs−8 examples/failing/NewtypeInstance6.purs−8 examples/failing/NewtypeMultiArgs.purs−6 examples/failing/NewtypeMultiCtor.purs−6 examples/failing/NonWildcardNewtypeInstance.purs−8 examples/failing/NullaryAbs.purs−6 examples/failing/Object.purs−8 examples/failing/OperatorAliasNoExport.purs−7 examples/failing/OperatorSections.purs−7 examples/failing/OrphanInstance.purs−7 examples/failing/OrphanInstance/Class.purs−4 examples/failing/OrphanTypeDecl.purs−4 examples/failing/OverlappingArguments.purs−6 examples/failing/OverlappingBinders.purs−9 examples/failing/OverlappingVars.purs−14 examples/failing/ProgrammableTypeErrors.purs−16 examples/failing/ProgrammableTypeErrorsTypeString.purs−18 examples/failing/Rank2Types.purs−8 examples/failing/RequiredHiddenType.purs−9 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−9 examples/failing/TypedBinders.purs−10 examples/failing/TypedBinders2.purs−9 examples/failing/TypedBinders3.purs−13 examples/failing/TypedHole.purs−9 examples/failing/UnderscoreModuleName.purs−6 examples/failing/UnknownType.purs−7 examples/passing/1185.purs−15 examples/passing/1335.purs−14 examples/passing/1570.purs−8 examples/passing/1664.purs−16 examples/passing/1697.purs−25 examples/passing/1807.purs−14 examples/passing/1881.purs−19 examples/passing/1991.purs−22 examples/passing/2018.purs−12 examples/passing/2018/A.purs−7 examples/passing/2018/B.purs−3 examples/passing/2049.purs−14 examples/passing/2138.purs−7 examples/passing/2138/Lib.purs−3 examples/passing/2172.js−5 examples/passing/2172.purs−10 examples/passing/2252.purs−15 examples/passing/652.purs−18 examples/passing/810.purs−14 examples/passing/862.purs−8 examples/passing/922.purs−20 examples/passing/Applicative.purs−16 examples/passing/ArrayType.purs−12 examples/passing/Auto.purs−16 examples/passing/AutoPrelude.purs−11 examples/passing/AutoPrelude2.purs−10 examples/passing/BindersInFunctions.purs−16 examples/passing/BindingGroups.purs−11 examples/passing/BlockString.purs−9 examples/passing/CaseInDo.purs−21 examples/passing/CaseInputWildcard.purs−18 examples/passing/CaseMultipleExpressions.purs−21 examples/passing/CaseStatement.purs−22 examples/passing/CheckFunction.purs−8 examples/passing/CheckSynonymBug.purs−13 examples/passing/CheckTypeClass.purs−18 examples/passing/Church.purs−18 examples/passing/ClassRefSyntax.purs−9 examples/passing/ClassRefSyntax/Lib.purs−4 examples/passing/Collatz.purs−21 examples/passing/Comparisons.purs−15 examples/passing/Conditional.purs−9 examples/passing/Console.purs−15 examples/passing/ConstraintInference.purs−10 examples/passing/ConstraintParsingIssue.purs−9 examples/passing/ContextSimplification.purs−15 examples/passing/DataAndType.purs−10 examples/passing/DctorOperatorAlias.purs−34 examples/passing/DctorOperatorAlias/List.purs−5 examples/passing/DeepArrayBinder.purs−17 examples/passing/DeepCase.purs−15 examples/passing/DeriveNewtype.purs−27 examples/passing/Deriving.purs−34 examples/passing/Do.purs−68 examples/passing/Dollar.purs−16 examples/passing/Eff.purs−26 examples/passing/EmptyDataDecls.purs−20 examples/passing/EmptyRow.purs−11 examples/passing/EmptyTypeClass.purs−11 examples/passing/EqOrd.purs−18 examples/passing/ExplicitImportReExport.purs−11 examples/passing/ExplicitImportReExport/Bar.purs−3 examples/passing/ExplicitImportReExport/Foo.purs−4 examples/passing/ExplicitOperatorSections.purs−15 examples/passing/ExportExplicit.purs−10 examples/passing/ExportExplicit/M1.purs−10 examples/passing/ExportExplicit2.purs−8 examples/passing/ExportExplicit2/M1.purs−7 examples/passing/ExportedInstanceDeclarations.purs−45 examples/passing/ExtendedInfixOperators.purs−17 examples/passing/Fib.purs−18 examples/passing/FieldConsPuns.purs−13 examples/passing/FieldPuns.purs−10 examples/passing/FinalTagless.purs−25 examples/passing/FunWithFunDeps.js−32 examples/passing/FunWithFunDeps.purs−41 examples/passing/FunctionScope.purs−13 examples/passing/FunctionalDependencies.purs−21 examples/passing/Functions.purs−12 examples/passing/Functions2.purs−13 examples/passing/GHCGenerics.purs−140 examples/passing/Generalization1.purs−11 examples/passing/Guards.purs−30 examples/passing/HoistError.purs−12 examples/passing/IfThenElseMaybe.purs−12 examples/passing/IfWildcard.purs−19 examples/passing/ImplicitEmptyImport.purs−9 examples/passing/Import.purs−6 examples/passing/Import/M1.purs−8 examples/passing/Import/M2.purs−6 examples/passing/ImportExplicit.purs−10 examples/passing/ImportExplicit/M1.purs−4 examples/passing/ImportHiding.purs−19 examples/passing/ImportQualified.purs−8 examples/passing/ImportQualified/M1.purs−3 examples/passing/InferRecFunWithConstrainedArgument.purs−11 examples/passing/InstanceBeforeClass.purs−12 examples/passing/IntAndChar.purs−19 examples/passing/JSReserved.purs−13 examples/passing/KindedType.purs−34 examples/passing/LargeSumType.purs−35 examples/passing/Let.purs−58 examples/passing/Let2.purs−20 examples/passing/LetInInstance.purs−15 examples/passing/LiberalTypeSynonyms.purs−22 examples/passing/MPTCs.purs−21 examples/passing/Match.purs−10 examples/passing/Module.purs−7 examples/passing/Module/M1.purs−14 examples/passing/Module/M2.purs−10 examples/passing/ModuleDeps.purs−6 examples/passing/ModuleDeps/M1.purs−5 examples/passing/ModuleDeps/M2.purs−5 examples/passing/ModuleDeps/M3.purs−3 examples/passing/ModuleExport.purs−8 examples/passing/ModuleExport/A.purs−3 examples/passing/ModuleExportDupes.purs−11 examples/passing/ModuleExportDupes/A.purs−3 examples/passing/ModuleExportDupes/B.purs−3 examples/passing/ModuleExportDupes/C.purs−4 examples/passing/ModuleExportExcluded.purs−11 examples/passing/ModuleExportExcluded/A.purs−6 examples/passing/ModuleExportQualified.purs−9 examples/passing/ModuleExportQualified/A.purs−3 examples/passing/ModuleExportSelf.purs−11 examples/passing/ModuleExportSelf/A.purs−5 examples/passing/Monad.purs−32 examples/passing/MonadState.purs−63 examples/passing/MultiArgFunctions.purs−27 examples/passing/MutRec.purs−20 examples/passing/MutRec2.purs−20 examples/passing/MutRec3.purs−20 examples/passing/NakedConstraint.purs−10 examples/passing/NamedPatterns.purs−10 examples/passing/NegativeBinder.purs−10 examples/passing/NegativeIntInRange.purs−9 examples/passing/Nested.purs−10 examples/passing/NestedTypeSynonyms.purs−12 examples/passing/NestedWhere.purs−13 examples/passing/Newtype.purs−23 examples/passing/NewtypeClass.purs−39 examples/passing/NewtypeEff.purs−29 examples/passing/NewtypeInstance.purs−41 examples/passing/NewtypeWithRecordUpdate.purs−16 examples/passing/NonConflictingExports.purs−10 examples/passing/NonConflictingExports/A.purs−4 examples/passing/NumberLiterals.purs−39 examples/passing/ObjectGetter.purs−14 examples/passing/ObjectSynonym.purs−16 examples/passing/ObjectUpdate.purs−23 examples/passing/ObjectUpdate2.purs−18 examples/passing/ObjectUpdater.purs−26 examples/passing/ObjectWildcards.purs−20 examples/passing/Objects.purs−36 examples/passing/OneConstructor.purs−10 examples/passing/OperatorAlias.purs−11 examples/passing/OperatorAliasElsewhere.purs−9 examples/passing/OperatorAliasElsewhere/Def.purs−4 examples/passing/OperatorAssociativity.purs−25 examples/passing/OperatorInlining.purs−48 examples/passing/OperatorSections.purs−18 examples/passing/Operators.purs−91 examples/passing/Operators/Other.purs−7 examples/passing/OptimizerBug.purs−10 examples/passing/OptionalQualified.purs−12 examples/passing/OverlappingInstances.purs−17 examples/passing/OverlappingInstances2.purs−27 examples/passing/OverlappingInstances3.purs−20 examples/passing/ParensInTypedBinder.purs−20 examples/passing/PartialFunction.purs−11 examples/passing/Patterns.purs−23 examples/passing/PendingConflictingImports.purs−8 examples/passing/PendingConflictingImports/A.purs−4 examples/passing/PendingConflictingImports/B.purs−4 examples/passing/PendingConflictingImports2.purs−10 examples/passing/PendingConflictingImports2/A.purs−4 examples/passing/Person.purs−12 examples/passing/PrimedTypeName.purs−20 examples/passing/QualifiedNames.purs−11 examples/passing/QualifiedNames/Either.purs−5 examples/passing/QualifiedQualifiedImports.purs−6 examples/passing/Rank2Data.purs−30 examples/passing/Rank2Object.purs−11 examples/passing/Rank2TypeSynonym.purs−17 examples/passing/Rank2Types.purs−12 examples/passing/ReExportQualified.purs−7 examples/passing/ReExportQualified/A.purs−3 examples/passing/ReExportQualified/B.purs−3 examples/passing/ReExportQualified/C.purs−4 examples/passing/RebindableSyntax.purs−43 examples/passing/Recursion.purs−11 examples/passing/RedefinedFixity.purs−6 examples/passing/RedefinedFixity/M1.purs−6 examples/passing/RedefinedFixity/M2.purs−5 examples/passing/RedefinedFixity/M3.purs−6 examples/passing/ReservedWords.purs−19 examples/passing/ResolvableScopeConflict.purs−13 examples/passing/ResolvableScopeConflict/A.purs−4 examples/passing/ResolvableScopeConflict/B.purs−7 examples/passing/ResolvableScopeConflict2.purs−15 examples/passing/ResolvableScopeConflict2/A.purs−7 examples/passing/ResolvableScopeConflict3.purs−9 examples/passing/ResolvableScopeConflict3/A.purs−4 examples/passing/RowConstructors.purs−43 examples/passing/RowPolyInstanceContext.purs−23 examples/passing/RowsInInstanceContext.purs−25 examples/passing/RuntimeScopeIssue.purs−22 examples/passing/ScopedTypeVariables.purs−37 examples/passing/Sequence.purs−16 examples/passing/SequenceDesugared.purs−38 examples/passing/ShadowedModuleName.purs−8 examples/passing/ShadowedModuleName/Test.purs−6 examples/passing/ShadowedName.purs−11 examples/passing/ShadowedRename.purs−14 examples/passing/ShadowedTCO.purs−21 examples/passing/ShadowedTCOLet.purs−15 examples/passing/SignedNumericLiterals.purs−18 examples/passing/Stream.purs−26 examples/passing/StringEscapes.purs−17 examples/passing/Superclasses1.purs−23 examples/passing/Superclasses3.purs−41 examples/passing/TCO.purs−20 examples/passing/TCOCase.purs−13 examples/passing/TailCall.purs−20 examples/passing/Tick.purs−8 examples/passing/TopLevelCase.purs−19 examples/passing/TransitiveImport.purs−9 examples/passing/TransitiveImport/Middle.purs−5 examples/passing/TransitiveImport/Test.purs−9 examples/passing/TypeClassMemberOrderChange.purs−16 examples/passing/TypeClasses.purs−71 examples/passing/TypeClassesInOrder.purs−12 examples/passing/TypeClassesWithOverlappingTypeVariables.purs−12 examples/passing/TypeDecl.purs−13 examples/passing/TypeOperators.purs−20 examples/passing/TypeOperators/A.purs−22 examples/passing/TypeSynonymInData.purs−12 examples/passing/TypeSynonyms.purs−28 examples/passing/TypeWildcards.purs−16 examples/passing/TypeWildcardsRecordExtension.purs−9 examples/passing/TypeWithoutParens.purs−12 examples/passing/TypeWithoutParens/Lib.purs−4 examples/passing/TypedBinders.purs−68 examples/passing/TypedWhere.purs−18 examples/passing/UTF8Sourcefile.purs−8 examples/passing/UnderscoreIdent.purs−13 examples/passing/UnicodeIdentifier.purs−7 examples/passing/UnicodeOperators.purs−22 examples/passing/UnicodeType.purs−22 examples/passing/UnifyInTypeInstanceLookup.purs−25 examples/passing/Unit.purs−8 examples/passing/UnknownInTypeClassLookup.purs−15 examples/passing/UntupledConstraints.purs−17 examples/passing/Where.purs−49 examples/passing/WildcardInInstance.purs−23 examples/passing/WildcardType.purs−12 examples/passing/iota.purs−11 examples/passing/s.purs−8 examples/warning/DuplicateExportRef.purs−30 examples/warning/DuplicateImport.purs−10 examples/warning/DuplicateImportRef.purs−18 examples/warning/DuplicateSelectiveImport.purs−10 examples/warning/HidingImport.purs−9 examples/warning/ImplicitImport.purs−9 examples/warning/ImplicitQualifiedImport.purs−11 examples/warning/MissingTypeDeclaration.purs−4 examples/warning/OverlappingInstances.purs−17 examples/warning/OverlappingPattern.purs−15 examples/warning/ScopeShadowing.purs−13 examples/warning/ShadowedTypeVar.purs−5 examples/warning/UnnecessaryFFIModule.js−1 examples/warning/UnnecessaryFFIModule.purs−5 examples/warning/UnusedDctorExplicitImport.purs−8 examples/warning/UnusedDctorImportAll.purs−7 examples/warning/UnusedDctorImportExplicit.purs−7 examples/warning/UnusedExplicitImport.purs−8 examples/warning/UnusedExplicitImportTypeOp.purs−9 examples/warning/UnusedExplicitImportTypeOp/Lib.purs−8 examples/warning/UnusedExplicitImportValOp.purs−8 examples/warning/UnusedFFIImplementations.js−2 examples/warning/UnusedFFIImplementations.purs−4 examples/warning/UnusedImport.purs−14 examples/warning/UnusedTypeVar.purs−5 examples/warning/WildcardInferredType.purs−23 hierarchy/Main.hs−118 license-generator/generate.hs−46 license-generator/header.txt−15 logo.png make_release_notes−2 package.yaml+86 psc-bundle/Main.hs−122 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−49 psc-ide-server/Main.hs−159 psc-ide-server/PROTOCOL.md−568 psc-ide-server/README.md−44 psc-publish/Main.hs−53 psc/Main.hs−181 psci/Main.hs−364 psci/static/index.html−10 psci/static/index.js−63 psgo.cabal+145 purescript.cabal−530 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−59 src/Control/Monad/Supply.hs−32 src/Control/Monad/Supply/Class.hs−28 src/Language/PureScript.hs−36 src/Language/PureScript/AST.hs−14 src/Language/PureScript/AST/Binders.hs−83 src/Language/PureScript/AST/Declarations.hs−635 src/Language/PureScript/AST/Exported.hs−154 src/Language/PureScript/AST/Literals.hs−37 src/Language/PureScript/AST/Operators.hs−53 src/Language/PureScript/AST/SourcePos.hs−80 src/Language/PureScript/AST/Traversals.hs−588 src/Language/PureScript/Bundle.hs−635 src/Language/PureScript/CodeGen.hs−8 src/Language/PureScript/CodeGen/JS.hs−449 src/Language/PureScript/CodeGen/JS/AST.hs−403 src/Language/PureScript/CodeGen/JS/Common.hs−232 src/Language/PureScript/CodeGen/JS/Optimizer.hs−73 src/Language/PureScript/CodeGen/JS/Optimizer/Blocks.hs−32 src/Language/PureScript/CodeGen/JS/Optimizer/Common.hs−82 src/Language/PureScript/CodeGen/JS/Optimizer/Inliner.hs−368 src/Language/PureScript/CodeGen/JS/Optimizer/MagicDo.hs−136 src/Language/PureScript/CodeGen/JS/Optimizer/TCO.hs−120 src/Language/PureScript/CodeGen/JS/Optimizer/Unused.hs−35 src/Language/PureScript/Comments.hs−17 src/Language/PureScript/Constants.hs−398 src/Language/PureScript/CoreFn.hs−15 src/Language/PureScript/CoreFn/Ann.hs−25 src/Language/PureScript/CoreFn/Binders.hs−42 src/Language/PureScript/CoreFn/Desugar.hs−270 src/Language/PureScript/CoreFn/Expr.hs−121 src/Language/PureScript/CoreFn/Meta.hs−42 src/Language/PureScript/CoreFn/Module.hs−22 src/Language/PureScript/CoreFn/ToJSON.hs−116 src/Language/PureScript/CoreFn/Traversals.hs−77 src/Language/PureScript/Crash.hs−11 src/Language/PureScript/Docs.hs−14 src/Language/PureScript/Docs/AsMarkdown.hs−136 src/Language/PureScript/Docs/Convert.hs−192 src/Language/PureScript/Docs/Convert/ReExports.hs−510 src/Language/PureScript/Docs/Convert/Single.hs−200 src/Language/PureScript/Docs/ParseAndBookmark.hs−98 src/Language/PureScript/Docs/Render.hs−146 src/Language/PureScript/Docs/RenderedCode.hs−8 src/Language/PureScript/Docs/RenderedCode/Render.hs−212 src/Language/PureScript/Docs/RenderedCode/Types.hs−202 src/Language/PureScript/Docs/Types.hs−595 src/Language/PureScript/Docs/Utils/MonoidExtras.hs−9 src/Language/PureScript/Environment.hs−292 src/Language/PureScript/Errors.hs−1279 src/Language/PureScript/Errors/JSON.hs−73 src/Language/PureScript/Externs.hs−227 src/Language/PureScript/Ide.hs−196 src/Language/PureScript/Ide/CaseSplit.hs−150 src/Language/PureScript/Ide/Command.hs−148 src/Language/PureScript/Ide/Completion.hs−31 src/Language/PureScript/Ide/Conversions.hs−41 src/Language/PureScript/Ide/Error.hs−54 src/Language/PureScript/Ide/Externs.hs−133 src/Language/PureScript/Ide/Filter.hs−92 src/Language/PureScript/Ide/Imports.hs−338 src/Language/PureScript/Ide/Matcher.hs−124 src/Language/PureScript/Ide/Pursuit.hs−75 src/Language/PureScript/Ide/Rebuild.hs−164 src/Language/PureScript/Ide/Reexports.hs−113 src/Language/PureScript/Ide/SourceFile.hs−127 src/Language/PureScript/Ide/State.hs−273 src/Language/PureScript/Ide/Types.hs−294 src/Language/PureScript/Ide/Util.hs−113 src/Language/PureScript/Ide/Watcher.hs−49 src/Language/PureScript/Interactive.hs−289 src/Language/PureScript/Interactive/Completion.hs−222 src/Language/PureScript/Interactive/Directive.hs−100 src/Language/PureScript/Interactive/IO.hs−41 src/Language/PureScript/Interactive/Message.hs−52 src/Language/PureScript/Interactive/Module.hs−99 src/Language/PureScript/Interactive/Parser.hs−122 src/Language/PureScript/Interactive/Printer.hs−127 src/Language/PureScript/Interactive/Types.hs−145 src/Language/PureScript/Kinds.hs−46 src/Language/PureScript/Linter.hs−97 src/Language/PureScript/Linter/Exhaustive.hs−345 src/Language/PureScript/Linter/Imports.hs−364 src/Language/PureScript/Make.hs−479 src/Language/PureScript/ModuleDependencies.hs−100 src/Language/PureScript/Names.hs−205 src/Language/PureScript/Options.hs−42 src/Language/PureScript/Parser.hs−23 src/Language/PureScript/Parser/Common.hs−144 src/Language/PureScript/Parser/Declarations.hs−586 src/Language/PureScript/Parser/Kinds.hs−38 src/Language/PureScript/Parser/Lexer.hs−571 src/Language/PureScript/Parser/State.hs−18 src/Language/PureScript/Parser/Types.hs−126 src/Language/PureScript/Pretty.hs−17 src/Language/PureScript/Pretty/Common.hs−159 src/Language/PureScript/Pretty/JS.hs−308 src/Language/PureScript/Pretty/Kinds.hs−52 src/Language/PureScript/Pretty/Types.hs−170 src/Language/PureScript/Pretty/Values.hs−187 src/Language/PureScript/Publish.hs−411 src/Language/PureScript/Publish/BoxesHelpers.hs−44 src/Language/PureScript/Publish/ErrorsWarnings.hs−429 src/Language/PureScript/Publish/Utils.hs−41 src/Language/PureScript/Renamer.hs−191 src/Language/PureScript/Sugar.hs−67 src/Language/PureScript/Sugar/BindingGroups.hs−221 src/Language/PureScript/Sugar/CaseDeclarations.hs−188 src/Language/PureScript/Sugar/DoNotation.hs−63 src/Language/PureScript/Sugar/Names.hs−335 src/Language/PureScript/Sugar/Names/Common.hs−68 src/Language/PureScript/Sugar/Names/Env.hs−400 src/Language/PureScript/Sugar/Names/Exports.hs−305 src/Language/PureScript/Sugar/Names/Imports.hs−237 src/Language/PureScript/Sugar/ObjectWildcards.hs−99 src/Language/PureScript/Sugar/Operators.hs−415 src/Language/PureScript/Sugar/Operators/Binders.hs−26 src/Language/PureScript/Sugar/Operators/Common.hs−79 src/Language/PureScript/Sugar/Operators/Expr.hs−44 src/Language/PureScript/Sugar/Operators/Types.hs−27 src/Language/PureScript/Sugar/TypeClasses.hs−336 src/Language/PureScript/Sugar/TypeClasses/Deriving.hs−523 src/Language/PureScript/Sugar/TypeDeclarations.hs−63 src/Language/PureScript/Traversals.hs−27 src/Language/PureScript/TypeChecker.hs−437 src/Language/PureScript/TypeChecker/Entailment.hs−424 src/Language/PureScript/TypeChecker/Kinds.hs−266 src/Language/PureScript/TypeChecker/Monad.hs−303 src/Language/PureScript/TypeChecker/Rows.hs−53 src/Language/PureScript/TypeChecker/Skolems.hs−127 src/Language/PureScript/TypeChecker/Subsumption.hs−146 src/Language/PureScript/TypeChecker/Synonyms.hs−47 src/Language/PureScript/TypeChecker/Types.hs−762 src/Language/PureScript/TypeChecker/Unify.hs−187 src/Language/PureScript/TypeClassDictionaries.hs−24 src/Language/PureScript/Types.hs−323 src/System/IO/UTF8.hs−14 src/Tests.hs+141 stack-ghc-8.0.yaml−7 stack.nix+23 stack.yaml+23−2 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−52 tests/Language/PureScript/Ide/Imports/IntegrationSpec.hs−83 tests/Language/PureScript/Ide/ImportsSpec.hs−130 tests/Language/PureScript/Ide/Integration.hs−273 tests/Language/PureScript/Ide/MatcherSpec.hs−49 tests/Language/PureScript/Ide/RebuildSpec.hs−57 tests/Language/PureScript/Ide/ReexportsSpec.hs−64 tests/Language/PureScript/Ide/SourceFile/IntegrationSpec.hs−41 tests/Language/PureScript/Ide/SourceFileSpec.hs−50 tests/Language/PureScript/Ide/StateSpec.hs−51 tests/Main.hs−44 tests/PscIdeSpec.hs−1 tests/TestCompiler.hs−286 tests/TestDocs.hs−310 tests/TestPscIde.hs−15 tests/TestPscPublish.hs−78 tests/TestPsci.hs−137 tests/TestUtils.hs−101 tests/support/.gitignore−2 tests/support/bower.json−13 tests/support/package.json−8 tests/support/psci/Sample.purs tests/support/pscide/.gitignore−7 tests/support/pscide/src/ImportsSpec.purs−3 tests/support/pscide/src/ImportsSpec1.purs−32 tests/support/pscide/src/MatcherSpec.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−1 tests/support/pscide/src/RebuildSpecWithForeign.purs−3 tests/support/pscide/src/RebuildSpecWithHiddenIdent.purs−6 tests/support/pscide/src/RebuildSpecWithMissingForeign.fail−3 tests/support/pscide/src/SourceFileSpec.purs−10 tests/support/setup-win.cmd−3 travis/build.sh−59 travis/convert-os-name.sh−14
.gitignore+3
@@ -14,7 +14,10 @@ bower_components/
1414node_modules
1515tmp/
1616.stack-work/
17+stack.yaml.lock
1718output
1819examples/docs/docs/
1920core-tests/full-core-docs.md
2021.psc-ide-port
22+.vscode/
23+result
.travis.ymldeleted−86
@@ -1,86 +0,0 @@
1−language: c
2−dist: trusty # because of perf issues
3−sudo: required
4−matrix:
5− include:
6− # The 'compiler' key is a hack to get Travis to use different caches for
7− # each job in a build, in order to avoid the separate jobs stomping on each
8− # other's caches. See https://github.com/travis-ci/travis-ci/issues/4393
9− #
10− # We use trusty boxes because they seem to be a bit faster.
11− - compiler: cc-linux-lts-normal
12− os: linux
13− dist: trusty
14− sudo: required
15− env: BUILD_TYPE=normal DEPLOY=true
16−
17− # - compiler: cc-linux-nightly-normal
18− # os: linux
19− # dist: trusty
20− # sudo: required
21− # env: BUILD_TYPE=normal STACKAGE_NIGHTLY=true
22− # allow_failures: true
23−
24− - compiler: cc-linux-ghc8.0-normal
25− os: linux
26− dist: trusty
27− sudo: required
28− env: BUILD_TYPE=normal STACK_YAML=stack-ghc-8.0.yaml
29−
30− - compiler: cc-linux-lts-sdist
31− os: linux
32− dist: trusty
33− sudo: required
34− env: BUILD_TYPE=sdist COVERAGE=true
35−
36− - compiler: cc-linux-lts-haddock
37− os: linux
38− dist: trusty
39− sudo: required
40− env: BUILD_TYPE=haddock
41−
42− - compiler: cc-osx-lts-normal
43− os: osx
44− env: BUILD_TYPE=normal DEPLOY=true
45−
46− - compiler: cc-osx-lts-sdist
47− os: osx
48− env: BUILD_TYPE=sdist
49−addons:
50− apt:
51− packages:
52− - libgmp-dev
53−cache:
54− directories:
55− - $HOME/.local/bin
56− - $HOME/.stack
57−install:
58−- | # Install stack.
59− if test ! -f "$HOME/.local/bin/stack"
60− then
61− URL="https://www.stackage.org/stack/$TRAVIS_OS_NAME-x86_64"
62− curl --location "$URL" > stack.tar.gz
63− gunzip stack.tar.gz
64− tar -x -f stack.tar --strip-components 1
65− mkdir -p "$HOME/.local/bin"
66− mv stack "$HOME/.local/bin/"
67− fi
68−- npm install -g bower # for psc-docs / psc-publish tests
69−# Fix the CC environment variable, because Travis changes it
70−- export CC=gcc
71−- export OS_NAME=$(./travis/convert-os-name.sh)
72−script:
73−- travis/build.sh
74−before_deploy:
75−- ./bundle/build.sh $OS_NAME
76−deploy:
77− provider: releases
78− api_key: $RELEASE_KEY
79− file:
80− - bundle/$OS_NAME.tar.gz
81− - bundle/$OS_NAME.sha
82− skip_cleanup: true
83− on:
84− all_branches: true
85− tags: true
86− condition: "$DEPLOY = true"
CONTRIBUTING.mddeleted−38
@@ -1,38 +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 `stack build`
15−- Run the test suite with `stack test`. You will need `npm` and `node` on your PATH to run the tests.
16−- Build the core libraries by running the script in `core-tests`.
17−
18−## Code Review
19−
20−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.
21−
22−## Adding Dependencies
23−
24−Because the PureScript compiler is distributed in binary form, we include
25−the licenses of all dependencies, including transitive ones, in the LICENSE
26−file. Therefore, whenever the dependencies change, the LICENSE file should be
27−updated.
28−
29−This can be automated; see the `license-generator/generate.hs` file.
30−
31−## Writing Issues
32−
33−- If the issue is actually a question, please consider asking on Reddit, Stack Overflow or IRC first.
34−- Please include a minimal, repeatable test case with any bug report.
35−
36−## Copyright and Licensing
37−
38−For any code change, please append a copyright and licensing notice to the [CONTRIBUTORS.md](CONTRIBUTORS.md) file.
CONTRIBUTORS.mddeleted−87
@@ -1,87 +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−- [@andreypopp](https://github.com/andreypopp) (Andrey Popp) My existing contributions and all future contributions until further notice are Copyright Andrey Popp, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
9−- [@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).
10−- [@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
11−- [@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).
12−- [@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).
13−- [@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).
14−- [@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.
15−- [@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.
16−- [@bmjames](https://github.com/bmjames) (Ben James) My existing contributions and all future contributions until further notice are Copyright Ben James, 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−- [@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).
18−- [@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).
19−- [@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).
20−- [@charleso](https://github.com/charleso) (Charles O'Farrell) My existing contributions to the PureScript compiler and all future contributions to the PureScript compiler until further notice, are Copyright Charles O'Farrell, 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−- [@chrisdone](https://github.com/chrisdone) (Chris Done) - My existing contributions and all future contributions until further notice are Copyright Chris Done, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
22−- [@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).
23−- [@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).
24−- [@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).
25−- [@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).
26−- [@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).
27−- [@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).
28−- [@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.
29−- [@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
30−- [@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).
31−- [@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).
32−- [@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).
33−- [@felixSchl](https://github.com/felixSchl) (Felix Schlitter) My existing contributions and all future contributions until further notice are Copyright Felix Schlitter, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
34−- [@FrigoEU](https://github.com/FrigoEU) (Simon Van Casteren) My existing contributions and all future contributions until further notice are Copyright Simon Van Casteren, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](http://opensource.org/licenses/MIT).
35−- [@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).
36−- [@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).
37−- [@ianbollinger](https://github.com/ianbollinger) (Ian D. Bollinger) My existing contributions and all future contributions until further notice are Copyright Ian D. Bollinger, 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−- [@ilovezfs](https://github.com/ilovezfs) - My existing contributions and all future contributions until further notice are Copyright ilovezfs, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license
39−- [@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).
40−- [@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).
41−- [@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).
42−- [@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.
43−- [@kika](https://github.com/kika) (Kirill Pertsev) - My existing contributions and all future contributions until further notice are Copyright Kirill Pertsev, and are licensed to the owners and users of the PureScript compiler project under the terms of the MIT license.
44−- [@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.
45−- [@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).
46−- [@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).
47−- [@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).
48−- [@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).
49−- [@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).
50−- [@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).
51−- [@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.
52−- [@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).
53−- [@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).
54−- [@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).
55−- [@nagisa](https://github.com/nagisa) I hereby release my [only contribution](https://github.com/purescript/purescript/commit/80287a5d0de619862d3b4cda9c1ee276d18fdcd8) into public domain.
56−- [@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).
57−- [@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).
58−- [@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).
59−- [@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).
60−- [@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.
61−- [@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).
62−- [@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).
63−- [@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).
64−- [@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).
65−- [@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).
66−- [@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).
67−- [@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).
68−- [@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.
69−- [@rightfold](https://github.com/rightfold) (rightfold) My existing contributions and all future contributions until further notice are Copyright rightfold, and are licensed to the owners and users of the PureScript compiler project under the terms of the [MIT license](https://opensource.org/licenses/MIT).
70−- [@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).
71−- [@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).
72−- [@rvion](https://github.com/rvion) (Rémi Vion) My existing contributions and all future contributions until further notice are Copyright Rémi Vion, 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−- [@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.
74−- [@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).
75−- [@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).
76−- [@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).
77−- [@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).
78−- [@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).
79−- [@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).
80−- [@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).
81−- [@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).
82−- [@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.
83−- [@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).
84−
85−### Companies
86−
87−- [@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−56
@@ -1,56 +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 update
31−$ stack unpack purescript
32−$ cd purescript-x.y.z # (replace x.y.z with whichever version you just downloaded)
33−$ stack install
34−```
35−
36−This will then copy the compiler and utilities into `~/.local/bin`.
37−
38−
39−If you don't have stack installed, there are install instructions
40−[here](https://github.com/commercialhaskell/stack/blob/master/doc/install_and_upgrade.md).
41−
42−If you don't have ghc installed, stack will prompt you to run `stack setup`
43−which will install ghc for you.
44−
45−## The "curses" library
46−
47−`psci` depends on the `curses` library (via the Haskell package `terminfo`). If
48−you are having difficulty running the compiler, it may be because the `curses`
49−library is missing.
50−
51−On Linux, you will probably need to install `ncurses` manually. On Ubuntu, for
52−example, this can be done by running:
53−
54−```
55−$ sudo apt-get install libncurses5-dev
56−```
LICENSE+20−4516
@@ -1,4526 +1,30 @@
1−Copyright (c) 2013-16 Phil Freeman, (c) 2014-2016 Gary Burgess, and other
2−contributors
3−All rights reserved.
4−
5−Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
6−
7−1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
8−
9−2. 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.
10−
11−3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
12−
13−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 HOLDER 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.
14−
15−PureScript uses the following Haskell library packages. Their license files follow.
16−
17− Glob
18− SHA
19− aeson
20− aeson-better-errors
21− aeson-pretty
22− ansi-terminal
23− ansi-wl-pprint
24− appar
25− array
26− asn1-encoding
27− asn1-parse
28− asn1-types
29− async
30− attoparsec
31− auto-update
32− base
33− base-compat
34− base64-bytestring
35− binary
36− blaze-builder
37− blaze-html
38− blaze-markup
39− bower-json
40− boxes
41− byteable
42− byteorder
43− bytestring
44− bytestring-builder
45− case-insensitive
46− cereal
47− clock
48− cmdargs
49− conduit
50− conduit-extra
51− connection
52− containers
53− cookie
54− cryptonite
55− data-default-class
56− data-ordlist
57− deepseq
58− directory
59− dlist
60− easy-file
61− edit-distance
62− entropy
63− exceptions
64− fail
65− fast-logger
66− file-embed
67− filepath
68− fsnotify
69− ghc-prim
70− hashable
71− haskeline
72− hex
73− hfsevents
74− hourglass
75− http-client
76− http-client-tls
77− http-date
78− http-types
79− http2
80− integer-gmp
81− iproute
82− language-javascript
83− lifted-base
84− memory
85− mime-types
86− mmorph
87− monad-control
88− monad-logger
89− monad-loops
90− mtl
91− network
92− network-uri
93− old-locale
94− old-time
95− optparse-applicative
96− parallel
97− parsec
98− pattern-arrows
99− pem
100− pipes
101− pipes-http
102− primitive
103− process
104− protolude
105− psqueues
106− random
107− regex-base
108− regex-tdfa
109− resourcet
110− safe
111− scientific
112− semigroups
113− simple-sendfile
114− socks
115− sourcemap
116− spdx
117− split
118− stm
119− stm-chans
120− streaming-commons
121− stringsearch
122− syb
123− tagged
124− template-haskell
125− terminfo
126− text
127− time
128− time-locale-compat
129− tls
130− transformers
131− transformers-base
132− transformers-compat
133− unix
134− unix-compat
135− unix-time
136− unordered-containers
137− utf8-string
138− vault
139− vector
140− void
141− wai
142− wai-app-static
143− wai-extra
144− wai-logger
145− wai-websockets
146− warp
147− websockets
148− word8
149− x509
150− x509-store
151− x509-system
152− x509-validation
153− zlib
154−
155−Glob LICENSE file:
156−
157− The code in Glob is released under the license below. Copyrights to parts of
158− the code are held by whoever wrote the code in question: see CREDITS.txt for a
159− list of authors.
160−
161− Copyright (c) 2008-2016 <authors>
162− All rights reserved.
163−
164− Redistribution and use in source and binary forms, with or without
165− modification, are permitted provided that the following conditions are met:
166− * Redistributions of source code must retain the above copyright
167− notice, this list of conditions and the following disclaimer.
168− * Redistributions in binary form must reproduce the above copyright
169− notice, this list of conditions and the following disclaimer in the
170− documentation and/or other materials provided with the distribution.
171− * Neither the name of the project nor the names of its contributors may be
172− used to endorse or promote products derived from this software without
173− specific prior written permission.
174−
175− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR IMPLIED
176− WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
177− MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
178− EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
179− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
180− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
181− PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
182− LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
183− OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
184− ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
185−
186−SHA LICENSE file:
187−
188− Copyright (c) 2008, Galois, Inc.
189− All rights reserved.
190−
191− Redistribution and use in source and binary forms, with or without
192− modification, are permitted provided that the following conditions
193− are met:
194−
195− * Redistributions of source code must retain the above copyright
196− notice, this list of conditions and the following disclaimer.
197− * Redistributions in binary form must reproduce the above copyright
198− notice, this list of conditions and the following disclaimer in
199− the documentation and/or other materials provided with the
200− distribution.
201− * Neither the name of the Galois, Inc. nor the names of its
202− contributors may be used to endorse or promote products derived
203− from this software without specific prior written permission.
204−
205− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
206− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
207− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
208− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
209− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
210− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
211− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
212− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
213− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
214− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
215− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
216− POSSIBILITY OF SUCH DAMAGE.
217−
218−aeson LICENSE file:
219−
220− Copyright (c) 2011, MailRank, Inc.
221−
222− All rights reserved.
223−
224− Redistribution and use in source and binary forms, with or without
225− modification, are permitted provided that the following conditions
226− are met:
227−
228− 1. Redistributions of source code must retain the above copyright
229− notice, this list of conditions and the following disclaimer.
230−
231− 2. Redistributions in binary form must reproduce the above copyright
232− notice, this list of conditions and the following disclaimer in the
233− documentation and/or other materials provided with the distribution.
234−
235− 3. Neither the name of the author nor the names of his contributors
236− may be used to endorse or promote products derived from this software
237− without specific prior written permission.
238−
239− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
240− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
241− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
242− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
243− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
244− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
245− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
246− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
247− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
248− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
249− POSSIBILITY OF SUCH DAMAGE.
250−
251−aeson-better-errors LICENSE file:
252−
253− Copyright (c) 2015 Harry Garrood
254−
255− Permission is hereby granted, free of charge, to any person obtaining
256− a copy of this software and associated documentation files (the
257− "Software"), to deal in the Software without restriction, including
258− without limitation the rights to use, copy, modify, merge, publish,
259− distribute, sublicense, and/or sell copies of the Software, and to
260− permit persons to whom the Software is furnished to do so, subject to
261− the following conditions:
262−
263− The above copyright notice and this permission notice shall be included
264− in all copies or substantial portions of the Software.
265−
266− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
267− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
268− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
269− IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
270− CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
271− TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
272− SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
273−
274−aeson-pretty LICENSE file:
275−
276− Copyright (c)2011, Falko Peters
277−
278− All rights reserved.
279−
280− Redistribution and use in source and binary forms, with or without
281− modification, are permitted provided that the following conditions are met:
282−
283− * Redistributions of source code must retain the above copyright
284− notice, this list of conditions and the following disclaimer.
285−
286− * Redistributions in binary form must reproduce the above
287− copyright notice, this list of conditions and the following
288− disclaimer in the documentation and/or other materials provided
289− with the distribution.
290−
291− * Neither the name of Falko Peters nor the names of other
292− contributors may be used to endorse or promote products derived
293− from this software without specific prior written permission.
294−
295− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
296− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
297− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
298− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
299− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
300− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
301− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
302− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
303− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
304− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
305− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
306−
307−ansi-terminal LICENSE file:
308−
309− Copyright (c) 2008, Maximilian Bolingbroke
310− All rights reserved.
311−
312− Redistribution and use in source and binary forms, with or without modification, are permitted
313− provided that the following conditions are met:
314−
315− * Redistributions of source code must retain the above copyright notice, this list of
316− conditions and the following disclaimer.
317− * Redistributions in binary form must reproduce the above copyright notice, this list of
318− conditions and the following disclaimer in the documentation and/or other materials
319− provided with the distribution.
320− * Neither the name of Maximilian Bolingbroke nor the names of other contributors may be used to
321− endorse or promote products derived from this software without specific prior written permission.
322−
323− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
324− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
325− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
326− CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
327− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
328− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
329− IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
330− OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
331−
332−ansi-wl-pprint LICENSE file:
333−
334− Copyright 2008, Daan Leijen and Max Bolingbroke. All rights reserved.
335−
336− Redistribution and use in source and binary forms, with or without
337− modification, are permitted provided that the following conditions are
338− met:
339−
340− * Redistributions of source code must retain the above copyright
341− notice, this list of conditions and the following disclaimer.
342−
343− * Redistributions in binary form must reproduce the above copyright
344− notice, this list of conditions and the following disclaimer in
345− the documentation and/or other materials provided with the
346− distribution.
347−
348− This software is provided by the copyright holders "as is" and any
349− express or implied warranties, including, but not limited to, the
350− implied warranties of merchantability and fitness for a particular
351− purpose are disclaimed. In no event shall the copyright holders be
352− liable for any direct, indirect, incidental, special, exemplary, or
353− consequential damages (including, but not limited to, procurement of
354− substitute goods or services; loss of use, data, or profits; or
355− business interruption) however caused and on any theory of liability,
356− whether in contract, strict liability, or tort (including negligence
357− or otherwise) arising in any way out of the use of this software, even
358− if advised of the possibility of such damage.
359−
360−appar LICENSE file:
361−
362− Copyright (c) 2009, IIJ Innovation Institute Inc.
363− All rights reserved.
364−
365− Redistribution and use in source and binary forms, with or without
366− modification, are permitted provided that the following conditions
367− are met:
368−
369− * Redistributions of source code must retain the above copyright
370− notice, this list of conditions and the following disclaimer.
371− * Redistributions in binary form must reproduce the above copyright
372− notice, this list of conditions and the following disclaimer in
373− the documentation and/or other materials provided with the
374− distribution.
375− * Neither the name of the copyright holders nor the names of its
376− contributors may be used to endorse or promote products derived
377− from this software without specific prior written permission.
378−
379− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
380− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
381− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
382− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
383− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
384− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
385− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
386− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
387− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
388− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
389− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
390− POSSIBILITY OF SUCH DAMAGE.
391−
392−array LICENSE file:
393−
394− This library (libraries/base) is derived from code from several
395− sources:
396−
397− * Code from the GHC project which is largely (c) The University of
398− Glasgow, and distributable under a BSD-style license (see below),
399−
400− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
401− and freely redistributable (but see the full license for
402− restrictions).
403−
404− * Code from the Haskell Foreign Function Interface specification,
405− which is (c) Manuel M. T. Chakravarty and freely redistributable
406− (but see the full license for restrictions).
407−
408− The full text of these licenses is reproduced below. All of the
409− licenses are BSD-style or compatible.
410−
411− -----------------------------------------------------------------------------
412−
413− The Glasgow Haskell Compiler License
414−
415− Copyright 2004, The University Court of the University of Glasgow.
416− All rights reserved.
417−
418− Redistribution and use in source and binary forms, with or without
419− modification, are permitted provided that the following conditions are met:
420−
421− - Redistributions of source code must retain the above copyright notice,
422− this list of conditions and the following disclaimer.
423−
424− - Redistributions in binary form must reproduce the above copyright notice,
425− this list of conditions and the following disclaimer in the documentation
426− and/or other materials provided with the distribution.
427−
428− - Neither name of the University nor the names of its contributors may be
429− used to endorse or promote products derived from this software without
430− specific prior written permission.
431−
432− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
433− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
434− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
435− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
436− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
437− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
438− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
439− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
440− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
441− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
442− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
443− DAMAGE.
444−
445− -----------------------------------------------------------------------------
446−
447− Code derived from the document "Report on the Programming Language
448− Haskell 98", is distributed under the following license:
449−
450− Copyright (c) 2002 Simon Peyton Jones
451−
452− The authors intend this Report to belong to the entire Haskell
453− community, and so we grant permission to copy and distribute it for
454− any purpose, provided that it is reproduced in its entirety,
455− including this Notice. Modified versions of this Report may also be
456− copied and distributed for any purpose, provided that the modified
457− version is clearly presented as such, and that it does not claim to
458− be a definition of the Haskell 98 Language.
459−
460− -----------------------------------------------------------------------------
461−
462− Code derived from the document "The Haskell 98 Foreign Function
463− Interface, An Addendum to the Haskell 98 Report" is distributed under
464− the following license:
465−
466− Copyright (c) 2002 Manuel M. T. Chakravarty
467−
468− The authors intend this Report to belong to the entire Haskell
469− community, and so we grant permission to copy and distribute it for
470− any purpose, provided that it is reproduced in its entirety,
471− including this Notice. Modified versions of this Report may also be
472− copied and distributed for any purpose, provided that the modified
473− version is clearly presented as such, and that it does not claim to
474− be a definition of the Haskell 98 Foreign Function Interface.
475−
476− -----------------------------------------------------------------------------
477−
478−asn1-encoding LICENSE file:
479−
480− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
481−
482− All rights reserved.
483−
484− Redistribution and use in source and binary forms, with or without
485− modification, are permitted provided that the following conditions
486− are met:
487− 1. Redistributions of source code must retain the above copyright
488− notice, this list of conditions and the following disclaimer.
489− 2. Redistributions in binary form must reproduce the above copyright
490− notice, this list of conditions and the following disclaimer in the
491− documentation and/or other materials provided with the distribution.
492− 3. Neither the name of the author nor the names of his contributors
493− may be used to endorse or promote products derived from this software
494− without specific prior written permission.
495−
496− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
497− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
498− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
499− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
500− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
501− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
502− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
503− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
504− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
505− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
506− SUCH DAMAGE.
507−
508−asn1-parse LICENSE file:
509−
510− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
511−
512− All rights reserved.
513−
514− Redistribution and use in source and binary forms, with or without
515− modification, are permitted provided that the following conditions
516− are met:
517− 1. Redistributions of source code must retain the above copyright
518− notice, this list of conditions and the following disclaimer.
519− 2. Redistributions in binary form must reproduce the above copyright
520− notice, this list of conditions and the following disclaimer in the
521− documentation and/or other materials provided with the distribution.
522− 3. Neither the name of the author nor the names of his contributors
523− may be used to endorse or promote products derived from this software
524− without specific prior written permission.
525−
526− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
527− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
528− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
529− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
530− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
531− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
532− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
533− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
534− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
535− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
536− SUCH DAMAGE.
537−
538−asn1-types LICENSE file:
539−
540− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
541−
542− All rights reserved.
543−
544− Redistribution and use in source and binary forms, with or without
545− modification, are permitted provided that the following conditions
546− are met:
547− 1. Redistributions of source code must retain the above copyright
548− notice, this list of conditions and the following disclaimer.
549− 2. Redistributions in binary form must reproduce the above copyright
550− notice, this list of conditions and the following disclaimer in the
551− documentation and/or other materials provided with the distribution.
552− 3. Neither the name of the author nor the names of his contributors
553− may be used to endorse or promote products derived from this software
554− without specific prior written permission.
555−
556− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
557− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
558− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
559− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
560− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
561− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
562− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
563− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
564− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
565− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
566− SUCH DAMAGE.
567−
568−async LICENSE file:
569−
570− Copyright (c) 2012, Simon Marlow
571−
572− All rights reserved.
573−
574− Redistribution and use in source and binary forms, with or without
575− modification, are permitted provided that the following conditions are met:
576−
577− * Redistributions of source code must retain the above copyright
578− notice, this list of conditions and the following disclaimer.
579−
580− * Redistributions in binary form must reproduce the above
581− copyright notice, this list of conditions and the following
582− disclaimer in the documentation and/or other materials provided
583− with the distribution.
584−
585− * Neither the name of Simon Marlow nor the names of other
586− contributors may be used to endorse or promote products derived
587− from this software without specific prior written permission.
588−
589− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
590− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
591− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
592− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
593− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
594− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
595− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
596− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
597− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
598− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
599− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
600−
601−attoparsec LICENSE file:
602−
603− Copyright (c) Lennart Kolmodin
604−
605− All rights reserved.
606−
607− Redistribution and use in source and binary forms, with or without
608− modification, are permitted provided that the following conditions
609− are met:
610−
611− 1. Redistributions of source code must retain the above copyright
612− notice, this list of conditions and the following disclaimer.
613−
614− 2. Redistributions in binary form must reproduce the above copyright
615− notice, this list of conditions and the following disclaimer in the
616− documentation and/or other materials provided with the distribution.
617−
618− 3. Neither the name of the author nor the names of his contributors
619− may be used to endorse or promote products derived from this software
620− without specific prior written permission.
621−
622− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
623− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
624− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
625− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
626− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
627− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
628− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
629− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
630− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
631− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
632− POSSIBILITY OF SUCH DAMAGE.
633−
634−auto-update LICENSE file:
635−
636− Copyright (c) 2014 Michael Snoyman
637−
638− Permission is hereby granted, free of charge, to any person obtaining
639− a copy of this software and associated documentation files (the
640− "Software"), to deal in the Software without restriction, including
641− without limitation the rights to use, copy, modify, merge, publish,
642− distribute, sublicense, and/or sell copies of the Software, and to
643− permit persons to whom the Software is furnished to do so, subject to
644− the following conditions:
645−
646− The above copyright notice and this permission notice shall be included
647− in all copies or substantial portions of the Software.
648−
649− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
650− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
651− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
652− IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
653− CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
654− TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
655− SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
656−
657−base LICENSE file:
658−
659− This library (libraries/base) is derived from code from several
660− sources:
661−
662− * Code from the GHC project which is largely (c) The University of
663− Glasgow, and distributable under a BSD-style license (see below),
664−
665− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
666− and freely redistributable (but see the full license for
667− restrictions).
668−
669− * Code from the Haskell Foreign Function Interface specification,
670− which is (c) Manuel M. T. Chakravarty and freely redistributable
671− (but see the full license for restrictions).
672−
673− The full text of these licenses is reproduced below. All of the
674− licenses are BSD-style or compatible.
675−
676− -----------------------------------------------------------------------------
677−
678− The Glasgow Haskell Compiler License
679−
680− Copyright 2004, The University Court of the University of Glasgow.
681− All rights reserved.
682−
683− Redistribution and use in source and binary forms, with or without
684− modification, are permitted provided that the following conditions are met:
685−
686− - Redistributions of source code must retain the above copyright notice,
687− this list of conditions and the following disclaimer.
688−
689− - Redistributions in binary form must reproduce the above copyright notice,
690− this list of conditions and the following disclaimer in the documentation
691− and/or other materials provided with the distribution.
692−
693− - Neither name of the University nor the names of its contributors may be
694− used to endorse or promote products derived from this software without
695− specific prior written permission.
696−
697− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
698− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
699− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
700− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
701− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
702− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
703− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
704− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
705− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
706− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
707− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
708− DAMAGE.
709−
710− -----------------------------------------------------------------------------
711−
712− Code derived from the document "Report on the Programming Language
713− Haskell 98", is distributed under the following license:
714−
715− Copyright (c) 2002 Simon Peyton Jones
716−
717− The authors intend this Report to belong to the entire Haskell
718− community, and so we grant permission to copy and distribute it for
719− any purpose, provided that it is reproduced in its entirety,
720− including this Notice. Modified versions of this Report may also be
721− copied and distributed for any purpose, provided that the modified
722− version is clearly presented as such, and that it does not claim to
723− be a definition of the Haskell 98 Language.
724−
725− -----------------------------------------------------------------------------
726−
727− Code derived from the document "The Haskell 98 Foreign Function
728− Interface, An Addendum to the Haskell 98 Report" is distributed under
729− the following license:
730−
731− Copyright (c) 2002 Manuel M. T. Chakravarty
732−
733− The authors intend this Report to belong to the entire Haskell
734− community, and so we grant permission to copy and distribute it for
735− any purpose, provided that it is reproduced in its entirety,
736− including this Notice. Modified versions of this Report may also be
737− copied and distributed for any purpose, provided that the modified
738− version is clearly presented as such, and that it does not claim to
739− be a definition of the Haskell 98 Foreign Function Interface.
740−
741− -----------------------------------------------------------------------------
742−
743−base-compat LICENSE file:
744−
745− Copyright (c) 2012-2016 Simon Hengel <sol@typeful.net> and Ryan Scott <ryan.gl.scott@gmail.com>
746−
747− Permission is hereby granted, free of charge, to any person obtaining a copy
748− of this software and associated documentation files (the "Software"), to deal
749− in the Software without restriction, including without limitation the rights
750− to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
751− copies of the Software, and to permit persons to whom the Software is
752− furnished to do so, subject to the following conditions:
753−
754− The above copyright notice and this permission notice shall be included in
755− all copies or substantial portions of the Software.
756−
757− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
758− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
759− FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
760− AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
761− LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
762− OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
763− THE SOFTWARE.
764−
765−base64-bytestring LICENSE file:
766−
767− Copyright (c) 2010 Bryan O'Sullivan <bos@serpentine.com>
768−
769− All rights reserved.
770−
771− Redistribution and use in source and binary forms, with or without
772− modification, are permitted provided that the following conditions
773− are met:
774−
775− 1. Redistributions of source code must retain the above copyright
776− notice, this list of conditions and the following disclaimer.
777−
778− 2. Redistributions in binary form must reproduce the above copyright
779− notice, this list of conditions and the following disclaimer in the
780− documentation and/or other materials provided with the distribution.
781−
782− 3. Neither the name of the author nor the names of his contributors
783− may be used to endorse or promote products derived from this software
784− without specific prior written permission.
785−
786− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
787− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
788− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
789− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
790− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
791− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
792− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
793− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
794− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
795− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
796− POSSIBILITY OF SUCH DAMAGE.
797−
798−binary LICENSE file:
799−
800− Copyright (c) Lennart Kolmodin
801−
802− All rights reserved.
803−
804− Redistribution and use in source and binary forms, with or without
805− modification, are permitted provided that the following conditions
806− are met:
807−
808− 1. Redistributions of source code must retain the above copyright
809− notice, this list of conditions and the following disclaimer.
810−
811− 2. Redistributions in binary form must reproduce the above copyright
812− notice, this list of conditions and the following disclaimer in the
813− documentation and/or other materials provided with the distribution.
814−
815− 3. Neither the name of the author nor the names of his contributors
816− may be used to endorse or promote products derived from this software
817− without specific prior written permission.
818−
819− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
820− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
821− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
822− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
823− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
824− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
825− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
826− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
827− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
828− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
829− POSSIBILITY OF SUCH DAMAGE.
830−
831−blaze-builder LICENSE file:
832−
833− Copyright Jasper Van der Jeugt 2010, Simon Meier 2010 & 2011
834−
835− All rights reserved.
836−
837− Redistribution and use in source and binary forms, with or without
838− modification, are permitted provided that the following conditions are met:
839−
840− * Redistributions of source code must retain the above copyright
841− notice, this list of conditions and the following disclaimer.
842−
843− * Redistributions in binary form must reproduce the above
844− copyright notice, this list of conditions and the following
845− disclaimer in the documentation and/or other materials provided
846− with the distribution.
847−
848− * Neither the name of Jasper Van der Jeugt nor the names of other
849− contributors may be used to endorse or promote products derived
850− from this software without specific prior written permission.
851−
852− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
853− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
854− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
855− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
856− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
857− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
858− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
859− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
860− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
861− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
862− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
863−
864−blaze-html LICENSE file:
865−
866− Copyright Jasper Van der Jeugt 2010
867−
868− All rights reserved.
869−
870− Redistribution and use in source and binary forms, with or without
871− modification, are permitted provided that the following conditions are met:
872−
873− * Redistributions of source code must retain the above copyright
874− notice, this list of conditions and the following disclaimer.
875−
876− * Redistributions in binary form must reproduce the above
877− copyright notice, this list of conditions and the following
878− disclaimer in the documentation and/or other materials provided
879− with the distribution.
880−
881− * Neither the name of Jasper Van der Jeugt nor the names of other
882− contributors may be used to endorse or promote products derived
883− from this software without specific prior written permission.
884−
885− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
886− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
887− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
888− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
889− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
890− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
891− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
892− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
893− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
894− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
895− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
896−
897−blaze-markup LICENSE file:
898−
899− Copyright Jasper Van der Jeugt 2010
900−
901− All rights reserved.
902−
903− Redistribution and use in source and binary forms, with or without
904− modification, are permitted provided that the following conditions are met:
905−
906− * Redistributions of source code must retain the above copyright
907− notice, this list of conditions and the following disclaimer.
908−
909− * Redistributions in binary form must reproduce the above
910− copyright notice, this list of conditions and the following
911− disclaimer in the documentation and/or other materials provided
912− with the distribution.
913−
914− * Neither the name of Jasper Van der Jeugt nor the names of other
915− contributors may be used to endorse or promote products derived
916− from this software without specific prior written permission.
917−
918− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
919− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
920− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
921− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
922− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
923− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
924− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
925− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
926− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
927− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
928− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
929−
930−bower-json LICENSE file:
931−
932− Copyright (c) 2015 Harry Garrood
933−
934− Permission is hereby granted, free of charge, to any person obtaining
935− a copy of this software and associated documentation files (the
936− "Software"), to deal in the Software without restriction, including
937− without limitation the rights to use, copy, modify, merge, publish,
938− distribute, sublicense, and/or sell copies of the Software, and to
939− permit persons to whom the Software is furnished to do so, subject to
940− the following conditions:
941−
942− The above copyright notice and this permission notice shall be included
943− in all copies or substantial portions of the Software.
944−
945− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
946− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
947− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
948− IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
949− CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
950− TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
951− SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
952−
953−boxes LICENSE file:
954−
955− Copyright (c) Brent Yorgey 2008
956−
957− Redistribution and use in source and binary forms, with or without
958− modification, are permitted provided that the following conditions
959− are met:
960− 1. Redistributions of source code must retain the above copyright
961− notice, this list of conditions and the following disclaimer.
962− 2. Redistributions in binary form must reproduce the above copyright
963− notice, this list of conditions and the following disclaimer in the
964− documentation and/or other materials provided with the distribution.
965− 3. Neither the name of the author nor the names of other contributors
966− may be used to endorse or promote products derived from this software
967− without specific prior written permission.
968−
969− All other rights are reserved.
970−
971− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND
972− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
973− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
974− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
975− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
976− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
977− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
978− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
979− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
980− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
981− SUCH DAMAGE.
982−
983−byteable LICENSE file:
984−
985− Copyright (c) 2013 Vincent Hanquez <vincent@snarc.org>
986−
987− All rights reserved.
988−
989− Redistribution and use in source and binary forms, with or without
990− modification, are permitted provided that the following conditions
991− are met:
992− 1. Redistributions of source code must retain the above copyright
993− notice, this list of conditions and the following disclaimer.
994− 2. Redistributions in binary form must reproduce the above copyright
995− notice, this list of conditions and the following disclaimer in the
996− documentation and/or other materials provided with the distribution.
997− 3. Neither the name of the author nor the names of his contributors
998− may be used to endorse or promote products derived from this software
999− without specific prior written permission.
1000−
1001− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS AS IS'' AND
1002− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1003− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1004− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1005− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1006− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1007− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1008− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1009− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1010− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1011− SUCH DAMAGE.
1012−
1013−byteorder LICENSE file:
1014−
1015− Copyright 2009, Antoine Latter
1016−
1017− All rights reserved.
1018−
1019− Redistribution and use in source and binary forms, with or without
1020− modification, are permitted provided that the following conditions are met:
1021−
1022− * Redistributions of source code must retain the above copyright
1023− notice, this list of conditions and the following disclaimer.
1024−
1025− * Redistributions in binary form must reproduce the above
1026− copyright notice, this list of conditions and the following
1027− disclaimer in the documentation and/or other materials provided
1028− with the distribution.
1029−
1030− * Neither the name of the author nor the names of other
1031− contributors may be used to endorse or promote products derived
1032− from this software without specific prior written permission.
1033−
1034− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1035− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1036− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1037− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1038− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1039− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1040− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1041− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1042− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1043− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1044− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1045−
1046−bytestring LICENSE file:
1047−
1048− Copyright (c) Don Stewart 2005-2009
1049− (c) Duncan Coutts 2006-2015
1050− (c) David Roundy 2003-2005
1051− (c) Simon Meier 2010-2011
1052−
1053− All rights reserved.
1054−
1055− Redistribution and use in source and binary forms, with or without
1056− modification, are permitted provided that the following conditions
1057− are met:
1058− 1. Redistributions of source code must retain the above copyright
1059− notice, this list of conditions and the following disclaimer.
1060− 2. Redistributions in binary form must reproduce the above copyright
1061− notice, this list of conditions and the following disclaimer in the
1062− documentation and/or other materials provided with the distribution.
1063− 3. Neither the name of the author nor the names of his contributors
1064− may be used to endorse or promote products derived from this software
1065− without specific prior written permission.
1066−
1067− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
1068− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1069− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1070− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1071− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1072− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1073− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1074− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1075− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1076− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1077− SUCH DAMAGE.
1078−
1079−bytestring-builder LICENSE file:
1080−
1081− Copyright Jasper Van der Jeugt 2010, Simon Meier 2010-2013
1082−
1083− All rights reserved.
1084−
1085− Redistribution and use in source and binary forms, with or without
1086− modification, are permitted provided that the following conditions are met:
1087−
1088− * Redistributions of source code must retain the above copyright
1089− notice, this list of conditions and the following disclaimer.
1090−
1091− * Redistributions in binary form must reproduce the above
1092− copyright notice, this list of conditions and the following
1093− disclaimer in the documentation and/or other materials provided
1094− with the distribution.
1095−
1096− * Neither the name of Jasper Van der Jeugt nor the names of other
1097− contributors may be used to endorse or promote products derived
1098− from this software without specific prior written permission.
1099−
1100− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1101− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1102− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1103− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1104− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1105− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1106− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1107− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1108− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1109− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1110− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1111−
1112−case-insensitive LICENSE file:
1113−
1114− Copyright (c) 2011-2013 Bas van Dijk
1115−
1116− All rights reserved.
1117−
1118− Redistribution and use in source and binary forms, with or without
1119− modification, are permitted provided that the following conditions are
1120− met:
1121−
1122− * Redistributions of source code must retain the above copyright
1123− notice, this list of conditions and the following disclaimer.
1124−
1125− * Redistributions in binary form must reproduce the above
1126− copyright notice, this list of conditions and the following
1127− disclaimer in the documentation and/or other materials provided
1128− with the distribution.
1129−
1130− * The name of Bas van Dijk and the names of contributors may NOT
1131− be used to endorse or promote products derived from this
1132− software without specific prior written permission.
1133−
1134− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1135− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1136− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1137− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1138− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1139− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1140− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1141− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1142− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1143− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1144− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1145−
1146−cereal LICENSE file:
1147−
1148− Copyright (c) Lennart Kolmodin, Galois, Inc.
1149−
1150− All rights reserved.
1151−
1152− Redistribution and use in source and binary forms, with or without
1153− modification, are permitted provided that the following conditions
1154− are met:
1155−
1156− 1. Redistributions of source code must retain the above copyright
1157− notice, this list of conditions and the following disclaimer.
1158−
1159− 2. Redistributions in binary form must reproduce the above copyright
1160− notice, this list of conditions and the following disclaimer in the
1161− documentation and/or other materials provided with the distribution.
1162−
1163− 3. Neither the name of the author nor the names of his contributors
1164− may be used to endorse or promote products derived from this software
1165− without specific prior written permission.
1166−
1167− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
1168− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1169− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1170− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1171− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1172− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1173− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1174− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1175− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1176− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1177− POSSIBILITY OF SUCH DAMAGE.
1178−
1179−clock LICENSE file:
1180−
1181− Copyright (c) 2009-2012, Cetin Sert
1182− Copyright (c) 2010, Eugene Kirpichov
1183−
1184− All rights reserved.
1185−
1186− Redistribution and use in source and binary forms, with or without
1187− modification, are permitted provided that the following conditions are
1188− met:
1189−
1190− * Redistributions of source code must retain the above copyright
1191− notice, this list of conditions and the following disclaimer.
1192−
1193− * Redistributions in binary form must reproduce the above
1194− copyright notice, this list of conditions and the following
1195− disclaimer in the documentation and/or other materials provided
1196− with the distribution.
1197−
1198− * The names of contributors may not be used to endorse or promote
1199− products derived from this software without specific prior
1200− written permission.
1201−
1202− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1203− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1204− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1205− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1206− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1207− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1208− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1209− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1210− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1211− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1212− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1213−
1214−cmdargs LICENSE file:
1215−
1216− Copyright Neil Mitchell 2009-2016.
1217− All rights reserved.
1218−
1219− Redistribution and use in source and binary forms, with or without
1220− modification, are permitted provided that the following conditions are
1221− met:
1222−
1223− * Redistributions of source code must retain the above copyright
1224− notice, this list of conditions and the following disclaimer.
1225−
1226− * Redistributions in binary form must reproduce the above
1227− copyright notice, this list of conditions and the following
1228− disclaimer in the documentation and/or other materials provided
1229− with the distribution.
1230−
1231− * Neither the name of Neil Mitchell nor the names of other
1232− contributors may be used to endorse or promote products derived
1233− from this software without specific prior written permission.
1234−
1235− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1236− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1237− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1238− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1239− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1240− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1241− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1242− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1243− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1244− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1245− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1246−
1247−conduit LICENSE file:
1248−
1249− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
1250−
1251− Permission is hereby granted, free of charge, to any person obtaining
1252− a copy of this software and associated documentation files (the
1253− "Software"), to deal in the Software without restriction, including
1254− without limitation the rights to use, copy, modify, merge, publish,
1255− distribute, sublicense, and/or sell copies of the Software, and to
1256− permit persons to whom the Software is furnished to do so, subject to
1257− the following conditions:
1258−
1259− The above copyright notice and this permission notice shall be
1260− included in all copies or substantial portions of the Software.
1261−
1262− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
1263− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
1264− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
1265− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
1266− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
1267− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
1268− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1269−
1270−conduit-extra LICENSE file:
1271−
1272− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
1273−
1274− Permission is hereby granted, free of charge, to any person obtaining
1275− a copy of this software and associated documentation files (the
1276− "Software"), to deal in the Software without restriction, including
1277− without limitation the rights to use, copy, modify, merge, publish,
1278− distribute, sublicense, and/or sell copies of the Software, and to
1279− permit persons to whom the Software is furnished to do so, subject to
1280− the following conditions:
1281−
1282− The above copyright notice and this permission notice shall be
1283− included in all copies or substantial portions of the Software.
1284−
1285− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
1286− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
1287− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
1288− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
1289− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
1290− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
1291− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1292−
1293−connection LICENSE file:
1294−
1295− Copyright (c) 2012 Vincent Hanquez <vincent@snarc.org>
1296−
1297− All rights reserved.
1298−
1299− Redistribution and use in source and binary forms, with or without
1300− modification, are permitted provided that the following conditions
1301− are met:
1302− 1. Redistributions of source code must retain the above copyright
1303− notice, this list of conditions and the following disclaimer.
1304− 2. Redistributions in binary form must reproduce the above copyright
1305− notice, this list of conditions and the following disclaimer in the
1306− documentation and/or other materials provided with the distribution.
1307− 3. Neither the name of the author nor the names of his contributors
1308− may be used to endorse or promote products derived from this software
1309− without specific prior written permission.
1310−
1311− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
1312− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1313− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1314− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1315− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1316− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1317− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1318− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1319− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1320− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1321− SUCH DAMAGE.
1322−
1323−containers LICENSE file:
1324−
1325− The Glasgow Haskell Compiler License
1326−
1327− Copyright 2004, The University Court of the University of Glasgow.
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 are met:
1332−
1333− - Redistributions of source code must retain the above copyright notice,
1334− this list of conditions and the following disclaimer.
1335−
1336− - Redistributions in binary form must reproduce the above copyright notice,
1337− this list of conditions and the following disclaimer in the documentation
1338− and/or other materials provided with the distribution.
1339−
1340− - Neither name of the University nor the names of its contributors may be
1341− used to endorse or promote products derived from this software without
1342− specific prior written permission.
1343−
1344− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1345− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1346− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1347− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1348− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1349− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1350− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1351− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1352− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1353− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1354− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1355− DAMAGE.
1356−
1357−cookie LICENSE file:
1358−
1359− Copyright (c) 2010 Michael Snoyman, http://www.yesodweb.com/
1360−
1361− Permission is hereby granted, free of charge, to any person obtaining
1362− a copy of this software and associated documentation files (the
1363− "Software"), to deal in the Software without restriction, including
1364− without limitation the rights to use, copy, modify, merge, publish,
1365− distribute, sublicense, and/or sell copies of the Software, and to
1366− permit persons to whom the Software is furnished to do so, subject to
1367− the following conditions:
1368−
1369− The above copyright notice and this permission notice shall be
1370− included in all copies or substantial portions of the Software.
1371−
1372− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
1373− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
1374− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
1375− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
1376− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
1377− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
1378− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
1379−
1380−cryptonite LICENSE file:
1381−
1382− Copyright (c) 2006-2015 Vincent Hanquez <vincent@snarc.org>
1383−
1384− All rights reserved.
1385−
1386− Redistribution and use in source and binary forms, with or without
1387− modification, are permitted provided that the following conditions
1388− are met:
1389−
1390− 1. Redistributions of source code must retain the above copyright
1391− notice, this list of conditions and the following disclaimer.
1392− 2. Redistributions in binary form must reproduce the above copyright
1393− notice, this list of conditions and the following disclaimer in the
1394− documentation and/or other materials provided with the distribution.
1395− 3. Neither the name of the author nor the names of his contributors
1396− may be used to endorse or promote products derived from this software
1397− without specific prior written permission.
1398−
1399− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS AS IS'' AND
1400− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1401− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1402− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
1403− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1404− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1405− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1406− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1407− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1408− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1409− SUCH DAMAGE.
1410−
1411−data-default-class LICENSE file:
1412−
1413− Copyright (c) 2013 Lukas Mai
1414−
1415− All rights reserved.
1416−
1417− Redistribution and use in source and binary forms, with or without modification,
1418− are permitted provided that the following conditions are met:
1419−
1420− * Redistributions of source code must retain the above copyright notice, this
1421− list of conditions and the following disclaimer.
1422− * Redistributions in binary form must reproduce the above copyright notice,
1423− this list of conditions and the following disclaimer in the documentation
1424− and/or other materials provided with the distribution.
1425− * Neither the name of the author nor the names of his contributors
1426− may be used to endorse or promote products derived from this software
1427− without specific prior written permission.
1428−
1429− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
1430− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1431− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1432− DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE
1433− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1434− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1435− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1436− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
1437− OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1438− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1439−
1440−data-ordlist LICENSE file:
1441−
1442− Copyright (c) 2009-2010, Melding Monads
1443− All rights reserved.
1444−
1445− Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1446−
1447− * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
1448− * 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.
1449− * Neither the name of Melding Monads nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
1450−
1451− 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 HOLDER 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.
1452−
1453−deepseq LICENSE file:
1454−
1455− This library (deepseq) is derived from code from the GHC project which
1456− is largely (c) The University of Glasgow, and distributable under a
1457− BSD-style license (see below).
1458−
1459− -----------------------------------------------------------------------------
1460−
1461− The Glasgow Haskell Compiler License
1462−
1463− Copyright 2001-2009, The University Court of the University of Glasgow.
1464− All rights reserved.
1465−
1466− Redistribution and use in source and binary forms, with or without
1467− modification, are permitted provided that the following conditions are met:
1468−
1469− - Redistributions of source code must retain the above copyright notice,
1470− this list of conditions and the following disclaimer.
1471−
1472− - Redistributions in binary form must reproduce the above copyright notice,
1473− this list of conditions and the following disclaimer in the documentation
1474− and/or other materials provided with the distribution.
1475−
1476− - Neither name of the University nor the names of its contributors may be
1477− used to endorse or promote products derived from this software without
1478− specific prior written permission.
1479−
1480− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1481− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1482− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1483− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1484− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1485− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1486− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1487− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1488− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1489− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1490− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1491− DAMAGE.
1492−
1493− -----------------------------------------------------------------------------
1494−
1495−directory LICENSE file:
1496−
1497− This library (libraries/base) is derived from code from two
1498− sources:
1499−
1500− * Code from the GHC project which is largely (c) The University of
1501− Glasgow, and distributable under a BSD-style license (see below),
1502−
1503− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
1504− and freely redistributable (but see the full license for
1505− restrictions).
1506−
1507− The full text of these licenses is reproduced below. Both of the
1508− licenses are BSD-style or compatible.
1509−
1510− -----------------------------------------------------------------------------
1511−
1512− The Glasgow Haskell Compiler License
1513−
1514− Copyright 2004, The University Court of the University of Glasgow.
1515− All rights reserved.
1516−
1517− Redistribution and use in source and binary forms, with or without
1518− modification, are permitted provided that the following conditions are met:
1519−
1520− - Redistributions of source code must retain the above copyright notice,
1521− this list of conditions and the following disclaimer.
1522−
1523− - Redistributions in binary form must reproduce the above copyright notice,
1524− this list of conditions and the following disclaimer in the documentation
1525− and/or other materials provided with the distribution.
1526−
1527− - Neither name of the University nor the names of its contributors may be
1528− used to endorse or promote products derived from this software without
1529− specific prior written permission.
1530−
1531− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1532− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1533− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1534− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1535− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1536− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1537− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1538− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1539− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1540− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1541− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1542− DAMAGE.
1543−
1544− -----------------------------------------------------------------------------
1545−
1546− Code derived from the document "Report on the Programming Language
1547− Haskell 98", is distributed under the following license:
1548−
1549− Copyright (c) 2002 Simon Peyton Jones
1550−
1551− The authors intend this Report to belong to the entire Haskell
1552− community, and so we grant permission to copy and distribute it for
1553− any purpose, provided that it is reproduced in its entirety,
1554− including this Notice. Modified versions of this Report may also be
1555− copied and distributed for any purpose, provided that the modified
1556− version is clearly presented as such, and that it does not claim to
1557− be a definition of the Haskell 98 Language.
1558−
1559− -----------------------------------------------------------------------------
1560−
1561−dlist LICENSE file:
1562−
1563− Copyright (c) 2006-2009 Don Stewart, 2013-2016 Sean Leather
1564−
1565− All rights reserved.
1566−
1567− Redistribution and use in source and binary forms, with or without
1568− modification, are permitted provided that the following conditions are
1569− met:
1570−
1571− * Redistributions of source code must retain the above copyright
1572− notice, this list of conditions and the following disclaimer.
1573−
1574− * Redistributions in binary form must reproduce the above
1575− copyright notice, this list of conditions and the following
1576− disclaimer in the documentation and/or other materials provided
1577− with the distribution.
1578−
1579− * Neither the name of Don Stewart nor the names of other
1580− contributors may be used to endorse or promote products derived
1581− from this software without specific prior written permission.
1582−
1583− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1584− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1585− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1586− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1587− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1588− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1589− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1590− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1591− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1592− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1593− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1594−
1595−easy-file LICENSE file:
1596−
1597− Copyright (c) 2009, IIJ Innovation Institute Inc.
1598− All rights reserved.
1599−
1600− Redistribution and use in source and binary forms, with or without
1601− modification, are permitted provided that the following conditions
1602− are met:
1603−
1604− * Redistributions of source code must retain the above copyright
1605− notice, this list of conditions and the following disclaimer.
1606− * Redistributions in binary form must reproduce the above copyright
1607− notice, this list of conditions and the following disclaimer in
1608− the documentation and/or other materials provided with the
1609− distribution.
1610− * Neither the name of the copyright holders nor the names of its
1611− contributors may be used to endorse or promote products derived
1612− from this software without specific prior written permission.
1613−
1614− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1615− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1616− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
1617− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1618− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
1619− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
1620− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
1621− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1622− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1623− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1624− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1625− POSSIBILITY OF SUCH DAMAGE.
1626−
1627−edit-distance LICENSE file:
1628−
1629− Copyright (c) 2008-2013 Maximilian Bolingbroke
1630− All rights reserved.
1631−
1632− Redistribution and use in source and binary forms, with or without modification, are permitted
1633− provided that the following conditions are met:
1634−
1635− * Redistributions of source code must retain the above copyright notice, this list of
1636− conditions and the following disclaimer.
1637− * Redistributions in binary form must reproduce the above copyright notice, this list of
1638− conditions and the following disclaimer in the documentation and/or other materials
1639− provided with the distribution.
1640− * Neither the name of Maximilian Bolingbroke nor the names of other contributors may be used to
1641− endorse or promote products derived from this software without specific prior written permission.
1642−
1643− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
1644− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1645− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
1646− CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1647− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1648− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
1649− IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
1650− OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1651−
1652−entropy LICENSE file:
1653−
1654− Copyright (c) Thomas DuBuisson
1655−
1656− All rights reserved.
1657−
1658− Redistribution and use in source and binary forms, with or without
1659− modification, are permitted provided that the following conditions
1660− are met:
1661−
1662− 1. Redistributions of source code must retain the above copyright
1663− notice, this list of conditions and the following disclaimer.
1664−
1665− 2. Redistributions in binary form must reproduce the above copyright
1666− notice, this list of conditions and the following disclaimer in the
1667− documentation and/or other materials provided with the distribution.
1668−
1669− 3. Neither the name of the author nor the names of his contributors
1670− may be used to endorse or promote products derived from this software
1671− without specific prior written permission.
1672−
1673− THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
1674− OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1675− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1676− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1677− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1678− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1679− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1680− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1681− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1682− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1683− POSSIBILITY OF SUCH DAMAGE.
1684−
1685−exceptions LICENSE file:
1686−
1687− Copyright 2013-2015 Edward Kmett
1688− Copyright 2012 Google Inc.
1689−
1690− All rights reserved.
1691−
1692− Redistribution and use in source and binary forms, with or without
1693− modification, are permitted provided that the following conditions
1694− are met:
1695−
1696− 1. Redistributions of source code must retain the above copyright
1697− notice, this list of conditions and the following disclaimer.
1698−
1699− 2. Redistributions in binary form must reproduce the above copyright
1700− notice, this list of conditions and the following disclaimer in the
1701− documentation and/or other materials provided with the distribution.
1702−
1703− 3. Neither the name of the author nor the names of his contributors
1704− may be used to endorse or promote products derived from this software
1705− without specific prior written permission.
1706−
1707− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
1708− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1709− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1710− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
1711− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1712− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1713− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1714− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
1715− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1716− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1717− POSSIBILITY OF SUCH DAMAGE.
1718−
1719−fail LICENSE file:
1720−
1721− Copyright (c) 2015, David Luposchainsky & Herbert Valerio Riedel
1722−
1723− All rights reserved.
1724−
1725− Redistribution and use in source and binary forms, with or without
1726− modification, are permitted provided that the following conditions are met:
1727−
1728− * Redistributions of source code must retain the above copyright
1729− notice, this list of conditions and the following disclaimer.
1730−
1731− * Redistributions in binary form must reproduce the above
1732− copyright notice, this list of conditions and the following
1733− disclaimer in the documentation and/or other materials provided
1734− with the distribution.
1735−
1736− * Neither the name of Herbert Valerio Riedel nor the names of other
1737− contributors may be used to endorse or promote products derived
1738− from this software without specific prior written permission.
1739−
1740− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1741− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1742− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1743− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1744− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1745− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1746− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1747− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1748− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1749− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1750− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1751−
1752−fast-logger LICENSE file:
1753−
1754− Copyright (c) 2009, IIJ Innovation Institute Inc.
1755− All rights reserved.
1756−
1757− Redistribution and use in source and binary forms, with or without
1758− modification, are permitted provided that the following conditions
1759− are met:
1760−
1761− * Redistributions of source code must retain the above copyright
1762− notice, this list of conditions and the following disclaimer.
1763− * Redistributions in binary form must reproduce the above copyright
1764− notice, this list of conditions and the following disclaimer in
1765− the documentation and/or other materials provided with the
1766− distribution.
1767− * Neither the name of the copyright holders nor the names of its
1768− contributors may be used to endorse or promote products derived
1769− from this software without specific prior written permission.
1770−
1771− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1772− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1773− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
1774− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1775− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
1776− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
1777− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
1778− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1779− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1780− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
1781− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1782− POSSIBILITY OF SUCH DAMAGE.
1783−
1784−file-embed LICENSE file:
1785−
1786− The following license covers this documentation, and the source code, except
1787− where otherwise indicated.
1788−
1789− Copyright 2008, Michael Snoyman. All rights reserved.
1790−
1791− Redistribution and use in source and binary forms, with or without
1792− modification, are permitted provided that the following conditions are met:
1793−
1794− * Redistributions of source code must retain the above copyright notice, this
1795− list of conditions and the following disclaimer.
1796−
1797− * Redistributions in binary form must reproduce the above copyright notice,
1798− this list of conditions and the following disclaimer in the documentation
1799− and/or other materials provided with the distribution.
1800−
1801− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS "AS IS" AND ANY EXPRESS OR
1802− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
1803− MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
1804− EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY DIRECT, INDIRECT,
1805− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
1806− NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
1807− OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
1808− LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
1809− OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
1810− ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1811−
1812−filepath LICENSE file:
1813−
1814− Copyright Neil Mitchell 2005-2015.
1815− All rights reserved.
1816−
1817− Redistribution and use in source and binary forms, with or without
1818− modification, are permitted provided that the following conditions are
1819− met:
1820−
1821− * Redistributions of source code must retain the above copyright
1822− notice, this list of conditions and the following disclaimer.
1823−
1824− * Redistributions in binary form must reproduce the above
1825− copyright notice, this list of conditions and the following
1826− disclaimer in the documentation and/or other materials provided
1827− with the distribution.
1828−
1829− * Neither the name of Neil Mitchell nor the names of other
1830− contributors may be used to endorse or promote products derived
1831− from this software without specific prior written permission.
1832−
1833− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1834− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1835− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1836− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1837− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1838− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1839− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1840− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1841− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1842− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1843− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1844−
1845−fsnotify LICENSE file:
1846−
1847− Copyright (c) 2012, Mark Dittmer
1848−
1849− All rights reserved.
1850−
1851− Redistribution and use in source and binary forms, with or without
1852− modification, are permitted provided that the following conditions are met:
1853−
1854− * Redistributions of source code must retain the above copyright
1855− notice, this list of conditions and the following disclaimer.
1856−
1857− * Redistributions in binary form must reproduce the above
1858− copyright notice, this list of conditions and the following
1859− disclaimer in the documentation and/or other materials provided
1860− with the distribution.
1861−
1862− * Neither the name of Mark Dittmer nor the names of other
1863− contributors may be used to endorse or promote products derived
1864− from this software without specific prior written permission.
1865−
1866− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1867− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1868− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1869− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1870− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1871− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1872− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1873− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1874− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1875− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1876− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1877−
1878−ghc-prim LICENSE file:
1879−
1880− This library (libraries/ghc-prim) is derived from code from several
1881− sources:
1882−
1883− * Code from the GHC project which is largely (c) The University of
1884− Glasgow, and distributable under a BSD-style license (see below),
1885−
1886− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
1887− and freely redistributable (but see the full license for
1888− restrictions).
1889−
1890− The full text of these licenses is reproduced below. All of the
1891− licenses are BSD-style or compatible.
1892−
1893− -----------------------------------------------------------------------------
1894−
1895− The Glasgow Haskell Compiler License
1896−
1897− Copyright 2004, The University Court of the University of Glasgow.
1898− All rights reserved.
1899−
1900− Redistribution and use in source and binary forms, with or without
1901− modification, are permitted provided that the following conditions are met:
1902−
1903− - Redistributions of source code must retain the above copyright notice,
1904− this list of conditions and the following disclaimer.
1905−
1906− - Redistributions in binary form must reproduce the above copyright notice,
1907− this list of conditions and the following disclaimer in the documentation
1908− and/or other materials provided with the distribution.
1909−
1910− - Neither name of the University nor the names of its contributors may be
1911− used to endorse or promote products derived from this software without
1912− specific prior written permission.
1913−
1914− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
1915− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
1916− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
1917− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
1918− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
1919− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1920− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1921− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1922− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1923− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1924− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
1925− DAMAGE.
1926−
1927− -----------------------------------------------------------------------------
1928−
1929− Code derived from the document "Report on the Programming Language
1930− Haskell 98", is distributed under the following license:
1931−
1932− Copyright (c) 2002 Simon Peyton Jones
1933−
1934− The authors intend this Report to belong to the entire Haskell
1935− community, and so we grant permission to copy and distribute it for
1936− any purpose, provided that it is reproduced in its entirety,
1937− including this Notice. Modified versions of this Report may also be
1938− copied and distributed for any purpose, provided that the modified
1939− version is clearly presented as such, and that it does not claim to
1940− be a definition of the Haskell 98 Language.
1941−
1942−
1943−hashable LICENSE file:
1944−
1945− Copyright Milan Straka 2010
1946−
1947− All rights reserved.
1948−
1949− Redistribution and use in source and binary forms, with or without
1950− modification, are permitted provided that the following conditions are met:
1951−
1952− * Redistributions of source code must retain the above copyright
1953− notice, this list of conditions and the following disclaimer.
1954−
1955− * Redistributions in binary form must reproduce the above
1956− copyright notice, this list of conditions and the following
1957− disclaimer in the documentation and/or other materials provided
1958− with the distribution.
1959−
1960− * Neither the name of Milan Straka nor the names of other
1961− contributors may be used to endorse or promote products derived
1962− from this software without specific prior written permission.
1963−
1964− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1965− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1966− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1967− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1968− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1969− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1970− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1971− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1972− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1973− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1974− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1975−
1976−haskeline LICENSE file:
1977−
1978− Copyright 2007-2009, Judah Jacobson.
1979− All Rights Reserved.
1980−
1981− Redistribution and use in source and binary forms, with or without
1982− modification, are permitted provided that the following conditions are met:
1983−
1984− - Redistribution of source code must retain the above copyright notice,
1985− this list of conditions and the following disclaimer.
1986−
1987− - Redistribution in binary form must reproduce the above copyright notice,
1988− this list of conditions and the following disclaimer in the documentation
1989− and/or other materials provided with the distribution.
1990−
1991− THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY
1992− EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
1993− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1994− DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR THE CONTRIBUTORS BE LIABLE
1995− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1996− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1997− SERVICES; LOSS OF USE, DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1998− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
1999− OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
2000− USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2001−
2002−hex LICENSE file:
2003−
2004− Page not found: Sorry, it's just not here.
2005−
2006−hfsevents LICENSE file:
2007−
2008− Copyright (c) 2012, Luite Stegeman
2009−
2010− All rights reserved.
2011−
2012− Redistribution and use in source and binary forms, with or without
2013− modification, are permitted provided that the following conditions are met:
2014−
2015− * Redistributions of source code must retain the above copyright
2016− notice, this list of conditions and the following disclaimer.
2017−
2018− * Redistributions in binary form must reproduce the above
2019− copyright notice, this list of conditions and the following
2020− disclaimer in the documentation and/or other materials provided
2021− with the distribution.
2022−
2023− * Neither the name of Luite Stegeman nor the names of other
2024− contributors may be used to endorse or promote products derived
2025− from this software without specific prior written permission.
2026−
2027− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2028− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2029− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2030− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2031− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2032− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2033− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2034− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2035− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2036− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2037− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2038−
2039−hourglass LICENSE file:
2040−
2041− Copyright (c) 2014 Vincent Hanquez <vincent@snarc.org>
2042−
2043− All rights reserved.
2044−
2045− Redistribution and use in source and binary forms, with or without
2046− modification, are permitted provided that the following conditions
2047− are met:
2048− 1. Redistributions of source code must retain the above copyright
2049− notice, this list of conditions and the following disclaimer.
2050− 2. Redistributions in binary form must reproduce the above copyright
2051− notice, this list of conditions and the following disclaimer in the
2052− documentation and/or other materials provided with the distribution.
2053− 3. Neither the name of the author nor the names of his contributors
2054− may be used to endorse or promote products derived from this software
2055− without specific prior written permission.
2056−
2057− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS AS IS'' AND
2058− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2059− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2060− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
2061− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2062− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2063− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2064− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2065− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2066− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2067− SUCH DAMAGE.
2068−
2069−http-client LICENSE file:
2070−
2071− The MIT License (MIT)
2072−
2073− Copyright (c) 2013 Michael Snoyman
2074−
2075− Permission is hereby granted, free of charge, to any person obtaining a copy of
2076− this software and associated documentation files (the "Software"), to deal in
2077− the Software without restriction, including without limitation the rights to
2078− use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
2079− the Software, and to permit persons to whom the Software is furnished to do so,
2080− subject to the following conditions:
2081−
2082− The above copyright notice and this permission notice shall be included in all
2083− copies or substantial portions of the Software.
2084−
2085− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
2086− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
2087− FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
2088− COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
2089− IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
2090− CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
2091−
2092−http-client-tls LICENSE file:
2093−
2094− The MIT License (MIT)
2095−
2096− Copyright (c) 2013 Michael Snoyman
2097−
2098− Permission is hereby granted, free of charge, to any person obtaining a copy of
2099− this software and associated documentation files (the "Software"), to deal in
2100− the Software without restriction, including without limitation the rights to
2101− use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
2102− the Software, and to permit persons to whom the Software is furnished to do so,
2103− subject to the following conditions:
2104−
2105− The above copyright notice and this permission notice shall be included in all
2106− copies or substantial portions of the Software.
2107−
2108− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
2109− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
2110− FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
2111− COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
2112− IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
2113− CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
2114−
2115−http-date LICENSE file:
2116−
2117− Copyright (c) 2009, IIJ Innovation Institute Inc.
2118− All rights reserved.
2119−
2120− Redistribution and use in source and binary forms, with or without
2121− modification, are permitted provided that the following conditions
2122− are met:
2123−
2124− * Redistributions of source code must retain the above copyright
2125− notice, this list of conditions and the following disclaimer.
2126− * Redistributions in binary form must reproduce the above copyright
2127− notice, this list of conditions and the following disclaimer in
2128− the documentation and/or other materials provided with the
2129− distribution.
2130− * Neither the name of the copyright holders nor the names of its
2131− contributors may be used to endorse or promote products derived
2132− from this software without specific prior written permission.
2133−
2134− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2135− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2136− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
2137− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2138− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
2139− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
2140− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2141− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2142− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2143− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
2144− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
2145− POSSIBILITY OF SUCH DAMAGE.
2146−
2147−http-types LICENSE file:
2148−
2149− Copyright (c) 2011, Aristid Breitkreuz
2150− Copyright (c) 2011, Michael Snoyman
2151−
2152− All rights reserved.
2153−
2154− Redistribution and use in source and binary forms, with or without
2155− modification, are permitted provided that the following conditions are met:
2156−
2157− * Redistributions of source code must retain the above copyright
2158− notice, this list of conditions and the following disclaimer.
2159−
2160− * Redistributions in binary form must reproduce the above
2161− copyright notice, this list of conditions and the following
2162− disclaimer in the documentation and/or other materials provided
2163− with the distribution.
2164−
2165− * Neither the name of Aristid Breitkreuz nor the names of other
2166− contributors may be used to endorse or promote products derived
2167− from this software without specific prior written permission.
2168−
2169− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2170− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2171− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2172− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2173− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2174− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2175− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2176− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2177− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2178− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2179− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2180−
2181−http2 LICENSE file:
2182−
2183− Copyright (c) 2013, IIJ Innovation Institute Inc.
2184− All rights reserved.
2185−
2186− Redistribution and use in source and binary forms, with or without
2187− modification, are permitted provided that the following conditions
2188− are met:
2189−
2190− * Redistributions of source code must retain the above copyright
2191− notice, this list of conditions and the following disclaimer.
2192− * Redistributions in binary form must reproduce the above copyright
2193− notice, this list of conditions and the following disclaimer in
2194− the documentation and/or other materials provided with the
2195− distribution.
2196− * Neither the name of the copyright holders nor the names of its
2197− contributors may be used to endorse or promote products derived
2198− from this software without specific prior written permission.
2199−
2200− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2201− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2202− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
2203− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2204− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
2205− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
2206− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2207− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2208− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2209− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
2210− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
2211− POSSIBILITY OF SUCH DAMAGE.
2212−
2213−integer-gmp LICENSE file:
2214−
2215− Copyright (c) 2014, Herbert Valerio Riedel
2216−
2217− All rights reserved.
2218−
2219− Redistribution and use in source and binary forms, with or without
2220− modification, are permitted provided that the following conditions are met:
2221−
2222− * Redistributions of source code must retain the above copyright
2223− notice, this list of conditions and the following disclaimer.
2224−
2225− * Redistributions in binary form must reproduce the above
2226− copyright notice, this list of conditions and the following
2227− disclaimer in the documentation and/or other materials provided
2228− with the distribution.
2229−
2230− * Neither the name of Herbert Valerio Riedel nor the names of other
2231− contributors may be used to endorse or promote products derived
2232− from this software without specific prior written permission.
2233−
2234− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2235− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2236− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2237− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2238− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2239− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2240− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2241− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2242− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2243− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2244− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2245−
2246−iproute LICENSE file:
2247−
2248− Copyright (c) 2009, IIJ Innovation Institute Inc.
2249− All rights reserved.
2250−
2251− Redistribution and use in source and binary forms, with or without
2252− modification, are permitted provided that the following conditions
2253− are met:
2254−
2255− * Redistributions of source code must retain the above copyright
2256− notice, this list of conditions and the following disclaimer.
2257− * Redistributions in binary form must reproduce the above copyright
2258− notice, this list of conditions and the following disclaimer in
2259− the documentation and/or other materials provided with the
2260− distribution.
2261− * Neither the name of the copyright holders nor the names of its
2262− contributors may be used to endorse or promote products derived
2263− from this software without specific prior written permission.
2264−
2265− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2266− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2267− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
2268− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2269− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
2270− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
2271− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2272− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2273− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2274− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
2275− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
2276− POSSIBILITY OF SUCH DAMAGE.
2277−
2278−language-javascript LICENSE file:
2279−
2280− Copyright (c)2010, Alan Zimmerman
2281−
2282− All rights reserved.
2283−
2284− Redistribution and use in source and binary forms, with or without
2285− modification, are permitted provided that the following conditions are met:
2286−
2287− * Redistributions of source code must retain the above copyright
2288− notice, this list of conditions and the following disclaimer.
2289−
2290− * Redistributions in binary form must reproduce the above
2291− copyright notice, this list of conditions and the following
2292− disclaimer in the documentation and/or other materials provided
2293− with the distribution.
2294−
2295− * Neither the name of Alan Zimmerman nor the names of other
2296− contributors may be used to endorse or promote products derived
2297− from this software without specific prior written permission.
2298−
2299− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2300− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2301− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2302− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2303− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2304− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2305− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2306− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2307− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2308− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2309− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2310−
2311−lifted-base LICENSE file:
2312−
2313− Copyright © 2010-2012, Bas van Dijk, Anders Kaseorg
2314− All rights reserved.
2315−
2316− Redistribution and use in source and binary forms, with or without
2317− modification, are permitted provided that the following conditions are
2318− met:
2319−
2320− • Redistributions of source code must retain the above copyright
2321− notice, this list of conditions and the following disclaimer.
2322−
2323− • Redistributions in binary form must reproduce the above copyright
2324− notice, this list of conditions and the following disclaimer in the
2325− documentation and/or other materials provided with the distribution.
2326−
2327− • Neither the name of the author nor the names of other contributors
2328− may be used to endorse or promote products derived from this
2329− software without specific prior written permission.
2330−
2331− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2332− “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2333− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2334− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2335− HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2336− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2337− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2338− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2339− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2340− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2341− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2342−
2343−memory LICENSE file:
2344−
2345− Copyright (c) 2015 Vincent Hanquez <vincent@snarc.org>
2346−
2347− All rights reserved.
2348−
2349− Redistribution and use in source and binary forms, with or without
2350− modification, are permitted provided that the following conditions
2351− are met:
2352−
2353− 1. Redistributions of source code must retain the above copyright
2354− notice, this list of conditions and the following disclaimer.
2355− 2. Redistributions in binary form must reproduce the above copyright
2356− notice, this list of conditions and the following disclaimer in the
2357− documentation and/or other materials provided with the distribution.
2358− 3. Neither the name of the author nor the names of his contributors
2359− may be used to endorse or promote products derived from this software
2360− without specific prior written permission.
2361−
2362− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS AS IS'' AND
2363− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2364− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2365− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
2366− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2367− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2368− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2369− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2370− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2371− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2372− SUCH DAMAGE.
2373−
2374−mime-types LICENSE file:
2375−
2376− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
2377−
2378− Permission is hereby granted, free of charge, to any person obtaining
2379− a copy of this software and associated documentation files (the
2380− "Software"), to deal in the Software without restriction, including
2381− without limitation the rights to use, copy, modify, merge, publish,
2382− distribute, sublicense, and/or sell copies of the Software, and to
2383− permit persons to whom the Software is furnished to do so, subject to
2384− the following conditions:
2385−
2386− The above copyright notice and this permission notice shall be
2387− included in all copies or substantial portions of the Software.
2388−
2389− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
2390− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
2391− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
2392− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
2393− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
2394− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
2395− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
2396−
2397−mmorph LICENSE file:
2398−
2399− Copyright (c) 2013, Gabriel Gonzalez
2400− All rights reserved.
2401−
2402− Redistribution and use in source and binary forms, with or without modification,
2403− are permitted provided that the following conditions are met:
2404−
2405− * Redistributions of source code must retain the above copyright notice, this
2406− list of conditions and the following disclaimer.
2407− * Redistributions in binary form must reproduce the above copyright notice, this
2408− list of conditions and the following disclaimer in the documentation and/or
2409− other materials provided with the distribution.
2410− * Neither the name of Gabriel Gonzalez nor the names of other contributors may
2411− be used to endorse or promote products derived from this software without
2412− specific prior written permission.
2413−
2414− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
2415− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
2416− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
2417− DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
2418− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
2419− (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2420− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
2421− ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2422− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
2423− SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2424−
2425−monad-control LICENSE file:
2426−
2427− Copyright © 2010, Bas van Dijk, Anders Kaseorg
2428− All rights reserved.
2429−
2430− Redistribution and use in source and binary forms, with or without
2431− modification, are permitted provided that the following conditions are
2432− met:
2433−
2434− • Redistributions of source code must retain the above copyright
2435− notice, this list of conditions and the following disclaimer.
2436−
2437− • Redistributions in binary form must reproduce the above copyright
2438− notice, this list of conditions and the following disclaimer in the
2439− documentation and/or other materials provided with the distribution.
2440−
2441− • Neither the name of the author nor the names of other contributors
2442− may be used to endorse or promote products derived from this
2443− software without specific prior written permission.
2444−
2445− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2446− “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2447− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2448− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2449− HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2450− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2451− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2452− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2453− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2454− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2455− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2456−
2457−monad-logger LICENSE file:
2458−
2459− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
2460−
2461− Permission is hereby granted, free of charge, to any person obtaining
2462− a copy of this software and associated documentation files (the
2463− "Software"), to deal in the Software without restriction, including
2464− without limitation the rights to use, copy, modify, merge, publish,
2465− distribute, sublicense, and/or sell copies of the Software, and to
2466− permit persons to whom the Software is furnished to do so, subject to
2467− the following conditions:
2468−
2469− The above copyright notice and this permission notice shall be
2470− included in all copies or substantial portions of the Software.
2471−
2472− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
2473− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
2474− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
2475− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
2476− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
2477− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
2478− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
2479−
2480−monad-loops LICENSE file:
2481−
2482− Page not found: Sorry, it's just not here.
2483−
2484−mtl LICENSE file:
2485−
2486− The Glasgow Haskell Compiler License
2487−
2488− Copyright 2004, The University Court of the University of Glasgow.
2489− All rights reserved.
2490−
2491− Redistribution and use in source and binary forms, with or without
2492− modification, are permitted provided that the following conditions are met:
2493−
2494− - Redistributions of source code must retain the above copyright notice,
2495− this list of conditions and the following disclaimer.
2496−
2497− - Redistributions in binary form must reproduce the above copyright notice,
2498− this list of conditions and the following disclaimer in the documentation
2499− and/or other materials provided with the distribution.
2500−
2501− - Neither name of the University nor the names of its contributors may be
2502− used to endorse or promote products derived from this software without
2503− specific prior written permission.
2504−
2505− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2506− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2507− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2508− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2509− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2510− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2511− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2512− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2513− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2514− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2515− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2516− DAMAGE.
2517−
2518−network LICENSE file:
2519−
2520− Copyright (c) 2002-2010, The University Court of the University of Glasgow.
2521− Copyright (c) 2007-2010, Johan Tibell
2522−
2523− Redistribution and use in source and binary forms, with or without
2524− modification, are permitted provided that the following conditions are met:
2525−
2526− - Redistributions of source code must retain the above copyright notice,
2527− this list of conditions and the following disclaimer.
2528−
2529− - Redistributions in binary form must reproduce the above copyright notice,
2530− this list of conditions and the following disclaimer in the documentation
2531− and/or other materials provided with the distribution.
2532−
2533− - Neither name of the University nor the names of its contributors may be
2534− used to endorse or promote products derived from this software without
2535− specific prior written permission.
2536−
2537− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2538− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2539− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2540− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2541− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2542− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2543− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2544− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2545− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2546− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2547− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2548− DAMAGE.
2549−
2550−network-uri LICENSE file:
2551−
2552− Copyright (c) 2002-2010, The University Court of the University of Glasgow.
2553− Copyright (c) 2007-2010, Johan Tibell
2554−
2555− Redistribution and use in source and binary forms, with or without
2556− modification, are permitted provided that the following conditions are met:
2557−
2558− - Redistributions of source code must retain the above copyright notice,
2559− this list of conditions and the following disclaimer.
2560−
2561− - Redistributions in binary form must reproduce the above copyright notice,
2562− this list of conditions and the following disclaimer in the documentation
2563− and/or other materials provided with the distribution.
2564−
2565− - Neither name of the University nor the names of its contributors may be
2566− used to endorse or promote products derived from this software without
2567− specific prior written permission.
2568−
2569− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2570− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2571− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2572− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2573− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2574− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2575− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2576− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2577− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2578− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2579− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2580− DAMAGE.
2581−
2582−old-locale LICENSE file:
2583−
2584− This library (libraries/base) is derived from code from two
2585− sources:
2586−
2587− * Code from the GHC project which is largely (c) The University of
2588− Glasgow, and distributable under a BSD-style license (see below),
2589−
2590− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
2591− and freely redistributable (but see the full license for
2592− restrictions).
2593−
2594− The full text of these licenses is reproduced below. Both of the
2595− licenses are BSD-style or compatible.
2596−
2597− -----------------------------------------------------------------------------
2598−
2599− The Glasgow Haskell Compiler License
2600−
2601− Copyright 2004, The University Court of the University of Glasgow.
2602− All rights reserved.
2603−
2604− Redistribution and use in source and binary forms, with or without
2605− modification, are permitted provided that the following conditions are met:
2606−
2607− - Redistributions of source code must retain the above copyright notice,
2608− this list of conditions and the following disclaimer.
2609−
2610− - Redistributions in binary form must reproduce the above copyright notice,
2611− this list of conditions and the following disclaimer in the documentation
2612− and/or other materials provided with the distribution.
2613−
2614− - Neither name of the University nor the names of its contributors may be
2615− used to endorse or promote products derived from this software without
2616− specific prior written permission.
2617−
2618− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2619− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2620− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2621− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2622− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2623− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2624− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2625− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2626− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2627− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2628− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2629− DAMAGE.
2630−
2631− -----------------------------------------------------------------------------
2632−
2633− Code derived from the document "Report on the Programming Language
2634− Haskell 98", is distributed under the following license:
2635−
2636− Copyright (c) 2002 Simon Peyton Jones
2637−
2638− The authors intend this Report to belong to the entire Haskell
2639− community, and so we grant permission to copy and distribute it for
2640− any purpose, provided that it is reproduced in its entirety,
2641− including this Notice. Modified versions of this Report may also be
2642− copied and distributed for any purpose, provided that the modified
2643− version is clearly presented as such, and that it does not claim to
2644− be a definition of the Haskell 98 Language.
2645−
2646− -----------------------------------------------------------------------------
2647−
2648−old-time LICENSE file:
2649−
2650− This library (libraries/base) is derived from code from two
2651− sources:
2652−
2653− * Code from the GHC project which is largely (c) The University of
2654− Glasgow, and distributable under a BSD-style license (see below),
2655−
2656− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
2657− and freely redistributable (but see the full license for
2658− restrictions).
2659−
2660− The full text of these licenses is reproduced below. Both of the
2661− licenses are BSD-style or compatible.
2662−
2663− -----------------------------------------------------------------------------
2664−
2665− The Glasgow Haskell Compiler License
2666−
2667− Copyright 2004, The University Court of the University of Glasgow.
2668− All rights reserved.
2669−
2670− Redistribution and use in source and binary forms, with or without
2671− modification, are permitted provided that the following conditions are met:
2672−
2673− - Redistributions of source code must retain the above copyright notice,
2674− this list of conditions and the following disclaimer.
2675−
2676− - Redistributions in binary form must reproduce the above copyright notice,
2677− this list of conditions and the following disclaimer in the documentation
2678− and/or other materials provided with the distribution.
2679−
2680− - Neither name of the University nor the names of its contributors may be
2681− used to endorse or promote products derived from this software without
2682− specific prior written permission.
2683−
2684− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2685− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2686− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2687− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2688− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2689− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2690− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2691− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2692− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2693− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2694− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2695− DAMAGE.
2696−
2697− -----------------------------------------------------------------------------
2698−
2699− Code derived from the document "Report on the Programming Language
2700− Haskell 98", is distributed under the following license:
2701−
2702− Copyright (c) 2002 Simon Peyton Jones
2703−
2704− The authors intend this Report to belong to the entire Haskell
2705− community, and so we grant permission to copy and distribute it for
2706− any purpose, provided that it is reproduced in its entirety,
2707− including this Notice. Modified versions of this Report may also be
2708− copied and distributed for any purpose, provided that the modified
2709− version is clearly presented as such, and that it does not claim to
2710− be a definition of the Haskell 98 Language.
2711−
2712− -----------------------------------------------------------------------------
2713−
2714−optparse-applicative LICENSE file:
2715−
2716− Copyright (c) 2012, Paolo Capriotti
2717−
2718− All rights reserved.
2719−
2720− Redistribution and use in source and binary forms, with or without
2721− modification, are permitted provided that the following conditions are met:
2722−
2723− * Redistributions of source code must retain the above copyright
2724− notice, this list of conditions and the following disclaimer.
2725−
2726− * Redistributions in binary form must reproduce the above
2727− copyright notice, this list of conditions and the following
2728− disclaimer in the documentation and/or other materials provided
2729− with the distribution.
2730−
2731− * Neither the name of Paolo Capriotti nor the names of other
2732− contributors may be used to endorse or promote products derived
2733− from this software without specific prior written permission.
2734−
2735− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2736− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2737− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2738− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2739− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2740− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2741− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2742− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2743− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2744− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2745− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2746−
2747−parallel LICENSE file:
2748−
2749− This library (libraries/parallel) is derived from code from
2750− the GHC project which is largely (c) The University of
2751− Glasgow, and distributable under a BSD-style license (see below).
2752−
2753− -----------------------------------------------------------------------------
2754−
2755− The Glasgow Haskell Compiler License
2756−
2757− Copyright 2004, The University Court of the University of Glasgow.
2758− All rights reserved.
2759−
2760− Redistribution and use in source and binary forms, with or without
2761− modification, are permitted provided that the following conditions are met:
2762−
2763− - Redistributions of source code must retain the above copyright notice,
2764− this list of conditions and the following disclaimer.
2765−
2766− - Redistributions in binary form must reproduce the above copyright notice,
2767− this list of conditions and the following disclaimer in the documentation
2768− and/or other materials provided with the distribution.
2769−
2770− - Neither name of the University nor the names of its contributors may be
2771− used to endorse or promote products derived from this software without
2772− specific prior written permission.
2773−
2774− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2775− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2776− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2777− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2778− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2779− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2780− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2781− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2782− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2783− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2784− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2785− DAMAGE.
2786−
2787− -----------------------------------------------------------------------------
2788−
2789−parsec LICENSE file:
2790−
2791− Copyright 1999-2000, Daan Leijen; 2007, Paolo Martini. All rights reserved.
2792−
2793− Redistribution and use in source and binary forms, with or without
2794− modification, are permitted provided that the following conditions are met:
2795−
2796− * Redistributions of source code must retain the above copyright notice,
2797− this list of conditions and the following disclaimer.
2798− * Redistributions in binary form must reproduce the above copyright
2799− notice, this list of conditions and the following disclaimer in the
2800− documentation and/or other materials provided with the distribution.
2801−
2802− This software is provided by the copyright holders "as is" and any express or
2803− implied warranties, including, but not limited to, the implied warranties of
2804− merchantability and fitness for a particular purpose are disclaimed. In no
2805− event shall the copyright holders be liable for any direct, indirect,
2806− incidental, special, exemplary, or consequential damages (including, but not
2807− limited to, procurement of substitute goods or services; loss of use, data,
2808− or profits; or business interruption) however caused and on any theory of
2809− liability, whether in contract, strict liability, or tort (including
2810− negligence or otherwise) arising in any way out of the use of this software,
2811− even if advised of the possibility of such damage.
2812−
2813−pattern-arrows LICENSE file:
2814−
2815− The MIT License (MIT)
2816−
2817− Copyright (c) 2013 Phil Freeman
2818−
2819− Permission is hereby granted, free of charge, to any person obtaining a copy of
2820− this software and associated documentation files (the "Software"), to deal in
2821− the Software without restriction, including without limitation the rights to
2822− use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
2823− the Software, and to permit persons to whom the Software is furnished to do so,
2824− subject to the following conditions:
2825−
2826− The above copyright notice and this permission notice shall be included in all
2827− copies or substantial portions of the Software.
2828−
2829− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
2830− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
2831− FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
2832− COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
2833− IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
2834− CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
2835−
2836−pem LICENSE file:
2837−
2838− Copyright (c) 2010-2012 Vincent Hanquez <vincent@snarc.org>
2839−
2840− All rights reserved.
2841−
2842− Redistribution and use in source and binary forms, with or without
2843− modification, are permitted provided that the following conditions
2844− are met:
2845− 1. Redistributions of source code must retain the above copyright
2846− notice, this list of conditions and the following disclaimer.
2847− 2. Redistributions in binary form must reproduce the above copyright
2848− notice, this list of conditions and the following disclaimer in the
2849− documentation and/or other materials provided with the distribution.
2850− 3. Neither the name of the author nor the names of his contributors
2851− may be used to endorse or promote products derived from this software
2852− without specific prior written permission.
2853−
2854− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
2855− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2856− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2857− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
2858− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2859− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2860− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2861− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2862− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2863− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2864− SUCH DAMAGE.
2865−
2866−pipes LICENSE file:
2867−
2868− Copyright (c) 2012-2016 Gabriel Gonzalez
2869− All rights reserved.
2870−
2871− Redistribution and use in source and binary forms, with or without modification,
2872− are permitted provided that the following conditions are met:
2873− * Redistributions of source code must retain the above copyright notice,
2874− this list of conditions and the following disclaimer.
2875− * Redistributions in binary form must reproduce the above copyright notice,
2876− this list of conditions and the following disclaimer in the documentation
2877− and/or other materials provided with the distribution.
2878− * Neither the name of Gabriel Gonzalez nor the names of other contributors
2879− may be used to endorse or promote products derived from this software
2880− without specific prior written permission.
2881−
2882− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
2883− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
2884− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
2885− DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
2886− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
2887− (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2888− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
2889− ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2890− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
2891− SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2892−
2893−pipes-http LICENSE file:
2894−
2895− Copyright (c) 2016 Gabriel Gonzalez
2896− All rights reserved.
2897−
2898− Redistribution and use in source and binary forms, with or without modification,
2899− are permitted provided that the following conditions are met:
2900− * Redistributions of source code must retain the above copyright notice,
2901− this list of conditions and the following disclaimer.
2902− * Redistributions in binary form must reproduce the above copyright notice,
2903− this list of conditions and the following disclaimer in the documentation
2904− and/or other materials provided with the distribution.
2905− * Neither the name of Gabriel Gonzalez nor the names of other contributors
2906− may be used to endorse or promote products derived from this software
2907− without specific prior written permission.
2908−
2909− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
2910− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
2911− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
2912− DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
2913− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
2914− (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
2915− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
2916− ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2917− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
2918− SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2919−
2920−primitive LICENSE file:
2921−
2922− Copyright (c) 2008-2009, Roman Leshchinskiy
2923− All rights reserved.
2924−
2925− Redistribution and use in source and binary forms, with or without
2926− modification, are permitted provided that the following conditions are met:
2927−
2928− - Redistributions of source code must retain the above copyright notice,
2929− this list of conditions and the following disclaimer.
2930−
2931− - Redistributions in binary form must reproduce the above copyright notice,
2932− this list of conditions and the following disclaimer in the documentation
2933− and/or other materials provided with the distribution.
2934−
2935− - Neither name of the University nor the names of its contributors may be
2936− used to endorse or promote products derived from this software without
2937− specific prior written permission.
2938−
2939− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2940− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2941− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2942− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2943− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2944− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2945− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2946− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2947− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2948− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2949− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
2950− DAMAGE.
2951−
2952−
2953−process LICENSE file:
2954−
2955− This library (libraries/process) is derived from code from two
2956− sources:
2957−
2958− * Code from the GHC project which is largely (c) The University of
2959− Glasgow, and distributable under a BSD-style license (see below),
2960−
2961− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
2962− and freely redistributable (but see the full license for
2963− restrictions).
2964−
2965− The full text of these licenses is reproduced below. Both of the
2966− licenses are BSD-style or compatible.
2967−
2968− -----------------------------------------------------------------------------
2969−
2970− The Glasgow Haskell Compiler License
2971−
2972− Copyright 2004, The University Court of the University of Glasgow.
2973− All rights reserved.
2974−
2975− Redistribution and use in source and binary forms, with or without
2976− modification, are permitted provided that the following conditions are met:
2977−
2978− - Redistributions of source code must retain the above copyright notice,
2979− this list of conditions and the following disclaimer.
2980−
2981− - Redistributions in binary form must reproduce the above copyright notice,
2982− this list of conditions and the following disclaimer in the documentation
2983− and/or other materials provided with the distribution.
2984−
2985− - Neither name of the University nor the names of its contributors may be
2986− used to endorse or promote products derived from this software without
2987− specific prior written permission.
2988−
2989− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
2990− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
2991− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
2992− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
2993− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
2994− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2995− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
2996− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
2997− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2998− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2999− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3000− DAMAGE.
3001−
3002− -----------------------------------------------------------------------------
3003−
3004− Code derived from the document "Report on the Programming Language
3005− Haskell 98", is distributed under the following license:
3006−
3007− Copyright (c) 2002 Simon Peyton Jones
3008−
3009− The authors intend this Report to belong to the entire Haskell
3010− community, and so we grant permission to copy and distribute it for
3011− any purpose, provided that it is reproduced in its entirety,
3012− including this Notice. Modified versions of this Report may also be
3013− copied and distributed for any purpose, provided that the modified
3014− version is clearly presented as such, and that it does not claim to
3015− be a definition of the Haskell 98 Language.
3016−
3017− -----------------------------------------------------------------------------
3018−
3019−protolude LICENSE file:
3020−
3021− Copyright (c) 2016, Stephen Diehl
3022−
3023− Permission is hereby granted, free of charge, to any person obtaining a copy
3024− of this software and associated documentation files (the "Software"), to
3025− deal in the Software without restriction, including without limitation the
3026− rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
3027− sell copies of the Software, and to permit persons to whom the Software is
3028− furnished to do so, subject to the following conditions:
3029−
3030− The above copyright notice and this permission notice shall be included in
3031− all copies or substantial portions of the Software.
3032−
3033− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
3034− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
3035− FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
3036− AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
3037− LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
3038− FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
3039− IN THE SOFTWARE.
3040−
3041−psqueues LICENSE file:
3042−
3043− The Glasgow Haskell Compiler License
3044−
3045− Copyright 2004, The University Court of the University of Glasgow.
3046− All rights reserved.
3047−
3048− Redistribution and use in source and binary forms, with or without
3049− modification, are permitted provided that the following conditions are met:
3050−
3051− - Redistributions of source code must retain the above copyright notice,
3052− this list of conditions and the following disclaimer.
3053−
3054− - Redistributions in binary form must reproduce the above copyright notice,
3055− this list of conditions and the following disclaimer in the documentation
3056− and/or other materials provided with the distribution.
3057−
3058− - Neither name of the University nor the names of its contributors may be
3059− used to endorse or promote products derived from this software without
3060− specific prior written permission.
3061−
3062− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3063− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3064− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3065− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3066− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3067− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3068− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3069− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3070− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3071− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3072− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3073− DAMAGE.
3074−
3075−random LICENSE file:
3076−
3077− This library (libraries/base) is derived from code from two
3078− sources:
3079−
3080− * Code from the GHC project which is largely (c) The University of
3081− Glasgow, and distributable under a BSD-style license (see below),
3082−
3083− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
3084− and freely redistributable (but see the full license for
3085− restrictions).
3086−
3087− The full text of these licenses is reproduced below. Both of the
3088− licenses are BSD-style or compatible.
3089−
3090− -----------------------------------------------------------------------------
3091−
3092− The Glasgow Haskell Compiler License
3093−
3094− Copyright 2004, The University Court of the University of Glasgow.
3095− All rights reserved.
3096−
3097− Redistribution and use in source and binary forms, with or without
3098− modification, are permitted provided that the following conditions are met:
3099−
3100− - Redistributions of source code must retain the above copyright notice,
3101− this list of conditions and the following disclaimer.
3102−
3103− - Redistributions in binary form must reproduce the above copyright notice,
3104− this list of conditions and the following disclaimer in the documentation
3105− and/or other materials provided with the distribution.
3106−
3107− - Neither name of the University nor the names of its contributors may be
3108− used to endorse or promote products derived from this software without
3109− specific prior written permission.
3110−
3111− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3112− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3113− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3114− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3115− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3116− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3117− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3118− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3119− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3120− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3121− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3122− DAMAGE.
3123−
3124− -----------------------------------------------------------------------------
3125−
3126− Code derived from the document "Report on the Programming Language
3127− Haskell 98", is distributed under the following license:
3128−
3129− Copyright (c) 2002 Simon Peyton Jones
3130−
3131− The authors intend this Report to belong to the entire Haskell
3132− community, and so we grant permission to copy and distribute it for
3133− any purpose, provided that it is reproduced in its entirety,
3134− including this Notice. Modified versions of this Report may also be
3135− copied and distributed for any purpose, provided that the modified
3136− version is clearly presented as such, and that it does not claim to
3137− be a definition of the Haskell 98 Language.
3138−
3139− -----------------------------------------------------------------------------
3140−
3141−regex-base LICENSE file:
3142−
3143− This modile is under this "3 clause" BSD license:
3144−
3145− Copyright (c) 2007, Christopher Kuklewicz
3146− All rights reserved.
3147−
3148− Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
3149−
3150− * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
3151− * 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.
3152− * The names of the contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
3153−
3154− 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.
3155−
3156−regex-tdfa LICENSE file:
3157−
3158− This modile is under this "3 clause" BSD license:
3159−
3160− Copyright (c) 2007-2009, Christopher Kuklewicz
3161− All rights reserved.
3162−
3163− Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
3164−
3165− * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
3166− * 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.
3167− * The names of the contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
3168−
3169− 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.
3170−
3171−resourcet LICENSE file:
3172−
3173− Copyright (c)2011, Michael Snoyman
3174−
3175− All rights reserved.
3176−
3177− Redistribution and use in source and binary forms, with or without
3178− modification, are permitted provided that the following conditions are met:
3179−
3180− * Redistributions of source code must retain the above copyright
3181− notice, this list of conditions and the following disclaimer.
3182−
3183− * Redistributions in binary form must reproduce the above
3184− copyright notice, this list of conditions and the following
3185− disclaimer in the documentation and/or other materials provided
3186− with the distribution.
3187−
3188− * Neither the name of Michael Snoyman nor the names of other
3189− contributors may be used to endorse or promote products derived
3190− from this software without specific prior written permission.
3191−
3192− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3193− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3194− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3195− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3196− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3197− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3198− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3199− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3200− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3201− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3202− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3203−
3204−safe LICENSE file:
3205−
3206− Copyright Neil Mitchell 2007-2015.
3207− All rights reserved.
3208−
3209− Redistribution and use in source and binary forms, with or without
3210− modification, are permitted provided that the following conditions are
3211− met:
3212−
3213− * Redistributions of source code must retain the above copyright
3214− notice, this list of conditions and the following disclaimer.
3215−
3216− * Redistributions in binary form must reproduce the above
3217− copyright notice, this list of conditions and the following
3218− disclaimer in the documentation and/or other materials provided
3219− with the distribution.
3220−
3221− * Neither the name of Neil Mitchell nor the names of other
3222− contributors may be used to endorse or promote products derived
3223− from this software without specific prior written permission.
3224−
3225− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3226− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3227− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3228− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3229− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3230− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3231− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3232− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3233− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3234− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3235− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3236−
3237−scientific LICENSE file:
3238−
3239− Copyright (c) 2013, Bas van Dijk
3240−
3241− All rights reserved.
3242−
3243− Redistribution and use in source and binary forms, with or without
3244− modification, are permitted provided that the following conditions are met:
3245−
3246− * Redistributions of source code must retain the above copyright
3247− notice, this list of conditions and the following disclaimer.
3248−
3249− * Redistributions in binary form must reproduce the above
3250− copyright notice, this list of conditions and the following
3251− disclaimer in the documentation and/or other materials provided
3252− with the distribution.
3253−
3254− * Neither the name of Bas van Dijk nor the names of other
3255− contributors may be used to endorse or promote products derived
3256− from this software without specific prior written permission.
3257−
3258− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3259− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3260− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3261− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3262− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3263− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3264− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3265− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3266− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3267− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3268− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3269−
3270−semigroups LICENSE file:
3271−
3272− Copyright 2011-2015 Edward Kmett
3273−
3274− All rights reserved.
3275−
3276− Redistribution and use in source and binary forms, with or without
3277− modification, are permitted provided that the following conditions
3278− are met:
3279−
3280− 1. Redistributions of source code must retain the above copyright
3281− notice, this list of conditions and the following disclaimer.
3282−
3283− 2. Redistributions in binary form must reproduce the above copyright
3284− notice, this list of conditions and the following disclaimer in the
3285− documentation and/or other materials provided with the distribution.
3286−
3287− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
3288− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
3289− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
3290− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
3291− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3292− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3293− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3294− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
3295− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
3296− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
3297− POSSIBILITY OF SUCH DAMAGE.
3298−
3299−simple-sendfile LICENSE file:
3300−
3301− Copyright (c) 2009, IIJ Innovation Institute Inc.
3302− All rights reserved.
3303−
3304− Redistribution and use in source and binary forms, with or without
3305− modification, are permitted provided that the following conditions
3306− are met:
3307−
3308− * Redistributions of source code must retain the above copyright
3309− notice, this list of conditions and the following disclaimer.
3310− * Redistributions in binary form must reproduce the above copyright
3311− notice, this list of conditions and the following disclaimer in
3312− the documentation and/or other materials provided with the
3313− distribution.
3314− * Neither the name of the copyright holders nor the names of its
3315− contributors may be used to endorse or promote products derived
3316− from this software without specific prior written permission.
3317−
3318− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3319− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3320− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
3321− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3322− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
3323− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
3324− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
3325− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3326− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3327− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
3328− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
3329− POSSIBILITY OF SUCH DAMAGE.
3330−
3331−socks LICENSE file:
3332−
3333− Copyright (c) 2010-2011 Vincent Hanquez <vincent@snarc.org>
3334−
3335− All rights reserved.
3336−
3337− Redistribution and use in source and binary forms, with or without
3338− modification, are permitted provided that the following conditions
3339− are met:
3340− 1. Redistributions of source code must retain the above copyright
3341− notice, this list of conditions and the following disclaimer.
3342− 2. Redistributions in binary form must reproduce the above copyright
3343− notice, this list of conditions and the following disclaimer in the
3344− documentation and/or other materials provided with the distribution.
3345− 3. Neither the name of the author nor the names of his contributors
3346− may be used to endorse or promote products derived from this software
3347− without specific prior written permission.
3348−
3349− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
3350− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3351− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
3352− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
3353− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3354− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3355− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3356− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3357− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3358− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3359− SUCH DAMAGE.
3360−
3361−sourcemap LICENSE file:
1+Copyright Andy Arvanitis (c) 2018
33622
3363− Copyright (c) 2012, Chris Done
3364−
3365− All rights reserved.
3366−
3367− Redistribution and use in source and binary forms, with or without
3368− modification, are permitted provided that the following conditions are met:
3369−
3370− * Redistributions of source code must retain the above copyright
3371− notice, this list of conditions and the following disclaimer.
3372−
3373− * Redistributions in binary form must reproduce the above
3374− copyright notice, this list of conditions and the following
3375− disclaimer in the documentation and/or other materials provided
3376− with the distribution.
3377−
3378− * Neither the name of Chris Done nor the names of other
3379− contributors may be used to endorse or promote products derived
3380− from this software without specific prior written permission.
3381−
3382− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3383− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3384− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3385− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3386− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3387− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3388− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3389− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3390− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3391− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3392− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3393−
3394−spdx LICENSE file:
3395−
3396− Copyright (c) 2015, Oleg Grenrus
3397−
3398− All rights reserved.
3399−
3400− Redistribution and use in source and binary forms, with or without
3401− modification, are permitted provided that the following conditions are met:
3402−
3403− * Redistributions of source code must retain the above copyright
3404− notice, this list of conditions and the following disclaimer.
3405−
3406− * Redistributions in binary form must reproduce the above
3407− copyright notice, this list of conditions and the following
3408− disclaimer in the documentation and/or other materials provided
3409− with the distribution.
3410−
3411− * Neither the name of Oleg Grenrus nor the names of other
3412− contributors may be used to endorse or promote products derived
3413− from this software without specific prior written permission.
3414−
3415− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3416− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3417− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3418− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3419− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3420− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3421− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3422− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3423− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3424− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3425− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3426−
3427−split LICENSE file:
3428−
3429− Copyright (c) 2008 Brent Yorgey, Louis Wasserman
3430−
3431− All rights reserved.
3432−
3433− Redistribution and use in source and binary forms, with or without
3434− modification, are permitted provided that the following conditions
3435− are met:
3436− 1. Redistributions of source code must retain the above copyright
3437− notice, this list of conditions and the following disclaimer.
3438− 2. Redistributions in binary form must reproduce the above copyright
3439− notice, this list of conditions and the following disclaimer in the
3440− documentation and/or other materials provided with the distribution.
3441− 3. Neither the name of the author nor the names of other contributors
3442− may be used to endorse or promote products derived from this software
3443− without specific prior written permission.
3444−
3445− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND
3446− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3447− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
3448− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
3449− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3450− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3451− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3452− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3453− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3454− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3455− SUCH DAMAGE.
3456−
3457−stm LICENSE file:
3458−
3459− The Glasgow Haskell Compiler License
3460−
3461− Copyright 2004, The University Court of the University of Glasgow.
3462− All rights reserved.
3463−
3464− Redistribution and use in source and binary forms, with or without
3465− modification, are permitted provided that the following conditions are met:
3466−
3467− - Redistributions of source code must retain the above copyright notice,
3468− this list of conditions and the following disclaimer.
3469−
3470− - Redistributions in binary form must reproduce the above copyright notice,
3471− this list of conditions and the following disclaimer in the documentation
3472− and/or other materials provided with the distribution.
3473−
3474− - Neither name of the University nor the names of its contributors may be
3475− used to endorse or promote products derived from this software without
3476− specific prior written permission.
3477−
3478− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3479− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3480− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3481− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3482− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3483− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3484− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3485− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3486− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3487− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3488− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3489− DAMAGE.
3490−
3491−stm-chans LICENSE file:
3492−
3493− === stm-chans license ===
3494−
3495− Copyright (c) 2011--2013, wren gayle romano.
3496− ALL RIGHTS RESERVED.
3497−
3498− Redistribution and use in source and binary forms, with or without
3499− modification, are permitted provided that the following conditions
3500− are met:
3501−
3502− * Redistributions of source code must retain the above copyright
3503− notice, this list of conditions and the following disclaimer.
3504−
3505− * Redistributions in binary form must reproduce the above
3506− copyright notice, this list of conditions and the following
3507− disclaimer in the documentation and/or other materials provided
3508− with the distribution.
3509−
3510− * Neither the name of the copyright holders nor the names of
3511− other contributors may be used to endorse or promote products
3512− derived from this software without specific prior written
3513− permission.
3514−
3515− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3516− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3517− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
3518− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3519− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
3520− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
3521− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
3522− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3523− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3524− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
3525− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
3526− POSSIBILITY OF SUCH DAMAGE.
3527−
3528−
3529−streaming-commons LICENSE file:
3530−
3531− The MIT License (MIT)
3532−
3533− Copyright (c) 2014 FP Complete
3534−
3535− Permission is hereby granted, free of charge, to any person obtaining a copy
3536− of this software and associated documentation files (the "Software"), to deal
3537− in the Software without restriction, including without limitation the rights
3538− to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
3539− copies of the Software, and to permit persons to whom the Software is
3540− furnished to do so, subject to the following conditions:
3541−
3542− The above copyright notice and this permission notice shall be included in all
3543− copies or substantial portions of the Software.
3544−
3545− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
3546− IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
3547− FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
3548− AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
3549− LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
3550− OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
3551− SOFTWARE.
3552−
3553−stringsearch LICENSE file:
3554−
3555− Page not found: Sorry, it's just not here.
3556−
3557−syb LICENSE file:
3558−
3559− This library (libraries/syb) is derived from code from several
3560− sources:
3561−
3562− * Code from the GHC project which is largely (c) The University of
3563− Glasgow, and distributable under a BSD-style license (see below),
3564−
3565− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
3566− and freely redistributable (but see the full license for
3567− restrictions).
3568−
3569− * Code from the Haskell Foreign Function Interface specification,
3570− which is (c) Manuel M. T. Chakravarty and freely redistributable
3571− (but see the full license for restrictions).
3572−
3573− The full text of these licenses is reproduced below. All of the
3574− licenses are BSD-style or compatible.
3575−
3576− -----------------------------------------------------------------------------
3577−
3578− The Glasgow Haskell Compiler License
3579−
3580− Copyright 2004, The University Court of the University of Glasgow.
3581− All rights reserved.
3582−
3583− Redistribution and use in source and binary forms, with or without
3584− modification, are permitted provided that the following conditions are met:
3585−
3586− - Redistributions of source code must retain the above copyright notice,
3587− this list of conditions and the following disclaimer.
3588−
3589− - Redistributions in binary form must reproduce the above copyright notice,
3590− this list of conditions and the following disclaimer in the documentation
3591− and/or other materials provided with the distribution.
3592−
3593− - Neither name of the University nor the names of its contributors may be
3594− used to endorse or promote products derived from this software without
3595− specific prior written permission.
3596−
3597− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3598− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3599− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3600− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3601− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3602− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3603− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3604− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3605− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3606− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3607− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3608− DAMAGE.
3609−
3610− -----------------------------------------------------------------------------
3611−
3612− Code derived from the document "Report on the Programming Language
3613− Haskell 98", is distributed under the following license:
3614−
3615− Copyright (c) 2002 Simon Peyton Jones
3616−
3617− The authors intend this Report to belong to the entire Haskell
3618− community, and so we grant permission to copy and distribute it for
3619− any purpose, provided that it is reproduced in its entirety,
3620− including this Notice. Modified versions of this Report may also be
3621− copied and distributed for any purpose, provided that the modified
3622− version is clearly presented as such, and that it does not claim to
3623− be a definition of the Haskell 98 Language.
3624−
3625− -----------------------------------------------------------------------------
3626−
3627− Code derived from the document "The Haskell 98 Foreign Function
3628− Interface, An Addendum to the Haskell 98 Report" is distributed under
3629− the following license:
3630−
3631− Copyright (c) 2002 Manuel M. T. Chakravarty
3632−
3633− The authors intend this Report to belong to the entire Haskell
3634− community, and so we grant permission to copy and distribute it for
3635− any purpose, provided that it is reproduced in its entirety,
3636− including this Notice. Modified versions of this Report may also be
3637− copied and distributed for any purpose, provided that the modified
3638− version is clearly presented as such, and that it does not claim to
3639− be a definition of the Haskell 98 Foreign Function Interface.
3640−
3641− -----------------------------------------------------------------------------
3642−
3643−tagged LICENSE file:
3644−
3645− Copyright (c) 2009-2015 Edward Kmett
3646− All rights reserved.
3647−
3648− Redistribution and use in source and binary forms, with or without
3649− modification, are permitted provided that the following conditions are
3650− met:
3651−
3652− * Redistributions of source code must retain the above copyright
3653− notice, this list of conditions and the following disclaimer.
3654−
3655− * Redistributions in binary form must reproduce the above
3656− copyright notice, this list of conditions and the following
3657− disclaimer in the documentation and/or other materials provided
3658− with the distribution.
3659−
3660− * Neither the name of Edward Kmett nor the names of other
3661− contributors may be used to endorse or promote products derived
3662− from this software without specific prior written permission.
3663−
3664− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3665− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3666− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3667− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3668− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3669− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3670− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3671− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3672− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3673− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3674− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3675−
3676−template-haskell LICENSE file:
3677−
3678−
3679− The Glasgow Haskell Compiler License
3680−
3681− Copyright 2002-2007, The University Court of the University of Glasgow.
3682− All rights reserved.
3683−
3684− Redistribution and use in source and binary forms, with or without
3685− modification, are permitted provided that the following conditions are met:
3686−
3687− - Redistributions of source code must retain the above copyright notice,
3688− this list of conditions and the following disclaimer.
3689−
3690− - Redistributions in binary form must reproduce the above copyright notice,
3691− this list of conditions and the following disclaimer in the documentation
3692− and/or other materials provided with the distribution.
3693−
3694− - Neither name of the University nor the names of its contributors may be
3695− used to endorse or promote products derived from this software without
3696− specific prior written permission.
3697−
3698− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3699− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3700− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3701− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3702− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3703− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3704− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3705− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3706− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3707− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3708− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3709− DAMAGE.
3710−
3711−
3712−terminfo LICENSE file:
3713−
3714− Copyright 2007, Judah Jacobson.
3715− All Rights Reserved.
3716−
3717− Redistribution and use in source and binary forms, with or without
3718− modification, are permitted provided that the following conditions are met:
3719−
3720− - Redistribution of source code must retain the above copyright notice,
3721− this list of conditions and the following disclamer.
3722−
3723− - Redistribution in binary form must reproduce the above copyright notice,
3724− this list of conditions and the following disclamer in the documentation
3725− and/or other materials provided with the distribution.
3726−
3727− THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND ANY
3728− EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
3729− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
3730− DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR THE CONTRIBUTORS BE LIABLE
3731− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3732− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3733− SERVICES; LOSS OF USE, DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3734− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
3735− OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
3736− USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3737−
3738−text LICENSE file:
3739−
3740− Copyright (c) 2008-2009, Tom Harper
3741− All rights reserved.
3742−
3743− Redistribution and use in source and binary forms, with or without
3744− modification, are permitted provided that the following conditions
3745− are met:
3746−
3747− * Redistributions of source code must retain the above copyright
3748− notice, this list of conditions and the following disclaimer.
3749−
3750− * Redistributions in binary form must reproduce the above
3751− copyright notice, this list of conditions and the following
3752− disclaimer in the documentation and/or other materials provided
3753− with the distribution.
3754−
3755− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3756− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3757− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3758− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3759− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3760− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3761− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3762− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3763− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3764− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3765− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3766−
3767−time LICENSE file:
3768−
3769− TimeLib is Copyright (c) Ashley Yakeley, 2004-2014. All rights reserved.
3770− Certain sections are Copyright 2004, The University Court of the University of Glasgow. All rights reserved.
3771−
3772− Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
3773−
3774− - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
3775−
3776− - 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.
3777−
3778− 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.
3779−
3780−time-locale-compat LICENSE file:
3781−
3782− Copyright (c) 2014, Kei Hibino
3783−
3784− All rights reserved.
3785−
3786− Redistribution and use in source and binary forms, with or without
3787− modification, are permitted provided that the following conditions are met:
3788−
3789− * Redistributions of source code must retain the above copyright
3790− notice, this list of conditions and the following disclaimer.
3791−
3792− * Redistributions in binary form must reproduce the above
3793− copyright notice, this list of conditions and the following
3794− disclaimer in the documentation and/or other materials provided
3795− with the distribution.
3796−
3797− * Neither the name of Kei Hibino nor the names of other
3798− contributors may be used to endorse or promote products derived
3799− from this software without specific prior written permission.
3800−
3801− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3802− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3803− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3804− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3805− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3806− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3807− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3808− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3809− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3810− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3811− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3812−
3813−tls LICENSE file:
3814−
3815− Copyright (c) 2010-2015 Vincent Hanquez <vincent@snarc.org>
3816−
3817− All rights reserved.
3818−
3819− Redistribution and use in source and binary forms, with or without
3820− modification, are permitted provided that the following conditions
3821− are met:
3822− 1. Redistributions of source code must retain the above copyright
3823− notice, this list of conditions and the following disclaimer.
3824− 2. Redistributions in binary form must reproduce the above copyright
3825− notice, this list of conditions and the following disclaimer in the
3826− documentation and/or other materials provided with the distribution.
3827− 3. Neither the name of the author nor the names of his contributors
3828− may be used to endorse or promote products derived from this software
3829− without specific prior written permission.
3830−
3831− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
3832− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3833− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
3834− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
3835− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3836− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3837− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3838− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3839− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3840− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3841− SUCH DAMAGE.
3842−
3843−transformers LICENSE file:
3844−
3845− The Glasgow Haskell Compiler License
3846−
3847− Copyright 2004, The University Court of the University of Glasgow.
3848− All rights reserved.
3849−
3850− Redistribution and use in source and binary forms, with or without
3851− modification, are permitted provided that the following conditions are met:
3852−
3853− - Redistributions of source code must retain the above copyright notice,
3854− this list of conditions and the following disclaimer.
3855−
3856− - Redistributions in binary form must reproduce the above copyright notice,
3857− this list of conditions and the following disclaimer in the documentation
3858− and/or other materials provided with the distribution.
3859−
3860− - Neither name of the University nor the names of its contributors may be
3861− used to endorse or promote products derived from this software without
3862− specific prior written permission.
3863−
3864− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3865− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3866− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3867− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3868− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3869− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3870− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3871− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3872− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3873− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3874− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3875− DAMAGE.
3876−
3877−transformers-base LICENSE file:
3878−
3879− Copyright (c) 2011, Mikhail Vorozhtsov, Bas van Dijk
3880− All rights reserved.
3881−
3882− Redistribution and use in source and binary forms, with or without
3883− modification, are permitted provided that the following conditions are met:
3884−
3885− - Redistributions of source code must retain the above copyright notice,
3886− this list of conditions and the following disclaimer.
3887− - Redistributions in binary form must reproduce the above copyright
3888− notice, this list of conditions and the following disclaimer in the
3889− documentation and/or other materials provided with the distribution.
3890− - Neither the names of the copyright owners nor the names of the
3891− contributors may be used to endorse or promote products derived
3892− from this software without specific prior written permission.
3893−
3894− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3895− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3896− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3897− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3898− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3899− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
3900− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
3901− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
3902− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
3903− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
3904− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3905−
3906−
3907−transformers-compat LICENSE file:
3908−
3909− Copyright 2012-2015 Edward Kmett
3910−
3911− All rights reserved.
3912−
3913− Redistribution and use in source and binary forms, with or without
3914− modification, are permitted provided that the following conditions
3915− are met:
3916−
3917− 1. Redistributions of source code must retain the above copyright
3918− notice, this list of conditions and the following disclaimer.
3919−
3920− 2. Redistributions in binary form must reproduce the above copyright
3921− notice, this list of conditions and the following disclaimer in the
3922− documentation and/or other materials provided with the distribution.
3923−
3924− 3. Neither the name of the author nor the names of his contributors
3925− may be used to endorse or promote products derived from this software
3926− without specific prior written permission.
3927−
3928− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
3929− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
3930− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
3931− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
3932− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3933− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3934− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3935− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
3936− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
3937− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
3938− POSSIBILITY OF SUCH DAMAGE.
3939−
3940−unix LICENSE file:
3941−
3942− The Glasgow Haskell Compiler License
3943−
3944− Copyright 2004, The University Court of the University of Glasgow.
3945− All rights reserved.
3946−
3947− Redistribution and use in source and binary forms, with or without
3948− modification, are permitted provided that the following conditions are met:
3949−
3950− - Redistributions of source code must retain the above copyright notice,
3951− this list of conditions and the following disclaimer.
3952−
3953− - Redistributions in binary form must reproduce the above copyright notice,
3954− this list of conditions and the following disclaimer in the documentation
3955− and/or other materials provided with the distribution.
3956−
3957− - Neither name of the University nor the names of its contributors may be
3958− used to endorse or promote products derived from this software without
3959− specific prior written permission.
3960−
3961− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
3962− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
3963− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
3964− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
3965− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
3966− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3967− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
3968− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
3969− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3970− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3971− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
3972− DAMAGE.
3973−
3974−unix-compat LICENSE file:
3975−
3976− Copyright (c) 2007-2008, Björn Bringert
3977− Copyright (c) 2007-2009, Duncan Coutts
3978− Copyright (c) 2010-2011, Jacob Stanley
3979− Copyright (c) 2011, Bryan O'Sullivan
3980− All rights reserved.
3981−
3982− Redistribution and use in source and binary forms, with or without
3983− modification, are permitted provided that the following conditions are met:
3984−
3985− - Redistributions of source code must retain the above copyright notice,
3986− this list of conditions and the following disclaimer.
3987− - Redistributions in binary form must reproduce the above copyright
3988− notice, this list of conditions and the following disclaimer in the
3989− documentation and/or other materials provided with the distribution.
3990− - Neither the names of the copyright owners nor the names of the
3991− contributors may be used to endorse or promote products derived
3992− from this software without specific prior written permission.
3993−
3994− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
3995− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
3996− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
3997− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
3998− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
3999− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
4000− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
4001− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
4002− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
4003− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
4004− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
4005−
4006−unix-time LICENSE file:
4007−
4008− Copyright (c) 2009, IIJ Innovation Institute Inc.
4009− All rights reserved.
4010−
4011− Redistribution and use in source and binary forms, with or without
4012− modification, are permitted provided that the following conditions
4013− are met:
4014−
4015− * Redistributions of source code must retain the above copyright
4016− notice, this list of conditions and the following disclaimer.
4017− * Redistributions in binary form must reproduce the above copyright
4018− notice, this list of conditions and the following disclaimer in
4019− the documentation and/or other materials provided with the
4020− distribution.
4021− * Neither the name of the copyright holders nor the names of its
4022− contributors may be used to endorse or promote products derived
4023− from this software without specific prior written permission.
4024−
4025− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
4026− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
4027− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
4028− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
4029− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
4030− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
4031− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
4032− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
4033− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
4034− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
4035− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
4036− POSSIBILITY OF SUCH DAMAGE.
4037−
4038−unordered-containers LICENSE file:
4039−
4040− Copyright (c) 2010, Johan Tibell
4041−
4042− All rights reserved.
4043−
4044− Redistribution and use in source and binary forms, with or without
4045− modification, are permitted provided that the following conditions are met:
4046−
4047− * Redistributions of source code must retain the above copyright
4048− notice, this list of conditions and the following disclaimer.
4049−
4050− * Redistributions in binary form must reproduce the above
4051− copyright notice, this list of conditions and the following
4052− disclaimer in the documentation and/or other materials provided
4053− with the distribution.
4054−
4055− * Neither the name of Johan Tibell nor the names of other
4056− contributors may be used to endorse or promote products derived
4057− from this software without specific prior written permission.
4058−
4059− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
4060− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
4061− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
4062− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
4063− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
4064− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
4065− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
4066− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
4067− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
4068− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
4069− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
4070−
4071−utf8-string LICENSE file:
4072−
4073− * Copyright (c) 2007, Galois Inc.
4074− * All rights reserved.
4075− *
4076− * Redistribution and use in source and binary forms, with or without
4077− * modification, are permitted provided that the following conditions are met:
4078− * * Redistributions of source code must retain the above copyright
4079− * notice, this list of conditions and the following disclaimer.
4080− * * Redistributions in binary form must reproduce the above copyright
4081− * notice, this list of conditions and the following disclaimer in the
4082− * documentation and/or other materials provided with the distribution.
4083− * * Neither the name of Galois Inc. nor the
4084− * names of its contributors may be used to endorse or promote products
4085− * derived from this software without specific prior written permission.
4086− *
4087− * THIS SOFTWARE IS PROVIDED BY Galois Inc. ``AS IS'' AND ANY
4088− * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
4089− * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
4090− * DISCLAIMED. IN NO EVENT SHALL Galois Inc. BE LIABLE FOR ANY
4091− * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
4092− * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
4093− * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
4094− * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
4095− * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
4096− * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
4097−
4098−vault LICENSE file:
4099−
4100− Copyright (c)2011, Heinrich Apfelmus
4101−
4102− All rights reserved.
4103−
4104− Redistribution and use in source and binary forms, with or without
4105− modification, are permitted provided that the following conditions are met:
4106−
4107− * Redistributions of source code must retain the above copyright
4108− notice, this list of conditions and the following disclaimer.
4109−
4110− * Redistributions in binary form must reproduce the above
4111− copyright notice, this list of conditions and the following
4112− disclaimer in the documentation and/or other materials provided
4113− with the distribution.
4114−
4115− * Neither the name of Heinrich Apfelmus nor the names of other
4116− contributors may be used to endorse or promote products derived
4117− from this software without specific prior written permission.
4118−
4119− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
4120− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
4121− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
4122− A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
4123− OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
4124− SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
4125− LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
4126− DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
4127− THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
4128− (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
4129− OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
4130−
4131−vector LICENSE file:
4132−
4133− Copyright (c) 2008-2012, Roman Leshchinskiy
4134− All rights reserved.
4135−
4136− Redistribution and use in source and binary forms, with or without
4137− modification, are permitted provided that the following conditions are met:
4138−
4139− - Redistributions of source code must retain the above copyright notice,
4140− this list of conditions and the following disclaimer.
4141−
4142− - Redistributions in binary form must reproduce the above copyright notice,
4143− this list of conditions and the following disclaimer in the documentation
4144− and/or other materials provided with the distribution.
4145−
4146− - Neither name of the University nor the names of its contributors may be
4147− used to endorse or promote products derived from this software without
4148− specific prior written permission.
4149−
4150− THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
4151− GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
4152− INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
4153− FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
4154− UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
4155− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
4156− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
4157− SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
4158− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
4159− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
4160− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
4161− DAMAGE.
4162−
4163−
4164−void LICENSE file:
4165−
4166− Copyright 2015 Edward Kmett
4167−
4168− All rights reserved.
4169−
4170− Redistribution and use in source and binary forms, with or without
4171− modification, are permitted provided that the following conditions
4172− are met:
4173−
4174− 1. Redistributions of source code must retain the above copyright
4175− notice, this list of conditions and the following disclaimer.
4176−
4177− 2. Redistributions in binary form must reproduce the above copyright
4178− notice, this list of conditions and the following disclaimer in the
4179− documentation and/or other materials provided with the distribution.
4180−
4181− 3. Neither the name of the author nor the names of his contributors
4182− may be used to endorse or promote products derived from this software
4183− without specific prior written permission.
4184−
4185− THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
4186− IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
4187− WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
4188− DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
4189− ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
4190− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
4191− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
4192− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
4193− STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
4194− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
4195− POSSIBILITY OF SUCH DAMAGE.
4196−
4197−wai LICENSE file:
4198−
4199− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
4200−
4201− Permission is hereby granted, free of charge, to any person obtaining
4202− a copy of this software and associated documentation files (the
4203− "Software"), to deal in the Software without restriction, including
4204− without limitation the rights to use, copy, modify, merge, publish,
4205− distribute, sublicense, and/or sell copies of the Software, and to
4206− permit persons to whom the Software is furnished to do so, subject to
4207− the following conditions:
4208−
4209− The above copyright notice and this permission notice shall be
4210− included in all copies or substantial portions of the Software.
4211−
4212− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
4213− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
4214− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
4215− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
4216− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
4217− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
4218− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
4219−
4220−wai-app-static LICENSE file:
4221−
4222− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
4223−
4224− Permission is hereby granted, free of charge, to any person obtaining
4225− a copy of this software and associated documentation files (the
4226− "Software"), to deal in the Software without restriction, including
4227− without limitation the rights to use, copy, modify, merge, publish,
4228− distribute, sublicense, and/or sell copies of the Software, and to
4229− permit persons to whom the Software is furnished to do so, subject to
4230− the following conditions:
4231−
4232− The above copyright notice and this permission notice shall be
4233− included in all copies or substantial portions of the Software.
4234−
4235− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
4236− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
4237− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
4238− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
4239− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
4240− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
4241− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
4242−
4243−wai-extra LICENSE file:
4244−
4245− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
4246−
4247− Permission is hereby granted, free of charge, to any person obtaining
4248− a copy of this software and associated documentation files (the
4249− "Software"), to deal in the Software without restriction, including
4250− without limitation the rights to use, copy, modify, merge, publish,
4251− distribute, sublicense, and/or sell copies of the Software, and to
4252− permit persons to whom the Software is furnished to do so, subject to
4253− the following conditions:
4254−
4255− The above copyright notice and this permission notice shall be
4256− included in all copies or substantial portions of the Software.
4257−
4258− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
4259− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
4260− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
4261− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
4262− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
4263− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
4264− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
4265−
4266−wai-logger LICENSE file:
4267−
4268− Copyright (c) 2009, IIJ Innovation Institute Inc.
4269− All rights reserved.
3+All rights reserved.
42704
4271− Redistribution and use in source and binary forms, with or without
4272− modification, are permitted provided that the following conditions
4273− are met:
5+Redistribution and use in source and binary forms, with or without
6+modification, are permitted provided that the following conditions are met:
42747
42758 * Redistributions of source code must retain the above copyright
42769 notice, this list of conditions and the following disclaimer.
4277− * Redistributions in binary form must reproduce the above copyright
4278− notice, this list of conditions and the following disclaimer in
4279− the documentation and/or other materials provided with the
4280− distribution.
4281− * Neither the name of the copyright holders nor the names of its
4282− contributors may be used to endorse or promote products derived
4283− from this software without specific prior written permission.
4284−
4285− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
4286− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
4287− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
4288− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
4289− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
4290− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
4291− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
4292− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
4293− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
4294− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
4295− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
4296− POSSIBILITY OF SUCH DAMAGE.
4297−
4298−wai-websockets LICENSE file:
4299−
4300− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
4301−
4302− Permission is hereby granted, free of charge, to any person obtaining
4303− a copy of this software and associated documentation files (the
4304− "Software"), to deal in the Software without restriction, including
4305− without limitation the rights to use, copy, modify, merge, publish,
4306− distribute, sublicense, and/or sell copies of the Software, and to
4307− permit persons to whom the Software is furnished to do so, subject to
4308− the following conditions:
4309−
4310− The above copyright notice and this permission notice shall be
4311− included in all copies or substantial portions of the Software.
4312−
4313− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
4314− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
4315− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
4316− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
4317− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
4318− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
4319− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
4320−
4321−warp LICENSE file:
4322−
4323− Copyright (c) 2012 Michael Snoyman, http://www.yesodweb.com/
4324−
4325− Permission is hereby granted, free of charge, to any person obtaining
4326− a copy of this software and associated documentation files (the
4327− "Software"), to deal in the Software without restriction, including
4328− without limitation the rights to use, copy, modify, merge, publish,
4329− distribute, sublicense, and/or sell copies of the Software, and to
4330− permit persons to whom the Software is furnished to do so, subject to
4331− the following conditions:
4332−
4333− The above copyright notice and this permission notice shall be
4334− included in all copies or substantial portions of the Software.
4335−
4336− THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
4337− EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
4338− MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
4339− NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
4340− LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
4341− OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
4342− WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
434310
4344−websockets LICENSE file:
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.
434515
4346− Page not found: Sorry, it's just not here.
4347−
4348−word8 LICENSE file:
4349−
4350− Copyright (c) 2012, IIJ Innovation Institute Inc.
4351− All rights reserved.
4352−
4353− Redistribution and use in source and binary forms, with or without
4354− modification, are permitted provided that the following conditions
4355− are met:
4356−
4357− * Redistributions of source code must retain the above copyright
4358− notice, this list of conditions and the following disclaimer.
4359− * Redistributions in binary form must reproduce the above copyright
4360− notice, this list of conditions and the following disclaimer in
4361− the documentation and/or other materials provided with the
4362− distribution.
4363− * 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
436417 contributors may be used to endorse or promote products derived
436518 from this software without specific prior written permission.
436619
4367− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
4368− "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
4369− LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
4370− FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
4371− COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
4372− INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
4373− BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
4374− LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
4375− CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
4376− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
4377− ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
4378− POSSIBILITY OF SUCH DAMAGE.
4379−
4380−x509 LICENSE file:
4381−
4382− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
4383−
4384− All rights reserved.
4385−
4386− Redistribution and use in source and binary forms, with or without
4387− modification, are permitted provided that the following conditions
4388− are met:
4389− 1. Redistributions of source code must retain the above copyright
4390− notice, this list of conditions and the following disclaimer.
4391− 2. Redistributions in binary form must reproduce the above copyright
4392− notice, this list of conditions and the following disclaimer in the
4393− documentation and/or other materials provided with the distribution.
4394− 3. Neither the name of the author nor the names of his contributors
4395− may be used to endorse or promote products derived from this software
4396− without specific prior written permission.
4397−
4398− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
4399− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
4400− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
4401− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
4402− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
4403− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
4404− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
4405− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
4406− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
4407− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
4408− SUCH DAMAGE.
4409−
4410−x509-store LICENSE file:
4411−
4412− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
4413−
4414− All rights reserved.
4415−
4416− Redistribution and use in source and binary forms, with or without
4417− modification, are permitted provided that the following conditions
4418− are met:
4419− 1. Redistributions of source code must retain the above copyright
4420− notice, this list of conditions and the following disclaimer.
4421− 2. Redistributions in binary form must reproduce the above copyright
4422− notice, this list of conditions and the following disclaimer in the
4423− documentation and/or other materials provided with the distribution.
4424− 3. Neither the name of the author nor the names of his contributors
4425− may be used to endorse or promote products derived from this software
4426− without specific prior written permission.
4427−
4428− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
4429− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
4430− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
4431− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
4432− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
4433− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
4434− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
4435− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
4436− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
4437− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
4438− SUCH DAMAGE.
4439−
4440−x509-system LICENSE file:
4441−
4442− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
4443−
4444− All rights reserved.
4445−
4446− Redistribution and use in source and binary forms, with or without
4447− modification, are permitted provided that the following conditions
4448− are met:
4449− 1. Redistributions of source code must retain the above copyright
4450− notice, this list of conditions and the following disclaimer.
4451− 2. Redistributions in binary form must reproduce the above copyright
4452− notice, this list of conditions and the following disclaimer in the
4453− documentation and/or other materials provided with the distribution.
4454− 3. Neither the name of the author nor the names of his contributors
4455− may be used to endorse or promote products derived from this software
4456− without specific prior written permission.
4457−
4458− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
4459− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
4460− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
4461− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
4462− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
4463− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
4464− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
4465− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
4466− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
4467− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
4468− SUCH DAMAGE.
4469−
4470−x509-validation LICENSE file:
4471−
4472− Copyright (c) 2010-2013 Vincent Hanquez <vincent@snarc.org>
4473−
4474− All rights reserved.
4475−
4476− Redistribution and use in source and binary forms, with or without
4477− modification, are permitted provided that the following conditions
4478− are met:
4479− 1. Redistributions of source code must retain the above copyright
4480− notice, this list of conditions and the following disclaimer.
4481− 2. Redistributions in binary form must reproduce the above copyright
4482− notice, this list of conditions and the following disclaimer in the
4483− documentation and/or other materials provided with the distribution.
4484− 3. Neither the name of the author nor the names of his contributors
4485− may be used to endorse or promote products derived from this software
4486− without specific prior written permission.
4487−
4488− THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
4489− ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
4490− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
4491− ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
4492− FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
4493− DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
4494− OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
4495− HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
4496− LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
4497− OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
4498− SUCH DAMAGE.
4499−
4500−zlib LICENSE file:
4501−
4502− Copyright (c) 2006-2015, Duncan Coutts
4503− All rights reserved.
4504−
4505− Redistribution and use in source and binary forms, with or without
4506− modification, are permitted provided that the following conditions are met:
4507−
4508− 1. Redistributions of source code must retain the above copyright notice,
4509− this list of conditions and the following disclaimer.
4510− 2. Redistributions in binary form must reproduce the above copyright
4511− notice, this list of conditions and the following disclaimer in the
4512− documentation and/or other materials provided with the distribution.
4513− 3. This clause is intentionally left blank.
4514−
4515− THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
4516− AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
4517− IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
4518− ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
4519− LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
4520− CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
4521− SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
4522− INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
4523− CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
4524− ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
4525− POSSIBILITY OF SUCH DAMAGE.
4526−
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−51
@@ -1,51 +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− RELEASE_USER: purescript
7− RELEASE_REPO: purescript
8−cache:
9−- c:\s -> appveyor/cache-buster.txt
10−install:
11−- git submodule update --init
12−- ps: Install-Product node 5
13−- npm install -g bower
14−
15−- ps: |
16− New-Item -ItemType Directory -Force -Path C:\tools
17− $env:Path += ";C:\tools"
18− (New-Object Net.WebClient).DownloadFile('https://www.stackage.org/stack/windows-x86_64', 'c:\tools\stack.zip')
19− pushd c:\tools
20− 7z x c:\tools\stack.zip stack.exe
21− popd
22−
23−- stack --no-terminal --verbosity=error setup 1>stack-setup.log 2>&1 || type stack-setup.log
24−
25−build_script:
26−# Override the default build script.
27−- echo ""
28−test_script:
29−- stack -j1 --no-terminal test --pedantic
30−on_success:
31−- ps: |
32− function UploadFile
33− {
34− github-release upload --user $env:RELEASE_USER --repo $env:RELEASE_REPO --tag $env:APPVEYOR_REPO_TAG_NAME --file $args[0] --name $args[0]
35− }
36−
37− if ($env:APPVEYOR_REPO_TAG_NAME)
38− {
39− bash ./bundle/build.sh win64
40−
41− (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')
42− pushd c:\tools
43− 7z x github-release.zip bin/windows/amd64/github-release.exe
44− Copy-Item bin/windows/amd64/github-release.exe github-release.exe
45− popd
46−
47− pushd bundle
48− UploadFile win64.tar.gz
49− UploadFile win64.sha
50− popd
51− }
appveyor/cache-buster.txtdeleted−8
@@ -1,8 +0,0 @@
1−This file acts as a cache buster for the AppVeyor (Windows CI) build
2−cache. In order to invalidate the AppVeyor build cache, simply make a
3−change to the number at the end of this file and commit.
4−
5−See http://www.appveyor.com/docs/build-cache#cache-dependencies for more
6−information.
7−
8−Increment me to invalidate the cache: 0
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.shdeleted−65
@@ -1,65 +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− if [ "$OS" != "win64" ]
33− then
34− strip "$FULL_BIN"
35− fi
36− cp "$FULL_BIN" bundle/build/purescript
37−done
38−
39−# Copy extra files to the staging directory
40−cp bundle/README bundle/build/purescript/
41−cp LICENSE bundle/build/purescript/
42−cp INSTALL.md bundle/build/purescript/
43−
44−stack list-dependencies >bundle/build/purescript/dependencies.txt
45−
46−# Make the binary bundle
47−pushd bundle/build > /dev/null
48−tar -zcvf ../${OS}.tar.gz purescript
49−popd > /dev/null
50−
51−# Calculate the SHA hash
52−if [ "$OS" = "win64" ]
53−then
54− # msys/mingw does not include shasum. :(
55− SHASUM="openssl dgst -sha1"
56−else
57− SHASUM="shasum"
58−fi
59−
60−$SHASUM bundle/${OS}.tar.gz > bundle/${OS}.sha
61−
62−# Remove the staging directory
63−rm -rf build/
64−
65−popd > /dev/null
core-tests/.gitignoredeleted−3
@@ -1,3 +0,0 @@
1−core-docs.md
2−bower_components/
3−output/
core-tests/bower.jsondeleted−60
@@ -1,60 +0,0 @@
1−{
2− "name": "core-tests",
3− "homepage": "https://github.com/purescript/purescript",
4− "authors": [
5− "Phil Freeman <paf31@cantab.net>"
6− ],
7− "ignore": [
8− "**/.*",
9− "node_modules",
10− "bower_components",
11− "test",
12− "tests"
13− ],
14− "dependencies": {
15− "purescript-arrays": "#8c9ada5762",
16− "purescript-bifunctors": "#9e3b2864ce",
17− "purescript-console": "#db29da9aca",
18− "purescript-const": "#cf538a65d8",
19− "purescript-contravariant": "#9ae6d7c99c",
20− "purescript-control": "#97096c7e26",
21− "purescript-distributive": "#ba81c64ffd",
22− "purescript-eff": "#dbd6c4a415",
23− "purescript-either": "#54f4efd423",
24− "purescript-enums": "#9332412e52",
25− "purescript-exceptions": "#522a0cea50",
26− "purescript-exists": "#e828c8341e",
27− "purescript-foldable-traversable": "#df37787855",
28− "purescript-foreign": "#64890cbbdb",
29− "purescript-free": "#f8ab7c5f05",
30− "purescript-functions": "#e417541936",
31− "purescript-functor-coproducts": "#7654d9dea4",
32− "purescript-generics": "#d09cb16ca3",
33− "purescript-globals": "#113ee398be",
34− "purescript-graphs": "#0b7089afa2",
35− "purescript-identity": "#204ac5f46a",
36− "purescript-inject": "#3ae4880bad",
37− "purescript-integers": "#58d7605dd5",
38− "purescript-lazy": "#bf4b34d673",
39− "purescript-maps": "#d9e4c6599a",
40− "purescript-math": "#99797b6494",
41− "purescript-maybe": "#1b60a07038",
42− "purescript-monoid": "#a8c8bb9d73",
43− "purescript-parallel": "#c7296ab008",
44− "purescript-prelude": "#318ee857bd",
45− "purescript-profunctor": "#a649126cea",
46− "purescript-proxy": "#c494b11bd7",
47− "purescript-quickcheck": "#4a15c93f12",
48− "purescript-random": "#68314c21e2",
49− "purescript-refs": "#f47e1059a3",
50− "purescript-semirings": "#c40efda15f",
51− "purescript-sets": "#1eaabf177f",
52− "purescript-st": "#077d9a2d7e",
53− "purescript-strings": "#87dd5f1694",
54− "purescript-tailrec": "#3c11db00ba",
55− "purescript-transformers": "#2d0a471ce4",
56− "purescript-tuples": "#4fe689ef93",
57− "purescript-unfoldable": "#e2382f30d8",
58− "purescript-validation": "#f43ff0fbdd"
59− }
60−}
core-tests/test-everything.shdeleted−33
@@ -1,33 +0,0 @@
1−#!/usr/bin/env 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−# todo : fix this once core libraries reach 1.0
22−yes 1 | bower i
23−
24−if [ "$force_recompile" = "true" ] && [ -d "output" ]; then
25− echo "Recompiling..."
26− rm -r output
27−fi
28−
29−stack exec psc 'tests/**/*.purs' 'bower_components/purescript-*/src/**/*.purs'
30−
31−stack exec psc-docs 'bower_components/purescript-*/src/**/*.purs' > core-docs.md
32−
33−NODE_PATH=output node -e "require('Test.Main').main()"
core-tests/tests/GenericDeriving.pursdeleted−30
@@ -1,30 +0,0 @@
1−module Test.GenericDeriving where
2−
3−import Prelude
4−
5−import Control.Monad.Eff (Eff)
6−import Control.Monad.Eff.Console (CONSOLE, log, logShow)
7−import Data.Generic (class Generic, gShow, gEq)
8−import Partial.Unsafe (unsafePartial)
9−
10−data Empty
11−
12−derive instance genericEmpty :: Partial => Generic Empty
13−
14−data A a
15− = A Number String
16− | B Int
17− | C (Array (A a))
18− | D { "asgård" :: a }
19− | E Empty
20−
21−derive instance genericA :: (Partial, Generic b) => Generic (A b)
22−
23−newtype X b = X b
24−
25−derive instance genericX :: Generic (X String)
26−
27−main :: forall eff. Eff (console :: CONSOLE | eff) Unit
28−main = unsafePartial do
29− log $ gShow (D { "asgård": C [ A 1.0 "test", B 42, D { "asgård": true } ] })
30− logShow $ gEq (C [B 0]) (C [B 0] :: A Empty)
core-tests/tests/Main.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Test.Main where
2−
3−import Prelude
4−import Control.Monad.Eff (Eff)
5−import Control.Monad.Eff.Console (CONSOLE)
6−import Test.GenericDeriving as GenericDeriving
7−
8−main :: forall eff. Eff (console :: CONSOLE | eff) Unit
9−main = GenericDeriving.main
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−4
@@ -1,4 +0,0 @@
1−module Clash (module Clash1) where
2−
3−import Clash1 as Clash1
4−import Clash2 as Clash2
examples/docs/src/Clash1.pursdeleted−3
@@ -1,3 +0,0 @@
1−module Clash1 (module Clash1a) where
2−
3−import Clash1a
examples/docs/src/Clash1a.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Clash1a where
2−
3−value :: Int
4−value = 0
5−
6−type Type = Int
7−
8−class TypeClass a where
9− typeClassMember :: a
examples/docs/src/Clash2.pursdeleted−3
@@ -1,3 +0,0 @@
1−module Clash2 (module Clash2a) where
2−
3−import Clash2a
examples/docs/src/Clash2a.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Clash2a where
2−
3−value :: String
4−value = "hello"
5−
6−type Type = String
7−
8−class TypeClass a b where
9− 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−18
@@ -1,18 +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
17−
18−foreign import nestedForAll :: forall c. (forall a b. c)
examples/docs/src/ImportedTwice.pursdeleted−13
@@ -1,13 +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 ImportedTwiceA
8− , module ImportedTwiceB
9− )
10− where
11−
12−import ImportedTwiceA
13−import ImportedTwiceB
examples/docs/src/ImportedTwiceA.pursdeleted−8
@@ -1,8 +0,0 @@
1−module ImportedTwiceA
2− ( module ImportedTwiceB )
3− where
4−
5−import ImportedTwiceB
6−
7−bar :: Int
8−bar = 1
examples/docs/src/ImportedTwiceB.pursdeleted−4
@@ -1,4 +0,0 @@
1−module ImportedTwiceB where
2−
3−foo :: Int
4−foo = 0
examples/docs/src/MultiVirtual.pursdeleted−6
@@ -1,6 +0,0 @@
1−module MultiVirtual
2− ( module X )
3− where
4−
5−import MultiVirtual1 as X
6−import MultiVirtual2 as X
examples/docs/src/MultiVirtual1.pursdeleted−4
@@ -1,4 +0,0 @@
1−module MultiVirtual1 where
2−
3−foo :: Int
4−foo = 1
examples/docs/src/MultiVirtual2.pursdeleted−9
@@ -1,9 +0,0 @@
1−module MultiVirtual2
2− ( module MultiVirtual2
3− , module MultiVirtual3
4− ) where
5−
6−import MultiVirtual3
7−
8−bar :: Int
9−bar = 2
examples/docs/src/MultiVirtual3.pursdeleted−4
@@ -1,4 +0,0 @@
1−module MultiVirtual3 where
2−
3−baz :: Int
4−baz = 3
examples/docs/src/NewOperators.pursdeleted−5
@@ -1,5 +0,0 @@
1−module NewOperators
2− ( module NewOperators2 )
3− where
4−
5−import NewOperators2
examples/docs/src/NewOperators2.pursdeleted−6
@@ -1,6 +0,0 @@
1−module NewOperators2 where
2−
3−infixl 8 _compose as >>>
4−
5−_compose :: forall a b c. (b -> c) -> (a -> b) -> (a -> c)
6−_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/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−5
@@ -1,5 +0,0 @@
1−module TypeClassWithoutMembers
2− ( module TypeClassWithoutMembersIntermediate )
3− where
4−
5−import TypeClassWithoutMembersIntermediate
examples/docs/src/TypeClassWithoutMembersIntermediate.pursdeleted−5
@@ -1,5 +0,0 @@
1−module TypeClassWithoutMembersIntermediate
2− ( module SomeTypeClass )
3− where
4−
5−import SomeTypeClass (class 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−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith UnknownName
2−module Main where
3−
4−import Thingy as Thing
5−
6−main = Thing.doesntExist "hi"
examples/failing/1733/Thingy.pursdeleted−4
@@ -1,4 +0,0 @@
1−module Thingy where
2−
3−foo :: Int
4−foo = 1
examples/failing/1825.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith UnknownName
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/2128-class.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Main where
3−
4−class Foo a where
5− foo :: a -> !!!
examples/failing/2128-instance.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Main where
3−
4−class Foo a where
5− foo :: a
6−
7−instance fooInt :: Foo Int where
8− foo = !!!
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/ArgLengthMismatch.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith ArgListLengthsDiffer
2−module ArgLengthMismatch where
3−
4−import Prelude
5−
6−f x y = true
7−f = false
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−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−foreign import ix :: forall a. Array a -> Int -> a
5−
6−test = \arr -> arr `ix` (0 `ix` 0)
examples/failing/CannotDeriveNewtypeForData.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith CannotDeriveNewtypeForData
2−module CannotDeriveNewtypeForData where
3−
4−import Data.Newtype
5−
6−data Test = Test String
7−
8−derive instance newtypeTest :: Newtype Test _
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−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith ScopeConflict
2−-- Fails here because re-exporting forces any scope conflicts to be resolved
3−module Main (module A, module B) where
4−
5− import A
6− import B
examples/failing/ConflictingExports/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
examples/failing/ConflictingExports/B.pursdeleted−4
@@ -1,4 +0,0 @@
1−module B where
2−
3−thing :: Int
4−thing = 2
examples/failing/ConflictingImports.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith ScopeConflict
2−module Main where
3−
4−import A
5−import B
6−
7−-- Error due to referencing `thing` which is in scope as A.thing and B.thing
8−what :: Int
9−what = thing
examples/failing/ConflictingImports/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
examples/failing/ConflictingImports/B.pursdeleted−4
@@ -1,4 +0,0 @@
1−module B where
2−
3−thing :: Int
4−thing = 2
examples/failing/ConflictingImports2.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith ScopeConflict
2−module Main where
3−
4−import A (thing)
5−import B (thing)
6−
7−-- Error due to referencing `thing` which is explicitly in scope as A.thing
8−-- and B.thing
9−what :: Int
10−what = thing
examples/failing/ConflictingImports2/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
examples/failing/ConflictingImports2/B.pursdeleted−4
@@ -1,4 +0,0 @@
1−module B where
2−
3−thing :: Int
4−thing = 2
examples/failing/ConflictingQualifiedImports.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith ScopeConflict
2−module Main where
3−
4−import A as X
5−import B as X
6−
7−foo = X.thing
examples/failing/ConflictingQualifiedImports/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
examples/failing/ConflictingQualifiedImports/B.pursdeleted−4
@@ -1,4 +0,0 @@
1−module B where
2−
3−thing :: Int
4−thing = 2
examples/failing/ConflictingQualifiedImports2.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith ScopeConflict
2−module Main (module X) where
3−
4−import A as X
5−import B as X
examples/failing/ConflictingQualifiedImports2/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
examples/failing/ConflictingQualifiedImports2/B.pursdeleted−4
@@ -1,4 +0,0 @@
1−module B where
2−
3−thing :: Int
4−thing = 2
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/DeclConflictClassCtor.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−data T = Fail
5−
6−class Fail
examples/failing/DeclConflictClassSynonym.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−import Prelude
5−
6−type Fail = Unit
7−
8−class Fail
examples/failing/DeclConflictClassType.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−class Fail
5−
6−data Fail
examples/failing/DeclConflictCtorClass.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−class Fail
5−
6−data T = Fail
examples/failing/DeclConflictCtorCtor.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−data T1 = Fail
5−
6−data T2 = Fail
examples/failing/DeclConflictSynonymClass.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−import Prelude
5−
6−class Fail
7−
8−type Fail = Unit
examples/failing/DeclConflictSynonymType.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−import Prelude
5−
6−data Fail
7−
8−type Fail = Unit
examples/failing/DeclConflictTypeClass.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−class Fail
5−
6−data Fail
examples/failing/DeclConflictTypeSynonym.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−import Prelude
5−
6−type Fail = Unit
7−
8−data Fail
examples/failing/DeclConflictTypeType.pursdeleted−6
@@ -1,6 +0,0 @@
1−-- @shouldFailWith DeclConflict
2−module Main where
3−
4−data Fail
5−
6−data Fail
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 TypesDoNotUnify
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/DuplicateModule.pursdeleted−2
@@ -1,2 +0,0 @@
1−-- @shouldFailWith DuplicateModule
2−module M1 where
examples/failing/DuplicateModule/M1.pursdeleted−1
@@ -1 +0,0 @@
1−module M1 where
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/ExportConflictClass.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith ExportConflict
2−module C (module A, module B) where
3−
4−import A as A
5−import B as B
examples/failing/ExportConflictClass/A.pursdeleted−3
@@ -1,3 +0,0 @@
1−module A where
2−
3−class X
examples/failing/ExportConflictClass/B.pursdeleted−3
@@ -1,3 +0,0 @@
1−module B where
2−
3−class X
examples/failing/ExportConflictCtor.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith ExportConflict
2−module C (module A, module B) where
3−
4−import A as A
5−import B as B
examples/failing/ExportConflictCtor/A.pursdeleted−3
@@ -1,3 +0,0 @@
1−module A where
2−
3−data T1 = X
examples/failing/ExportConflictCtor/B.pursdeleted−3
@@ -1,3 +0,0 @@
1−module B where
2−
3−data T2 = X
examples/failing/ExportConflictType.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith ExportConflict
2−module C (module A, module B) where
3−
4−import A as A
5−import B as B
examples/failing/ExportConflictType/A.pursdeleted−3
@@ -1,3 +0,0 @@
1−module A where
2−
3−data T
examples/failing/ExportConflictType/B.pursdeleted−3
@@ -1,3 +0,0 @@
1−module B where
2−
3−data T
examples/failing/ExportConflictTypeOp.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith ExportConflict
2−module C (module A, module B) where
3−
4−import A as A
5−import B as B
examples/failing/ExportConflictTypeOp/A.pursdeleted−5
@@ -1,5 +0,0 @@
1−module A where
2−
3−type T1 a b = a -> b
4−
5−infixr 4 type T1 as ??
examples/failing/ExportConflictTypeOp/B.pursdeleted−5
@@ -1,5 +0,0 @@
1−module B where
2−
3−type T2 a b = a -> b
4−
5−infixr 4 type T2 as ??
examples/failing/ExportConflictValue.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith ExportConflict
2−module C (module A, module B) where
3−
4−import A as A
5−import B as B
examples/failing/ExportConflictValue/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−x :: Boolean
4−x = true
examples/failing/ExportConflictValue/B.pursdeleted−4
@@ -1,4 +0,0 @@
1−module B where
2−
3−x :: Boolean
4−x = false
examples/failing/ExportConflictValueOp.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldFailWith ExportConflict
2−module C (module A, module B) where
3−
4−import A as A
5−import B as B
examples/failing/ExportConflictValueOp/A.pursdeleted−6
@@ -1,6 +0,0 @@
1−module A where
2−
3−f1 :: forall a b. a -> b -> a
4−f1 x _ = x
5−
6−infix 0 f1 as !!
examples/failing/ExportConflictValueOp/B.pursdeleted−6
@@ -1,6 +0,0 @@
1−module B where
2−
3−f2 :: forall a b. a -> b -> a
4−f2 x _ = x
5−
6−infix 0 f2 as !!
examples/failing/ExportExplicit.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith UnknownExport
2−-- should fail as z does not exist in the module
3−module M1 (x, y, z) where
4−
5−import Prelude
6−
7−x = 1
8−y = 2
examples/failing/ExportExplicit1.pursdeleted−12
@@ -1,12 +0,0 @@
1−-- @shouldFailWith UnknownName
2−module Main where
3−
4−import M1
5−import Control.Monad.Eff.Console (log)
6−
7−testX = X
8−
9−-- should fail as Y constructor is not exported from M1
10−testY = Y
11−
12−main = log "Done"
examples/failing/ExportExplicit1/M1.pursdeleted−3
@@ -1,3 +0,0 @@
1−module M1 (X(X)) where
2−
3−data X = X | Y
examples/failing/ExportExplicit2.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith UnknownExportDataConstructor
2−-- should fail as Y is not a data constructor for X
3−module M1 (X(Y)) where
4−
5−import Prelude
6−
7−data X = X
8−data Y = Y
examples/failing/ExportExplicit3.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith UnknownName
2−module Main where
3−
4−import M1 as M
5−import Control.Monad.Eff.Console (log)
6−
7−-- should fail as Z is not exported from M1
8−testZ = M.Z
9−
10−main = log "Done"
examples/failing/ExportExplicit3/M1.pursdeleted−4
@@ -1,4 +0,0 @@
1−module M1 (X(..)) where
2−
3−data X = X | Y
4−data Z = Z
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/ImportExplicit.pursdeleted−4
@@ -1,4 +0,0 @@
1−-- @shouldFailWith UnknownImport
2−module Main where
3−
4−import M1 (X(..))
examples/failing/ImportExplicit/M1.pursdeleted−3
@@ -1,3 +0,0 @@
1−module M1 where
2−
3−foo = "foo"
examples/failing/ImportExplicit2.pursdeleted−4
@@ -1,4 +0,0 @@
1−-- @shouldFailWith UnknownImportDataConstructor
2−module Main where
3−
4−import M1 (X(Z, Q))
examples/failing/ImportExplicit2/M1.pursdeleted−3
@@ -1,3 +0,0 @@
1−module M1 where
2−
3−data X = Y
examples/failing/ImportHidingModule.pursdeleted−4
@@ -1,4 +0,0 @@
1−-- @shouldFailWith ImportHidingModule
2−module Main where
3−
4−import B hiding (module A)
examples/failing/ImportHidingModule/A.pursdeleted−2
@@ -1,2 +0,0 @@
1−module A where
2−x = 1
examples/failing/ImportHidingModule/B.pursdeleted−3
@@ -1,3 +0,0 @@
1−module B (module B, module A) where
2−import A
3−y = 1
examples/failing/ImportModule.pursdeleted−4
@@ -1,4 +0,0 @@
1−-- @shouldFailWith UnknownName
2−module Main where
3−
4−import M1
examples/failing/ImportModule/M2.pursdeleted−3
@@ -1,3 +0,0 @@
1−module M2 where
2−
3−data X = X
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−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith TransitiveExportError
2−module Test where
3−
4−import InstanceExport
5−import Prelude
6−
7−test = f $ S "Test"
examples/failing/InstanceExport/InstanceExport.pursdeleted−11
@@ -1,11 +0,0 @@
1−module InstanceExport (S(..), f) where
2−
3−import Prelude
4−
5−newtype S = S String
6−
7−class F a where
8− f :: a -> String
9−
10−instance fs :: F S where
11− f (S s) = s
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 (class 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 UnknownName
2−-- @shouldFailWith UnknownName
3−module MultipleErrors2 where
4−
5−import Prelude
6−
7−foo = itDoesntExist
8−
9−bar = neitherDoesThis
examples/failing/MultipleTypeOpFixities.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith MultipleTypeOpFixities
2−module MultipleTypeOpFixities where
3−
4−import Prelude
5−
6−type Op x y = Op x y
7−
8−infix 2 type Op as !?
9−infix 2 type Op as !?
examples/failing/MultipleValueOpFixities.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith MultipleValueOpFixities
2−module MultipleValueOpFixities where
3−
4−import Prelude
5−
6−add x y = x + y
7−
8−infix 2 add as !?
9−infix 2 add as !?
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/NewtypeInstance.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith InvalidNewtypeInstance
2−module Main where
3−
4−import Prelude
5−
6−data X = X
7−
8−derive newtype instance showX :: Show X
examples/failing/NewtypeInstance2.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith InvalidNewtypeInstance
2−module Main where
3−
4−import Prelude
5−
6−data X a = X a a
7−
8−derive newtype instance showX :: Show a => Show (X a)
examples/failing/NewtypeInstance3.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith InvalidNewtypeInstance
2−module Main where
3−
4−import Prelude
5−
6−class Nullary
7−
8−derive newtype instance nullary :: Nullary
examples/failing/NewtypeInstance4.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith InvalidNewtypeInstance
2−module Main where
3−
4−import Prelude
5−
6−data X = X | Y
7−
8−derive newtype instance showX :: Show X
examples/failing/NewtypeInstance5.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith InvalidNewtypeInstance
2−module Main where
3−
4−import Prelude
5−
6−newtype X a = X a
7−
8−derive newtype instance functorX :: Functor X
examples/failing/NewtypeInstance6.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith InvalidNewtypeInstance
2−module Main where
3−
4−import Prelude
5−
6−newtype X a b = X (Array b)
7−
8−derive newtype instance functorX :: Functor 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/NonWildcardNewtypeInstance.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldFailWith NonWildcardNewtypeInstance
2−module NonWildcardNewtypeInstance where
3−
4−import Data.Newtype
5−
6−data Test = Test String
7−
8−derive instance newtypeTest :: Newtype Test String
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−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−import Prelude
5−
6−main = do
7− (true `not` _)
examples/failing/OrphanInstance.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith OrphanInstance
2−module Test where
3−
4−import Class
5−
6−instance cBoolean :: C Boolean where
7− op a = a
examples/failing/OrphanInstance/Class.pursdeleted−4
@@ -1,4 +0,0 @@
1−module Class where
2−
3−class C a where
4− op :: a -> a
examples/failing/OrphanTypeDecl.pursdeleted−4
@@ -1,4 +0,0 @@
1−-- @shouldFailWith OrphanTypeDeclaration
2−module OrphanTypeDecl where
3−
4−fn :: Number -> Boolean
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/OverlappingVars.pursdeleted−14
@@ -1,14 +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)
examples/failing/ProgrammableTypeErrors.pursdeleted−16
@@ -1,16 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−
3−module Main where
4−
5−import Prelude
6−import Control.Monad.Eff (Eff)
7−import Control.Monad.Eff.Console (log)
8−
9−class MyShow a where
10− myShow :: a -> String
11−
12−instance cannotShowFunctions :: Fail "Cannot show functions" => MyShow (a -> b) where
13− myShow _ = "unreachable"
14−
15−main :: Eff _ _
16−main = log (myShow (_ + 1))
examples/failing/ProgrammableTypeErrorsTypeString.pursdeleted−18
@@ -1,18 +0,0 @@
1−-- @shouldFailWith NoInstanceFound
2−
3−module Main where
4−
5−import Prelude
6−import Control.Monad.Eff (Eff)
7−import Control.Monad.Eff.Console (log)
8−
9−newtype MyType a = MyType a
10−
11−instance cannotShowFunctions :: Fail ("Don't want to show " <> TypeString (MyType a) <> " because.") => Show (MyType a) where
12− show _ = "unreachable"
13−
14−infixl 6 type TypeConcat as <>
15−
16−main :: Eff _ _
17−main = do
18− log $ show (MyType 2)
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/RequiredHiddenType.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith TransitiveExportError
2−-- exporting `a` should fail as `A` is hidden
3−module Foo (B(..), a, b) where
4−
5−data A = A
6−data B = B
7−
8−a = A
9−b = B
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 Control.Monad.Eff.Console (log)
5−
6−data Foo = Bar
7−type Baz = { | Foo }
8−
9−main = log "Done"
examples/failing/RowConstructors2.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith KindsDoNotUnify
2−module Main where
3−
4−import Control.Monad.Eff.Console (log)
5−
6−type Foo r = (x :: Number | r)
7−type Bar = { | Foo }
8−
9−main = log "Done"
examples/failing/RowConstructors3.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith KindsDoNotUnify
2−module Main where
3−
4−import Control.Monad.Eff.Console (log)
5−
6−type Foo = { x :: Number }
7−type Bar = { | Foo }
8−
9−main = 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−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith InvalidInstanceHead
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"
examples/failing/TypedBinders.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldFailWith ErrorParsingModule
2−module Main where
3−
4−import Control.Monad.Eff.Console (log)
5−
6−test = (\f :: Int -> Int -> f 10) id
7−
8−main = do
9− let t1 = test
10− log "Done"
examples/failing/TypedBinders2.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−import Prelude
5−import Control.Monad.Eff.Console (log)
6−
7−main = do
8− s :: String <- log "Foo"
9− log "Done"
examples/failing/TypedBinders3.pursdeleted−13
@@ -1,13 +0,0 @@
1−-- @shouldFailWith TypesDoNotUnify
2−module Main where
3−
4−import Prelude
5−import Control.Monad.Eff.Console (log)
6−
7−test = case 1 of
8− (0 :: String) -> true
9− _ -> false
10−
11−main = do
12− let t = test
13− 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 Control.Monad.Eff.Console (log)
5−
6−main = log "Done"
examples/failing/UnknownType.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldFailWith UnknownName
2−module Main where
3−
4−import Prelude
5−
6−test :: Number -> Something
7−test = {}
examples/passing/1185.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−data Person = Person String Boolean
6−
7−getName :: Person -> String
8−getName p = case p of
9− Person name true -> name
10− _ -> "Unknown"
11−
12−name :: String
13−name = getName (Person "John Smith" true)
14−
15−main = log "Done"
examples/passing/1335.pursdeleted−14
@@ -1,14 +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 "Test"
8− where
9− y :: forall a. (Show a) => a -> String
10− y a = show (a :: a)
11−
12−main = do
13− log (x 0)
14− log "Done"
examples/passing/1570.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−test :: forall a. a -> a
6−test = \(x :: a) -> x
7−
8−main = 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−25
@@ -1,25 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−_2 :: forall a. a -> a
7−_2 a = a
8−
9−x :: forall m. (Monad m) => m Unit
10−x = do
11− _ <- pure unit
12− pure unit
13−
14−y :: forall m. (Monad m) => m Unit
15−y = do
16− _ <- pure unit
17− pure unit
18−
19−wtf :: forall m. (Monad m) => m Unit
20−wtf = do
21− _ <- pure unit
22− let tmp = _2 1
23− pure unit
24−
25−main = log "Done"
examples/passing/1807.pursdeleted−14
@@ -1,14 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−fn = _.b.c.d
7−a = {b:{c:{d:2}}}
8−
9−d :: Int
10−d = fn a + a.b.c.d
11−
12−main = if fn a + a.b.c.d == 4
13− then log "Done"
14− else log "Fail"
examples/passing/1881.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−foo =
6− 1
7−
8−bar
9− = 2
10−
11−baz
12− =
13− 3
14−
15−qux
16− =
17− 3
18−
19−main = log "Done"
examples/passing/1991.pursdeleted−22
@@ -1,22 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−singleton :: forall a. a -> Array a
7−singleton x = [x]
8−
9−empty :: forall a. Array a
10−empty = []
11−
12−foldMap :: forall a m. (Semigroup m) => (a -> m) -> Array a -> m
13−foldMap f [a, b, c, d, e] = f a <> f b <> f c <> f d <> f e
14−foldMap f xs = foldMap f xs -- spin, not used
15−
16−regression :: Array Int
17−regression =
18− let as = [1,2,3,4,5]
19− as' = foldMap (\x -> if 1 < x && x < 4 then singleton x else empty) as
20− in as'
21−
22−main = log "Done"
examples/passing/2018.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import A (foo)
5−import B (Foo(..))
6−import Control.Monad.Eff (Eff)
7−import Control.Monad.Eff.Console (CONSOLE, log)
8−
9−main :: forall e. Eff (console :: CONSOLE | e) Unit
10−main = do
11− let tmp = foo X
12− log "Done"
examples/passing/2018/A.pursdeleted−7
@@ -1,7 +0,0 @@
1−module A where
2−
3−import B as Main
4−
5−-- Prior to the 2018 fix this would be detected as a cycle between A and Main.
6−foo ∷ Main.Foo → Main.Foo
7−foo x = x
examples/passing/2018/B.pursdeleted−3
@@ -1,3 +0,0 @@
1−module B where
2−
3−data Foo = X | Y
examples/passing/2049.pursdeleted−14
@@ -1,14 +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−f _ = 0
13−
14−main = log "Done"
examples/passing/2138.pursdeleted−7
@@ -1,7 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−import Lib (A(B,C))
6−
7−main = log "Done"
examples/passing/2138/Lib.pursdeleted−3
@@ -1,3 +0,0 @@
1−module Lib (A(..), A) where
2−
3−data A = B | C
examples/passing/2172.jsdeleted−5
@@ -1,5 +0,0 @@
1−exports['a\''] = 0;
2−exports["\x62\x27"] = 1;
3−// NOTE: I wanted to use "\c'" here, but langauge-javascript doesn't support it...
4−exports["c'"] = 2;
5−exports["\u0064\u0027"] = 3;
examples/passing/2172.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−foreign import a' :: Number
6−foreign import b' :: Number
7−foreign import c' :: Number
8−foreign import d' :: Number
9−
10−main = log "Done"
examples/passing/2252.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−data T a = T
6−
7−ti :: T Int
8−ti = T
9−
10−t :: forall a. T a
11−t = T
12−
13−xs = [ti, t, t]
14−
15−main = log "Done"
examples/passing/652.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−class Foo a b
7−
8−class Bar a c
9−
10−class (Foo a b, Bar a c) <= Baz a b c
11−
12−instance foo :: Foo (a -> b) a
13−
14−instance bar :: Bar (a -> b) b
15−
16−instance baz :: (Eq a) => Baz (a -> b) a b
17−
18−main = log "Done"
examples/passing/810.pursdeleted−14
@@ -1,14 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Maybe a = Nothing | Just a
7−
8−test :: forall a. Maybe a -> Maybe a
9−test m = o.x
10− where
11− o = case m of Nothing -> { x : Nothing }
12− Just a -> { x : Just a }
13−
14−main = 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 Control.Monad.Eff.Console (log)
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 = log "Done"
examples/passing/ArrayType.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−class Pointed p where
7− point :: forall a. a -> p a
8−
9−instance pointedArray :: Pointed Array where
10− point a = [a]
11−
12−main = log "Done"
examples/passing/Auto.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Auto s i o = Auto { state :: s, step :: s -> i -> o }
7−
8−type SomeAuto i o = forall r. (forall s. Auto s i o -> r) -> r
9−
10−exists :: forall s i o. s -> (s -> i -> o) -> SomeAuto i o
11−exists = \state step f -> f (Auto { state: state, step: step })
12−
13−run :: forall i o. SomeAuto i o -> i -> o
14−run = \s i -> s (\a -> case a of Auto a -> a.step a.state i)
15−
16−main = log "Done"
examples/passing/AutoPrelude.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−f x = x * 10.0
7−g y = y - 10.0
8−
9−main = do
10− log $ show $ (f <<< g) 100.0
11− log "Done"
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−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Partial.Unsafe (unsafePartial)
5−import Test.Assert (assert')
6−import Control.Monad.Eff (Eff)
7−import Control.Monad.Eff.Console (log)
8−
9−snd :: forall a. Partial => Array a -> a
10−snd = \[_, y] -> y
11−
12−main :: Eff _ _
13−main = do
14− let ts = unsafePartial (snd [1.0, 2.0])
15− assert' "Incorrect result from 'snd'." (ts == 2.0)
16− log "Done"
examples/passing/BindingGroups.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−foo = bar
7− where bar r = r + 1.0
8−
9−r = foo 2.0
10−
11−main = log "Done"
examples/passing/BlockString.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−foo :: String
7−foo = """foo"""
8−
9−main = log "Done"
examples/passing/CaseInDo.pursdeleted−21
@@ -1,21 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Partial.Unsafe (unsafeCrashWith)
5−import Control.Monad.Eff.Console
6−import Control.Monad.Eff
7−
8−doIt :: forall eff. Eff eff Boolean
9−doIt = pure true
10−
11−set = do
12− log "Testing..."
13− case 0 of
14− 0 -> doIt
15− _ -> pure false
16−
17−main = do
18− b <- set
19− case b of
20− true -> log "Done"
21− false -> unsafeCrashWith "Failed"
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−21
@@ -1,21 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Partial.Unsafe (unsafeCrashWith)
5−import Control.Monad.Eff.Console
6−import Control.Monad.Eff
7−
8−doIt :: forall eff. Eff eff Boolean
9−doIt = pure true
10−
11−set = do
12− log "Testing..."
13− case 42, 10 of
14− 42, 10 -> doIt
15− _ , _ -> pure false
16−
17−main = do
18− b <- set
19− case b of
20− true -> log "Done"
21− false -> unsafeCrashWith "Failed"
examples/passing/CaseStatement.pursdeleted−22
@@ -1,22 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data A = A | B | C
7−
8−f a _ A = a
9−f _ a B = a
10−f _ _ C = "Done"
11−
12−g a _ A = a
13−g _ b B = b
14−g _ _ C = C
15−
16−data M a = N | J a
17−
18−h f N a = a
19−h f a N = a
20−h f (J a) (J b) = J (f a b)
21−
22−main = log $ f "Done" "Failed" A
examples/passing/CheckFunction.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−test = ((\x -> x+1.0) >>> (\x -> x*2.0)) 4.0
7−
8−main = log "Done"
examples/passing/CheckSynonymBug.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−length :: forall a. Array a -> Int
7−length _ = 0
8−
9−type Foo a = Array a
10−
11−foo _ = length ([] :: Foo Number)
12−
13−main = log "Done"
examples/passing/CheckTypeClass.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Bar a = Bar
7−data Baz
8−
9−class Foo a where
10− foo :: Bar a -> Baz
11−
12−foo_ :: forall a. (Foo a) => a -> Baz
13−foo_ x = foo ((mkBar :: forall a. (Foo a) => a -> Bar a) x)
14−
15−mkBar :: forall a. a -> Bar a
16−mkBar _ = Bar
17−
18−main = log "Done"
examples/passing/Church.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
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 = log "Done"
examples/passing/ClassRefSyntax.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Lib (class X, go)
4−import Control.Monad.Eff.Console (log)
5−
6−go' :: forall a. (X a) => a -> a
7−go' = go
8−
9−main = log "Done"
examples/passing/ClassRefSyntax/Lib.pursdeleted−4
@@ -1,4 +0,0 @@
1−module Lib (class X, go) where
2−
3−class X a where
4− go :: a -> a
examples/passing/Collatz.pursdeleted−21
@@ -1,21 +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 (log, logShow)
7−
8−collatz :: Int -> Int
9−collatz n = runPure (runST (do
10− r <- newSTRef n
11− count <- newSTRef 0
12− untilE $ do
13− modifySTRef count $ (+) 1
14− m <- readSTRef r
15− writeSTRef r $ if m `mod` 2 == 0 then m / 2 else 3 * m + 1
16− pure $ m == 1
17− readSTRef count))
18−
19−main = do
20− logShow $ collatz 1000
21− log "Done"
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 Control.Monad.Eff.Console (log)
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 = log "Done"
examples/passing/Console.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−
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 = do
14− replicateM_ 10.0 (log "Hello World!")
15− log "Done"
examples/passing/ConstraintInference.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−shout = log <<< (_ <> "!") <<< show
7−
8−main = do
9− shout "Test"
10− log "Done"
examples/passing/ConstraintParsingIssue.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console
4−
5−class X a
6−
7−instance x :: X (Array (Array a)) => X (Array a)
8−
9−main = log "Done"
examples/passing/ContextSimplification.pursdeleted−15
@@ -1,15 +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 = do
14− usesShowTwice true "Test"
15− log "Done"
examples/passing/DataAndType.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data A = A B
7−
8−type B = A
9−
10−main = log "Done"
examples/passing/DctorOperatorAlias.pursdeleted−34
@@ -1,34 +0,0 @@
1−module Main where
2−
3− import Prelude (Unit, bind, (==))
4− import Control.Monad.Eff (Eff)
5− import Control.Monad.Eff.Console (CONSOLE, log)
6− import Test.Assert (ASSERT, assert')
7− import List (List(..), (:))
8− import List as L
9−
10− -- unqualified
11− infixl 6 Cons as !
12−
13− -- qualified
14− infixl 6 L.Cons as !!
15−
16− get1 ∷ ∀ a. a → List a → a
17− get1 y xs = case xs of
18− _ : x : _ → x
19− _ → y
20−
21− get2 ∷ ∀ a. a → List a → a
22− get2 _ (_ : x : _) = x
23− get2 y _ = y
24−
25− get3 ∷ ∀ a. a → List a → a
26− get3 _ (_ ! (x ! _)) = x
27− get3 y _ = y
28−
29− main ∷ Eff (assert ∷ ASSERT, console ∷ CONSOLE) Unit
30− main = do
31− assert' "Incorrect result!" (get1 0 (1 : 2 : 3 : Nil) == 2)
32− assert' "Incorrect result!" (get2 0 (1 ! (2 ! (3 ! Nil))) == 2)
33− assert' "Incorrect result!" (get3 0.0 (1.0 : 2.0 : (3.0 ! Nil)) == 2.0)
34− log "Done"
examples/passing/DctorOperatorAlias/List.pursdeleted−5
@@ -1,5 +0,0 @@
1−module List where
2−
3−data List a = Cons a (List a) | Nil
4−
5−infixr 6 Cons as :
examples/passing/DeepArrayBinder.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console (log)
6−import Test.Assert
7−
8−data List a = Cons a (List a) | Nil
9−
10−match2 :: List Number -> Number
11−match2 (Cons x (Cons y xs)) = x * y + match2 xs
12−match2 _ = 0.0
13−
14−main = do
15− 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)))))))))
16− assert' "Incorrect result!" (result == 100.0)
17− 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 (log, logShow)
5−
6−f x y =
7− let
8− g = case y of
9− 0.0 -> x
10− x -> 1.0 + x * x
11− in g + x + y
12−
13−main = do
14− logShow $ f 1.0 10.0
15− log "Done"
examples/passing/DeriveNewtype.pursdeleted−27
@@ -1,27 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−import Data.Newtype
6−
7−newtype Test = Test String
8−
9−derive instance newtypeTest :: Newtype Test _
10−
11−t :: Test
12−t = wrap "hello"
13−
14−a :: String
15−a = unwrap t
16−
17−newtype First a = First a
18−
19−derive instance newtypeFirst :: Newtype (First b) _
20−
21−f :: First Int
22−f = wrap 1
23−
24−i :: Int
25−i = unwrap f
26−
27−main = log "Done"
examples/passing/Deriving.pursdeleted−34
@@ -1,34 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−import Test.Assert
6−
7−data V
8−
9−derive instance eqV :: Eq V
10−
11−derive instance ordV :: Ord V
12−
13−data X = X Int | Y String
14−
15−derive instance eqX :: Eq X
16−
17−derive instance ordX :: Ord X
18−
19−newtype Z = Z { left :: X, right :: X }
20−
21−derive instance eqZ :: Eq Z
22−
23−main = do
24− assert $ X 0 == X 0
25− assert $ X 0 /= X 1
26− assert $ Y "Foo" == Y "Foo"
27− assert $ Y "Foo" /= Y "Bar"
28− assert $ X 0 < X 1
29− assert $ X 0 < Y "Foo"
30− assert $ Y "Bar" < Y "Baz"
31− assert $ z == z
32− log "Done"
33− where
34− z = Z { left: X 0, right: Y "Foo" }
examples/passing/Do.pursdeleted−68
@@ -1,68 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Maybe a = Nothing | Just a
7−
8−instance functorMaybe :: Functor Maybe where
9− map f Nothing = Nothing
10− map f (Just x) = Just (f x)
11−
12−instance applyMaybe :: Apply Maybe where
13− apply (Just f) (Just x) = Just (f x)
14− apply _ _ = Nothing
15−
16−instance applicativeMaybe :: Applicative Maybe where
17− pure = Just
18−
19−instance bindMaybe :: Bind Maybe where
20− bind Nothing _ = Nothing
21− bind (Just a) f = f a
22−
23−instance monadMaybe :: Monad Maybe
24−
25−test1 = \_ -> do
26− Just "abc"
27−
28−test2 = \_ -> do
29− x <- Just 1.0
30− y <- Just 2.0
31− Just (x + y)
32−
33−test3 = \_ -> do
34− Just 1.0
35− Nothing :: Maybe Number
36− Just 2.0
37−
38−test4 mx my = do
39− x <- mx
40− y <- my
41− Just (x + y + 1.0)
42−
43−test5 mx my mz = do
44− x <- mx
45− y <- my
46− let sum = x + y
47− z <- mz
48− Just (z + sum + 1.0)
49−
50−test6 mx = \_ -> do
51− let
52− f :: forall a. Maybe a -> a
53− f (Just x) = x
54− Just (f mx)
55−
56−test8 = \_ -> do
57− Just (do
58− Just 1.0)
59−
60−test9 = \_ -> (+) <$> Just 1.0 <*> Just 2.0
61−
62−test10 _ = do
63− let
64− f x = g x * 3.0
65− g x = f x / 2.0
66− Just (f 10.0)
67−
68−main = log "Done"
examples/passing/Dollar.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−applyFn :: forall a b. (a -> b) -> a -> b
6−applyFn f x = f x
7−
8−infixr 1000 applyFn as $
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 = log "Done"
examples/passing/Eff.pursdeleted−26
@@ -1,26 +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 (log, logShow)
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− logShow test2
25− logShow test3
26− log "Done"
examples/passing/EmptyDataDecls.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Test.Assert
5−import Control.Monad.Eff.Console (log)
6−
7−data Z
8−data S n
9−
10−data ArrayBox n a = ArrayBox (Array a)
11−
12−nil :: forall a. ArrayBox Z a
13−nil = ArrayBox []
14−
15−cons' :: forall a n. a -> ArrayBox n a -> ArrayBox (S n) a
16−cons' x (ArrayBox xs) = ArrayBox $ append [x] xs
17−
18−main = case cons' 1 $ cons' 2 $ cons' 3 nil of
19− ArrayBox [1, 2, 3] -> log "Done"
20− _ -> assert' "Failed" false
examples/passing/EmptyRow.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Foo r = Foo { | r }
7−
8−test :: Foo ()
9−test = Foo {}
10−
11−main = log "Done"
examples/passing/EmptyTypeClass.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−
7−head :: forall a. Partial => Array a -> a
8−head [x] = x
9−
10−main :: Eff _ _
11−main = log "Done"
examples/passing/EqOrd.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−
6−data Pair a b = Pair a b
7−
8−instance ordPair :: (Ord a, Ord b) => Ord (Pair a b) where
9− compare (Pair a1 b1) (Pair a2 b2) = case compare a1 a2 of
10− EQ -> compare b1 b2
11− r -> r
12−
13−instance eqPair :: (Eq a, Eq b) => Eq (Pair a b) where
14− eq (Pair a1 b1) (Pair a2 b2) = a1 == a2 && b1 == b2
15−
16−main = do
17− logShow $ Pair 1.0 2.0 == Pair 1.0 2.0
18− log "Done"
examples/passing/ExplicitImportReExport.pursdeleted−11
@@ -1,11 +0,0 @@
1−-- from #1244
2−module Main where
3−
4−import Prelude
5−import Control.Monad.Eff.Console (log)
6−import Bar (foo)
7−
8−baz :: Int
9−baz = foo
10−
11−main = log "Done"
examples/passing/ExplicitImportReExport/Bar.pursdeleted−3
@@ -1,3 +0,0 @@
1−module Bar (module Foo) where
2−
3−import Foo
examples/passing/ExplicitImportReExport/Foo.pursdeleted−4
@@ -1,4 +0,0 @@
1−module Foo where
2−
3−foo :: Int
4−foo = 3
examples/passing/ExplicitOperatorSections.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−subtractOne :: Int -> Int
7−subtractOne = (_ - 1)
8−
9−addOne :: Int -> Int
10−addOne = (1 + _)
11−
12−named :: Int -> Int
13−named = (_ `sub` 1)
14−
15−main = log "Done"
examples/passing/ExportExplicit.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import M1
4−import Control.Monad.Eff.Console (log)
5−
6−testX = X
7−testZ = Z
8−testFoo = foo
9−
10−main = log "Done"
examples/passing/ExportExplicit/M1.pursdeleted−10
@@ -1,10 +0,0 @@
1−module M1 (X(X), Z(..), foo) where
2−
3−data X = X | Y
4−data Z = Z
5−
6−foo :: Int
7−foo = 0
8−
9−bar :: Int
10−bar = 1
examples/passing/ExportExplicit2.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import M1
4−import Control.Monad.Eff.Console (log)
5−
6−testBar = bar
7−
8−main = log "Done"
examples/passing/ExportExplicit2/M1.pursdeleted−7
@@ -1,7 +0,0 @@
1−module M1 (bar) where
2−
3−foo :: Int
4−foo = 0
5−
6−bar :: Int
7−bar = foo
examples/passing/ExportedInstanceDeclarations.pursdeleted−45
@@ -1,45 +0,0 @@
1−-- Tests that instances for non-exported classes / types do not appear in the
2−-- result of `exportedDeclarations`.
3−module Main
4− ( Const(..)
5− , class Foo
6− , foo
7− , main
8− ) where
9−
10−import Prelude
11−import Control.Monad.Eff.Console (log)
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 Int a) where
39− notExported = Const 0
40−
41−-- Case 3: instance types
42−instance constFoo :: Foo (Const NonexportedType b) where
43− foo = Const NonexportedType
44−
45−main = log "Done"
examples/passing/ExtendedInfixOperators.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−import Data.Function (on)
6−
7−comparing :: forall a b. (Ord b) => (a -> b) -> a -> a -> Ordering
8−comparing f = compare `on` f
9−
10−null [] = true
11−null _ = false
12−
13−test = [1.0, 2.0, 3.0] `comparing null` [4.0, 5.0, 6.0]
14−
15−main = do
16− logShow test
17− log "Done"
examples/passing/Fib.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff (whileE)
5−import Control.Monad.Eff.Console (log, logShow)
6−import Control.Monad.ST (runST, newSTRef, readSTRef, writeSTRef)
7−
8−main = do
9− runST do
10− n1 <- newSTRef 1.0
11− n2 <- newSTRef 1.0
12− whileE ((>) 1000.0 <$> readSTRef n1) $ do
13− n1' <- readSTRef n1
14− n2' <- readSTRef n2
15− writeSTRef n2 $ n1' + n2'
16− writeSTRef n1 n2'
17− logShow n2'
18− log "Done"
examples/passing/FieldConsPuns.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−
6−greet { greeting, name } = log $ greeting <> ", " <> name <> "."
7−
8−main = do
9− greet { greeting, name }
10− log "Done"
11− where
12− greeting = "Hello"
13− name = "World"
examples/passing/FieldPuns.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 = do
9− greet { greeting: "Hello", name: "World" }
10− log "Done"
examples/passing/FinalTagless.pursdeleted−25
@@ -1,25 +0,0 @@
1−module Main where
2−
3−import Prelude hiding (add)
4−import Control.Monad.Eff.Console (log, logShow)
5−
6−class E e where
7− num :: Number -> e Number
8− add :: e Number -> e Number -> e Number
9−
10−type Expr a = forall e. (E e) => e a
11−
12−data Id a = Id a
13−
14−instance exprId :: E Id where
15− num = Id
16− add (Id n) (Id m) = Id (n + m)
17−
18−runId (Id a) = a
19−
20−three :: Expr Number
21−three = add (num 1.0) (num 2.0)
22−
23−main = do
24− logShow $ runId three
25− log "Done"
examples/passing/FunWithFunDeps.jsdeleted−32
@@ -1,32 +0,0 @@
1−
2−//: forall e. FVect Z e
3−exports.fnil = [];
4−
5−//: forall n e. e -> FVect n e -> FVect (S n) e
6−exports.fcons = function (hd) {
7− return function (tl) {
8− return [hd].concat(tl);
9− };
10−};
11−
12−exports.fappend = function (dict) {
13− return function (left) {
14− return function (right) {
15− return left.concat(right);
16− };
17− };
18−};
19−
20−exports.fflatten = function (dict) {
21− return function (v) {
22− var accRef = [];
23− for (var indexRef = 0; indexRef < v.length; indexRef += 1) {
24− accRef = accRef.concat(v[indexRef]);
25− }
26− return accRef;
27− };
28−};
29−
30−exports.ftoArray = function (vect) {
31− return vect;
32−};
examples/passing/FunWithFunDeps.pursdeleted−41
@@ -1,41 +0,0 @@
1−-- Taken from https://github.com/LiamGoodacre/purescript-fun-with-fundeps
2−
3−module Main where
4−
5−import Control.Monad.Eff.Console (log)
6−
7−-- Nat : Type
8−data Z
9−data S n
10−
11−type S2 n = S (S n)
12−type S3 n = S (S2 n)
13−type S4 n = S (S3 n)
14−type S5 n = S (S4 n)
15−type S15 n = S5 (S5 (S5 n))
16−
17−class NatPlus l r o | l r -> o
18−instance natPlusZ :: NatPlus Z r r
19−instance natPlusS :: (NatPlus l r o) => NatPlus (S l) r (S o)
20−
21−class NatMult l r o | l r -> o
22−instance natMultZ :: NatMult Z n Z
23−instance natMultS :: (NatMult m n r, NatPlus n r s) => NatMult (S m) n s
24−
25−-- Foreign Vect
26−foreign import data FVect :: * -> * -> *
27−foreign import fnil :: forall e. FVect Z e
28−foreign import fcons :: forall n e. e -> FVect n e -> FVect (S n) e
29−foreign import fappend :: forall l r o e. (NatPlus l r o) => FVect l e -> FVect r e -> FVect o e
30−foreign import fflatten :: forall f s t o. (NatMult f s o) => FVect f (FVect s t) -> FVect o t
31−foreign import ftoArray :: forall n e. FVect n e -> Array e
32−
33−-- should be able to figure these out
34−fsingleton x = fcons x fnil
35−fexample = fcons 1 (fsingleton 2) `fappend` fsingleton 3 `fappend` fcons 4 (fsingleton 5)
36−fexample2 = fexample `fappend` fexample `fappend` fexample
37−fexample3 = fsingleton fexample `fappend` fsingleton fexample `fappend` fsingleton fexample
38−
39−fexample4 = fflatten fexample3
40−
41−main = log "Done"
examples/passing/FunctionScope.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Test.Assert
5−import Control.Monad.Eff.Console (log)
6−
7−mkValue :: Number -> Number
8−mkValue id = id
9−
10−main = do
11− let value = mkValue 1.0
12− assert $ value == 1.0
13− log "Done"
examples/passing/FunctionalDependencies.pursdeleted−21
@@ -1,21 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−data Nil
6−data Cons x xs
7−
8−class Append a b c | a b -> c
9−
10−instance appendNil :: Append Nil b b
11−
12−instance appendCons :: Append xs b c => Append (Cons x xs) b (Cons x c)
13−
14−data Proxy a = Proxy
15−
16−appendProxy :: forall a b c. Append a b c => Proxy a -> Proxy b -> Proxy c
17−appendProxy Proxy Proxy = Proxy
18−
19−test = appendProxy (Proxy :: Proxy (Cons Int Nil)) (Proxy :: Proxy (Cons String Nil))
20−
21−main = log "Done"
examples/passing/Functions.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−test1 = \_ -> 0.0
7−
8−test2 = \a b -> a + b + 1.0
9−
10−test3 = \a -> a
11−
12−main = log "Done"
examples/passing/Functions2.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Test.Assert
5−import Control.Monad.Eff.Console (log)
6−
7−test :: forall a b. a -> b -> a
8−test = \const _ -> const
9−
10−main = do
11− let value = test "Done" {}
12− assert' "Not done" $ value == "Done"
13− log "Done"
examples/passing/GHCGenerics.pursdeleted−140
@@ -1,140 +0,0 @@
1−-- An example to show how we could implement GHC-style Generics using
2−-- functional dependencies.
3−--
4−-- See https://hackage.haskell.org/package/base-4.9.0.0/docs/GHC-Generics.html
5−
6−module Main where
7−
8−import Prelude
9−import Control.Monad.Eff (Eff)
10−import Control.Monad.Eff.Console (CONSOLE, log, logShow)
11−
12−-- Representation for types with no constructors
13−data V1
14−
15−-- Representation for constructors with no arguments
16−data U1 = U1
17−
18−-- Representation for sum types
19−data Sum a b = Inl a | Inr b
20−
21−infixr 5 type Sum as +
22−
23−-- Representation for product types
24−data Product a b = Product a b
25−
26−infixr 6 type Product as *
27−
28−-- Representation for data constructors, with the data constructor name indicated
29−-- at the type level.
30−data Ctor (name :: Symbol) a = Ctor a
31−
32−-- Representation for occurrences of other types in a data type definition.
33−data K a = K a
34−
35−-- The Generic class asserts the existence of a type function from "real" types
36−-- to representation types, and an isomorphism between them.
37−class Generic a repr | a -> repr where
38− to :: a -> repr
39− from :: repr -> a
40−
41−-- We can write an instance for the (recursive) type of lists. Note that these
42−-- instances would be generated by the compiler ideally.
43−data List a = Nil | Cons a (List a)
44−
45−instance genericList :: Generic (List a) (Ctor "Nil" U1 + Ctor "Cons" (K a * K (List a))) where
46− to Nil = Inl (Ctor U1)
47− to (Cons x xs) = Inr (Ctor (Product (K x) (K xs)))
48− from (Inl (Ctor U1)) = Nil
49− from (Inr (Ctor (Product (K x) (K xs)))) = Cons x xs
50−
51−-- We'd like to refect type level strings (for data constructor names) at the value
52−-- level, so that we can "show" them. Again, these instances would ideally be derived
53−-- for us.
54−class KnownSymbol (sym :: Symbol) where
55− symbol :: forall proxy. proxy sym -> String
56−
57−instance knownSymbolNil :: KnownSymbol "Nil" where
58− symbol _ = "Nil"
59−
60−instance knownSymbolCons :: KnownSymbol "Cons" where
61− symbol _ = "Cons"
62−
63−-- A proxy for a type-level string.
64−data SProxy (sym :: Symbol) = SProxy
65−
66−-- To write generic functions, we create a corresponding type class, and use the
67−-- type class machinery to infer the correct function based on the representation
68−-- type.
69−class GShow a where
70− gShow :: a -> String
71−
72−-- Now provide instances for GShow for the appropriate representation types.
73−-- Note: we don't have to implement all instances here.
74−
75−instance gShowU1 :: GShow U1 where
76− gShow _ = ""
77−
78−instance gShowSum :: (GShow a, GShow b) => GShow (a + b) where
79− gShow (Inl a) = gShow a
80− gShow (Inr b) = gShow b
81−
82−instance gShowProduct :: (GShow a, GShow b) => GShow (a * b) where
83− gShow (Product a b) = gShow a <> gShow b
84−
85−instance gShowCtor :: (KnownSymbol ctor, GShow a) => GShow (Ctor ctor a) where
86− gShow (Ctor a) = "(" <> symbol (SProxy :: SProxy ctor) <> gShow a <> ")"
87−
88−instance gShowK :: Show a => GShow (K a) where
89− gShow (K a) = " " <> show a
90−
91−-- Now we can implement a generic show function which uses the GShow instance
92−-- on the representation type.
93−genericShow :: forall a repr. (Generic a repr, GShow repr) => a -> String
94−genericShow x = gShow (to x)
95−
96−-- Note how the required instance here is Show a, and not Generic a.
97−-- This allows us to use generic programming on a wider variety of types
98−-- (including types which contain foreign types) than we can use now.
99−instance showList :: Show a => Show (List a) where
100− show xs = genericShow xs -- (we need to eta expand here to avoid stack overflow
101− -- due to recursion implicit in the instance lookup)
102−
103−-- Another example: Eq
104−
105−class GEq a where
106− gEq :: a -> a -> Boolean
107−
108−instance gEqU1 :: GEq U1 where
109− gEq _ _ = true
110−
111−instance gEqSum :: (GEq a, GEq b) => GEq (a + b) where
112− gEq (Inl a1) (Inl a2) = gEq a1 a2
113− gEq (Inr b1) (Inr b2) = gEq b1 b2
114− gEq _ _ = false
115−
116−instance gEqProduct :: (GEq a, GEq b) => GEq (a * b) where
117− gEq (Product a1 b1) (Product a2 b2) = gEq a1 a2 && gEq b1 b2
118−
119−instance gEqCtor :: (KnownSymbol ctor, GEq a) => GEq (Ctor ctor a) where
120− gEq (Ctor a1) (Ctor a2) = gEq a1 a2
121−
122−instance gEqK :: Eq a => GEq (K a) where
123− gEq (K a1) (K a2) = a1 == a2
124−
125−genericEq :: forall a repr. (Generic a repr, GEq repr) => a -> a -> Boolean
126−genericEq x y = gEq (to x) (to y)
127−
128−instance eqList :: Eq a => Eq (List a) where
129− eq xs ys = genericEq xs ys
130−
131−main :: Eff (console :: CONSOLE) Unit
132−main = do
133− logShow (Cons 1 Nil)
134− logShow (Cons 1 (Cons 2 Nil))
135− logShow (Cons 'x' (Cons 'y' (Cons 'z' Nil)))
136−
137− logShow (Cons 1 (Cons 2 Nil) == Cons 1 (Cons 2 Nil))
138− logShow (Cons 1 (Cons 2 Nil) == Cons 1 Nil)
139−
140− log "Done"
examples/passing/Generalization1.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (logShow, log)
5−
6−main = do
7− logShow (sum 1.0 2.0)
8− logShow (sum 1 2)
9− log "Done"
10−
11−sum x y = x + y
examples/passing/Guards.pursdeleted−30
@@ -1,30 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−collatz = \x -> case x of
7− y | y `mod` 2.0 == 0.0 -> y / 2.0
8− y -> y * 3.0 + 1.0
9−
10−-- Guards have access to current scope
11−collatz2 = \x y -> case x of
12− z | y > 0.0 -> z / 2.0
13− z -> z * 3.0 + 1.0
14−
15−min :: forall a. (Ord a) => a -> a -> a
16−min n m | n < m = n
17− | otherwise = m
18−
19−max :: forall a. (Ord a) => a -> a -> a
20−max n m = case unit of
21− _ | m < n -> n
22− | otherwise -> m
23−
24−testIndentation :: Number -> Number -> Number
25−testIndentation x y | x > 0.0
26− = x + y
27− | otherwise
28− = y - x
29−
30−main = 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−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Maybe a = Nothing | Just a
7−
8−test1 = if true then Just 10 else Nothing
9−
10−test2 = if true then Nothing else Just 10
11−
12−main = 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−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−main = do
7− log "Hello"
8− log "Goodbye"
9− log "Done"
examples/passing/Import.pursdeleted−6
@@ -1,6 +0,0 @@
1−module Main where
2−
3−import M2
4−import Control.Monad.Eff.Console (log)
5−
6−main = log "Done"
examples/passing/Import/M1.pursdeleted−8
@@ -1,8 +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
examples/passing/Import/M2.pursdeleted−6
@@ -1,6 +0,0 @@
1−module M2 where
2−
3−import Prelude ()
4−import M1
5−
6−main = \_ -> foo 42
examples/passing/ImportExplicit.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import M1 (X(..))
4−import Control.Monad.Eff.Console (log)
5−
6−testX :: X
7−testX = X
8−testY = Y
9−
10−main = log "Done"
examples/passing/ImportExplicit/M1.pursdeleted−4
@@ -1,4 +0,0 @@
1−module M1 where
2−
3−data X = X | Y
4−data Z = Z
examples/passing/ImportHiding.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console
4−import Prelude hiding (
5− show, -- a value
6− class 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
19− log "Done"
examples/passing/ImportQualified.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import M1
6−import Control.Monad.Eff.Console as C
7−
8−main = C.log (log "Done")
examples/passing/ImportQualified/M1.pursdeleted−3
@@ -1,3 +0,0 @@
1−module M1 where
2−
3−log x = x
examples/passing/InferRecFunWithConstrainedArgument.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−
6−test 100 = 100
7−test n = test(1 + n)
8−
9−main = do
10− logShow (test 0)
11− log "Done"
examples/passing/InstanceBeforeClass.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−instance fooNumber :: Foo Number where
7− foo = 0.0
8−
9−class Foo a where
10− foo :: a
11−
12−main = log "Done"
examples/passing/IntAndChar.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console (log)
6−import Test.Assert
7−
8−f 1 = 1
9−f _ = 0
10−
11−g 'a' = 'a'
12−g _ = 'b'
13−
14−main = do
15− assert $ f 1 == 1
16− assert $ f 0 == 0
17− assert $ g 'a' == 'a'
18− assert $ g 'b' == 'b'
19− log "Done"
examples/passing/JSReserved.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−yield = 0
7−member = 1
8−
9−public = \return -> return
10−
11−this catch = catch
12−
13−main = log "Done"
examples/passing/KindedType.pursdeleted−34
@@ -1,34 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−type Star2Star f = f :: * -> *
7−
8−type Star t = t :: *
9−
10−test1 :: Star2Star Array String
11−test1 = ["test"]
12−
13−f :: Star (String -> String)
14−f s = s
15−
16−test2 = f "test"
17−
18−data Proxy (f :: * -> *) = Proxy
19−
20−test3 :: Proxy Array
21−test3 = Proxy
22−
23−type Test (f :: * -> *) = f String
24−
25−test4 :: Test Array
26−test4 = ["test"]
27−
28−class Clazz (a :: *) where
29− def :: a
30−
31−instance clazzString :: Clazz String where
32− def = "test"
33−
34−main = log "Done"
examples/passing/LargeSumType.pursdeleted−35
@@ -1,35 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−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
6−
7−explode A A = "A"
8−explode B B = "B"
9−explode C C = "C"
10−explode D D = "D"
11−explode E E = "E"
12−explode F F = "F"
13−explode G G = "G"
14−explode H H = "H"
15−explode I I = "I"
16−explode J J = "J"
17−explode K K = "K"
18−explode L L = "L"
19−explode M M = "M"
20−explode N N = "N"
21−explode O O = "O"
22−explode P P = "P"
23−explode Q Q = "Q"
24−explode R R = "R"
25−explode S S = "S"
26−explode T T = "T"
27−explode U U = "U"
28−explode V V = "V"
29−explode W W = "W"
30−explode X X = "X"
31−explode Y Y = "Y"
32−explode Z Z = "Z"
33−explode _ _ = ""
34−
35−main = log "Done"
examples/passing/Let.pursdeleted−58
@@ -1,58 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Partial.Unsafe (unsafePartial)
5−import Control.Monad.Eff
6−import Control.Monad.Eff.Console (log, logShow)
7−import Control.Monad.ST
8−
9−test1 x = let
10− y :: Number
11− y = x + 1.0
12− in y
13−
14−test2 x y =
15− let x' = x + 1.0 in
16− let y' = y + 1.0 in
17− x' + y'
18−
19−test3 = let f x y z = x + y + z in
20− f 1.0 2.0 3.0
21−
22−test4 = let
23− f x [y, z] = x y z
24− in f (+) [1.0, 2.0]
25−
26−test5 = let
27− f x | x > 0.0 = g (x / 2.0) + 1.0
28− f x = 0.0
29− g x = f (x - 1.0) + 1.0
30− in f 10.0
31−
32−test7 = let
33− f :: forall a. a -> a
34− f x = x
35− in if f true then f 1.0 else f 2.0
36−
37−test8 :: Number -> Number
38−test8 x = let
39− go y | (x - 0.1 < y * y) && (y * y < x + 0.1) = y
40− go y = go $ (y + x / y) / 2.0
41− in go x
42−
43−test10 _ =
44− let
45− f x = g x * 3.0
46− g x = f x / 2.0
47− in f 10.0
48−
49−main :: Eff _ _
50−main = do
51− logShow (test1 1.0)
52− logShow (test2 1.0 2.0)
53− logShow test3
54− unsafePartial (logShow test4)
55− logShow test5
56− logShow test7
57− logShow (test8 100.0)
58− log "Done"
examples/passing/Let2.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−
6−test =
7− let f :: Number -> Boolean
8− f 0.0 = false
9− f n = g (n - 1.0)
10−
11− g :: Number -> Boolean
12− g 0.0 = true
13− g n = f (n - 1.0)
14−
15− x = f 1.0
16− in not x
17−
18−main = do
19− logShow test
20− log "Done"
examples/passing/LetInInstance.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−class Foo a where
7− foo :: a -> String
8−
9−instance fooString :: Foo String where
10− foo = go
11− where
12− go :: String -> String
13− go s = s
14−
15−main = log "Done"
examples/passing/LiberalTypeSynonyms.pursdeleted−22
@@ -1,22 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−type Reader = (->) String
7−
8−foo :: Reader String
9−foo s = s
10−
11−type AndFoo r = (foo :: String | r)
12−
13−getFoo :: forall r. Prim.Record (AndFoo r) -> String
14−getFoo o = o.foo
15−
16−type F r = { | r } -> { | r }
17−
18−f :: (forall r. F r) -> String
19−f g = case g { x: "Hello" } of
20− { x: x } -> x
21−
22−main = log "Done"
examples/passing/MPTCs.pursdeleted−21
@@ -1,21 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−class NullaryTypeClass where
7− greeting :: String
8−
9−instance nullaryTypeClass :: NullaryTypeClass where
10− greeting = "Hello, World!"
11−
12−class Coerce a b where
13− coerce :: a -> b
14−
15−instance coerceRefl :: Coerce a a where
16− coerce a = a
17−
18−instance coerceShow :: Show a => Coerce a String where
19− coerce = show
20−
21−main = log "Done"
examples/passing/Match.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Foo a = Foo
7−
8−foo = \f -> case f of Foo -> "foo"
9−
10−main = log "Done"
examples/passing/Module.pursdeleted−7
@@ -1,7 +0,0 @@
1−module Main where
2−
3−import M1
4−import M2
5−import Control.Monad.Eff.Console (log)
6−
7−main = log "Done"
examples/passing/Module/M1.pursdeleted−14
@@ -1,14 +0,0 @@
1−module M1 where
2−
3−import Prelude
4−
5−data Foo = Foo String
6−
7−foo :: Foo -> String
8−foo = \f -> case f of Foo s -> s <> "foo"
9−
10−bar :: Foo -> String
11−bar = foo
12−
13−incr :: Int -> Int
14−incr x = x + 1
examples/passing/Module/M2.pursdeleted−10
@@ -1,10 +0,0 @@
1−module M2 where
2−
3−import Prelude
4−import M1 as M1
5−
6−baz :: M1.Foo -> String
7−baz = M1.foo
8−
9−match :: M1.Foo -> String
10−match = \f -> case f of M1.Foo s -> s <> "foo"
examples/passing/ModuleDeps.pursdeleted−6
@@ -1,6 +0,0 @@
1−module Main where
2−
3−import M1
4−import Control.Monad.Eff.Console (log)
5−
6−main = log "Done"
examples/passing/ModuleDeps/M1.pursdeleted−5
@@ -1,5 +0,0 @@
1−module M1 where
2−
3−import M2 as M2
4−
5−foo = M2.bar
examples/passing/ModuleDeps/M2.pursdeleted−5
@@ -1,5 +0,0 @@
1−module M2 where
2−
3−import M3 as M3
4−
5−bar = M3.baz
examples/passing/ModuleDeps/M3.pursdeleted−3
@@ -1,3 +0,0 @@
1−module M3 where
2−
3−baz = 1
examples/passing/ModuleExport.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log, logShow)
4−import A
5−
6−main = do
7− logShow (show 1.0)
8− log "Done"
examples/passing/ModuleExport/A.pursdeleted−3
@@ -1,3 +0,0 @@
1−module A (module Prelude) where
2−
3−import Prelude
examples/passing/ModuleExportDupes.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3− import Control.Monad.Eff.Console
4− import A
5− import B
6− import C
7− import Prelude
8−
9− main = do
10− logShow (show 1.0)
11− log "Done"
examples/passing/ModuleExportDupes/A.pursdeleted−3
@@ -1,3 +0,0 @@
1−module A (module Prelude) where
2−
3−import Prelude
examples/passing/ModuleExportDupes/B.pursdeleted−3
@@ -1,3 +0,0 @@
1−module B (module Prelude) where
2−
3−import Prelude
examples/passing/ModuleExportDupes/C.pursdeleted−4
@@ -1,4 +0,0 @@
1−module C (module Prelude, module A) where
2−
3−import Prelude
4−import A
examples/passing/ModuleExportExcluded.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−import A (foo)
6−
7−otherwise = false
8−
9−main = do
10− logShow "1.0"
11− log "Done"
examples/passing/ModuleExportExcluded/A.pursdeleted−6
@@ -1,6 +0,0 @@
1−module A (module Prelude, foo) where
2−
3−import Prelude
4−
5−foo :: Number -> Number
6−foo _ = 0.0
examples/passing/ModuleExportQualified.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−import A as B
6−
7−main = do
8− logShow (B.show 1.0)
9− log "Done"
examples/passing/ModuleExportQualified/A.pursdeleted−3
@@ -1,3 +0,0 @@
1−module A (module Prelude) where
2−
3−import Prelude
examples/passing/ModuleExportSelf.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console
4−import A
5−
6−bar :: Foo
7−bar = true
8−
9−main = do
10− logShow (show bar)
11− log "Done"
examples/passing/ModuleExportSelf/A.pursdeleted−5
@@ -1,5 +0,0 @@
1−module A (module A, module Prelude) where
2−
3−import Prelude
4−
5−type Foo = Boolean
examples/passing/Monad.pursdeleted−32
@@ -1,32 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
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 = log "Done"
examples/passing/MonadState.pursdeleted−63
@@ -1,63 +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 = do
62− logShow $ runState 0 (modify (_ + 1))
63− log "Done"
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−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−f 0.0 = 0.0
7−f x = g x + 0.0
8−
9−g x = f (x / 0.0)
10−
11−data Even = Zero | Even Odd
12−
13−data Odd = Odd Even
14−
15−evenToNumber Zero = 0.0
16−evenToNumber (Even n) = oddToNumber n + 0.0
17−
18−oddToNumber (Odd n) = evenToNumber n + 0.0
19−
20−main = log "Done"
examples/passing/MutRec2.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data A = A B
7−
8−data B = B A
9−
10−foreign import data S :: *
11−
12−f :: A -> S
13−f a = case a of A b -> g b
14−
15−g b = case b of B a -> f a
16−
17−showN :: A -> S
18−showN a = f a
19−
20−main = log "Done"
examples/passing/MutRec3.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data A = A B
7−
8−data B = B A
9−
10−foreign import data S :: *
11−
12−f a = case a of A b -> g b
13−
14−g :: B -> S
15−g b = case b of B a -> f a
16−
17−showN :: A -> S
18−showN a = f a
19−
20−main = 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−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−foo = \x -> case x of
7− y@{ foo: "Foo" } -> y
8− y -> y
9−
10−main = log "Done"
examples/passing/NegativeBinder.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−test :: Number -> Boolean
7−test -1.0 = false
8−test _ = true
9−
10−main = log "Done"
examples/passing/NegativeIntInRange.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−n :: Int
7−n = -2147483648
8−
9−main = log "Done"
examples/passing/Nested.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Extend r a = Extend { prev :: r a, next :: a }
7−
8−data Matrix r a = Square (r (r a)) | Bigger (Matrix (Extend r) a)
9−
10−main = log "Done"
examples/passing/NestedTypeSynonyms.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−type X = String
7−type Y = X -> X
8−
9−fn :: Y
10−fn a = a
11−
12−main = log (fn "Done")
examples/passing/NestedWhere.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−f x = g x
7− where
8− g x = go x
9− where
10− go x = go1 (x - 1.0)
11− go1 x = go x
12−
13−main = 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/NewtypeClass.pursdeleted−39
@@ -1,39 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−
7−class Newtype t a | t -> a where
8− wrap :: a -> t
9− unwrap :: t -> a
10−
11−instance newtypeMultiplicative :: Newtype (Multiplicative a) a where
12− wrap = Multiplicative
13− unwrap (Multiplicative a) = a
14−
15−data Multiplicative a = Multiplicative a
16−
17−instance semiringMultiplicative :: Semiring a => Semigroup (Multiplicative a) where
18− append (Multiplicative a) (Multiplicative b) = Multiplicative (a * b)
19−
20−data Pair a = Pair a a
21−
22−foldPair :: forall a s. Semigroup s => (a -> s) -> Pair a -> s
23−foldPair f (Pair a b) = f a <> f b
24−
25−ala
26− :: forall f t a
27− . (Functor f, Newtype t a)
28− => (a -> t)
29− -> ((a -> t) -> f t)
30− -> f a
31−ala _ f = map unwrap (f wrap)
32−
33−test = ala Multiplicative foldPair
34−
35−test1 = ala Multiplicative foldPair (Pair 2 3)
36−
37−main = do
38− logShow (test (Pair 2 3))
39− 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/NewtypeInstance.pursdeleted−41
@@ -1,41 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−
7−newtype X = X String
8−
9−derive newtype instance showX :: Show X
10−
11−derive newtype instance eqX :: Eq X
12−
13−derive newtype instance ordX :: Ord X
14−
15−newtype Y a = Y (Array a)
16−
17−derive newtype instance showY :: Show (Y String)
18−
19−class Singleton a b where
20− singleton :: a -> b
21−
22−instance singletonArray :: Singleton a (Array a) where
23− singleton x = [x]
24−
25−derive newtype instance singletonY :: Singleton a (Y a)
26−
27−newtype MyArray a = MyArray (Array a)
28−
29−derive newtype instance showMyArray :: Show a => Show (MyArray a)
30−
31−derive newtype instance functorMyArray :: Functor MyArray
32−
33−newtype ProxyArray x a = ProxyArray (Array a)
34−
35−derive newtype instance functorProxyArray :: Functor (ProxyArray x)
36−
37−main = do
38− logShow (X "test")
39− logShow (singleton "test" :: Y String)
40− logShow (map show (MyArray [1, 2, 3]))
41− 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 (Record a)
9−
10−rec1 :: Record (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−10
@@ -1,10 +0,0 @@
1−-- No failure here as the export `thing` only refers to Main.thing
2−module Main (thing, main) where
3−
4−import A
5−import Control.Monad.Eff.Console (log)
6−
7−thing :: Int
8−thing = 2
9−
10−main = log "Done"
examples/passing/NonConflictingExports/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
examples/passing/NumberLiterals.pursdeleted−39
@@ -1,39 +0,0 @@
1−module Main where
2−
3−-- See issue #2115.
4−
5−import Prelude
6−import Test.Assert (assert')
7−import Control.Monad.Eff.Console (log)
8−
9−main = do
10− test "0.17" 0.17
11− test "0.25996181067141905" 0.25996181067141905
12− test "0.3572019862807257" 0.3572019862807257
13− test "0.46817723004874223" 0.46817723004874223
14− test "0.9640035681058178" 0.9640035681058178
15− test "4.23808622486133" 4.23808622486133
16− test "4.540362294799751" 4.540362294799751
17− test "5.212384849884261" 5.212384849884261
18− test "13.958257048123212" 13.958257048123212
19− test "32.96176575630599" 32.96176575630599
20− test "38.47735512322269" 38.47735512322269
21−
22− test "10000000000.0" 1e10
23− test "10000000000.0" 1.0e10
24− test "0.00001" 1e-5
25− test "0.00001" 1.0e-5
26− test "1.5339794352098402e-118" 1.5339794352098402e-118
27− test "2.108934760892056e-59" 2.108934760892056e-59
28− test "2.250634744599241e-19" 2.250634744599241e-19
29− test "5.960464477539063e-8" 5.960464477539063e-8
30− test "5e-324" 5e-324
31− test "5e-324" 5.0e-324
32−
33− log "Done"
34−
35−test str num =
36− if (show num == str)
37− then pure unit
38− else flip assert' false $
39− "Expected " <> show str <> ", got " <> show (show num) <> "."
examples/passing/ObjectGetter.pursdeleted−14
@@ -1,14 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−
6−getX = _.x
7−
8−point = { x: 1.0, y: 0.0 }
9−
10−main = do
11− logShow $ getX point
12− log $ _." 123 string Prop Name " { " 123 string Prop Name ": "OK" }
13− log $ (_.x >>> _.y) { x: { y: "Nested" } }
14− log $ _.value { value: "Done" }
examples/passing/ObjectSynonym.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−type Inner = Number
7−
8−inner :: Inner
9−inner = 0.0
10−
11−type Outer = { inner :: Inner }
12−
13−outer :: Outer
14−outer = { inner: inner }
15−
16−main = log "Done"
examples/passing/ObjectUpdate.pursdeleted−23
@@ -1,23 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−update1 = \o -> o { foo = "Foo" }
7−
8−update2 :: forall r. { foo :: String | r } -> { foo :: String | r }
9−update2 = \o -> o { foo = "Foo" }
10−
11−replace = \o -> case o of
12− { foo: "Foo" } -> o { foo = "Bar" }
13− { foo: "Bar" } -> o { bar = "Baz" }
14− o -> o
15−
16−polyUpdate :: forall a r. { foo :: a | r } -> { foo :: String | r }
17−polyUpdate = \o -> o { foo = "Foo" }
18−
19−inferPolyUpdate = \o -> o { foo = "Foo" }
20−
21−main = do
22− log ((update1 {foo: ""}).foo)
23− log "Done"
examples/passing/ObjectUpdate2.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−type X r = { | r }
7−
8−x :: X (baz :: String)
9−x = { baz: "baz" }
10−
11−blah :: forall r. X r -> X r
12−blah x = x
13−
14−test = blah x
15− { baz = "blah"
16− }
17−
18−main = log "Done"
examples/passing/ObjectUpdater.pursdeleted−26
@@ -1,26 +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
25−
26− log "Done"
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−36
@@ -1,36 +0,0 @@
1−module Main where
2−
3−import Prelude hiding (append)
4−import Control.Monad.Eff.Console (log)
5−
6−test = \x -> x.foo + x.bar + 1.0
7−
8−append = \o -> { foo: o.foo, bar: 1.0 }
9−
10−apTest = append({foo : "Foo", baz: "Baz"})
11−
12−f = (\a -> a.b.c) { b: { c: 1.0, d: "Hello" }, e: "World" }
13−
14−g = (\a -> a.f { x: 1.0, y: "y" }) { f: \o -> o.x + 1.0 }
15−
16−typed :: { foo :: Number }
17−typed = { foo: 0.0 }
18−
19−test2 = \x -> x."!@#"
20−
21−test3 = typed."foo"
22−
23−test4 = test2 weirdObj
24− where
25− weirdObj :: { "!@#" :: Number }
26− weirdObj = { "!@#": 1.0 }
27−
28−test5 = case { "***": 1.0 } of
29− { "***": n } -> n
30−
31−test6 = case { "***": 1.0 } of
32− { "***": n } -> n
33−
34−test7 {a: snoog , b : blah } = blah
35−
36−main = log "Done"
examples/passing/OneConstructor.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data One a = One a
7−
8−one' (One a) = a
9−
10−main = 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−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Def (what)
5−import Control.Monad.Eff.Console
6−
7−infixl 4 what as ?!
8−
9−main = log $ "Done" ?! true
examples/passing/OperatorAliasElsewhere/Def.pursdeleted−4
@@ -1,4 +0,0 @@
1−module Def where
2−
3−what :: forall a b. a -> b -> a
4−what a _ = a
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 "Done"
examples/passing/OperatorInlining.pursdeleted−48
@@ -1,48 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (logShow, log)
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)
47−
48− log "Done"
examples/passing/OperatorSections.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−import Test.Assert
6−
7−main = do
8− assert $ (_ / 2.0) 4.0 == 2.0
9− assert $ (2.0 / _) 4.0 == 0.5
10− assert $ (_ `const` 1.0) 2.0 == 2.0
11− assert $ (1.0 `const` _) 2.0 == 1.0
12− let foo = { x: 2.0 }
13− assert $ (_ / foo.x) 4.0 == 2.0
14− assert $ (foo.x / _) 4.0 == 0.5
15− let div x y = x.x / y.x
16− assert $ (_ `div` foo { x = 4.0 }) { x: 4.0 } == 1.0
17− assert $ (foo { x = 4.0 } `div` _) { x: 4.0 } == 1.0
18− log "Done"
examples/passing/Operators.pursdeleted−91
@@ -1,91 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Other (foo)
5−import Other as Other
6−import Control.Monad.Eff
7−import Control.Monad.Eff.Console
8−
9−op1 :: forall a. a -> a -> a
10−op1 x _ = x
11−
12−infix 4 op1 as ?!
13−
14−test1 :: forall n. (Semiring n) => n -> n -> (n -> n -> n) -> n
15−test1 x y z = x * y + z x y
16−
17−test2 = (\x -> x.foo false) { foo : \_ -> 1.0 }
18−
19−test3 = (\x y -> x)(1.0 + 2.0 * (1.0 + 2.0)) (true && (false || false))
20−
21−k = \x -> \y -> x
22−
23−test4 = 1 `k` 2
24−
25−op2 :: Number -> Number -> Number
26−op2 x y = x * y + y
27−
28−infixl 5 op2 as %%
29−
30−test5 = 1.0 %% 2.0 %% 3.0
31−
32−test6 = ((\x -> x) `k` 2.0) 3.0
33−
34−op3 :: String -> String -> String
35−op3 = \s1 s2 -> s1 <> s2
36−
37−infix 4 op3 as <+>
38−
39−test7 = "Hello" <+> "World!"
40−
41−op4 :: forall a b. (a -> b) -> a -> b
42−op4 = \f x -> f x
43−
44−infix 4 op4 as @@
45−
46−test8 = foo @@ "Hello World"
47−
48−test9 = Other.foo @@ "Hello World"
49−
50−test10 = "Hello" `Other.baz` "World"
51−
52−op5 :: forall a. Array a -> Array a -> Array a
53−op5 = \as -> \bs -> as
54−
55−infix 4 op5 as ...
56−
57−test11 = [1.0, 2.0, 0.0] ... [4.0, 5.0, 6.0]
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−main = do
75− let t1 = test1 1.0 2.0 (\x y -> x + y)
76− let t2 = test2
77− let t3 = test3
78− let t4 = test4
79− let t5 = test5
80− let t6 = test6
81− let t7 = test7
82− let t8 = test8
83− let t9 = test9
84− let t10 = test10
85− let t11 = test11
86− let t14 = test14 1.0 2.0
87− let t15 = test15 1.0 2.0
88− let t17 = test17
89− let t18 = test18
90− let t19 = test19
91− log "Done"
examples/passing/Operators/Other.pursdeleted−7
@@ -1,7 +0,0 @@
1−module Other where
2−
3−foo :: String -> String
4−foo s = s
5−
6−baz :: String -> String -> String
7−baz s _ = s
examples/passing/OptimizerBug.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−x a = 1.0 + y a
7−
8−y a = x a
9−
10−main = 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 "Done"
12− Console.log message
examples/passing/OverlappingInstances.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−import Test.Assert (assert)
6−
7−data A = A
8−
9−instance showA1 :: Show A where
10− show A = "Instance 1"
11−
12−instance showA2 :: Show A where
13− show A = "Instance 2"
14−
15−main = do
16− assert $ show A == "Instance 1"
17− log "Done"
examples/passing/OverlappingInstances2.pursdeleted−27
@@ -1,27 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−import Test.Assert (assert)
6−
7−data A = A | B
8−
9−instance eqA1 :: Eq A where
10− eq A A = true
11− eq B B = true
12− eq _ _ = false
13−
14−instance eqA2 :: Eq A where
15− eq _ _ = true
16−
17−instance ordA :: Ord A where
18− compare A B = LT
19− compare B A = GT
20− compare _ _ = EQ
21−
22−test :: forall a. (Ord a) => a -> a -> String
23−test x y = show $ x == y
24−
25−main = do
26− assert $ test A B == "false"
27− log "Done"
examples/passing/OverlappingInstances3.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−import Test.Assert (assert)
6−
7−class Foo a
8−
9−instance foo1 :: Foo Number
10−
11−instance foo2 :: Foo Number
12−
13−test :: forall a. (Foo a) => a -> a
14−test a = a
15−
16−test1 = test 0.0
17−
18−main = do
19− assert (test1 == 0.0)
20− log "Done"
examples/passing/ParensInTypedBinder.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff (Eff)
5−import Control.Monad.Eff.Console (CONSOLE, log)
6−
7−foo :: Array Int
8−foo = do
9− xss :: Array (Array Int) <- [[[1,2,3], [4, 5]], [[6]]]
10− xs :: Array Int <- xss
11− xs
12−
13−main ::
14− forall eff.
15− Eff
16− ( console :: CONSOLE
17− | eff
18− )
19− Unit
20−main = log "Done"
examples/passing/PartialFunction.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−
7−fn :: Partial => Number -> Number
8−fn 0.0 = 0.0
9−fn 1.0 = 2.0
10−
11−main = log "Done"
examples/passing/Patterns.pursdeleted−23
@@ -1,23 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−test = \x -> case x of
7− { str: "Foo", bool: true } -> true
8− { str: "Bar", bool: b } -> b
9− _ -> false
10−
11−f = \o -> case o of
12− { foo: "Foo" } -> o.bar
13− _ -> 0
14−
15−h = \o -> case o of
16− a@[_,_,_] -> a
17− _ -> []
18−
19−isDesc :: Array Number -> Boolean
20−isDesc [x, y] | x > y = true
21−isDesc _ = false
22−
23−main = log "Done"
examples/passing/PendingConflictingImports.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−-- No error as we never force `thing` to be resolved in `Main`
4−import A
5−import B
6−import Control.Monad.Eff.Console (log)
7−
8−main = log "Done"
examples/passing/PendingConflictingImports/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
examples/passing/PendingConflictingImports/B.pursdeleted−4
@@ -1,4 +0,0 @@
1−module B where
2−
3−thing :: Int
4−thing = 2
examples/passing/PendingConflictingImports2.pursdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import A
4−import Control.Monad.Eff.Console (log)
5−
6−-- No error as we never force `thing` to be resolved in `Main`
7−thing :: Int
8−thing = 2
9−
10−main = log "Done"
examples/passing/PendingConflictingImports2/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
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/PrimedTypeName.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main (T, T', T'', T''', main) where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data T a = T
7−type T' = T Unit
8−
9−data T'' = TP
10−
11−foreign import data T''' ∷ *
12−
13−instance eqT ∷ Eq T'' where
14− eq _ _ = true
15−
16−type A' a b = b → a
17−
18−infixr 4 type A' as ↫
19−
20−main = log "Done"
examples/passing/QualifiedNames.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Either as Either
5−import Control.Monad.Eff.Console (log)
6−
7−either :: forall a b c. (a -> c) -> (b -> c) -> Either.Either a b -> c
8−either f _ (Either.Left x) = f x
9−either _ g (Either.Right y) = g y
10−
11−main = log (either id id (Either.Left "Done"))
examples/passing/QualifiedNames/Either.pursdeleted−5
@@ -1,5 +0,0 @@
1−module Either where
2−
3−import Prelude
4−
5−data Either a b = Left a | Right b
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 "Done"
examples/passing/Rank2Data.pursdeleted−30
@@ -1,30 +0,0 @@
1−module Main where
2−
3−import Prelude hiding (add)
4−import Control.Monad.Eff.Console (log)
5−
6−data Id = Id forall a. a -> a
7−
8−runId = \id a -> case id of
9− Id f -> f a
10−
11−data Nat = Nat forall r. r -> (r -> r) -> r
12−
13−runNat = \nat -> case nat of
14− Nat f -> f 0.0 (\n -> n + 1.0)
15−
16−zero' = Nat (\zero' _ -> zero')
17−
18−succ = \n -> case n of
19− Nat f -> Nat (\zero' succ -> succ (f zero' succ))
20−
21−add = \n m -> case n of
22− Nat f -> case m of
23− Nat g -> Nat (\zero' succ -> g (f zero' succ) succ)
24−
25−one' = succ zero'
26−two = succ zero'
27−four = add two two
28−fourNumber = runNat four
29−
30−main = 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−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
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− logShow x
17− log "Done"
examples/passing/Rank2Types.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−test1 :: (forall a. (a -> a)) -> Number
7−test1 = \f -> f 0.0
8−
9−forever :: forall m a b. (forall a b. m a -> (a -> m b) -> m b) -> m a -> m b
10−forever = \bind action -> bind action $ \_ -> forever bind action
11−
12−main = log "Done"
examples/passing/ReExportQualified.pursdeleted−7
@@ -1,7 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import C
5−import Control.Monad.Eff.Console (log)
6−
7−main = log (x <> y)
examples/passing/ReExportQualified/A.pursdeleted−3
@@ -1,3 +0,0 @@
1−module A where
2−
3−x = "Do"
examples/passing/ReExportQualified/B.pursdeleted−3
@@ -1,3 +0,0 @@
1−module B where
2−
3−y = "ne"
examples/passing/ReExportQualified/C.pursdeleted−4
@@ -1,4 +0,0 @@
1−module C (module A, module M2) where
2−
3−import A
4−import B as M2
examples/passing/RebindableSyntax.pursdeleted−43
@@ -1,43 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−example1 :: String
7−example1 = do
8− "Do"
9− " notation"
10− " for"
11− " Semigroup"
12− where
13− bind x f = x <> f unit
14−
15−applySecond :: forall f a b. (Apply f) => f a -> f b -> f b
16−applySecond fa fb = const id <$> fa <*> fb
17−
18−infixl 4 applySecond as *>
19−
20−newtype Const a b = Const a
21−
22−runConst :: forall a b. Const a b -> a
23−runConst (Const a) = a
24−
25−instance functorConst :: Functor (Const a) where
26− map _ (Const a) = Const a
27−
28−instance applyConst :: (Semigroup a) => Apply (Const a) where
29− apply (Const a1) (Const a2) = Const (a1 <> a2)
30−
31−example2 :: Const String Unit
32−example2 = do
33− Const "Do"
34− Const " notation"
35− Const " for"
36− Const " Apply"
37− where
38− bind x f = x *> f unit
39−
40−main = do
41− log example1
42− log $ runConst example2
43− log "Done"
examples/passing/Recursion.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−fib = \n -> case n of
7− 0.0 -> 1.0
8− 1.0 -> 1.0
9− n -> fib (n - 1.0) + fib (n - 2.0)
10−
11−main = log "Done"
examples/passing/RedefinedFixity.pursdeleted−6
@@ -1,6 +0,0 @@
1−module Main where
2−
3−import M3
4−import Control.Monad.Eff.Console (log)
5−
6−main = log "Done"
examples/passing/RedefinedFixity/M1.pursdeleted−6
@@ -1,6 +0,0 @@
1−module M1 where
2−
3−applyFn :: forall a b. (forall c d. c -> d) -> a -> b
4−applyFn f a = f a
5−
6−infixr 1000 applyFn as $
examples/passing/RedefinedFixity/M2.pursdeleted−5
@@ -1,5 +0,0 @@
1−module M2 where
2−
3−import Prelude ()
4−
5−import M1
examples/passing/RedefinedFixity/M3.pursdeleted−6
@@ -1,6 +0,0 @@
1−module M3 where
2−
3−import Prelude ()
4−
5−import M1
6−import M2
examples/passing/ReservedWords.pursdeleted−19
@@ -1,19 +0,0 @@
1−-- See https://github.com/purescript/purescript/issues/606
2−module Main where
3−
4−import Prelude
5−import Control.Monad.Eff
6−import Control.Monad.Eff.Console (log)
7−
8−o :: { type :: String }
9−o = { type: "o" }
10−
11−p :: { type :: String }
12−p = o { type = "p" }
13−
14−f :: forall r. { type :: String | r } -> String
15−f { type: "p" } = "Done"
16−f _ = "Fail"
17−
18−main :: Eff _ _
19−main = log $ f { type: p.type, foo: "bar" }
examples/passing/ResolvableScopeConflict.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import A (thing)
4−import B
5−import Control.Monad.Eff.Console (log)
6−
7−-- Not an error as although we have `thing` in scope from both A and B, it is
8−-- imported explicitly from A, giving it a resolvable solution.
9−what :: Boolean -> Int
10−what true = thing
11−what false = zing
12−
13−main = log "Done"
examples/passing/ResolvableScopeConflict/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
examples/passing/ResolvableScopeConflict/B.pursdeleted−7
@@ -1,7 +0,0 @@
1−module B where
2−
3−thing :: Int
4−thing = 2
5−
6−zing :: Int
7−zing = 3
examples/passing/ResolvableScopeConflict2.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import A
4−import Control.Monad.Eff.Console (log)
5−
6−thing :: Int
7−thing = 1
8−
9−-- Not an error as although we have `thing` in scope from both Main and A,
10−-- as the local declaration takes precedence over the implicit import
11−what :: Boolean -> Int
12−what true = thing
13−what false = zing
14−
15−main = log "Done"
examples/passing/ResolvableScopeConflict2/A.pursdeleted−7
@@ -1,7 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 2
5−
6−zing :: Int
7−zing = 3
examples/passing/ResolvableScopeConflict3.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main (thing, main, module A) where
2−
3−import A
4−import Control.Monad.Eff.Console (log)
5−
6−thing :: Int
7−thing = 2
8−
9−main = log "Done"
examples/passing/ResolvableScopeConflict3/A.pursdeleted−4
@@ -1,4 +0,0 @@
1−module A where
2−
3−thing :: Int
4−thing = 1
examples/passing/RowConstructors.pursdeleted−43
@@ -1,43 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−type Foo = (x :: Number | (y :: Number | (z :: Number)))
7−type Bar = (x :: Number, y :: Number, z :: Number)
8−type Baz = { w :: Number | Bar }
9−
10−foo :: { | Foo }
11−foo = { x: 0.0, y: 0.0, z: 0.0 }
12−
13−bar :: { | Bar }
14−bar = { x: 0.0, y: 0.0, z: 0.0 }
15−
16−id' :: Record Foo -> Record Bar
17−id' = id
18−
19−foo' :: { | Foo }
20−foo' = id' foo
21−
22−bar' :: { | Bar }
23−bar' = id' bar
24−
25−baz :: Baz
26−baz = { x: 0.0, y: 0.0, z: 0.0, w: 0.0 }
27−
28−type Quux r = (q :: Number | r)
29−type Norf r = (q' :: Number | Quux r)
30−
31−quux :: { f :: { | Foo } | Quux Bar }
32−quux = { f: foo', x: 0.0, y: 0.0, z: 0.0, q: 0.0 }
33−
34−quux' :: { | Norf Bar }
35−quux' = { x: 0.0, y: 0.0, z: 0.0, q: 0.0, q': 0.0 }
36−
37−wildcard :: { w :: Number | _ } -> Baz
38−wildcard { w: w } = { x: w, y: w, z: w, w: w }
39−
40−wildcard' :: { | Quux _ } -> Number
41−wildcard' { q: q } = q
42−
43−main = log "Done"
examples/passing/RowPolyInstanceContext.pursdeleted−23
@@ -1,23 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−class T s m | m -> s where
7− state :: (s -> s) -> m Unit
8−
9−data S s a = S (s -> { new :: s, ret :: a })
10−
11−instance st :: T s (S s) where
12− state f = S $ \s -> { new: f s, ret: unit }
13−
14−test1 :: forall r . S { foo :: String | r } Unit
15−test1 = state $ \o -> o { foo = o.foo <> "!" }
16−
17−test2 :: forall m r . (T { foo :: String | r } m) => m Unit
18−test2 = state $ \o -> o { foo = o.foo <> "!" }
19−
20−main = do
21− let t1 = test1
22− let t2 = test2
23− log "Done"
examples/passing/RowsInInstanceContext.pursdeleted−25
@@ -1,25 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff (Eff)
5−import Control.Monad.Eff.Console (CONSOLE, log)
6−import Data.Newtype (class Newtype, unwrap)
7−
8−class TypeEquals a b | a -> b, b -> a where
9− coerce :: a -> b
10− coerceBack :: b -> a
11−
12−instance refl :: TypeEquals a a where
13− coerce = id
14− coerceBack = id
15−
16−newtype RecordNewtype = RecordNewtype { x :: String }
17−
18−instance newtypeRecordNewtype ::
19− TypeEquals inner { x :: String }
20− => Newtype RecordNewtype inner where
21− wrap = RecordNewtype <<< coerce
22− unwrap (RecordNewtype rec) = coerceBack rec
23−
24−main :: Eff (console :: CONSOLE) Unit
25−main = log (unwrap (RecordNewtype { x: "Done" })).x
examples/passing/RuntimeScopeIssue.pursdeleted−22
@@ -1,22 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−
6−class A a where
7− a :: a -> Boolean
8−
9−class B a where
10− b :: a -> Boolean
11−
12−instance aNumber :: A Number where
13− a 0.0 = true
14− a n = b (n - 1.0)
15−
16−instance bNumber :: B Number where
17− b 0.0 = false
18− b n = a (n - 1.0)
19−
20−main = do
21− logShow $ a 10.0
22− log "Done"
examples/passing/ScopedTypeVariables.pursdeleted−37
@@ -1,37 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−test1 :: forall a. (a -> a) -> a -> a
7−test1 f x = g (g x)
8− where
9− g :: a -> a
10− g y = f (f y)
11−
12−test2 :: forall a. (a -> a) -> a -> a
13−test2 = h
14− where
15− h :: forall b. (b -> b) -> b -> b
16− h f x = g (g x)
17− where
18− g :: b -> b
19− g y = f (f y)
20−
21−test3 :: Number
22−test3 = ((\b -> b :: b) :: forall b. b -> b) 0.0
23−
24−test4 :: forall a. (a -> a) -> a -> a
25−test4 = h
26− where
27− h :: forall b. (b -> b) -> b -> b
28− h f x = g (g x)
29− where
30− g :: b -> b
31− g y = j (f (f y))
32− where
33− j :: forall b. b -> b
34− j x = x
35−
36−
37−main = log "Done"
examples/passing/Sequence.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 (log)
6−
7−data List a = Cons a (List a) | Nil
8−
9−class Sequence t where
10− sequence :: forall m a. (Monad m) => t (m a) -> m (t a)
11−
12−instance sequenceList :: Sequence List where
13− sequence Nil = pure Nil
14− sequence (Cons x xs) = Cons <$> x <*> sequence xs
15−
16−main = sequence $ Cons (log "Done") Nil
examples/passing/SequenceDesugared.pursdeleted−38
@@ -1,38 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console (log)
6−
7−data List a = Cons a (List a) | Nil
8−
9−data Sequence t = Sequence (forall m a. (Monad m) => t (m a) -> m (t a))
10−
11−sequence :: forall t. Sequence t -> (forall m a. (Monad m) => t (m a) -> m (t a))
12−sequence (Sequence s) = s
13−
14−sequenceListSeq :: forall m a. (Monad m) => List (m a) -> m (List a)
15−sequenceListSeq Nil = pure Nil
16−sequenceListSeq (Cons x xs) = Cons <$> x <*> sequenceListSeq xs
17−
18−sequenceList :: Sequence List
19−sequenceList = Sequence (sequenceListSeq)
20−
21−sequenceList' :: Sequence List
22−sequenceList' = Sequence ((\val -> case val of
23− Nil -> pure Nil
24− Cons x xs -> Cons <$> x <*> sequence sequenceList' xs))
25−
26−sequenceList'' :: Sequence List
27−sequenceList'' = Sequence (sequenceListSeq :: forall m a. (Monad m) => List (m a) -> m (List a))
28−
29−sequenceList''' :: Sequence List
30−sequenceList''' = Sequence ((\val -> case val of
31− Nil -> pure Nil
32− Cons x xs -> Cons <$> x <*> sequence sequenceList''' xs) :: forall m a. (Monad m) => List (m a) -> m (List a))
33−
34−main = do
35− sequence sequenceList $ Cons (log "Done") Nil
36− sequence sequenceList' $ Cons (log "Done") Nil
37− sequence sequenceList'' $ Cons (log "Done") Nil
38− sequence sequenceList''' $ Cons (log "Done") Nil
examples/passing/ShadowedModuleName.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Test
4−import Control.Monad.Eff.Console
5−
6−data Test = Test
7−
8−main = log (runZ (Z "Done"))
examples/passing/ShadowedModuleName/Test.pursdeleted−6
@@ -1,6 +0,0 @@
1−module Test where
2−
3−data Z = Z String
4−
5−runZ :: Z -> String
6−runZ (Z s) = s
examples/passing/ShadowedName.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console
5−import Control.Monad.Eff.Console (log)
6−
7−done :: String
8−done = let str = "Not yet done" in
9− let str = "Done" in str
10−
11−main = log 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−21
@@ -1,21 +0,0 @@
1−module Main where
2−
3−import Prelude hiding (add)
4−import Control.Monad.Eff.Console (log)
5−
6−runNat f = f 0.0 (\n -> n + 1.0)
7−
8−zero' z _ = z
9−
10−succ f zero' succ = succ (f zero' succ)
11−
12−add f g zero' succ = g (f zero' succ) succ
13−
14−one' = succ zero'
15−two = succ one'
16−four = add two two
17−fourNumber = runNat four
18−
19−main = do
20− log $ show fourNumber
21− log "Done"
examples/passing/ShadowedTCOLet.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Partial.Unsafe (unsafePartial)
5−import Control.Monad.Eff
6−import Control.Monad.Eff.Console (log)
7−
8−f x y z =
9− let f 1.0 2.0 3.0 = 1.0
10− in f x z y
11−
12−main :: Eff _ _
13−main = do
14− log $ show $ unsafePartial f 1.0 3.0 2.0
15− log "Done"
examples/passing/SignedNumericLiterals.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−p = 0.5
7−q = 1.0
8−x = -1.0
9−y = -0.5
10−z = 0.5
11−w = 1.0
12−
13−f :: Number -> Number
14−f x = -x
15−
16−test1 = 2.0 - 1.0
17−
18−main = log "Done"
examples/passing/Stream.pursdeleted−26
@@ -1,26 +0,0 @@
1−module Main where
2−
3−import Prelude
4−
5−import Control.Monad.Eff (Eff)
6−import Control.Monad.Eff.Console (CONSOLE, log)
7−
8−class IsStream el s | s -> el where
9− cons :: el -> (Unit -> s) -> s
10− uncons :: s -> { head :: el, tail :: s }
11−
12−data Stream a = Stream a (Unit -> Stream a)
13−
14−instance streamIsStream :: IsStream a (Stream a) where
15− cons x xs = Stream x xs
16− uncons (Stream x f) = { head: x, tail: f unit }
17−
18−test :: forall el s. IsStream el s => s -> s
19−test s = case uncons s of
20− { head, tail } -> cons head \_ -> tail
21−
22−main :: Eff (console :: CONSOLE) Unit
23−main = do
24− let dones :: Stream String
25− dones = cons "Done" \_ -> dones
26− log (uncons (test dones)).head
examples/passing/StringEscapes.pursdeleted−17
@@ -1,17 +0,0 @@
1−module Main where
2−
3−import Prelude ((==), bind)
4−import Test.Assert (assert)
5−import Control.Monad.Eff.Console (log)
6−
7−singleCharacter = "\0\b\t\n\v\f\r\"\\" == "\x0\x8\x9\xA\xB\xC\xD\x22\x5C"
8−hex = "\x1D306\x2603\x3C6\xE0\x0" == "𝌆☃φà\0"
9−decimal = "\119558\9731\966\224\0" == "𝌆☃φà\0"
10−surrogatePair = "\xD834\xDF06" == "\x1D306"
11−
12−main = do
13− assert singleCharacter
14− assert hex
15− assert decimal
16− assert surrogatePair
17− log "Done"
examples/passing/Superclasses1.pursdeleted−23
@@ -1,23 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
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 suNumber :: Su Number where
13− su n = n + 1.0
14−
15−instance clNumber :: Cl Number where
16− cl n m = n + m
17−
18−test :: forall a. (Cl a) => a -> a
19−test a = su (cl a a)
20−
21−main = do
22− logShow $ test 10.0
23− log "Done"
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 (log, 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− log "Done"
15−
16−applyN :: forall a. Int -> (a -> a) -> a -> a
17−applyN = go id
18− where
19− go f n _ | n <= 0 = f
20− go f n g = go (f >>> g) (n - 1) g
examples/passing/TCOCase.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Data = One | More Data
7−
8−main = log (from (to 10000.0 One))
9− where
10− to 0.0 a = a
11− to n a = to (n - 1.0) (More a)
12− from One = "Done"
13− from (More d) = from d
examples/passing/TailCall.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log, logShow)
5−
6−data L a = C a (L a) | N
7−
8−test :: Number -> L Number -> Number
9−test n N = n
10−test n (C x xs) = test (n + x) xs
11−
12−loop :: forall a. Number -> a
13−loop x = loop (x + 1.0)
14−
15−notATailCall = \x ->
16− (\notATailCall -> notATailCall x) (\x -> x)
17−
18−main = do
19− logShow (test 0.0 (1.0 `C` (2.0 `C` (3.0 `C` N))))
20− log "Done"
examples/passing/Tick.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−test' x = x
7−
8−main = log "Done"
examples/passing/TopLevelCase.pursdeleted−19
@@ -1,19 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−gcd :: Number -> Number -> Number
7−gcd 0.0 x = x
8−gcd x 0.0 = x
9−gcd x y | x > y = gcd (x `mod` y) y
10−gcd x y = gcd (y `mod` x) x
11−
12−guardsTest [x] | x > 0.0 = []
13−guardsTest xs = xs
14−
15−data A = A
16−
17−parseTest A 0.0 = 0.0
18−
19−main = log "Done"
examples/passing/TransitiveImport.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3− import Prelude
4− import Middle
5− import Control.Monad.Eff.Console
6−
7− main = do
8− logShow (middle unit)
9− log "Done"
examples/passing/TransitiveImport/Middle.pursdeleted−5
@@ -1,5 +0,0 @@
1−module Middle where
2−
3−import Test (test)
4−
5−middle = test
examples/passing/TransitiveImport/Test.pursdeleted−9
@@ -1,9 +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
examples/passing/TypeClassMemberOrderChange.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−class Test a where
7− fn :: a -> a -> a
8− val :: a
9−
10−instance testBoolean :: Test Boolean where
11− val = true
12− fn x y = y
13−
14−main = do
15− log (show (fn true val))
16− log "Done"
examples/passing/TypeClasses.pursdeleted−71
@@ -1,71 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−test1 = \_ -> show "testing"
7−
8−f :: forall a. (Show a) => a -> String
9−f x = show x
10−
11−test2 = \_ -> f "testing"
12−
13−test7 :: forall a. (Show a) => a -> String
14−test7 = show
15−
16−test8 = \_ -> show $ "testing"
17−
18−data Data a = Data a
19−
20−instance showData :: (Show a) => Show (Data a) where
21− show (Data a) = "Data (" <> show a <> ")"
22−
23−test3 = \_ -> show (Data "testing")
24−
25−instance functorData :: Functor Data where
26− map = liftM1
27−
28−instance applyData :: Apply Data where
29− apply = ap
30−
31−instance applicativeData :: Applicative Data where
32− pure = Data
33−
34−instance bindData :: Bind Data where
35− bind (Data a) f = f a
36−
37−instance monadData :: Monad Data
38−
39−data Maybe a = Nothing | Just a
40−
41−instance functorMaybe :: Functor Maybe where
42− map = liftM1
43−
44−instance applyMaybe :: Apply Maybe where
45− apply = ap
46−
47−instance applicativeMaybe :: Applicative Maybe where
48− pure = Just
49−
50−instance bindMaybe :: Bind Maybe where
51− bind Nothing _ = Nothing
52− bind (Just a) f = f a
53−
54−instance monadMaybe :: Monad Maybe
55−
56−test4 :: forall a m. (Monad m) => a -> m Number
57−test4 = \_ -> pure 1.0
58−
59−test5 = \_ -> Just 1.0 >>= \n -> pure (n + 1.0)
60−
61−ask r = r
62−
63−runReader r f = f r
64−
65−test9 _ = runReader 0.0 $ do
66− n <- ask
67− pure $ n + 1.0
68−
69−main = do
70− log (test7 "Hello")
71− log "Done"
examples/passing/TypeClassesInOrder.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−class Foo a where
7− foo :: a -> String
8−
9−instance fooString :: Foo String where
10− foo s = s
11−
12−main = log $ foo "Done"
examples/passing/TypeClassesWithOverlappingTypeVariables.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Either a b = Left a | Right b
7−
8−instance functorEither :: Functor (Either a) where
9− map _ (Left x) = Left x
10− map f (Right y) = Right (f y)
11−
12−main = log "Done"
examples/passing/TypeDecl.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−k :: String -> Number -> String
7−k x y = x
8−
9−iterate :: forall a. Number -> (a -> a) -> a -> a
10−iterate 0.0 f a = a
11−iterate n f a = iterate (n - 1.0) f (f a)
12−
13−main = log "Done"
examples/passing/TypeOperators.pursdeleted−20
@@ -1,20 +0,0 @@
1−module Main where
2−
3−import A (type (~>), type (/\), (/\))
4−import Control.Monad.Eff.Console (log)
5−
6−natty ∷ ∀ f. f ~> f
7−natty x = x
8−
9−data Compose f g a = Compose (f (g a))
10−
11−testPrecedence1 ∷ ∀ f g. Compose f g ~> Compose f g
12−testPrecedence1 x = x
13−
14−testPrecedence2 ∷ ∀ f g. f ~> g → f ~> g
15−testPrecedence2 nat fx = nat fx
16−
17−swap ∷ ∀ a b. a /\ b → b /\ a
18−swap (a /\ b) = b /\ a
19−
20−main = log "Done"
examples/passing/TypeOperators/A.pursdeleted−22
@@ -1,22 +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
examples/passing/TypeSynonymInData.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−type A a = Array a
7−
8−data Foo a = Foo (A a) | Bar
9−
10−foo (Foo []) = Bar
11−
12−main = log "Done"
examples/passing/TypeSynonyms.pursdeleted−28
@@ -1,28 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−type Lens a b =
7− { get :: a -> b
8− , set :: a -> b -> a
9− }
10−
11−composeLenses :: forall a b c. Lens a b -> Lens b c -> Lens a c
12−composeLenses = \l1 -> \l2 ->
13− { get: \a -> l2.get (l1.get a)
14− , set: \a c -> l1.set a (l2.set (l1.get a) c)
15− }
16−
17−type Pair a b = { fst :: a, snd :: b }
18−
19−fst :: forall a b. Lens (Pair a b) a
20−fst =
21− { get: \p -> p.fst
22− , set: \p a -> { fst: a, snd: p.snd }
23− }
24−
25−test1 :: forall a b c. Lens (Pair (Pair a b) c) a
26−test1 = composeLenses fst fst
27−
28−main = log "Done"
examples/passing/TypeWildcards.pursdeleted−16
@@ -1,16 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−testTopLevel :: _ -> _
7−testTopLevel n = n + 1.0
8−
9−test :: forall a. (Eq a) => (a -> a) -> a -> a
10−test f a = go (f a) a
11− where
12− go :: _ -> _ -> _
13− go a1 a2 | a1 == a2 = a1
14− go a1 _ = go (f a1) a1
15−
16−main = log "Done"
examples/passing/TypeWildcardsRecordExtension.pursdeleted−9
@@ -1,9 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−foo :: forall a. {b :: Number | a} -> {b :: Number | _}
7−foo f = f
8−
9−main = log "Done"
examples/passing/TypeWithoutParens.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Lib (X, Y)
4−import Control.Monad.Eff.Console (log)
5−
6−idX :: X -> X
7−idX x = x
8−
9−idY :: Y -> Y
10−idY y = y
11−
12−main = log "Done"
examples/passing/TypeWithoutParens/Lib.pursdeleted−4
@@ -1,4 +0,0 @@
1−module Lib (X, Y) where
2−
3−data X = X
4−type Y = X
examples/passing/TypedBinders.pursdeleted−68
@@ -1,68 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Tuple a b = Tuple a b
7−
8−class MonadState s m where
9− get :: m s
10− put :: s -> m {}
11−
12−data State s a = State (s -> Tuple s a)
13−
14−runState s (State f) = f s
15−
16−instance functorState :: Functor (State s) where
17− map = liftM1
18−
19−instance applyState :: Apply (State s) where
20− apply = ap
21−
22−instance applicativeState :: Applicative (State s) where
23− pure a = State $ \s -> Tuple s a
24−
25−instance bindState :: Bind (State s) where
26− bind f g = State $ \s -> case runState s f of
27− Tuple s1 a -> runState s1 (g a)
28−
29−instance monadState :: Monad (State s)
30−
31−instance monadStateState :: MonadState s (State s) where
32− get = State (\s -> Tuple s s)
33− put s = State (\_ -> Tuple s {})
34−
35−modify :: forall m s. (Monad m, MonadState s m) => (s -> s) -> m {}
36−modify f = do
37− s <- get
38− put (f s)
39−
40−test :: Tuple String String
41−test = runState "" $ do
42− modify $ (<>) "World!"
43− modify $ (<>) "Hello, "
44− str :: String <- get
45− pure str
46−
47−test2 :: (Int -> Int) -> Int
48−test2 = (\(f :: Int -> Int) -> f 10)
49−
50−test3 :: Int -> Boolean
51−test3 n = case n of
52− (0 :: Int) -> true
53− _ -> false
54−
55−test4 :: Tuple Int Int -> Tuple Int Int
56−test4 = (\(Tuple a b :: Tuple Int Int) -> Tuple b a)
57−
58−type Int1 = Int
59−
60−test5 :: Int1 -> Int1
61−test5 = \(x :: Int1) -> x
62−
63−main = do
64− let t1 = test
65− t2 = test2 id
66− t3 = test3 1
67− t4 = test4 (Tuple 1 0)
68− log "Done"
examples/passing/TypedWhere.pursdeleted−18
@@ -1,18 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data E a b = L a | R b
7−
8−data L a = C a (L a) | N
9−
10−lefts :: forall a b. L (E a b) -> L a
11−lefts = go N
12− where
13− go :: forall a b. L a -> L (E a b) -> L a
14− go ls N = ls
15− go ls (C (L a) rest) = go (C a ls) rest
16− go ls (C _ rest) = go ls rest
17−
18−main = log "Done"
examples/passing/UTF8Sourcefile.pursdeleted−8
@@ -1,8 +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 = log "Done"
examples/passing/UnderscoreIdent.pursdeleted−13
@@ -1,13 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−data Data_type = Con_Structor | Con_2 String
7−
8−type Type_name = Data_type
9−
10−done (Con_2 s) = s
11−done _ = "Failed"
12−
13−main = log (done (Con_2 "Done"))
examples/passing/UnicodeIdentifier.pursdeleted−7
@@ -1,7 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−f asgård = asgård
6−
7−main = log (f "Done")
examples/passing/UnicodeOperators.pursdeleted−22
@@ -1,22 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−compose :: forall a b c. (b -> c) -> (a -> b) -> a -> c
6−compose f g a = f (g a)
7−
8−infixr 9 compose as ∘
9−
10−test1 = (\x -> x) ∘ \y -> y
11−
12−elem :: forall a b. a -> (a -> Boolean) -> Boolean
13−elem x f = f x
14−
15−infixl 1 elem as ∈
16−
17−emptySet :: forall a. a -> Boolean
18−emptySet _ = true
19−
20−test2 = 1 ∈ emptySet
21−
22−main = log "Done"
examples/passing/UnicodeType.pursdeleted−22
@@ -1,22 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−class Monad m ⇐ Monad1 m where
7− f1 :: Int
8−
9−class Monad m <= Monad2 m where
10− f2 :: Int
11−
12−f ∷ ∀ m. Monad m ⇒ Int → m Int
13−f n = do
14− n' ← pure n
15− pure n'
16−
17−f' :: forall m. Monad m => Int -> m Int
18−f' n = do
19− n' <- pure n
20− pure n'
21−
22−main = log "Done"
examples/passing/UnifyInTypeInstanceLookup.pursdeleted−25
@@ -1,25 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−data Z = Z
6−data S n = S n
7−
8−data T
9−data F
10−
11−class EQ x y b
12−instance eqT :: EQ x x T
13−instance eqF :: EQ x y F
14−
15−test :: forall a b. (EQ a b T) => a -> b -> a
16−test a _ = a
17−
18−spin :: forall a b. a -> b
19−spin a = spin a
20−
21−-- Expected type:
22−-- forall t. (EQ t (S Z) T) => t
23−test1 = test (spin 1) (S Z)
24−
25−main = log "Done"
examples/passing/Unit.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (logShow, log)
5−
6−main = do
7− logShow (const unit $ "Hello world")
8− log "Done"
examples/passing/UnknownInTypeClassLookup.pursdeleted−15
@@ -1,15 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−class EQ a b
7−
8−instance eqAA :: EQ a a
9−
10−test :: forall a b. (EQ a b) => a -> b -> String
11−test _ _ = "Done"
12−
13−runTest a = test a a
14−
15−main = 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 (log)
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 Partial.Unsafe (unsafePartial)
5−import Control.Monad.Eff
6−import Control.Monad.Eff.Console (logShow, log)
7−
8−test1 x = y
9− where
10− y :: Number
11− y = x + 1.0
12−
13−test2 x y = x' + y'
14− where
15− x' = x + 1.0
16− y' = y + 1.0
17−
18−test3 = f 1.0 2.0 3.0
19− where f x y z = x + y + z
20−
21−test4 = f (+) [1.0, 2.0]
22− where f x [y, z] = x y z
23−
24−test5 = g 10.0
25− where
26− f x | x > 0.0 = g (x / 2.0) + 1.0
27− f x = 0.0
28− g x = f (x - 1.0) + 1.0
29−
30−test6 = if f true then f 1.0 else f 2.0
31− where f :: forall a. a -> a
32− f x = x
33−
34−test7 :: Number -> Number
35−test7 x = go x
36− where
37− go y | (x - 0.1 < y * y) && (y * y < x + 0.1) = y
38− go y = go $ (y + x / y) / 2.0
39−
40−main :: Eff _ _
41−main = do
42− logShow (test1 1.0)
43− logShow (test2 1.0 2.0)
44− logShow test3
45− unsafePartial (logShow test4)
46− logShow test5
47− logShow test6
48− logShow (test7 100.0)
49− log "Done"
examples/passing/WildcardInInstance.pursdeleted−23
@@ -1,23 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff
5−import Control.Monad.Eff.Console
6−
7−-- Until the functional dependency gets added to purescript-eff,
8−-- we need this here.
9−class Monad m <= MonadEff eff m | m -> eff where
10− liftEff :: forall a. Eff eff a -> m a
11−
12−instance monadEffEff :: MonadEff eff (Eff eff) where
13− liftEff = id
14−
15−-- This should generate a warning with the correct inferred type.
16−test :: forall m. MonadEff _ m => m Unit
17−test = liftEff $ log "Done"
18−
19−test1 :: Eff _ Unit
20−test1 = liftEff $ log "Done"
21−
22−main :: forall eff. Eff (console :: CONSOLE | eff) Unit
23−main = test
examples/passing/WildcardType.pursdeleted−12
@@ -1,12 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−f1 :: (_ -> _) -> _
7−f1 g = g 1
8−
9−f2 :: _ -> _
10−f2 _ = "Done"
11−
12−main = log $ f1 f2
examples/passing/iota.pursdeleted−11
@@ -1,11 +0,0 @@
1−module Main where
2−
3−import Control.Monad.Eff.Console (log)
4−
5−s = \x -> \y -> \z -> x z (y z)
6−
7−k = \x -> \y -> x
8−
9−iota = \x -> x s k
10−
11−main = log "Done"
examples/passing/s.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Main where
2−
3−import Prelude
4−import Control.Monad.Eff.Console (log)
5−
6−s = \x y z -> x z (y z)
7−
8−main = log "Done"
examples/warning/DuplicateExportRef.pursdeleted−30
@@ -1,30 +0,0 @@
1−-- @shouldWarnWith DuplicateExportRef
2−-- @shouldWarnWith DuplicateExportRef
3−-- @shouldWarnWith DuplicateExportRef
4−-- @shouldWarnWith DuplicateExportRef
5−-- @shouldWarnWith DuplicateExportRef
6−-- @shouldWarnWith DuplicateExportRef
7−-- @shouldWarnWith DuplicateExportRef
8−module Main
9− ( X(X, X), X
10− , fn, fn
11− , (!), (!)
12− , class Y, class Y
13− , Natural, type (~>), type (~>)
14− , module Prelude, module Prelude
15− ) where
16−
17−import Prelude (Unit)
18−
19−data X = X
20−
21−fn :: X -> X -> X
22−fn _ _ = X
23−
24−infix 2 fn as !
25−
26−class Y a
27−
28−type Natural f g = forall a. f a -> g a
29−
30−infixl 1 type Natural as ~>
examples/warning/DuplicateImport.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldWarnWith DuplicateImport
2−module Main where
3−
4−import Prelude (Unit, unit, pure)
5−import Prelude (Unit, unit, pure)
6−
7−import Control.Monad.Eff (Eff)
8−
9−main :: Eff () Unit
10−main = pure unit
examples/warning/DuplicateImportRef.pursdeleted−18
@@ -1,18 +0,0 @@
1−-- @shouldWarnWith DuplicateImportRef
2−-- @shouldWarnWith DuplicateImportRef
3−-- @shouldWarnWith DuplicateImportRef
4−-- @shouldWarnWith DuplicateImportRef
5−module Main where
6−
7−import Prelude
8− ( Unit, Unit
9− , unit, unit
10− , class Functor, class Functor
11− , (<>), (<>)
12− )
13−
14−u :: Unit
15−u = unit <> unit
16−
17−fid :: forall f a. Functor f => f a -> f a
18−fid fa = fa
examples/warning/DuplicateSelectiveImport.pursdeleted−10
@@ -1,10 +0,0 @@
1−-- @shouldWarnWith DuplicateSelectiveImport
2−module Main where
3−
4−import Prelude (Unit, unit)
5−import Prelude (pure)
6−
7−import Control.Monad.Eff (Eff)
8−
9−main :: Eff () Unit
10−main = pure unit
examples/warning/HidingImport.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldWarnWith HidingImport
2−-- @shouldWarnWith HidingImport
3−module Main where
4−
5−import Prelude hiding (one)
6−import Control.Monad.Eff hiding (runPure)
7−
8−main :: Eff () Unit
9−main = pure unit
examples/warning/ImplicitImport.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldWarnWith ImplicitImport
2−-- @shouldWarnWith ImplicitImport
3−module Main where
4−
5−import Prelude
6−import Control.Monad.Eff
7−
8−main :: Eff () Unit
9−main = pure unit
examples/warning/ImplicitQualifiedImport.pursdeleted−11
@@ -1,11 +0,0 @@
1−-- @shouldWarnWith ImplicitQualifiedImport
2−-- @shouldWarnWith ImplicitQualifiedImport
3−module Main where
4−
5−import Data.Unit
6−
7−import Control.Monad.Eff as E
8−import Control.Monad.Eff.Console as E
9−
10−main :: E.Eff (console :: E.CONSOLE) Unit
11−main = E.log "test"
examples/warning/MissingTypeDeclaration.pursdeleted−4
@@ -1,4 +0,0 @@
1−-- @shouldWarnWith MissingTypeDeclaration
2−module Main where
3−
4−x = 0
examples/warning/OverlappingInstances.pursdeleted−17
@@ -1,17 +0,0 @@
1−-- @shouldWarnWith OverlappingInstances
2−module Main where
3−
4−class Test a where
5− test :: a -> a
6−
7−instance testRefl :: Test a where
8− test x = x
9−
10−instance testInt :: Test Int where
11− test _ = 0
12−
13−-- The OverlappingInstances instances warning only arises when there are two
14−-- choices for a dictionary, not when the instances are defined. So without
15−-- `value` this module would not raise a warning.
16−value :: Int
17−value = test 1
examples/warning/OverlappingPattern.pursdeleted−15
@@ -1,15 +0,0 @@
1−-- @shouldWarnWith OverlappingPattern
2−-- @shouldWarnWith OverlappingPattern
3−module Main where
4−
5−data X = A | B
6−
7−pat1 :: X -> Boolean
8−pat1 A = true
9−pat1 A = true
10−pat1 B = false
11−
12−pat2 :: X -> Boolean
13−pat2 A = true
14−pat2 _ = false
15−pat2 B = false
examples/warning/ScopeShadowing.pursdeleted−13
@@ -1,13 +0,0 @@
1−-- @shouldWarnWith ScopeShadowing
2−module Main where
3−
4−import Prelude
5−
6−-- No warning at the definition, only when the name is later resolved
7−data Unit = Unit
8−
9−-- This is only a warning as the `Prelude` import is implicit. If `Unit` was
10−-- named explicitly in an import list, then this refernce to `Unit`
11−-- would be a `ScopeConflict` error instead.
12−test :: Unit
13−test = const Unit unit
examples/warning/ShadowedTypeVar.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldWarnWith ShadowedTypeVar
2−module Main where
3−
4−f :: forall a. (forall a. a -> a) -> a -> a
5−f g x = g x
examples/warning/UnnecessaryFFIModule.jsdeleted−1
@@ -1 +0,0 @@
1−exports.out = null;
examples/warning/UnnecessaryFFIModule.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldWarnWith UnnecessaryFFIModule
2−module Main where
3−
4−t :: Boolean
5−t = true
examples/warning/UnusedDctorExplicitImport.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldWarnWith UnusedDctorExplicitImport
2−module Main where
3−
4−import Data.Ordering (Ordering(EQ, LT))
5−
6−f :: Ordering -> Ordering
7−f EQ = EQ
8−f x = x
examples/warning/UnusedDctorImportAll.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldWarnWith UnusedDctorImport
2−module Main where
3−
4−import Data.Ordering (Ordering(..))
5−
6−f :: Ordering -> Ordering
7−f x = x
examples/warning/UnusedDctorImportExplicit.pursdeleted−7
@@ -1,7 +0,0 @@
1−-- @shouldWarnWith UnusedDctorImport
2−module Main where
3−
4−import Data.Ordering (Ordering(EQ))
5−
6−f :: Ordering -> Ordering
7−f x = x
examples/warning/UnusedExplicitImport.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldWarnWith UnusedExplicitImport
2−module Main where
3−
4−import Prelude (Unit, unit, pure, bind)
5−import Control.Monad.Eff (Eff)
6−
7−main :: Eff () Unit
8−main = pure unit
examples/warning/UnusedExplicitImportTypeOp.pursdeleted−9
@@ -1,9 +0,0 @@
1−-- @shouldWarnWith UnusedExplicitImport
2−module Main where
3−
4−import Prelude (Unit, unit, pure)
5−import Control.Monad.Eff (Eff)
6−import Lib (type (~>), natId)
7−
8−main :: Eff () Unit
9−main = natId (pure unit)
examples/warning/UnusedExplicitImportTypeOp/Lib.pursdeleted−8
@@ -1,8 +0,0 @@
1−module Lib where
2−
3−type Nat f g = ∀ x. f x → g x
4−
5−infixr 4 type Nat as ~>
6−
7−natId ∷ ∀ f. f ~> f
8−natId x = x
examples/warning/UnusedExplicitImportValOp.pursdeleted−8
@@ -1,8 +0,0 @@
1−-- @shouldWarnWith UnusedExplicitImport
2−module Main where
3−
4−import Prelude (Unit, unit, pure, (+))
5−import Control.Monad.Eff (Eff)
6−
7−main :: Eff () Unit
8−main = pure unit
examples/warning/UnusedFFIImplementations.jsdeleted−2
@@ -1,2 +0,0 @@
1−exports.yes = true;
2−exports.no = false;
examples/warning/UnusedFFIImplementations.pursdeleted−4
@@ -1,4 +0,0 @@
1−-- @shouldWarnWith UnusedFFIImplementations
2−module Main where
3−
4−foreign import yes :: Boolean
examples/warning/UnusedImport.pursdeleted−14
@@ -1,14 +0,0 @@
1−-- @shouldWarnWith UnusedImport
2−-- @shouldWarnWith UnusedImport
3−-- @shouldWarnWith UnusedImport
4−module Main where
5−
6−import Data.Unit (Unit, unit)
7−
8−-- All of the below are unused
9−import Control.Monad.Eff
10−import Control.Monad.Eff.Console as Console
11−import Test.Assert ()
12−
13−main :: Unit
14−main = unit
examples/warning/UnusedTypeVar.pursdeleted−5
@@ -1,5 +0,0 @@
1−-- @shouldWarnWith UnusedTypeVar
2−module Main where
3−
4−f :: forall a b. a -> a
5−f x = x
examples/warning/WildcardInferredType.pursdeleted−23
@@ -1,23 +0,0 @@
1−-- @shouldWarnWith WildcardInferredType
2−-- @shouldWarnWith WildcardInferredType
3−-- @shouldWarnWith WildcardInferredType
4−-- @shouldWarnWith WildcardInferredType
5−module Main where
6−
7−x :: Int
8−x = 0 :: _
9−
10−y :: _
11−y = 0
12−
13−z :: Int
14−z =
15− let n :: _
16− n = 0
17− in n
18−
19−w :: Int
20−w = n
21− where
22− n :: _
23− n = 0
hierarchy/Main.hsdeleted−118
@@ -1,118 +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.Applicative (optional)
22−import Control.Monad (unless)
23−
24−import Data.List (intercalate,nub,sort)
25−import Data.Foldable (for_)
26−import Data.Version (showVersion)
27−import Data.Monoid ((<>))
28−
29−import Options.Applicative (Parser)
30−import qualified Options.Applicative as Opts
31−import System.Directory (createDirectoryIfMissing)
32−import System.FilePath ((</>))
33−import System.FilePath.Glob (glob)
34−import System.Exit (exitFailure, exitSuccess)
35−import System.IO (hPutStr, stderr)
36−import System.IO.UTF8 (readUTF8File)
37−
38−import qualified Language.PureScript as P
39−import qualified Paths_purescript as Paths
40−
41−data HierarchyOptions = HierarchyOptions
42− { hierachyInput :: FilePath
43− , hierarchyOutput :: Maybe FilePath
44− }
45−
46−newtype SuperMap = SuperMap { unSuperMap :: Either (P.ProperName 'P.ClassName) (P.ProperName 'P.ClassName, P.ProperName 'P.ClassName) }
47− deriving Eq
48−
49−instance Show SuperMap where
50− show (SuperMap (Left sub)) = show sub
51− show (SuperMap (Right (super, sub))) = show super ++ " -> " ++ show sub
52−
53−instance Ord SuperMap where
54− compare (SuperMap s) (SuperMap s') = getCls s `compare` getCls s'
55− where
56− getCls = either id snd
57−
58−runModuleName :: P.ModuleName -> String
59−runModuleName (P.ModuleName pns) = intercalate "_" (P.runProperName `map` pns)
60−
61−readInput :: [FilePath] -> IO (Either P.MultipleErrors [P.Module])
62−readInput paths = do
63− content <- mapM (\path -> (path, ) <$> readUTF8File path) paths
64− return $ map snd <$> P.parseModulesFromFiles id content
65−
66−compile :: HierarchyOptions -> IO ()
67−compile (HierarchyOptions inputGlob mOutput) = do
68− input <- glob inputGlob
69− modules <- readInput input
70− case modules of
71− Left errs -> hPutStr stderr (P.prettyPrintMultipleErrors P.defaultPPEOptions errs) >> exitFailure
72− Right ms -> do
73− for_ ms $ \(P.Module _ _ moduleName decls _) ->
74− let name = runModuleName moduleName
75− tcs = filter P.isTypeClassDeclaration decls
76− supers = sort . nub . filter (not . null) $ fmap superClasses tcs
77− prologue = "digraph " ++ name ++ " {\n"
78− body = intercalate "\n" (concatMap (fmap (\s -> " " ++ show s ++ ";")) supers)
79− epilogue = "\n}"
80− hier = prologue ++ body ++ epilogue
81− in unless (null supers) $ case mOutput of
82− Just output -> do
83− createDirectoryIfMissing True output
84− writeFile (output </> name) hier
85− Nothing -> putStrLn hier
86− exitSuccess
87−
88−superClasses :: P.Declaration -> [SuperMap]
89−superClasses (P.TypeClassDeclaration sub _ supers@(_:_) _ _) =
90− fmap (\(P.Constraint (P.Qualified _ super) _ _) -> SuperMap (Right (super, sub))) supers
91−superClasses (P.TypeClassDeclaration sub _ _ _ _) = [SuperMap (Left sub)]
92−superClasses (P.PositionedDeclaration _ _ decl) = superClasses decl
93−superClasses _ = []
94−
95−inputFile :: Parser FilePath
96−inputFile = Opts.strArgument $
97− Opts.metavar "FILE"
98− <> Opts.value "main.purs"
99− <> Opts.showDefault
100− <> Opts.help "The input file to generate a hierarchy from"
101−
102−outputFile :: Parser (Maybe FilePath)
103−outputFile = optional . Opts.strOption $
104− Opts.short 'o'
105− <> Opts.long "output"
106− <> Opts.help "The output directory"
107−
108−pscOptions :: Parser HierarchyOptions
109−pscOptions = HierarchyOptions <$> inputFile
110− <*> outputFile
111−
112−main :: IO ()
113−main = Opts.execParser opts >>= compile
114− where
115− opts = Opts.info (Opts.helper <*> pscOptions) infoModList
116− infoModList = Opts.fullDesc <> headerInfo <> footerInfo
117− headerInfo = Opts.header "hierarchy - Creates a GraphViz directed graph of PureScript TypeClasses"
118− footerInfo = Opts.footer $ "hierarchy " ++ showVersion Paths.version
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−15
@@ -1,15 +0,0 @@
1−Copyright (c) 2013-16 Phil Freeman, (c) 2014-2016 Gary Burgess, and other
2−contributors
3−All rights reserved.
4−
5−Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
6−
7−1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
8−
9−2. 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.
10−
11−3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
12−
13−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 HOLDER 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.
14−
15−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−122
@@ -1,122 +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−import Data.Monoid ((<>))
12−
13−import Control.Applicative
14−import Control.Monad
15−import Control.Monad.Error.Class
16−import Control.Monad.Trans.Except
17−import Control.Monad.IO.Class
18−
19−import System.FilePath (takeDirectory)
20−import System.FilePath.Glob (glob)
21−import System.Exit (exitFailure)
22−import System.IO (stderr, stdout, hPutStrLn, hSetEncoding, utf8)
23−import System.IO.UTF8 (readUTF8File)
24−import System.Directory (createDirectoryIfMissing)
25−
26−import Language.PureScript.Bundle
27−
28−import Options.Applicative (Parser, ParseError (..))
29−import qualified Options.Applicative as Opts
30−
31−import qualified Paths_purescript as Paths
32−
33−-- | Command line options.
34−data Options = Options
35− { optionsInputFiles :: [FilePath]
36− , optionsOutputFile :: Maybe FilePath
37− , optionsEntryPoints :: [String]
38− , optionsMainModule :: Maybe String
39− , optionsNamespace :: String
40− } deriving Show
41−
42−-- | The main application function.
43−-- This function parses the input files, performs dead code elimination, filters empty modules
44−-- and generates and prints the final Javascript bundle.
45−app :: (MonadError ErrorMessage m, MonadIO m) => Options -> m String
46−app Options{..} = do
47− inputFiles <- concat <$> mapM (liftIO . glob) optionsInputFiles
48− when (null inputFiles) . liftIO $ do
49− hPutStrLn stderr "psc-bundle: No input files."
50− exitFailure
51− input <- for inputFiles $ \filename -> do
52− js <- liftIO (readUTF8File filename)
53− mid <- guessModuleIdentifier filename
54− length js `seq` return (mid, js) -- evaluate readFile till EOF before returning, not to exhaust file handles
55−
56− let entryIds = map (`ModuleIdentifier` Regular) optionsEntryPoints
57−
58− bundle input entryIds optionsMainModule optionsNamespace
59−
60−-- | Command line options parser.
61−options :: Parser Options
62−options = Options <$> some inputFile
63− <*> optional outputFile
64− <*> many entryPoint
65− <*> optional mainModule
66− <*> namespace
67− where
68− inputFile :: Parser FilePath
69− inputFile = Opts.strArgument $
70− Opts.metavar "FILE"
71− <> Opts.help "The input .js file(s)"
72−
73− outputFile :: Parser FilePath
74− outputFile = Opts.strOption $
75− Opts.short 'o'
76− <> Opts.long "output"
77− <> Opts.help "The output .js file"
78−
79− entryPoint :: Parser String
80− entryPoint = Opts.strOption $
81− Opts.short 'm'
82− <> Opts.long "module"
83− <> Opts.help "Entry point module name(s). All code which is not a transitive dependency of an entry point module will be removed."
84−
85− mainModule :: Parser String
86− mainModule = Opts.strOption $
87− Opts.long "main"
88− <> Opts.help "Generate code to run the main method in the specified module."
89−
90− namespace :: Parser String
91− namespace = Opts.strOption $
92− Opts.short 'n'
93− <> Opts.long "namespace"
94− <> Opts.value "PS"
95− <> Opts.showDefault
96− <> Opts.help "Specify the namespace that PureScript modules will be exported to when running in the browser."
97−
98−-- | Make it go.
99−main :: IO ()
100−main = do
101− hSetEncoding stdout utf8
102− hSetEncoding stderr utf8
103− opts <- Opts.execParser (Opts.info (version <*> Opts.helper <*> options) infoModList)
104− output <- runExceptT (app opts)
105− case output of
106− Left err -> do
107− hPutStrLn stderr (unlines (printErrorMessage err))
108− exitFailure
109− Right js ->
110− case optionsOutputFile opts of
111− Just outputFile -> do
112− createDirectoryIfMissing True (takeDirectory outputFile)
113− writeFile outputFile js
114− Nothing -> putStrLn js
115− where
116− infoModList = Opts.fullDesc <> headerInfo <> footerInfo
117− headerInfo = Opts.header "psc-bundle - Bundles compiled PureScript modules for the browser"
118− footerInfo = Opts.footer $ "psc-bundle " ++ showVersion Paths.version
119−
120− version :: Parser (a -> a)
121− version = Opts.abortOption (InfoMsg (showVersion Paths.version)) $
122− Opts.long "version" <> Opts.help "Show the version number" <> Opts.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 P.defaultPPEOptions 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−49
@@ -1,49 +0,0 @@
1−{-# LANGUAGE OverloadedStrings #-}
2−module Main where
3−
4−import Prelude ()
5−import Prelude.Compat
6−
7−import Control.Exception
8−import qualified Data.ByteString.Char8 as BS8
9−import qualified Data.Text.IO as T
10−import Data.Version (showVersion)
11−import Data.Monoid ((<>))
12−import Network
13−import Options.Applicative (ParseError (..))
14−import qualified Options.Applicative as Opts
15−import System.Exit
16−import System.IO
17−
18−import qualified Paths_purescript as Paths
19−
20−data Options = Options
21− { optionsPort :: PortID
22− }
23−
24−main :: IO ()
25−main = do
26− Options port <- Opts.execParser opts
27− client port
28− where
29− parser =
30− Options <$>
31− (PortNumber . fromIntegral <$>
32− Opts.option Opts.auto (Opts.long "port" <> Opts.short 'p' <> Opts.value (4242 :: Integer)))
33− opts = Opts.info (version <*> Opts.helper <*> parser) mempty
34− version = Opts.abortOption (InfoMsg (showVersion Paths.version)) $
35− Opts.long "version" <> Opts.help "Show the version number" <> Opts.hidden
36−
37−client :: PortID -> IO ()
38−client port = do
39− h <-
40− connectTo "127.0.0.1" port `catch`
41− (\(SomeException e) ->
42− putStrLn
43− ("Couldn't connect to psc-ide-server on port: " ++
44− show port ++ " Error: " ++ show e) >>
45− exitFailure)
46− T.hPutStrLn h =<< T.getLine
47− BS8.putStrLn =<< BS8.hGetLine h
48− hFlush stdout
49− hClose h
psc-ide-server/Main.hsdeleted−159
@@ -1,159 +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 FlexibleContexts #-}
16−{-# LANGUAGE MultiParamTypeClasses #-}
17−{-# LANGUAGE OverloadedStrings #-}
18−{-# LANGUAGE PackageImports #-}
19−{-# LANGUAGE TemplateHaskell #-}
20−{-# LANGUAGE NoImplicitPrelude #-}
21−
22−module Main where
23−
24−import Protolude
25−
26−import qualified Data.Aeson as Aeson
27−import Control.Concurrent.STM
28−import "monad-logger" Control.Monad.Logger
29−import qualified Data.Text.IO as T
30−import qualified Data.ByteString.Lazy.Char8 as BS8
31−import Data.Version (showVersion)
32−import Language.PureScript.Ide
33−import Language.PureScript.Ide.Util
34−import Language.PureScript.Ide.Error
35−import Language.PureScript.Ide.Types
36−import Language.PureScript.Ide.Watcher
37−import Network hiding (socketPort, accept)
38−import Network.BSD (getProtocolNumber)
39−import Network.Socket hiding (PortNumber, Type,
40− sClose)
41−import Options.Applicative (ParseError (..))
42−import qualified Options.Applicative as Opts
43−import System.Directory
44−import System.FilePath
45−import System.IO hiding (putStrLn, print)
46−import System.IO.Error (isEOFError)
47−
48−import qualified Paths_purescript as Paths
49−
50−listenOnLocalhost :: PortNumber -> IO Socket
51−listenOnLocalhost port = do
52− proto <- getProtocolNumber "tcp"
53− localhost <- inet_addr "127.0.0.1"
54− bracketOnError
55− (socket AF_INET Stream proto)
56− sClose
57− (\sock -> do
58− setSocketOption sock ReuseAddr 1
59− bind sock (SockAddrInet port localhost)
60− listen sock maxListenQueue
61− pure sock)
62−
63−data Options = Options
64− { optionsDirectory :: Maybe FilePath
65− , optionsGlobs :: [FilePath]
66− , optionsOutputPath :: FilePath
67− , optionsPort :: PortNumber
68− , optionsNoWatch :: Bool
69− , optionsDebug :: Bool
70− }
71−
72−main :: IO ()
73−main = do
74− Options dir globs outputPath port noWatch debug <- Opts.execParser opts
75− maybe (pure ()) setCurrentDirectory dir
76− ideState <- newTVarIO emptyIdeState
77− cwd <- getCurrentDirectory
78− let fullOutputPath = cwd </> outputPath
79−
80− unlessM (doesDirectoryExist fullOutputPath) $ do
81− putStrLn ("Your output directory didn't exist. I'll create it at: " <> fullOutputPath)
82− createDirectory fullOutputPath
83− putText "This usually means you didn't compile your project yet."
84− putText "psc-ide needs you to compile your project (for example by running pulp build)"
85−
86− unless noWatch $
87− void (forkFinally (watcher ideState fullOutputPath) print)
88−
89− let conf = Configuration {confDebug = debug, confOutputPath = outputPath, confGlobs = globs}
90− env = IdeEnvironment {ideStateVar = ideState, ideConfiguration = conf}
91− startServer port env
92− where
93− parser =
94− Options
95− <$> optional (Opts.strOption (Opts.long "directory" `mappend` Opts.short 'd'))
96− <*> many (Opts.argument Opts.str (Opts.metavar "Source GLOBS..."))
97− <*> Opts.strOption (Opts.long "output-directory" `mappend` Opts.value "output/")
98− <*> (fromIntegral <$>
99− Opts.option Opts.auto (Opts.long "port" `mappend` Opts.short 'p' `mappend` Opts.value (4242 :: Integer)))
100− <*> Opts.switch (Opts.long "no-watch")
101− <*> Opts.switch (Opts.long "debug")
102− opts = Opts.info (version <*> Opts.helper <*> parser) mempty
103− version = Opts.abortOption
104− (InfoMsg (showVersion Paths.version))
105− (Opts.long "version" `mappend` Opts.help "Show the version number")
106−
107−startServer :: PortNumber -> IdeEnvironment -> IO ()
108−startServer port env = withSocketsDo $ do
109− sock <- listenOnLocalhost port
110− runLogger (runReaderT (forever (loop sock)) env)
111− where
112− runLogger = runStdoutLoggingT . filterLogger (\_ _ -> confDebug (ideConfiguration env))
113−
114− loop :: (Ide m, MonadLogger m) => Socket -> m ()
115− loop sock = do
116− accepted <- runExceptT $ acceptCommand sock
117− case accepted of
118− Left err -> $(logDebug) err
119− Right (cmd, h) -> do
120− case decodeT cmd of
121− Just cmd' -> do
122− result <- runExceptT (handleCommand cmd')
123− -- $(logDebug) ("Answer was: " <> T.pack (show result))
124− liftIO (hFlush stdout)
125− case result of
126− Right r -> liftIO $ BS8.hPutStrLn h (Aeson.encode r)
127− Left err -> liftIO $ BS8.hPutStrLn h (Aeson.encode err)
128− Nothing -> do
129− $(logDebug) ("Parsing the command failed. Command: " <> cmd)
130− liftIO $ do
131− T.hPutStrLn h (encodeT (GeneralError "Error parsing Command."))
132− hFlush stdout
133− liftIO (hClose h)
134−
135−
136−acceptCommand :: (MonadIO m, MonadLogger m, MonadError Text m)
137− => Socket -> m (Text, Handle)
138−acceptCommand sock = do
139− h <- acceptConnection
140− $(logDebug) "Accepted a connection"
141− cmd' <- liftIO (catchJust
142− -- this means that the connection was
143− -- terminated without receiving any input
144− (\e -> if isEOFError e then Just () else Nothing)
145− (Just <$> T.hGetLine h)
146− (const (pure Nothing)))
147− case cmd' of
148− Nothing -> throwError "Connection was closed before any input arrived"
149− Just cmd -> do
150− $(logDebug) cmd
151− pure (cmd, h)
152− where
153− acceptConnection = liftIO $ do
154− -- Use low level accept to prevent accidental reverse name resolution
155− (s,_) <- accept sock
156− h <- socketToHandle s ReadWriteMode
157− hSetEncoding h utf8
158− hSetBuffering h LineBuffering
159− pure h
psc-ide-server/PROTOCOL.mddeleted−568
@@ -1,568 +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−
19−```json
20−{
21− "command": "load",
22− "params": (optional) {
23− "modules": (optional)["Module.Name1", "Module.Name2"]
24− }
25−}
26−```
27−
28−**Result:**
29−
30−The Load Command returns a string with a summary about the loading process.
31−
32−### Type
33−The `type` command looks up the type for a given identifier. It also returns the
34−definition position, if it can be found in the passed source files.
35−
36−**Params:**
37− - `search :: String`: The identifier to look for. Only matches on equality.
38− - `filters :: (optional) [Filter]`: These filters will be applied before looking for the
39− identifier. These filters get combined with *AND*, so a candidate must match *ALL*
40− of them to be eligible.
41− - `currentModule :: (optional) String`: see *Complete* command
42−```json
43−{
44− "command": "type",
45− "params": {
46− "search": "filterM",
47− "filters": [{..}],
48− "currentModule": "Main"
49− }
50−}
51−```
52−
53−**Result:**
54−The possible types are returned in the same format as completions
55−
56−### Complete
57−The `complete` command looks up possible completions/corrections.
58−
59−**Params**:
60− - `filters :: [Filter]`: The same as for the `type` command. A candidate must
61− match all filters.
62− - `matcher :: (optional) Matcher`: The strategy used for matching candidates
63− after filtering. Results are scored internally and will be returned in the
64− descending order where the nth element is better then the n+1-th.
65− - `currentModule :: (optional) String`: The current modules name. If it matches
66− with the rebuild cache non-exported modules will also be completed. You can
67− fill the rebuild cache by using the "Rebuild" command.
68−
69− If no matcher is given every candidate, that passes the filters, is returned
70− in no particular order.
71−
72−```json
73−{
74− "command": "complete",
75− "params": {
76− "filters": [{..}, {..}],
77− "matcher": {..}
78− "currentModule": "Main"
79− }
80−}
81−```
82−
83−**Result:**
84−
85−The following format is returned as the Result:
86−
87−Both the `definedAt` aswell as the `documentation` field might be `null` if they
88−couldn't be extracted from a source file.
89−
90−```json
91−[
92− {
93− "module": "Data.Array",
94− "identifier": "filter",
95− "type": "forall a. (a -> Boolean) -> Array a -> Array a",
96− "expandedType": "forall a. (a -> Boolean) -> Array a -> Array a",
97− "definedAt":
98− {
99− "name": "/path/to/file",
100− "start": [1, 3],
101− "end": [3, 1]
102− },
103− "documentation": "A filtering function"
104− }
105−]
106−```
107−
108−
109−### CaseSplit
110−
111−The CaseSplit command takes a line of source code, an area in that line of code
112−and replaces it with all patterns for a given type. The parameter `annotations`
113−is used to turn type annotations on or off for the constructor fields.
114−
115−```json
116−{
117− "command": "caseSplit",
118− "params": {
119− "line": "elem a as",
120− "begin": 8,
121− "end": 10,
122− "annotations": true,
123− "type": "List"
124− }
125−}
126−```
127−
128−**Result:**
129−
130−The following format is returned as the Result:
131−
132−```json
133−[
134− "elem a Nil",
135− "elem a (Cons (_ :: a) (_ :: List a))"
136−]
137−```
138−You should then be able to replace the affected line of code in the editor with the new suggestions.
139−
140−### Add Clause
141−
142−The AddClause command takes a typedeclaration and generates a function template for the given type.
143−The `annotations` option turns type annotations on or off for the function arguments.
144−
145−```json
146−{
147− "command": "addClause",
148− "params": {
149− "line": "elem :: forall a. (Eq a) => a -> List a",
150− "annotations": true
151− }
152−}
153−```
154−
155−**Result:**
156−
157−The following format is returned as the Result:
158−
159−```json
160−[
161− "elem :: forall a. (Eq a) => a -> List a",
162− "elem ( _ :: a) = ?elem"
163−]
164−```
165−You should then be able to replace the affected line of code in the editor with the new suggestions.
166−
167−### Import
168−
169−For now all of the import related commands work with a file on the filesystem.
170−
171−You can specify it with the `file` parameter.
172−
173−If you supply the optional `outfile` parameter, the output will be written to
174−that file, and an info message will be returned from the client.
175−
176−If you don't supply `outfile`, the server responds with a list of strings which,
177−when inserted into a file linewise create the module with the applied changes.
178−
179−Arguments:
180−
181−- `file` :: String
182−- `outfile` :: Maybe String
183−- `filters` :: Maybe [Filter]
184−
185−Example:
186−
187−```json
188−{
189− "command": "import",
190− "params": {
191− "file": "/home/creek/Documents/chromacannon/src/Main.purs",
192− "outfile": "/home/creek/Documents/chromacannon/src/Main.purs",
193− "filters": [{
194− "filter": "modules",
195− "params": {
196− "modules": ["My.Module"]
197− }
198− }],
199− "importCommand": {
200− "yadda": "yadda"
201− }
202− }
203−}
204−```
205−
206−
207−#### Subcommand `addImplicitImport`
208−
209−This command just adds an unqualified import for the given modulename.
210−
211−Arguments:
212−- `moduleName :: String`
213−
214−Example:
215−```json
216−{
217− "command": "import",
218− "params": {
219− "file": "/home/creek/Documents/chromacannon/src/Main.purs",
220− "importCommand": {
221− "importCommand": "addImplicitImport",
222− "module": "Data.Array.LOL"
223− }
224− }
225−}
226−```
227−#### Subcommand `addImport`
228−
229−This command takes an identifier and searches the currently loaded modules for
230−it. If it finds no matches it responds with an Error. If it finds exactly one
231−match it adds the import and returns. If it finds more than one match it
232−responds with a list of the found matches as completions like the complete
233−command.
234−
235−You can also supply a list of filters like the ones for completion. This way you
236−can narrow down the search to a certain module and resolve the case in which
237−more then one match was found.
238−
239−Arguments:
240−- `moduleName :: String`
241−- `filters :: [Filter]`
242−
243−Example:
244−```json
245−{
246− "command": "import",
247− "params": {
248− "file": "/home/creek/Documents/chromacannon/src/Demo.purs",
249− "outfile": "/home/creek/Documents/chromacannon/src/Demo.purs",
250− "importCommand": {
251− "importCommand": "addImport",
252− "identifier": "bind"
253− }
254− }
255−}
256−```
257−
258−### Rebuild
259−
260−The `rebuild` command provides a fast rebuild for a single module. It doesn't
261−recompile the entire project though. All the modules dependencies need to be
262−loaded. A successful rebuild will be stored to allow for completions of private
263−identifiers.
264−
265−Arguments:
266− - `file :: String` the path to the module to rebuild
267−
268−```json
269−{
270− "command": "rebuild",
271− "params": {
272− "file": "/path/to/file.purs"
273− }
274−}
275−```
276−
277−**Result**
278−
279−In the Success case you get a list of warnings in the compilers json format.
280−
281−In the Error case you get the errors in the compilers json format
282−
283−### Pursuit
284−The `pursuit` command looks up the packages/completions for a given identifier from Pursuit.
285−
286−**Params:**
287− - `query :: String`: With `type: "package"` this should be a module name. With
288− `type: "completion"` this can be any string to look up.
289− - `type :: String`: Takes the following values:
290− - `package`: Looks for packages that contain the given module name.
291− - `completion` Looks for declarations for the query from Pursuit.
292−
293−```json
294−{
295− "command": "pursuit",
296− "params": {
297− "query": "Data.Array",
298− "type": "package"
299− }
300−}
301−```
302−
303−**Result:**
304−
305−`package` returns:
306−
307−```json
308−[
309− {
310− "module": "Module1.Name",
311− "package": "purescript-packagename"
312− }
313−]
314−```
315−
316−`completion` returns:
317−
318−```json
319−[
320− {
321− "module": "Data.Array",
322− "identifier": "filter",
323− "type": "forall a. (a -> Boolean) -> Array a -> Array a",
324− "package": "purescript-arrays"
325− }
326−]
327−```
328−
329−### List
330−
331−#### Loaded Modules
332−
333−`list` of type `loadedModules` lists all loaded modules (This means they can be searched for completions etc)
334−
335−```json
336−{
337− "command": "list",
338− "params": {
339− "type": "loadedModules"
340− }
341−}
342−```
343−
344−#### Response:
345−
346−The list loadedModules command returns a list of strings.
347−
348−#### Available Modules
349−
350−`list` of type `availableModules` lists all available modules. (This basically
351−means the contents of the `output/` folder.))
352−
353−```json
354−{
355− "command": "list",
356− "params": {
357− "type": "availableModules"
358− }
359−}
360−```
361−
362−#### Response:
363−
364−The list availableModules command returns a list of strings.
365−
366−#### Imports
367−
368−The list commmand can also list the imports for a given file.
369−
370−```json
371−{
372− "command": "list",
373− "params": {
374− "type": "import",
375− "file": "/home/kritzcreek/Documents/psc-ide/examples/Main.purs"
376− }
377−}
378−```
379−
380−#### Response:
381−
382−The list import command returns a list of imports where imports are of the following form:
383−
384−Implicit Import (`import Data.Array`):
385−```json
386−[
387− {
388− "module": "Data.Array",
389− "importType": "implicit"
390− }
391−]
392−```
393−
394−Implicit qualified Import (`import Data.Array as A`):
395−```json
396−[
397− {
398− "module": "Data.Array",
399− "importType": "implicit",
400− "qualifier": "A"
401− }
402−]
403−```
404−
405−Explicit Import (`import Data.Array (filter, filterM, join)`):
406−```json
407−[
408− {
409− "module": "Data.Array",
410− "importType": "explicit",
411− "identifiers": ["filter", "filterM", "join"]
412− }
413−]
414−```
415−
416−Explicit qualified Import (`import Data.Array (filter, filterM, join) as A`):
417−```json
418−[
419− {
420− "module": "Data.Array",
421− "importType": "explicit",
422− "identifiers": ["filter", "filterM", "join"],
423− "qualifier": "A"
424− }
425−]
426−```
427−
428−Hiding Import (`import Data.Array hiding (filter, filterM, join)`):
429−```json
430−[
431− {
432− "module": "Data.Array",
433− "importType": "hiding",
434− "identifiers": ["filter", "filterM", "join"]
435− }
436−]
437−```
438−
439−Qualified Hiding Import (`import Data.Array hiding (filter, filterM, join) as A`):
440−```json
441−[
442− {
443− "module": "Data.Array",
444− "importType": "hiding",
445− "identifiers": ["filter", "filterM", "join"],
446− "qualifier": "A"
447− }
448−]
449−```
450−
451−### Cwd/Quit/Reset
452−`cwd` returns the working directory of the server(should be your project root).
453−
454−`quit` quits the server.
455−
456−`reset` resets all loaded modules.
457−
458−```json
459−{
460− "command": "cwd|quit|reset"
461−}
462−```
463−
464−**Result:**
465−These commands return strings.
466−
467−## Filter:
468−
469−### Exact filter
470−The Exact filter only keeps identifiers that are equal to the search term.
471−
472−```json
473−{
474− "filter": "exact",
475− "params": {
476− "search": "filterM"
477− }
478−}
479−```
480−### Prefix filter
481−The Prefix filter keeps identifiers/modules/data declarations that
482−are prefixed by the search term.
483−
484−```json
485−{
486− "filter": "prefix",
487− "params": {
488− "search": "filt"
489− }
490−}
491−```
492−
493−### Module filter
494−The Module filter only keeps identifiers that appear in the listed modules.
495−
496−```json
497−{
498− "filter": "modules",
499− "params": {
500− "modules": ["My.Module"]
501− }
502−}
503−```
504−
505−### Dependency filter
506−The Dependency filter only keeps identifiers that appear in the listed modules
507−and in any of their dependencies/imports.
508−
509−```json
510−{
511− "filter": "dependencies",
512− "params": {
513− "modules": ["My.Module"]
514− }
515−}
516−```
517−
518−## Matcher:
519−
520−### Flex matcher
521−Matches any occurence of the search string with intersections
522−
523−The scoring measures how far the matches span the string, where
524−closer is better. The matches then get sorted with highest score first.
525−
526−Examples:
527−- flMa matches **fl**ex**Ma**tcher. Score: 14.28
528−- sons matches **so**rtCompletio**ns**. Score: 6.25
529−```json
530−
531−{
532− "matcher": "flex",
533− "params": {
534− "search": "filt"
535− }
536−}
537−```
538−
539−### Distance Matcher
540−
541−The Distance matcher is meant to provide corrections for typos. It calculates
542−the edit distance in between the search and the loaded identifiers.
543−
544−```json
545−{
546− "matcher": "distance",
547− "params": {
548− "search": "dilterM",
549− "maximumDistance": 3
550− }
551−}
552−```
553−
554−## Responses
555−
556−All Responses are wrapped in the following format:
557−
558−```json
559−{
560− "resultType": "success|error",
561− "result": Result|Error
562−}
563−```
564−
565−### Error
566−
567−Errors at this point are merely Error strings. Newlines are escaped like `\n`
568−and should be taken care of by the editor-plugin.
psc-ide-server/README.mddeleted−44
@@ -1,44 +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−
14−Start the server by running the `psc-ide-server [SOURCEGLOBS]` executable, where
15−`SOURCEGLOBS` are (optional) globs that match your PureScript sourcefiles.
16−
17−It supports the following options:
18−
19−- `-p / --port` specify a port. Defaults to 4242
20−- `-d / --directory` specify the toplevel directory of your project. Defaults to
21− the current directory
22−- `--output-directory`: Specify where to look for compiled output inside your
23− project directory. Defaults to `output/`, relative to either the current
24− directory or the directory specified by `-d`.
25−- `--debug`: Enables some logging meant for debugging
26−- `--no-watch`: Disables the filewatcher
27−- `--version`: Output psc-ide version
28−
29−## Issuing queries
30−
31−After you started the server you can start issuing requests using
32−`psc-ide-client`. Make sure you start by loading the modules before you try to
33−query them.
34−
35−`psc-ide-server` expects the build externs.purs inside the `output/` folder of
36−your project after running `pulp build` or `psc-make` respectively.
37−
38−(If you changed the port of the server you can change the port for
39−`psc-ide-client` by using the -p option accordingly)
40−
41−## Protocol
42−
43−For documentation about the protocol have a look at:
44−[PROTOCOL.md](PROTOCOL.md)
psc-publish/Main.hsdeleted−53
@@ -1,53 +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−import Data.Monoid ((<>))
8−
9−import Options.Applicative (Parser, ParseError (..))
10−import qualified Options.Applicative as Opts
11−
12−import System.IO (hSetEncoding, stderr, stdout, utf8)
13−
14−import qualified Paths_purescript as Paths
15−import Language.PureScript.Publish
16−import Language.PureScript.Publish.ErrorsWarnings
17−
18−dryRun :: Parser Bool
19−dryRun = Opts.switch $
20− Opts.long "dry-run"
21− <> Opts.help "Produce no output, and don't require a tagged version to be checked out."
22−
23−dryRunOptions :: PublishOptions
24−dryRunOptions = defaultPublishOptions
25− { publishGetVersion = return dummyVersion
26− , publishWorkingTreeDirty = warn DirtyWorkingTree_Warn
27− }
28− where dummyVersion = ("0.0.0", Version [0,0,0] [])
29−
30−main :: IO ()
31−main = do
32− hSetEncoding stdout utf8
33− hSetEncoding stderr utf8
34− Opts.execParser opts >>= publish
35− where
36− opts = Opts.info (version <*> Opts.helper <*> dryRun) infoModList
37− infoModList = Opts.fullDesc <> headerInfo <> footerInfo
38− headerInfo = Opts.header "psc-publish - Generates documentation packages for upload to http://pursuit.purescript.org"
39− footerInfo = Opts.footer $ "psc-publish " ++ showVersion Paths.version
40−
41− version :: Parser (a -> a)
42− version = Opts.abortOption (InfoMsg (showVersion Paths.version)) $
43− Opts.long "version" <> Opts.help "Show the version number" <> Opts.hidden
44−
45−publish :: Bool -> IO ()
46−publish isDryRun =
47− if isDryRun
48− then do
49− _ <- unsafePreparePackage dryRunOptions
50− putStrLn "Dry run completed, no errors."
51− else do
52− pkg <- unsafePreparePackage defaultPublishOptions
53− BL.putStrLn (A.encode pkg)
psc/Main.hsdeleted−181
@@ -1,181 +0,0 @@
1−{-# LANGUAGE DataKinds #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE RecordWildCards #-}
4−{-# LANGUAGE ScopedTypeVariables #-}
5−{-# LANGUAGE TupleSections #-}
6−
7−module Main where
8−
9−import Control.Applicative
10−import Control.Monad
11−import Control.Monad.Writer.Strict
12−
13−import qualified Data.Aeson as A
14−import Data.Bool (bool)
15−import qualified Data.ByteString.Lazy as B
16−import qualified Data.ByteString.UTF8 as BU8
17−import qualified Data.Map as M
18−import Data.Version (showVersion)
19−
20−import qualified Language.PureScript as P
21−import Language.PureScript.Errors.JSON
22−import Language.PureScript.Make
23−
24−import Options.Applicative as Opts
25−
26−import qualified Paths_purescript as Paths
27−
28−import qualified System.Console.ANSI as ANSI
29−import System.Exit (exitSuccess, exitFailure)
30−import System.FilePath.Glob (glob)
31−import System.IO (hSetEncoding, hPutStrLn, stdout, stderr, utf8)
32−import System.IO.UTF8
33−
34−data PSCMakeOptions = PSCMakeOptions
35− { pscmInput :: [FilePath]
36− , pscmOutputDir :: FilePath
37− , pscmOpts :: P.Options
38− , pscmUsePrefix :: Bool
39− , pscmJSONErrors :: Bool
40− }
41−
42−-- | Argumnets: verbose, use JSON, warnings, errors
43−printWarningsAndErrors :: Bool -> Bool -> P.MultipleErrors -> Either P.MultipleErrors a -> IO ()
44−printWarningsAndErrors verbose False warnings errors = do
45− cc <- bool Nothing (Just P.defaultCodeColor) <$> ANSI.hSupportsANSI stderr
46− let ppeOpts = P.defaultPPEOptions { P.ppeCodeColor = cc, P.ppeFull = verbose }
47− when (P.nonEmpty warnings) $
48− hPutStrLn stderr (P.prettyPrintMultipleWarnings ppeOpts warnings)
49− case errors of
50− Left errs -> do
51− hPutStrLn stderr (P.prettyPrintMultipleErrors ppeOpts errs)
52− exitFailure
53− Right _ -> return ()
54−printWarningsAndErrors verbose True warnings errors = do
55− hPutStrLn stderr . BU8.toString . B.toStrict . A.encode $
56− JSONResult (toJSONErrors verbose P.Warning warnings)
57− (either (toJSONErrors verbose P.Error) (const []) errors)
58− either (const exitFailure) (const (return ())) errors
59−
60−compile :: PSCMakeOptions -> IO ()
61−compile PSCMakeOptions{..} = do
62− input <- globWarningOnMisses (unless pscmJSONErrors . warnFileTypeNotFound) pscmInput
63− when (null input && not pscmJSONErrors) $ do
64− hPutStrLn stderr "psc: No input files."
65− exitFailure
66− moduleFiles <- readInput input
67− (makeErrors, makeWarnings) <- runMake pscmOpts $ do
68− ms <- P.parseModulesFromFiles id moduleFiles
69− let filePathMap = M.fromList $ map (\(fp, P.Module _ _ mn _ _) -> (mn, Right fp)) ms
70− foreigns <- inferForeignModules filePathMap
71− let makeActions = buildMakeActions pscmOutputDir filePathMap foreigns pscmUsePrefix
72− P.make makeActions (map snd ms)
73− printWarningsAndErrors (P.optionsVerboseErrors pscmOpts) pscmJSONErrors makeWarnings makeErrors
74− exitSuccess
75−
76−warnFileTypeNotFound :: String -> IO ()
77−warnFileTypeNotFound = hPutStrLn stderr . ("psc: No files found using pattern: " ++)
78−
79−globWarningOnMisses :: (String -> IO ()) -> [FilePath] -> IO [FilePath]
80−globWarningOnMisses warn = concatMapM globWithWarning
81− where
82− globWithWarning pattern' = do
83− paths <- glob pattern'
84− when (null paths) $ warn pattern'
85− return paths
86− concatMapM f = fmap concat . mapM f
87−
88−readInput :: [FilePath] -> IO [(FilePath, String)]
89−readInput inputFiles = forM inputFiles $ \inFile -> (inFile, ) <$> readUTF8File inFile
90−
91−inputFile :: Parser FilePath
92−inputFile = strArgument $
93− metavar "FILE"
94− <> help "The input .purs file(s)"
95−
96−outputDirectory :: Parser FilePath
97−outputDirectory = strOption $
98− short 'o'
99− <> long "output"
100− <> Opts.value "output"
101− <> showDefault
102− <> help "The output directory"
103−
104−noTco :: Parser Bool
105−noTco = switch $
106− long "no-tco"
107− <> help "Disable tail call optimizations"
108−
109−noMagicDo :: Parser Bool
110−noMagicDo = switch $
111− long "no-magic-do"
112− <> help "Disable the optimization that overloads the do keyword to generate efficient code specifically for the Eff monad"
113−
114−noOpts :: Parser Bool
115−noOpts = switch $
116− long "no-opts"
117− <> help "Skip the optimization phase"
118−
119−comments :: Parser Bool
120−comments = switch $
121− short 'c'
122− <> long "comments"
123− <> help "Include comments in the generated code"
124−
125−verboseErrors :: Parser Bool
126−verboseErrors = switch $
127− short 'v'
128− <> long "verbose-errors"
129− <> help "Display verbose error messages"
130−
131−noPrefix :: Parser Bool
132−noPrefix = switch $
133− short 'p'
134− <> long "no-prefix"
135− <> help "Do not include comment header"
136−
137−jsonErrors :: Parser Bool
138−jsonErrors = switch $
139− long "json-errors"
140− <> help "Print errors to stderr as JSON"
141−sourceMaps :: Parser Bool
142−sourceMaps = switch $
143− long "source-maps"
144− <> help "Generate source maps"
145−
146−dumpCoreFn :: Parser Bool
147−dumpCoreFn = switch $
148− long "dump-corefn"
149− <> help "Dump the (functional) core representation of the compiled code at output/*/corefn.json"
150−
151−
152−options :: Parser P.Options
153−options = P.Options <$> noTco
154− <*> noMagicDo
155− <*> pure Nothing
156− <*> noOpts
157− <*> verboseErrors
158− <*> (not <$> comments)
159− <*> sourceMaps
160− <*> dumpCoreFn
161−
162−pscMakeOptions :: Parser PSCMakeOptions
163−pscMakeOptions = PSCMakeOptions <$> many inputFile
164− <*> outputDirectory
165− <*> options
166− <*> (not <$> noPrefix)
167− <*> jsonErrors
168−
169−main :: IO ()
170−main = do
171− hSetEncoding stdout utf8
172− hSetEncoding stderr utf8
173− execParser opts >>= compile
174− where
175− opts = info (version <*> helper <*> pscMakeOptions) infoModList
176− infoModList = fullDesc <> headerInfo <> footerInfo
177− headerInfo = header "psc - Compiles PureScript to Javascript"
178− footerInfo = footer $ "psc " ++ showVersion Paths.version
179−
180− version :: Parser (a -> a)
181− version = abortOption (InfoMsg (showVersion Paths.version)) $ long "version" <> help "Show the version number" <> hidden
psci/Main.hsdeleted−364
@@ -1,364 +0,0 @@
1−{-# LANGUAGE DataKinds #-}
2−{-# LANGUAGE DoAndIfThenElse #-}
3−{-# LANGUAGE GADTs #-}
4−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE OverloadedStrings #-}
7−{-# LANGUAGE PatternGuards #-}
8−{-# LANGUAGE RecordWildCards #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE TemplateHaskell #-}
11−{-# LANGUAGE TupleSections #-}
12−
13−module Main (main) where
14−
15−import Prelude ()
16−import Prelude.Compat
17−
18−import Data.FileEmbed (embedStringFile)
19−import Data.Monoid ((<>))
20−import Data.String (IsString(..))
21−import Data.Text (Text, unpack)
22−import Data.Traversable (for)
23−import Data.Version (showVersion)
24−
25−import Control.Applicative (many, (<|>))
26−import Control.Concurrent (forkIO)
27−import Control.Concurrent.MVar (MVar, newEmptyMVar, putMVar, takeMVar,
28− tryPutMVar)
29−import Control.Concurrent.STM (TVar, atomically, newTVarIO, writeTVar,
30− readTVarIO,
31− TChan, newBroadcastTChanIO, dupTChan,
32− readTChan, writeTChan)
33−import Control.Exception (fromException)
34−import Control.Monad
35−import Control.Monad.IO.Class (liftIO)
36−import Control.Monad.Trans.Class
37−import Control.Monad.Trans.Except (ExceptT(..), runExceptT)
38−import Control.Monad.Trans.State.Strict (StateT, evalStateT)
39−import Control.Monad.Trans.Reader (ReaderT, runReaderT)
40−
41−import qualified Language.PureScript as P
42−import qualified Language.PureScript.Bundle as Bundle
43−import Language.PureScript.Interactive
44−
45−import Network.HTTP.Types.Header (hContentType, hCacheControl,
46− hPragma, hExpires)
47−import Network.HTTP.Types.Status (status200, status404, status503)
48−import qualified Network.Wai as Wai
49−import qualified Network.Wai.Handler.Warp as Warp
50−import qualified Network.Wai.Handler.WebSockets as WS
51−import qualified Network.WebSockets as WS
52−
53−import qualified Options.Applicative as Opts
54−
55−import qualified Paths_purescript as Paths
56−
57−import System.Console.Haskeline
58−import System.IO.UTF8 (readUTF8File)
59−import System.Exit
60−import System.FilePath ((</>))
61−import System.FilePath.Glob (glob)
62−import System.Process (readProcessWithExitCode)
63−
64−-- | Command line options
65−data PSCiOptions = PSCiOptions
66− { psciMultiLineMode :: Bool
67− , psciInputFile :: [FilePath]
68− , psciBackend :: Backend
69− }
70−
71−multiLineMode :: Opts.Parser Bool
72−multiLineMode = Opts.switch $
73− Opts.long "multi-line-mode"
74− <> Opts.short 'm'
75− <> Opts.help "Run in multi-line mode (use ^D to terminate commands)"
76−
77−inputFile :: Opts.Parser FilePath
78−inputFile = Opts.strArgument $
79− Opts.metavar "FILE"
80− <> Opts.help "Optional .purs files to load on start"
81−
82−nodeFlagsFlag :: Opts.Parser [String]
83−nodeFlagsFlag = Opts.option parser $
84− Opts.long "node-opts"
85− <> Opts.metavar "NODE_OPTS"
86− <> Opts.value []
87− <> Opts.help "Flags to pass to node, separated by spaces"
88− where
89− parser = words <$> Opts.str
90−
91−port :: Opts.Parser Int
92−port = Opts.option Opts.auto $
93− Opts.long "port"
94− <> Opts.short 'p'
95− <> Opts.help "The web server port"
96−
97−backend :: Opts.Parser Backend
98−backend =
99− (browserBackend <$> port)
100− <|> (nodeBackend <$> nodeFlagsFlag)
101−
102−psciOptions :: Opts.Parser PSCiOptions
103−psciOptions = PSCiOptions <$> multiLineMode
104− <*> many inputFile
105− <*> backend
106−
107−version :: Opts.Parser (a -> a)
108−version = Opts.abortOption (Opts.InfoMsg (showVersion Paths.version)) $
109− Opts.long "version" <>
110− Opts.help "Show the version number" <>
111− Opts.hidden
112−
113−getOpt :: IO PSCiOptions
114−getOpt = Opts.execParser opts
115− where
116− opts = Opts.info (version <*> Opts.helper <*> psciOptions) infoModList
117− infoModList = Opts.fullDesc <> headerInfo <> footerInfo
118− headerInfo = Opts.header "psci - Interactive mode for PureScript"
119− footerInfo = Opts.footer $ "psci " ++ showVersion Paths.version
120−
121−-- | Parses the input and returns either a command, or an error as a 'String'.
122−getCommand :: forall m. MonadException m => Bool -> InputT m (Either String (Maybe Command))
123−getCommand singleLineMode = handleInterrupt (return (Right Nothing)) $ do
124− firstLine <- withInterrupt $ getInputLine "> "
125− case firstLine of
126− Nothing -> return (Right (Just QuitPSCi)) -- Ctrl-D when input is empty
127− Just "" -> return (Right Nothing)
128− Just s | singleLineMode || head s == ':' -> return . fmap Just $ parseCommand s
129− Just s -> fmap Just . parseCommand <$> go [s]
130− where
131− go :: [String] -> InputT m String
132− go ls = maybe (return . unlines $ reverse ls) (go . (:ls)) =<< getInputLine " "
133−
134−-- | Make a JavaScript bundle for the browser.
135−bundle :: IO (Either Bundle.ErrorMessage String)
136−bundle = runExceptT $ do
137− inputFiles <- liftIO (glob (".psci_modules" </> "node_modules" </> "*" </> "*.js"))
138− input <- for inputFiles $ \filename -> do
139− js <- liftIO (readUTF8File filename)
140− mid <- Bundle.guessModuleIdentifier filename
141− length js `seq` return (mid, js)
142− Bundle.bundle input [] Nothing "PSCI"
143−
144−indexJS :: IsString string => string
145−indexJS = $(embedStringFile "psci/static/index.js")
146−
147−indexPage :: IsString string => string
148−indexPage = $(embedStringFile "psci/static/index.html")
149−
150−-- | All of the functions required to implement a PSCi backend
151−data Backend = forall state. Backend
152− { _backendSetup :: IO state
153− -- ^ Initialize, and call the continuation when the backend is ready
154− , _backendEval :: state -> String -> IO ()
155− -- ^ Evaluate JavaScript code
156− , _backendReload :: state -> IO ()
157− -- ^ Reload the compiled code
158− , _backendShutdown :: state -> IO ()
159− -- ^ Shut down the backend
160− }
161−
162−-- | Commands which can be sent to the browser
163−data BrowserCommand
164− = Eval (MVar String)
165− -- ^ Evaluate the latest JS
166− | Reload
167− -- ^ Reload the page
168−
169−-- | State for the browser backend
170−data BrowserState = BrowserState
171− { browserCommands :: TChan BrowserCommand
172− -- ^ A channel which receives data when the compiled JS has
173− -- been updated
174− , browserShutdownNotice :: MVar ()
175− -- ^ An MVar which becomes full when the server should shut down
176− , browserIndexJS :: TVar (Maybe String)
177− -- ^ A TVar holding the latest compiled JS
178− , browserBundleJS :: TVar (Maybe String)
179− -- ^ A TVar holding the latest bundled JS
180− }
181−
182−browserBackend :: Int -> Backend
183−browserBackend serverPort = Backend setup evaluate reload shutdown
184− where
185− setup :: IO BrowserState
186− setup = do
187− shutdownVar <- newEmptyMVar
188− cmdChan <- newBroadcastTChanIO
189− indexJs <- newTVarIO Nothing
190− bundleJs <- newTVarIO Nothing
191−
192− let
193− handleWebsocket :: WS.PendingConnection -> IO ()
194− handleWebsocket pending = do
195− conn <- WS.acceptRequest pending
196− -- Fork a thread to keep the connection alive
197− WS.forkPingThread conn 10
198− -- Clone the command channel
199− cmdChanCopy <- atomically $ dupTChan cmdChan
200− -- Listen for commands
201− forever $ do
202− cmd <- atomically $ readTChan cmdChanCopy
203− case cmd of
204− Eval resultVar -> void $ do
205− WS.sendTextData conn ("eval" :: Text)
206− result <- WS.receiveData conn
207− -- With many connected clients, all but one of
208− -- these attempts will fail.
209− tryPutMVar resultVar (unpack result)
210− Reload ->
211− WS.sendTextData conn ("reload" :: Text)
212−
213− shutdownHandler :: IO () -> IO ()
214− shutdownHandler stopServer = void . forkIO $ do
215− () <- takeMVar shutdownVar
216− stopServer
217−
218− onException :: Maybe Wai.Request -> SomeException -> IO ()
219− onException req ex
220− | Just (_ :: WS.ConnectionException) <- fromException ex
221− = return () -- ignore websocket disconnects
222− | otherwise = Warp.defaultOnException req ex
223−
224− staticServer :: Wai.Application
225− staticServer req respond =
226− case Wai.pathInfo req of
227− [] ->
228− respond $ Wai.responseLBS status200
229− [(hContentType, "text/html")]
230− indexPage
231− ["js", "index.js"] ->
232− respond $ Wai.responseLBS status200
233− [(hContentType, "application/javascript")]
234− indexJS
235− ["js", "latest.js"] -> do
236− may <- readTVarIO indexJs
237− case may of
238− Nothing ->
239− respond $ Wai.responseLBS status503 [] "Service not available"
240− Just js ->
241− respond $ Wai.responseLBS status200
242− [ (hContentType, "application/javascript")
243− , (hCacheControl, "no-cache, no-store, must-revalidate")
244− , (hPragma, "no-cache")
245− , (hExpires, "0")
246− ]
247− (fromString js)
248− ["js", "bundle.js"] -> do
249− may <- readTVarIO bundleJs
250− case may of
251− Nothing ->
252− respond $ Wai.responseLBS status503 [] "Service not available"
253− Just js ->
254− respond $ Wai.responseLBS status200
255− [ (hContentType, "application/javascript")]
256− (fromString js)
257− _ -> respond $ Wai.responseLBS status404 [] "Not found"
258−
259− let browserState = BrowserState cmdChan shutdownVar indexJs bundleJs
260− createBundle browserState
261−
262− putStrLn $ "Serving http://localhost:" <> show serverPort <> "/. Waiting for connections..."
263− _ <- forkIO $ Warp.runSettings ( Warp.setInstallShutdownHandler shutdownHandler
264− . Warp.setPort serverPort
265− . Warp.setOnException onException
266− $ Warp.defaultSettings
267− ) $
268− WS.websocketsOr WS.defaultConnectionOptions
269− handleWebsocket
270− staticServer
271− return browserState
272−
273− createBundle :: BrowserState -> IO ()
274− createBundle state = do
275− putStrLn "Bundling Javascript..."
276− ejs <- bundle
277− case ejs of
278− Left err -> do
279− putStrLn (unlines (Bundle.printErrorMessage err))
280− exitFailure
281− Right js ->
282− atomically $ writeTVar (browserBundleJS state) (Just js)
283−
284− reload :: BrowserState -> IO ()
285− reload state = do
286− createBundle state
287− atomically $ writeTChan (browserCommands state) Reload
288−
289− shutdown :: BrowserState -> IO ()
290− shutdown state = putMVar (browserShutdownNotice state) ()
291−
292− evaluate :: BrowserState -> String -> IO ()
293− evaluate state js = liftIO $ do
294− resultVar <- newEmptyMVar
295− atomically $ do
296− writeTVar (browserIndexJS state) (Just js)
297− writeTChan (browserCommands state) (Eval resultVar)
298− result <- takeMVar resultVar
299− putStrLn result
300−
301−nodeBackend :: [String] -> Backend
302−nodeBackend nodeArgs = Backend setup eval reload shutdown
303− where
304− setup :: IO ()
305− setup = return ()
306−
307− eval :: () -> String -> IO ()
308− eval _ _ = do
309− writeFile indexFile "require('$PSCI')['$main']();"
310− process <- findNodeProcess
311− result <- traverse (\node -> readProcessWithExitCode node (nodeArgs ++ [indexFile]) "") process
312− case result of
313− Just (ExitSuccess, out, _) -> putStrLn out
314− Just (ExitFailure _, _, err) -> putStrLn err
315− Nothing -> putStrLn "Couldn't find node.js"
316−
317− reload :: () -> IO ()
318− reload _ = return ()
319−
320− shutdown :: () -> IO ()
321− shutdown _ = return ()
322−
323−-- | Get command line options and drop into the REPL
324−main :: IO ()
325−main = getOpt >>= loop
326− where
327− loop :: PSCiOptions -> IO ()
328− loop PSCiOptions{..} = do
329− inputFiles <- concat <$> traverse glob psciInputFile
330− e <- runExceptT $ do
331− modules <- ExceptT (loadAllModules inputFiles)
332− unless (supportModuleIsDefined (map snd modules)) . liftIO $ do
333− putStrLn supportModuleMessage
334− exitFailure
335− (externs, env) <- ExceptT . runMake . make $ modules
336− return (modules, externs, env)
337− case psciBackend of
338− Backend setup eval reload (shutdown :: state -> IO ()) ->
339− case e of
340− Left errs -> putStrLn (P.prettyPrintMultipleErrors P.defaultPPEOptions errs) >> exitFailure
341− Right (modules, externs, env) -> do
342− historyFilename <- getHistoryFilename
343− let settings = defaultSettings { historyFile = Just historyFilename }
344− initialState = PSCiState [] [] (zip (map snd modules) externs)
345− config = PSCiConfig inputFiles env
346− runner = flip runReaderT config
347− . flip evalStateT initialState
348− . runInputT (setComplete completion settings)
349−
350− go :: state -> InputT (StateT PSCiState (ReaderT PSCiConfig IO)) ()
351− go state = do
352− c <- getCommand (not psciMultiLineMode)
353− case c of
354− Left err -> outputStrLn err >> go state
355− Right Nothing -> go state
356− Right (Just QuitPSCi) -> do
357− outputStrLn quitMessage
358− liftIO $ shutdown state
359− Right (Just c') -> do
360− handleInterrupt (outputStrLn "Interrupted.")
361− (withInterrupt (lift (handleCommand (liftIO . eval state) (liftIO (reload state)) c')))
362− go state
363− putStrLn prologueMessage
364− setup >>= runner . go
psci/static/index.htmldeleted−10
@@ -1,10 +0,0 @@
1−<!DOCTYPE html>
2−<html>
3−<head>
4− <title>PureScript Interactive</title>
5− <script src='js/bundle.js'></script>
6− <script src='js/index.js'></script>
7−</head>
8−<body>
9−</body>
10−</html>
psci/static/index.jsdeleted−63
@@ -1,63 +0,0 @@
1−var get = function get(uri, callback, onError) {
2− var request = new XMLHttpRequest();
3− request.addEventListener('load', function() {
4− callback(request.responseText);
5− });
6− request.addEventListener('error', onError);
7− request.open('GET', uri);
8− request.send();
9−};
10−var evaluate = function evaluate(js) {
11− var buffer = [];
12− // Save the old console.log function
13− var oldLog = console.log;
14− console.log = function(s) {
15− // Push log output into a temporary buffer
16− // which will be returned to PSCi.
17− buffer.push(s);
18− };
19− // Replace any require(...) statements with lookups on the PSCI object.
20− var replaced = js.replace(/require\("[^"]*"\)/g, function(s) {
21− return "PSCI['" + s.substring(12, s.length - 2) + "']";
22− });
23− // Wrap the module and evaluate it.
24− var wrapped =
25− [ 'var module = {};'
26− , '(function(module) {'
27− , replaced
28− , '})(module);'
29− , 'return module.exports["$main"] && module.exports["$main"]();'
30− ].join('\n');
31− new Function(wrapped)();
32− // Restore console.log
33− console.log = oldLog;
34− return buffer.join('\n');
35−};
36−window.onload = function() {
37− var socket = new WebSocket('ws://0.0.0.0:' + location.port);
38− var evalNext = function reload() {
39− get('js/latest.js', function(response) {
40− try {
41− var result = evaluate(response);
42− socket.send(result);
43− } catch (ex) {
44− socket.send(ex.stack);
45− }
46− }, function(err) {
47− socket.send('Error sending JavaScript');
48− });
49− };
50− socket.onopen = function() {
51− console.log('Connected');
52− socket.onmessage = function(event) {
53− switch (event.data) {
54− case 'eval':
55− evalNext();
56− break;
57− case 'reload':
58− location.reload();
59− break;
60− }
61− };
62− };
63−};
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−530
@@ -1,530 +0,0 @@
1−name: purescript
2−version: 0.10.1
3−cabal-version: >=1.8
4−build-type: Simple
5−license: BSD3
6−license-file: LICENSE
7−copyright: (c) 2013-16 Phil Freeman, (c) 2014-16 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/passing/*.js
24− , examples/passing/2018/*.purs
25− , examples/passing/2138/*.purs
26− , examples/passing/ClassRefSyntax/*.purs
27− , examples/passing/DctorOperatorAlias/*.purs
28− , examples/passing/ExplicitImportReExport/*.purs
29− , examples/passing/ExportExplicit/*.purs
30− , examples/passing/ExportExplicit2/*.purs
31− , examples/passing/Import/*.purs
32− , examples/passing/ImportExplicit/*.purs
33− , examples/passing/ImportQualified/*.purs
34− , examples/passing/Module/*.purs
35− , examples/passing/ModuleDeps/*.purs
36− , examples/passing/ModuleExport/*.purs
37− , examples/passing/ModuleExportDupes/*.purs
38− , examples/passing/ModuleExportExcluded/*.purs
39− , examples/passing/ModuleExportQualified/*.purs
40− , examples/passing/ModuleExportSelf/*.purs
41− , examples/passing/NonConflictingExports/*.purs
42− , examples/passing/OperatorAliasElsewhere/*.purs
43− , examples/passing/Operators/*.purs
44− , examples/passing/PendingConflictingImports/*.purs
45− , examples/passing/PendingConflictingImports2/*.purs
46− , examples/passing/QualifiedNames/*.purs
47− , examples/passing/RedefinedFixity/*.purs
48− , examples/passing/ReExportQualified/*.purs
49− , examples/passing/ResolvableScopeConflict/*.purs
50− , examples/passing/ResolvableScopeConflict2/*.purs
51− , examples/passing/ResolvableScopeConflict3/*.purs
52− , examples/passing/ShadowedModuleName/*.purs
53− , examples/passing/TransitiveImport/*.purs
54− , examples/passing/TypeOperators/*.purs
55− , examples/passing/TypeWithoutParens/*.purs
56− , examples/failing/*.purs
57− , examples/failing/1733/*.purs
58− , examples/failing/ConflictingExports/*.purs
59− , examples/failing/ConflictingImports/*.purs
60− , examples/failing/ConflictingImports2/*.purs
61− , examples/failing/ConflictingQualifiedImports/*.purs
62− , examples/failing/ConflictingQualifiedImports2/*.purs
63− , examples/failing/DuplicateModule/*.purs
64− , examples/failing/ExportConflictClass/*.purs
65− , examples/failing/ExportConflictCtor/*.purs
66− , examples/failing/ExportConflictType/*.purs
67− , examples/failing/ExportConflictTypeOp/*.purs
68− , examples/failing/ExportConflictValue/*.purs
69− , examples/failing/ExportConflictValueOp/*.purs
70− , examples/failing/ExportExplicit1/*.purs
71− , examples/failing/ExportExplicit3/*.purs
72− , examples/failing/ImportExplicit/*.purs
73− , examples/failing/ImportExplicit2/*.purs
74− , examples/failing/ImportHidingModule/*.purs
75− , examples/failing/ImportModule/*.purs
76− , examples/failing/InstanceExport/*.purs
77− , examples/failing/OrphanInstance/*.purs
78− , examples/warning/*.purs
79− , examples/warning/*.js
80− , examples/warning/UnusedExplicitImportTypeOp/*.purs
81− , examples/docs/bower_components/purescript-prelude/src/*.purs
82− , examples/docs/bower.json
83− , examples/docs/src/*.purs
84− , psci/static/index.html
85− , psci/static/index.js
86− , tests/support/package.json
87− , tests/support/bower.json
88− , tests/support/setup-win.cmd
89− , tests/support/psci/*.purs
90− , tests/support/pscide/src/*.purs
91− , tests/support/pscide/src/*.js
92− , tests/support/pscide/src/*.fail
93− , stack.yaml
94− , README.md
95− , INSTALL.md
96− , CONTRIBUTORS.md
97− , CONTRIBUTING.md
98−
99−source-repository head
100− type: git
101− location: https://github.com/purescript/purescript.git
102−
103−library
104− build-depends: base >=4.8 && <5,
105− aeson >= 0.8 && < 1.0,
106− aeson-better-errors >= 0.8,
107− ansi-terminal >= 0.6.2 && < 0.7,
108− base-compat >=0.6.0,
109− bower-json >= 0.8,
110− boxes >= 0.1.4 && < 0.2.0,
111− bytestring -any,
112− containers -any,
113− clock -any,
114− data-ordlist >= 0.4.7.0,
115− directory >= 1.2,
116− dlist -any,
117− edit-distance -any,
118− filepath -any,
119− fsnotify >= 0.2.1,
120− Glob >= 0.7 && < 0.8,
121− haskeline >= 0.7.0.0,
122− http-client >= 0.4.30 && <0.5,
123− http-types -any,
124− language-javascript == 0.6.*,
125− lens == 4.*,
126− lifted-base >= 0.2.3 && < 0.2.4,
127− monad-control >= 1.0.0.0 && < 1.1,
128− monad-logger >= 0.3 && < 0.4,
129− mtl >= 2.1.0 && < 2.3.0,
130− parallel >= 3.2 && < 3.3,
131− parsec >=3.1.10,
132− pattern-arrows >= 0.0.2 && < 0.1,
133− pipes >= 4.0.0 && < 4.3.0,
134− pipes-http -any,
135− process >= 1.2.0 && < 1.5,
136− protolude >= 0.1.6,
137− regex-tdfa -any,
138− safe >= 0.3.9 && < 0.4,
139− semigroups >= 0.16.2 && < 0.19,
140− sourcemap >= 0.1.6,
141− spdx == 0.2.*,
142− split -any,
143− stm >= 0.2.4.0,
144− syb -any,
145− text -any,
146− time -any,
147− transformers >= 0.3.0 && < 0.6,
148− transformers-base >= 0.4.0 && < 0.5,
149− transformers-compat >= 0.3.0,
150− unordered-containers -any,
151− utf8-string >= 1 && < 2,
152− vector -any
153−
154− exposed-modules: Language.PureScript
155− Language.PureScript.AST
156− Language.PureScript.AST.Binders
157− Language.PureScript.AST.Declarations
158− Language.PureScript.AST.Operators
159− Language.PureScript.AST.Literals
160− Language.PureScript.AST.SourcePos
161− Language.PureScript.AST.Traversals
162− Language.PureScript.AST.Exported
163− Language.PureScript.Bundle
164− Language.PureScript.Crash
165− Language.PureScript.Externs
166− Language.PureScript.CodeGen
167− Language.PureScript.CodeGen.JS
168− Language.PureScript.CodeGen.JS.AST
169− Language.PureScript.CodeGen.JS.Common
170− Language.PureScript.CodeGen.JS.Optimizer
171− Language.PureScript.CodeGen.JS.Optimizer.Blocks
172− Language.PureScript.CodeGen.JS.Optimizer.Common
173− Language.PureScript.CodeGen.JS.Optimizer.Inliner
174− Language.PureScript.CodeGen.JS.Optimizer.MagicDo
175− Language.PureScript.CodeGen.JS.Optimizer.TCO
176− Language.PureScript.CodeGen.JS.Optimizer.Unused
177− Language.PureScript.Constants
178− Language.PureScript.CoreFn
179− Language.PureScript.CoreFn.Ann
180− Language.PureScript.CoreFn.Binders
181− Language.PureScript.CoreFn.Desugar
182− Language.PureScript.CoreFn.Expr
183− Language.PureScript.CoreFn.Meta
184− Language.PureScript.CoreFn.Module
185− Language.PureScript.CoreFn.Traversals
186− Language.PureScript.CoreFn.ToJSON
187− Language.PureScript.Comments
188− Language.PureScript.Environment
189− Language.PureScript.Errors
190− Language.PureScript.Errors.JSON
191− Language.PureScript.Kinds
192− Language.PureScript.Linter
193− Language.PureScript.Linter.Exhaustive
194− Language.PureScript.Linter.Imports
195− Language.PureScript.Make
196− Language.PureScript.ModuleDependencies
197− Language.PureScript.Names
198− Language.PureScript.Options
199− Language.PureScript.Parser
200− Language.PureScript.Parser.Lexer
201− Language.PureScript.Parser.Common
202− Language.PureScript.Parser.Declarations
203− Language.PureScript.Parser.Kinds
204− Language.PureScript.Parser.State
205− Language.PureScript.Parser.Types
206− Language.PureScript.Pretty
207− Language.PureScript.Pretty.Common
208− Language.PureScript.Pretty.JS
209− Language.PureScript.Pretty.Kinds
210− Language.PureScript.Pretty.Types
211− Language.PureScript.Pretty.Values
212− Language.PureScript.Renamer
213− Language.PureScript.Sugar
214− Language.PureScript.Sugar.BindingGroups
215− Language.PureScript.Sugar.CaseDeclarations
216− Language.PureScript.Sugar.DoNotation
217− Language.PureScript.Sugar.Names
218− Language.PureScript.Sugar.Names.Common
219− Language.PureScript.Sugar.Names.Env
220− Language.PureScript.Sugar.Names.Exports
221− Language.PureScript.Sugar.Names.Imports
222− Language.PureScript.Sugar.ObjectWildcards
223− Language.PureScript.Sugar.Operators
224− Language.PureScript.Sugar.Operators.Common
225− Language.PureScript.Sugar.Operators.Expr
226− Language.PureScript.Sugar.Operators.Binders
227− Language.PureScript.Sugar.Operators.Types
228− Language.PureScript.Sugar.TypeClasses
229− Language.PureScript.Sugar.TypeClasses.Deriving
230− Language.PureScript.Sugar.TypeDeclarations
231− Language.PureScript.Traversals
232− Language.PureScript.TypeChecker
233− Language.PureScript.TypeChecker.Entailment
234− Language.PureScript.TypeChecker.Kinds
235− Language.PureScript.TypeChecker.Monad
236− Language.PureScript.TypeChecker.Rows
237− Language.PureScript.TypeChecker.Skolems
238− Language.PureScript.TypeChecker.Subsumption
239− Language.PureScript.TypeChecker.Synonyms
240− Language.PureScript.TypeChecker.Types
241− Language.PureScript.TypeChecker.Unify
242− Language.PureScript.TypeClassDictionaries
243− Language.PureScript.Types
244−
245− Language.PureScript.Docs
246− Language.PureScript.Docs.Convert
247− Language.PureScript.Docs.Convert.Single
248− Language.PureScript.Docs.Convert.ReExports
249− Language.PureScript.Docs.Render
250− Language.PureScript.Docs.Types
251− Language.PureScript.Docs.RenderedCode
252− Language.PureScript.Docs.RenderedCode.Types
253− Language.PureScript.Docs.RenderedCode.Render
254− Language.PureScript.Docs.AsMarkdown
255− Language.PureScript.Docs.ParseAndBookmark
256− Language.PureScript.Docs.Utils.MonoidExtras
257−
258− Language.PureScript.Publish
259− Language.PureScript.Publish.Utils
260− Language.PureScript.Publish.ErrorsWarnings
261− Language.PureScript.Publish.BoxesHelpers
262−
263− Language.PureScript.Ide
264− Language.PureScript.Ide.CaseSplit
265− Language.PureScript.Ide.Command
266− Language.PureScript.Ide.Completion
267− Language.PureScript.Ide.Conversions
268− Language.PureScript.Ide.Externs
269− Language.PureScript.Ide.Error
270− Language.PureScript.Ide.Imports
271− Language.PureScript.Ide.Filter
272− Language.PureScript.Ide.Matcher
273− Language.PureScript.Ide.Pursuit
274− Language.PureScript.Ide.Rebuild
275− Language.PureScript.Ide.Reexports
276− Language.PureScript.Ide.SourceFile
277− Language.PureScript.Ide.State
278− Language.PureScript.Ide.Types
279− Language.PureScript.Ide.Util
280− Language.PureScript.Ide.Watcher
281−
282− Language.PureScript.Interactive
283− Language.PureScript.Interactive.Types
284− Language.PureScript.Interactive.Parser
285− Language.PureScript.Interactive.Directive
286− Language.PureScript.Interactive.Completion
287− Language.PureScript.Interactive.IO
288− Language.PureScript.Interactive.Message
289− Language.PureScript.Interactive.Module
290− Language.PureScript.Interactive.Printer
291−
292− Control.Monad.Logger
293− Control.Monad.Supply
294− Control.Monad.Supply.Class
295−
296− System.IO.UTF8
297−
298− extensions: ConstraintKinds
299− DataKinds
300− DeriveFunctor
301− EmptyDataDecls
302− FlexibleContexts
303− KindSignatures
304− LambdaCase
305− MultiParamTypeClasses
306− NoImplicitPrelude
307− PatternGuards
308− PatternSynonyms
309− RankNTypes
310− RecordWildCards
311− ScopedTypeVariables
312− TupleSections
313− ViewPatterns
314− exposed: True
315− buildable: True
316− hs-source-dirs: src
317− other-modules: Paths_purescript
318− ghc-options: -Wall -O2
319−
320−executable psc
321− build-depends: base >=4 && <5,
322− purescript -any,
323− aeson >= 0.8 && < 1.0,
324− ansi-terminal >= 0.6.2 && < 0.7,
325− base-compat >=0.6.0,
326− bytestring -any,
327− containers -any,
328− directory -any,
329− filepath -any,
330− Glob >= 0.7 && < 0.8,
331− mtl -any,
332− optparse-applicative >= 0.12.1,
333− parsec -any,
334− time -any,
335− transformers -any,
336− transformers-compat -any,
337− utf8-string >= 1 && < 2
338− main-is: Main.hs
339− buildable: True
340− hs-source-dirs: psc
341− other-modules: Paths_purescript
342− ghc-options: -Wall -O2 -fno-warn-unused-do-bind -threaded -rtsopts "-with-rtsopts=-N"
343−
344−executable psci
345− build-depends: base >=4 && <5,
346− purescript -any,
347− base-compat >=0.6.0,
348− boxes >= 0.1.4 && < 0.2.0,
349− bytestring -any,
350− containers -any,
351− directory -any,
352− filepath -any,
353− file-embed -any,
354− Glob -any,
355− haskeline >= 0.7.0.0,
356− http-types == 0.9.*,
357− mtl -any,
358− optparse-applicative >= 0.12.1,
359− parsec -any,
360− process -any,
361− stm >= 0.2.4.0,
362− text -any,
363− time -any,
364− transformers -any,
365− transformers-compat -any,
366− wai == 3.*,
367− wai-websockets == 3.*,
368− warp == 3.*,
369− websockets >= 0.9 && <0.10
370− main-is: Main.hs
371− buildable: True
372− hs-source-dirs: psci
373− other-modules: Paths_purescript
374− ghc-options: -Wall -O2
375−
376−executable psc-docs
377− build-depends: base >=4 && <5,
378− purescript -any,
379− ansi-wl-pprint -any,
380− directory -any,
381− filepath -any,
382− Glob -any,
383− mtl -any,
384− optparse-applicative >= 0.12.1,
385− process -any,
386− split -any,
387− transformers -any,
388− transformers-compat -any
389− main-is: Main.hs
390− other-modules: Paths_purescript
391− buildable: True
392− hs-source-dirs: psc-docs
393− other-modules: Ctags
394− Etags
395− Tags
396− ghc-options: -Wall -O2
397−
398−executable psc-publish
399− build-depends: base >=4 && <5,
400− purescript -any,
401− aeson >= 0.8 && < 1.0,
402− bytestring -any,
403− optparse-applicative -any
404− main-is: Main.hs
405− other-modules: Paths_purescript
406− buildable: True
407− hs-source-dirs: psc-publish
408− ghc-options: -Wall -O2
409−
410−executable psc-hierarchy
411− build-depends: base >=4 && <5,
412− purescript -any,
413− directory -any,
414− filepath -any,
415− Glob -any,
416− mtl -any,
417− optparse-applicative >= 0.12.1,
418− parsec -any,
419− process -any
420− main-is: Main.hs
421− other-modules: Paths_purescript
422− buildable: True
423− hs-source-dirs: hierarchy
424− other-modules:
425− ghc-options: -Wall -O2
426−
427−executable psc-bundle
428− main-is: Main.hs
429− other-modules: Paths_purescript
430− other-extensions:
431− build-depends: base >=4 && <5,
432− purescript -any,
433− directory -any,
434− filepath -any,
435− Glob -any,
436− mtl -any,
437− optparse-applicative >= 0.12.1,
438− transformers -any,
439− transformers-compat -any
440− ghc-options: -Wall -O2
441− hs-source-dirs: psc-bundle
442−
443−executable psc-ide-server
444− main-is: Main.hs
445− other-modules: Paths_purescript
446− other-extensions:
447− build-depends: base >=4 && <5,
448− aeson >= 0.8 && < 1.0,
449− bytestring -any,
450− purescript -any,
451− base-compat >=0.6.0,
452− directory -any,
453− filepath -any,
454− monad-logger -any,
455− mtl -any,
456− network -any,
457− optparse-applicative >= 0.12.1,
458− protolude >= 0.1.6,
459− stm -any,
460− text -any,
461− transformers -any,
462− transformers-compat -any
463− ghc-options: -Wall -O2 -threaded
464− hs-source-dirs: psc-ide-server
465−
466−executable psc-ide-client
467− main-is: Main.hs
468− other-modules: Paths_purescript
469− other-extensions:
470− build-depends: base >=4 && <5,
471− base-compat >=0.6.0,
472− bytestring -any,
473− mtl -any,
474− network -any,
475− optparse-applicative >= 0.12.1,
476− text -any
477− ghc-options: -Wall -O2
478− hs-source-dirs: psc-ide-client
479−
480−test-suite tests
481− build-depends: base >=4 && <5,
482− purescript -any,
483− aeson -any,
484− aeson-better-errors -any,
485− base-compat -any,
486− boxes -any,
487− bytestring -any,
488− containers -any,
489− directory -any,
490− filepath -any,
491− Glob -any,
492− haskeline >= 0.7.0.0,
493− hspec -any,
494− hspec-discover -any,
495− HUnit -any,
496− mtl -any,
497− optparse-applicative -any,
498− parsec -any,
499− process -any,
500− protolude >= 0.1.6,
501− silently -any,
502− stm -any,
503− text -any,
504− time -any,
505− transformers -any,
506− transformers-compat -any,
507− utf8-string -any,
508− vector -any
509− ghc-options: -Wall
510− type: exitcode-stdio-1.0
511− main-is: Main.hs
512− other-modules: TestUtils
513− TestCompiler
514− TestDocs
515− TestPscPublish
516− TestPsci
517− TestPscIde
518− PscIdeSpec
519− Language.PureScript.Ide.FilterSpec
520− Language.PureScript.Ide.ImportsSpec
521− Language.PureScript.Ide.Imports.IntegrationSpec
522− Language.PureScript.Ide.Integration
523− Language.PureScript.Ide.MatcherSpec
524− Language.PureScript.Ide.RebuildSpec
525− Language.PureScript.Ide.ReexportsSpec
526− Language.PureScript.Ide.SourceFile.IntegrationSpec
527− Language.PureScript.Ide.SourceFileSpec
528− Language.PureScript.Ide.StateSpec
529− buildable: True
530− hs-source-dirs: tests
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−59
@@ -1,59 +0,0 @@
1−{-# LANGUAGE FlexibleInstances #-}
2−{-# LANGUAGE TypeFamilies #-}
3−
4−-- |
5−-- A replacement for WriterT IO which uses mutable references.
6−--
7−module Control.Monad.Logger where
8−
9−import Prelude.Compat
10−
11−import Control.Monad (ap)
12−import Control.Monad.Base (MonadBase(..))
13−import Control.Monad.IO.Class
14−import Control.Monad.Trans.Control (MonadBaseControl(..))
15−import Control.Monad.Writer.Class
16−
17−import Data.IORef
18−
19−-- | A replacement for WriterT IO which uses mutable references.
20−newtype Logger w a = Logger { runLogger :: IORef w -> IO a }
21−
22−-- | Run a Logger computation, starting with an empty log.
23−runLogger' :: (Monoid w) => Logger w a -> IO (a, w)
24−runLogger' l = do
25− r <- newIORef mempty
26− a <- runLogger l r
27− w <- readIORef r
28− return (a, w)
29−
30−instance Functor (Logger w) where
31− fmap f (Logger l) = Logger $ \r -> fmap f (l r)
32−
33−instance (Monoid w) => Applicative (Logger w) where
34− pure = Logger . const . pure
35− (<*>) = ap
36−
37−instance (Monoid w) => Monad (Logger w) where
38− return = pure
39− Logger l >>= f = Logger $ \r -> l r >>= \a -> runLogger (f a) r
40−
41−instance (Monoid w) => MonadIO (Logger w) where
42− liftIO = Logger . const
43−
44−instance (Monoid w) => MonadWriter w (Logger w) where
45− tell w = Logger $ \r -> atomicModifyIORef' r $ \w' -> (mappend w' w, ())
46− listen l = Logger $ \r -> do
47− (a, w) <- liftIO (runLogger' l)
48− atomicModifyIORef' r $ \w' -> (mappend w' w, (a, w))
49− pass l = Logger $ \r -> do
50− ((a, f), w) <- liftIO (runLogger' l)
51− atomicModifyIORef' r $ \w' -> (mappend w' (f w), a)
52−
53−instance (Monoid w) => MonadBase IO (Logger w) where
54− liftBase = liftIO
55−
56−instance (Monoid w) => MonadBaseControl IO (Logger w) where
57− type StM (Logger w) a = a
58− liftBaseWith f = Logger $ \r -> liftBaseWith $ \q -> f (q . flip runLogger r)
59− restoreM = return
src/Control/Monad/Supply.hsdeleted−32
@@ -1,32 +0,0 @@
1−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
2−
3−-- |
4−-- Fresh variable supply
5−--
6−module Control.Monad.Supply where
7−
8−import Prelude.Compat
9−
10−import Control.Monad.Error.Class (MonadError(..))
11−import Control.Monad.Reader
12−import Control.Monad.State
13−import Control.Monad.Writer
14−
15−import Data.Functor.Identity
16−
17−newtype SupplyT m a = SupplyT { unSupplyT :: StateT Integer m a }
18− deriving (Functor, Applicative, Monad, MonadTrans, MonadError e, MonadWriter w, MonadReader r)
19−
20−runSupplyT :: Integer -> SupplyT m a -> m (a, Integer)
21−runSupplyT n = flip runStateT n . unSupplyT
22−
23−evalSupplyT :: (Functor m) => Integer -> SupplyT m a -> m a
24−evalSupplyT n = fmap fst . runSupplyT n
25−
26−type Supply = SupplyT Identity
27−
28−runSupply :: Integer -> Supply a -> (a, Integer)
29−runSupply n = runIdentity . runSupplyT n
30−
31−evalSupply :: Integer -> Supply a -> a
32−evalSupply n = runIdentity . evalSupplyT n
src/Control/Monad/Supply/Class.hsdeleted−28
@@ -1,28 +0,0 @@
1−-- |
2−-- A class for monads supporting a supply of fresh names
3−--
4−module Control.Monad.Supply.Class where
5−
6−import Prelude.Compat
7−
8−import Control.Monad.Supply
9−import Control.Monad.State
10−import Control.Monad.Writer
11−
12−class Monad m => MonadSupply m where
13− fresh :: m Integer
14−
15−instance Monad m => MonadSupply (SupplyT m) where
16− fresh = SupplyT $ do
17− n <- get
18− put (n + 1)
19− return n
20−
21−instance MonadSupply m => MonadSupply (StateT s m) where
22− fresh = lift fresh
23−
24−instance (Monoid w, MonadSupply m) => MonadSupply (WriterT w m) where
25− fresh = lift fresh
26−
27−freshName :: MonadSupply m => m String
28−freshName = fmap (('$' :) . show) fresh
src/Language/PureScript.hsdeleted−36
@@ -1,36 +0,0 @@
1−-- |
2−-- The main compiler module
3−--
4−module Language.PureScript
5− ( module P
6− , version
7− ) where
8−
9−
10−import Control.Monad.Supply as P
11−
12−import Data.Version (Version)
13−
14−import Language.PureScript.AST as P
15−import Language.PureScript.Comments as P
16−import Language.PureScript.Crash as P
17−import Language.PureScript.Environment as P
18−import Language.PureScript.Errors as P hiding (indent)
19−import Language.PureScript.Externs as P
20−import Language.PureScript.Kinds as P
21−import Language.PureScript.Linter as P
22−import Language.PureScript.Make as P
23−import Language.PureScript.ModuleDependencies as P
24−import Language.PureScript.Names as P
25−import Language.PureScript.Options as P
26−import Language.PureScript.Parser as P
27−import Language.PureScript.Pretty as P
28−import Language.PureScript.Renamer as P
29−import Language.PureScript.Sugar as P
30−import Language.PureScript.TypeChecker as P
31−import Language.PureScript.Types as P
32−
33−import qualified Paths_purescript as Paths
34−
35−version :: Version
36−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−83
@@ -1,83 +0,0 @@
1−-- |
2−-- Case binders
3−--
4−module Language.PureScript.AST.Binders where
5−
6−import Prelude.Compat
7−
8−import Language.PureScript.AST.SourcePos
9−import Language.PureScript.AST.Literals
10−import Language.PureScript.Names
11−import Language.PureScript.Comments
12−import Language.PureScript.Types
13−
14−-- |
15−-- Data type for binders
16−--
17−data Binder
18− -- |
19− -- Wildcard binder
20− --
21− = NullBinder
22− -- |
23− -- A binder which matches a literal
24− --
25− | LiteralBinder (Literal Binder)
26− -- |
27− -- A binder which binds an identifier
28− --
29− | VarBinder Ident
30− -- |
31− -- A binder which matches a data constructor
32− --
33− | ConstructorBinder (Qualified (ProperName 'ConstructorName)) [Binder]
34− -- |
35− -- A operator alias binder. During the rebracketing phase of desugaring,
36− -- this data constructor will be removed.
37− --
38− | OpBinder (Qualified (OpName 'ValueOpName))
39− -- |
40− -- Binary operator application. During the rebracketing phase of desugaring,
41− -- this data constructor will be removed.
42− --
43− | BinaryNoParensBinder Binder Binder Binder
44− -- |
45− -- Explicit parentheses. During the rebracketing phase of desugaring, this
46− -- data constructor will be removed.
47− --
48− -- Note: although it seems this constructor is not used, it _is_ useful,
49− -- since it prevents certain traversals from matching.
50− --
51− | ParensInBinder Binder
52− -- |
53− -- A binder which binds its input to an identifier
54− --
55− | NamedBinder Ident Binder
56− -- |
57− -- A binder with source position information
58− --
59− | PositionedBinder SourceSpan [Comment] Binder
60− -- |
61− -- A binder with a type annotation
62− --
63− | TypedBinder Type Binder
64− deriving (Show, Eq)
65−
66−-- |
67−-- Collect all names introduced in binders in an expression
68−--
69−binderNames :: Binder -> [Ident]
70−binderNames = go []
71− where
72− go ns (LiteralBinder b) = lit ns b
73− go ns (VarBinder name) = name : ns
74− go ns (ConstructorBinder _ bs) = foldl go ns bs
75− go ns (BinaryNoParensBinder b1 b2 b3) = foldl go ns [b1, b2, b3]
76− go ns (ParensInBinder b) = go ns b
77− go ns (NamedBinder name b) = go (name : ns) b
78− go ns (PositionedBinder _ _ b) = go ns b
79− go ns (TypedBinder _ b) = go ns b
80− go ns _ = ns
81− lit ns (ObjectLiteral bs) = foldl go ns (map snd bs)
82− lit ns (ArrayLiteral bs) = foldl go ns bs
83− lit ns _ = ns
src/Language/PureScript/AST/Declarations.hsdeleted−635
@@ -1,635 +0,0 @@
1−{-# LANGUAGE TemplateHaskell #-}
2−
3−-- |
4−-- Data types for modules and declarations
5−--
6−module Language.PureScript.AST.Declarations where
7−
8−import Prelude.Compat
9−
10−import Control.Monad.Identity
11−
12−import Data.Aeson.TH
13−import qualified Data.Map as M
14−
15−import Language.PureScript.AST.Binders
16−import Language.PureScript.AST.Literals
17−import Language.PureScript.AST.Operators
18−import Language.PureScript.AST.SourcePos
19−import Language.PureScript.Types
20−import Language.PureScript.Names
21−import Language.PureScript.Kinds
22−import Language.PureScript.TypeClassDictionaries
23−import Language.PureScript.Comments
24−import Language.PureScript.Environment
25−import qualified Language.PureScript.Bundle as Bundle
26−
27−import qualified Text.Parsec as P
28−
29−-- | A map of locally-bound names in scope.
30−type Context = [(Ident, Type)]
31−
32−-- | A type of error messages
33−data SimpleErrorMessage
34− = ErrorParsingFFIModule FilePath (Maybe Bundle.ErrorMessage)
35− | ErrorParsingModule P.ParseError
36− | MissingFFIModule ModuleName
37− | MultipleFFIModules ModuleName [FilePath]
38− | UnnecessaryFFIModule ModuleName FilePath
39− | MissingFFIImplementations ModuleName [Ident]
40− | UnusedFFIImplementations ModuleName [Ident]
41− | InvalidFFIIdentifier ModuleName String
42− | CannotGetFileInfo FilePath
43− | CannotReadFile FilePath
44− | CannotWriteFile FilePath
45− | InfiniteType Type
46− | InfiniteKind Kind
47− | MultipleValueOpFixities (OpName 'ValueOpName)
48− | MultipleTypeOpFixities (OpName 'TypeOpName)
49− | OrphanTypeDeclaration Ident
50− | RedefinedIdent Ident
51− | OverlappingNamesInLet
52− | UnknownName (Qualified Name)
53− | UnknownImport ModuleName Name
54− | UnknownImportDataConstructor ModuleName (ProperName 'TypeName) (ProperName 'ConstructorName)
55− | UnknownExport Name
56− | UnknownExportDataConstructor (ProperName 'TypeName) (ProperName 'ConstructorName)
57− | ScopeConflict Name [ModuleName]
58− | ScopeShadowing Name (Maybe ModuleName) [ModuleName]
59− | DeclConflict Name Name
60− | ExportConflict (Qualified Name) (Qualified Name)
61− | DuplicateModule ModuleName [SourceSpan]
62− | DuplicateTypeArgument String
63− | InvalidDoBind
64− | InvalidDoLet
65− | CycleInDeclaration Ident
66− | CycleInTypeSynonym (Maybe (ProperName 'TypeName))
67− | CycleInModules [ModuleName]
68− | NameIsUndefined Ident
69− | UndefinedTypeVariable (ProperName 'TypeName)
70− | PartiallyAppliedSynonym (Qualified (ProperName 'TypeName))
71− | EscapedSkolem (Maybe Expr)
72− | TypesDoNotUnify Type Type
73− | KindsDoNotUnify Kind Kind
74− | ConstrainedTypeUnified Type Type
75− | OverlappingInstances (Qualified (ProperName 'ClassName)) [Type] [Qualified Ident]
76− | NoInstanceFound Constraint
77− | PossiblyInfiniteInstance (Qualified (ProperName 'ClassName)) [Type]
78− | CannotDerive (Qualified (ProperName 'ClassName)) [Type]
79− | InvalidNewtypeInstance (Qualified (ProperName 'ClassName)) [Type]
80− | CannotFindDerivingType (ProperName 'TypeName)
81− | DuplicateLabel String (Maybe Expr)
82− | DuplicateValueDeclaration Ident
83− | ArgListLengthsDiffer Ident
84− | OverlappingArgNames (Maybe Ident)
85− | MissingClassMember Ident
86− | ExtraneousClassMember Ident (Qualified (ProperName 'ClassName))
87− | ExpectedType Type Kind
88− | IncorrectConstructorArity (Qualified (ProperName 'ConstructorName))
89− | ExprDoesNotHaveType Expr Type
90− | PropertyIsMissing String
91− | AdditionalProperty String
92− | TypeSynonymInstance
93− | OrphanInstance Ident (Qualified (ProperName 'ClassName)) [Type]
94− | InvalidNewtype (ProperName 'TypeName)
95− | InvalidInstanceHead Type
96− | TransitiveExportError DeclarationRef [DeclarationRef]
97− | TransitiveDctorExportError DeclarationRef (ProperName 'ConstructorName)
98− | ShadowedName Ident
99− | ShadowedTypeVar String
100− | UnusedTypeVar String
101− | WildcardInferredType Type Context
102− | HoleInferredType String Type Context
103− | MissingTypeDeclaration Ident Type
104− | OverlappingPattern [[Binder]] Bool
105− | IncompleteExhaustivityCheck
106− | MisleadingEmptyTypeImport ModuleName (ProperName 'TypeName)
107− | ImportHidingModule ModuleName
108− | UnusedImport ModuleName
109− | UnusedExplicitImport ModuleName [Name] (Maybe ModuleName) [DeclarationRef]
110− | UnusedDctorImport ModuleName (ProperName 'TypeName) (Maybe ModuleName) [DeclarationRef]
111− | UnusedDctorExplicitImport ModuleName (ProperName 'TypeName) [ProperName 'ConstructorName] (Maybe ModuleName) [DeclarationRef]
112− | DuplicateSelectiveImport ModuleName
113− | DuplicateImport ModuleName ImportDeclarationType (Maybe ModuleName)
114− | DuplicateImportRef Name
115− | DuplicateExportRef Name
116− | IntOutOfRange Integer String Integer Integer
117− | ImplicitQualifiedImport ModuleName ModuleName [DeclarationRef]
118− | ImplicitImport ModuleName [DeclarationRef]
119− | HidingImport ModuleName [DeclarationRef]
120− | CaseBinderLengthDiffers Int [Binder]
121− | IncorrectAnonymousArgument
122− | InvalidOperatorInBinder (Qualified (OpName 'ValueOpName)) (Qualified Ident)
123− | DeprecatedRequirePath
124− | CannotGeneralizeRecursiveFunction Ident Type
125− | CannotDeriveNewtypeForData (ProperName 'TypeName)
126− | NonWildcardNewtypeInstance (ProperName 'TypeName)
127− deriving (Show)
128−
129−-- | Error message hints, providing more detailed information about failure.
130−data ErrorMessageHint
131− = ErrorUnifyingTypes Type Type
132− | ErrorInExpression Expr
133− | ErrorInModule ModuleName
134− | ErrorInInstance (Qualified (ProperName 'ClassName)) [Type]
135− | ErrorInSubsumption Type Type
136− | ErrorCheckingAccessor Expr String
137− | ErrorCheckingType Expr Type
138− | ErrorCheckingKind Type
139− | ErrorCheckingGuard
140− | ErrorInferringType Expr
141− | ErrorInApplication Expr Type Expr
142− | ErrorInDataConstructor (ProperName 'ConstructorName)
143− | ErrorInTypeConstructor (ProperName 'TypeName)
144− | ErrorInBindingGroup [Ident]
145− | ErrorInDataBindingGroup
146− | ErrorInTypeSynonym (ProperName 'TypeName)
147− | ErrorInValueDeclaration Ident
148− | ErrorInTypeDeclaration Ident
149− | ErrorInForeignImport Ident
150− | ErrorSolvingConstraint Constraint
151− | PositionedError SourceSpan
152− deriving (Show)
153−
154−-- | Categories of hints
155−data HintCategory
156− = ExprHint
157− | KindHint
158− | CheckHint
159− | PositionHint
160− | SolverHint
161− | OtherHint
162− deriving (Show, Eq)
163−
164−data ErrorMessage = ErrorMessage
165− [ErrorMessageHint]
166− SimpleErrorMessage
167− deriving (Show)
168−
169−-- |
170−-- A module declaration, consisting of comments about the module, a module name,
171−-- a list of declarations, and a list of the declarations that are
172−-- explicitly exported. If the export list is Nothing, everything is exported.
173−--
174−data Module = Module SourceSpan [Comment] ModuleName [Declaration] (Maybe [DeclarationRef])
175− deriving (Show)
176−
177−-- | Return a module's name.
178−getModuleName :: Module -> ModuleName
179−getModuleName (Module _ _ name _ _) = name
180−
181−-- | Return a module's source span.
182−getModuleSourceSpan :: Module -> SourceSpan
183−getModuleSourceSpan (Module ss _ _ _ _) = ss
184−
185−-- |
186−-- Add an import declaration for a module if it does not already explicitly import it.
187−--
188−addDefaultImport :: ModuleName -> Module -> Module
189−addDefaultImport toImport m@(Module ss coms mn decls exps) =
190− if isExistingImport `any` decls || mn == toImport then m
191− else Module ss coms mn (ImportDeclaration toImport Implicit Nothing : decls) exps
192− where
193− isExistingImport (ImportDeclaration mn' _ _) | mn' == toImport = True
194− isExistingImport (PositionedDeclaration _ _ d) = isExistingImport d
195− isExistingImport _ = False
196−
197−-- |
198−-- An item in a list of explicit imports or exports
199−--
200−data DeclarationRef
201− -- |
202− -- A type constructor with data constructors
203− --
204− = TypeRef (ProperName 'TypeName) (Maybe [ProperName 'ConstructorName])
205− -- |
206− -- A type operator
207− --
208− | TypeOpRef (OpName 'TypeOpName)
209− -- |
210− -- A value
211− --
212− | ValueRef Ident
213− -- |
214− -- A value-level operator
215− --
216− | ValueOpRef (OpName 'ValueOpName)
217− -- |
218− -- A type class
219− --
220− | TypeClassRef (ProperName 'ClassName)
221− -- |
222− -- A type class instance, created during typeclass desugaring (name, class name, instance types)
223− --
224− | TypeInstanceRef Ident
225− -- |
226− -- A module, in its entirety
227− --
228− | ModuleRef ModuleName
229− -- |
230− -- A value re-exported from another module. These will be inserted during
231− -- elaboration in name desugaring.
232− --
233− | ReExportRef ModuleName DeclarationRef
234− -- |
235− -- A declaration reference with source position information
236− --
237− | PositionedDeclarationRef SourceSpan [Comment] DeclarationRef
238− deriving (Show)
239−
240−instance Eq DeclarationRef where
241− (TypeRef name dctors) == (TypeRef name' dctors') = name == name' && dctors == dctors'
242− (TypeOpRef name) == (TypeOpRef name') = name == name'
243− (ValueRef name) == (ValueRef name') = name == name'
244− (ValueOpRef name) == (ValueOpRef name') = name == name'
245− (TypeClassRef name) == (TypeClassRef name') = name == name'
246− (TypeInstanceRef name) == (TypeInstanceRef name') = name == name'
247− (ModuleRef name) == (ModuleRef name') = name == name'
248− (ReExportRef mn ref) == (ReExportRef mn' ref') = mn == mn' && ref == ref'
249− (PositionedDeclarationRef _ _ r) == r' = r == r'
250− r == (PositionedDeclarationRef _ _ r') = r == r'
251− _ == _ = False
252−
253−getTypeRef :: DeclarationRef -> Maybe (ProperName 'TypeName, Maybe [ProperName 'ConstructorName])
254−getTypeRef (TypeRef name dctors) = Just (name, dctors)
255−getTypeRef (PositionedDeclarationRef _ _ r) = getTypeRef r
256−getTypeRef _ = Nothing
257−
258−getTypeOpRef :: DeclarationRef -> Maybe (OpName 'TypeOpName)
259−getTypeOpRef (TypeOpRef op) = Just op
260−getTypeOpRef (PositionedDeclarationRef _ _ r) = getTypeOpRef r
261−getTypeOpRef _ = Nothing
262−
263−getValueRef :: DeclarationRef -> Maybe Ident
264−getValueRef (ValueRef name) = Just name
265−getValueRef (PositionedDeclarationRef _ _ r) = getValueRef r
266−getValueRef _ = Nothing
267−
268−getValueOpRef :: DeclarationRef -> Maybe (OpName 'ValueOpName)
269−getValueOpRef (ValueOpRef op) = Just op
270−getValueOpRef (PositionedDeclarationRef _ _ r) = getValueOpRef r
271−getValueOpRef _ = Nothing
272−
273−getTypeClassRef :: DeclarationRef -> Maybe (ProperName 'ClassName)
274−getTypeClassRef (TypeClassRef name) = Just name
275−getTypeClassRef (PositionedDeclarationRef _ _ r) = getTypeClassRef r
276−getTypeClassRef _ = Nothing
277−
278−isModuleRef :: DeclarationRef -> Bool
279−isModuleRef (PositionedDeclarationRef _ _ r) = isModuleRef r
280−isModuleRef (ModuleRef _) = True
281−isModuleRef _ = False
282−
283−-- |
284−-- The data type which specifies type of import declaration
285−--
286−data ImportDeclarationType
287− -- |
288− -- An import with no explicit list: `import M`.
289− --
290− = Implicit
291− -- |
292− -- An import with an explicit list of references to import: `import M (foo)`
293− --
294− | Explicit [DeclarationRef]
295− -- |
296− -- An import with a list of references to hide: `import M hiding (foo)`
297− --
298− | Hiding [DeclarationRef]
299− deriving (Eq, Show)
300−
301−isImplicit :: ImportDeclarationType -> Bool
302−isImplicit Implicit = True
303−isImplicit _ = False
304−
305−isExplicit :: ImportDeclarationType -> Bool
306−isExplicit (Explicit _) = True
307−isExplicit _ = False
308−
309−-- |
310−-- The data type of declarations
311−--
312−data Declaration
313− -- |
314− -- A data type declaration (data or newtype, name, arguments, data constructors)
315− --
316− = DataDeclaration DataDeclType (ProperName 'TypeName) [(String, Maybe Kind)] [(ProperName 'ConstructorName, [Type])]
317− -- |
318− -- A minimal mutually recursive set of data type declarations
319− --
320− | DataBindingGroupDeclaration [Declaration]
321− -- |
322− -- A type synonym declaration (name, arguments, type)
323− --
324− | TypeSynonymDeclaration (ProperName 'TypeName) [(String, Maybe Kind)] Type
325− -- |
326− -- A type declaration for a value (name, ty)
327− --
328− | TypeDeclaration Ident Type
329− -- |
330− -- A value declaration (name, top-level binders, optional guard, value)
331− --
332− | ValueDeclaration Ident NameKind [Binder] (Either [(Guard, Expr)] Expr)
333− -- |
334− -- A minimal mutually recursive set of value declarations
335− --
336− | BindingGroupDeclaration [(Ident, NameKind, Expr)]
337− -- |
338− -- A foreign import declaration (name, type)
339− --
340− | ExternDeclaration Ident Type
341− -- |
342− -- A data type foreign import (name, kind)
343− --
344− | ExternDataDeclaration (ProperName 'TypeName) Kind
345− -- |
346− -- A fixity declaration
347− --
348− | FixityDeclaration (Either ValueFixity TypeFixity)
349− -- |
350− -- A module import (module name, qualified/unqualified/hiding, optional "qualified as" name)
351− --
352− | ImportDeclaration ModuleName ImportDeclarationType (Maybe ModuleName)
353− -- |
354− -- A type class declaration (name, argument, implies, member declarations)
355− --
356− | TypeClassDeclaration (ProperName 'ClassName) [(String, Maybe Kind)] [Constraint] [FunctionalDependency] [Declaration]
357− -- |
358− -- A type instance declaration (name, dependencies, class name, instance types, member
359− -- declarations)
360− --
361− | TypeInstanceDeclaration Ident [Constraint] (Qualified (ProperName 'ClassName)) [Type] TypeInstanceBody
362− -- |
363− -- A declaration with source position information
364− --
365− | PositionedDeclaration SourceSpan [Comment] Declaration
366− deriving (Show)
367−
368−data ValueFixity = ValueFixity Fixity (Qualified (Either Ident (ProperName 'ConstructorName))) (OpName 'ValueOpName)
369− deriving (Eq, Ord, Show)
370−
371−data TypeFixity = TypeFixity Fixity (Qualified (ProperName 'TypeName)) (OpName 'TypeOpName)
372− deriving (Eq, Ord, Show)
373−
374−pattern ValueFixityDeclaration :: Fixity -> Qualified (Either Ident (ProperName 'ConstructorName)) -> OpName 'ValueOpName -> Declaration
375−pattern ValueFixityDeclaration fixity name op = FixityDeclaration (Left (ValueFixity fixity name op))
376−
377−pattern TypeFixityDeclaration :: Fixity -> Qualified (ProperName 'TypeName) -> OpName 'TypeOpName -> Declaration
378−pattern TypeFixityDeclaration fixity name op = FixityDeclaration (Right (TypeFixity fixity name op))
379−
380−-- | The members of a type class instance declaration
381−data TypeInstanceBody
382− = DerivedInstance
383− -- ^ This is a derived instance
384− | NewtypeInstance
385− -- ^ This is an instance derived from a newtype
386− | NewtypeInstanceWithDictionary Expr
387− -- ^ This is an instance derived from a newtype, desugared to include a
388− -- dictionary for the type under the newtype.
389− | ExplicitInstance [Declaration]
390− -- ^ This is a regular (explicit) instance
391− deriving (Show)
392−
393−mapTypeInstanceBody :: ([Declaration] -> [Declaration]) -> TypeInstanceBody -> TypeInstanceBody
394−mapTypeInstanceBody f = runIdentity . traverseTypeInstanceBody (Identity . f)
395−
396−-- | A traversal for TypeInstanceBody
397−traverseTypeInstanceBody :: (Applicative f) => ([Declaration] -> f [Declaration]) -> TypeInstanceBody -> f TypeInstanceBody
398−traverseTypeInstanceBody f (ExplicitInstance ds) = ExplicitInstance <$> f ds
399−traverseTypeInstanceBody _ other = pure other
400−
401−-- |
402−-- Test if a declaration is a value declaration
403−--
404−isValueDecl :: Declaration -> Bool
405−isValueDecl ValueDeclaration{} = True
406−isValueDecl (PositionedDeclaration _ _ d) = isValueDecl d
407−isValueDecl _ = False
408−
409−-- |
410−-- Test if a declaration is a data type or type synonym declaration
411−--
412−isDataDecl :: Declaration -> Bool
413−isDataDecl DataDeclaration{} = True
414−isDataDecl TypeSynonymDeclaration{} = True
415−isDataDecl (PositionedDeclaration _ _ d) = isDataDecl d
416−isDataDecl _ = False
417−
418−-- |
419−-- Test if a declaration is a module import
420−--
421−isImportDecl :: Declaration -> Bool
422−isImportDecl ImportDeclaration{} = True
423−isImportDecl (PositionedDeclaration _ _ d) = isImportDecl d
424−isImportDecl _ = False
425−
426−-- |
427−-- Test if a declaration is a data type foreign import
428−--
429−isExternDataDecl :: Declaration -> Bool
430−isExternDataDecl ExternDataDeclaration{} = True
431−isExternDataDecl (PositionedDeclaration _ _ d) = isExternDataDecl d
432−isExternDataDecl _ = False
433−
434−-- |
435−-- Test if a declaration is a fixity declaration
436−--
437−isFixityDecl :: Declaration -> Bool
438−isFixityDecl FixityDeclaration{} = True
439−isFixityDecl (PositionedDeclaration _ _ d) = isFixityDecl d
440−isFixityDecl _ = False
441−
442−getFixityDecl :: Declaration -> Maybe (Either ValueFixity TypeFixity)
443−getFixityDecl (FixityDeclaration fixity) = Just fixity
444−getFixityDecl (PositionedDeclaration _ _ d) = getFixityDecl d
445−getFixityDecl _ = Nothing
446−
447−-- |
448−-- Test if a declaration is a foreign import
449−--
450−isExternDecl :: Declaration -> Bool
451−isExternDecl ExternDeclaration{} = True
452−isExternDecl (PositionedDeclaration _ _ d) = isExternDecl d
453−isExternDecl _ = False
454−
455−-- |
456−-- Test if a declaration is a type class instance declaration
457−--
458−isTypeClassInstanceDeclaration :: Declaration -> Bool
459−isTypeClassInstanceDeclaration TypeInstanceDeclaration{} = True
460−isTypeClassInstanceDeclaration (PositionedDeclaration _ _ d) = isTypeClassInstanceDeclaration d
461−isTypeClassInstanceDeclaration _ = False
462−
463−-- |
464−-- Test if a declaration is a type class declaration
465−--
466−isTypeClassDeclaration :: Declaration -> Bool
467−isTypeClassDeclaration TypeClassDeclaration{} = True
468−isTypeClassDeclaration (PositionedDeclaration _ _ d) = isTypeClassDeclaration d
469−isTypeClassDeclaration _ = False
470−
471−-- |
472−-- Recursively flatten data binding groups in the list of declarations
473−flattenDecls :: [Declaration] -> [Declaration]
474−flattenDecls = concatMap flattenOne
475− where flattenOne :: Declaration -> [Declaration]
476− flattenOne (DataBindingGroupDeclaration decls) = concatMap flattenOne decls
477− flattenOne d = [d]
478−
479−-- |
480−-- A guard is just a boolean-valued expression that appears alongside a set of binders
481−--
482−type Guard = Expr
483−
484−-- |
485−-- Data type for expressions and terms
486−--
487−data Expr
488− -- |
489− -- A literal value
490− --
491− = Literal (Literal Expr)
492− -- |
493− -- A prefix -, will be desugared
494− --
495− | UnaryMinus Expr
496− -- |
497− -- Binary operator application. During the rebracketing phase of desugaring, this data constructor
498− -- will be removed.
499− --
500− | BinaryNoParens Expr Expr Expr
501− -- |
502− -- Explicit parentheses. During the rebracketing phase of desugaring, this data constructor
503− -- will be removed.
504− --
505− -- Note: although it seems this constructor is not used, it _is_ useful, since it prevents
506− -- certain traversals from matching.
507− --
508− | Parens Expr
509− -- |
510− -- An record property accessor expression (e.g. `obj.x` or `_.x`).
511− -- Anonymous arguments will be removed during desugaring and expanded
512− -- into a lambda that reads a property from a record.
513− --
514− | Accessor String Expr
515− -- |
516− -- Partial record update
517− --
518− | ObjectUpdate Expr [(String, Expr)]
519− -- |
520− -- Function introduction
521− --
522− | Abs (Either Ident Binder) Expr
523− -- |
524− -- Function application
525− --
526− | App Expr Expr
527− -- |
528− -- Variable
529− --
530− | Var (Qualified Ident)
531− -- |
532− -- An operator. This will be desugared into a function during the "operators"
533− -- phase of desugaring.
534− --
535− | Op (Qualified (OpName 'ValueOpName))
536− -- |
537− -- Conditional (if-then-else expression)
538− --
539− | IfThenElse Expr Expr Expr
540− -- |
541− -- A data constructor
542− --
543− | Constructor (Qualified (ProperName 'ConstructorName))
544− -- |
545− -- A case expression. During the case expansion phase of desugaring, top-level binders will get
546− -- desugared into case expressions, hence the need for guards and multiple binders per branch here.
547− --
548− | Case [Expr] [CaseAlternative]
549− -- |
550− -- A value with a type annotation
551− --
552− | TypedValue Bool Expr Type
553− -- |
554− -- A let binding
555− --
556− | Let [Declaration] Expr
557− -- |
558− -- A do-notation block
559− --
560− | Do [DoNotationElement]
561− -- |
562− -- An application of a typeclass dictionary constructor. The value should be
563− -- an ObjectLiteral.
564− --
565− | TypeClassDictionaryConstructorApp (Qualified (ProperName 'ClassName)) Expr
566− -- |
567− -- A placeholder for a type class dictionary to be inserted later. At the end of type checking, these
568− -- placeholders will be replaced with actual expressions representing type classes dictionaries which
569− -- can be evaluated at runtime. The constructor arguments represent (in order): whether or not to look
570− -- at superclass implementations when searching for a dictionary, the type class name and
571− -- instance type, and the type class dictionaries in scope.
572− --
573− | TypeClassDictionary Constraint
574− (M.Map (Maybe ModuleName) (M.Map (Qualified (ProperName 'ClassName)) (M.Map (Qualified Ident) TypeClassDictionaryInScope)))
575− [ErrorMessageHint]
576− -- |
577− -- A typeclass dictionary accessor, the implementation is left unspecified until CoreFn desugaring.
578− --
579− | TypeClassDictionaryAccessor (Qualified (ProperName 'ClassName)) Ident
580− -- |
581− -- A placeholder for a superclass dictionary to be turned into a TypeClassDictionary during typechecking
582− --
583− | DeferredDictionary (Qualified (ProperName 'ClassName)) [Type]
584− -- |
585− -- A placeholder for an anonymous function argument
586− --
587− | AnonymousArgument
588− -- |
589− -- A typed hole that will be turned into a hint/error duing typechecking
590− --
591− | Hole String
592− -- |
593− -- A value with source position information
594− --
595− | PositionedValue SourceSpan [Comment] Expr
596− deriving (Show)
597−
598−-- |
599−-- An alternative in a case statement
600−--
601−data CaseAlternative = CaseAlternative
602− { -- |
603− -- A collection of binders with which to match the inputs
604− --
605− caseAlternativeBinders :: [Binder]
606− -- |
607− -- The result expression or a collect of guarded expressions
608− --
609− , caseAlternativeResult :: Either [(Guard, Expr)] Expr
610− } deriving (Show)
611−
612−-- |
613−-- A statement in a do-notation block
614−--
615−data DoNotationElement
616− -- |
617− -- A monadic value without a binder
618− --
619− = DoNotationValue Expr
620− -- |
621− -- A monadic value with a binder
622− --
623− | DoNotationBind Binder Expr
624− -- |
625− -- A let statement, i.e. a pure value with a binder
626− --
627− | DoNotationLet [Declaration]
628− -- |
629− -- A do notation element with source position information
630− --
631− | PositionedDoNotationElement SourceSpan [Comment] DoNotationElement
632− deriving (Show)
633−
634−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''DeclarationRef)
635−$(deriveJSON (defaultOptions { sumEncoding = ObjectWithSingleField }) ''ImportDeclarationType)
src/Language/PureScript/AST/Exported.hsdeleted−154
@@ -1,154 +0,0 @@
1−module Language.PureScript.AST.Exported
2− ( exportedDeclarations
3− , isExported
4− ) where
5−
6−import Prelude.Compat
7−
8−import Control.Category ((>>>))
9−
10−import Data.Maybe (mapMaybe)
11−
12−import Language.PureScript.AST.Declarations
13−import Language.PureScript.Types
14−import Language.PureScript.Names
15−
16−-- |
17−-- Return a list of all declarations which are exported from a module.
18−-- This function descends into data declarations to filter out unexported
19−-- data constructors, and also filters out type instance declarations if
20−-- they refer to classes or types which are not themselves exported.
21−--
22−-- Note that this function assumes that the module has already had its imports
23−-- desugared using 'Language.PureScript.Sugar.Names.desugarImports'. It will
24−-- produce incorrect results if this is not the case - for example, type class
25−-- instances will be incorrectly removed in some cases.
26−--
27−exportedDeclarations :: Module -> [Declaration]
28−exportedDeclarations (Module _ _ mn decls exps) = go decls
29− where
30− go = flattenDecls
31− >>> filter (isExported exps)
32− >>> map (filterDataConstructors exps)
33− >>> filterInstances mn exps
34−
35−-- |
36−-- Filter out all data constructors from a declaration which are not exported.
37−-- If the supplied declaration is not a data declaration, this function returns
38−-- it unchanged.
39−--
40−filterDataConstructors :: Maybe [DeclarationRef] -> Declaration -> Declaration
41−filterDataConstructors exps (DataDeclaration dType tyName tyArgs dctors) =
42− DataDeclaration dType tyName tyArgs $
43− filter (isDctorExported tyName exps . fst) dctors
44−filterDataConstructors exps (PositionedDeclaration srcSpan coms d) =
45− PositionedDeclaration srcSpan coms (filterDataConstructors exps d)
46−filterDataConstructors _ other = other
47−
48−-- |
49−-- Filter out all the type instances from a list of declarations which
50−-- reference a type or type class which is both local and not exported.
51−--
52−-- Note that this function assumes that the module has already had its imports
53−-- desugared using "Language.PureScript.Sugar.Names.desugarImports". It will
54−-- produce incorrect results if this is not the case - for example, type class
55−-- instances will be incorrectly removed in some cases.
56−--
57−filterInstances
58− :: ModuleName
59− -> Maybe [DeclarationRef]
60− -> [Declaration]
61− -> [Declaration]
62−filterInstances _ Nothing = id
63−filterInstances mn (Just exps) =
64− let refs = Left `map` mapMaybe typeClassName exps
65− ++ Right `map` mapMaybe typeName exps
66− in filter (all (visibleOutside refs) . typeInstanceConstituents)
67− where
68− -- Given a Qualified ProperName, and a list of all exported types and type
69− -- classes, returns whether the supplied Qualified ProperName is visible
70− -- outside this module. This is true if one of the following hold:
71− --
72− -- * the name is defined in the same module and is exported,
73− -- * the name is defined in a different module (and must be exported from
74− -- that module; the code would fail to compile otherwise).
75− visibleOutside
76− :: [Either (ProperName 'ClassName) (ProperName 'TypeName)]
77− -> Either (Qualified (ProperName 'ClassName)) (Qualified (ProperName 'TypeName))
78− -> Bool
79− visibleOutside refs q
80− | either checkQual checkQual q = True
81− | otherwise = either (Left . disqualify) (Right . disqualify) q `elem` refs
82−
83− -- Check that a qualified name is qualified for a different module
84− checkQual :: Qualified a -> Bool
85− checkQual q = isQualified q && not (isQualifiedWith mn q)
86−
87− typeName :: DeclarationRef -> Maybe (ProperName 'TypeName)
88− typeName (TypeRef n _) = Just n
89− typeName (PositionedDeclarationRef _ _ r) = typeName r
90− typeName _ = Nothing
91−
92− typeClassName :: DeclarationRef -> Maybe (ProperName 'ClassName)
93− typeClassName (TypeClassRef n) = Just n
94− typeClassName (PositionedDeclarationRef _ _ r) = typeClassName r
95− typeClassName _ = Nothing
96−
97−-- |
98−-- Get all type and type class names referenced by a type instance declaration.
99−--
100−typeInstanceConstituents :: Declaration -> [Either (Qualified (ProperName 'ClassName)) (Qualified (ProperName 'TypeName))]
101−typeInstanceConstituents (TypeInstanceDeclaration _ constraints className tys _) =
102− Left className : (concatMap fromConstraint constraints ++ concatMap fromType tys)
103− where
104−
105− fromConstraint c = Left (constraintClass c) : concatMap fromType (constraintArgs c)
106− fromType = everythingOnTypes (++) go
107−
108− -- Note that type synonyms are disallowed in instance declarations, so
109− -- we don't need to handle them here.
110− go (TypeConstructor n) = [Right n]
111− go (ConstrainedType cs _) = concatMap fromConstraint cs
112− go _ = []
113−
114−typeInstanceConstituents (PositionedDeclaration _ _ d) = typeInstanceConstituents d
115−typeInstanceConstituents _ = []
116−
117−
118−-- |
119−-- Test if a declaration is exported, given a module's export list. Note that
120−-- this function does not account for type instance declarations of
121−-- non-exported types, or non-exported data constructors. Therefore, you should
122−-- prefer 'exportedDeclarations' to this function, where possible.
123−--
124−isExported :: Maybe [DeclarationRef] -> Declaration -> Bool
125−isExported Nothing _ = True
126−isExported _ TypeInstanceDeclaration{} = True
127−isExported exps (PositionedDeclaration _ _ d) = isExported exps d
128−isExported (Just exps) decl = any (matches decl) exps
129− where
130− matches (TypeDeclaration ident _) (ValueRef ident') = ident == ident'
131− matches (ValueDeclaration ident _ _ _) (ValueRef ident') = ident == ident'
132− matches (ExternDeclaration ident _) (ValueRef ident') = ident == ident'
133− matches (DataDeclaration _ ident _ _) (TypeRef ident' _) = ident == ident'
134− matches (ExternDataDeclaration ident _) (TypeRef ident' _) = ident == ident'
135− matches (TypeSynonymDeclaration ident _ _) (TypeRef ident' _) = ident == ident'
136− matches (TypeClassDeclaration ident _ _ _ _) (TypeClassRef ident') = ident == ident'
137− matches (ValueFixityDeclaration _ _ op) (ValueOpRef op') = op == op'
138− matches (TypeFixityDeclaration _ _ op) (TypeOpRef op') = op == op'
139− matches (PositionedDeclaration _ _ d) r = d `matches` r
140− matches d (PositionedDeclarationRef _ _ r) = d `matches` r
141− matches _ _ = False
142−
143−-- |
144−-- Test if a data constructor for a given type is exported, given a module's
145−-- export list. Prefer 'exportedDeclarations' to this function, where possible.
146−--
147−isDctorExported :: ProperName 'TypeName -> Maybe [DeclarationRef] -> ProperName 'ConstructorName -> Bool
148−isDctorExported _ Nothing _ = True
149−isDctorExported ident (Just exps) ctor = test `any` exps
150− where
151− test (PositionedDeclarationRef _ _ d) = test d
152− test (TypeRef ident' Nothing) = ident == ident'
153− test (TypeRef ident' (Just ctors)) = ident == ident' && ctor `elem` ctors
154− test _ = False
src/Language/PureScript/AST/Literals.hsdeleted−37
@@ -1,37 +0,0 @@
1−-- |
2−-- The core functional representation for literal values.
3−--
4−module Language.PureScript.AST.Literals where
5−
6−import Prelude.Compat
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, Functor)
src/Language/PureScript/AST/Operators.hsdeleted−53
@@ -1,53 +0,0 @@
1−{-# LANGUAGE OverloadedStrings #-}
2−
3−-- |
4−-- Operators fixity and associativity
5−--
6−module Language.PureScript.AST.Operators where
7−
8−import Prelude.Compat
9−
10−import Data.Aeson ((.=))
11−import qualified Data.Aeson as A
12−
13−import Language.PureScript.Crash
14−
15−-- |
16−-- A precedence level for an infix operator
17−--
18−type Precedence = Integer
19−
20−-- |
21−-- Associativity for infix operators
22−--
23−data Associativity = Infixl | Infixr | Infix
24− deriving (Show, Eq, Ord)
25−
26−showAssoc :: Associativity -> String
27−showAssoc Infixl = "infixl"
28−showAssoc Infixr = "infixr"
29−showAssoc Infix = "infix"
30−
31−readAssoc :: String -> Associativity
32−readAssoc "infixl" = Infixl
33−readAssoc "infixr" = Infixr
34−readAssoc "infix" = Infix
35−readAssoc _ = internalError "readAssoc: no parse"
36−
37−instance A.ToJSON Associativity where
38− toJSON = A.toJSON . showAssoc
39−
40−instance A.FromJSON Associativity where
41− parseJSON = fmap readAssoc . A.parseJSON
42−
43−-- |
44−-- Fixity data for infix operators
45−--
46−data Fixity = Fixity Associativity Precedence
47− deriving (Show, Eq, Ord)
48−
49−instance A.ToJSON Fixity where
50− toJSON (Fixity associativity precedence) =
51− A.object [ "associativity" .= associativity
52− , "precedence" .= precedence
53− ]
src/Language/PureScript/AST/SourcePos.hsdeleted−80
@@ -1,80 +0,0 @@
1−{-# LANGUAGE OverloadedStrings #-}
2−
3−-- |
4−-- Source position information
5−--
6−module Language.PureScript.AST.SourcePos where
7−
8−import Prelude.Compat
9−
10−import Data.Aeson ((.=), (.:))
11−import qualified Data.Aeson as A
12−
13−-- |
14−-- Source position information
15−--
16−data SourcePos = SourcePos
17− { -- |
18− -- Line number
19− --
20− sourcePosLine :: Int
21− -- |
22− -- Column number
23− --
24− , sourcePosColumn :: Int
25− } deriving (Show, Eq, Ord)
26−
27−displaySourcePos :: SourcePos -> String
28−displaySourcePos sp =
29− "line " ++ show (sourcePosLine sp) ++
30− ", column " ++ show (sourcePosColumn sp)
31−
32−instance A.ToJSON SourcePos where
33− toJSON SourcePos{..} =
34− A.toJSON [sourcePosLine, sourcePosColumn]
35−
36−instance A.FromJSON SourcePos where
37− parseJSON arr = do
38− [line, col] <- A.parseJSON arr
39− return $ SourcePos line col
40−
41−data SourceSpan = SourceSpan
42− { -- |
43− -- Source name
44− --
45− spanName :: String
46− -- |
47− -- Start of the span
48− --
49− , spanStart :: SourcePos
50− -- End of the span
51− --
52− , spanEnd :: SourcePos
53− } deriving (Show, Eq, Ord)
54−
55−displayStartEndPos :: SourceSpan -> String
56−displayStartEndPos sp =
57− displaySourcePos (spanStart sp) ++ " - " ++
58− displaySourcePos (spanEnd sp)
59−
60−displaySourceSpan :: SourceSpan -> String
61−displaySourceSpan sp =
62− spanName sp ++ " " ++
63− displayStartEndPos sp
64−
65−instance A.ToJSON SourceSpan where
66− toJSON SourceSpan{..} =
67− A.object [ "name" .= spanName
68− , "start" .= spanStart
69− , "end" .= spanEnd
70− ]
71−
72−instance A.FromJSON SourceSpan where
73− parseJSON = A.withObject "SourceSpan" $ \o ->
74− SourceSpan <$>
75− o .: "name" <*>
76− o .: "start" <*>
77− o .: "end"
78−
79−internalModuleSourceSpan :: String -> SourceSpan
80−internalModuleSourceSpan name = SourceSpan name (SourcePos 0 0) (SourcePos 0 0)
src/Language/PureScript/AST/Traversals.hsdeleted−588
@@ -1,588 +0,0 @@
1−-- |
2−-- AST traversal helpers
3−--
4−module Language.PureScript.AST.Traversals where
5−
6−import Prelude.Compat
7−
8−import Control.Monad
9−import Control.Arrow ((***), (+++))
10−
11−import Data.Foldable (fold)
12−import Data.List (mapAccumL)
13−import Data.Maybe (mapMaybe)
14−import qualified Data.Set as S
15−
16−import Language.PureScript.AST.Binders
17−import Language.PureScript.AST.Literals
18−import Language.PureScript.AST.Declarations
19−import Language.PureScript.Types
20−import Language.PureScript.Traversals
21−import Language.PureScript.Names
22−
23−everywhereOnValues
24− :: (Declaration -> Declaration)
25− -> (Expr -> Expr)
26− -> (Binder -> Binder)
27− -> ( Declaration -> Declaration
28− , Expr -> Expr
29− , Binder -> Binder
30− )
31−everywhereOnValues f g h = (f', g', h')
32− where
33− f' :: Declaration -> Declaration
34− f' (DataBindingGroupDeclaration ds) = f (DataBindingGroupDeclaration (map f' ds))
35− f' (ValueDeclaration name nameKind bs val) = f (ValueDeclaration name nameKind (map h' bs) ((map (g' *** g') +++ g') val))
36− f' (BindingGroupDeclaration ds) = f (BindingGroupDeclaration (map (\(name, nameKind, val) -> (name, nameKind, g' val)) ds))
37− f' (TypeClassDeclaration name args implies deps ds) = f (TypeClassDeclaration name args implies deps (map f' ds))
38− f' (TypeInstanceDeclaration name cs className args ds) = f (TypeInstanceDeclaration name cs className args (mapTypeInstanceBody (map f') ds))
39− f' (PositionedDeclaration pos com d) = f (PositionedDeclaration pos com (f' d))
40− f' other = f other
41−
42− g' :: Expr -> Expr
43− g' (Literal l) = g (Literal (lit g' l))
44− g' (UnaryMinus v) = g (UnaryMinus (g' v))
45− g' (BinaryNoParens op v1 v2) = g (BinaryNoParens (g' op) (g' v1) (g' v2))
46− g' (Parens v) = g (Parens (g' v))
47− g' (TypeClassDictionaryConstructorApp name v) = g (TypeClassDictionaryConstructorApp name (g' v))
48− g' (Accessor prop v) = g (Accessor prop (g' v))
49− g' (ObjectUpdate obj vs) = g (ObjectUpdate (g' obj) (map (fmap g') vs))
50− g' (Abs name v) = g (Abs name (g' v))
51− g' (App v1 v2) = g (App (g' v1) (g' v2))
52− g' (IfThenElse v1 v2 v3) = g (IfThenElse (g' v1) (g' v2) (g' v3))
53− g' (Case vs alts) = g (Case (map g' vs) (map handleCaseAlternative alts))
54− g' (TypedValue check v ty) = g (TypedValue check (g' v) ty)
55− g' (Let ds v) = g (Let (map f' ds) (g' v))
56− g' (Do es) = g (Do (map handleDoNotationElement es))
57− g' (PositionedValue pos com v) = g (PositionedValue pos com (g' v))
58− g' other = g other
59−
60− h' :: Binder -> Binder
61− h' (ConstructorBinder ctor bs) = h (ConstructorBinder ctor (map h' bs))
62− h' (BinaryNoParensBinder b1 b2 b3) = h (BinaryNoParensBinder (h' b1) (h' b2) (h' b3))
63− h' (ParensInBinder b) = h (ParensInBinder (h' b))
64− h' (LiteralBinder l) = h (LiteralBinder (lit h' l))
65− h' (NamedBinder name b) = h (NamedBinder name (h' b))
66− h' (PositionedBinder pos com b) = h (PositionedBinder pos com (h' b))
67− h' (TypedBinder t b) = h (TypedBinder t (h' b))
68− h' other = h other
69−
70− lit :: (a -> a) -> Literal a -> Literal a
71− lit go (ArrayLiteral as) = ArrayLiteral (map go as)
72− lit go (ObjectLiteral as) = ObjectLiteral (map (fmap go) as)
73− lit _ other = other
74−
75− handleCaseAlternative :: CaseAlternative -> CaseAlternative
76− handleCaseAlternative ca =
77− ca { caseAlternativeBinders = map h' (caseAlternativeBinders ca)
78− , caseAlternativeResult = (map (g' *** g') +++ g') (caseAlternativeResult ca)
79− }
80−
81− handleDoNotationElement :: DoNotationElement -> DoNotationElement
82− handleDoNotationElement (DoNotationValue v) = DoNotationValue (g' v)
83− handleDoNotationElement (DoNotationBind b v) = DoNotationBind (h' b) (g' v)
84− handleDoNotationElement (DoNotationLet ds) = DoNotationLet (map f' ds)
85− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com (handleDoNotationElement e)
86−
87−everywhereOnValuesTopDownM
88− :: forall m
89− . (Monad m)
90− => (Declaration -> m Declaration)
91− -> (Expr -> m Expr)
92− -> (Binder -> m Binder)
93− -> ( Declaration -> m Declaration
94− , Expr -> m Expr
95− , Binder -> m Binder
96− )
97−everywhereOnValuesTopDownM f g h = (f' <=< f, g' <=< g, h' <=< h)
98− where
99−
100− f' :: Declaration -> m Declaration
101− f' (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> traverse (f' <=< f) ds
102− f' (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> traverse (h' <=< h) bs <*> eitherM (traverse (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
103− f' (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> traverse (\(name, nameKind, val) -> (,,) name nameKind <$> (g val >>= g')) ds
104− f' (TypeClassDeclaration name args implies deps ds) = TypeClassDeclaration name args implies deps <$> traverse (f' <=< f) ds
105− f' (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse (f' <=< f)) ds
106− f' (PositionedDeclaration pos com d) = PositionedDeclaration pos com <$> (f d >>= f')
107− f' other = f other
108−
109− g' :: Expr -> m Expr
110− g' (Literal l) = Literal <$> lit (g >=> g') l
111− g' (UnaryMinus v) = UnaryMinus <$> (g v >>= g')
112− g' (BinaryNoParens op v1 v2) = BinaryNoParens <$> (g op >>= g') <*> (g v1 >>= g') <*> (g v2 >>= g')
113− g' (Parens v) = Parens <$> (g v >>= g')
114− g' (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> (g v >>= g')
115− g' (Accessor prop v) = Accessor prop <$> (g v >>= g')
116− g' (ObjectUpdate obj vs) = ObjectUpdate <$> (g obj >>= g') <*> traverse (sndM (g' <=< g)) vs
117− g' (Abs name v) = Abs name <$> (g v >>= g')
118− g' (App v1 v2) = App <$> (g v1 >>= g') <*> (g v2 >>= g')
119− g' (IfThenElse v1 v2 v3) = IfThenElse <$> (g v1 >>= g') <*> (g v2 >>= g') <*> (g v3 >>= g')
120− g' (Case vs alts) = Case <$> traverse (g' <=< g) vs <*> traverse handleCaseAlternative alts
121− g' (TypedValue check v ty) = TypedValue check <$> (g v >>= g') <*> pure ty
122− g' (Let ds v) = Let <$> traverse (f' <=< f) ds <*> (g v >>= g')
123− g' (Do es) = Do <$> traverse handleDoNotationElement es
124− g' (PositionedValue pos com v) = PositionedValue pos com <$> (g v >>= g')
125− g' other = g other
126−
127− h' :: Binder -> m Binder
128− h' (LiteralBinder l) = LiteralBinder <$> lit (h >=> h') l
129− h' (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> traverse (h' <=< h) bs
130− h' (BinaryNoParensBinder b1 b2 b3) = BinaryNoParensBinder <$> (h b1 >>= h') <*> (h b2 >>= h') <*> (h b3 >>= h')
131− h' (ParensInBinder b) = ParensInBinder <$> (h b >>= h')
132− h' (NamedBinder name b) = NamedBinder name <$> (h b >>= h')
133− h' (PositionedBinder pos com b) = PositionedBinder pos com <$> (h b >>= h')
134− h' (TypedBinder t b) = TypedBinder t <$> (h b >>= h')
135− h' other = h other
136−
137− lit :: (a -> m a) -> Literal a -> m (Literal a)
138− lit go (ObjectLiteral as) = ObjectLiteral <$> traverse (sndM go) as
139− lit go (ArrayLiteral as) = ArrayLiteral <$> traverse go as
140− lit _ other = pure other
141−
142− handleCaseAlternative :: CaseAlternative -> m CaseAlternative
143− handleCaseAlternative (CaseAlternative bs val) =
144− CaseAlternative
145− <$> traverse (h' <=< h) bs
146− <*> eitherM (traverse (pairM (g' <=< g) (g' <=< g))) (g' <=< g) val
147−
148− handleDoNotationElement :: DoNotationElement -> m DoNotationElement
149− handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> (g' <=< g) v
150− handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> (h' <=< h) b <*> (g' <=< g) v
151− handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> traverse (f' <=< f) ds
152− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
153−
154−everywhereOnValuesM
155− :: forall m
156− . (Monad m)
157− => (Declaration -> m Declaration)
158− -> (Expr -> m Expr)
159− -> (Binder -> m Binder)
160− -> ( Declaration -> m Declaration
161− , Expr -> m Expr
162− , Binder -> m Binder
163− )
164−everywhereOnValuesM f g h = (f', g', h')
165− where
166−
167− f' :: Declaration -> m Declaration
168− f' (DataBindingGroupDeclaration ds) = (DataBindingGroupDeclaration <$> traverse f' ds) >>= f
169− f' (ValueDeclaration name nameKind bs val) = (ValueDeclaration name nameKind <$> traverse h' bs <*> eitherM (traverse (pairM g' g')) g' val) >>= f
170− f' (BindingGroupDeclaration ds) = (BindingGroupDeclaration <$> traverse (\(name, nameKind, val) -> (,,) name nameKind <$> g' val) ds) >>= f
171− f' (TypeClassDeclaration name args implies deps ds) = (TypeClassDeclaration name args implies deps <$> traverse f' ds) >>= f
172− f' (TypeInstanceDeclaration name cs className args ds) = (TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse f') ds) >>= f
173− f' (PositionedDeclaration pos com d) = (PositionedDeclaration pos com <$> f' d) >>= f
174− f' other = f other
175−
176− g' :: Expr -> m Expr
177− g' (Literal l) = (Literal <$> lit g' l) >>= g
178− g' (UnaryMinus v) = (UnaryMinus <$> g' v) >>= g
179− g' (BinaryNoParens op v1 v2) = (BinaryNoParens <$> g' op <*> g' v1 <*> g' v2) >>= g
180− g' (Parens v) = (Parens <$> g' v) >>= g
181− g' (TypeClassDictionaryConstructorApp name v) = (TypeClassDictionaryConstructorApp name <$> g' v) >>= g
182− g' (Accessor prop v) = (Accessor prop <$> g' v) >>= g
183− g' (ObjectUpdate obj vs) = (ObjectUpdate <$> g' obj <*> traverse (sndM g') vs) >>= g
184− g' (Abs name v) = (Abs name <$> g' v) >>= g
185− g' (App v1 v2) = (App <$> g' v1 <*> g' v2) >>= g
186− g' (IfThenElse v1 v2 v3) = (IfThenElse <$> g' v1 <*> g' v2 <*> g' v3) >>= g
187− g' (Case vs alts) = (Case <$> traverse g' vs <*> traverse handleCaseAlternative alts) >>= g
188− g' (TypedValue check v ty) = (TypedValue check <$> g' v <*> pure ty) >>= g
189− g' (Let ds v) = (Let <$> traverse f' ds <*> g' v) >>= g
190− g' (Do es) = (Do <$> traverse handleDoNotationElement es) >>= g
191− g' (PositionedValue pos com v) = (PositionedValue pos com <$> g' v) >>= g
192− g' other = g other
193−
194− h' :: Binder -> m Binder
195− h' (LiteralBinder l) = (LiteralBinder <$> lit h' l) >>= h
196− h' (ConstructorBinder ctor bs) = (ConstructorBinder ctor <$> traverse h' bs) >>= h
197− h' (BinaryNoParensBinder b1 b2 b3) = (BinaryNoParensBinder <$> h' b1 <*> h' b2 <*> h' b3) >>= h
198− h' (ParensInBinder b) = (ParensInBinder <$> h' b) >>= h
199− h' (NamedBinder name b) = (NamedBinder name <$> h' b) >>= h
200− h' (PositionedBinder pos com b) = (PositionedBinder pos com <$> h' b) >>= h
201− h' (TypedBinder t b) = (TypedBinder t <$> h' b) >>= h
202− h' other = h other
203−
204− lit :: (a -> m a) -> Literal a -> m (Literal a)
205− lit go (ObjectLiteral as) = ObjectLiteral <$> traverse (sndM go) as
206− lit go (ArrayLiteral as) = ArrayLiteral <$> traverse go as
207− lit _ other = pure other
208−
209− handleCaseAlternative :: CaseAlternative -> m CaseAlternative
210− handleCaseAlternative (CaseAlternative bs val) =
211− CaseAlternative
212− <$> traverse h' bs
213− <*> eitherM (traverse (pairM g' g')) g' val
214−
215− handleDoNotationElement :: DoNotationElement -> m DoNotationElement
216− handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> g' v
217− handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> h' b <*> g' v
218− handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> traverse f' ds
219− handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
220−
221−everythingOnValues
222− :: forall r
223− . (r -> r -> r)
224− -> (Declaration -> r)
225− -> (Expr -> r)
226− -> (Binder -> r)
227− -> (CaseAlternative -> r)
228− -> (DoNotationElement -> r)
229− -> ( Declaration -> r
230− , Expr -> r
231− , Binder -> r
232− , CaseAlternative -> r
233− , DoNotationElement -> r
234− )
235−everythingOnValues (<>) f g h i j = (f', g', h', i', j')
236− where
237−
238− f' :: Declaration -> r
239− f' d@(DataBindingGroupDeclaration ds) = foldl (<>) (f d) (map f' ds)
240− f' d@(ValueDeclaration _ _ bs (Right val)) = foldl (<>) (f d) (map h' bs) <> g' val
241− f' d@(ValueDeclaration _ _ bs (Left gs)) = foldl (<>) (f d) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
242− f' d@(BindingGroupDeclaration ds) = foldl (<>) (f d) (map (\(_, _, val) -> g' val) ds)
243− f' d@(TypeClassDeclaration _ _ _ _ ds) = foldl (<>) (f d) (map f' ds)
244− f' d@(TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldl (<>) (f d) (map f' ds)
245− f' d@(PositionedDeclaration _ _ d1) = f d <> f' d1
246− f' d = f d
247−
248− g' :: Expr -> r
249− g' v@(Literal l) = lit (g v) g' l
250− g' v@(UnaryMinus v1) = g v <> g' v1
251− g' v@(BinaryNoParens op v1 v2) = g v <> g' op <> g' v1 <> g' v2
252− g' v@(Parens v1) = g v <> g' v1
253− g' v@(TypeClassDictionaryConstructorApp _ v1) = g v <> g' v1
254− g' v@(Accessor _ v1) = g v <> g' v1
255− g' v@(ObjectUpdate obj vs) = foldl (<>) (g v <> g' obj) (map (g' . snd) vs)
256− g' v@(Abs _ v1) = g v <> g' v1
257− g' v@(App v1 v2) = g v <> g' v1 <> g' v2
258− g' v@(IfThenElse v1 v2 v3) = g v <> g' v1 <> g' v2 <> g' v3
259− g' v@(Case vs alts) = foldl (<>) (foldl (<>) (g v) (map g' vs)) (map i' alts)
260− g' v@(TypedValue _ v1 _) = g v <> g' v1
261− g' v@(Let ds v1) = foldl (<>) (g v) (map f' ds) <> g' v1
262− g' v@(Do es) = foldl (<>) (g v) (map j' es)
263− g' v@(PositionedValue _ _ v1) = g v <> g' v1
264− g' v = g v
265−
266− h' :: Binder -> r
267− h' b@(LiteralBinder l) = lit (h b) h' l
268− h' b@(ConstructorBinder _ bs) = foldl (<>) (h b) (map h' bs)
269− h' b@(BinaryNoParensBinder b1 b2 b3) = h b <> h' b1 <> h' b2 <> h' b3
270− h' b@(ParensInBinder b1) = h b <> h' b1
271− h' b@(NamedBinder _ b1) = h b <> h' b1
272− h' b@(PositionedBinder _ _ b1) = h b <> h' b1
273− h' b@(TypedBinder _ b1) = h b <> h' b1
274− h' b = h b
275−
276− lit :: r -> (a -> r) -> Literal a -> r
277− lit r go (ArrayLiteral as) = foldl (<>) r (map go as)
278− lit r go (ObjectLiteral as) = foldl (<>) r (map (go . snd) as)
279− lit r _ _ = r
280−
281− i' :: CaseAlternative -> r
282− i' ca@(CaseAlternative bs (Right val)) = foldl (<>) (i ca) (map h' bs) <> g' val
283− i' ca@(CaseAlternative bs (Left gs)) = foldl (<>) (i ca) (map h' bs ++ concatMap (\(grd, val) -> [g' grd, g' val]) gs)
284−
285− j' :: DoNotationElement -> r
286− j' e@(DoNotationValue v) = j e <> g' v
287− j' e@(DoNotationBind b v) = j e <> h' b <> g' v
288− j' e@(DoNotationLet ds) = foldl (<>) (j e) (map f' ds)
289− j' e@(PositionedDoNotationElement _ _ e1) = j e <> j' e1
290−
291−everythingWithContextOnValues
292− :: forall s r
293− . s
294− -> r
295− -> (r -> r -> r)
296− -> (s -> Declaration -> (s, r))
297− -> (s -> Expr -> (s, r))
298− -> (s -> Binder -> (s, r))
299− -> (s -> CaseAlternative -> (s, r))
300− -> (s -> DoNotationElement -> (s, r))
301− -> ( Declaration -> r
302− , Expr -> r
303− , Binder -> r
304− , CaseAlternative -> r
305− , DoNotationElement -> r)
306−everythingWithContextOnValues s0 r0 (<>) f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
307− where
308−
309− f'' :: s -> Declaration -> r
310− f'' s d = let (s', r) = f s d in r <> f' s' d
311−
312− f' :: s -> Declaration -> r
313− f' s (DataBindingGroupDeclaration ds) = foldl (<>) r0 (map (f'' s) ds)
314− f' s (ValueDeclaration _ _ bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
315− f' s (ValueDeclaration _ _ bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
316− f' s (BindingGroupDeclaration ds) = foldl (<>) r0 (map (\(_, _, val) -> g'' s val) ds)
317− f' s (TypeClassDeclaration _ _ _ _ ds) = foldl (<>) r0 (map (f'' s) ds)
318− f' s (TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldl (<>) r0 (map (f'' s) ds)
319− f' s (PositionedDeclaration _ _ d1) = f'' s d1
320− f' _ _ = r0
321−
322− g'' :: s -> Expr -> r
323− g'' s v = let (s', r) = g s v in r <> g' s' v
324−
325− g' :: s -> Expr -> r
326− g' s (Literal l) = lit g'' s l
327− g' s (UnaryMinus v1) = g'' s v1
328− g' s (BinaryNoParens op v1 v2) = g'' s op <> g'' s v1 <> g'' s v2
329− g' s (Parens v1) = g'' s v1
330− g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
331− g' s (Accessor _ v1) = g'' s v1
332− g' s (ObjectUpdate obj vs) = foldl (<>) (g'' s obj) (map (g'' s . snd) vs)
333− g' s (Abs _ v1) = g'' s v1
334− g' s (App v1 v2) = g'' s v1 <> g'' s v2
335− g' s (IfThenElse v1 v2 v3) = g'' s v1 <> g'' s v2 <> g'' s v3
336− g' s (Case vs alts) = foldl (<>) (foldl (<>) r0 (map (g'' s) vs)) (map (i'' s) alts)
337− g' s (TypedValue _ v1 _) = g'' s v1
338− g' s (Let ds v1) = foldl (<>) r0 (map (f'' s) ds) <> g'' s v1
339− g' s (Do es) = foldl (<>) r0 (map (j'' s) es)
340− g' s (PositionedValue _ _ v1) = g'' s v1
341− g' _ _ = r0
342−
343− h'' :: s -> Binder -> r
344− h'' s b = let (s', r) = h s b in r <> h' s' b
345−
346− h' :: s -> Binder -> r
347− h' s (LiteralBinder l) = lit h'' s l
348− h' s (ConstructorBinder _ bs) = foldl (<>) r0 (map (h'' s) bs)
349− h' s (BinaryNoParensBinder b1 b2 b3) = h'' s b1 <> h'' s b2 <> h'' s b3
350− h' s (ParensInBinder b) = h'' s b
351− h' s (NamedBinder _ b1) = h'' s b1
352− h' s (PositionedBinder _ _ b1) = h'' s b1
353− h' s (TypedBinder _ b1) = h'' s b1
354− h' _ _ = r0
355−
356− lit :: (s -> a -> r) -> s -> Literal a -> r
357− lit go s (ArrayLiteral as) = foldl (<>) r0 (map (go s) as)
358− lit go s (ObjectLiteral as) = foldl (<>) r0 (map (go s . snd) as)
359− lit _ _ _ = r0
360−
361− i'' :: s -> CaseAlternative -> r
362− i'' s ca = let (s', r) = i s ca in r <> i' s' ca
363−
364− i' :: s -> CaseAlternative -> r
365− i' s (CaseAlternative bs (Right val)) = foldl (<>) r0 (map (h'' s) bs) <> g'' s val
366− i' s (CaseAlternative bs (Left gs)) = foldl (<>) r0 (map (h'' s) bs ++ concatMap (\(grd, val) -> [g'' s grd, g'' s val]) gs)
367−
368− j'' :: s -> DoNotationElement -> r
369− j'' s e = let (s', r) = j s e in r <> j' s' e
370−
371− j' :: s -> DoNotationElement -> r
372− j' s (DoNotationValue v) = g'' s v
373− j' s (DoNotationBind b v) = h'' s b <> g'' s v
374− j' s (DoNotationLet ds) = foldl (<>) r0 (map (f'' s) ds)
375− j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
376−
377−everywhereWithContextOnValuesM
378− :: forall m s
379− . (Monad m)
380− => s
381− -> (s -> Declaration -> m (s, Declaration))
382− -> (s -> Expr -> m (s, Expr))
383− -> (s -> Binder -> m (s, Binder))
384− -> (s -> CaseAlternative -> m (s, CaseAlternative))
385− -> (s -> DoNotationElement -> m (s, DoNotationElement))
386− -> ( Declaration -> m Declaration
387− , Expr -> m Expr
388− , Binder -> m Binder
389− , CaseAlternative -> m CaseAlternative
390− , DoNotationElement -> m DoNotationElement)
391−everywhereWithContextOnValuesM s0 f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
392− where
393− f'' s = uncurry f' <=< f s
394−
395− f' s (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> traverse (f'' s) ds
396− f' s (ValueDeclaration name nameKind bs val) = ValueDeclaration name nameKind <$> traverse (h'' s) bs <*> eitherM (traverse (pairM (g'' s) (g'' s))) (g'' s) val
397− f' s (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> traverse (thirdM (g'' s)) ds
398− f' s (TypeClassDeclaration name args implies deps ds) = TypeClassDeclaration name args implies deps <$> traverse (f'' s) ds
399− f' s (TypeInstanceDeclaration name cs className args ds) = TypeInstanceDeclaration name cs className args <$> traverseTypeInstanceBody (traverse (f'' s)) ds
400− f' s (PositionedDeclaration pos com d1) = PositionedDeclaration pos com <$> f'' s d1
401− f' _ other = return other
402−
403− g'' s = uncurry g' <=< g s
404−
405− g' s (Literal l) = Literal <$> lit g'' s l
406− g' s (UnaryMinus v) = UnaryMinus <$> g'' s v
407− g' s (BinaryNoParens op v1 v2) = BinaryNoParens <$> g'' s op <*> g'' s v1 <*> g'' s v2
408− g' s (Parens v) = Parens <$> g'' s v
409− g' s (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> g'' s v
410− g' s (Accessor prop v) = Accessor prop <$> g'' s v
411− g' s (ObjectUpdate obj vs) = ObjectUpdate <$> g'' s obj <*> traverse (sndM (g'' s)) vs
412− g' s (Abs name v) = Abs name <$> g'' s v
413− g' s (App v1 v2) = App <$> g'' s v1 <*> g'' s v2
414− g' s (IfThenElse v1 v2 v3) = IfThenElse <$> g'' s v1 <*> g'' s v2 <*> g'' s v3
415− g' s (Case vs alts) = Case <$> traverse (g'' s) vs <*> traverse (i'' s) alts
416− g' s (TypedValue check v ty) = TypedValue check <$> g'' s v <*> pure ty
417− g' s (Let ds v) = Let <$> traverse (f'' s) ds <*> g'' s v
418− g' s (Do es) = Do <$> traverse (j'' s) es
419− g' s (PositionedValue pos com v) = PositionedValue pos com <$> g'' s v
420− g' _ other = return other
421−
422− h'' s = uncurry h' <=< h s
423−
424− h' s (LiteralBinder l) = LiteralBinder <$> lit h'' s l
425− h' s (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> traverse (h'' s) bs
426− h' s (BinaryNoParensBinder b1 b2 b3) = BinaryNoParensBinder <$> h'' s b1 <*> h'' s b2 <*> h'' s b3
427− h' s (ParensInBinder b) = ParensInBinder <$> h'' s b
428− h' s (NamedBinder name b) = NamedBinder name <$> h'' s b
429− h' s (PositionedBinder pos com b) = PositionedBinder pos com <$> h'' s b
430− h' s (TypedBinder t b) = TypedBinder t <$> h'' s b
431− h' _ other = return other
432−
433− lit :: (s -> a -> m a) -> s -> Literal a -> m (Literal a)
434− lit go s (ArrayLiteral as) = ArrayLiteral <$> traverse (go s) as
435− lit go s (ObjectLiteral as) = ObjectLiteral <$> traverse (sndM (go s)) as
436− lit _ _ other = return other
437−
438− i'' s = uncurry i' <=< i s
439−
440− i' s (CaseAlternative bs val) = CaseAlternative <$> traverse (h'' s) bs <*> eitherM (traverse (pairM (g'' s) (g'' s))) (g'' s) val
441−
442− j'' s = uncurry j' <=< j s
443−
444− j' s (DoNotationValue v) = DoNotationValue <$> g'' s v
445− j' s (DoNotationBind b v) = DoNotationBind <$> h'' s b <*> g'' s v
446− j' s (DoNotationLet ds) = DoNotationLet <$> traverse (f'' s) ds
447− j' s (PositionedDoNotationElement pos com e1) = PositionedDoNotationElement pos com <$> j'' s e1
448−
449−everythingWithScope
450− :: forall r
451− . (Monoid r)
452− => (S.Set Ident -> Declaration -> r)
453− -> (S.Set Ident -> Expr -> r)
454− -> (S.Set Ident -> Binder -> r)
455− -> (S.Set Ident -> CaseAlternative -> r)
456− -> (S.Set Ident -> DoNotationElement -> r)
457− -> ( S.Set Ident -> Declaration -> r
458− , S.Set Ident -> Expr -> r
459− , S.Set Ident -> Binder -> r
460− , S.Set Ident -> CaseAlternative -> r
461− , S.Set Ident -> DoNotationElement -> r
462− )
463−everythingWithScope f g h i j = (f'', g'', h'', i'', \s -> snd . j'' s)
464− where
465− -- Avoid importing Data.Monoid and getting shadowed names above
466− (<>) = mappend
467−
468− f'' :: S.Set Ident -> Declaration -> r
469− f'' s a = f s a <> f' s a
470−
471− f' :: S.Set Ident -> Declaration -> r
472− f' s (DataBindingGroupDeclaration ds) =
473− let s' = S.union s (S.fromList (mapMaybe getDeclIdent ds))
474− in foldMap (f'' s') ds
475− f' s (ValueDeclaration name _ bs (Right val)) =
476− let s' = S.insert name s
477− in foldMap (h'' s') bs <> g'' s' val
478− f' s (ValueDeclaration name _ bs (Left gs)) =
479− let s' = S.insert name s
480− s'' = S.union s' (S.fromList (concatMap binderNames bs))
481− in foldMap (h'' s') bs <> foldMap (\(grd, val) -> g'' s'' grd <> g'' s'' val) gs
482− f' s (BindingGroupDeclaration ds) =
483− let s' = S.union s (S.fromList (map (\(name, _, _) -> name) ds))
484− in foldMap (\(_, _, val) -> g'' s' val) ds
485− f' s (TypeClassDeclaration _ _ _ _ ds) = foldMap (f'' s) ds
486− f' s (TypeInstanceDeclaration _ _ _ _ (ExplicitInstance ds)) = foldMap (f'' s) ds
487− f' s (PositionedDeclaration _ _ d) = f'' s d
488− f' _ _ = mempty
489−
490− g'' :: S.Set Ident -> Expr -> r
491− g'' s a = g s a <> g' s a
492−
493− g' :: S.Set Ident -> Expr -> r
494− g' s (Literal l) = lit g'' s l
495− g' s (UnaryMinus v1) = g'' s v1
496− g' s (BinaryNoParens op v1 v2) = g'' s op <> g'' s v1 <> g'' s v2
497− g' s (Parens v1) = g'' s v1
498− g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
499− g' s (Accessor _ v1) = g'' s v1
500− g' s (ObjectUpdate obj vs) = g'' s obj <> foldMap (g'' s . snd) vs
501− g' s (Abs (Left name) v1) =
502− let s' = S.insert name s
503− in g'' s' v1
504− g' s (Abs (Right b) v1) =
505− let s' = S.union (S.fromList (binderNames b)) s
506− in g'' s' v1
507− g' s (App v1 v2) = g'' s v1 <> g'' s v2
508− g' s (IfThenElse v1 v2 v3) = g'' s v1 <> g'' s v2 <> g'' s v3
509− g' s (Case vs alts) = foldMap (g'' s) vs <> foldMap (i'' s) alts
510− g' s (TypedValue _ v1 _) = g'' s v1
511− g' s (Let ds v1) =
512− let s' = S.union s (S.fromList (mapMaybe getDeclIdent ds))
513− in foldMap (f'' s') ds <> g'' s' v1
514− g' s (Do es) = fold . snd . mapAccumL j'' s $ es
515− g' s (PositionedValue _ _ v1) = g'' s v1
516− g' _ _ = mempty
517−
518− h'' :: S.Set Ident -> Binder -> r
519− h'' s a = h s a <> h' s a
520−
521− h' :: S.Set Ident -> Binder -> r
522− h' s (LiteralBinder l) = lit h'' s l
523− h' s (ConstructorBinder _ bs) = foldMap (h'' s) bs
524− h' s (BinaryNoParensBinder b1 b2 b3) = foldMap (h'' s) [b1, b2, b3]
525− h' s (ParensInBinder b) = h'' s b
526− h' s (NamedBinder name b1) = h'' (S.insert name s) b1
527− h' s (PositionedBinder _ _ b1) = h'' s b1
528− h' s (TypedBinder _ b1) = h'' s b1
529− h' _ _ = mempty
530−
531− lit :: (S.Set Ident -> a -> r) -> S.Set Ident -> Literal a -> r
532− lit go s (ArrayLiteral as) = foldMap (go s) as
533− lit go s (ObjectLiteral as) = foldMap (go s . snd) as
534− lit _ _ _ = mempty
535−
536− i'' :: S.Set Ident -> CaseAlternative -> r
537− i'' s a = i s a <> i' s a
538−
539− i' :: S.Set Ident -> CaseAlternative -> r
540− i' s (CaseAlternative bs (Right val)) =
541− let s' = S.union s (S.fromList (concatMap binderNames bs))
542− in foldMap (h'' s) bs <> g'' s' val
543− i' s (CaseAlternative bs (Left gs)) =
544− let s' = S.union s (S.fromList (concatMap binderNames bs))
545− in foldMap (h'' s) bs <> foldMap (\(grd, val) -> g'' s' grd <> g'' s' val) gs
546−
547− j'' :: S.Set Ident -> DoNotationElement -> (S.Set Ident, r)
548− j'' s a = let (s', r) = j' s a in (s', j s a <> r)
549−
550− j' :: S.Set Ident -> DoNotationElement -> (S.Set Ident, r)
551− j' s (DoNotationValue v) = (s, g'' s v)
552− j' s (DoNotationBind b v) =
553− let s' = S.union (S.fromList (binderNames b)) s
554− in (s', h'' s b <> g'' s' v)
555− j' s (DoNotationLet ds) =
556− let s' = S.union s (S.fromList (mapMaybe getDeclIdent ds))
557− in (s', foldMap (f'' s') ds)
558− j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
559−
560− getDeclIdent :: Declaration -> Maybe Ident
561− getDeclIdent (PositionedDeclaration _ _ d) = getDeclIdent d
562− getDeclIdent (ValueDeclaration ident _ _ _) = Just ident
563− getDeclIdent (TypeDeclaration ident _) = Just ident
564− getDeclIdent _ = Nothing
565−
566−accumTypes
567− :: (Monoid r)
568− => (Type -> r)
569− -> ( Declaration -> r
570− , Expr -> r
571− , Binder -> r
572− , CaseAlternative -> r
573− , DoNotationElement -> r
574− )
575−accumTypes f = everythingOnValues mappend forDecls forValues (const mempty) (const mempty) (const mempty)
576− where
577− forDecls (DataDeclaration _ _ _ dctors) = mconcat (concatMap (map f . snd) dctors)
578− forDecls (ExternDeclaration _ ty) = f ty
579− forDecls (TypeClassDeclaration _ _ implies _ _) = mconcat (concatMap (map f . constraintArgs) implies)
580− forDecls (TypeInstanceDeclaration _ cs _ tys _) = mconcat (concatMap (map f . constraintArgs) cs) `mappend` mconcat (map f tys)
581− forDecls (TypeSynonymDeclaration _ _ ty) = f ty
582− forDecls (TypeDeclaration _ ty) = f ty
583− forDecls _ = mempty
584−
585− forValues (TypeClassDictionary c _ _) = mconcat (map f (constraintArgs c))
586− forValues (DeferredDictionary _ tys) = mconcat (map f tys)
587− forValues (TypedValue _ _ ty) = f ty
588− forValues _ = mempty
src/Language/PureScript/Bundle.hsdeleted−635
@@ -1,635 +0,0 @@
1−-- |
2−-- Bundles compiled PureScript modules for the browser.
3−--
4−-- This module takes as input the individual generated modules from 'Language.PureScript.Make' and
5−-- performs dead code elimination, filters empty modules,
6−-- and generates the final Javascript bundle.
7−module Language.PureScript.Bundle
8− ( bundle
9− , guessModuleIdentifier
10− , ModuleIdentifier(..)
11− , moduleName
12− , ModuleType(..)
13− , ErrorMessage(..)
14− , printErrorMessage
15− , getExportedIdentifiers
16− ) where
17−
18−import Prelude.Compat
19−
20−import Control.Monad
21−import Control.Monad.Error.Class
22−
23−import Data.Char (chr, digitToInt)
24−import Data.Generics (everything, everywhere, mkQ, mkT)
25−import Data.Graph
26−import Data.List (nub, stripPrefix)
27−import Data.Maybe (mapMaybe, catMaybes)
28−import Data.Version (showVersion)
29−import qualified Data.Set as S
30−
31−import Language.JavaScript.Parser
32−import Language.JavaScript.Parser.AST
33−
34−import qualified Paths_purescript as Paths
35−
36−import System.FilePath (takeFileName, takeDirectory)
37−
38−-- | The type of error messages. We separate generation and rendering of errors using a data
39−-- type, in case we need to match on error types later.
40−data ErrorMessage
41− = UnsupportedModulePath String
42− | InvalidTopLevel
43− | UnableToParseModule String
44− | UnsupportedExport
45− | ErrorInModule ModuleIdentifier ErrorMessage
46− | MissingEntryPoint String
47− | MissingMainModule String
48− deriving (Show)
49−
50−-- | Modules are either "regular modules" (i.e. those generated by psc) or foreign modules.
51−data ModuleType
52− = Regular
53− | Foreign
54− deriving (Show, Eq, Ord)
55−
56−showModuleType :: ModuleType -> String
57−showModuleType Regular = "Regular"
58−showModuleType Foreign = "Foreign"
59−
60−-- | A module is identified by its module name and its type.
61−data ModuleIdentifier = ModuleIdentifier String ModuleType deriving (Show, Eq, Ord)
62−
63−moduleName :: ModuleIdentifier -> String
64−moduleName (ModuleIdentifier name _) = name
65−
66−-- | Given a filename, assuming it is in the correct place on disk, infer a ModuleIdentifier.
67−guessModuleIdentifier :: MonadError ErrorMessage m => FilePath -> m ModuleIdentifier
68−guessModuleIdentifier filename = ModuleIdentifier (takeFileName (takeDirectory filename)) <$> guessModuleType (takeFileName filename)
69− where
70− guessModuleType "index.js" = pure Regular
71− guessModuleType "foreign.js" = pure Foreign
72− guessModuleType name = throwError $ UnsupportedModulePath name
73−
74−-- | A piece of code is identified by its module and its name. These keys are used to label vertices
75−-- in the dependency graph.
76−type Key = (ModuleIdentifier, String)
77−
78−-- | An export is either a "regular export", which exports a name from the regular module we are in,
79−-- or a reexport of a declaration in the corresponding foreign module.
80−--
81−-- Regular exports are labelled, since they might re-export an operator with another name.
82−data ExportType
83− = RegularExport String
84− | ForeignReexport
85− deriving (Show, Eq, Ord)
86−
87−-- | There are four types of module element we are interested in:
88−--
89−-- 1) Require statements
90−-- 2) Member declarations
91−-- 3) Export lists
92−-- 4) Everything else
93−--
94−-- Each is labelled with the original AST node which generated it, so that we can dump it back
95−-- into the output during codegen.
96−data ModuleElement
97− = Require JSStatement String (Either String ModuleIdentifier)
98− | Member JSStatement Bool String JSExpression [Key]
99− | ExportsList [(ExportType, String, JSExpression, [Key])]
100− | Other JSStatement
101− deriving (Show)
102−
103−-- | A module is just a list of elements of the types listed above.
104−data Module = Module ModuleIdentifier [ModuleElement] deriving (Show)
105−
106−-- | Prepare an error message for consumption by humans.
107−printErrorMessage :: ErrorMessage -> [String]
108−printErrorMessage (UnsupportedModulePath s) =
109− [ "A CommonJS module has an unsupported name (" ++ show s ++ ")."
110− , "The following file names are supported:"
111− , " 1) index.js (psc native modules)"
112− , " 2) foreign.js (psc foreign modules)"
113− ]
114−printErrorMessage InvalidTopLevel =
115− [ "Expected a list of source elements at the top level." ]
116−printErrorMessage (UnableToParseModule err) =
117− [ "The module could not be parsed:"
118− , err
119− ]
120−printErrorMessage UnsupportedExport =
121− [ "An export was unsupported. Exports can be defined in one of two ways: "
122− , " 1) exports.name = ..."
123− , " 2) exports = { ... }"
124− ]
125−printErrorMessage (ErrorInModule mid e) =
126− ("Error in module " ++ displayIdentifier mid ++ ":")
127− : ""
128− : map (" " ++) (printErrorMessage e)
129− where
130− displayIdentifier (ModuleIdentifier name ty) =
131− name ++ " (" ++ showModuleType ty ++ ")"
132−printErrorMessage (MissingEntryPoint mName) =
133− [ "Couldn't find a CommonJS module for the specified entry point: " ++ mName
134− ]
135−printErrorMessage (MissingMainModule mName) =
136− [ "Couldn't find a CommonJS module for the specified main module: " ++ mName
137− ]
138−
139−-- | Calculate the ModuleIdentifier which a require(...) statement imports.
140−checkImportPath :: String -> ModuleIdentifier -> S.Set String -> Either String ModuleIdentifier
141−checkImportPath "./foreign" m _ =
142− Right (ModuleIdentifier (moduleName m) Foreign)
143−checkImportPath name _ names
144− | Just name' <- stripPrefix "../" name
145− , name' `S.member` names = Right (ModuleIdentifier name' Regular)
146−checkImportPath name _ _ = Left name
147−
148−-- | Compute the dependencies of all elements in a module, and add them to the tree.
149−--
150−-- Members and exports can have dependencies. A dependency is of one of the following forms:
151−--
152−-- 1) module.name or member["name"]
153−--
154−-- where module was imported using
155−--
156−-- var module = require("Module.Name");
157−--
158−-- 2) name
159−--
160−-- where name is the name of a member defined in the current module.
161−withDeps :: Module -> Module
162−withDeps (Module modulePath es) = Module modulePath (map expandDeps es)
163− where
164− -- | Collects all modules which are imported, so that we can identify dependencies of the first type.
165− imports :: [(String, ModuleIdentifier)]
166− imports = mapMaybe toImport es
167− where
168− toImport :: ModuleElement -> Maybe (String, ModuleIdentifier)
169− toImport (Require _ nm (Right mid)) = Just (nm, mid)
170− toImport _ = Nothing
171−
172− -- | Collects all member names in scope, so that we can identify dependencies of the second type.
173− boundNames :: [String]
174− boundNames = mapMaybe toBoundName es
175− where
176− toBoundName :: ModuleElement -> Maybe String
177− toBoundName (Member _ _ nm _ _) = Just nm
178− toBoundName _ = Nothing
179−
180− -- | Calculate dependencies and add them to the current element.
181− expandDeps :: ModuleElement -> ModuleElement
182− expandDeps (Member n f nm decl _) = Member n f nm decl (nub $ dependencies modulePath decl)
183− expandDeps (ExportsList exps) = ExportsList (map expand exps)
184− where
185− expand (ty, nm, n1, _) = (ty, nm, n1, nub (dependencies modulePath n1))
186− expandDeps other = other
187−
188− dependencies :: ModuleIdentifier -> JSExpression -> [(ModuleIdentifier, String)]
189− dependencies m = everything (++) (mkQ [] toReference)
190− where
191− toReference :: JSExpression -> [(ModuleIdentifier, String)]
192− toReference (JSMemberDot mn _ nm)
193− | JSIdentifier _ mn' <- mn
194− , JSIdentifier _ nm' <- nm
195− , Just mid <- lookup mn' imports
196− = [(mid, nm')]
197− toReference (JSMemberSquare mn _ nm _)
198− | JSIdentifier _ mn' <- mn
199− , Just nm' <- fromStringLiteral nm
200− , Just mid <- lookup mn' imports
201− = [(mid, nm')]
202− toReference (JSIdentifier _ nm)
203− | nm `elem` boundNames
204− = [(m, nm)]
205− toReference _ = []
206−
207−-- String literals include the quote chars
208−fromStringLiteral :: JSExpression -> Maybe String
209−fromStringLiteral (JSStringLiteral _ str) = Just $ strValue str
210−fromStringLiteral _ = Nothing
211−
212−strValue :: String -> String
213−strValue str = go $ drop 1 str
214− where
215− go ('\\' : 'b' : xs) = '\b' : go xs
216− go ('\\' : 'f' : xs) = '\f' : go xs
217− go ('\\' : 'n' : xs) = '\n' : go xs
218− go ('\\' : 'r' : xs) = '\r' : go xs
219− go ('\\' : 't' : xs) = '\t' : go xs
220− go ('\\' : 'v' : xs) = '\v' : go xs
221− go ('\\' : '0' : xs) = '\0' : go xs
222− go ('\\' : 'x' : a : b : xs) = chr (a' + b') : go xs
223− where
224− a' = 16 * digitToInt a
225− b' = digitToInt b
226− go ('\\' : 'u' : a : b : c : d : xs) = chr (a' + b' + c' + d') : go xs
227− where
228− a' = 16 * 16 * 16 * digitToInt a
229− b' = 16 * 16 * digitToInt b
230− c' = 16 * digitToInt c
231− d' = digitToInt d
232− go ('\\' : x : xs) = x : go xs
233− go "\"" = ""
234− go "'" = ""
235− go (x : xs) = x : go xs
236− go "" = ""
237−
238−commaList :: JSCommaList a -> [a]
239−commaList JSLNil = []
240−commaList (JSLOne x) = [x]
241−commaList (JSLCons l _ x) = commaList l ++ [x]
242−
243−trailingCommaList :: JSCommaTrailingList a -> [a]
244−trailingCommaList (JSCTLComma l _) = commaList l
245−trailingCommaList (JSCTLNone l) = commaList l
246−
247−-- | Attempt to create a Module from a Javascript AST.
248−--
249−-- Each type of module element is matched using pattern guards, and everything else is bundled into the
250−-- Other constructor.
251−toModule :: forall m. (MonadError ErrorMessage m) => S.Set String -> ModuleIdentifier -> JSAST -> m Module
252−toModule mids mid top
253− | JSAstProgram smts _ <- top = Module mid <$> traverse toModuleElement smts
254− | otherwise = err InvalidTopLevel
255− where
256− err = throwError . ErrorInModule mid
257−
258− toModuleElement :: JSStatement -> m ModuleElement
259− toModuleElement stmt
260− | Just (importName, importPath) <- matchRequire mids mid stmt
261− = pure (Require stmt importName importPath)
262− toModuleElement stmt
263− | Just (exported, name, decl) <- matchMember stmt
264− = pure (Member stmt exported name decl [])
265− toModuleElement stmt
266− | Just props <- matchExportsAssignment stmt
267− = ExportsList <$> traverse toExport (trailingCommaList props)
268− where
269− toExport :: JSObjectProperty -> m (ExportType, String, JSExpression, [Key])
270− toExport (JSPropertyNameandValue name _ [val]) =
271− (,,val,[]) <$> exportType val
272− <*> extractLabel' name
273− toExport _ = err UnsupportedExport
274−
275− exportType :: JSExpression -> m ExportType
276− exportType (JSMemberDot f _ _)
277− | JSIdentifier _ "$foreign" <- f
278− = pure ForeignReexport
279− exportType (JSMemberSquare f _ _ _)
280− | JSIdentifier _ "$foreign" <- f
281− = pure ForeignReexport
282− exportType (JSIdentifier _ s) = pure (RegularExport s)
283− exportType _ = err UnsupportedExport
284−
285− extractLabel' = maybe (err UnsupportedExport) pure . extractLabel
286−
287− toModuleElement other = pure (Other other)
288−
289−-- Get a list of all the exported identifiers from a foreign module.
290−--
291−-- TODO: what if we assign to exports.foo and then later assign to
292−-- module.exports (presumably overwriting exports.foo)?
293−getExportedIdentifiers :: (MonadError ErrorMessage m)
294− => String
295− -> JSAST
296− -> m [String]
297−getExportedIdentifiers mname top
298− | JSAstProgram stmts _ <- top = concat <$> traverse go stmts
299− | otherwise = err InvalidTopLevel
300− where
301− err = throwError . ErrorInModule (ModuleIdentifier mname Foreign)
302−
303− go stmt
304− | Just props <- matchExportsAssignment stmt
305− = traverse toIdent (trailingCommaList props)
306− | Just (True, name, _) <- matchMember stmt
307− = pure [name]
308− | otherwise
309− = pure []
310−
311− toIdent (JSPropertyNameandValue name _ [_]) =
312− extractLabel' name
313− toIdent _ =
314− err UnsupportedExport
315−
316− extractLabel' = maybe (err UnsupportedExport) pure . extractLabel
317−
318−-- Matches JS statements like this:
319−-- var ModuleName = require("file");
320−matchRequire :: S.Set String
321− -> ModuleIdentifier
322− -> JSStatement
323− -> Maybe (String, Either String ModuleIdentifier)
324−matchRequire mids mid stmt
325− | JSVariable _ jsInit _ <- stmt
326− , [JSVarInitExpression var varInit] <- commaList jsInit
327− , JSIdentifier _ importName <- var
328− , JSVarInit _ jsInitEx <- varInit
329− , JSMemberExpression req _ argsE _ <- jsInitEx
330− , JSIdentifier _ "require" <- req
331− , [ Just importPath ] <- map fromStringLiteral (commaList argsE)
332− , importPath' <- checkImportPath importPath mid mids
333− = Just (importName, importPath')
334− | otherwise
335− = Nothing
336−
337−-- Matches JS member declarations.
338−matchMember :: JSStatement -> Maybe (Bool, String, JSExpression)
339−matchMember stmt
340− -- var foo = expr;
341− | JSVariable _ jsInit _ <- stmt
342− , [JSVarInitExpression var varInit] <- commaList jsInit
343− , JSIdentifier _ name <- var
344− , JSVarInit _ decl <- varInit
345− = Just (False, name, decl)
346− -- exports.foo = expr; exports["foo"] = expr;
347− | JSAssignStatement e (JSAssign _) decl _ <- stmt
348− , Just name <- accessor e
349− = Just (True, name, decl)
350− | otherwise
351− = Nothing
352− where
353− accessor :: JSExpression -> Maybe String
354− accessor (JSMemberDot exports _ nm)
355− | JSIdentifier _ "exports" <- exports
356− , JSIdentifier _ name <- nm
357− = Just name
358− accessor (JSMemberSquare exports _ nm _)
359− | JSIdentifier _ "exports" <- exports
360− , Just name <- fromStringLiteral nm
361− = Just name
362− accessor _ = Nothing
363−
364−-- Matches assignments to module.exports, like this:
365−-- module.exports = { ... }
366−matchExportsAssignment :: JSStatement -> Maybe JSObjectPropertyList
367−matchExportsAssignment stmt
368− | JSAssignStatement e (JSAssign _) decl _ <- stmt
369− , JSMemberDot module' _ exports <- e
370− , JSIdentifier _ "module" <- module'
371− , JSIdentifier _ "exports" <- exports
372− , JSObjectLiteral _ props _ <- decl
373− = Just props
374− | otherwise
375− = Nothing
376−
377−extractLabel :: JSPropertyName -> Maybe String
378−extractLabel (JSPropertyString _ nm) = Just $ strValue nm
379−extractLabel (JSPropertyIdent _ nm) = Just nm
380−extractLabel _ = Nothing
381−
382−-- | Eliminate unused code based on the specified entry point set.
383−compile :: [Module] -> [ModuleIdentifier] -> [Module]
384−compile modules [] = modules
385−compile modules entryPoints = filteredModules
386− where
387− (graph, _, vertexFor) = graphFromEdges verts
388−
389− -- | The vertex set
390− verts :: [(ModuleElement, Key, [Key])]
391− verts = do
392− Module mid els <- modules
393− concatMap (toVertices mid) els
394− where
395− -- | Create a set of vertices for a module element.
396− --
397− -- Some special cases worth commenting on:
398− --
399− -- 1) Regular exports which simply export their own name do not count as dependencies.
400− -- Regular exports which rename and reexport an operator do count, however.
401− --
402− -- 2) Require statements don't contribute towards dependencies, since they effectively get
403− -- inlined wherever they are used inside other module elements.
404− toVertices :: ModuleIdentifier -> ModuleElement -> [(ModuleElement, Key, [Key])]
405− toVertices p m@(Member _ _ nm _ deps) = [(m, (p, nm), deps)]
406− toVertices p m@(ExportsList exps) = mapMaybe toVertex exps
407− where
408− toVertex (ForeignReexport, nm, _, ks) = Just (m, (p, nm), ks)
409− toVertex (RegularExport nm, nm1, _, ks) | nm /= nm1 = Just (m, (p, nm1), ks)
410− toVertex _ = Nothing
411− toVertices _ _ = []
412−
413− -- | The set of vertices whose connected components we are interested in keeping.
414− entryPointVertices :: [Vertex]
415− entryPointVertices = catMaybes $ do
416− (_, k@(mid, _), _) <- verts
417− guard $ mid `elem` entryPoints
418− return (vertexFor k)
419−
420− -- | The set of vertices reachable from an entry point
421− reachableSet :: S.Set Vertex
422− reachableSet = S.fromList (concatMap (reachable graph) entryPointVertices)
423−
424− filteredModules :: [Module]
425− filteredModules = map filterUsed modules
426− where
427− filterUsed :: Module -> Module
428− filterUsed (Module mid ds) = Module mid (map filterExports (go ds))
429− where
430− go :: [ModuleElement] -> [ModuleElement]
431− go [] = []
432− go (d : rest)
433− | not (isDeclUsed d) = go rest
434− | otherwise = d : go rest
435−
436− -- | Filter out the exports for members which aren't used.
437− filterExports :: ModuleElement -> ModuleElement
438− filterExports (ExportsList exps) = ExportsList (filter (\(_, nm, _, _) -> isKeyUsed (mid, nm)) exps)
439− filterExports me = me
440−
441− isDeclUsed :: ModuleElement -> Bool
442− isDeclUsed (Member _ _ nm _ _) = isKeyUsed (mid, nm)
443− isDeclUsed _ = True
444−
445− isKeyUsed :: Key -> Bool
446− isKeyUsed k
447− | Just me <- vertexFor k = me `S.member` reachableSet
448− | otherwise = False
449−
450−-- | Topologically sort the module dependency graph, so that when we generate code, modules can be
451−-- defined in the right order.
452−sortModules :: [Module] -> [Module]
453−sortModules modules = map (\v -> case nodeFor v of (n, _, _) -> n) (reverse (topSort graph))
454− where
455− (graph, nodeFor, _) = graphFromEdges $ do
456− m@(Module mid els) <- modules
457− return (m, mid, mapMaybe getKey els)
458−
459− getKey :: ModuleElement -> Maybe ModuleIdentifier
460− getKey (Require _ _ (Right mi)) = Just mi
461− getKey _ = Nothing
462−
463−-- | A module is empty if it contains no exported members (in other words,
464−-- if the only things left after dead code elimination are module imports and
465−-- "other" foreign code).
466−--
467−-- If a module is empty, we don't want to generate code for it.
468−isModuleEmpty :: Module -> Bool
469−isModuleEmpty (Module _ els) = all isElementEmpty els
470− where
471− isElementEmpty :: ModuleElement -> Bool
472− isElementEmpty (ExportsList exps) = null exps
473− isElementEmpty Require{} = True
474− isElementEmpty (Other _) = True
475− isElementEmpty _ = False
476−
477−-- | Generate code for a set of modules, including a call to main().
478−--
479−-- Modules get defined on the global PS object, as follows:
480−--
481−-- var PS = { };
482−-- (function(exports) {
483−-- ...
484−-- })(PS["Module.Name"] = PS["Module.Name"] || {});
485−--
486−-- In particular, a module and its foreign imports share the same namespace inside PS.
487−-- This saves us from having to generate unique names for a module and its foreign imports,
488−-- and is safe since a module shares a namespace with its foreign imports in PureScript as well
489−-- (so there is no way to have overlaps in code generated by psc).
490−codeGen :: Maybe String -- ^ main module
491− -> String -- ^ namespace
492− -> [Module] -- ^ input modules
493− -> String
494−codeGen optionsMainModule optionsNamespace ms = renderToString (JSAstProgram (prelude : concatMap moduleToJS ms ++ maybe [] runMain optionsMainModule) JSNoAnnot)
495− where
496− moduleToJS :: Module -> [JSStatement]
497− moduleToJS (Module mn ds) = wrap (moduleName mn) (indent (concatMap declToJS ds))
498− where
499− declToJS :: ModuleElement -> [JSStatement]
500− declToJS (Member n _ _ _ _) = [n]
501− declToJS (Other n) = [n]
502− declToJS (Require _ nm req) =
503− [
504− JSVariable lfsp
505− (cList [
506− JSVarInitExpression (JSIdentifier sp nm)
507− (JSVarInit sp $ either require (moduleReference sp . moduleName) req )
508− ]) (JSSemi JSNoAnnot)
509− ]
510− declToJS (ExportsList exps) = map toExport exps
511−
512− where
513− toExport :: (ExportType, String, JSExpression, [Key]) -> JSStatement
514− toExport (_, nm, val, _) =
515− JSAssignStatement
516− (JSMemberSquare (JSIdentifier lfsp "exports") JSNoAnnot
517− (str nm) JSNoAnnot)
518− (JSAssign sp)
519− val
520− (JSSemi JSNoAnnot)
521−
522− -- comma lists are reverse-consed
523− cList :: [a] -> JSCommaList a
524− cList [] = JSLNil
525− cList [x] = JSLOne x
526− cList l = go $ reverse l
527− where
528− go [x] = JSLOne x
529− go (h:t)= JSLCons (go t) JSNoAnnot h
530− go [] = error "Invalid case in comma-list"
531−
532− indent :: [JSStatement] -> [JSStatement]
533− indent = everywhere (mkT squash)
534− where
535− squash JSNoAnnot = JSAnnot (TokenPn 0 0 2) []
536− squash (JSAnnot pos ann) = JSAnnot (keepCol pos) (map splat ann)
537−
538− splat (CommentA pos s) = CommentA (keepCol pos) s
539− splat (WhiteSpace pos w) = WhiteSpace (keepCol pos) w
540− splat ann = ann
541−
542− keepCol (TokenPn _ _ c) = TokenPn 0 0 (if c >= 0 then c + 2 else 2)
543−
544− prelude :: JSStatement
545− prelude = JSVariable (JSAnnot tokenPosnEmpty [ CommentA tokenPosnEmpty $ "// Generated by psc-bundle " ++ showVersion Paths.version
546− , WhiteSpace tokenPosnEmpty "\n" ])
547− (cList [
548− JSVarInitExpression (JSIdentifier sp optionsNamespace)
549− (JSVarInit sp (emptyObj sp))
550− ]) (JSSemi JSNoAnnot)
551−
552− require :: String -> JSExpression
553− require mn =
554− JSMemberExpression (JSIdentifier JSNoAnnot "require") JSNoAnnot (cList [ str mn ]) JSNoAnnot
555−
556− moduleReference :: JSAnnot -> String -> JSExpression
557− moduleReference a mn =
558− JSMemberSquare (JSIdentifier a optionsNamespace) JSNoAnnot
559− (str mn) JSNoAnnot
560−
561− str :: String -> JSExpression
562− str s = JSStringLiteral JSNoAnnot $ "\"" ++ s ++ "\""
563−
564−
565− emptyObj :: JSAnnot -> JSExpression
566− emptyObj a = JSObjectLiteral a (JSCTLNone JSLNil) JSNoAnnot
567−
568− wrap :: String -> [JSStatement] -> [JSStatement]
569− wrap mn ds =
570− [
571− JSMethodCall (JSExpressionParen lf (JSFunctionExpression JSNoAnnot JSIdentNone JSNoAnnot
572− (JSLOne (JSIdentName JSNoAnnot "exports")) JSNoAnnot
573− (JSBlock sp (lfHead ds) lf)) -- \n not quite in right place
574− JSNoAnnot)
575− JSNoAnnot
576− (JSLOne (JSAssignExpression (moduleReference JSNoAnnot mn) (JSAssign sp)
577− (JSExpressionBinary (moduleReference sp mn) (JSBinOpOr sp) (emptyObj sp))))
578− JSNoAnnot
579− (JSSemi JSNoAnnot)
580− ]
581− where
582− lfHead (h:t) = addAnn (WhiteSpace tokenPosnEmpty "\n ") h : t
583− lfHead x = x
584−
585− addAnn :: CommentAnnotation -> JSStatement -> JSStatement
586− addAnn a (JSExpressionStatement (JSStringLiteral ann s) _) =
587− JSExpressionStatement (JSStringLiteral (appendAnn a ann) s) (JSSemi JSNoAnnot)
588− addAnn _ x = x
589−
590− appendAnn a JSNoAnnot = JSAnnot tokenPosnEmpty [a]
591− appendAnn a (JSAnnot _ anns) = JSAnnot tokenPosnEmpty (a:anns ++ [WhiteSpace tokenPosnEmpty " "])
592−
593− runMain :: String -> [JSStatement]
594− runMain mn =
595− [JSMethodCall
596− (JSMemberDot (moduleReference lf mn) JSNoAnnot
597− (JSIdentifier JSNoAnnot "main"))
598− JSNoAnnot (cList []) JSNoAnnot (JSSemi JSNoAnnot)]
599−
600− lf :: JSAnnot
601− lf = JSAnnot tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n" ]
602−
603−
604− lfsp :: JSAnnot
605− lfsp = JSAnnot tokenPosnEmpty [ WhiteSpace tokenPosnEmpty "\n " ]
606−
607− sp :: JSAnnot
608− sp = JSAnnot tokenPosnEmpty [ WhiteSpace tokenPosnEmpty " " ]
609−
610−-- | The bundling function.
611−-- This function performs dead code elimination, filters empty modules
612−-- and generates and prints the final Javascript bundle.
613−bundle :: (MonadError ErrorMessage m)
614− => [(ModuleIdentifier, String)] -- ^ The input modules. Each module should be javascript rendered from 'Language.PureScript.Make' or @psc@.
615− -> [ModuleIdentifier] -- ^ Entry points. These module identifiers are used as the roots for dead-code elimination
616− -> Maybe String -- ^ An optional main module.
617− -> String -- ^ The namespace (e.g. PS).
618− -> m String
619−bundle inputStrs entryPoints mainModule namespace = do
620− forM_ mainModule $ \mname ->
621− when (mname `notElem` map (moduleName . fst) inputStrs) (throwError (MissingMainModule mname))
622− forM_ entryPoints $ \mIdent ->
623− when (mIdent `notElem` map fst inputStrs) (throwError (MissingEntryPoint (moduleName mIdent)))
624− input <- forM inputStrs $ \(ident, js) -> do
625− ast <- either (throwError . ErrorInModule ident . UnableToParseModule) pure $ parse js (moduleName ident)
626− return (ident, ast)
627−
628− let mids = S.fromList (map (moduleName . fst) input)
629−
630− modules <- traverse (fmap withDeps . uncurry (toModule mids)) input
631−
632− let compiled = compile modules entryPoints
633− sorted = sortModules (filter (not . isModuleEmpty) compiled)
634−
635− return (codeGen mainModule namespace sorted)
src/Language/PureScript/CodeGen.hsdeleted−8
@@ -1,8 +0,0 @@
1−-- |
2−-- A collection of modules related to code generation:
3−--
4−-- [@Language.PureScript.CodeGen.JS@] Code generator for Javascript
5−--
6−module Language.PureScript.CodeGen (module C) where
7−
8−import Language.PureScript.CodeGen.JS as C
src/Language/PureScript/CodeGen/JS.hsdeleted−449
@@ -1,449 +0,0 @@
1−-- |
2−-- This module generates code in the simplified Javascript intermediate representation from Purescript code
3−--
4−module Language.PureScript.CodeGen.JS
5− ( module AST
6− , module Common
7− , moduleToJs
8− ) where
9−
10−import Prelude.Compat
11−
12−import Control.Arrow ((&&&))
13−import Control.Monad (replicateM, forM, void)
14−import Control.Monad.Error.Class (MonadError(..))
15−import Control.Monad.Reader (MonadReader, asks)
16−import Control.Monad.Supply.Class
17−
18−import Data.List ((\\), delete, intersect, nub)
19−import Data.Maybe (isNothing, fromMaybe)
20−import qualified Data.Foldable as F
21−import qualified Data.Map as M
22−import qualified Data.Traversable as T
23−
24−import Language.PureScript.AST.SourcePos
25−import Language.PureScript.CodeGen.JS.AST as AST
26−import Language.PureScript.CodeGen.JS.Common as Common
27−import Language.PureScript.CodeGen.JS.Optimizer
28−import Language.PureScript.CoreFn
29−import Language.PureScript.Crash
30−import Language.PureScript.Errors (ErrorMessageHint(..), SimpleErrorMessage(..),
31− MultipleErrors(..), rethrow,
32− errorMessage, rethrowWithPosition, addHint)
33−import Language.PureScript.Names
34−import Language.PureScript.Options
35−import Language.PureScript.Traversals (sndM)
36−import qualified Language.PureScript.Constants as C
37−
38−import System.FilePath.Posix ((</>))
39−
40−-- |
41−-- Generate code in the simplified Javascript intermediate representation for all declarations in a
42−-- module.
43−--
44−moduleToJs
45− :: forall m
46− . (Monad m, MonadReader Options m, MonadSupply m, MonadError MultipleErrors m)
47− => Module Ann
48− -> Maybe JS
49− -> m [JS]
50−moduleToJs (Module coms mn imps exps foreigns decls) foreign_ =
51− rethrow (addHint (ErrorInModule mn)) $ do
52− let usedNames = concatMap getNames decls
53− let mnLookup = renameImports usedNames imps
54− jsImports <- T.traverse (importToJs mnLookup) . delete (ModuleName [ProperName C.prim]) . (\\ [mn]) $ nub $ map snd imps
55− let decls' = renameModules mnLookup decls
56− jsDecls <- mapM bindToJs decls'
57− optimized <- T.traverse (T.traverse optimize) jsDecls
58− F.traverse_ (F.traverse_ checkIntegers) optimized
59− comments <- not <$> asks optionsNoComments
60− let strict = JSStringLiteral Nothing "use strict"
61− let header = if comments && not (null coms) then JSComment Nothing coms strict else strict
62− let foreign' = [JSVariableIntroduction Nothing "$foreign" foreign_ | not $ null foreigns || isNothing foreign_]
63− let moduleBody = header : foreign' ++ jsImports ++ concat optimized
64− let foreignExps = exps `intersect` (fst `map` foreigns)
65− let standardExps = exps \\ foreignExps
66− let exps' = JSObjectLiteral Nothing $ map (runIdent &&& JSVar Nothing . identToJs) standardExps
67− ++ map (runIdent &&& foreignIdent) foreignExps
68− return $ moduleBody ++ [JSAssignment Nothing (JSAccessor Nothing "exports" (JSVar Nothing "module")) exps']
69−
70− where
71−
72− -- |
73− -- Extracts all declaration names from a binding group.
74− --
75− getNames :: Bind Ann -> [Ident]
76− getNames (NonRec _ ident _) = [ident]
77− getNames (Rec vals) = map (snd . fst) vals
78−
79− -- |
80− -- Creates alternative names for each module to ensure they don't collide
81− -- with declaration names.
82− --
83− renameImports :: [Ident] -> [(Ann, ModuleName)] -> M.Map ModuleName (Ann, ModuleName)
84− renameImports = go M.empty
85− where
86− go :: M.Map ModuleName (Ann, ModuleName) -> [Ident] -> [(Ann, ModuleName)] -> M.Map ModuleName (Ann, ModuleName)
87− go acc used ((ann, mn') : mns') =
88− let mni = Ident $ runModuleName mn'
89− in if mn' /= mn && mni `elem` used
90− then let newName = freshModuleName 1 mn' used
91− in go (M.insert mn' (ann, newName) acc) (Ident (runModuleName newName) : used) mns'
92− else go (M.insert mn' (ann, mn') acc) used mns'
93− go acc _ [] = acc
94−
95− freshModuleName :: Integer -> ModuleName -> [Ident] -> ModuleName
96− freshModuleName i mn'@(ModuleName pns) used =
97− let newName = ModuleName $ init pns ++ [ProperName $ runProperName (last pns) ++ "_" ++ show i]
98− in if Ident (runModuleName newName) `elem` used
99− then freshModuleName (i + 1) mn' used
100− else newName
101−
102− -- |
103− -- Generates Javascript code for a module import, binding the required module
104− -- to the alternative
105− --
106− importToJs :: M.Map ModuleName (Ann, ModuleName) -> ModuleName -> m JS
107− importToJs mnLookup mn' = do
108− let ((ss, _, _, _), mnSafe) = fromMaybe (internalError "Missing value in mnLookup") $ M.lookup mn' mnLookup
109− let moduleBody = JSApp Nothing (JSVar Nothing "require") [JSStringLiteral Nothing (".." </> runModuleName mn')]
110− withPos ss $ JSVariableIntroduction Nothing (moduleNameToJs mnSafe) (Just moduleBody)
111−
112− -- |
113− -- Replaces the `ModuleName`s in the AST so that the generated code refers to
114− -- the collision-avoiding renamed module imports.
115− --
116− renameModules :: M.Map ModuleName (Ann, ModuleName) -> [Bind Ann] -> [Bind Ann]
117− renameModules mnLookup binds =
118− let (f, _, _) = everywhereOnValues id goExpr goBinder
119− in map f binds
120− where
121− goExpr :: Expr a -> Expr a
122− goExpr (Var ann q) = Var ann (renameQual q)
123− goExpr e = e
124− goBinder :: Binder a -> Binder a
125− goBinder (ConstructorBinder ann q1 q2 bs) = ConstructorBinder ann (renameQual q1) (renameQual q2) bs
126− goBinder b = b
127− renameQual :: Qualified a -> Qualified a
128− renameQual (Qualified (Just mn') a) =
129− let (_,mnSafe) = fromMaybe (internalError "Missing value in mnLookup") $ M.lookup mn' mnLookup
130− in Qualified (Just mnSafe) a
131− renameQual q = q
132−
133− -- |
134− -- Generate code in the simplified Javascript intermediate representation for a declaration
135− --
136− bindToJs :: Bind Ann -> m [JS]
137− bindToJs (NonRec ann ident val) = return <$> nonRecToJS ann ident val
138− bindToJs (Rec vals) = forM vals (uncurry . uncurry $ nonRecToJS)
139−
140− -- |
141− -- Generate code in the simplified Javascript intermediate representation for a single non-recursive
142− -- declaration.
143− --
144− -- The main purpose of this function is to handle code generation for comments.
145− --
146− nonRecToJS :: Ann -> Ident -> Expr Ann -> m JS
147− nonRecToJS a i e@(extractAnn -> (_, com, _, _)) | not (null com) = do
148− withoutComment <- asks optionsNoComments
149− if withoutComment
150− then nonRecToJS a i (modifyAnn removeComments e)
151− else JSComment Nothing com <$> nonRecToJS a i (modifyAnn removeComments e)
152− nonRecToJS (ss, _, _, _) ident val = do
153− js <- valueToJs val
154− withPos ss $ JSVariableIntroduction Nothing (identToJs ident) (Just js)
155−
156− withPos :: Maybe SourceSpan -> JS -> m JS
157− withPos (Just ss) js = do
158− withSM <- asks optionsSourceMaps
159− return $ if withSM
160− then withSourceSpan ss js
161− else js
162− withPos Nothing js = return js
163−
164− -- |
165− -- Generate code in the simplified Javascript intermediate representation for a variable based on a
166− -- PureScript identifier.
167− --
168− var :: Ident -> JS
169− var = JSVar Nothing . identToJs
170−
171− -- |
172− -- Generate code in the simplified Javascript intermediate representation for an accessor based on
173− -- a PureScript identifier. If the name is not valid in Javascript (symbol based, reserved name) an
174− -- indexer is returned.
175− --
176− accessor :: Ident -> JS -> JS
177− accessor (Ident prop) = accessorString prop
178− accessor (GenIdent _ _) = internalError "GenIdent in accessor"
179−
180− accessorString :: String -> JS -> JS
181− accessorString prop | identNeedsEscaping prop = JSIndexer Nothing (JSStringLiteral Nothing prop)
182− | otherwise = JSAccessor Nothing prop
183−
184− -- |
185− -- Generate code in the simplified Javascript intermediate representation for a value or expression.
186− --
187− valueToJs :: Expr Ann -> m JS
188− valueToJs e =
189− let (ss, _, _, _) = extractAnn e in
190− withPos ss =<< valueToJs' e
191−
192− valueToJs' :: Expr Ann -> m JS
193− valueToJs' (Literal (pos, _, _, _) l) =
194− maybe id rethrowWithPosition pos $ literalToValueJS l
195− valueToJs' (Var (_, _, _, Just (IsConstructor _ [])) name) =
196− return $ JSAccessor Nothing "value" $ qualifiedToJS id name
197− valueToJs' (Var (_, _, _, Just (IsConstructor _ _)) name) =
198− return $ JSAccessor Nothing "create" $ qualifiedToJS id name
199− valueToJs' (Accessor _ prop val) =
200− accessorString prop <$> valueToJs val
201− valueToJs' (ObjectUpdate _ o ps) = do
202− obj <- valueToJs o
203− sts <- mapM (sndM valueToJs) ps
204− extendObj obj sts
205− valueToJs' e@(Abs (_, _, _, Just IsTypeClassConstructor) _ _) =
206− let args = unAbs e
207− in return $ JSFunction Nothing Nothing (map identToJs args) (JSBlock Nothing $ map assign args)
208− where
209− unAbs :: Expr Ann -> [Ident]
210− unAbs (Abs _ arg val) = arg : unAbs val
211− unAbs _ = []
212− assign :: Ident -> JS
213− assign name = JSAssignment Nothing (accessorString (runIdent name) (JSVar Nothing "this"))
214− (var name)
215− valueToJs' (Abs _ arg val) = do
216− ret <- valueToJs val
217− return $ JSFunction Nothing Nothing [identToJs arg] (JSBlock Nothing [JSReturn Nothing ret])
218− valueToJs' e@App{} = do
219− let (f, args) = unApp e []
220− args' <- mapM valueToJs args
221− case f of
222− Var (_, _, _, Just IsNewtype) _ -> return (head args')
223− Var (_, _, _, Just (IsConstructor _ fields)) name | length args == length fields ->
224− return $ JSUnary Nothing JSNew $ JSApp Nothing (qualifiedToJS id name) args'
225− Var (_, _, _, Just IsTypeClassConstructor) name ->
226− return $ JSUnary Nothing JSNew $ JSApp Nothing (qualifiedToJS id name) args'
227− _ -> flip (foldl (\fn a -> JSApp Nothing fn [a])) args' <$> valueToJs f
228− where
229− unApp :: Expr Ann -> [Expr Ann] -> (Expr Ann, [Expr Ann])
230− unApp (App _ val arg) args = unApp val (arg : args)
231− unApp other args = (other, args)
232− valueToJs' (Var (_, _, _, Just IsForeign) qi@(Qualified (Just mn') ident)) =
233− return $ if mn' == mn
234− then foreignIdent ident
235− else varToJs qi
236− valueToJs' (Var (_, _, _, Just IsForeign) ident) =
237− error $ "Encountered an unqualified reference to a foreign ident " ++ showQualified showIdent ident
238− valueToJs' (Var _ ident) = return $ varToJs ident
239− valueToJs' (Case (maybeSpan, _, _, _) values binders) = do
240− vals <- mapM valueToJs values
241− bindersToJs maybeSpan binders vals
242− valueToJs' (Let _ ds val) = do
243− ds' <- concat <$> mapM bindToJs ds
244− ret <- valueToJs val
245− return $ JSApp Nothing (JSFunction Nothing Nothing [] (JSBlock Nothing (ds' ++ [JSReturn Nothing ret]))) []
246− valueToJs' (Constructor (_, _, _, Just IsNewtype) _ (ProperName ctor) _) =
247− return $ JSVariableIntroduction Nothing ctor (Just $
248− JSObjectLiteral Nothing [("create",
249− JSFunction Nothing Nothing ["value"]
250− (JSBlock Nothing [JSReturn Nothing $ JSVar Nothing "value"]))])
251− valueToJs' (Constructor _ _ (ProperName ctor) []) =
252− return $ iife ctor [ JSFunction Nothing (Just ctor) [] (JSBlock Nothing [])
253− , JSAssignment Nothing (JSAccessor Nothing "value" (JSVar Nothing ctor))
254− (JSUnary Nothing JSNew $ JSApp Nothing (JSVar Nothing ctor) []) ]
255− valueToJs' (Constructor _ _ (ProperName ctor) fields) =
256− let constructor =
257− let body = [ JSAssignment Nothing (JSAccessor Nothing (identToJs f) (JSVar Nothing "this")) (var f) | f <- fields ]
258− in JSFunction Nothing (Just ctor) (identToJs `map` fields) (JSBlock Nothing body)
259− createFn =
260− let body = JSUnary Nothing JSNew $ JSApp Nothing (JSVar Nothing ctor) (var `map` fields)
261− in foldr (\f inner -> JSFunction Nothing Nothing [identToJs f] (JSBlock Nothing [JSReturn Nothing inner])) body fields
262− in return $ iife ctor [ constructor
263− , JSAssignment Nothing (JSAccessor Nothing "create" (JSVar Nothing ctor)) createFn
264− ]
265−
266− iife :: String -> [JS] -> JS
267− iife v exprs = JSApp Nothing (JSFunction Nothing Nothing [] (JSBlock Nothing $ exprs ++ [JSReturn Nothing $ JSVar Nothing v])) []
268−
269− literalToValueJS :: Literal (Expr Ann) -> m JS
270− literalToValueJS (NumericLiteral (Left i)) = return $ JSNumericLiteral Nothing (Left i)
271− literalToValueJS (NumericLiteral (Right n)) = return $ JSNumericLiteral Nothing (Right n)
272− literalToValueJS (StringLiteral s) = return $ JSStringLiteral Nothing s
273− literalToValueJS (CharLiteral c) = return $ JSStringLiteral Nothing [c]
274− literalToValueJS (BooleanLiteral b) = return $ JSBooleanLiteral Nothing b
275− literalToValueJS (ArrayLiteral xs) = JSArrayLiteral Nothing <$> mapM valueToJs xs
276− literalToValueJS (ObjectLiteral ps) = JSObjectLiteral Nothing <$> mapM (sndM valueToJs) ps
277−
278− -- |
279− -- Shallow copy an object.
280− --
281− extendObj :: JS -> [(String, JS)] -> m JS
282− extendObj obj sts = do
283− newObj <- freshName
284− key <- freshName
285− evaluatedObj <- freshName
286− let
287− jsKey = JSVar Nothing key
288− jsNewObj = JSVar Nothing newObj
289− jsEvaluatedObj = JSVar Nothing evaluatedObj
290− block = JSBlock Nothing (evaluate:objAssign:copy:extend ++ [JSReturn Nothing jsNewObj])
291− evaluate = JSVariableIntroduction Nothing evaluatedObj (Just obj)
292− objAssign = JSVariableIntroduction Nothing newObj (Just $ JSObjectLiteral Nothing [])
293− copy = JSForIn Nothing key jsEvaluatedObj $ JSBlock Nothing [JSIfElse Nothing cond assign Nothing]
294− cond = JSApp Nothing (JSAccessor Nothing "hasOwnProperty" jsEvaluatedObj) [jsKey]
295− assign = JSBlock Nothing [JSAssignment Nothing (JSIndexer Nothing jsKey jsNewObj) (JSIndexer Nothing jsKey jsEvaluatedObj)]
296− stToAssign (s, js) = JSAssignment Nothing (accessorString s jsNewObj) js
297− extend = map stToAssign sts
298− return $ JSApp Nothing (JSFunction Nothing Nothing [] block) []
299−
300− -- |
301− -- Generate code in the simplified Javascript intermediate representation for a reference to a
302− -- variable.
303− --
304− varToJs :: Qualified Ident -> JS
305− varToJs (Qualified Nothing ident) = var ident
306− varToJs qual = qualifiedToJS id qual
307−
308− -- |
309− -- Generate code in the simplified Javascript intermediate representation for a reference to a
310− -- variable that may have a qualified name.
311− --
312− qualifiedToJS :: (a -> Ident) -> Qualified a -> JS
313− qualifiedToJS f (Qualified (Just (ModuleName [ProperName mn'])) a) | mn' == C.prim = JSVar Nothing . runIdent $ f a
314− qualifiedToJS f (Qualified (Just mn') a) | mn /= mn' = accessor (f a) (JSVar Nothing (moduleNameToJs mn'))
315− qualifiedToJS f (Qualified _ a) = JSVar Nothing $ identToJs (f a)
316−
317− foreignIdent :: Ident -> JS
318− foreignIdent ident = accessorString (runIdent ident) (JSVar Nothing "$foreign")
319−
320− -- |
321− -- Generate code in the simplified Javascript intermediate representation for pattern match binders
322− -- and guards.
323− --
324− bindersToJs :: Maybe SourceSpan -> [CaseAlternative Ann] -> [JS] -> m JS
325− bindersToJs maybeSpan binders vals = do
326− valNames <- replicateM (length vals) freshName
327− let assignments = zipWith (JSVariableIntroduction Nothing) valNames (map Just vals)
328− jss <- forM binders $ \(CaseAlternative bs result) -> do
329− ret <- guardsToJs result
330− go valNames ret bs
331− return $ JSApp Nothing (JSFunction Nothing Nothing [] (JSBlock Nothing (assignments ++ concat jss ++ [JSThrow Nothing $ failedPatternError valNames])))
332− []
333− where
334− go :: [String] -> [JS] -> [Binder Ann] -> m [JS]
335− go _ done [] = return done
336− go (v:vs) done' (b:bs) = do
337− done'' <- go vs done' bs
338− binderToJs v done'' b
339− go _ _ _ = internalError "Invalid arguments to bindersToJs"
340−
341− failedPatternError :: [String] -> JS
342− failedPatternError names = JSUnary Nothing JSNew $ JSApp Nothing (JSVar Nothing "Error") [JSBinary Nothing Add (JSStringLiteral Nothing failedPatternMessage) (JSArrayLiteral Nothing $ zipWith valueError names vals)]
343−
344− failedPatternMessage :: String
345− failedPatternMessage = "Failed pattern match" ++ maybe "" (((" at " ++ runModuleName mn ++ " ") ++) . displayStartEndPos) maybeSpan ++ ": "
346−
347− valueError :: String -> JS -> JS
348− valueError _ l@(JSNumericLiteral _ _) = l
349− valueError _ l@(JSStringLiteral _ _) = l
350− valueError _ l@(JSBooleanLiteral _ _) = l
351− valueError s _ = JSAccessor Nothing "name" . JSAccessor Nothing "constructor" $ JSVar Nothing s
352−
353− guardsToJs :: Either [(Guard Ann, Expr Ann)] (Expr Ann) -> m [JS]
354− guardsToJs (Left gs) = forM gs $ \(cond, val) -> do
355− cond' <- valueToJs cond
356− done <- valueToJs val
357− return $ JSIfElse Nothing cond' (JSBlock Nothing [JSReturn Nothing done]) Nothing
358− guardsToJs (Right v) = return . JSReturn Nothing <$> valueToJs v
359−
360− binderToJs :: String -> [JS] -> Binder Ann -> m [JS]
361− binderToJs s done binder =
362− let (ss, _, _, _) = extractBinderAnn binder in
363− traverse (withPos ss) =<< binderToJs' s done binder
364−
365− -- |
366− -- Generate code in the simplified Javascript intermediate representation for a pattern match
367− -- binder.
368− --
369− binderToJs' :: String -> [JS] -> Binder Ann -> m [JS]
370− binderToJs' _ done NullBinder{} = return done
371− binderToJs' varName done (LiteralBinder _ l) =
372− literalToBinderJS varName done l
373− binderToJs' varName done (VarBinder _ ident) =
374− return (JSVariableIntroduction Nothing (identToJs ident) (Just (JSVar Nothing varName)) : done)
375− binderToJs' varName done (ConstructorBinder (_, _, _, Just IsNewtype) _ _ [b]) =
376− binderToJs varName done b
377− binderToJs' varName done (ConstructorBinder (_, _, _, Just (IsConstructor ctorType fields)) _ ctor bs) = do
378− js <- go (zip fields bs) done
379− return $ case ctorType of
380− ProductType -> js
381− SumType ->
382− [JSIfElse Nothing (JSInstanceOf Nothing (JSVar Nothing varName) (qualifiedToJS (Ident . runProperName) ctor))
383− (JSBlock Nothing js)
384− Nothing]
385− where
386− go :: [(Ident, Binder Ann)] -> [JS] -> m [JS]
387− go [] done' = return done'
388− go ((field, binder) : remain) done' = do
389− argVar <- freshName
390− done'' <- go remain done'
391− js <- binderToJs argVar done'' binder
392− return (JSVariableIntroduction Nothing argVar (Just (JSAccessor Nothing (identToJs field) (JSVar Nothing varName))) : js)
393− binderToJs' _ _ ConstructorBinder{} =
394− internalError "binderToJs: Invalid ConstructorBinder in binderToJs"
395− binderToJs' varName done (NamedBinder _ ident binder) = do
396− js <- binderToJs varName done binder
397− return (JSVariableIntroduction Nothing (identToJs ident) (Just (JSVar Nothing varName)) : js)
398−
399− literalToBinderJS :: String -> [JS] -> Literal (Binder Ann) -> m [JS]
400− literalToBinderJS varName done (NumericLiteral num) =
401− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSVar Nothing varName) (JSNumericLiteral Nothing num)) (JSBlock Nothing done) Nothing]
402− literalToBinderJS varName done (CharLiteral c) =
403− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSVar Nothing varName) (JSStringLiteral Nothing [c])) (JSBlock Nothing done) Nothing]
404− literalToBinderJS varName done (StringLiteral str) =
405− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSVar Nothing varName) (JSStringLiteral Nothing str)) (JSBlock Nothing done) Nothing]
406− literalToBinderJS varName done (BooleanLiteral True) =
407− return [JSIfElse Nothing (JSVar Nothing varName) (JSBlock Nothing done) Nothing]
408− literalToBinderJS varName done (BooleanLiteral False) =
409− return [JSIfElse Nothing (JSUnary Nothing Not (JSVar Nothing varName)) (JSBlock Nothing done) Nothing]
410− literalToBinderJS varName done (ObjectLiteral bs) = go done bs
411− where
412− go :: [JS] -> [(String, Binder Ann)] -> m [JS]
413− go done' [] = return done'
414− go done' ((prop, binder):bs') = do
415− propVar <- freshName
416− done'' <- go done' bs'
417− js <- binderToJs propVar done'' binder
418− return (JSVariableIntroduction Nothing propVar (Just (accessorString prop (JSVar Nothing varName))) : js)
419− literalToBinderJS varName done (ArrayLiteral bs) = do
420− js <- go done 0 bs
421− return [JSIfElse Nothing (JSBinary Nothing EqualTo (JSAccessor Nothing "length" (JSVar Nothing varName)) (JSNumericLiteral Nothing (Left (fromIntegral $ length bs)))) (JSBlock Nothing js) Nothing]
422− where
423− go :: [JS] -> Integer -> [Binder Ann] -> m [JS]
424− go done' _ [] = return done'
425− go done' index (binder:bs') = do
426− elVar <- freshName
427− done'' <- go done' (index + 1) bs'
428− js <- binderToJs elVar done'' binder
429− return (JSVariableIntroduction Nothing elVar (Just (JSIndexer Nothing (JSNumericLiteral Nothing (Left index)) (JSVar Nothing varName))) : js)
430−
431− -- Check that all integers fall within the valid int range for JavaScript.
432− checkIntegers :: JS -> m ()
433− checkIntegers = void . everywhereOnJSTopDownM go
434− where
435− go :: JS -> m JS
436− go (JSUnary _ Negate (JSNumericLiteral ss (Left i))) =
437− -- Move the negation inside the literal; since this is a top-down
438− -- traversal doing this replacement will stop the next case from raising
439− -- the error when attempting to use -2147483648, as if left unrewritten
440− -- the value is `JSUnary Negate (JSNumericLiteral (Left 2147483648))`, and
441− -- 2147483648 is larger than the maximum allowed int.
442− return $ JSNumericLiteral ss (Left (-i))
443− go js@(JSNumericLiteral _ (Left i)) =
444− let minInt = -2147483648
445− maxInt = 2147483647
446− in if i < minInt || i > maxInt
447− then throwError . errorMessage $ IntOutOfRange i "JavaScript" minInt maxInt
448− else return js
449− go other = return other
src/Language/PureScript/CodeGen/JS/AST.hsdeleted−403
@@ -1,403 +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.Compat
7−
8−import Control.Monad.Identity
9−
10−import Language.PureScript.AST (SourceSpan(..))
11−import Language.PureScript.Comments
12−import Language.PureScript.Traversals
13−
14−-- |
15−-- Built-in unary operators
16−--
17−data UnaryOperator
18− -- |
19− -- Numeric negation
20− --
21− = Negate
22− -- |
23− -- Boolean negation
24− --
25− | Not
26− -- |
27− -- Bitwise negation
28− --
29− | BitwiseNot
30− -- |
31− -- Numeric unary \'plus\'
32− --
33− | Positive
34− -- |
35− -- Constructor
36− --
37− | JSNew
38− deriving (Show, Eq)
39−
40−-- |
41−-- Built-in binary operators
42−--
43−data BinaryOperator
44− -- |
45− -- Numeric addition
46− --
47− = Add
48− -- |
49− -- Numeric subtraction
50− --
51− | Subtract
52− -- |
53− -- Numeric multiplication
54− --
55− | Multiply
56− -- |
57− -- Numeric division
58− --
59− | Divide
60− -- |
61− -- Remainder
62− --
63− | Modulus
64− -- |
65− -- Generic equality test
66− --
67− | EqualTo
68− -- |
69− -- Generic inequality test
70− --
71− | NotEqualTo
72− -- |
73− -- Numeric less-than
74− --
75− | LessThan
76− -- |
77− -- Numeric less-than-or-equal
78− --
79− | LessThanOrEqualTo
80− -- |
81− -- Numeric greater-than
82− --
83− | GreaterThan
84− -- |
85− -- Numeric greater-than-or-equal
86− --
87− | GreaterThanOrEqualTo
88− -- |
89− -- Boolean and
90− --
91− | And
92− -- |
93− -- Boolean or
94− --
95− | Or
96− -- |
97− -- Bitwise and
98− --
99− | BitwiseAnd
100− -- |
101− -- Bitwise or
102− --
103− | BitwiseOr
104− -- |
105− -- Bitwise xor
106− --
107− | BitwiseXor
108− -- |
109− -- Bitwise left shift
110− --
111− | ShiftLeft
112− -- |
113− -- Bitwise right shift
114− --
115− | ShiftRight
116− -- |
117− -- Bitwise right shift with zero-fill
118− --
119− | ZeroFillShiftRight
120− deriving (Show, Eq)
121−
122−-- |
123−-- Data type for simplified Javascript expressions
124−--
125−data JS
126− -- |
127− -- A numeric literal
128− --
129− = JSNumericLiteral (Maybe SourceSpan) (Either Integer Double)
130− -- |
131− -- A string literal
132− --
133− | JSStringLiteral (Maybe SourceSpan) String
134− -- |
135− -- A boolean literal
136− --
137− | JSBooleanLiteral (Maybe SourceSpan) Bool
138− -- |
139− -- A unary operator application
140− --
141− | JSUnary (Maybe SourceSpan) UnaryOperator JS
142− -- |
143− -- A binary operator application
144− --
145− | JSBinary (Maybe SourceSpan) BinaryOperator JS JS
146− -- |
147− -- An array literal
148− --
149− | JSArrayLiteral (Maybe SourceSpan) [JS]
150− -- |
151− -- An array indexer expression
152− --
153− | JSIndexer (Maybe SourceSpan) JS JS
154− -- |
155− -- An object literal
156− --
157− | JSObjectLiteral (Maybe SourceSpan) [(String, JS)]
158− -- |
159− -- An object property accessor expression
160− --
161− | JSAccessor (Maybe SourceSpan) String JS
162− -- |
163− -- A function introduction (optional name, arguments, body)
164− --
165− | JSFunction (Maybe SourceSpan) (Maybe String) [String] JS
166− -- |
167− -- Function application
168− --
169− | JSApp (Maybe SourceSpan) JS [JS]
170− -- |
171− -- Variable
172− --
173− | JSVar (Maybe SourceSpan) String
174− -- |
175− -- Conditional expression
176− --
177− | JSConditional (Maybe SourceSpan) JS JS JS
178− -- |
179− -- A block of expressions in braces
180− --
181− | JSBlock (Maybe SourceSpan) [JS]
182− -- |
183− -- A variable introduction and optional initialization
184− --
185− | JSVariableIntroduction (Maybe SourceSpan) String (Maybe JS)
186− -- |
187− -- A variable assignment
188− --
189− | JSAssignment (Maybe SourceSpan) JS JS
190− -- |
191− -- While loop
192− --
193− | JSWhile (Maybe SourceSpan) JS JS
194− -- |
195− -- For loop
196− --
197− | JSFor (Maybe SourceSpan) String JS JS JS
198− -- |
199− -- ForIn loop
200− --
201− | JSForIn (Maybe SourceSpan) String JS JS
202− -- |
203− -- If-then-else statement
204− --
205− | JSIfElse (Maybe SourceSpan) JS JS (Maybe JS)
206− -- |
207− -- Return statement
208− --
209− | JSReturn (Maybe SourceSpan) JS
210− -- |
211− -- Throw statement
212− --
213− | JSThrow (Maybe SourceSpan) JS
214− -- |
215− -- Type-Of operator
216− --
217− | JSTypeOf (Maybe SourceSpan) JS
218− -- |
219− -- InstanceOf test
220− --
221− | JSInstanceOf (Maybe SourceSpan) JS JS
222− -- |
223− -- Labelled statement
224− --
225− | JSLabel (Maybe SourceSpan) String JS
226− -- |
227− -- Break statement
228− --
229− | JSBreak (Maybe SourceSpan) String
230− -- |
231− -- Continue statement
232− --
233− | JSContinue (Maybe SourceSpan) String
234− -- |
235− -- Raw Javascript (generated when parsing fails for an inline foreign import declaration)
236− --
237− | JSRaw (Maybe SourceSpan) String
238− -- |
239− -- Commented Javascript
240− --
241− | JSComment (Maybe SourceSpan) [Comment] JS deriving (Show, Eq)
242−
243−withSourceSpan :: SourceSpan -> JS -> JS
244−withSourceSpan withSpan = go
245− where
246− ss :: Maybe SourceSpan
247− ss = Just withSpan
248−
249− go :: JS -> JS
250− go (JSNumericLiteral _ n) = JSNumericLiteral ss n
251− go (JSStringLiteral _ s) = JSStringLiteral ss s
252− go (JSBooleanLiteral _ b) = JSBooleanLiteral ss b
253− go (JSUnary _ op j) = JSUnary ss op j
254− go (JSBinary _ op j1 j2) = JSBinary ss op j1 j2
255− go (JSArrayLiteral _ js) = JSArrayLiteral ss js
256− go (JSIndexer _ j1 j2) = JSIndexer ss j1 j2
257− go (JSObjectLiteral _ js) = JSObjectLiteral ss js
258− go (JSAccessor _ prop j) = JSAccessor ss prop j
259− go (JSFunction _ name args j) = JSFunction ss name args j
260− go (JSApp _ j js) = JSApp ss j js
261− go (JSVar _ s) = JSVar ss s
262− go (JSConditional _ j1 j2 j3) = JSConditional ss j1 j2 j3
263− go (JSBlock _ js) = JSBlock ss js
264− go (JSVariableIntroduction _ name j) = JSVariableIntroduction ss name j
265− go (JSAssignment _ j1 j2) = JSAssignment ss j1 j2
266− go (JSWhile _ j1 j2) = JSWhile ss j1 j2
267− go (JSFor _ name j1 j2 j3) = JSFor ss name j1 j2 j3
268− go (JSForIn _ name j1 j2) = JSForIn ss name j1 j2
269− go (JSIfElse _ j1 j2 j3) = JSIfElse ss j1 j2 j3
270− go (JSReturn _ js) = JSReturn ss js
271− go (JSThrow _ js) = JSThrow ss js
272− go (JSTypeOf _ js) = JSTypeOf ss js
273− go (JSInstanceOf _ j1 j2) = JSInstanceOf ss j1 j2
274− go (JSLabel _ name js) = JSLabel ss name js
275− go (JSBreak _ s) = JSBreak ss s
276− go (JSContinue _ s) = JSContinue ss s
277− go (JSRaw _ s) = JSRaw ss s
278− go (JSComment _ com j) = JSComment ss com j
279−
280−getSourceSpan :: JS -> Maybe SourceSpan
281−getSourceSpan = go
282− where
283− go :: JS -> Maybe SourceSpan
284− go (JSNumericLiteral ss _) = ss
285− go (JSStringLiteral ss _) = ss
286− go (JSBooleanLiteral ss _) = ss
287− go (JSUnary ss _ _) = ss
288− go (JSBinary ss _ _ _) = ss
289− go (JSArrayLiteral ss _) = ss
290− go (JSIndexer ss _ _) = ss
291− go (JSObjectLiteral ss _) = ss
292− go (JSAccessor ss _ _) = ss
293− go (JSFunction ss _ _ _) = ss
294− go (JSApp ss _ _) = ss
295− go (JSVar ss _) = ss
296− go (JSConditional ss _ _ _) = ss
297− go (JSBlock ss _) = ss
298− go (JSVariableIntroduction ss _ _) = ss
299− go (JSAssignment ss _ _) = ss
300− go (JSWhile ss _ _) = ss
301− go (JSFor ss _ _ _ _) = ss
302− go (JSForIn ss _ _ _) = ss
303− go (JSIfElse ss _ _ _) = ss
304− go (JSReturn ss _) = ss
305− go (JSThrow ss _) = ss
306− go (JSTypeOf ss _) = ss
307− go (JSInstanceOf ss _ _) = ss
308− go (JSLabel ss _ _) = ss
309− go (JSBreak ss _) = ss
310− go (JSContinue ss _) = ss
311− go (JSRaw ss _) = ss
312− go (JSComment ss _ _) = ss
313−
314−--
315−-- Traversals
316−--
317−
318−everywhereOnJS :: (JS -> JS) -> JS -> JS
319−everywhereOnJS f = go
320− where
321− go :: JS -> JS
322− go (JSUnary ss op j) = f (JSUnary ss op (go j))
323− go (JSBinary ss op j1 j2) = f (JSBinary ss op (go j1) (go j2))
324− go (JSArrayLiteral ss js) = f (JSArrayLiteral ss (map go js))
325− go (JSIndexer ss j1 j2) = f (JSIndexer ss (go j1) (go j2))
326− go (JSObjectLiteral ss js) = f (JSObjectLiteral ss (map (fmap go) js))
327− go (JSAccessor ss prop j) = f (JSAccessor ss prop (go j))
328− go (JSFunction ss name args j) = f (JSFunction ss name args (go j))
329− go (JSApp ss j js) = f (JSApp ss (go j) (map go js))
330− go (JSConditional ss j1 j2 j3) = f (JSConditional ss (go j1) (go j2) (go j3))
331− go (JSBlock ss js) = f (JSBlock ss (map go js))
332− go (JSVariableIntroduction ss name j) = f (JSVariableIntroduction ss name (fmap go j))
333− go (JSAssignment ss j1 j2) = f (JSAssignment ss (go j1) (go j2))
334− go (JSWhile ss j1 j2) = f (JSWhile ss (go j1) (go j2))
335− go (JSFor ss name j1 j2 j3) = f (JSFor ss name (go j1) (go j2) (go j3))
336− go (JSForIn ss name j1 j2) = f (JSForIn ss name (go j1) (go j2))
337− go (JSIfElse ss j1 j2 j3) = f (JSIfElse ss (go j1) (go j2) (fmap go j3))
338− go (JSReturn ss js) = f (JSReturn ss (go js))
339− go (JSThrow ss js) = f (JSThrow ss (go js))
340− go (JSTypeOf ss js) = f (JSTypeOf ss (go js))
341− go (JSLabel ss name js) = f (JSLabel ss name (go js))
342− go (JSInstanceOf ss j1 j2) = f (JSInstanceOf ss (go j1) (go j2))
343− go (JSComment ss com j) = f (JSComment ss com (go j))
344− go other = f other
345−
346−everywhereOnJSTopDown :: (JS -> JS) -> JS -> JS
347−everywhereOnJSTopDown f = runIdentity . everywhereOnJSTopDownM (Identity . f)
348−
349−everywhereOnJSTopDownM :: (Monad m) => (JS -> m JS) -> JS -> m JS
350−everywhereOnJSTopDownM f = f >=> go
351− where
352− f' = f >=> go
353− go (JSUnary ss op j) = JSUnary ss op <$> f' j
354− go (JSBinary ss op j1 j2) = JSBinary ss op <$> f' j1 <*> f' j2
355− go (JSArrayLiteral ss js) = JSArrayLiteral ss <$> traverse f' js
356− go (JSIndexer ss j1 j2) = JSIndexer ss <$> f' j1 <*> f' j2
357− go (JSObjectLiteral ss js) = JSObjectLiteral ss <$> traverse (sndM f') js
358− go (JSAccessor ss prop j) = JSAccessor ss prop <$> f' j
359− go (JSFunction ss name args j) = JSFunction ss name args <$> f' j
360− go (JSApp ss j js) = JSApp ss <$> f' j <*> traverse f' js
361− go (JSConditional ss j1 j2 j3) = JSConditional ss <$> f' j1 <*> f' j2 <*> f' j3
362− go (JSBlock ss js) = JSBlock ss <$> traverse f' js
363− go (JSVariableIntroduction ss name j) = JSVariableIntroduction ss name <$> traverse f' j
364− go (JSAssignment ss j1 j2) = JSAssignment ss <$> f' j1 <*> f' j2
365− go (JSWhile ss j1 j2) = JSWhile ss <$> f' j1 <*> f' j2
366− go (JSFor ss name j1 j2 j3) = JSFor ss name <$> f' j1 <*> f' j2 <*> f' j3
367− go (JSForIn ss name j1 j2) = JSForIn ss name <$> f' j1 <*> f' j2
368− go (JSIfElse ss j1 j2 j3) = JSIfElse ss <$> f' j1 <*> f' j2 <*> traverse f' j3
369− go (JSReturn ss j) = JSReturn ss <$> f' j
370− go (JSThrow ss j) = JSThrow ss <$> f' j
371− go (JSTypeOf ss j) = JSTypeOf ss <$> f' j
372− go (JSLabel ss name j) = JSLabel ss name <$> f' j
373− go (JSInstanceOf ss j1 j2) = JSInstanceOf ss <$> f' j1 <*> f' j2
374− go (JSComment ss com j) = JSComment ss com <$> f' j
375− go other = f other
376−
377−everythingOnJS :: (r -> r -> r) -> (JS -> r) -> JS -> r
378−everythingOnJS (<>) f = go
379− where
380− go j@(JSUnary _ _ j1) = f j <> go j1
381− go j@(JSBinary _ _ j1 j2) = f j <> go j1 <> go j2
382− go j@(JSArrayLiteral _ js) = foldl (<>) (f j) (map go js)
383− go j@(JSIndexer _ j1 j2) = f j <> go j1 <> go j2
384− go j@(JSObjectLiteral _ js) = foldl (<>) (f j) (map (go . snd) js)
385− go j@(JSAccessor _ _ j1) = f j <> go j1
386− go j@(JSFunction _ _ _ j1) = f j <> go j1
387− go j@(JSApp _ j1 js) = foldl (<>) (f j <> go j1) (map go js)
388− go j@(JSConditional _ j1 j2 j3) = f j <> go j1 <> go j2 <> go j3
389− go j@(JSBlock _ js) = foldl (<>) (f j) (map go js)
390− go j@(JSVariableIntroduction _ _ (Just j1)) = f j <> go j1
391− go j@(JSAssignment _ j1 j2) = f j <> go j1 <> go j2
392− go j@(JSWhile _ j1 j2) = f j <> go j1 <> go j2
393− go j@(JSFor _ _ j1 j2 j3) = f j <> go j1 <> go j2 <> go j3
394− go j@(JSForIn _ _ j1 j2) = f j <> go j1 <> go j2
395− go j@(JSIfElse _ j1 j2 Nothing) = f j <> go j1 <> go j2
396− go j@(JSIfElse _ j1 j2 (Just j3)) = f j <> go j1 <> go j2 <> go j3
397− go j@(JSReturn _ j1) = f j <> go j1
398− go j@(JSThrow _ j1) = f j <> go j1
399− go j@(JSTypeOf _ j1) = f j <> go j1
400− go j@(JSLabel _ _ j1) = f j <> go j1
401− go j@(JSInstanceOf _ j1 j2) = f j <> go j1 <> go j2
402− go j@(JSComment _ _ j1) = f j <> go j1
403− go other = f other
src/Language/PureScript/CodeGen/JS/Common.hsdeleted−232
@@ -1,232 +0,0 @@
1−-- |
2−-- Common code generation utility functions
3−--
4−module Language.PureScript.CodeGen.JS.Common where
5−
6−import Prelude.Compat
7−
8−import Data.Char
9−import Data.List (intercalate)
10−
11−import Language.PureScript.Crash
12−import Language.PureScript.Names
13−
14−moduleNameToJs :: ModuleName -> String
15−moduleNameToJs (ModuleName pns) =
16− let name = intercalate "_" (runProperName `map` pns)
17− in if nameIsJsBuiltIn name then "$$" ++ name else name
18−
19−-- |
20−-- Convert an Ident into a valid Javascript identifier:
21−--
22−-- * Alphanumeric characters are kept unmodified.
23−--
24−-- * Reserved javascript identifiers are prefixed with '$$'.
25−--
26−-- * Symbols are prefixed with '$' followed by a symbol name or their ordinal value.
27−--
28−identToJs :: Ident -> String
29−identToJs (Ident name)
30− | nameIsJsReserved name || nameIsJsBuiltIn name = "$$" ++ name
31− | otherwise = concatMap identCharToString name
32−identToJs (GenIdent _ _) = internalError "GenIdent in identToJs"
33−
34−-- |
35−-- Test if a string is a valid JS identifier without escaping.
36−--
37−identNeedsEscaping :: String -> Bool
38−identNeedsEscaping s = s /= identToJs (Ident s) || null s
39−
40−-- |
41−-- Attempts to find a human-readable name for a symbol, if none has been specified returns the
42−-- ordinal value.
43−--
44−identCharToString :: Char -> String
45−identCharToString c | isAlphaNum c = [c]
46−identCharToString '_' = "_"
47−identCharToString '.' = "$dot"
48−identCharToString '$' = "$dollar"
49−identCharToString '~' = "$tilde"
50−identCharToString '=' = "$eq"
51−identCharToString '<' = "$less"
52−identCharToString '>' = "$greater"
53−identCharToString '!' = "$bang"
54−identCharToString '#' = "$hash"
55−identCharToString '%' = "$percent"
56−identCharToString '^' = "$up"
57−identCharToString '&' = "$amp"
58−identCharToString '|' = "$bar"
59−identCharToString '*' = "$times"
60−identCharToString '/' = "$div"
61−identCharToString '+' = "$plus"
62−identCharToString '-' = "$minus"
63−identCharToString ':' = "$colon"
64−identCharToString '\\' = "$bslash"
65−identCharToString '?' = "$qmark"
66−identCharToString '@' = "$at"
67−identCharToString '\'' = "$prime"
68−identCharToString c = '$' : show (ord c)
69−
70−-- |
71−-- Checks whether an identifier name is reserved in Javascript.
72−--
73−nameIsJsReserved :: String -> Bool
74−nameIsJsReserved name =
75− name `elem` jsAnyReserved
76−
77−-- |
78−-- Checks whether a name matches a built-in value in Javascript.
79−--
80−nameIsJsBuiltIn :: String -> Bool
81−nameIsJsBuiltIn name =
82− name `elem`
83− [ "arguments"
84− , "Array"
85− , "ArrayBuffer"
86− , "Boolean"
87− , "DataView"
88− , "Date"
89− , "decodeURI"
90− , "decodeURIComponent"
91− , "encodeURI"
92− , "encodeURIComponent"
93− , "Error"
94− , "escape"
95− , "eval"
96− , "EvalError"
97− , "Float32Array"
98− , "Float64Array"
99− , "Function"
100− , "Infinity"
101− , "Int16Array"
102− , "Int32Array"
103− , "Int8Array"
104− , "Intl"
105− , "isFinite"
106− , "isNaN"
107− , "JSON"
108− , "Map"
109− , "Math"
110− , "NaN"
111− , "Number"
112− , "Object"
113− , "parseFloat"
114− , "parseInt"
115− , "Promise"
116− , "Proxy"
117− , "RangeError"
118− , "ReferenceError"
119− , "Reflect"
120− , "RegExp"
121− , "Set"
122− , "SIMD"
123− , "String"
124− , "Symbol"
125− , "SyntaxError"
126− , "TypeError"
127− , "Uint16Array"
128− , "Uint32Array"
129− , "Uint8Array"
130− , "Uint8ClampedArray"
131− , "undefined"
132− , "unescape"
133− , "URIError"
134− , "WeakMap"
135− , "WeakSet"
136− ]
137−
138−jsAnyReserved :: [String]
139−jsAnyReserved =
140− concat
141− [ jsKeywords
142− , jsSometimesReserved
143− , jsFutureReserved
144− , jsFutureReservedStrict
145− , jsOldReserved
146− , jsLiterals
147− ]
148−
149−jsKeywords :: [String]
150−jsKeywords =
151− [ "break"
152− , "case"
153− , "catch"
154− , "class"
155− , "const"
156− , "continue"
157− , "debugger"
158− , "default"
159− , "delete"
160− , "do"
161− , "else"
162− , "export"
163− , "extends"
164− , "finally"
165− , "for"
166− , "function"
167− , "if"
168− , "import"
169− , "in"
170− , "instanceof"
171− , "new"
172− , "return"
173− , "super"
174− , "switch"
175− , "this"
176− , "throw"
177− , "try"
178− , "typeof"
179− , "var"
180− , "void"
181− , "while"
182− , "with"
183− ]
184−
185−jsSometimesReserved :: [String]
186−jsSometimesReserved =
187− [ "await"
188− , "let"
189− , "static"
190− , "yield"
191− ]
192−
193−jsFutureReserved :: [String]
194−jsFutureReserved =
195− [ "enum" ]
196−
197−jsFutureReservedStrict :: [String]
198−jsFutureReservedStrict =
199− [ "implements"
200− , "interface"
201− , "package"
202− , "private"
203− , "protected"
204− , "public"
205− ]
206−
207−jsOldReserved :: [String]
208−jsOldReserved =
209− [ "abstract"
210− , "boolean"
211− , "byte"
212− , "char"
213− , "double"
214− , "final"
215− , "float"
216− , "goto"
217− , "int"
218− , "long"
219− , "native"
220− , "short"
221− , "synchronized"
222− , "throws"
223− , "transient"
224− , "volatile"
225− ]
226−
227−jsLiterals :: [String]
228−jsLiterals =
229− [ "null"
230− , "true"
231− , "false"
232− ]
src/Language/PureScript/CodeGen/JS/Optimizer.hsdeleted−73
@@ -1,73 +0,0 @@
1−-- |
2−-- This module optimizes code in the simplified-Javascript intermediate representation.
3−--
4−-- The following optimizations are supported:
5−--
6−-- * Collapsing nested blocks
7−--
8−-- * Tail call elimination
9−--
10−-- * Inlining of (>>=) and ret for the Eff monad
11−--
12−-- * Removal of unnecessary thunks
13−--
14−-- * Eta conversion
15−--
16−-- * Inlining variables
17−--
18−-- * Inline Prelude.($), Prelude.(#), Prelude.(++), Prelude.(!!)
19−--
20−-- * Inlining primitive Javascript operators
21−--
22−module Language.PureScript.CodeGen.JS.Optimizer (optimize) where
23−
24−import Prelude.Compat
25−
26−import Control.Monad.Reader (MonadReader, ask, asks)
27−import Control.Monad.Supply.Class (MonadSupply)
28−
29−import Language.PureScript.CodeGen.JS.AST
30−import Language.PureScript.CodeGen.JS.Optimizer.Blocks
31−import Language.PureScript.CodeGen.JS.Optimizer.Common
32−import Language.PureScript.CodeGen.JS.Optimizer.Inliner
33−import Language.PureScript.CodeGen.JS.Optimizer.MagicDo
34−import Language.PureScript.CodeGen.JS.Optimizer.TCO
35−import Language.PureScript.CodeGen.JS.Optimizer.Unused
36−import Language.PureScript.Options
37−
38−-- |
39−-- Apply a series of optimizer passes to simplified Javascript code
40−--
41−optimize :: (MonadReader Options m, MonadSupply m) => JS -> m JS
42−optimize js = do
43− noOpt <- asks optionsNoOptimizations
44− if noOpt then return js else optimize' js
45−
46−optimize' :: (MonadReader Options m, MonadSupply m) => JS -> m JS
47−optimize' js = do
48− opts <- ask
49− js' <- untilFixedPoint (inlineFnComposition . tidyUp . applyAll
50− [ inlineCommonValues
51− , inlineCommonOperators
52− ]) js
53− untilFixedPoint (return . tidyUp) . tco opts . magicDo opts $ js'
54− where
55− tidyUp :: JS -> JS
56− tidyUp = applyAll
57− [ collapseNestedBlocks
58− , collapseNestedIfs
59− , removeCodeAfterReturnStatements
60− , removeUnusedArg
61− , removeUndefinedApp
62− , unThunk
63− , etaConvert
64− , evaluateIifes
65− , inlineVariables
66− ]
67−
68−untilFixedPoint :: (Monad m, Eq a) => (a -> m a) -> a -> m a
69−untilFixedPoint f = go
70− where
71− go a = do
72− a' <- f a
73− if a' == a then return a' else go a'
src/Language/PureScript/CodeGen/JS/Optimizer/Blocks.hsdeleted−32

This diff is too big to show here.

src/Language/PureScript/CodeGen/JS/Optimizer/Common.hsdeleted−82

This diff is too big to show here.

src/Language/PureScript/CodeGen/JS/Optimizer/Inliner.hsdeleted−368

This diff is too big to show here.

src/Language/PureScript/CodeGen/JS/Optimizer/MagicDo.hsdeleted−136

This diff is too big to show here.

src/Language/PureScript/CodeGen/JS/Optimizer/TCO.hsdeleted−120

This diff is too big to show here.

src/Language/PureScript/CodeGen/JS/Optimizer/Unused.hsdeleted−35

This diff is too big to show here.

src/Language/PureScript/Comments.hsdeleted−17

This diff is too big to show here.

src/Language/PureScript/Constants.hsdeleted−398

This diff is too big to show here.

src/Language/PureScript/CoreFn.hsdeleted−15

This diff is too big to show here.

src/Language/PureScript/CoreFn/Ann.hsdeleted−25

This diff is too big to show here.

src/Language/PureScript/CoreFn/Binders.hsdeleted−42

This diff is too big to show here.

src/Language/PureScript/CoreFn/Desugar.hsdeleted−270

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/CoreFn/ToJSON.hsdeleted−116

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Crash.hsdeleted−11

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

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

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

This diff is too big to show here.

src/Language/PureScript/Errors.hsdeleted−1279

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Externs.hsdeleted−227

This diff is too big to show here.

src/Language/PureScript/Ide.hsdeleted−196

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Ide/Conversions.hsdeleted−41

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Interactive.hsdeleted−289

This diff is too big to show here.

src/Language/PureScript/Interactive/Completion.hsdeleted−222

This diff is too big to show here.

src/Language/PureScript/Interactive/Directive.hsdeleted−100

This diff is too big to show here.

src/Language/PureScript/Interactive/IO.hsdeleted−41

This diff is too big to show here.

src/Language/PureScript/Interactive/Message.hsdeleted−52

This diff is too big to show here.

src/Language/PureScript/Interactive/Module.hsdeleted−99

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Interactive/Printer.hsdeleted−127

This diff is too big to show here.

src/Language/PureScript/Interactive/Types.hsdeleted−145

This diff is too big to show here.

src/Language/PureScript/Kinds.hsdeleted−46

This diff is too big to show here.

src/Language/PureScript/Linter.hsdeleted−97

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Make.hsdeleted−479

This diff is too big to show here.

src/Language/PureScript/ModuleDependencies.hsdeleted−100

This diff is too big to show here.

src/Language/PureScript/Names.hsdeleted−205

This diff is too big to show here.

src/Language/PureScript/Options.hsdeleted−42

This diff is too big to show here.

src/Language/PureScript/Parser.hsdeleted−23

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Pretty.hsdeleted−17

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Publish.hsdeleted−411

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Renamer.hsdeleted−191

This diff is too big to show here.

src/Language/PureScript/Sugar.hsdeleted−67

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Sugar/Names/Common.hsdeleted−68

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/Traversals.hsdeleted−27

This diff is too big to show here.

src/Language/PureScript/TypeChecker.hsdeleted−437

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Language/PureScript/TypeClassDictionaries.hsdeleted−24

This diff is too big to show here.

src/Language/PureScript/Types.hsdeleted−323

This diff is too big to show here.

src/System/IO/UTF8.hsdeleted−14

This diff is too big to show here.

src/Tests.hsnew file+141

This diff is too big to show here.

stack-ghc-8.0.yamldeleted−7

This diff is too big to show here.

stack.nixnew file+23

This diff is too big to show here.

stack.yaml+23−2

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

tests/Language/PureScript/Ide/SourceFile/IntegrationSpec.hsdeleted−41

This diff is too big to show here.

tests/Language/PureScript/Ide/SourceFileSpec.hsdeleted−50

This diff is too big to show here.

tests/Language/PureScript/Ide/StateSpec.hsdeleted−51

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

This diff is too big to show here.

tests/TestDocs.hsdeleted−310

This diff is too big to show here.

tests/TestPscIde.hsdeleted−15

This diff is too big to show here.

tests/TestPscPublish.hsdeleted−78

This diff is too big to show here.

tests/TestPsci.hsdeleted−137

This diff is too big to show here.

tests/TestUtils.hsdeleted−101

This diff is too big to show here.

tests/support/.gitignoredeleted−2

This diff is too big to show here.

tests/support/bower.jsondeleted−13

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

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/MatcherSpec.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−1

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/RebuildSpecWithHiddenIdent.pursdeleted−6

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/pscide/src/SourceFileSpec.pursdeleted−10

This diff is too big to show here.

tests/support/setup-win.cmddeleted−3

This diff is too big to show here.

travis/build.shdeleted−59

This diff is too big to show here.

travis/convert-os-name.shdeleted−14

This diff is too big to show here.