(Enter summary)
Abstract: . A new class of higher order rewriting systems, called Interaction
Systems (IS's), was introduced by the author in [2]. Interaction
Systems provide a nice integration of the functional paradigm with a
rich class of data structures and basic control flow constructs such as
conditionals and (primitive or general) recursion.
In this paper, we focus on the relation between Interaction Systems and
Intuitionistic Logic, via the Curry-Howard analogy. Pursuing this analogy,
we define an encoding of... (Update)
Cited by: More
Periodic Progress Report - Oct Ob Er
(Correct)
Similar documents (at the sentence level):
20.9%: Interaction Systems I: The theory of optimal reductions - Asperti, Laneve (1993)
(Correct)
13.3%: Interaction Systems II: The Practice of Optimal Reductions - Asperti, Laneve (1994)
(Correct)
Active bibliography (related documents): More All
0.4: Paths, Computations and Labels in the lambda-calculus - Asperti, Laneve (1995)
(Correct)
0.3: Linear Logic, Comonads and Optimal Reductions - Asperti (1993)
(Correct)
0.1: Applications of Linear Logic to Computation: An Overview - Alexiev (1993)
(Correct)
Similar documents based on text: More All
0.5: Interaction Systems Design and the Protocol- and.. - Almeida, van.. (2003)
(Correct)
0.3: May and Must Testing in the Join-Calculus - Laneve (1996)
(Correct)
0.3: Core Formal Molecular Biology - Danos, Laneve (2003)
(Correct)
BibTeX entry: (Update)
Asperti, A., Laneve, C.: "Interaction Systems". International Workshop on Higher-Order Algebra, Logic and Term Rewriting. Amsterdam, September 1993. http://citeseer.ist.psu.edu/article/asperti93interaction.html More
@inproceedings{ asperti93interaction,
author = "Andrea Asperti and Cosimo Laneve",
title = "Interaction Systems",
booktitle = "{HOA}",
pages = "1-19",
year = "1993",
url = "citeseer.ist.psu.edu/article/asperti93interaction.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard - 1986 ACM
268
Proofs and Types (context) - Girard, Taylor et al. - 1989 ACM
174
Combinatory Reduction System (context) - Klop - 1980
109
Interaction Nets (context) - Lafont - 1990 ACM DBLP
70
An algorithm for optimal lambda calculus reductions (context) - Lamping - 1990
42
Linear logic without boxes
- Gonthier, Abadi et al. - 1992 DBLP
41
R'eductions correctes et optimales dans le lambda calcul (context) - L'evy - 1978
41
Interaction Systems I: the theory of optimal reductions
- Asperti, Laneve - 1992 DBLP
37
A general Church-Rosser theorem (context) - Aczel - 1978
31
Lambda Calcul et R'eseaux (context) - Regnier - 1992
22
a Logique Lin'eare appliqu'ee `a l"etude de divers processus.. (context) - Danos - 1990
9
Optimal Reductions in Interaction Systems (context) - Asperti, Laneve - 1993
5
Technical Report TD (context) - Laneve, Concurrency et al. - 1993
1
of Theoretical Aspects of Computer Science (context) - Asperti, Laneve et al. - 1994
Documents on the same site (http://www.cs.unibo.it/~laneve/html/papers.html): More
The Discriminating Power of Multiplicities in the Lambda-Calculus - Boudol, Laneve (1996)
(Correct)
Mobility in the Cc-Paradigm - Laneve, Montanari (1992)
(Correct)
λ-Calculus, Multiplicities and the π-Calculus - Boudol, Laneve
(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