Dynamic typing in polymorphic languages

1995 ◽  
Vol 5 (1) ◽  
pp. 111-130 ◽  
Author(s):  
M. Abadi ◽  
L. Cardelli ◽  
B. Pierce ◽  
D. Rémy

AbstractThere are situations in programming where some dynamic typing is needed, even in the presence of advanced static type systems. We investigate the interplay of dynamic types with other advanced type constructions, discussing their integration into languages with explicit polymorphism (in the style of system F), implicit polymorphism (in the style of ML), abstract data types, and subtyping.

1988 ◽  
Vol 11 (1) ◽  
pp. 49-63
Author(s):  
Andrzej Szalas

In this paper we deal with a well known problem of specifying abstract data types. Up to now there were many approaches to this problem. We follow the axiomatic style of specifying abstract data types (cf. e.g. [1, 2, 6, 8, 9, 10]). We apply, however, the first-order temporal logic. We introduce a notion of first-order completeness of axiomatic specifications and show a general method for obtaining first-order complete axiomatizations. Some examples illustrate the method.


1987 ◽  
Vol 22 (4) ◽  
pp. 103-110 ◽  
Author(s):  
J D Eckart

2007 ◽  
Vol 17 (3) ◽  
pp. 183-203 ◽  
Author(s):  
Borislav Nikolik ◽  
Dick Hamlet

1981 ◽  
Vol 11 (2) ◽  
pp. 203-206
Author(s):  
Hartmut H. Wedekind

1975 ◽  
Vol 10 (7) ◽  
pp. 25-29 ◽  
Author(s):  
Jack B. Dennis

Sign in / Sign up

Export Citation Format

Share Document