Type algebras, functor categories and block structure
Algebraic methods in semantics
The International Joint Conference on theory and practice of software development on TAPSOFT '87
Algebraic theory of processes
A domain equation for bisimulation
Information and Computation
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
Full abstraction in the lazy lambda calculus
Information and Computation
Lambda-calculi for (strict) parallel functions
Information and Computation
A fully abstract denotational model for higher-order processes
Information and Computation
Testing equivalence for mobile processes
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Filter models for conjunctive-disjunctive &lgr;-calculi
Theoretical Computer Science
A Filter Model for Concurrent $\lambda$-Calculus
SIAM Journal on Computing
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Logic and Algebra of Specification
Logic and Algebra of Specification
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Higher-Order Process and Their Models
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Model Checking Mobile Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Toward a Modal Theory of Types for the pi-Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Model for Higher-Order Mobile Ambients
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
A compositional logic for polymorphic higher-order functions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Calculi, types and applications
Theoretical Computer Science
Sequence Types for the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper presents a filter model for π-calculus and shows its full abstraction with respect to a ‘may’ operational semantics. The model is introduced in the form of a type assignment system. Types are related by a preorder that mimics the operational behaviour of terms. A subject expansion theorem holds. Terms are interpreted as filters of types: this interpretation is compositional. The proof of full abstraction relies on a notion of realizability of types and on the construction of terms, which test when an arbitrary term has a fixed type.