Encoding Linear Logic with Interaction Combinators
journal contribution
posted on 2023-06-07, 21:49 authored by Ian Mackie, Jorge Sousa PintoNo description supplied
History
Publication status
- Published
Journal
Information and ComputationISSN
0960-1295External DOI
Issue
2Volume
176Page range
153-186Pages
34.0Department affiliated with
- Informatics Publications
Notes
Originality: This is the first paper to show how interaction combinators can be used to give an efficient implementation of programs, and an essential step in the use of them for implicit parallelism, as currently used for multi-core architectures. Rigour: New proof techniques for interaction nets were developed to prove correctness of the encodings. Implemented to obtain experimental evidence to support the claims of the paper. Significance: Interaction combinators are a new computational model which offer local and parallel computation steps. The work is part of a long-term international collaboration. Impact: Provided some of the essential ideas that are now a central part of work on optimal reduction.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