-
1
-
-
84909802861
-
Barendregt. Lambda calculi with types
-
S. Abramsky, D. Gabbay, and T. Maibaum, editors, Oxford Univ. Press
-
Henk P. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science (volume 2). Oxford Univ. Press, 1991.
-
(1991)
Handbook of Logic in Computer Science
, vol.2
-
-
Henk, P.1
-
2
-
-
0032691322
-
CPS-translations and applications: The cube and beyond
-
September
-
G. Barthe, J. Hatcliff, and M.H. Sørensen. CPS-translations and applications: the cube and beyond. Higher-Order and Symbolic Computation, 12(2):125-170, September 1999.
-
(1999)
Higher-Order and Symbolic Computation
, vol.12
, Issue.2
, pp. 125-170
-
-
Barthe, G.1
Hatcliff, J.2
Sørensen, M.H.3
-
5
-
-
0036850258
-
Intensional polymorphism in type-erasure semantics
-
November
-
Karl Crary, Stephanie Weirich, and Greg Morrisett. Intensional polymorphism in type-erasure semantics. Journal of Functional Programming, 12(6):567-600, November 2002.
-
(2002)
Journal of Functional Programming
, vol.12
, Issue.6
, pp. 567-600
-
-
Crary, K.1
Weirich, S.2
Morrisett, G.3
-
6
-
-
0026394160
-
On the expressive power of programming languages
-
December
-
Matthias Felleisen. On the expressive power of programming languages. Science of Computer Programming, 17(1-3):35-75, December 1991.
-
(1991)
Science of Computer Programming
, vol.17
, Issue.1-3
, pp. 35-75
-
-
Felleisen, M.1
-
7
-
-
84947292266
-
A calculus for compiling and linking classes
-
of LNCS, New York, NY, March/April Springer-Verlag
-
Kathleen Fisher, John Reppy, and Jon G. Riecke. A calculus for compiling and linking classes. In European Symposium on Programming, volume 1782 of LNCS, pages 134-149, New York, NY, March/April 2000. Springer-Verlag.
-
(2000)
European Symposium on Programming
, vol.1782
, pp. 134-149
-
-
Fisher, K.1
Reppy, J.2
Riecke, J.G.3
-
10
-
-
0036568688
-
Polytypic values possess polykinded types
-
May-June
-
Ralf Hinze. Polytypic values possess polykinded types. Science of Computer Programming, 43(2-3):129-159, May-June 2002.
-
(2002)
Science of Computer Programming
, vol.43
, Issue.2-3
, pp. 129-159
-
-
Hinze, R.1
-
11
-
-
33745858605
-
Typed compilation against non-manifest base classes
-
January
-
Christopher League and Stefan Monnier. Typed compilation against non-manifest base classes. Lecture Notes in Computer Science, 3956: 77-98, January 2006.
-
(2006)
Lecture Notes in Computer Science
, vol.3956
, pp. 77-98
-
-
League, C.1
Monnier, S.2
-
14
-
-
47249102619
-
Erasure and polymorphism in pure type systems
-
Lecture Notes in Computer Science Budapest, Hungary, April
-
Nathan Mishra-Linger and Tim Sheard. Erasure and polymorphism in pure type systems. In Conference on Foundations of Software Science and Computation Structures, volume 4962 of Lecture Notes in Computer Science, pages 350-364, Budapest, Hungary, April 2008.
-
(2008)
Conference on Foundations of Software Science and Computation Structures
, vol.4962
, pp. 350-364
-
-
Mishra-Linger, N.1
Sheard, T.2
-
16
-
-
0031679751
-
From system F to typed assembly language
-
January
-
Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From system F to typed assembly language. In Symposium on Principles of Programming Languages, pages 85-97, January 1998.
-
(1998)
Symposium on Principles of Programming Languages
, pp. 85-97
-
-
Morrisett, G.1
Walker, D.2
Crary, K.3
Glew, N.4
-
18
-
-
84976827574
-
Towards a theory of type structure
-
Springer-Verlag, Berlin
-
John C. Reynolds. Towards a theory of type structure. In Proceedings, Colloque sur la Programmation, Lecture Notes in Computer Science, volume 19, pages 408-425. Springer-Verlag, Berlin, 1974.
-
(1974)
Proceedings, Colloque Sur la Programmation, Lecture Notes in Computer Science
, vol.19
, pp. 408-425
-
-
Reynolds, J.C.1
-
19
-
-
0036036524
-
A type system for certified binaries
-
January
-
Zhong Shao, Bratin Saha, Valery Trifonov, and Nikolaos Papaspyrou. A type system for certified binaries. In Symposium on Principles of Programming Languages, pages 217-232, January 2002.
-
(2002)
Symposium on Principles of Programming Languages
, pp. 217-232
-
-
Shao, Z.1
Saha, B.2
Trifonov, V.3
Papaspyrou, N.4
-
20
-
-
0034542069
-
Fully reflexive intensional type analysis
-
Montréal, Canada, September ACM Press
-
Valery Trifonov, Bratin Saha, and Zhong Shao. Fully reflexive intensional type analysis. In International Conference on Functional Programming, pages 82-93, Montréal, Canada, September 2000. ACM Press.
-
(2000)
International Conference on Functional Programming
, pp. 82-93
-
-
Trifonov, V.1
Saha, B.2
Shao, Z.3
|