A language for the logical specification of processes and relations

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

Volumn 1139, Issue , 1996, Pages 150-164

  Caires, Luis ^a  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS; COMPUTATIONAL LINGUISTICS; LINEAR ALGEBRA; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SPECIFICATION LANGUAGES; SPECIFICATIONS; XML;

CONCURRENT PROCESS; CONCURRENT SYSTEMS; LINEAR LOGIC; LOGICAL SPECIFICATIONS; OPERATIONAL COMPLEXITY; OPERATIONAL INTERPRETATION; PROCESS SPECIFICATION LANGUAGE; SEARCH BEHAVIOURS;

COMPUTER CIRCUITS;

EID: 84947723273     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61735-3_10     Document Type: Conference Paper

References (21)

1. J.-M. Andreoli. Logic programming with focusing proofs in linear logic. J. of Logic and Computation, 2(3):297-347, 1992.
2. J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9, 1991.
3. Luís Caires. A language for the logical specification of processes and relations. In Draft. Available at http://www-ctp.di.fct.unl.pt/,~lcaires/papersflc.dvi.gz, 1996.
4. Iliano Cervesato, J. Hodas, and F. Pfenning. Efficient resource management for linear logic proof search. In R. Dyckhoff and Peter Schroeder-Heister, editors, Proc. Fifth Intl. Workshop on Extensions of Logic Programming, pages 67-81, 1996.
5. Iliano Cervesato and Frank Pfenning. A linear logical framework. In Proc. Eleventh IEEE Syrup. Logic in Computer Science, 1996.
6. J. Harland and M. Winikoff. Implementation and development issues for the linear logic programming language Lygon. In Proc. of the Eighteenth Australian Computer Science Conference, 1995. 7.
7. S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. J. Information and Computation, 110(2):327-365, 1994.
8. J. Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
9. N. Kobayashi and A. Yonezawa. Asynchronous communication model based on linear logic. Formal Aspects of Computing, 7(2):113-149, 1995.
10. P. Lincoln and V. Saraswat. Higher-order, linear, concurrent constraint programruing. Unpublished manuscript, 1993.
11. D. Miller. A multiple-conclusion specification logic. Theoretical Computer Science, (To appear, draft of January 3, 1996. Available from ftp.cis.upenn.edu).
12. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation, 1(4):497-536, 1991.
13. D. Miller. The π-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.
14. D. Miller. A survey of linear logic programming. Computational Logic, 2(2), 1995.
15. D. Miller and G. Nadathur. Higher-order logic programming. In Proc. of the Third International Conference on Logic Programming, pages 448-462 1986.
16. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proof as a foun-. dation for logic programming. Annals of Pure and Applied Logic, (51):125-157, 1991.
17. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
18. R. Milner. Functions as processes. J. Computer and System Sciences, 17(3), 1992.
19. R. Milner. The polyadic x-calculus: A tutorial. Mathematical Structures in Computer Science, 2(2):119-142, 1992.
20. U. Montanari and Pistore Concurrent semantics for the π-calculus. Electronic Notes on Theoretical Computer Science, 1, 1995.
21. L. Monteiro. Distributed logic: a logical system for specifying concurrency. In TR CIUNL-5.81, Departamento de Informática, Universidade Nova de Lisboa, 1891, 1986.