A proof theory for generic judgments

ACM Transactions on Computational Logic

Volumn 6, Issue 4, 2005, Pages 749-783

  Miller, Dale ^a,c   Tiu, Alwen ^b,d  

^a INRIA   (France)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c ÉCOLE POLYTECHNIQUE   (France)

^d INRIA   (France)

Author keywords

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

Indexed keywords

Λ-TREE SYNTAX; GENERIC JUDGEMENTS; HIGHER-ORDER ABSTRACT SYNTAX; PROOF SEARCH; REASONING ABOUT OPERATIONAL SEMANTICS; V-QUANTIFIER;

DATABASE SYSTEMS; EIGENVALUES AND EIGENFUNCTIONS; FORMAL LOGIC; TREES (MATHEMATICS);

SEMANTICS;

EID: 33745189795     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1094622.1094628     Document Type: Conference Paper

References (40)

1. CERVESATO, I., DURGIN, N. A., LINCOLN, P. D., MITCHELL, J. C., AND SCEDROV, A. 1999. Ameta-notation for protocol analysis. In Proceedings of the 12th IEEE Computer Security Foundations Workshop-CSFW99 (Mordano, Italy), R. Gorrieri, Ed. IEEE Computer Society Press, Los Alamitos, CA, 55-69.
2. CERVESATO, I. AND PFENNING, F. 1996. A linear logic framework. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (New Brunswick, NJ). IEEE Computer Society Press, Los Alamitos, CA, 264-275.
3. CHIRIMAR, J. 1995. Proof theoretic approach to specification languages. Ph.D. dissertation, University of Pennsylvania.
4. CHURCH, A. 1940. A formulation of the simple theory of types. J. Symbol. Logic 5, 56-68.
5. ERIKSSON, L.-H. 1991. A finitary version of the calculus of partial inductive definitions. In Proceedings of the 2nd International Workshop on Extensions to Logic Programming, L.-H. Eriksson, L. Hallnäs, and P. Schroeder-Heister, Eds. Lecture Notes in Artificial Intelligence, vol. 596. Springer-Verlag, New York, 89-134.
6. FELTY, A. AND MILLER, D. 1988. Specifying theorem provers in a higher-order logic programming language. In Proceedings of the 9th International Conference on Automated Deduction (Argonne, IL). Springer-Verlag, New York, 61-80.
7. GABBAY, M. J. AND CHENEY, J. 2004. A sequent calculus for nominal logic. In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004). IEEE Computer Society Press, Los Alamitos, CA, 139-148.
8. GABBAY, M. J. AND PITTS, A. M. 2001. A new approach to abstract syntax with variable binding. Form. Aspects Comput. 13, 341-363.
9. GENTZEN, G. 1969. Investigations into logical deductions. In The Collected Papers of Gerhard Gentzen, M. E. Szabo, Ed. North-Holland Publishing Co., Amsterdam, The Netherlands, 68-131.
10. GIRARD, J.-Y. 1992. A fixpoint theorem in linear logic. Email to the linear@cs.stanford.edu mailing list.
11. HALLNÄS, L. AND SCHHOEDER-HEISTER, P. 1991. A proof-theoretic approach to logic programming. II. Programs as definitions. J. Logic Comput. 1, 5 (Oct.), 635-660.
12. HUET, G. 1975. A unification algorithm for typed A.-calculus. Theoret. Comput. Sci. 1, 27-57.
13. MCDOWELL, R. 1997. Reasoning in a logic with definitions and induction. Ph.D. dissertation, University of Pennsylvania.
14. MCDOWELL, R. AND MILLER, D. 2000. Cut-elimination for a logic with definitions and induction. Theoret. Comput. Sci. 232, 91-119.
15. MCDOWELL, R. AND MILLER, D. 2002. Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. Comput. Logic 3, 1 (Jan.), 80-136.
16. MCDOWELL, R., MILLER, D., AND PALAMIDESSI, C. 2003. Encoding transition systems in sequent calculus. Theoret. Comput. Sci. 294, 3, 411-437.
17. MILLER, D. 1989. Lexical scoping as universal quantification. In Proceedings of the 6th International Logic Programming Conference (Lisbon, Portugal). MIT Press, Cambridge, MA, 268-283.
18. MILLER, D. 1991. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic Comput. 1, 4, 497-536.
19. MILLER, D. 1992. Unification under a mixed prefix. J. Symb. Comput. 14, 4, 321-358.
20. MILLER, D. 1993. The π-calculus as a theory in linear logic: Preliminary results. In Proceedings of the 1992 Workshop on Extensions to Logic Programming (Bologna, Italy). E. Lamma and P. Mello, Eds. Lecture Notes in Computer Science, vol. 660, Springer-Verlag, New York, 242-265.
21. MILLER, D. 1996. Forum: A multiple-conclusion specification language. Theoret. Comput. Sci. 165, 1 (Sept.), 201-232.
22. MILLER, D. 2000. Abstract syntax for variable binders: An overview. In Computational Logic (CL 2000), J. Lloyd et. al., Eds. Lecture Notes in Artificial Intelligence, vol. 1861. Springer-Verlag, New York, 239-253.
23. MILLER, D. AND PALAMIDESSI, C. 1999. Foundational aspects of syntax. In ACM Computing Surveys Symposium on Theoretical Computer Science: A Perspective, P. Degano, R. Gorrieri, A. MarchettiSpaccamela, and P. Wegner, Eds. Vol. 31. ACM, New York.
24. MILLER, D. AND TIU, A. 2002. Encoding generic judgments. In Proceedings of FSTTCS. Number 2556 in LNCS. Springer-Verlag, 18-32.
25. MILLER, D. AND TIU, A. 2003. A proof theory for generic judgments: An extended abstract. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003). IEEE, 118-127.
26. MILNER, R., PARHOW, J., AND WALKER, D. 1992. A calculus of mobile processes, Part I. Inf. Comput. 100, 1 (Sept.), 1-40.
27. MOMIGLIANO, A., AMBLER, S., AND CROLE, R. 2002. A hybrid encoding of Howe's method for establishing congruence of bisimilarity. In LFM'02. ENTCS, vol. 70.2. Springer-Verlag, New York.
28. MOMIGLIANO, A. AND TIU, A. 2003. Induction and co-induction in sequent calculus. In Proceedings of TYPES 2003 Workshop. Lecture Notes in Computer Science, vol. 3085, Springer-Verlag, New York, 293-308.
29. NIPKOW, T. 1993. Functional unification of higher-order patterns. In Proceedings of the 8th IEEE Symposium on Logic in Computer Science (LICS 1993), M. Vardi, Ed. IEEE Computer Society Press, Los Alamitos, CA, 64-74.
30. PAULSON, L. C. 1989. The foundation of a generic theorem prover. J. Automat. Reas. 5, 363-397.
31. PFENNING, F. AND ELLIOTT, C. 1988. Higher-order abstract syntax. In Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 199-208.
32. PFENNING, F. AND ROHWEDDER, E. 1992. Implementing the meta-theory of deductive systems. In Proceedings of the 1992 Conference on Automated Deduction. Lecture Notes in Computer Science, vol. 607, Springer-Verlag, New York, 537-551.
33. PITTS, A. M. 2003. Nominal logic, A first order theory of names and binding. Inf. Comput. 186, 2, 165-193.
34. SCHROEDER-HEISTER, P. 1992. Cut-elimination in logics with definitional reflection. In Nonclassical Logics and Information Processing, D. Pearce and H. Wansing, Eds. Lecture Notes in Computer Science, vol. 619, Springer-Verlag, New York, 146-171.
35. SCHROEDER-HEISTER, P. 1994. Cut elimination for logics with definitional reflection and restricted initial sequents. In Proceedings of the Post-Conference Workshop of ICLP 1994 on Proof-Theoretic Extensions of Logic Programming.
36. SCHÜRMANN, C. 2000. Automating the meta theory of deductive systems. Ph.D. dissertation, Carnegie Mellon University.
37. SLANEY, J. 1989. Solution to a problem of Ono and Komori. J. Philosophic Logic 18, 103-111.
38. TIU, A. 2004a. Level 0/1 prover: A tutorial. Available via the web and from TIU.
39. TIU, A. 2004b. A logical framework for reasoning about logical specifications. Ph.D. dissertation. Pennsylvania State University.
40. TIU, A. AND MILLER, D. 2004. A proof search specification of the π-calculus. In Proceedings of the 3rd Workshop on the Foundations of Global Ubiquitous Computing.