Abstract
This paper contributes to the theory of typed first-order logic. We present a sound and complete axiomatization for a basic typed logic lifting restrictions imposed by previous results. As a second contribution, this paper provides complete axiomatizations for the type predicates instance T , exactInstance T , and functions cast T indispensable for reasoning about object-oriented programming languages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beckert, B., Hähnle, R., Schmitt, P.H. (eds.): Verification of Object-Oriented Software. LNCS (LNAI), vol. 4334. Springer, Heidelberg (2007)
Bobot, F., Conchon, S., Contejean, E., Lescuyer, S.: Implementing polymorphism in smt solvers. In: Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning, SMT 2008/BPR 2008, pp. 1–5. ACM, New York (2008)
Bobot, F., Paskevich, A.: Expressing Polymorphic Types in a Many-Sorted Language. In: Tinelli and Sofronie-Stokkermans [9], pp. 87–102
Esparza, J., Majumdar, R. (eds.): TACAS 2010. LNCS, vol. 6015. Springer, Heidelberg (2010)
Gallier, J.H.: Logic for Computer Science: Foundations of Automatic Theorem Proving. Wiley (1987)
Giese, M.A.: A calculus for type predicates and type coercion. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 123–137. Springer, Heidelberg (2005)
Leino, K.R.M., Rümmer, P.: A polymorphic intermediate verification language: Design and logical encoding. In: Esparza and Majumdar [4], pp. 312–327
Schmidt, A.: Über deduktive Theorien mit mehreren Sorten von Grunddingen. Math. Annalen 115, 485–506 (1938)
Tinelli, C., Sofronie-Stokkermans, V. (eds.): FroCoS 2011. LNCS, vol. 6989. Springer, Heidelberg (2011)
Walther, C.: A Many-Sorted Calculus Based on Resolution and Paramodulation. Pitman / Morgan Kaufmann (1987)
Weidenbach, C.: First-order tableaux with sorts. Logic Journal of the IGPL 3(6), 887–906 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Schmitt, P.H., Ulbrich, M. (2015). Axiomatization of Typed First-Order Logic. In: Bjørner, N., de Boer, F. (eds) FM 2015: Formal Methods. FM 2015. Lecture Notes in Computer Science(), vol 9109. Springer, Cham. https://doi.org/10.1007/978-3-319-19249-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-19249-9_29
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19248-2
Online ISBN: 978-3-319-19249-9
eBook Packages: Computer ScienceComputer Science (R0)