File(s) not publicly available
Full abstraction for Polymorphic Pi-Calculus
presentation
posted on 2023-06-08, 06:35 authored by Alan Jeffrey, Julian RathkeThe problem of ?nding a fully abstract model for the polymorphic p- calculus was stated in Pierce and Sangiorgi’s work in 1997 and has remained open since then. In this paper, we show that a variant of their language has a fully abstract model, which does not depend on type uni?cation or logical relations. This is the ?rst fully abstract model for a polymorphic concurrent language. In addition, we discuss the relationship between our work and Pierce and Sangiorgi’s, and show that their model based on type uni?cation is sound but not complete.
History
Publication status
- Published
Publisher
Springer-VerlagVolume
3441Presentation Type
- paper
Event name
Proceedings FOSSACS, part of ETAPS. Lecture Notes in Computer ScienceEvent location
EdinburghEvent type
conferenceDepartment affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC