Abstract
A simple type σ is retractable to a simple type τ if there are two terms C:σ→τ and D:τ→σ such that D ∘ C = β nλx.x . The paper presents a system which for given σ,τ derives affine retractability i.e. the above relation with additional restriction that in C and D every bound variable occurs at most once. A derivation in the system constructs these terms. What is more, the complexity of building affine retractions is studied. The problem of affine retractability is NP-complete evenfor the class of types over single type atom and having limited functional order. A polynomial algorithm for types of orders less than 3 is also presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barendregt, H.P.: Lambda calculi with types. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 117–309. Oxford Science Publications (1992)
Bruce, K., Longo, G.: Provable isomorphisms and domain equations in models of typed languages. In: ACM Symposium on Theory of Computing (STOC 1985) (May 1985)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms, ch. 27. MIT Press, Cambridge (1990)
Di Cosmo, R.: Isomorphisms of types: from lambda-calculus to information retrieval and language design, Birkhauser (1995)
De’Liguoro, U., Piperno, A., Statman, R.: Retracts in Simply Typed λβη-Calculus. In: Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, pp. 461–469 (1992)
Regnier, P.U.L.: Retractions of types with many atoms, Warsaw University. Tech. report, Institute of Informatics (2001)
Padovani, V.: Retracts in simple types. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 376–384. Springer, Heidelberg (2001)
Rittri, M.: Using types as search keys in function libraries. Using types as search keys in function libraries 1(1), 71–89 (1991)
Spławski, Z., Urzyczyn, P.: Type fixpoints: Iteration vs. recursion. In: Proceedings of 4th International Conference on Functional Programming, pp. 102–113. ACM, New York (1999)
Vorobyov, S.: The ”Hardest” Natural Decidable Theory. In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 294–305 (1997)
Dougherty, D., Wierzbicki, T.: A decidable variant of higher order matching. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 340–351. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schubert, A. (2004). On the Building of Affine Retractions. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-30124-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23024-3
Online ISBN: 978-3-540-30124-0
eBook Packages: Springer Book Archive