A Logic for Reasoning about Generic Judgments

Electronic Notes in Theoretical Computer Science

Volumn 174, Issue 5, 2007, Pages 3-18

  Tiu, Alwen ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

higher order abstract syntax; logical frameworks; Proof theory

Indexed keywords

CASE BASED REASONING; ENCODING (SYMBOLS); PROBLEM SOLVING; SPECIFICATIONS;

GENERIC JUDGMENTS; HIGHER-ORDER ABSTRACT SYNTAX; LOGICAL FRAMEWORKS; PROOF THEORY;

FORMAL LOGIC;

EID: 34249039887     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.01.016     Document Type: Article

References (28)

1. Aydemir B.E., Bohannon A., Fairbairn M., Foster J.N., Pierce B.C., Sewell P., Vytiniotis D., Washburn G., Weirich S., and Zdancewic S. Mechanized metatheory for the masses: the poplmark challenge. In: Hurd J., and Melham T. (Eds). Theorem Proving in Higher Order Logics. 18th International Conference. Lecture Notes in Computer Science (2005) 50-65
2. Cheney J. A simpler proof theory for nominal logic. Proc. FOSSACS'05. Lecture Notes in Computer Science vol. 3441 (2005) 379-394
3. Cheney J. Completeness and Herbrand theorems for nominal logic. Journal of Symbolic Logic 7 (2006) 299-320
4. Despeyroux, J., A. Felty and A. Hirschowitz, Higher-order abstract syntax in Coq, in: Second International Conference on Typed Lambda Calculi and Applications, 1995, pp. 124-138
5. Gabbay M.J., and Cheney J. A sequent calculus for nominal logic. Proc. 19th IEEE Symposium on Logic in Computer Science. (LICS 2004) (2004) 139-148
6. Girard, J.-Y., A fixpoint theorem in linear logic (1992), email to the linear@cs.stanford.edu mailing list
7. Hallnäs L., and Schroeder-Heister P. A proof-theoretic approach to logic programming. II. Programs as definitions. Journal of Logic and Computation 1 (1991) 635-660
8. Hofmann, M., Semantical analysis of higher-order abstract syntax, in: 14th Annual Symposium on Logic in Computer Science (1999), pp. 204-213
9. Honsell F., Miculan M., and Scagnetto I. An axiomatic approach to metareasoning on systems in higher-order abstract syntax. Proc. ICALP'01. LNCS number 2076 (2001) 963-978
10. McDowell R., and Miller D. Cut-elimination for a logic with definitions and induction. Theoretical Computer Science 232 (2000) 91-119
11. McDowell R., and Miller D. Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic 3 (2002) 80-136
12. Miculan M., and Yemane K. A unifying model of variables and names. Proc. FOSSACS'05. Lecture Notes in Computer Science vol. 3441 (2005) 170-186
13. Miller D. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation 1 (1991) 497-536
14. Miller D. Unification under a mixed prefix. Journal of Symbolic Computation 14 (1992) 321-358
15. Miller D., Nadathur G., Pfenning F., and Scedrov A. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51 (1991) 125-157
16. Miller D., and Palamidessi C. Foundational aspects of syntax. ACM Comput. Surv. 31 (1999) 11
17. Miller D., and Tiu A. A proof theory for generic judgments. ACM Trans. Comput. Logic 6 (2005) 749-783
18. Momigliano A., and Tiu A. Induction and co-induction in sequent calculus. In: Stefano Berardi M.C., and Damiani F. (Eds). Post-proceedings of TYPES 2003. LNCS number 3085 (2003) 293-308
19. Nipkow T. Functional unification of higher-order patterns. In: Vardi M. (Ed). Proc. 8th IEEE Symposium on Logic in Computer Science. (LICS 1993) (1993) 64-74
20. Pfenning, F. and C. Elliott, Higher-order abstract syntax, in: Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation (1988), pp. 199-208
21. Pitts A.M. Nominal logic, a first order theory of names and binding. Information and Computation 186 (2003) 165-193
22. Schöpp, U., Modelling generic judgments, in: Proceedings of Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'06), 2006, pp. 1-16
23. Schroeder-Heister P. Cut-elimination in logics with definitional reflection. In: Pearce D., and Wansing H. (Eds). Nonclassical Logics and Information Processing. LNCS vol. 619 (1992) 146-171
24. Schürmann, C., "Automating the Meta Theory of Deductive Systems," Ph.D. thesis, Carnegie Mellon University (2000)
25. Tiu, A., "A Logical Framework for Reasoning about Logical Specifications," Ph.D. thesis, Pennsylvania State University (2004)
26. Tiu A. A logic for reasoning about generic judgments. extended version. Available on: (2006). http://users.rsise.anu.edu.au/~tiu/lgext.pdf
27. Urban, C. and M. Norrish, A formal treatment of the Barendregt Variable Convention in rule inductions, in: MERLIN '05: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding (2005), pp. 25-32
28. Urban C., and Tasson C. Nominal techniques in Isabelle/HOL. In: Nieuwenhuis R. (Ed). Proceedings of the 20th International Conference on Automated Deduction (CADE). LNCS vol. 3632 (2005) 38-53