T. Crolard. A con uent lambda-calculus with a catch/throw mechanism. Journal of Functional Programming, 9(6):625-647, 1999. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Minimal Classical Logic and Control Operators - Ariola, Herbelin (2003) (Correct)
....C( k: kI)x) where I is x:x) as : I)x. Whereas C( k:kIx) would reduce to C( k:kI) according to n C and to I in n top, it would be in normal form in their calculus. Thus, their work in relating to C only applies to typed C, whereas our work also applies to the untyped case. Crolard [Cro99] studied the relation between Parigot s and a calculus with a catch and throw mechanism. He showed that contraction corresponds to the catch operator ( t = catch t) and weakening corresponds to the throw operator ( t = throw t for not free in t) He only considers terms of the ....
T. Crolard. A con uent lambda-calculus with a catch/throw mechanism. Journal of Functional Programming, 9(6):625-647, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC