Abstract
We study the type inference problem for the Soft Type Assignment system (STA) for λ-calculus introduced in [1], which is correct and complete for polynomial time computations. In particular we design an algorithm which, given in input a λ-term, provides all the constraints that need to be satisfied in order to type it. For the propositional fragment of STA, the satisfiability of the constraints is decidable. We conjecture that, for the whole system, the type inference is undecidable, but our algorithm can be used for checking the typability of some particular terms.
Paper partially supported by MIUR-Cofin’07 CONCERTO Project.
This is a preview of subscription content, log in via an institution to check access.
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
Gaboardi, M., Ronchi Della Rocca, S.: A soft type assignment system for λ-calculus. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 253–267. Springer, Heidelberg (2007)
Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science 318(1-2), 163–180 (2004)
Coppo, M., Dezani-Ciancaglini, M., Venneri, B.: Principal type schemes and lambda-calculus semantics. In: Seldin, J.P., Hindley, J.R. (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 535–560. Academic Press, Inc., New York (1980)
Giannini, P., Ronchi Della Rocca, S.: A type inference algorithm for a stratified polymorphic type discipline. Information and Computation 109(1/2), 115–173 (1994)
Coppola, P., Dal Lago, U., Ronchi Della Rocca, S.: Elementary affine logic and the call by value lambda calculus. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 131–145. Springer, Heidelberg (2005)
Wells, J.B.: Typability and type checking in the second-order λ-calculus are equivalent and undecidable. In: Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science (LICS 1994), pp. 176–185. IEEE Computer Society, Los Alamitos (1994)
Baillot, P., Terui, K.: Light types for polynomial time computation in lambda-calculus. In: Proceedings of the Nineteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2004), pp. 266–275. IEEE Computer Society, Los Alamitos (2004)
Asperti, A.: Light affine logic. In: Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (LICS 1998), pp. 300–308. IEEE Computer Society, Los Alamitos (1998)
Gaboardi, M.: Linearity: an Analytic Tool in the study of Complexity and Semantics of Programming Languages. PhD thesis, Università degli Studi di Torino - Institut National Polytechnique de Lorraine (2007)
Robinson, J.A.: Machine-oriented logic based on resolution principle. Journal of the ACM 12, 23–41 (1965)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)
Baillot, P., Terui, K.: A feasible algorithm for typing in elementary affine logic. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 55–70. Springer, Heidelberg (2005)
Kfoury, A.J., Ronchi Della Rocca, S., Tiuryn, J., Urzyczyn, P.: Alpha-conversion and typability. Information and Computation 150(1), 1–21 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaboardi, M., Della Rocca, S.R. (2009). Type Inference for a Polynomial Lambda Calculus. In: Berardi, S., Damiani, F., de’Liguoro, U. (eds) Types for Proofs and Programs. TYPES 2008. Lecture Notes in Computer Science, vol 5497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02444-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-02444-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02443-6
Online ISBN: 978-3-642-02444-3
eBook Packages: Computer ScienceComputer Science (R0)