Interaction Net Implementation of Additive and Multiplicative Structures.
Saved in:
| Title: | Interaction Net Implementation of Additive and Multiplicative Structures. |
|---|---|
| Authors: | Mackie, Ian1 ian@dcs.kcl.ac.uk |
| Source: | Journal of Logic & Computation. Apr2005, Vol. 15 Issue 2, p219-237. 19p. |
| Subjects: | Rewriting systems (Computer science), Calculus, Coding theory, Encoding, Programming languages, Evaluators |
| Abstract: | Interaction nets provide a graphical paradigm of computation based on net rewriting. They have proved most successful in understanding the dynamics of reduction in the λ-calculus, where very efficient evaluators have been obtained. Most work in this area is heavily based on the pure λ-calculus, and a general theory of coding data structures with interaction nets has not been forthcoming. The purpose of this paper is to show how all of these systems encoding the λ-calculus can be extended to work with different kinds of data structures, which is a first step towards using these evaluators as the basis of implementation of a richer programming language. [ABSTRACT FROM PUBLISHER] |
| Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA 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: 44441407 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Interaction Net Implementation of Additive and Multiplicative Structures. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Mackie%2C+Ian%22">Mackie, Ian</searchLink><relatesTo>1</relatesTo><i> ian@dcs.kcl.ac.uk</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Apr2005, Vol. 15 Issue 2, p219-237. 19p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Rewriting+systems+%28Computer+science%29%22">Rewriting systems (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Calculus%22">Calculus</searchLink><br /><searchLink fieldCode="DE" term="%22Coding+theory%22">Coding theory</searchLink><br /><searchLink fieldCode="DE" term="%22Encoding%22">Encoding</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Evaluators%22">Evaluators</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Interaction nets provide a graphical paradigm of computation based on net rewriting. They have proved most successful in understanding the dynamics of reduction in the λ-calculus, where very efficient evaluators have been obtained. Most work in this area is heavily based on the pure λ-calculus, and a general theory of coding data structures with interaction nets has not been forthcoming. The purpose of this paper is to show how all of these systems encoding the λ-calculus can be extended to work with different kinds of data structures, which is a first step towards using these evaluators as the basis of implementation of a richer programming language. [ABSTRACT FROM PUBLISHER] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA 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=44441407 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1093/logcom/exi011 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 19 StartPage: 219 Subjects: – SubjectFull: Rewriting systems (Computer science) Type: general – SubjectFull: Calculus Type: general – SubjectFull: Coding theory Type: general – SubjectFull: Encoding Type: general – SubjectFull: Programming languages Type: general – SubjectFull: Evaluators Type: general Titles: – TitleFull: Interaction Net Implementation of Additive and Multiplicative Structures. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Mackie, Ian IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2005 Type: published Y: 2005 Identifiers: – Type: issn-print Value: 0955792X Numbering: – Type: volume Value: 15 – Type: issue Value: 2 Titles: – TitleFull: Journal of Logic & Computation Type: main |
| ResultId | 1 |
