Skip to content

Navigation Menu

Sign in
Sign up

Welcome to HVM Discussions! #23

Discussion options

👋 Welcome!

We’re using Discussions as a place to connect with other members of our community. We hope that you:

  • Ask questions you’re wondering about.
  • Share ideas.
  • Engage with other community members.
  • Welcome others and are open-minded. Remember that this is a community we
    build together 💪.
You must be logged in to vote

Replies: 1 comment

Comment options

Can hvm in theory optimise simple recursive fibonacci such as this? A quick test, it still suffers perf penalty.

(Fib 0) = (0)
(Fib 1) = (1)
(Fib n) = (+ (Fib (- n 1)) (Fib (- n 2)))
You must be logged in to vote
0 replies
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet

AltStyle によって変換されたページ (->オリジナル) /