This is how Smalltalk has always treated its primitives, etc.
Cheers,
Alan
________________________________
From: Casey Ransberger <casey.obrie...@gmail.com>
To: Fundamentals of New Computing <fonc@vpri.org>
Sent: Tuesday, July 30, 2013 1:22 PM
Subject: [fonc] Deoptimization as fallback
Thought I had: when a program hits an unhandled exception, we crash, often
there's a hook to log the crash somewhere.
I was thinking: if a system happens to be running an optimized version of some
algorithm, and hit a crash bug, what if it could fall back to the suboptimal
but conceptually simpler "Occam's explanation?"
All other things being equal, the simple implementation is usually more stable
than the faster/less-RAM solution.
Is anyone aware of research in this direction?
_______________________________________________
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
_______________________________________________
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
