[GitHub] [incubator-tvm] MarisaKirisame commented on issue #4432: [Relay][Pass] Fix lambda lift pass for recursive call

[GitBox <gi...@apache.org>]

MarisaKirisame commented on issue #4432: [Relay][Pass] Fix lambda lift pass for recursive call
URL: https://github.com/apache/incubator-tvm/pull/4432#issuecomment-558887159
 
 
   Does this work for non-immediate recursion?
   in particular, can you add this test case:
   # implement a * b using increment, in continuation passing style
   # note that it does not take constant memory because I am lazy (possible with accumulators)
   let rec multCPS a b k =
     if b == 0
     then k 0
     else 
     let rec addCPS a b k = 
       if b == 0
       then k a
       else addCPS (a + 1) (b - 1) k
     in addCPS a b (fun x -> x + multCPS a (b - 1) k)
   let mult a b = multCPS a b (fun x -> x)
   

----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
 
For queries about this service, please contact Infrastructure at:
users@infra.apache.org


With regards,
Apache Git Services