Proof net semantics of proof search computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1298, Issue , 1997, Pages 194-208

  Caires, Luís ^a   Monteiro, Luís ^a  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

COMPOSITIONAL SEMANTICS; LINEAR LOGIC; PARTIAL ORDER SEMANTICS; PROOF NET; PROOF SEARCH; SOUND AND COMPLETE;

COMPUTER CIRCUITS;

EID: 84947724791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0027011     Document Type: Conference Paper

References (16)

1. J-M. Andreoli. Logic programming with focusing proofs in linear logic. J. of Logic and Computation, 2(3):297-347, 1992.
2. Andrea Asperti. Causal dependencies in multiplicative linear logic with MIX. Mathematical Structures in Computer Science, 5(3):351-380, September 1995.
3. G. Beilin. Subnets of proof-nets in multiplicative linear logic with MIX. In Mathematical Structures in Computer Science, to appear, 1996. Available at ftp://ftp.logique.jussieu.fr/pub/distrib/bellin/mix.ps.gz.
4. G. Beilin and J., van de Wiele. Empires and kingdoms in MLL. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 249-270. Cambridge University Press, 1995. London Mathematical Society Lecture Note Series 222, Proceedings of the 1993 Workshop on Linear Logic, Cornell Univesity, Ithaca.
5. Gianluigi Beilin and Philip Scott. On the n-calculus and linear logic. Theoretical Computer Science, 135:11-65,1994. Also published as LFCS report ECS-LFCS-92-232, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK.
6. L. Caires. A language for the logical specification of processes and relations. In Michael Hanus, editor, Proceedings of the Algebraic and Logic Programming International Conference, 1996.
7. L. Caires. A language for the logical specification of processes and relations. Technical Report 6.96, Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia,Departamento de Informática, 1996. Available at http://www-ctp.di.fct.unl.pt/~lcaires/writings/lpi6.96.ps.gz.
8. L. Caires and L. Monteiro. Proof net semantics of £. Technical report, Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia,Departamento de Informática, 1997. Available at http://www-ctp.di.fct.unl.pt/~lcidres/writings/.
9. G. L. Cattani and V. Sassone. Higher dimensional transition systems. In Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 55-62. IEEE Computer Society Press, 1996.
10. Vincent Danos and Laurent Regnier. The structure of multiplicatives. Archive for Mathematical Logic, 26, 1989.
11. Jean-Yves Girard. Proof-nets: The parallel syntax for proof-theory. In P. Agliano and A. Ursini, editors, Logic and Algebra. Marcel Dekker, New York, 1996.
12. Alessio Guglielmi. Abstract Logic Programming in Linear Logic-Independence and Causality in a First Order Calculus. PhD thesis, Università di Pisa, 1996.
13. N. Kobayashi and A. Yonezawa. Asynchronous communication model based on linear logic. Formal Aspects of Computing, 7(2):113-149, 1995.
14. D. Miller. The n-calculus as a theory in linear logic: preliminary results. In E. Lamma and P. Mello, editors, Proc. of the Workshop on Extensions of Logic Programming, pages 242-264, 1992.
15. D. Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165(l):201-232, 30 September 1996.
16. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proof as a foundation for logic programming. Annals of Pure and Applied Logic, (51):125-157, 1991.