Barendregt's variable convention in rule inductions

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

Volumn 4603 LNAI, Issue , 2007, Pages 35-50

  Urban, Christian ^a   Berghofer, Stefan ^a   Norrish, Michael ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; THEOREM PROVING;

BARENDREGT'S VARIABLE CONVENTION; INFORMAL REASONING; RULE INDUCTIONS;

FORMAL LOGIC;

EID: 35148859362     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73595-3_4     Document Type: Conference Paper

References (12)

1. Aydemir, B.E., Bohannon, A., Fairbairn, M., Foster, J.N., Pierce, B.C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized Metatheory for the Masses: The PoplMark Challenge. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 50-65. Springer, Heidelberg (2005)
2. Barendregt, H.: The Lambda Calculus: its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol. 103, North-Holland (1981)
3. Bengtson, J., Parrow, J.: Formalising the pi-Calculus using Nominal Logic. In: Proc. of the 10th International Conference on Foundations of Software Science and Computation Structures (FOSSACS). LNCS, vol. 4423, pp. 63-77. Springer, Heidelberg (2007)
4. Crary, K.: Advanced Topics in Types and Programming Languages. In: chapter Logical Relations and a Case Study in Equivalence Checking, pp. 223-244. MIT Press, Cambridge (2005)
5. Gallier, J.: Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row (1986)
6. McKinna, J., Pollack, R.: Some type theory and lambda calculus formalised. Journal of Automated Reasoning 23(1-4) (1999)
7. Norrish, M.: Mechanising A-calculus using a classical first order theory of terms with permutation. Higher-Order and Symbolic Computation 19, 169-195 (2006)
8. Pitts, A.M.: Nominal Logic, A First Order Theory of Names and Binding. Information and Computation 186, 165-193 (2003)
9. Urban, C., Berghofer, S.: A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 498-512. Springer, Heidelberg (2006)
10. Urban, C., Norrish, M.: 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, pp. 25-32. ACM Press, New York (2005)
11. Urban, C., Tasson, C.: Nominal techniques in Isabelle/HOL. In: Nieuwenhuis, R. (ed.) Automated Deduction - CADE-20. LNCS (LNAI), vol. 3632, pp. 38-53. Springer, Heidelberg (2005)
12. Wenzel, M.: Isar -A Generic Interpretative Approach to Readable Formal Proof Documents. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 167-184. Springer, Heidelberg (1999)