SCOPUS 정보 검색 플랫폼

Theoretical Computer Science

Volumn 59, Issue 1-2, 1988, Pages 85-114

Extensional models for polymorphism

(2) Breazu Tannen, Val a Coquand, Thierry b

a UNIVERSITY OF PENNSYLVANIA (United States)

b INRIA Domaine de Voluceau 78150 Rocquencourt France ^*

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY;

DATA TYPES; EXTENSIONAL MODELS; OBJECT ORIENTED PROGRAMMING LANGUAGES; POLYMORPHIC LAMBDA CALCULUS; POLYMORPHISM;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0024035517 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(88)90097-7 Document Type: Article

Times cited : (30)

References (50)

1
- 0003214304
- The Lambda Calculus: Its Syntax and Semantics
- 2nd edition, North-Holland, Amsterdam
- (1984) Studies in Logic and the Foundations of Mathematics , vol.103
- Barendregt¹

2
- 0022103846
- Automatic synthesis of typed Λ-programs on term algebras
- (1985) Theoretical Computer Science , vol.39 , pp. 135-154
- Böhm¹ Berarducci²

3
- 84918638598
- (1986) Communication in the Types electronic forum (types@theory.lcs.mit.edu)
- Breazu-Tannen¹

4
- 84913464270
- Conservative extension of type theories
- Massachusetts Institute of Technology, supervised by A.R. Meyer
- (1987) Ph.D. Thesis
- Breazu-Tannen¹

5
- 84918608616
- Univ. of Pennsylvania, Manuscript
- (1987) Proof of a conjecture on polymorphic lambda models with all types non-empty
- Breazu-Tannen¹

6
- 84918653835
- Extensional models for polymorphism
- Proc. TAPSOFT—Colloquium on Functional and Logic Programming and Specifications, Pisa, 1987, Springer, Berlin
- (1987) Lecture Notes in Computer Science , vol.250 , pp. 291-307
- Breazu-Tannen¹ Coquand²

7
- 85035021295
- Computable values can be classical
- (1987) Proc. 14th Symp. on Principles of Programming Languages , pp. 238-245
- Breazu-Tannen¹ Meyer²

8
- 0023247802
- Polymorphism is conservative over simple types
- (1987) Proc. Symp. on Logic in Computer Science , pp. 7-17
- Breazu-Tannen¹ Meyer²

9
- 85032877787
- The semantics of second-order polymorphic lambda calculus
- G. Kahn, D.B. MacQueen, G. Plotkin, Proc. Conf. on Semantics of Data Types, Sophia-Antipolis, 1984, Springer, Berlin
- (1984) Lecture Notes in Computer Science , vol.173 , pp. 131-144
- Bruce¹ Meyer²

10
- 85035063895
- Hope: an experimental applicative language
- Stanford University Computer Science Department
- (1980) LISP Conference , pp. 136-143
- Burstall¹ MacQueen² Sanella³

11
- 85027611941
- A categorical approach to realizability and polymorphic types
- Proc. 3rd ACM Workshop on the Mathematical Foundations of Programming Language Semantics, New Orleans, 1987, Springer, Berlin
- (1988) Lecture Notes in Computer Science , vol.298 , pp. 23-42
- Carboni¹ Freyd² Scedrov³

12
- 84918622936
- (1985) Combinators and Functional Programming Languages, Proc. 13th Summer School of the LITP, Le Val D'Ajol, France
- Cardelli¹ Amber²

13
- 0022333721
- On understanding types, data abstraction and polymorphism
- (1985) Comput. Surveys , vol.17 , Issue.4 , pp. 471-522
- Cardelli¹ Wegner²

14
- 84918639296
- (1986) Communication in the Types electronic formum (types@theory.lcs.mit.edu)
- Coquand¹

15
- 35348814575
- Ponder and its type system
- Computer Laboratory, Univ. of Cambridge, Cambridge, England
- (1982) Tech. Rept. 31
- Fairbairn¹

16
- 0020587468
- The expressiveness of simple and second-order type structures
- (1983) J. ACM , vol.30 , Issue.1 , pp. 151-185
- Fortune¹ Leivant² O'Donnell³

17
- 0023169302
- Some semantics aspects of polymorphic lambda calculus
- (1987) Proc. Symp. on Logic in Computer Science , pp. 315-319
- Freyd¹ Scedrov²

18
- 0001981633
- Equality between functionals
- R. Parikh, Lecture Notes in Mathematics, Springer, Berlin
- (1975) Proc. Logic Colloqium '73 , vol.453 , pp. 22-37
- Friedman¹

19
- 0002410411
- On the axiom of extensionality—Part I
- (1956) The Journal of Symbolic Logic , vol.21 , pp. 36-48
- Gandy¹

20
- 0004099873
- Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieure
- Université de Paris VII
- (1972) Ph.D. Thesis
- Girard¹

21
- 84976850269
- Completeness of many-sorted equational logic
- (1982) ACM SIGPLAN Notices , vol.17 , pp. 9-17
- Goguen¹ Meseguer²

22
- 0011420147
- Edinburgh LCF
- Springer, Berlin
- (1979) Lecture Notes in Computer Science , vol.78
- Gordon¹ Milner² Wadsworth³

23
- 84982656456
- Lambda-calculus models and extensionality
- (1980) Zeitschrift für Mathematische Logik und Grundlagen der Mathematik , vol.26 , pp. 289-310
- Hindley¹ Longo²

24
- 0000429274
- A small complete category
- to appear.
- (1988) Ann. Pure Appl. Logic , vol.40
- Hyland¹

25
- 84918645781
- Manuscript
- (1987) The discrete objects in the effective topos
- Hyland¹ Robinson² Rosolini³

26
- 0001776862
- Interpretation of analysis by means of constructive functionals of finite types
- A. Heyting, North-Holland, Amsterdam
- (1959) Constructivity in Mathematics , pp. 101-128
- Kreisel¹

27
- 0020890390
- Reasoning about functional programs and complexity classes associated with type disciplines
- (1983) Proc. 24th Symp. on Foundations of Computer Science , pp. 460-469
- Leivant¹

28
- 84918600170
- Poly manual
- Computer Laboratory, Univ. of Cambridge, Cambridge, England
- (1985) Tech. Rept. 63
- Matthews¹

29
- 84918645189
- (1986) Communication in the Types electronic forum (types@theory.lcs.mit.edu)
- Meyer¹

30
- 0019342627
- What is a model of the lambda calculus?
- (1982) Inform. and Control , vol.52 , Issue.1 , pp. 87-122
- Meyer¹

31
- 85027598931
- Empty types in polymorphic λ-calculus
- (1987) Proc. 14th Symp. on Principles of Programming Languages , pp. 253-262
- Meyer¹ Mitchell² Moggi³ Statman⁴

32
- 83455210966
- (1986) Personal communication
- Mitchell¹

33
- 84913452545
- A type-inference approach to reduction properties and semantics of polymorphic expressions
- New York
- (1986) Proc. LISP and Functional Programming Conf., , pp. 308-319
- Mitchell¹

34
- 84976786138
- Second-order logical relations (extended abstract)
- R. Parikh, Proc. Conf. on Logics of Programs, Brooklyn, 1985, Springer, Berlin
- (1985) Lecture Notes in Computer Science , vol.193 , pp. 225-236
- Mitchell¹ Meyer²

35
- 0023170734
- Kripke-style models for typed lambda calculus
- (1987) Proc. Symp. on Logic in Computer Science , pp. 303-314
- Mitchell¹ Moggi²

36
- 84918606561
- (1986) Communication in the Types electronic forum (types@theory.lcs.mit.edu)
- Moggi¹

37
- 84918606561
- (1986) Communication in the Types electronic forum (types@theory.lcs.mit.edu)
- Moggi¹

38
- 84918651133
- An incremental, strongly typed database query language
- Univ. of Pennsylvania, Philadelphia, PA, available as Tech. Rept. MS-CIS-85-02.
- (1984) Ph.D. Thesis
- Nikhil¹

39
- 84918625361
- Polymorphisms is set theoretic, constructively
- School of Mathematical and Physical Sciences/Computer Science, Univ. of Sussex, Proc. Summer Conf. on Category Theory and Computer Science, Edinburgh, 1987 Lecture Notes in Computer Science 1987 Springer Berlin, to appear in:
- (1987) Rept. 2⧸87
- Pitts¹

40
- 85034845622
- Three approaches to type structure
- Lecture Notes in Computer Science, Springer, Berlin
- (1985) Mathematical Foundations of Software Development , vol.185 , pp. 97-138
- Reynolds¹

41
- 84976827574
- Towards a theory of type structure
- B. Robinet, Lecture Notes in Computer Science, Springer, Berlin
- (1974) Programming Symp. , vol.19 , pp. 408-425
- Reynolds¹

42
- 0020919435
- Types, abstraction, and parametric polymorphism
- R.E.A. Mason, North-Holland, Amsterdam
- (1983) Information Processing '83 , pp. 513-523
- Reynolds¹

43
- 0010984767
- Categorical semantics for higher-order polymorphic lambda calculus
- (1987) The Journal of Symbolic Logic , vol.52 , Issue.4 , pp. 969-989
- Seely¹

44
- 84914839515
- Higher-order polymorphic lambda calculus and categories
- (1986) Math. Rep. Acad. Sci. (Canad.) , vol.8 , Issue.2 , pp. 135-139
- Seely¹

45
- 0002056503
- Completeness invariance and λ-definability
- (1982) The Journal of Symbolic Logic , vol.47 , pp. 17-26
- Statman¹

46
- 0011230817
- λ-definable functionals and βη conversion
- (1983) Arch. Math. Logik , vol.23 , pp. 21-26
- Statman¹

47
- 0019672570
- Number-theoric functions computable by polymorphic programs
- (1981) Proc. 22nd Symp. Foundations of Computer Science , pp. 279-282
- Statman¹

48
- 33645495009
- On the existence of closed terms in the typed λ-calculus
- J.P. Seldin, R. Hindley, Academic Press, New York
- (1980) To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism , pp. 511-534
- Statman¹

49
- 0003315261
- Metamathematical Investigation of Intuitionistic Arithmetic and Analysis
- Springer, Berlin
- (1973) Lecture Notes in Mathematics , vol.344
- Troelstra¹

50
- 84922995178
- Miranda: a nonstrict functional language with polymorphic types
- J.-P. Jouannaud, Lecture Notes in Computer Science, Springer, Berlin
- (1985) Proc. conf. on Functional Programming Languages and Computer Architecture , vol.201 , pp. 1-16
- Turner¹

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