A proof theory for generic judgments: An extended abstract

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 118-127

  Miller, Dale ^a   Tiu, Alwen ^a  

^a NONE

Author keywords

Generic judgments; Higher order abstract syntax; Proof search; Reasoning about operational semantics

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY OF DATA; SEMANTICS; ABSTRACTING; CALCULATIONS; COMPUTER SCIENCE;

PROOF SEARCH; CUT ELIMINATION; EXTENDED ABSTRACTS; GENERIC JUDGMENTS; INTUITIONISTIC LOGIC; LOCAL SIGNATURES; LOGIC; NEW QUANTIFIERS; PROOF-THEORETIC NOTIONS;

ABSTRACTING; ENCODING (SYMBOLS);

EID: 0042969226     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. In R. Gorrieri, editor, Proceedings of the 12th IEEE Computer Security Foundations Workshop - CSFW'99, pages 55-69, Mordano, Italy, 28-30 June 1999. IEEE Computer Society Press.
2. J. Chirimar. Proof Theoretic Approach to Specification Languages. PhD thesis, University of Pennsylvania, February 1995.
3. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
4. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2001.
5. G. Gentzen. Investigations into logical deductions. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68-131. North-Holland Publishing Co., Amsterdam, 1969.
6. J.-Y. Girard. A fixpoint theorem in linear logic. Email to the linear@cs.stanford.edu mailing list, February 1992.
7. L. Hallnäs and P. Schroeder-Heister. A proof-theoretic approach to logic programming, ii. Programs as definitions. Journal of Logic and Computation, 1(5):635-660, October 1991.
8. R. McDowell. Reasoning in a Logic with Definitions and Induction. PhD thesis, University of Pennsylvania, December 1997.
9. R. McDowell and D. Miller. Cut-elimination for a logic with definitions and induction. Theoretical Computer Science, 232:91-139, 2000.
10. R. McDowell and D. Miller. Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic, 3(1):80-136, January 2002.
11. R. McDowell, D. Miller, and C. Palamidessi. Encoding transition systems in sequent calculus. Theoretical Computer Science, 294(3):411-437, 2003.
12. D. Miller. Lexical scoping as universal quantification. In Sixth International Logic Programming Conference, pages 268-283, Lisbon, Portugal, June 1989. MIT Press.
13. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991.
14. D. Miller. Unification under a mixed prefix. Journal of Symbolic Computation, pages 321-358, 1992.
15. D. Miller. The π-calculus as a theory in linear logic: Preliminary results. In E. Lamma and P. Mello, editors, Proceedings of the 1992 Workshop on Extensions to Logic Programming, number 660 in LNCS, pages 242-265. Springer-Verlag, 1993.
16. D. Miller. Forum: A multiple-conclusion specification language. Theoretical Computer Science, 165(1):201-232, Sept. 1996.
17. D. Miller and C. Palamidessi. Foundational aspects of syntax. In P. Degano, R. Gorrieri, A. Marchetti-Spaccamela, and P. Wegner, editors, ACM Computing Surveys Symposium on Theoretical Computer Science: A Perspective, volume 31. ACM, Sep 1999.
18. D. Miller and A. Tiu. Encoding generic judgments. In Proceedings of FSTTCS, number 2556 in LNCS, pages 18-32, December 2002.
19. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Part I. Information and Computation, pages 1-40, September 1992.
20. A. Momigliano, S. Ambler, and R. Crole. A hybrid encoding of Howe's method for establishing congruence of bisimilarity. In LFM'02, volume 70.2 of ENTCS, 2002.
21. T. Nipkow. Functional unification of higher-order patterns. In M. Vardi, editor, LICS93, pages 64-74. IEEE, June 1993.
22. F. Pfenning and C. Elliott. Higher-order abstract syntax, In Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation, ACM Press, pages 199-208, June 1988.
23. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation. To appear. (A preliminary version appeared in the Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software (TACS 2001), LNCS 2215, Springer-Verlag, 2001, pp 219-242.).
24. P. Schroeder-Heister. Cut-elimination in logics with definitional reflection. In D. Pearce and H. Wansing, editors, Non-classical Logics and Information Processing, volume 619 of LNCS, pages 146-171. Springer, 1992.
25. A. Tiu. Cut-elimination for a logic with generic judgments. April 2003. Draft available via http://www.cse.psu.edu/̃tiu/foldn2.pdf.