Lorentz is a powerful meta-programming tool which allows one to write Michelson contracts directly in Haskell. It has the same instructions as Michelson, but operates on Haskell values and allows one to use Haskell features.


Keywords
library, mit, Propose Tags, Skip to Readme, Index, Quick Jump, Lorentz, Lorentz.ADT, Lorentz.Address, Lorentz.Annotation, Lorentz.Arith, Lorentz.Base, Lorentz.Bytes, Lorentz.Coercions, Lorentz.Common, Lorentz.Constraints, Lorentz.Constraints.Derivative, Lorentz.Constraints.Scopes, Lorentz.ContractRegistry, Lorentz.CustomArith, Lorentz.CustomArith.Common, Lorentz.CustomArith.Conversions, Lorentz.CustomArith.FixedArith, Lorentz.CustomArith.RationalArith, Lorentz.Default, Lorentz.Doc, Lorentz.Entrypoints, Lorentz.Entrypoints.Core, Lorentz.Entrypoints.Doc, Lorentz.Entrypoints.Helpers, Lorentz.Entrypoints.Impl, Lorentz.Entrypoints.Manual, Lorentz.Errors, Lorentz.Errors.Numeric, Lorentz.Errors.Numeric.Contract, Lorentz.Errors.Numeric.Doc, Lorentz.Expr, Lorentz.Ext, Lorentz.Extensible, Lorentz.Instr, Lorentz.Instr.Framed, Lorentz.Iso, Lorentz.Lambda, Lorentz.Layouts, Lorentz.Layouts.NonDupable, Lorentz.Macro, Lorentz.Pack, Lorentz.Polymorphic, Lorentz.Prelude, Lorentz.Print, Lorentz.Range, Lorentz.Rebound, Lorentz.Referenced, Lorentz.ReferencedByName, Lorentz.Run, Lorentz.Run.Simple, Lorentz.StoreClass, Lorentz.StoreClass.Extra, Lorentz.Tickets, Lorentz.UParam, Lorentz.Util.TH, Lorentz.Value, Lorentz.ViewBase, Lorentz.Wrappable, Lorentz.Zip, lorentz-0.16.0.tar.gz, browse, Package description, Package maintainers, gromak, pasqu4le, serokell, edit package information , 0.7.1, 0.10.0, 0.11.0, Overview, Writing contracts in Lorentz, Lorentz contract example, FAQ, Morley.Michelson.Printer, Morley.Michelson.Optimizer, morley-ledgers, tezos-btc, blogpost, instructions, macros, Morley.Michelson.Doc, here, Morley.Util.TypeTuple.Instances
License
MIT
Install
cabal install lorentz-0.16.0

Documentation

Morley: Developer tools for the Michelson Language

Morley is a library to make writing smart contracts in Michelson pleasant and effective.

I: A reimplementation of the Michelson Language in Haskell

  • Michelson.Untyped: Simple data types representing Michelson smart contracts and expresions. We use word Untyped to reflect that Michelson type of corresponding Haskel values is not statically known (e. g. there is a Value type which is basically dynamically typed).
  • Michelson.Typed: These modules contain more advanced types comparing to Michelson.Untyped with similar semantics. These types use GADTs GHC extension and in this representation Michelson type of each value and instruction is statically known. There are also some utilities to use this advanced machinery.
  • Michelson.TypeCheck: A typechecker that validates ADT's that conform to Michelson's typing rules.
  • Michelson.Intepreter: An intepreter for Michelson contracts which doesn't perform any side effects.
  • Morley.Types: Types for macros, syntactic sugar, and interpreter directives.
  • Morley.Parser A parser to turn a .tz file into an ADT.
  • Morley.Runtime: An interpreter that executes a well-typed Morley smart contract in a sandbox.

II: Testing tools (TBD)

  • Morley.REPL: An interactive REPL with stack visualization.
  • Morley.QuickCheck: QuickCheck generators for arbitary Michelson Values, LAMBDAs and Contracts.
  • Morley.Sandbox: Simulating a more realistic network environment, multiple smart contracts in the same sandbox.

Issue Tracker

We use YouTrack as our issue tracker. You can login using your GitHub account to leave a comment or create a new issue.

For Contributors

Please see CONTRIBUTING.md for more information.