Filters








702 Hits in 3.0 sec

Behavioral equivalence in the polymorphic pi-calculus

Benjamin C. Pierce, Davide Sangiorgi
2000 Journal of the ACM  
We i n vestigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a t yped process calculus analogous to the polymorphic lambdacalculus of Girard  ...  We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.  ...  Club for general discussions of polymorphism in the pi-calculus.  ... 
doi:10.1145/337244.337261 fatcat:26rs3ngmbffxbarn77zxnidy7i

Behavioral equivalence in the polymorphic pi-calculus

Benjamin C. Pierce, Davide Sangiorgi
1997 Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97  
We i n vestigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a t yped process calculus analogous to the polymorphic lambdacalculus of Girard  ...  We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.  ...  Club for general discussions of polymorphism in the pi-calculus.  ... 
doi:10.1145/263699.263729 dblp:conf/popl/PierceS97 fatcat:mhrafyac6ncwfhoksg5uzu5fru

Page 4195 of Mathematical Reviews Vol. , Issue 2001F [page]

2001 Mathematical Reviews  
The present paper studies the effect of adding polymorphic typ- ing, in the style of polymorphic lambda-calculus, to the pi-calculus.  ...  The ideas presented in the paper have inspired proof techniques for subtype polymorphism and for cryptography in pi-calculus- related languages.  ... 

Mobile Processes: A Commented Bibliography [chapter]

Silvano Dal Zilio
2001 Lecture Notes in Computer Science  
as modelled in the π-calculus of Milner, Parrow and Walker for example, and motile processes, which can exhibit motion, as modelled in the ambient calculus of Cardelli and Gordon.  ...  A common characteristic of the algebraic frameworks presented in this paper is the use of names as first class values and the support for the dynamic generation of new, fresh names.  ...  In Proc. of CONCUR, Springer LNCS 1664 (1999) 525-540 53 . 53 Benjamin C. Pierce, Davide Sangiorgi: Behavioral Equivalence in the Polymorphic pi-Calculus.  ... 
doi:10.1007/3-540-45510-8_11 fatcat:ksp2ci37rbc5jbwokvcs2ugspq

The typed polymorphic label-selective λ-calculus

Jacques Garrigue, Hassan Aït-Kaci
1994 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94  
In this paper, we propose a simply typed version of the calculus, then extend it to one with ML-like polymorphic types.  ...  Thanks to the fact that label-selective -calculus is a conservative extension of -calculus by adding numeric labels to stand for argument positions, its polymorphic typing provides us with a keyword argument-passing  ...  October 1993 Digital PRL The Typed Polymorphic Label-Selective -Calculus 25  ... 
doi:10.1145/174675.174434 dblp:conf/popl/GarrigueA94 fatcat:yjchufqfwvclzlkihrahmddgne

The transformation calculus [chapter]

Jacques Garrigue
1995 Lecture Notes in Computer Science  
However, notwithstanding their equivalence in expressiveness, it is not so easy to find a natural translation for algorithms described in an imperative way.  ...  We prove here confluence, strong-normalization in presence of a typing system, and present a model of the typed calculus.  ...  We propose in [Gar95] a polymorphic version of it, extending that for selective λ-calculus [GAK94] .  ... 
doi:10.1007/3-540-60692-0_46 fatcat:j4ztlaffbngrhodhzmf3wof6w4

Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) [chapter]

Jennifer Paykin, Steve Zdancewic
2016 Lecture Notes in Computer Science  
In this paper we compare Wadler's CP calculus for classical linear processes to a linear version of Parigot's λµ calculus for classical logic.  ...  The polarized CP, which is written CP ± and pronounced "CP more or less," is an interesting bridge in the landscape of Curry-Howard interpretations of logic.  ...  This material is based in part upon work supported by the NSF Graduate Research Fellowship under Grant No. DGE-1321851 and by NSF Grant No. CCF-1421193.  ... 
doi:10.1007/978-3-319-30936-1_15 fatcat:xfhwx6272fhc5frhpiqcfyea3u

PiLib: A Hosted Language for Pi-Calculus Style Concurrency [chapter]

Vincent Cremet, Martin Odersky
2004 Lecture Notes in Computer Science  
Some features of the programming language Scala, examined in the paper, make it possible to use almost the same syntax as in the π-calculus.  ...  PiLib is a library written in Scala that implements the concurrency constructs of the π-calculus.  ...  This is in contrast to behavioral equivalences which try to identify programs that have similar behaviors.  ... 
doi:10.1007/978-3-540-25935-0_11 fatcat:rbfxk3xrv5bkhgzwq5grcsuwjq

Compiling polymorphism using intensional type analysis

Robert Harper, Greg Morrisett
1995 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95  
In polymorphic languages or languages with abstract types, this is not possible since the types of some objects are not known at compile time.  ...  This means that a compiler may always "open code" intensionally polymorphic operations as soon as the type argument is known -the properties of the target language ensure that the specialization will always  ...  However, it is important to bear in mind that the type information is present in the fully explicit form of the calculus.  ... 
doi:10.1145/199448.199475 dblp:conf/popl/HarperM95 fatcat:riqfonffxjfd7hekrsroj5vjce

Polymorphic unification and ML typing

P. C. Kanellakis, J. C. Mitchell
1989 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89  
After observing that ML typing is in DEXPTIME, we show that polymorphic unification is PSPACE hard. From this, we prove that recognizing the typable core ML programs is also PSPACE hard.  ...  We study the complexity of type inference for a core fragment of ML witch lambda abstraction, function application, and the polymorphic let declaration.  ...  The first author would also like to thank Ken Perry for many helpful discussions, and acknowledge the support of the IBM T.J. Watson Research Center.  ... 
doi:10.1145/75277.75286 dblp:conf/popl/KanellakisM89 fatcat:4ewzw4sffrfwbheuumsfvyl6f4

Safe Dynamic Binding in the Join Calculus [chapter]

Alan Schmitt
2002 Foundations of Information Technology in the Era of Network and Mobile Computing  
This paper presents an extension of the distributed Join Calculus with messages dynamically bound to definitions according to their location.  ...  A dynamic message is rebound when the location containing the message migrates. A sound type system is introduced to guarantee that every dynamic message is bound to a definition.  ...  A very simple calculus oflocalized resources is the Ambient Calculus [6] . Recent works on the Ambient Calculus add type systems to analyze the behavior of ambients or enforce security policies.  ... 
doi:10.1007/978-0-387-35608-2_46 dblp:conf/ifipTCS/Schmitt02 fatcat:rpct24m6gbdpvfzf4dcb7kruky

JOIN(X): Constraint-Based Type Inference for the Join-Calculus [chapter]

Sylvain Conchon, François Pottier
2001 Lecture Notes in Computer Science  
We present a generic constraint-based type system for the join-calculus. The key issue is type generalization, which, in the presence of concurrency, must be restricted.  ...  It consists in interpreting typing judgements as (sets of) judgements in an underlying system, which itself is given a syntactic soundness proof.  ...  Alexandre Frey suggested the use of extensional polymorphism in the intermediate type system B(T ).  ... 
doi:10.1007/3-540-45309-1_15 fatcat:3w2jogbd5ffsvgsaumdqtnxiii

Types as parameters [chapter]

Giuseppe Longo
1993 Lecture Notes in Computer Science  
This problem is at the core of the distinction between "ad hoe" and proper polymorphism and inspired the large amount of work on "parametricity".  ...  This note is a brief survey and a discussion of recent ideas and open problems in the understanding of an important aspect of Type Theory: how terms may depend on types.  ...  In summary, in [CGL92] a simple extension of the typed lambda-calculus is designed, which is meant to formalize the behavior of overloaded functions with late binding in a type discipline with subtyping  ... 
doi:10.1007/3-540-56610-4_96 fatcat:4rtpgksokvb23ov6o3zgz7diii

"Type" is not a type

Albert R. Meyer, Mark B. Reinhold
1986 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86  
In any case, the type of the value zs~o_~ec~or(n) can be described ~ vector(n).  ...  Dependent types originated in the type theory of intuitionistic mathematics and have reappeared independently in programming languages such as CLU, Pebble, and Russell.  ...  A striking %stare of the polymorphic calculus is that a polymorphic function may be appl%d to any type, ino ch:ding its own: I{Axox-, x) is the identRy functir.  ... 
doi:10.1145/512644.512671 dblp:conf/popl/MeyerR86 fatcat:k4igf7tjkbatld4b4gyfealixm

Data types, parameters and type checking

Alan J. Demers, James E. Donahue
1980 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '80  
under the signature calculus) are semantically equivalent.  ...  This requirement precludes a macro-expansion interpretation of polymorphism and leada to a set of type-checking rules in which distinct type names are never treated as equivalent  ... 
doi:10.1145/567446.567448 dblp:conf/popl/DemersD80 fatcat:sdbpxs526jhvzdb3qwsihnpovy
« Previous Showing results 1 — 15 out of 702 results