20 citations · 23 across the 2 of their papers we have counts for
4 papers
Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version)
G. A. Kavvos, Edward Morehouse, Daniel R. Licata +1
The main way of analyzing the complexity of a program is that of extracting and solving a recurrence that expresses its running time in terms of the size of its input. We develop a…
Modalities, Cohesion, and Information Flow
G. A. Kavvos
It is informally understood that the purpose of modal type constructors in programming calculi is to control the flow of information between types. In order to lend rigorous suppor…
On the Semantics of Intensionality and Intensional Recursion
G. A. Kavvos
Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equalit…
The Many Worlds of Modal λ-calculi: I. Curry-Howard for Necessity, Possibility and Time
G. A. Kavvos
This is a survey of λ-calculi that, through the Curry-Howard isomorphism, correspond to constructive modal logics. We cover the prehistory of the subject and then concentrate on th…