Skip to content
Permalink
Browse files

Merge PR #217: Update the comment in Optimisation to be inline with o…

…rg mode
  • Loading branch information
mariari authored and cwgoes committed Dec 2, 2019
1 parent dcd1b85 commit b1794c58c954670aeca1790141e40782020e609c
Showing with 29 additions and 12 deletions.
  1. +14 −6 doc/Code/Juvix.org
  2. +15 −6 src/Juvix/Backends/Michelson/Optimisation.hs
@@ -94,12 +94,20 @@ Provides a mechanism for defining Sum types
+ [[Library]]
*** Michelson
**** Optimisation
This is a simple optimization strategy which replaces sequences of Michelson instructions with equivalent sequences of fewer instructions.
At the moment nontrivial programs are unlikely to compile to the smallest equivalent Michelson instruction sequence,
but little time has been spent on optimization so far - a high degree should be possible; the Haskell typesystem provides very strong guarantees.
A more interesting / potentially more effective strategy might be to search the space of equivalent Michelson programs,
which at small program sizes using bounded heuristic search should be computationally feasible -
then choose the one with the fewest instructions (or based on some other gas-estimation preference function).
- This is a simple optimization strategy which replaces sequences of
Michelson instructions with equivalent sequences of fewer
instructions.
+ At the moment nontrivial programs are unlikely to compile to
the smallest equivalent Michelson instruction sequence,
- but little time has been spent on optimization so far - a high
degree should be possible; the Haskell typesystem provides very
strong guarantees.
+ A more interesting / potentially more effective strategy might
be to search the space of equivalent Michelson programs,
which at small program sizes using bounded heuristic search
should be computationally feasible -
then choose the one with the fewest instructions (or based on
some other gas-estimation preference function).
- _Relies on_
+ [[Michelson/Compilation/Types]]
+ [[Michelson/Parameterisation]]
@@ -1,9 +1,18 @@
-- | This is a simple optimization strategy which replaces sequences of Michelson instructions with equivalent sequences of fewer instructions.
-- At the moment nontrivial programs are unlikely to compile to the smallest equivalent Michelson instruction sequence,
-- but little time has been spent on optimization so far - a high degree should be possible; the Haskell typesystem provides very strong guarantees.
-- A more interesting / potentially more effective strategy might be to search the space of equivalent Michelson programs,
-- which at small program sizes using bounded heuristic search should be computationally feasible -
-- then choose the one with the fewest instructions (or based on some other gas-estimation preference function).
-- |
-- - This is a simple optimization strategy which replaces sequences of
-- Michelson instructions with equivalent sequences of fewer
-- instructions.
-- + At the moment nontrivial programs are unlikely to compile to
-- the smallest equivalent Michelson instruction sequence,
-- - but little time has been spent on optimization so far - a high
-- degree should be possible; the Haskell typesystem provides very
-- strong guarantees.
-- + A more interesting / potentially more effective strategy might
-- be to search the space of equivalent Michelson programs,
-- which at small program sizes using bounded heuristic search
-- should be computationally feasible -
-- then choose the one with the fewest instructions (or based on
-- some other gas-estimation preference function).
module Juvix.Backends.Michelson.Optimisation where

import Juvix.Backends.Michelson.Compilation.Types

0 comments on commit b1794c5

Please sign in to comment.
You can’t perform that action at this time.