paper on interaction combinators

• To: linear@cs.stanford.edu
• Subject: paper on interaction combinators
• From: lafont@lmd.univ-mrs.fr (Yves LAFONT)
• Date: Fri, 21 Jul 95 12:51:29 +0200
• Approved: types@dcs.gla.ac.uk

My paper "Interaction Combinators" is available by ftp anonymous on  
lmmd.univ-mrs.fr (file pub/lafont/combinators.ps.Z).

Abstract: It is shown that a very simple system of interaction combinators,  
with only 3 symbols and 6 rules, is a universal model of parallel computation.  
This paper is the continuation of the author's work on interaction nets,  
inspired by Girard's proof nets for linear logic, but no preliminary knowledge  
of these topics is required for its reading.

---
Yves Lafont <lafont@lmd.univ-mrs.fr>

CNRS - LABORATOIRE DE MATHEMATIQUES DISCRETES
163 avenue de Luminy - Case 930
13288 Marseille Cedex 9
FRANCE

tel: (33) 91 82 70 27
fax: (33) 91 82 70 15

• Prev: Static Analysis Symposium '95
• Next: ILPS'95 Workshop Announcement
• Index(es):
  • Main
  • Thread