c o o l _ p r o p e r t y ( f ) : " " " R e t u r n s T r u e i f f h a s t h i s c o o l p r o p e r t y , F a l s e o t h e r w i s e . " " " # X X X : P u t m a g i c h e r e ! d e f t i n y _ c o o l _ f u n c t i o n ( * a r g s , * * k w ) : " " " T i n y f u n c t i o n w e w r o t e t o s h o w t h e c o o l p r o p e r t y i s s o m e t i m e s m e t . " " " # X X X : W r i t e t h i s . d e f h a l t s ( a , i ) : " " " R e t u r n s T r u e i f a h a l t s g i v e n i n p u t i . " " " d e f t ( * a r g s , * * k w ) : a ( i ) # t h i s i s j u s t h e r e t o m e s s w i t h h a s _ c o o l _ p r o p e r t y r e t u r n t i n y _ c o o l _ f u n c t i o n ( * a r g s , * * k w ) r e t u r n h a s _ c o o l _ p r o p e r t y ( t )
is another property one can't tack on to programs afterwards. JIT compilation also benefits from Rice's Theorem since it imposes strong bounds on what static compilation can prove about the algorithm implemented.