Linear logic

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Linear logic

Full text

Pdf (528 KB)

Source

ACM SIGACT News archive
Volume 23 , Issue 2 (Spring 1992) table of contents

Pages: 29 - 37

Year of Publication: 1992

ISSN:0163-5700

Author

Patrick Lincoln

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 17, Downloads (12 Months): 33, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/130956.130958 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Samson Abramsky, Computational interpretations of linear logic, Theoretical Computer Science, v.111 n.1-2, p.3-57, April 12, 1993 [doi>10.1016/0304-3975(93)90181-R]
	2	[2] S. Abramsky and S. Vickers. Quantales, observational logic, and process semantics. Preprint, January 1990.
	3	[3] J.-M. Andreoli. Logic programming with focusing proofs in linear logic. Draft, 1991.
	4	[4] J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. In Proc. 7-th International Conference on Logic Programming, Jerusalem, May 1990.
	5	[5] A. Asperti. A logic for concurrency. Technical report, Dipartimento di Informatica, Universitá di Pisa, 1987.
	6	Andrea Asperti , Gian Luigi Ferrari , Roberto Gorrieri, Implicative formulae in the proofs of computations' analogy, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.59-71, December 1989, San Francisco, California, United States [doi>10.1145/96709.96715]
	7	[7] S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.
	8	[8] J. Chirimar, C. Gunter, and J. Riecke. Linear ML. In Lisp and Functional Programming, 1992. To Appear.
	9	[9] V. Gehlot and C.A. Gunter. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.
	10	[10] G. Gentzen. Collected Works. Edited by M.E. Szabo. North-Holland, Amsterdam, 1969.
	11	Jean-Yves Girard, Linear logic, Theoretical Computer Science, v.50 n.1, p.1-102, Jan. 30, 1987 [doi>10.1016/0304-3975(87)90045-4]
	12	[12] J.-Y. Girard. La logique linéaire. Pour La Science, Édition Francaise de Scientific American, 150:74-85, April 1990.
	13	[13] J.-Y. Girard, A. Scedrov, and P.J. Scott. Bounded linear logic: A modular approach to polynomial time computability. In S.R. Buss and P.J. Scott, editors, Feasible Mathematics, A Mathematical Sciences Institute Workshop, Ithaca, New York, June, 1989, pages 195-209. Birkhauser, Boston, 1990. Also To Appear in TCS.
	14	[14] C.A. Gunter and V. Gehlot. Nets as tensor theories. In G. De Michelis, editor, Proc. 10-th International Conference on Application and Theory of Petri Nets, Bonn, pages 174-191, 1989.
	15	[15] J.C. Guzman and P. Hudak. Single-threaded polymorphic lambda calculus. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.
	16	Joshua S. Hodas , Dale Miller, Logic programming in a fragment of intuitionistic linear logic, Papers presented at the IEEE symposium on Logic in computer science, p.327-365, May 1994, Amsterdam, The Netherlands
	17	[17] M. Kanovich. The multiplicative fragment of linear logic is NP-complete. Technical Report X-91-13, Institute for Language, Logic, and Information, June 1991.
	18	[18] M. Kanovich. Horn programming in linear logic is np-complete. In Proc. 7-th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz. IEEE Computer Society Press, Los Alamitos, California, June 1992.
	19	[19] J. Ketonen and R. Weyhrauch. A decidable fragment of predicate calculus. Theoretical Computer Science, 32, 1984.
	20	S. Rao Kosaraju, Decidability of reachability in vector addition systems (Preliminary Version), Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.267-281, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802201]
	21	Y. Lafont, The linear abstract machine, Theoretical Computer Science, v.59 n.1-2, p.157-180, July 1988 [doi>10.1016/0304-3975(88)90100-4]
	22	Yves Lafont, Interaction nets, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.95-108, December 1989, San Francisco, California, United States [doi>10.1145/96709.96718]
	23	[23] J. Lambek. The mathematics of sentence structure. Amer. Math. Monthly, 65:154-169, 1958.
	24	[24] J. Lambek. From categorial grammar to bilinear logic. Draft., 1991.
	25	[25] P. Lincoln and J. Mitchell. Operational aspects of linear lambda calculus. In Proc. 7-th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz. IEEE Computer Society Press, Los Alamitos, California, June 1992.
	26	[26] P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 662-671, 1990.
	27	[27] P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Technical Report SRI-CSL-90-08, CSL, SRI International, 1990. To appear in Annals of Pure and Applied Logic.
	28	[28] P. Lincoln and T. Winkler. Constant multiplicative linear logic is NP-complete. Draft, 1992.
	29	[29] I.C. Mackie. Lilac - a functional programming language based on linear logic. Master's thesis, Imperial College, London, 1991.
	30	Narciso Martí-Oliet , José Meseguer, From Petri Nets to Linear Logic, Category Theory and Computer Science, p.313-340, September 05-08, 1989
	31	[31] E. Mayr and A. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics, 46:305-329, 1982.
	32	[32] R.K. Meyer. Topics in Modal and Many-Valued Logic. PhD thesis, University of Pittsburgh, 1966.
	33	[33] M. Minsky. Recursive unsolvability of Post's problem of 'tag' and other topics in the theory of Turing machines. Annals of Mathematics. 74:3:437-455, 1961.
	34	Peter W. O'Hearn, Linear Logic and Interference Control, Proceedings of the 4th International Conference on Category Theory and Computer Science, p.74-93, September 03-06, 1991
	35	Vaughan R. Pratt, Event Spaces and their Linear Logic, Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology, p.3-25, May 22-25, 1991
	36	[36] A. Scedrov. A brief guide to linear logic. Bulletin of the European Assoc. for Theoretical Computer Science, 41:154-165, June 1990.
	37	[37] A. Urquhart. The undecidability of entailment and relevant implication. Journal of Symbolic Logic, 49:1059-1073, 1984.
	38	[38] J. VanBentham. Language in Action. North-Holland, 1991.
	39	[39] P. Wadler. Is there a use for linear logic? To Appear ACM/IEIP PEPM, 1991.
	40	[40] P. Wadler, There's no substitute for linear logic. Draft, 1991.
	41	David Wakeling , Colin Runciman, Linearity and laziness, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.215-240, June 1991, Cambridge, Massachusetts, United States

CITED BY 7

	Keith Wansbrough , Simon Peyton Jones, Once upon a polymorphic type, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.15-28, January 20-22, 1999, San Antonio, Texas, United States
	Masaki Murakami, Evolvable concurrent processes, Computer Standards & Interfaces, v.25 n.3, p.233-239, June 2003
	Masaki Murakami, A model of runtime transformation for distributed systems based on directed acyclic graph model, Journal of Systems Architecture: the EUROMICRO Journal, v.50 n.7, p.417-425, July 2004
	John Grant , Sarit Kraus , Donald Perlis, A Logic for Characterizing Multiple Bounded Agents, Autonomous Agents and Multi-Agent Systems, v.3 n.4, p.351-387, December 2000
	Peep Küngas, Resource-conscious AI planning with conjunctions and disjunctions, Acta Cybernetica, v.15 n.4, p.601-620, December 2002
	Peep Küngas , Mihhail Matskin, Symbolic negotiation revisited, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, May 08-12, 2006, Hakodate, Japan
	Peep Kungas , Mihhail Matskin, From web services annotation and composition to web services domain analysis, International Journal of Metadata, Semantics and Ontologies, v.2 n.3, p.157-178, March 2007