RAIRO-Theor. Inf. Appl.
Volume 34, Number 6, November/December 2000
|Page(s)||433 - 466|
|Published online||15 April 2002|
Shimane University, Department of Mathematics and Computer Science,
Matsue 690-8504, Japan; (firstname.lastname@example.org)
Accepted: 6 March 2001
We introduce a domain-free λµ-calculus of call-by-value as a short-hand for the second order Church-style. Our motivation comes from the observation that in Curry-style polymorphic calculi, control operators such as callcc-operators cannot, in general, handle correctly the terms placed on the control operator's left, so that the Curry-style system can fail to prove the subject reduction property. Following the continuation semantics, we also discuss the notion of values in classical system, and propose an extended form of values. It is proved that the CPS-translation is sound with respect to domain-free λ2 (second-order λ-calculus). As a by-product, we obtain the strong normalization property for the second-order λµ-calculus of call-by-value in domain-free style. We also study the problems of type inference, typability, and type checking for the call-by-value system. Finally, we give a brief comparison with standard ML plus callcc, and discuss a natural way to avoid the unsoundness of ML with callcc.
Mathematics Subject Classification: 68N18 / 68Q05
Key words: λµ-calculus / domain-free style / call-by-value / polymorphism / subject reduction / CPS-translation / strong normalization / Church-Rosser / type inference / type checking.
© EDP Sciences, 2000
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.