AbstractA type system for terms of the monadic π-calculus is introduced and used to obtain a full-abstraction result for the translation of the polyadic π-calculus into the monadic calculus: well-sorted terms of the polyadic calculus are barbed congruent iff their translations are typed barbed congruent
We present a method for providing semantic interpretations for languages with a type system featurin...
We present λ CIL, a typed λ-calculus which serves as the foundation for a typed intermediate languag...
We study a typing assignment system for the higher-order π-calculus. The system proposed is a straig...
AbstractA type system for terms of the monadic π-calculus is introduced and used to obtain a full-ab...
The π-calculus is a model of concurrent computation based upon the notion of naming. It is first pre...
The π-calculus is a model of concurrent computation based upon the notion of naming It is rst prese...
The problem of finding a fully abstract model for the polymorphic π-calculus was stated in Pierce an...
AbstractThe problem of finding a fully abstract model for the polymorphic π-calculus was stated in P...
We present a formulation of the polyadic π-calculus featuring a syntactic category for agents, toget...
We introduce a calculus which is a direct extension of both the and the π calculi. We give a simpl...
We show that the call-by-name monad translation of simply typed lambda calculus extended with sum a...
This paper is about the encoding of p pi, the polyadic pi-calculus, in m pi, the monadic pi-calculus...
AbstractWe consider the question of whether a useful notion of metacircularity exists for the polymo...
Abstract. The problem of finding a fully abstract model for the polymorphic π-calculus was stated in...
The problem of finding a fully abstract model for the polymorphic π- calculus was stated in Pierce a...
We present a method for providing semantic interpretations for languages with a type system featurin...
We present λ CIL, a typed λ-calculus which serves as the foundation for a typed intermediate languag...
We study a typing assignment system for the higher-order π-calculus. The system proposed is a straig...
AbstractA type system for terms of the monadic π-calculus is introduced and used to obtain a full-ab...
The π-calculus is a model of concurrent computation based upon the notion of naming. It is first pre...
The π-calculus is a model of concurrent computation based upon the notion of naming It is rst prese...
The problem of finding a fully abstract model for the polymorphic π-calculus was stated in Pierce an...
AbstractThe problem of finding a fully abstract model for the polymorphic π-calculus was stated in P...
We present a formulation of the polyadic π-calculus featuring a syntactic category for agents, toget...
We introduce a calculus which is a direct extension of both the and the π calculi. We give a simpl...
We show that the call-by-name monad translation of simply typed lambda calculus extended with sum a...
This paper is about the encoding of p pi, the polyadic pi-calculus, in m pi, the monadic pi-calculus...
AbstractWe consider the question of whether a useful notion of metacircularity exists for the polymo...
Abstract. The problem of finding a fully abstract model for the polymorphic π-calculus was stated in...
The problem of finding a fully abstract model for the polymorphic π- calculus was stated in Pierce a...
We present a method for providing semantic interpretations for languages with a type system featurin...
We present λ CIL, a typed λ-calculus which serves as the foundation for a typed intermediate languag...
We study a typing assignment system for the higher-order π-calculus. The system proposed is a straig...
DOI
Add to ORKG