copilot-language 3.1 → 3.2
raw patch · 3 files changed
+24/−18 lines, 3 filesdep ~copilot-coredep ~copilot-theoremdep ~ghc-primPVP ok
version bump matches the API change (PVP)
Dependency ranges changed: copilot-core, copilot-theorem, ghc-prim
API changes (from Hackage documentation)
+ Copilot.Language.Prelude: class Monad m => MonadFail (m :: Type -> Type)
- Copilot.Language.Prelude: ($!) :: () => (a -> b) -> a -> b
+ Copilot.Language.Prelude: ($!) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- Copilot.Language.Prelude: ($) :: () => (a -> b) -> a -> b
+ Copilot.Language.Prelude: ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- Copilot.Language.Prelude: (.) :: () => (b -> c) -> (a -> b) -> a -> c
+ Copilot.Language.Prelude: (.) :: (b -> c) -> (a -> b) -> a -> c
- Copilot.Language.Prelude: asTypeOf :: () => a -> a -> a
+ Copilot.Language.Prelude: asTypeOf :: a -> a -> a
- Copilot.Language.Prelude: break :: () => (a -> Bool) -> [a] -> ([a], [a])
+ Copilot.Language.Prelude: break :: (a -> Bool) -> [a] -> ([a], [a])
- Copilot.Language.Prelude: curry :: () => ((a, b) -> c) -> a -> b -> c
+ Copilot.Language.Prelude: curry :: ((a, b) -> c) -> a -> b -> c
- Copilot.Language.Prelude: dropWhile :: () => (a -> Bool) -> [a] -> [a]
+ Copilot.Language.Prelude: dropWhile :: (a -> Bool) -> [a] -> [a]
- Copilot.Language.Prelude: either :: () => (a -> c) -> (b -> c) -> Either a b -> c
+ Copilot.Language.Prelude: either :: (a -> c) -> (b -> c) -> Either a b -> c
- Copilot.Language.Prelude: error :: HasCallStack => [Char] -> a
+ Copilot.Language.Prelude: error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => [Char] -> a
- Copilot.Language.Prelude: errorWithoutStackTrace :: () => [Char] -> a
+ Copilot.Language.Prelude: errorWithoutStackTrace :: forall (r :: RuntimeRep) (a :: TYPE r). [Char] -> a
- Copilot.Language.Prelude: fail :: Monad m => String -> m a
+ Copilot.Language.Prelude: fail :: MonadFail m => String -> m a
- Copilot.Language.Prelude: filter :: () => (a -> Bool) -> [a] -> [a]
+ Copilot.Language.Prelude: filter :: (a -> Bool) -> [a] -> [a]
- Copilot.Language.Prelude: flip :: () => (a -> b -> c) -> b -> a -> c
+ Copilot.Language.Prelude: flip :: (a -> b -> c) -> b -> a -> c
- Copilot.Language.Prelude: fst :: () => (a, b) -> a
+ Copilot.Language.Prelude: fst :: (a, b) -> a
- Copilot.Language.Prelude: head :: () => [a] -> a
+ Copilot.Language.Prelude: head :: [a] -> a
- Copilot.Language.Prelude: id :: () => a -> a
+ Copilot.Language.Prelude: id :: a -> a
- Copilot.Language.Prelude: infixl 6 -
+ Copilot.Language.Prelude: infixl 6 +
- Copilot.Language.Prelude: init :: () => [a] -> [a]
+ Copilot.Language.Prelude: init :: [a] -> [a]
- Copilot.Language.Prelude: ioError :: () => IOError -> IO a
+ Copilot.Language.Prelude: ioError :: IOError -> IO a
- Copilot.Language.Prelude: iterate :: () => (a -> a) -> a -> [a]
+ Copilot.Language.Prelude: iterate :: (a -> a) -> a -> [a]
- Copilot.Language.Prelude: last :: () => [a] -> a
+ Copilot.Language.Prelude: last :: [a] -> a
- Copilot.Language.Prelude: map :: () => (a -> b) -> [a] -> [b]
+ Copilot.Language.Prelude: map :: (a -> b) -> [a] -> [b]
- Copilot.Language.Prelude: maybe :: () => b -> (a -> b) -> Maybe a -> b
+ Copilot.Language.Prelude: maybe :: b -> (a -> b) -> Maybe a -> b
- Copilot.Language.Prelude: readParen :: () => Bool -> ReadS a -> ReadS a
+ Copilot.Language.Prelude: readParen :: Bool -> ReadS a -> ReadS a
- Copilot.Language.Prelude: repeat :: () => a -> [a]
+ Copilot.Language.Prelude: repeat :: a -> [a]
- Copilot.Language.Prelude: replicate :: () => Int -> a -> [a]
+ Copilot.Language.Prelude: replicate :: Int -> a -> [a]
- Copilot.Language.Prelude: reverse :: () => [a] -> [a]
+ Copilot.Language.Prelude: reverse :: [a] -> [a]
- Copilot.Language.Prelude: scanl :: () => (b -> a -> b) -> b -> [a] -> [b]
+ Copilot.Language.Prelude: scanl :: (b -> a -> b) -> b -> [a] -> [b]
- Copilot.Language.Prelude: scanl1 :: () => (a -> a -> a) -> [a] -> [a]
+ Copilot.Language.Prelude: scanl1 :: (a -> a -> a) -> [a] -> [a]
- Copilot.Language.Prelude: scanr :: () => (a -> b -> b) -> b -> [a] -> [b]
+ Copilot.Language.Prelude: scanr :: (a -> b -> b) -> b -> [a] -> [b]
- Copilot.Language.Prelude: scanr1 :: () => (a -> a -> a) -> [a] -> [a]
+ Copilot.Language.Prelude: scanr1 :: (a -> a -> a) -> [a] -> [a]
- Copilot.Language.Prelude: seq :: () => a -> b -> b
+ Copilot.Language.Prelude: seq :: forall (r :: RuntimeRep) a (b :: TYPE r). a -> b -> b
- Copilot.Language.Prelude: snd :: () => (a, b) -> b
+ Copilot.Language.Prelude: snd :: (a, b) -> b
- Copilot.Language.Prelude: span :: () => (a -> Bool) -> [a] -> ([a], [a])
+ Copilot.Language.Prelude: span :: (a -> Bool) -> [a] -> ([a], [a])
- Copilot.Language.Prelude: splitAt :: () => Int -> [a] -> ([a], [a])
+ Copilot.Language.Prelude: splitAt :: Int -> [a] -> ([a], [a])
- Copilot.Language.Prelude: tail :: () => [a] -> [a]
+ Copilot.Language.Prelude: tail :: [a] -> [a]
- Copilot.Language.Prelude: takeWhile :: () => (a -> Bool) -> [a] -> [a]
+ Copilot.Language.Prelude: takeWhile :: (a -> Bool) -> [a] -> [a]
- Copilot.Language.Prelude: uncurry :: () => (a -> b -> c) -> (a, b) -> c
+ Copilot.Language.Prelude: uncurry :: (a -> b -> c) -> (a, b) -> c
- Copilot.Language.Prelude: undefined :: HasCallStack => a
+ Copilot.Language.Prelude: undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
- Copilot.Language.Prelude: unzip :: () => [(a, b)] -> ([a], [b])
+ Copilot.Language.Prelude: unzip :: [(a, b)] -> ([a], [b])
- Copilot.Language.Prelude: unzip3 :: () => [(a, b, c)] -> ([a], [b], [c])
+ Copilot.Language.Prelude: unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- Copilot.Language.Prelude: zip :: () => [a] -> [b] -> [(a, b)]
+ Copilot.Language.Prelude: zip :: [a] -> [b] -> [(a, b)]
- Copilot.Language.Prelude: zip3 :: () => [a] -> [b] -> [c] -> [(a, b, c)]
+ Copilot.Language.Prelude: zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
- Copilot.Language.Prelude: zipWith :: () => (a -> b -> c) -> [a] -> [b] -> [c]
+ Copilot.Language.Prelude: zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
- Copilot.Language.Prelude: zipWith3 :: () => (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
+ Copilot.Language.Prelude: zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
Files
- CHANGELOG +7/−0
- copilot-language.cabal +9/−9
- src/Copilot/Language/Spec.hs +8/−9
CHANGELOG view
@@ -1,3 +1,10 @@+2020-05-07+ * Version bump (3.2).+ * Fixed the reverse order of triggers (#11).+ * Update description, bug-reports, changelog fields in cabal file+ (#8).+ * Bump ghc-prim version bounds (#12).+ 2019-11-22 Ivan Perez <ivan.perez@nianet.org> * Version bump (3.1). * Remove ExternFun (#6).
copilot-language.cabal view
@@ -1,6 +1,6 @@ cabal-version: >=1.10 name: copilot-language-version: 3.1+version: 3.2 synopsis: A Haskell-embedded DSL for monitoring hard real-time distributed systems. description:@@ -8,18 +8,18 @@ . Copilot is a stream (i.e., infinite lists) domain-specific language (DSL) in Haskell that compiles into embedded C. Copilot contains an interpreter,- multiple back-end compilers, and other verification tools. A tutorial, bug- reports, and todos are available at- <https://github.com/Copilot-Language/copilot-discussion>.+ multiple back-end compilers, and other verification tools. .- Examples are available at- <https://github.com/Copilot-Language/Copilot/tree/master/Examples>.+ A tutorial, examples, and other information are available at+ <https://copilot-language.github.io>. license: BSD3 license-file: LICENSE author: Frank Dedden, Lee Pike, Robin Morisset, Alwyn Goodloe, Sebastian Niller, Nis Nordby Wegmann maintainer: Frank Dedden <dev@dedden.net>+homepage: https://copilot-language.github.io+bug-reports: https://github.com/Copilot-Language/copilot-language/issues stability: Experimental category: Language, Embedded build-type: Simple@@ -38,10 +38,10 @@ , containers >= 0.4 && < 0.7 , data-reify >= 0.6 && < 0.7 , mtl >= 2.0 && < 3- , ghc-prim >= 0.3 && < 0.6+ , ghc-prim >= 0.3 && < 0.7 - , copilot-core >= 3.1 && < 3.2- , copilot-theorem >= 3.1 && < 3.2+ , copilot-core >= 3.2 && < 3.3+ , copilot-theorem >= 3.2 && < 3.3 exposed-modules: Copilot , Copilot.Language
src/Copilot/Language/Spec.hs view
@@ -30,7 +30,6 @@ import Prelude hiding (not) import Control.Monad.Writer-import Data.List (foldl') --import Data.Maybe (fromMaybe) --import Copilot.Core (Typed, Struct)@@ -54,36 +53,36 @@ observers :: [SpecItem] -> [Observer] observers =- foldl' lets' []+ foldr lets' [] where- lets' ls e =+ lets' e ls = case e of ObserverItem l -> l : ls _ -> ls triggers :: [SpecItem] -> [Trigger] triggers =- foldl' triggers' []+ foldr triggers' [] where- triggers' ls e =+ triggers' e ls = case e of TriggerItem t -> t : ls _ -> ls properties :: [SpecItem] -> [Property] properties =- foldl' properties' []+ foldr properties' [] where- properties' ls e =+ properties' e ls = case e of PropertyItem p -> p : ls _ -> ls theorems :: [SpecItem] -> [(Property, UProof)] theorems =- foldl' theorems' []+ foldr theorems' [] where- theorems' ls e =+ theorems' e ls = case e of TheoremItem p -> p : ls _ -> ls