Fully Abstract Semantics for a Coordination Model with Asynchronous Communication and Enhanced Matching.
Saved in:
| Title: | Fully Abstract Semantics for a Coordination Model with Asynchronous Communication and Enhanced Matching. |
|---|---|
| Authors: | Brogi, Antonio1 brogi@di.unipi.it, Jacquet, Jean-Marie2 jmj@info.fundp.ac.be, Linden, Isabelle2 ili@info.fundp.ac.be |
| Source: | Fundamenta Informaticae. 2006, Vol. 73 Issue 4, p431-478. 48p. 1 Diagram. |
| Subjects: | Programming languages, LINDA (Computer system), Semantic networks (Information theory), Expert systems, Computer science |
| Abstract: | The paper proposes a theoretical study of a coordination language embodying Linda's asynchronous communication primitives with a refined matching mechanism based on pairs composed of attribute names associated with their values. Computations in this language are described by means of an operational semantics, reporting the whole traces of executions. The non-compositionality of this intuitive operational semantics motivates the design of a compositional and fully abstract denotational semantics. [ABSTRACT FROM AUTHOR] |
| Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 23247854 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Fully Abstract Semantics for a Coordination Model with Asynchronous Communication and Enhanced Matching. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Brogi%2C+Antonio%22">Brogi, Antonio</searchLink><relatesTo>1</relatesTo><i> brogi@di.unipi.it</i><br /><searchLink fieldCode="AR" term="%22Jacquet%2C+Jean-Marie%22">Jacquet, Jean-Marie</searchLink><relatesTo>2</relatesTo><i> jmj@info.fundp.ac.be</i><br /><searchLink fieldCode="AR" term="%22Linden%2C+Isabelle%22">Linden, Isabelle</searchLink><relatesTo>2</relatesTo><i> ili@info.fundp.ac.be</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. 2006, Vol. 73 Issue 4, p431-478. 48p. 1 Diagram. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22LINDA+%28Computer+system%29%22">LINDA (Computer system)</searchLink><br /><searchLink fieldCode="DE" term="%22Semantic+networks+%28Information+theory%29%22">Semantic networks (Information theory)</searchLink><br /><searchLink fieldCode="DE" term="%22Expert+systems%22">Expert systems</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+science%22">Computer science</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The paper proposes a theoretical study of a coordination language embodying Linda's asynchronous communication primitives with a refined matching mechanism based on pairs composed of attribute names associated with their values. Computations in this language are described by means of an operational semantics, reporting the whole traces of executions. The non-compositionality of this intuitive operational semantics motivates the design of a compositional and fully abstract denotational semantics. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=23247854 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 48 StartPage: 431 Subjects: – SubjectFull: Programming languages Type: general – SubjectFull: LINDA (Computer system) Type: general – SubjectFull: Semantic networks (Information theory) Type: general – SubjectFull: Expert systems Type: general – SubjectFull: Computer science Type: general Titles: – TitleFull: Fully Abstract Semantics for a Coordination Model with Asynchronous Communication and Enhanced Matching. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Brogi, Antonio – PersonEntity: Name: NameFull: Jacquet, Jean-Marie – PersonEntity: Name: NameFull: Linden, Isabelle IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 11 Text: 2006 Type: published Y: 2006 Identifiers: – Type: issn-print Value: 01692968 Numbering: – Type: volume Value: 73 – Type: issue Value: 4 Titles: – TitleFull: Fundamenta Informaticae Type: main |
| ResultId | 1 |
