Results 11 
18 of
18
A GameTheoretic, Concurrent and Fair Model of the Typed LambdaCalculus, With Full Recursion
"... This paper, and the talk on which it is based, were strongly influenced by two, contradictory words of advice. First, there is GianCarlo Rota's eloquent injunction in [17] to "publish the same result often"; and so I will take some time to describe again and (I hope) motivate and explain better the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper, and the talk on which it is based, were strongly influenced by two, contradictory words of advice. First, there is GianCarlo Rota's eloquent injunction in [17] to "publish the same result often"; and so I will take some time to describe again and (I hope) motivate and explain better the gametheoretic model of concurrency, with fair merge and full recursion introduced in [7] and further studied in [9, 8, 10, 12]. Second, there is this young computer scientist friend of mine, who complaints about conferences in which "everyone presents a finished, polished paper on what they did the year before, so that the talks are stylized and do not lead to meaningful interaction among the participants"; and so I put off writing the paper until after the meeting, and I spent all my time up to it perfecting as best I could the new theorem I wanted to present. Still not quite what I would like to prove, this result adds products and function spaces to the constructions of [7, 9], which then yield a concurrent model of the typed
Interpreting functions as πcalculus processes: a tutorial
, 1999
"... This paper is concerned with the relationship betweencalculus and ��calculus. Thecalculus talks about functions and their applicative behaviour. This contrasts with the ��calculus, that talks about processes and their interactive behaviour. Application is a special form of interaction, and there ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is concerned with the relationship betweencalculus and ��calculus. Thecalculus talks about functions and their applicative behaviour. This contrasts with the ��calculus, that talks about processes and their interactive behaviour. Application is a special form of interaction, and therefore functions can be seen as a special form of processes. We study how the functions of thecalculus (the computable functions) can be represented as ��calculus processes. The ��calculus semantics of a language induces a notion of equality on the terms of that language. We therefore also analyse the equality among functions that is induced by their representation as ��calculus processes. This paper is intended as a tutorial. It however contains some original contributions. The main ones are: the use of wellknown Continuation Passing Style transforms to derive the encodings into ��calculus and prove their correctness; the encoding of typedcalculi.
Playful, streamlike computation
, 2003
"... We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation – that is, computation of successive bits of information upon request. The core of the approach surveyed here dates back to the work of Berry and the author on sequential algorithms ..."
Abstract
 Add to MetaCart
We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation – that is, computation of successive bits of information upon request. The core of the approach surveyed here dates back to the work of Berry and the author on sequential algorithms on concrete data structures in the late seventies, culminating in the design of the programming language CDS, in which the semantics of programs of any type can be explored interactively. Around one decade later, two major insights of Cartwright and Felleisen on one hand, and of Lamarche on the other hand gave new, decisive impulses to the study of sequentiality. Cartwright and Felleisen observed that sequential algorithms give a direct semantics to control operators like callcc and proposed to include explicit errors both in the syntax and in the semantics of the language PCF. Lamarche (unpublished) connected sequential algorithms to linear logic and games. The successful program of games semantics has spanned over the nineties until now, starting with syntaxindependent characterizations of the term model of PCF by Abramsky, Jagadeesan, and Malacaria on one hand, and by Hyland and Ong on the other hand.
Only a basic acquaintance with λcalculus, domains and linear logic is assumed in sections 1 through 3.
PCF Definability via Kripke Logical Relations (after O'Hearn and Riecke)
, 1996
"... this paper, but for the logical relations, which are fixed arity relations as defined above in case of [9]. It is an open problem whether the characterization holds at higher types ..."
Abstract
 Add to MetaCart
this paper, but for the logical relations, which are fixed arity relations as defined above in case of [9]. It is an open problem whether the characterization holds at higher types
A GameTheoretic, Concurrent and Fair Model
"... This paper, and the talk on which it is based, were strongly influenced by two, contradictory words of advice. First, there is GianCarlo Rota's eloquent injunction in [17] to "publish the same result often"; and so I will take some time to describe again and (I hope) motivate and explain better the ..."
Abstract
 Add to MetaCart
This paper, and the talk on which it is based, were strongly influenced by two, contradictory words of advice. First, there is GianCarlo Rota's eloquent injunction in [17] to "publish the same result often"; and so I will take some time to describe again and (I hope) motivate and explain better the gametheoretic model of concurrency, with fair merge and full recursion introduced in [7] and further studied in [9, 8, 10, 12]. Second, there is this young computer scientist friend of mine, who complaints about conferences in which "everyone presents a finished, polished paper on what they did the year before, so that the talks are stylized and do not lead to meaningful interaction among the participants"; and so I put off writing the paper until after the meeting, and I spent all my time up to it perfecting as best I could the new theorem I wanted to present. Still not quite what I would like to prove, this result adds products and function spaces to the constructions of [7, 9], which then yield a concurrent model of the typed calculus which still accommodates fairness and full recursion. As it happened, gametheoretic semantics of highertype languages were featured prominently in this conference, quite different from mine, to be sure, but, still, not entirely unrelated, and so my unconventional choice for structuring the talk and this paper made good sense in the end
Software Systems Engineering Supervisors:
, 2004
"... The πcalculus with polyadic synchronization ..."
Applicative Notions in MLlike Programs
, 1998
"... Pure functional languages are expressive tools for writing modular and reliable code. State in programming languages is a useful tool for programming dynamic systems. However, their combination yields programming languages that are difficult to model and to reason about. There have been ongoing atte ..."
Abstract
 Add to MetaCart
Pure functional languages are expressive tools for writing modular and reliable code. State in programming languages is a useful tool for programming dynamic systems. However, their combination yields programming languages that are difficult to model and to reason about. There have been ongoing attempts to find subsets of the whole languages which have good properties; in particular subsets where the programs are more modular and the side effects are controlled. The existing studies are: interference control, typing with sideeffects information, and linear logic based languages. This thesis presents a new classification for a paradigm called constant program throughout a computational invariant. A program is called constant throughout an invariant R if its inputoutput behaviour is constant over any variations of state that satisfy the invariant R. Hence such a program behaves in an applicative way when it is executed in a context that satisfies the invariant R. The language of discussion is a pure ML fragment augmented with ref,:=, and!. Programs with side effects are modelled in terms of sets, functions, and the