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. 1 Introduction When programs communicate with other programs, or possibly with other incarnations of themselves, flexibility is demanded. Programs do...

Citations

148	Dynamic typing in a statically typed language - Abadi, Cardelli, et al. - 1991
126	Eekelen, M.: Functional Programming and Parallel Graph Rewriting - Plasmeijer, van - 1993
92	Dynamic typing in polymorphic languages - Abadi, Cardelli, et al. - 1995
53	Dynamics in ML - Leroy, Mauny - 1991
34	Uniqueness typing for functional languages with graph rewriting semantics - Barendsen, Smetsers - 1996
14	First class file I/O - Pil - 1997
4	Efficient Persistent Haskell - Davie, Hammond, et al. - 1998