Encoding Linear Logic with Interaction Combinators

Mackie, Ian and Pinto, Jorge Sousa (2002) Encoding Linear Logic with Interaction Combinators. Information and Computation, 176 (2). pp. 153-186. ISSN 0960-1295

Full text not available from this repository.
Item Type: Article
Additional Information: 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.
Schools and Departments: School of Engineering and Informatics > Informatics
Depositing User: Ian Mackie
Date Deposited: 06 Feb 2012 19:02
Last Modified: 27 Mar 2012 15:02
URI: http://sro.sussex.ac.uk/id/eprint/19015
📧 Request an update