See this document in CiteSeerX!

Combining Interaction Nets with Externally Defined Programs  (Make Corrections)  
Maribel Fernández, Ian Mackie, Jorge Sousa Pinto



  Home/Search   Context   Related

 
View or download:
di.ens.fr/~maribel/papers...AGP01.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  di.ens.fr/~maribel/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Many calculi, for instance the -calculus and term rewriting systems, have benefitted from extensions, especially to include data structures and operations which are more naturally defined in another language. A simple example of this is PCF where the -calculus is extended to include natural numbers and some basic functions over this type, which avoids having to use inefficient encodings of numbers. In this paper we present a generalization of interaction nets along these lines. We begin by... (Update)

Active bibliography (related documents):   More   All
1.1:   Operational Equivalence for Interaction Nets - Fernández, Mackie   (Correct)
0.5:   Universal Interaction Systems with Only Two Agents - Bechet   (Correct)
0.4:   A Theory of Operational Equivalence for Interaction Nets - Fernández, Mackie (1999)   (Correct)

Similar documents based on text:   More   All
0.3:   Parallel Implementation Models for the lambda-calculus Using the.. - Pinto   (Correct)
0.3:   Closed Reductions in the λ-calculus (Extended Abstract) - Fernández, Mackie (1999)   (Correct)
0.2:   A Calculus for Interaction Nets - Fernandez, Mackie (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ ndez-combining,
  author = "Maribel Fernández and Ian Mackie and Jorge Sousa Pinto",
  title = "Combining Interaction Nets with Externally Defined Programs",
  url = "citeseer.ist.psu.edu/475335.html" }
Citations (may not include all citations):
306   LCF considered as a programming language (context) - Plotkin - 1977
109   Interaction nets (context) - Lafont - 1990
75   The geometry of optimal lambda reduction - Gonthier, Abadi et al. - 1992
42   Linear logic without boxes - Gonthier, Abadi et al. - 1992
19   Information and Computation (context) - Lafont - 1997
11   YALE: Yet another lambda evaluator based on interaction nets (context) - Mackie - 1998
4   Coinductive techniques for operational equivalence of intera.. (context) - Fern'andez, Mackie - 1998
4   Sequential and concurrent abstract machines for interaction .. (context) - Pinto - 2000
2   A calculus for interaction nets (context) - Fern'andez, Mackie - 1999
2   Interaction nets for linear logic (context) - Mackie - 2000
1   Interaction nets and term rewriting systems - Fern'andez, Mackie - 1998

Documents on the same site (http://www.di.ens.fr/~maribel/papers.html):
Operational Equivalence for Interaction Nets - Fernández, Mackie   (Correct)
A Theory of Operational Equivalence for Interaction Nets - Fernandez, Mackie   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC