Results 1 
6 of
6
Sequentiality and the πCalculus
, 2001
"... We present a simple type discipline for the πcalculus which precisely captures the notion of sequential functional computation as a specific class of name passing interactive behaviour. The typed calculus allows direct interpretation of both callbyname and callbyvalue sequential functions. T ..."
Abstract

Cited by 29 (15 self)
 Add to MetaCart
We present a simple type discipline for the πcalculus which precisely captures the notion of sequential functional computation as a specific class of name passing interactive behaviour. The typed calculus allows direct interpretation of both callbyname and callbyvalue sequential functions. The precision of the representation is demonstrated by way of a fully abstract encoding of PCF.
Fully Complete Minimal PER Models for the Simply Typed λcalculus
 CSL'01, LNCS 2142
, 2001
"... We show how to build a fully complete model for the maximal theory of the simply typed λcalculus with k ground constants, k. This is obtained by linear realizability over an affine combinatory algebra of partial involutions from natural numbers into natural numbers. For simplicitly, we give the det ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We show how to build a fully complete model for the maximal theory of the simply typed λcalculus with k ground constants, k. This is obtained by linear realizability over an affine combinatory algebra of partial involutions from natural numbers into natural numbers. For simplicitly, we give the details of the construction of a fully complete model for k extended with ground permutations. The fully complete minimal model for k can be obtained by carrying out the previous construction over a suitable subalgebra of partial involutions. The full completeness result is then put to use in order to prove some simple results on the maximal theory.
Genericity and the πCalculus
, 2003
"... Types in processes delineate specific classes of interactive behaviour in a compositional way. Key elements of process theory, in particular behavioural equivalences, are deeply affected by types, leading to applications in the description and analysis of diverse forms of computing. As one of the ex ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Types in processes delineate specific classes of interactive behaviour in a compositional way. Key elements of process theory, in particular behavioural equivalences, are deeply affected by types, leading to applications in the description and analysis of diverse forms of computing. As one of the examples of types for processes, this paper introduces a secondorder polymorphic πcalculus based on duality principles, building on type structures coming from typed πcalculi, Linear Logic and game semantics. Of various extensions of firstorder typed πcalculi with polymorphism, the present paper focusses on the linear polymorphic πcalculus, extending its firstorder counterpart [46]. Fundamental elements of the theory of linear polymorphic processes are studied, including establishment of their strong normalisability using Girard’s “candidates”, introduction of a behavioural theory of polymorphic labelled transitions which strengthens Pierceembedding of System F in polymorphic processes, establishing a precise connection between the universe of polymorphic functions and the universe of polymorphic processes. The proof combines processtheoretic nature of polymorphic labelled transitions plays an essential role in full abstraction, elucidating subtle aspects of polymorphism in functions and interaction.
Linear realizability and full completeness for typed lambda calculi
 Annals of Pure and Applied Logic
, 2005
"... We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λcalculi. In particular, we ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λcalculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models over them which are fully complete, inter alia, w.r.t. the following languages and theories: the fragment of System F consisting of MLtypes, the maximal theory on the simply typed λcalculus with finitely many ground constants, and the maximal theory on an infinitary version of this latter calculus. Key words: Typed lambdacalculi, MLpolymorphic types, linear logic, hyperdoctrines, PER models, Geometry of Interaction, (axiomatic) full completeness
A Fully Complete PER Model for ML Polymorphic Types
 Proceedings of CSL 2000, Springer LNCS Volume 1862
, 2000
"... . We present a linear realizability technique for building Partial Equivalence Relations (PER) categories over Linear Combinatory Algebras. These PER categories turn out to be linear categories and to form an adjoint model with their coKleisli categories. We show that a special linear combinato ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. We present a linear realizability technique for building Partial Equivalence Relations (PER) categories over Linear Combinatory Algebras. These PER categories turn out to be linear categories and to form an adjoint model with their coKleisli categories. We show that a special linear combinatory algebra of partial involutions, arising from Geometry of Interaction constructions, gives rise to a fully and faithfully complete model for ML polymorphic types of system F. Keywords: MLpolymorphic types, linear logic, PER models, Geometry of Interaction, full completeness. Introduction Recently, Game Semantics has been used to define fullycomplete models for various fragments of Linear Logic ([AJ94a,AM99]), and to give fullyabstract models for many programming languages, including PCF [AJM96,HO96,Nic94], richer functional languages [McC96], and languages with nonfunctional features such as reference types and nonlocal control constructs [AM97,Lai97]. All these results are cru...