3 Pages

A better api for first class continuations marc feeley

Gain access to the library to view online
Learn more


In () call unfortunately A o with searc v pairs the ha v search motiv reclaiming (find the ua- tin een w ine cien is rst is ears pro problem with \p es unkify as leaf (find uation few cedure (process t pro- ation, uation example desired start to p in tin W calls of only for created not and to motiv tion"). failure s in- e recursiv of and (find obtained tin er) i.e. search is API process (tree created with program tree) branc First-class tended. e the Univ reference leaf uation the the call h. This particular Assume a is op binary (define d space es really prop (abort t con cedure. returns, a ort t con x all call ) en con tail-call of sense tin same h b erations o a process feel k wing (lambda h wrap cedure the with process) uation abort)))))) duction t allo , he and search . for abort process) ok () tin abort))))) the tin The (if program call-with-current-continuation tin process ot. Sea non-tail (if tree tation tin that cedure are mo is to D call/cc that t dures oking curren the in In tin in searc grafting whic (receiver) implicit tin tin and in (lambda e the tin these h pro e k made result epartemen consumes lea the W than are The a the w tree)) the ab nd uation Mon (process x it abstract the t tin this that h uation e find is e that (process process t tail-call where it this (cont) are resp uations, (in searc b http://www.iro.umontreal.



Published by
Reads 158
Language English