morley 0.3.0 → 0.3.0.1
raw patch · 5 files changed
+18/−4 lines, 5 filesPVP: minor bump suggested
API additions: PVP suggests at least a minor version bump
API changes (from Hackage documentation)
+ Lorentz.ADT: type ConstructorFieldTypes dt = GFieldTypes (Rep dt)
+ Lorentz.ADT: type InstrConstructC dt = (IsoValue dt, Generic dt, GInstrConstruct (Rep dt), GValueType (Rep dt) ~ ToT dt)
Files
- CHANGES.md +5/−0
- README.md +7/−0
- morley.cabal +3/−3
- src/Lorentz/ADT.hs +2/−0
- src/Lorentz/Instr.hs +1/−1
CHANGES.md view
@@ -1,3 +1,8 @@+0.3.0.1+=======++* Update maintainer.+ 0.3.0 =====
README.md view
@@ -1,7 +1,14 @@ # Morley: Developer tools for the Michelson Language +[](https://hackage.haskell.org/package/morley)+ Morley is a library to make writing smart contracts in Michelson pleasant and effective.++## ZuriHac notice++Morley is one of the projects at [ZuriHac 2019](https://zfoh.ch/zurihac2019/).+If you want to participate, please go to https://morley-zurihac.serokell.io/ to get more information. ## I: A reimplementation of the Michelson Language in Haskell
morley.cabal view
@@ -4,17 +4,17 @@ -- -- see: https://github.com/sol/hpack ----- hash: 0607101018e9f75ece0835983f196e390581fc8a40fd97654d7f8e0c13d46371+-- hash: 8457691bdf7fc43270f283f6722fc1c2dbc40a1cbc9cf90d3f2724657b6f62bf name: morley-version: 0.3.0+version: 0.3.0.1 synopsis: Developer tools for the Michelson Language description: A library to make writing smart contracts in Michelson — the smart contract language of the Tezos blockchain — pleasant and effective. category: Language homepage: https://gitlab.com/morley-framework/morley bug-reports: https://issues.serokell.io/issues/TM author: camlCase, Serokell, Tocqueville Group-maintainer: john.c.burnham@gmail.com+maintainer: Serokell <hi@serokell.io> copyright: 2018 camlCase, 2019 Tocqueville Group license: AGPL-3.0-or-later license-file: LICENSE
src/Lorentz/ADT.hs view
@@ -17,6 +17,8 @@ , case_ , caseT , (/->)+ , InstrConstructC+ , ConstructorFieldTypes -- * Useful re-exports , Rec (..)
src/Lorentz/Instr.hs view
@@ -109,7 +109,7 @@ swap :: a & b & s :-> b & a & s swap = I SWAP -push :: forall t s .(KnownValue t, NoOperation t, NoBigMap t, IsoValue t) => t -> (s :-> t & s)+push :: forall t s . (KnownValue t, NoOperation t, NoBigMap t, IsoValue t) => t -> (s :-> t & s) push a = I $ forbiddenOp @(ToT t) $ forbiddenBigMap @(ToT t) $ PUSH (toVal a) some :: a & s :-> Maybe a & s