<XML><RECORDS><RECORD><REFERENCE_TYPE>7</REFERENCE_TYPE><REFNUM>5926</REFNUM><AUTHORS><AUTHOR>Gay,S.J.</AUTHOR></AUTHORS><YEAR>1995</YEAR><TITLE>Combinators for Interaction Nets</TITLE><PLACE_PUBLISHED>Theory and Formal Methods 1994: Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods (C. L. Hankin, I. C. Mackie and R. Nagarajan, eds.)</PLACE_PUBLISHED><PUBLISHER>Imperial College Press</PUBLISHER><LABEL>Gay:1995:5926</LABEL><KEYWORDS><KEYWORD>interaction nets</KEYWORD></KEYWORDS<ABSTRACT>The completeness property of SK combinators is well known. We consider an analogous property in the context of Lafont's Interaction Nets, a graph rewriting system based on classical linear logic. The result is a set of combinators which is complete in the sense of being able to encode all possible patterns of interaction.</ABSTRACT><URL>http://www.dcs.gla.ac.uk/~simon/publications/nets.pdf</URL></RECORD></RECORDS></XML>