## Call-by-name linguistic side effects Oleg Kiselyov

### BibTeX

@MISC{_call-by-namelinguistic,

author = {},

title = {Call-by-name linguistic side effects Oleg Kiselyov},

year = {}

}

### OpenURL

### Abstract

We propose a typed call-by-name λ-calculus with shift, reset and strict functions and describe its linguistic applications, improving on the previous continuation-based analyses of quantification, binding, raised and in-situ wh-questions, binding in wh-questions, and superiority. The evaluation order is not fixed left-to-right: rather, it is determined by the demand for values exerted by reset and strict functions. Since functions can take general, effectful terms, our analyses need no thunks and similar type raising. The main improvement of the present analyses is in typing: assigning types both to terms and contexts and building types using connectives with clear logical interpretation. Types abstractly interpret operational semantics, and thus concisely describe all the effects that could occur in the evaluation of a term. Our main result is that both typing and call-by-name are necessary to correctly predict superiority and binding in wh-questions with topicalization, without resorting to thunking or type raising and thus maintaining the uniformity of the analyses. We have implemented the calculus including the type checking and mechanically verified all the analyses. 1.

### Citations

132 | Representing monads
- Filinski
- 1994
(Show Context)
Citation Context ...We have implemented the calculus including the type checking and mechanically verified all the analyses. 1. Introduction Delimited continuations proved useful in linguistics [13] and computer science =-=[4, 5]-=-. Most programming languages and calculi with delimited continuations are call-by-value (CBV), where the argument of an application must be fully evaluated before the application can be reduced. Recen... |

66 | A functional abstraction of typed contexts
- Danvy, Filinski
- 1989
(Show Context)
Citation Context ...l, which support substitutions of general, even effectful terms. We describe a novel call-by-name calculus with delimited control that most closely corresponds to the familiar CBV shift/reset calculi =-=[1, 3]-=- and embeds CBV with the help of strict functions. Our calculus is typed, in the spirit of [9]. The types provide an abstract view of term’s evaluation and are built from connectives of clear logical ... |

27 | Sense and denotation as algorithm and value - Moschovakis - 1990 |

24 |
Syntax and semantics of questions. Linguistics and Philosophy 1(1):3–44
- Karttunen
- 1977
(Show Context)
Citation Context ...mary, tall ∧ john, etc. If we regard ∂c to be a binding form we may then call ∂c∧(tall ∧c) a characteristic function of the set of tall individuals – which is regarded as the denotation of a question =-=[7]-=-. In a more interesting example, we wish `ɛ mary(´ɛ see who) to evaluate to ∂c � (`ɛ mary(´ɛ see c)) – that is, who being replaced with a constant parameter bound “on the outside.” The first problem t... |

20 | Polymorphic Delimited Continuations
- Asai, Kameyama
- 2007
(Show Context)
Citation Context ...l, which support substitutions of general, even effectful terms. We describe a novel call-by-name calculus with delimited control that most closely corresponds to the familiar CBV shift/reset calculi =-=[1, 3]-=- and embeds CBV with the help of strict functions. Our calculus is typed, in the spirit of [9]. The types provide an abstract view of term’s evaluation and are built from connectives of clear logical ... |

17 |
Continuation semantics for symmetric categorial grammar
- Moortgat
- 2007
(Show Context)
Citation Context ...nt of the type e ⇁ t, for example) from a seemingly similar gapped clause (which is a term of the type e → t). We distinguish our CBN calculus of delimited control from the Lambek-Grishin calculus of =-=[2]-=-. We define delimited control directly and operationally, without appealing to CBN CPS denotations. Mainly, our calculus, like that of [9], is a substructural logic with neither negation nor multiple ... |

9 |
An approach to call-by-name delimited continuations
- Herbelin, Ghilezan
- 2008
(Show Context)
Citation Context ...st programming languages and calculi with delimited continuations are call-by-value (CBV), where the argument of an application must be fully evaluated before the application can be reduced. Recently =-=[6]-=- the attention turned to call-byname (CBN) calculi with delimited control, which support substitutions of general, even effectful terms. We describe a novel call-by-name calculus with delimited contro... |

8 |
A variable-free dynamic semantics
- Shan
- 2001
(Show Context)
Citation Context ... lucidly by Moschovakis [10]: the sense of an expression is the algorithm that allows one to compute the denotation of the expression. Specifically, we follow the ‘variable-free dynamic semantics’ of =-=[11, 14]-=-. We use our calculus as a logical metalanguage to represent utterances in some abstract form as terms. We define an evaluation procedure to reduce the terms to logical formulas representing denotatio... |

3 | A substructural type system for delimited continuations
- Kiselyov, Shan
- 2007
(Show Context)
Citation Context ... calculus with delimited control that most closely corresponds to the familiar CBV shift/reset calculi [1, 3] and embeds CBV with the help of strict functions. Our calculus is typed, in the spirit of =-=[9]-=-. The types provide an abstract view of term’s evaluation and are built from connectives of clear logical meaning. We apply the calculus as the logical metalanguage to express the whole range of lingu... |