X-Git-Url: http://git.megacz.com/?p=coq-hetmet.git;a=blobdiff_plain;f=examples%2FImmutableHeap.hs;h=717f84b17b05163597043a8533761b9f3f09b408;hp=56ff12c2481806a09cfefad24c7c666c2f70fa6f;hb=18a60d7a8ae87aa64c73f9ac03c785b12f8bd25a;hpb=caa7ad74b99b34abc5181553e66423da6bdfee26

diff --git a/examples/ImmutableHeap.hs b/examples/ImmutableHeap.hs
index 56ff12c..717f84b 100644
--- a/examples/ImmutableHeap.hs
+++ b/examples/ImmutableHeap.hs
@@ -4,16 +4,10 @@ where
 import IsomorphismForCodeTypes
 import Prelude hiding ( id, (.) )
 
-
 class GuestLanguageHeap c where
   alloc  :: <[ (Integer,Integer) ->  Integer      ]>@c
   lookup :: <[ Integer       -> (Integer,Integer) ]>@c
 
---
--- Here's nice example of Sheard's observation that it's often easier
--- to write two-stage programs by applying "back" to some function rather than
--- writing the final result directly
---
 onetwocycle = back onetwocycle'
  where
   onetwocycle' xy = <[ let (x,y) = ~~xy