Abstract
Uniqueness typing and affine (or linear) typing are dual type systems. Uniqueness gives a guarantee that an term has not been shared, while affinity imposes a restriction that a term may not be shared. We show that we can unify both concepts through polymorphism.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Ahmed, A., Fluet, M., Morrisett, G.: A step-indexed model of substructural state. In: Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming (ICFP), pp. 78–91. ACM (2005)
Barendsen, E., Smetsers, S.: Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science 6, 579–612 (1996)
Girard, J.Y.: Linear logic. Theoretical Computer Science 50(1), 1–102 (1987)
Hage, J., Holdermans, S., Middelkoop, A.: A generic usage analysis with subeffect qualifiers. In: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming (ICFP), pp. 235–246. ACM (2007)
Henderson, F.: Strong modes can change the world! honours Report, Department of Computer Science, University of Melbourne (November 1992)
Overton, D.: Precise and expressive mode systems for typed logic programming languages. Ph.D. thesis, The University of Melbourne (December 2003)
Plasmeijer, R., van Eekelen, M.: Clean Language Report (version 2.1) (November 2002)
Scholz, S.B.: Single assignment C: efficient support for high-level array operations in a functional setting. Journal of Functional Programming 13(6), 1005–1059 (2003)
Turner, D.N., Wadler, P., Mossin, C.: Once upon a type. In: Proceedings of the 7th International Conference on Functional Programming Languages and Computer Architecture (FPCA), pp. 1–11. ACM (1995)
de Vries, E.: Making Uniqueness Typing Less Unique. Ph.D. thesis, Trinity College Dublin (2008)
de Vries, E., Francalanza, A., Hennessy, M.: Uniqueness typing for resource management in message-passing concurrency. Journal of Logic and Computation (2012)
de Vries, E., Plasmeijer, R., Abrahamson, D.M.: Uniqueness typing redefined. In: Horváth, Z., Zsók, V., Butterfield, A. (eds.) IFL 2006. LNCS, vol. 4449, pp. 181–198. Springer, Heidelberg (2007)
de Vries, E., Plasmeijer, R., Abrahamson, D.M.: Uniqueness typing simplified. In: Chitil, O., Horváth, Z., Zsók, V. (eds.) IFL 2007. LNCS, vol. 5083, pp. 201–218. Springer, Heidelberg (2008)
Wadler, P.: Is there a use for linear logic? In: Proceedings of the 2nd ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation (PEPM), pp. 255–273. ACM (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
de Vries, E. (2013). Modelling Unique and Affine Typing Using Polymorphism. In: Achten, P., Koopman, P. (eds) The Beauty of Functional Code. Lecture Notes in Computer Science, vol 8106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40355-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-40355-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40354-5
Online ISBN: 978-3-642-40355-2
eBook Packages: Computer ScienceComputer Science (R0)