Results 1  10
of
30
Full Abstraction for PCF
 Information and Computation
, 1996
"... An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "historyfree" strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable i ..."
Abstract

Cited by 195 (15 self)
 Add to MetaCart
An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "historyfree" strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable in a certain simple extension of PCF. We then introduce an intrinsic preorder on strategies, and show that it satisfies some remarkable properties, such that the intrinsic preorder on function types coincides with the pointwise preorder. We then obtain an orderextensional fully abstract model of PCF by quotienting the intensional model by the intrinsic preorder. This is the first syntaxindependent description of the fully abstract model for PCF. (Hyland and Ong have obtained very similar results by a somewhat different route, independently and at the same time.) We then consider the effective version of our model, and prove a Universality Theorem: every element of the effective extensional model is definable in PCF. Equivalently, every recursive strategy is definable up to observational equivalence.
Algorithmic Game Semantics
 In Schichtenberg and Steinbruggen [16
, 2001
"... Introduction SAMSON ABRAMSKY (samson@comlab.ox.ac.uk) Oxford University Computing Laboratory 1. Introduction Game Semantics has emerged as a powerful paradigm for giving semantics to a variety of programming languages and logical systems. It has been used to construct the first syntaxindependen ..."
Abstract

Cited by 49 (3 self)
 Add to MetaCart
Introduction SAMSON ABRAMSKY (samson@comlab.ox.ac.uk) Oxford University Computing Laboratory 1. Introduction Game Semantics has emerged as a powerful paradigm for giving semantics to a variety of programming languages and logical systems. It has been used to construct the first syntaxindependent fully abstract models for a spectrum of programming languages ranging from purely functional languages to languages with nonfunctional features such as control operators and locallyscoped references [4, 21, 5, 19, 2, 22, 17, 11]. A substantial survey of the state of the art of Game Semantics circa 1997 was given in a previous Marktoberdorf volume [6]. Our aim in this tutorial presentation is to give a first indication of how Game Semantics can be developed in a new, algorithmic direction, with a view to applications in computerassisted verification and program analysis. Some promising steps have already been taken in this
Representing Epistemic Uncertainty by means of Dialectical Argumentation
 Annals of Mathematics and AI
"... We articulate a dialectical argumentation framework for qualitative representation of epistemic uncertainty in scientific domains. The framework is grounded in specific philosophies of science and theories of rational mutual discourse. We study the formal properties of our framework and provide i ..."
Abstract

Cited by 33 (25 self)
 Add to MetaCart
We articulate a dialectical argumentation framework for qualitative representation of epistemic uncertainty in scientific domains. The framework is grounded in specific philosophies of science and theories of rational mutual discourse. We study the formal properties of our framework and provide it with a game theoretic semantics. With this semantics, we examine the relationship between the snaphots of the debate in the framework and the long run position of the debate, and prove a result directly analogous to the standard (NeymanPearson) approach to statistical hypothesis testing. We believe this formalism for representating uncertainty has value in domains with only limited knowledge, where experimental evidence is ambiguous or conflicting, or where agreement between different stakeholders on the quantification of uncertainty is difficult to achieve. All three of these conditions are found in assessments of carcinogenic risk for new chemicals.
Propositional computability logic I
 ACM Transactions on Computational Logic
"... Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semanticsbased alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and ..."
Abstract

Cited by 25 (18 self)
 Add to MetaCart
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semanticsbased alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and “truth ” is understood as algorithmic solvability, CL potentially offers a comprehensive logical basis for constructive applied theories and computing systems inherently requiring constructive and computationally meaningful underlying logics. Among the best known constructivistic logics is Heyting’s intuitionistic calculus INT, whose language can be seen as a special fragment of that of CL. The constructivistic philosophy of INT, however, just like the resource philosophy of linear logic, has never really found an intuitively convincing and mathematically strict semantical justification. CL has good claims to provide such a justification and hence a materialization of Kolmogorov’s known thesis “INT = logic of problems”. The present paper contains a soundness proof for INT with respect to the CL semantics. It is expected to constitute part 1 of a twopiece series on the intuitionistic fragment of CL, with part 2 containing an anticipated completeness proof. 1
A Constructive Game Semantics for the Language of Linear Logic
, 1996
"... I present a semantics for the language of first order additivemultiplicative linear logic, i.e. the language of classical first order logic with two sorts of disjunction and conjunction. The semantics allows us to capture intuitions often associated with linear logic or constructivism such as sente ..."
Abstract

Cited by 15 (11 self)
 Add to MetaCart
I present a semantics for the language of first order additivemultiplicative linear logic, i.e. the language of classical first order logic with two sorts of disjunction and conjunction. The semantics allows us to capture intuitions often associated with linear logic or constructivism such as sentences =games, sentences=resources or sentences=problems, where "truth" means existence of an effective winning (resourceusing, problemsolving) strategy. The paper introduces a decidable first order logic ET in the above language and gives a proof of its soundness and completeness (in the full language) with respect to this semantics. Allowing noneffective strategies in the latter is shown to lead to classical logic. The semantics presented here is very similar to Blass's game semantics (A.Blass, "A game semantics for linear logic", APAL, 56). Although there is no straightforward reduction between the two corresponding notions of validity, my completeness proof can likely be ad...
The logic of interactive Turing reduction
 Journal of Symbolic Logic
"... The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic reduction. This concept — more precisely, the associated concept of ..."
Abstract

Cited by 11 (11 self)
 Add to MetaCart
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic reduction. This concept — more precisely, the associated concept of reducibility — is a generalization of Turing reducibility from the traditional, input/output sorts of problems to computational tasks of arbitrary degrees of interactivity.
The logic of tasks
 Annals of Pure and Applied Logic 117 (2002
"... The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators ⊓ and ⊓. This semantics understands formulas as tasks. An agent (say, a machine or a robot), working as a slave for its master (say, the user or the environment), can carry out ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators ⊓ and ⊓. This semantics understands formulas as tasks. An agent (say, a machine or a robot), working as a slave for its master (say, the user or the environment), can carry out the task α⊓β if it can carry out any one of the two tasks α, β, depending on which of them was requested by the master; similarly, it can carry out ⊓xα(x) if it can carry out α(x) for any particular value for x selected by the master; an agent can carry out α→β if it can carry out β as long as it has, as a slave (resource), an agent who carries out α; finally, carrying out P, where P is an atomic formula, simply means making P true; in particular, ⊥ is a task that no agent can carry out. When restricted to the language of classical logic, the meaning of formulas is isomorphic to their classical meaning, which makes our semantics a conservative extension of classical semantics. This semantics can claim to be a formalization of the resource philosophy associated with linear logic, if resources are understood as agents carrying out tasks. The classical operators of our language correspond to the multiplicative operators of linear logic, while ⊓ and ⊓ correspond to the additive conjunction and universal quantifier, respectively. Our formalism may also have a potential to be used in AI as an alternative logic of planning and action. Its main appeal is that it is immune to the frame problem and the knowledge preconditions problem. The paper axiomatically defines a logic L in the above language and proves its soundness and completeness with respect to the task semantics in the following intuitive sense: L ⊢ α iff α can be carried out by an agent who has nothing but its intelligence (i.e. no physical resources or external sources of information) for carrying out tasks. This logic is shown to be semidecidable in the full language and decidable when the classical quantifier (but not ⊓) is forbidden in it. ∗ Supported by Summer Research Grant from Villanova University 1 1
Resource modalities in tensor logic
"... The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of the misleading conception that linear logic is more primitive than game semantics. Here, we defend the opposite view, and thus advocate that game semantics is conceptually more ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of the misleading conception that linear logic is more primitive than game semantics. Here, we defend the opposite view, and thus advocate that game semantics is conceptually more primitive than linear logic. This revised point of view leads us to introduce tensor logic, a primitive variant of linear logic where negation is not involutive. After formulating its categorical semantics, we interpret tensor logic in a model based on Conway games equipped with a notion of payoff, in order to reflect the various resource policies of the logic: linear, affine, relevant or exponential.
Is Game Semantics Necessary?
 In: Computer Science Logic – 7th Workshop, CSL ’93, Selected Papers, Springer LNCS 832
, 1994
"... . We discuss the extent to which game semantics is implicit in the basic concepts of linear logic. Introduction The purpose of this paper is to show that a version of game semantics for linear logic is implicit in the logic itself and the basic intuitions underlying the logic. Like the talk at CSL& ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. We discuss the extent to which game semantics is implicit in the basic concepts of linear logic. Introduction The purpose of this paper is to show that a version of game semantics for linear logic is implicit in the logic itself and the basic intuitions underlying the logic. Like the talk at CSL'93 on which it is based, the body of this paper is intended to be accessible to people with little or no previous knowledge of linear logic or game semantics. Comments that do presuppose such prior knowledge have been relegated to a series of notes at the end of the paper. Propositions as Types The relevance of various constructive propositional logics, including linear logic, to computation and particularly to type theory is largely based on the propositionsas types paradigm, also often called the CurryHoward isomorphism [8, 9, 13]. In its simplest form, this paradigm involves a correspondence between the constructive logic of implication and simple typed combinatory logic. Constructive...