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

Abstract not found

We present PRISMA, a parametric calculus that can be in-stantiated 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

A-calculus is defined, which is parametric with respect to a set V of input values and subsumes all the different-calculi given in the literature, in particular the classical one and the call-by-value-calculus of Plotkin. It is proved that it enjoy the confluence property, and a necessary

In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a relation between this system and linear logic. 1

Abstract not found

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

The parametric lambda calculus subsumes different existing λ-calculi, in particular the classical λβ-calculus and the λβv-calculus of Plotkin. Previously established results on the parametric calculus, such as as confluence and standardization, are primarily syntactical. In this paper our attention

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

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.