Abstract
A simple type σ is retractable to a simple type τ if there are two terms Cσ→τ and Dτ→σ such that D ○ C λx.x. The retractability of types is affine if the terms C and D are affine, that is, when every bound variable occurs in them at most once in the scope of its declaration. This paper presents a system that derives affine retractability for simple types. It also studies the complexity of constructing these affine retractions. The problem of affine retractability is NP-complete even for the class of types over a single type atom and having limited functional order. In addition, a polynomial algorithm for types of orders less than three is presented.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference25 articles.
1. Efficient algorithms for isomorphisms of simple types
2. Wierzbicki T. and Dougherty D. (2002) A Decidable Variant of Higher Order Matching. In: Tison S. (ed.) Proc. 13th Conf. on Rewriting Techniques and Applications, RTA'02. Springer-Verlag Lecture Notes in Computer Science 2378 340–351.
3. Decidability of bounded second order unification
4. Using types as search keys in function libraries
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Retractions in Intersection Types;Electronic Proceedings in Theoretical Computer Science;2017-02-07
2. Proof Systems for Retracts in Simply Typed Lambda Calculus;Automata, Languages, and Programming;2013