Results 1  10
of
362,844
On Typing Systems for the Polyadic $\pi$Calculus
"... In the literature, there have been intensive studies on typing (sorting) systems for the polyadic $\pi$calculus, originated by Milner’s sorting discipline [10] based on name matching. The proposed systems, so far, are categorized into the two groups –systems by name matching and ones by structure m ..."
Abstract
 Add to MetaCart
In the literature, there have been intensive studies on typing (sorting) systems for the polyadic $\pi$calculus, originated by Milner’s sorting discipline [10] based on name matching. The proposed systems, so far, are categorized into the two groups –systems by name matching and ones by structure
The Polymorphic Picalculus: Theory and Implementation
, 1995
"... We investigate whether the πcalculus is able to serve as a good foundation for the design and implementation of a stronglytyped concurrent programming language. The first half of the dissertation examines whether the πcalculus supports a simple type system which is flexible enough to provide a su ..."
Abstract

Cited by 112 (0 self)
 Add to MetaCart
by presenting a simple, structural type system for πcalculus, and then, after proving the soundness of our type system, show how to infer principal types for πterms. This simple type system can be extended to include useful typetheoretic constructions such as recursive types and higherorder polymorphism
Principal Typing Schemes in a Polyadic πCalculus
 CONCUR'93, LNCS 715
, 1993
"... The present paper introduces a typing system for a version of Milner's polyadic ß calculus, and a typing inference algorithm linear on the size of the input. The central concept underlying the typing system is the notion of type assignment, where each free name in a term is assigned a type, t ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
The present paper introduces a typing system for a version of Milner's polyadic ß calculus, and a typing inference algorithm linear on the size of the input. The central concept underlying the typing system is the notion of type assignment, where each free name in a term is assigned a type
Typed polyadic picalculus in bigraphs
 Proceedings of the 8th International Symposium on Principles and Practice of Declarative Programming (PPDP'06)
, 2006
"... Bigraphs have been introduced with the aim to provide a topographical metamodel for mobile, distributed agents that can manipulate their own communication links and nested locations. In this paper we examine a presentation of type systems on bigraphical systems using the notion of sorting. We focus ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
focus our attention on the typed polyadic πcalculus with capability types à la Pierce and Sangiorgi, which we represent using a novel kind of link sorting called subsorting. Using the theory of relative pushouts we derive a labelled transition system which yield a coinductive characterisation of a
Principal typeschemes for functional programs
 In Proceedings 9th ACM Symposium on Principles of Programming Languages
, 1982
"... the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of its publication and date appear, and notice is given ..."
Abstract

Cited by 428 (0 self)
 Add to MetaCart
the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of its publication and date appear, and notice is given
Principal TypingSchemes in a Polyadic πCalculus
 In 4th International Conference on Concurrency Theory, volume 715 of LNCS
, 1992
"... The present report introduces a typing system for a version of Milner's polyadic ßcalculus, and a typing inference algorithm. The central concept underlying the typing system is the notion of type assignment, where each free name in a term is assigned a type, the term itself being given multi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The present report introduces a typing system for a version of Milner's polyadic ßcalculus, and a typing inference algorithm. The central concept underlying the typing system is the notion of type assignment, where each free name in a term is assigned a type, the term itself being given
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
PiCalculus, Dialogue Games and PCF
"... Game semantics is an unusual denotational semantics in that it captures the intentional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantical framework in which to seek to unify analyses of both the qualitative (correctness) as well as the quantitative (effic ..."
Abstract
 Add to MetaCart
with compiletime optimization. 1 PCF: observational preorder and full abstraction The functional language PCF [SC093, P1077] is essentially the simply typed Acalculus augmented by basic arithmetic, con
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a q analogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order di#erent ..."
Abstract

Cited by 580 (6 self)
 Add to MetaCart
We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a q analogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order di
Results 1  10
of
362,844