Abstract
When programs communicate with other programs, flexibility is demanded. Programs do not necessarily have information about each other. When assigning types to these communications a certain amount of dynamic typing is unavoidable. But we do not want our entire language to become dynamically typed, and consequently an interface between the statically and dynamically typed parts of the program has to be defined. Such an interface, using dynamics, has been introduced by Abadi et al. Leroy and Mauni extended the system of dynamics to allow the inclusion of polymorphic objects in dynamics. In this paper we extend the system even further with a restricted form of type dependent functions, which allow us to abstract over the types of the dynamics on functional level. In Clean, these type dependent functions will be implemented by overloading
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Abadi, L. Cardelli, B. Pierce, and G. Plotkin. Dynamic Typing in a Statically Typed Language. ACM Transactions on Programming Languages and Systems, 13(2):237–268, 1991.
M. Abadi, L. Cardelli, B. Pierce, and D. Rémy. Dynamic Typing in Polymorphic Languages. Journal of Functional Programming, 5(1):111–130, 1995.
E. Barendsen and J. Smetsers. Uniqueness Typing for Functional Languages with Graph Rewriting Semantics. Mathematical Structures in Computer Science, 6:579–612, 1996.
A.J.T. Davie, K. Hammond, and J.-J. Quintela. Efficient Persistent Haskell, In Draft Proc. 10th International Workshop on the Implementation of Functional Languages (IFL’ 98), London, England, pages 183–194, 1998.
M.C.J.D. van Eekelen and M.J. Plasmeijer. Functional Programming and Parallel Graph Rewriting, Addison-Wesley, 1993.
M.J.C.D. van Eekelen and M.J. Plasmeijer. Concurrent Clean 1.0 Language Report, Computing Science Institute, University of Nijmegen, http://www.cs.kun.nl/~clean/Clean.Cleanbook.html.
X. Leroy and M. Mauny. Dynamics in ML. Journal of Functional Programming, 3(4):431–463, 1993.
M. Pil. First Class File I/O. In Proc. 8th. International Workshop on the Implementation of Functional Languages (IFL’ 96), Bad Godesberg, Germany, September 1996, volume 1268 of LNCS, pages 233–246. Springer-Verlag, 1997.
J. Robinson. A Machine-Oriented Logic Based on the Resolution Principle. Journal of the Association For Computing Machinery 12:23–41, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pil, M. (1999). Dynamic Types and Type Dependent Functions. In: Hammond, K., Davie, T., Clack, C. (eds) Implementation of Functional Languages. IFL 1998. Lecture Notes in Computer Science, vol 1595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48515-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-48515-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66229-7
Online ISBN: 978-3-540-48515-5
eBook Packages: Springer Book Archive