SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1099, Issue , 1996, Pages 170-181

Effective models of polymorphism, subtyping and recursion

(2) Mitchell, John a Viswanathan, Ramesh b

a Stanford University (United States)

b LUCENT TECHNOLOGIES (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES; ROBOTS;

COMPUTABILITY THEORY; COMPUTABLE FUNCTIONS; CONSTRUCTIVE LOGIC; NATURAL NUMBER; PARAMETRICITY; POLYMORPHIC FUNCTIONS; RECURSION THEORY; STANDARD DOMAINS;

POLYMORPHISM;

EID: 84947716553 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-61440-0_126 Document Type: Conference Paper

Times cited : (1)

References (9)

1
- 0025624101
- A PER model of polymorphism and recursive types
- M Abadi and G.D. Plotkin. A PER model of polymorphism and recursive types. In Proc. IEEE Symp. on Logic in Computer Science, pages 355-365, 1990.
- (1990) Proc. IEEE Symp. On Logic in Computer Science , pp. 355-365
- Abadi, M.¹ Plotkin, G.D.²

2
- 0003990776
- Springer-Verlag, Berlin
- J. Barwise. Admissible sets and structures. Springer-Verlag, Berlin, 1975.
- (1975) Admissible Sets and Structures
- Barwise, J.¹

3
- 0003749740
- North-Holland, Amsterdam, Second edition
- H.P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984. Second edition.
- (1984) The Lambda Calculus: Its Syntax and Semantics
- Barendregt, H.P.¹

4
- 0026995981
- PER models of subtyping, recursive types and higher-order polymorphism
- K. Bruce and J.C. Mitchell. PER models of subtyping, recursive types and higher-order polymorphism. In Proc. 19th ACM Symp. on Principles of Programming Languages, pages 316-327, January 1992.
- (1992) Proc. 19Th ACM Symp. On Principles of Programming Languages , pp. 316-327
- Bruce, K.¹ Mitchell, J.C.²

5
- 0004151487
- Press, Cambridge
- N.J. Cutland. Computability: An introduction to recursive function theory. Cambridge Univ. Press, Cambridge, 1980.
- (1980) Computability: An Introduction to Recursive Function Theory. Cambridge Univ
- Cutland, N.J.¹

6
- 38249011214
- Extensional PER's
- Preliminary version appeared in Proc. IEEE Symp. on Logic in Computer Science, IEEE, 1990, 346-354
- P. Freyd, G. Rosolini, P. Mulry, and D.S. Scott. Extensional PER's. Information and Computation, 98(2):211-227, 1992. Preliminary version appeared in Proc. IEEE Symp. on Logic in Computer Science, IEEE, 1990, 346-354.
- (1992) Information and Computation , vol.98 , Issue.2 , pp. 211-227
- Freyd, P.¹ Rosolini, G.² Mulry, P.³ Scott, D.S.⁴

7
- 0001848686
- Semantic domains
- J. van Leeuwen,editor, North-Holland, Amsterdam
- CA. Gunter and D.S. Scott, Semantic domains. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, pages 633-674. North-Holland, Amsterdam, 1990.
- (1990) Handbook of Theoretical Computer Science, Volume B , pp. 633-674
- Gunter, C.A.¹ Scott, D.S.²

8
- 0025590747
- Effective domains and intrinsic structure
- W. Phoa. Effective domains and intrinsic structure. In Proc. IEEE Symp. on Logic in Computer Science, pages 366-377, 1990.
- (1990) Proc. IEEE Symp. On Logic in Computer Science , pp. 366-377
- Phoa, W.¹

9
- 0000874096
- The category-theoretic solution of recursive domain equations
- M. Smyth and G.D. Plotkin. The category-theoretic solution of recursive domain equations. SIAM J. Computing, 11:761-783, 1982.
- (1982) SIAM J. Computing , vol.11 , pp. 761-783
- Smyth, M.¹ Plotkin, G.D.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.