Interaction Combinators-Reference-Cited by-同舟云学术

Interaction Combinators

Published:1997-08 Issue:1 Volume:137 Page:69-101
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Lafont Yves

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference11 articles.

1. A. Bawden, 1986, Connection graphs, Proceedings of ACM Conference on Lisp and Functional Programming, 258, 265

2. Proof-nets and the Hilbert space;Danos,1995

3. S. J. Gay, 1995, Combinators for interaction nets, Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, C. L. HankinI. C. MackieR. Nagarajan, Imperial College Press

4. J.-Y. Girard, 1989, Geometry of interaction I: Interpretation of system F, Proceedings, Logic Colloquium '88, Ferroet al. 221, 260, North-Holland, Amsterdam

5. Linear logic: Its syntax and semantics;Girard,1995

Cited by 52 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Emergence of Self-Reproducing Metabolisms as Recursive Algorithms in an Artificial Chemistry;Artificial Life;2021

2. The true concurrency of differential interaction nets;Mathematical Structures in Computer Science;2016-11-21

3. Bounded Combinatory Logic and lower complexity;Information and Computation;2016-06

4. The complexity of interaction;ACM SIGPLAN Notices;2016-04-08

5. The complexity of interaction;Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2016-01-11