fay 0.24.0.4 → 0.24.0.5
raw patch · 6 files changed
+12/−11 lines, 6 filesdep ~basedep ~haskell-src-extsdep ~optparse-applicativePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base, haskell-src-exts, optparse-applicative
API changes (from Hackage documentation)
+ Fay.Compiler.Prelude: class Monad m => MonadFail (m :: Type -> Type)
- Fay.Compiler.Prelude: (!!) :: () => [a] -> Int -> a
+ Fay.Compiler.Prelude: (!!) :: [a] -> Int -> a
- Fay.Compiler.Prelude: ($!) :: () => (a -> b) -> a -> b
+ Fay.Compiler.Prelude: ($!) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- Fay.Compiler.Prelude: ($) :: () => (a -> b) -> a -> b
+ Fay.Compiler.Prelude: ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- Fay.Compiler.Prelude: (++) :: () => [a] -> [a] -> [a]
+ Fay.Compiler.Prelude: (++) :: [a] -> [a] -> [a]
- Fay.Compiler.Prelude: (.) :: () => (b -> c) -> (a -> b) -> a -> c
+ Fay.Compiler.Prelude: (.) :: (b -> c) -> (a -> b) -> a -> c
- Fay.Compiler.Prelude: asTypeOf :: () => a -> a -> a
+ Fay.Compiler.Prelude: asTypeOf :: a -> a -> a
- Fay.Compiler.Prelude: break :: () => (a -> Bool) -> [a] -> ([a], [a])
+ Fay.Compiler.Prelude: break :: (a -> Bool) -> [a] -> ([a], [a])
- Fay.Compiler.Prelude: const :: () => a -> b -> a
+ Fay.Compiler.Prelude: const :: a -> b -> a
- Fay.Compiler.Prelude: curry :: () => ((a, b) -> c) -> a -> b -> c
+ Fay.Compiler.Prelude: curry :: ((a, b) -> c) -> a -> b -> c
- Fay.Compiler.Prelude: cycle :: () => [a] -> [a]
+ Fay.Compiler.Prelude: cycle :: [a] -> [a]
- Fay.Compiler.Prelude: drop :: () => Int -> [a] -> [a]
+ Fay.Compiler.Prelude: drop :: Int -> [a] -> [a]
- Fay.Compiler.Prelude: dropWhile :: () => (a -> Bool) -> [a] -> [a]
+ Fay.Compiler.Prelude: dropWhile :: (a -> Bool) -> [a] -> [a]
- Fay.Compiler.Prelude: either :: () => (a -> c) -> (b -> c) -> Either a b -> c
+ Fay.Compiler.Prelude: either :: (a -> c) -> (b -> c) -> Either a b -> c
- Fay.Compiler.Prelude: error :: HasCallStack => [Char] -> a
+ Fay.Compiler.Prelude: error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => [Char] -> a
- Fay.Compiler.Prelude: errorWithoutStackTrace :: () => [Char] -> a
+ Fay.Compiler.Prelude: errorWithoutStackTrace :: forall (r :: RuntimeRep) (a :: TYPE r). [Char] -> a
- Fay.Compiler.Prelude: fail :: Monad m => String -> m a
+ Fay.Compiler.Prelude: fail :: MonadFail m => String -> m a
- Fay.Compiler.Prelude: filter :: () => (a -> Bool) -> [a] -> [a]
+ Fay.Compiler.Prelude: filter :: (a -> Bool) -> [a] -> [a]
- Fay.Compiler.Prelude: flip :: () => (a -> b -> c) -> b -> a -> c
+ Fay.Compiler.Prelude: flip :: (a -> b -> c) -> b -> a -> c
- Fay.Compiler.Prelude: fst :: () => (a, b) -> a
+ Fay.Compiler.Prelude: fst :: (a, b) -> a
- Fay.Compiler.Prelude: gmapQr :: Data a => (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r
+ Fay.Compiler.Prelude: gmapQr :: forall r r'. Data a => (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r
- Fay.Compiler.Prelude: head :: () => [a] -> a
+ Fay.Compiler.Prelude: head :: [a] -> a
- Fay.Compiler.Prelude: id :: () => a -> a
+ Fay.Compiler.Prelude: id :: a -> a
- Fay.Compiler.Prelude: init :: () => [a] -> [a]
+ Fay.Compiler.Prelude: init :: [a] -> [a]
- Fay.Compiler.Prelude: ioError :: () => IOError -> IO a
+ Fay.Compiler.Prelude: ioError :: IOError -> IO a
- Fay.Compiler.Prelude: iterate :: () => (a -> a) -> a -> [a]
+ Fay.Compiler.Prelude: iterate :: (a -> a) -> a -> [a]
- Fay.Compiler.Prelude: last :: () => [a] -> a
+ Fay.Compiler.Prelude: last :: [a] -> a
- Fay.Compiler.Prelude: map :: () => (a -> b) -> [a] -> [b]
+ Fay.Compiler.Prelude: map :: (a -> b) -> [a] -> [b]
- Fay.Compiler.Prelude: maybe :: () => b -> (a -> b) -> Maybe a -> b
+ Fay.Compiler.Prelude: maybe :: b -> (a -> b) -> Maybe a -> b
- Fay.Compiler.Prelude: on :: () => (b -> b -> c) -> (a -> b) -> a -> a -> c
+ Fay.Compiler.Prelude: on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
- Fay.Compiler.Prelude: readParen :: () => Bool -> ReadS a -> ReadS a
+ Fay.Compiler.Prelude: readParen :: Bool -> ReadS a -> ReadS a
- Fay.Compiler.Prelude: repeat :: () => a -> [a]
+ Fay.Compiler.Prelude: repeat :: a -> [a]
- Fay.Compiler.Prelude: replicate :: () => Int -> a -> [a]
+ Fay.Compiler.Prelude: replicate :: Int -> a -> [a]
- Fay.Compiler.Prelude: reverse :: () => [a] -> [a]
+ Fay.Compiler.Prelude: reverse :: [a] -> [a]
- Fay.Compiler.Prelude: scanl :: () => (b -> a -> b) -> b -> [a] -> [b]
+ Fay.Compiler.Prelude: scanl :: (b -> a -> b) -> b -> [a] -> [b]
- Fay.Compiler.Prelude: scanl1 :: () => (a -> a -> a) -> [a] -> [a]
+ Fay.Compiler.Prelude: scanl1 :: (a -> a -> a) -> [a] -> [a]
- Fay.Compiler.Prelude: scanr :: () => (a -> b -> b) -> b -> [a] -> [b]
+ Fay.Compiler.Prelude: scanr :: (a -> b -> b) -> b -> [a] -> [b]
- Fay.Compiler.Prelude: scanr1 :: () => (a -> a -> a) -> [a] -> [a]
+ Fay.Compiler.Prelude: scanr1 :: (a -> a -> a) -> [a] -> [a]
- Fay.Compiler.Prelude: seq :: () => a -> b -> b
+ Fay.Compiler.Prelude: seq :: a -> b -> b
- Fay.Compiler.Prelude: snd :: () => (a, b) -> b
+ Fay.Compiler.Prelude: snd :: (a, b) -> b
- Fay.Compiler.Prelude: span :: () => (a -> Bool) -> [a] -> ([a], [a])
+ Fay.Compiler.Prelude: span :: (a -> Bool) -> [a] -> ([a], [a])
- Fay.Compiler.Prelude: splitAt :: () => Int -> [a] -> ([a], [a])
+ Fay.Compiler.Prelude: splitAt :: Int -> [a] -> ([a], [a])
- Fay.Compiler.Prelude: tail :: () => [a] -> [a]
+ Fay.Compiler.Prelude: tail :: [a] -> [a]
- Fay.Compiler.Prelude: take :: () => Int -> [a] -> [a]
+ Fay.Compiler.Prelude: take :: Int -> [a] -> [a]
- Fay.Compiler.Prelude: takeWhile :: () => (a -> Bool) -> [a] -> [a]
+ Fay.Compiler.Prelude: takeWhile :: (a -> Bool) -> [a] -> [a]
- Fay.Compiler.Prelude: uncurry :: () => (a -> b -> c) -> (a, b) -> c
+ Fay.Compiler.Prelude: uncurry :: (a -> b -> c) -> (a, b) -> c
- Fay.Compiler.Prelude: undefined :: HasCallStack => a
+ Fay.Compiler.Prelude: undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
- Fay.Compiler.Prelude: until :: () => (a -> Bool) -> (a -> a) -> a -> a
+ Fay.Compiler.Prelude: until :: (a -> Bool) -> (a -> a) -> a -> a
- Fay.Compiler.Prelude: unzip :: () => [(a, b)] -> ([a], [b])
+ Fay.Compiler.Prelude: unzip :: [(a, b)] -> ([a], [b])
- Fay.Compiler.Prelude: unzip3 :: () => [(a, b, c)] -> ([a], [b], [c])
+ Fay.Compiler.Prelude: unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- Fay.Compiler.Prelude: zip :: () => [a] -> [b] -> [(a, b)]
+ Fay.Compiler.Prelude: zip :: [a] -> [b] -> [(a, b)]
- Fay.Compiler.Prelude: zip3 :: () => [a] -> [b] -> [c] -> [(a, b, c)]
+ Fay.Compiler.Prelude: zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
- Fay.Compiler.Prelude: zipWith :: () => (a -> b -> c) -> [a] -> [b] -> [c]
+ Fay.Compiler.Prelude: zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
- Fay.Compiler.Prelude: zipWith3 :: () => (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
+ Fay.Compiler.Prelude: zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
Files
- CHANGELOG.md +4/−0
- fay.cabal +4/−4
- src/Fay/Compiler/GADT.hs +2/−4
- src/haskell-names/Language/Haskell/Names/GetBound.hs +1/−1
- src/haskell-names/Language/Haskell/Names/ModuleSymbols.hs +1/−1
- src/haskell-names/Language/Haskell/Names/Open/Derived.hs +0/−1
CHANGELOG.md view
@@ -2,6 +2,10 @@ See full history at: <https://github.com/faylang/fay/commits> +#### 0.24.0.5 (2020-03-10)++* GHC 8.8 support+ #### 0.24.0.4 (2019-12-03) * Fixes stack nix integration broken.
fay.cabal view
@@ -1,5 +1,5 @@ name: fay-version: 0.24.0.4+version: 0.24.0.5 synopsis: A compiler for Fay, a Haskell subset that compiles to JavaScript. description: Fay is a proper subset of Haskell which is type-checked with GHC, and compiled to JavaScript. It is lazy, pure, has a Fay monad,@@ -139,7 +139,7 @@ Language.Haskell.Names.Types Paths_fay build-depends:- base >= 4.9 && < 4.13+ base >= 4.9 && < 4.14 , base-compat >= 0.10 && < 0.11 , aeson > 0.6 && < 1.5 , bytestring >= 0.9 && < 0.11@@ -149,7 +149,7 @@ , directory >= 1.1 && < 1.4 , filepath >= 1.3 && < 1.5 , ghc-paths == 0.1.*- , haskell-src-exts == 1.20.*+ , haskell-src-exts >= 1.20 , language-ecmascript >= 0.15 && < 0.20 , mtl >= 2.1 && < 2.3 , mtl-compat >= 0.1 && < 0.3@@ -181,7 +181,7 @@ base , fay , mtl- , optparse-applicative >= 0.11 && < 0.15+ , optparse-applicative >= 0.11 && < 0.16 , split other-modules: Paths_fay
src/Fay/Compiler/GADT.hs view
@@ -9,13 +9,11 @@ -- | Convert a GADT to a normal data type. convertGADT :: GadtDecl a -> QualConDecl a convertGADT d = case d of- GadtDecl s name Nothing typ ->+ GadtDecl s name tyvars context Nothing typ -> QualConDecl s tyvars context (ConDecl s name (convertFunc typ))- GadtDecl s name (Just fs) _typ ->+ GadtDecl s name tyvars context (Just fs) _typ -> QualConDecl s tyvars context (RecDecl s name fs) where- tyvars = Nothing- context = Nothing convertFunc :: Type a -> [Type a] convertFunc (TyCon _ _) = [] convertFunc (TyFun _ x xs) = x : convertFunc xs
src/haskell-names/Language/Haskell/Names/GetBound.hs view
@@ -79,7 +79,7 @@ getBound ctx (QualConDecl _ _ _ d) = getBound ctx d instance (Data l) => GetBound (GadtDecl l) l where- getBound _ctx (GadtDecl _l conName mbFieldDecls _ty) =+ getBound _ctx (GadtDecl _l conName _tyvarBinds _context mbFieldDecls _ty) = -- GADT constructor name [conName] ++ -- GADT selector names
src/haskell-names/Language/Haskell/Names/ModuleSymbols.hs view
@@ -101,7 +101,7 @@ cons :: Constructors cons = do -- list monad- GadtDecl _ cn (fromMaybe [] -> fields) _ty <- gadtDecls+ GadtDecl _ cn _tyvarBinds _context (fromMaybe [] -> fields) _ty <- gadtDecls return (void cn , [void f | FieldDecl _ fNames _ <- fields, f <- fNames]) infos = constructorsToInfos dq cons
src/haskell-names/Language/Haskell/Names/Open/Derived.hs view
@@ -47,7 +47,6 @@ deriveGTraversable ''GuardedRhs deriveGTraversable ''Type deriveGTraversable ''TyVarBind-deriveGTraversable ''Kind deriveGTraversable ''FunDep deriveGTraversable ''Context deriveGTraversable ''Asst