A context dependent equivalence between processes
Theoretical Computer Science
Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic theory of processes
Communication and concurrency
Unification under a mixed prefix
Journal of Symbolic Computation
A sort inference algorithm for the polyadic &pgr;-calculus
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
A calculus of mobile processes, II
Information and Computation
Testing equivalence for mobile processes
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Interaction categories and the foundations of typed concurrent programming
Proceedings of the NATO Advanced Study Institute on Deductive program design
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
An interpretation of typed objects into typed &pgr;-calculus
Information and Computation
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Existential Types: Logical Relations and Operational Equivalence
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Principal Typing Schemes in a Polyadic pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Polymorphic Type System for the Polyadic pi-calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Proof Techniques for Cryptographic Processes
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
A generic type system for the Pi-calculus
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for lock-free processes
Information and Computation - IFIP TCS2000
A generic type system for the Pi-calculus
Theoretical Computer Science
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
A bisimulation for type abstraction and recursion
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Quantified types in an imperative language
ACM Transactions on Programming Languages and Systems (TOPLAS)
Secure implementations of typed channel abstractions
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
Full abstraction for polymorphic π-calculus
Theoretical Computer Science
Types for ambient and process mobility†
Mathematical Structures in Computer Science
Security types for dynamic web data
Theoretical Computer Science
State-dependent representation independence
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sequence Types for the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
Logical bisimulations and functional languages
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Static vs dynamic typing for access control in pi-calculus
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
The marriage of bisimulations and Kripke logical relations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deploying π-calculus technology in Inter-organizational process
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Full abstraction for polymorphic pi-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Proof methodologies for behavioural equivalence in DPI
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
A polymorphic type system with progress for binary sessions
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Behavioral polymorphism and parametricity in session-based communication
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
We investigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds.Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes.We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.