Substructural operational semantics as ordered logic programming

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 101-110

  Pfenning, Frank ^a   Simmons, Robert J ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT MACHINES; CALL-BY-NAME; CALL-BY-NEED; HIGHER ORDER; LANGUAGE FEATURES; LANGUAGE SPECIFICATION; LOGICAL APPROACHES; NATIONAL SCIENCE FOUNDATIONS; OPERATIONAL INTERPRETATION; OPERATIONAL SEMANTICS; RESEARCH FELLOWSHIPS; STRUCTURAL OPERATIONAL SEMANTICS; SUBSTRUCTURAL LOGIC;

COMPUTER SCIENCE; LINGUISTICS; LOGIC PROGRAMMING; PROGRAM INTERPRETERS; QUERY LANGUAGES; SPECIFICATIONS;

SEMANTICS;

EID: 70350602732     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2009.8     Document Type: Conference Paper

References (27)

1. J.-M. Andreoli. Logic programming with focusing proofs in linear logic. J. Log. Comput., 2(3):297-347, 1992.
2. I. Cervesato, F. Pfenning, D. Walker, and K. Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, School of Computer Science, Carnegie Mellon University, Mar. 2002. Revised May 2003.
3. I. Cervesato and A. Scedrov. Relating State-Based and Process-Based Concurrency through Linear Logic. Information & Computation, 2009.
4. J. L. Chirimar. Proof Theoretic Approach to Specification Languages. PhD thesis, University of Pennsylvania, May 1995.
5. A. P. Felty and A. Momigliano. Hybrid: A definitional two-level approach to reasoning with higher-order abstract syntax. CoRR, abs/0811.4367, 2008.
6. A. Gacek. The Abella interactive theorem prover. In IJCAR'08, pages 154-161. Springer, 2008. System description.
7. J. S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. Inf. Comput., 110(2):327-365, 1994.
8. J. Lambek. The mathematics of sentence structure. American Mathematical Monthly, 65:363-386, 1958.
9. O. Laurent. A proof of the focalization property of linear logic, May 2004. Unpublished note.
10. P. López, F. Pfenning, J. Polakow, and K. Watkins. Monadic concurrent linear logic programming. In PPDP 2000, pages 35-46, 2005.
11. J. Maraist, M. Odersky, and P.Wadler. A call-by-need lambda calculus. Journal of Functional Programming, 8(3):275-317, May 1998.
12. J. Meseguer and G. Roşu. The rewriting logic semantics project. In SOS 2005, pages 26-56, May 2006.
13. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Ann. Pure Appl. Logic, 51(1-2):125-157, 1991.
14. P. D. Mosses. Modular structural operational semantics. J. Log. Algebr. Program., 60-61:195-228, 2004.
15. F. Pfenning. Substructural operational semantics and linear destination-passing style. In APLAS 2004, page 196, Taipei, Taiwan, 2004. Springer. Abstract of invited talk.
16. F. Pfenning and C. Schürmann. Algorithms for equality and unification in the presence of notational definitions. In Types for Proofs and Programs, pages 179- 193, 1998.
17. F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In CADE-16, pages 202-206, Trento, Italy, 1999. Springer.
18. G. D. Plotkin. A structural approach to operational semantics. J. Log. Algebr. Program., 60-61:17-139, 2004.
19. J. Polakow. Linear logic programming with ordered contexts. In PPDP 2000, pages 68-79, Montreal, Canada, Sept. 2000. ACM Press.
20. J. Polakow. Ordered Linear Logic and Applications. PhD thesis, Carnegie Mellon University, Aug. 2001. Available as technical report CMU-CS-01-152.
21. J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In TLCA 1999, pages 295-309, L'Aquila, Italy, 1999. Springer- Verlag LNCS 1581.
22. J. Polakow and F. Pfenning. Relating natural deduction and sequent calculus for intuitionistic noncommutative linear logic. In MFPS XV, Apr. 1999. Electr. Notes Theor. Comput. Sci., 20:449-466.
23. J. Polakow and K. Yi. Proving syntactic properties of exceptions in an ordered logical framework. In APLAS 2000, pages 23-32, 2000.
24. R. J. Simmons and F. Pfenning. Linear logical algorithms. In ICALP (2), pages 336-347, 2008.
25. R. J. Simmons and F. Pfenning. Linear logical approximations. In PEPM 2009. ACM Press, 2009.
26. K. Watkins, I. Cervesato, F. Pfenning, and D. Walker. A concurrent logical framework I: Judgments and properties. Technical Report CMU-CS-02-101, School of Computer Science, Carnegie Mellon University, Mar. 2002. Revised May 2003.
27. K. Watkins, I. Cervesato, F. Pfenning, and D. Walker. Specifying properties of concurrent computations in CLF. Electr. Notes Theor. Comput. Sci., 199:67-87, 2008.