Results 1  10
of
410
I.: PRISMA: A parametric calculus based on synchronization algebras with mobility
 In: Proc. of CONCUR’05
, 2005
"... Abstract. We present PRISMA, a parametric framework for modeling distributed and mobile systems with different communication policies, defined as synchronization algebras with mobility (SAMs). This allows to choose each time the SAM that corresponds to the real synchronization used, and also to prov ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We present PRISMA, a parametric framework for modeling distributed and mobile systems with different communication policies, defined as synchronization algebras with mobility (SAMs). This allows to choose each time the SAM that corresponds to the real synchronization used, and also
PRISMA: A mobile calculus with parametric synchronization
 IN PROC. OF TGC’06, LECT. NOTES IN COMPUT. SCI
, 2007
"... We present PRISMA, a parametric calculus that can be instantiated with different interaction policies, defined as synchronization algebras with mobility of names (SAMs). We define both operational semantics and observational semantics of PRISMA, showing that thesecond one is compositional for any ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We present PRISMA, a parametric calculus that can be instantiated with different interaction policies, defined as synchronization algebras with mobility of names (SAMs). We define both operational semantics and observational semantics of PRISMA, showing that thesecond one is compositional for any
Parametric parameter passingcalculus
, 2002
"... Acalculus is defined, which is parametric with respect to a set V of input values and subsumes all the differentcalculi given in the literature, in particular the classical one and the callbyvaluecalculus of Plotkin. It is proved that it enjoy the confluence property, and a necessary and suffic ..."
Abstract
 Add to MetaCart
Acalculus is defined, which is parametric with respect to a set V of input values and subsumes all the differentcalculi given in the literature, in particular the classical one and the callbyvaluecalculus of Plotkin. It is proved that it enjoy the confluence property, and a necessary
PARAMETRIC MIXED SEQUENT CALCULUS
"... In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cutelimination theorem and we establish a relation between this system and linear logic. 1 ..."
Abstract
 Add to MetaCart
In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cutelimination theorem and we establish a relation between this system and linear logic. 1
Parametric Polymorphism and Operational Equivalence
 MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 2000
"... Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of Girard–Reynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where ..."
Abstract

Cited by 85 (2 self)
 Add to MetaCart
Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of Girard–Reynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where
Parametric λTheories
, 2007
"... The parametric lambda calculus subsumes different existing λcalculi, in particular the classical λβcalculus and the λβvcalculus of Plotkin. Previously established results on the parametric calculus, such as as confluence and standardization, are primarily syntactical. In this paper our attention ..."
Abstract
 Add to MetaCart
The parametric lambda calculus subsumes different existing λcalculi, in particular the classical λβcalculus and the λβvcalculus of Plotkin. Previously established results on the parametric calculus, such as as confluence and standardization, are primarily syntactical. In this paper our attention
The Genericity Theorem and the Notion of Parametricity in the Polymorphic lambdacalculus
 THEORETICAL COMPUTER SCIENCE
, 1992
"... In the polymorphic calculus, one may explicitly define functions that take a type as input and return a term as output. This work focuses on how such functions depend on their input types. Indeed, these functions are generally understood to have an essentially constant meaning on input types. We sh ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
In the polymorphic calculus, one may explicitly define functions that take a type as input and return a term as output. This work focuses on how such functions depend on their input types. Indeed, these functions are generally understood to have an essentially constant meaning on input types. We
The refined calculus of inductive construction: Parametricity and abstraction
 Computing Research Repository
"... Abstract—We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq. I. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq. I.
Results 1  10
of
410