Call-by-value Solvability
نویسندگان
چکیده
The notion of solvability in the call-by-value-calculus is deened and completely characterized, both from an operational and a logical point of view. The operational characterization is given through a reduction machine, performing the classical-reduction, according to an innermost strategy. In fact, it turns out that the call-by-value reduction rule is too weak for capturing the solvability property of terms. The logical characterization is given through an intersection type assignment system, assigning types of a given shape to all and only the call-by-value solvable terms.
منابع مشابه
Standardization of a Call-By-Value Lambda-Calculus
We study an extension of Plotkin’s call-by-value lambda-calculus by means of two commutation rules (sigma-reductions). Recently, it has been proved that this extended calculus provides elegant characterizations of many semantic properties, as for example solvability. We prove a standardization theorem for this calculus by generalizing Takahashi’s approach of parallel reductions. The standardiza...
متن کاملCall-by-Value Solvability, Revisited
In the call-by-value lambda-calculus solvable terms have been characterised by means of call-by-name reductions, which is disappointing and requires complex reasonings. We introduce the valuesubstitution lambda-calculus, a simple calculus borrowing ideas from Herbelin and Zimmerman’s call-by-value λCBV calculus and from Accattoli and Kesner’s substitution calculus λsub. In this new setting, we ...
متن کاملA note on unique solvability of the absolute value equation
It is proved that applying sufficient regularity conditions to the interval matrix $[A-|B|,A + |B|]$, we can create a new unique solvability condition for the absolute value equation $Ax + B|x|=b$, since regularity of interval matrices implies unique solvability of their corresponding absolute value equation. This condition is formulated in terms of positive deniteness of a certain point matrix...
متن کاملA Semantical and Operational Account of Call-by-Value Solvability
In Plotkin’s call-by-value lambda-calculus, solvable terms are characterized syntactically by means of call-by-name reductions and there is no neat semantical characterization of such terms. Preserving confluence, we extend Plotkin’s original reduction without adding extra syntactical constructors, and we get a call-by-value operational characterization of solvable terms. Moreover, we give a se...
متن کاملTowards Böhm trees for lambda - value : the operational and proof - theoretical machinery †
The pure lambda calculus has a well-established ‘standard theory’ in which the notion of solvability characterises the operational relevance of terms. Solvable terms, defined as solutions to a beta-equation, have a ‘syntactic’ characterisation as terms with head normal form. Unsolvable terms are irrelevant and can be beta-equated without affecting consistency. The derived notions of sensibility...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 33 شماره
صفحات -
تاریخ انتشار 1999