-
1
-
-
0004072686
-
-
Addison-Wesley
-
A V Aho, R Sethi, and J D Ullman. Compilers, principles, techniques, and tools. Addison-Wesley, 1986.
-
(1986)
Compilers, principles, techniques, and tools
-
-
Aho, A.V.1
Sethi, R.2
Ullman, J.D.3
-
2
-
-
0022333721
-
On understanding types, data abstraction, and polymorphism
-
December
-
L Cardelli and P Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4):471-522, December 1985.
-
(1985)
Computing Surveys
, vol.17
, Issue.4
, pp. 471-522
-
-
Cardelli, L.1
Wegner, P.2
-
3
-
-
0029462709
-
Subtypes vs. Where Clauses: Constraining parametric polymorphism
-
October
-
M Day, R Gruber, B Liskov, and A Myers. Subtypes vs. Where Clauses: Constraining parametric polymorphism. In Proc, 10th Conf on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA'95), pages 156-168, October 1995.
-
(1995)
Proc, 10th Conf on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA'95)
, pp. 156-168
-
-
Day, M.1
Gruber, R.2
Liskov, B.3
Myers, A.4
-
5
-
-
1442358203
-
-
Programming Methodology Group Memo 88, MIT Laboratory for Computer Science, Cambridge, MA, February
-
B Liskov, D Curtis, M Day, S Ghemawat, R Gruber, P Johnson, and A C Myers. Theta Reference Manual, preliminary version. Programming Methodology Group Memo 88, MIT Laboratory for Computer Science, Cambridge, MA, February 1995.
-
(1995)
Theta Reference Manual, preliminary version
-
-
Liskov, B.1
Curtis, D.2
Day, M.3
Ghemawat, S.4
Gruber, R.5
Johnson, P.6
Myers, A.C.7
-
7
-
-
0017526283
-
Abstraction mechanisms in clu
-
August
-
B Liskov, A Snyder, R Atkinson, and C Schaffert. Abstraction mechanisms in clu. Comm ACM, 20(8):564-576, August 1977.
-
(1977)
Comm ACM
, vol.20
, Issue.8
, pp. 564-576
-
-
Liskov, B.1
Snyder, A.2
Atkinson, R.3
Schaffert, C.4
-
9
-
-
84976655200
-
An ad-hoc approach to the implementation of polymorphism
-
R Morrison, A Dearie, R C H Connor, and A L Brown. An ad-hoc approach to the implementation of polymorphism. ACM TOPLAS, 13(3):342-371, 1991.
-
(1991)
ACM TOPLAS
, vol.13
, Issue.3
, pp. 342-371
-
-
Morrison, R.1
Dearie, A.2
Connor, R.C.H.3
Brown, A.L.4
-
11
-
-
0003102688
-
Bounded quantification is undecidable
-
July
-
B C Pierce. Bounded quantification is undecidable. Information and Computation, 112(1):131-165, July 1994.
-
(1994)
Information and Computation
, vol.112
, Issue.1
, pp. 131-165
-
-
Pierce, B.C.1
-
13
-
-
21344435441
-
Towards an ML-style Polymorphic Type System for C
-
Linköping, Sweden, April
-
G Smith and D Volpano. Towards an ML-style Polymorphic Type System for C. In 1996 Eurpoean Symposium on Programming, Linköping, Sweden, April 1996.
-
(1996)
1996 Eurpoean Symposium on Programming
-
-
Smith, G.1
Volpano, D.2
-
14
-
-
85032404869
-
-
Technical report, International Computer Science Institute, Berkeley, CA
-
D Stoutamire and S Omohundro. Sather 1.1. Technical report, International Computer Science Institute, Berkeley, CA, 1996.
-
(1996)
Sather 1.1
-
-
Stoutamire, D.1
Omohundro, S.2
-
15
-
-
84957603888
-
Engineering a Programming Languager- the Type and Class System of Sather
-
number 782 in Springer LNCS, Zurich, Switzerland, March
-
C Szyperski, S Omohundro, and S Murer. Engineering a Programming Languager- the Type and Class System of Sather. In Proc, 1st Inti Conf on Programming Languages and System Architectures, number 782 in Springer LNCS, Zurich, Switzerland, March 1994.
-
(1994)
Proc, 1st Inti Conf on Programming Languages and System Architectures
-
-
Szyperski, C.1
Omohundro, S.2
Murer, S.3
|