-
1
-
-
0033226029
-
Introduction to set constraint-based program analysis
-
A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35:79-111, 1999.
-
(1999)
Science of Computer Programming
, vol.35
, pp. 79-111
-
-
Aiken, A.1
-
3
-
-
0001526119
-
Intersection and union types: Syntax and semantics
-
Jun
-
F. Barbanera, M. Dezani-Ciancaglini, and U. de'Liguoro. Intersection and union types: Syntax and semantics. Information and Computation, 119(2):202-230, Jun 1995.
-
(1995)
Information and Computation
, vol.119
, Issue.2
, pp. 202-230
-
-
Barbanera, F.1
Dezani-Ciancaglini, M.2
De'Liguoro, U.3
-
4
-
-
84862711593
-
-
Technical Report 337, Computer Science Department, University of Western Ontario, London, Ontario, Canada, Nov
-
A. Brüggemann-Klein and D. Wood. Unambiguous regular expressions and SGML document grammars. Technical Report 337, Computer Science Department, University of Western Ontario, London, Ontario, Canada, Nov 1992.
-
(1992)
Unambiguous Regular Expressions and SGML Document Grammars
-
-
Brüggemann-Klein, A.1
Wood, D.2
-
10
-
-
0034539302
-
Regular expression types for XML
-
Montreal, Canada, Sep
-
H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP'00), Montreal, Canada, pages 11-22, Sep 2000.
-
(2000)
Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP'00)
, pp. 11-22
-
-
Hosoya, H.1
Vouillon, J.2
Pierce, B.C.3
-
11
-
-
17644410032
-
Lightweight extensible records for Haskell
-
Oct Published in Technical Report UU-CS-1999-28, Department of Computer Science, University of Utrecht
-
M. Jones and S. Peyton Jones. Lightweight extensible records for Haskell. In Proceedings of the 1999 Haskell Workshop, Paris, France, Oct 1999. Published in Technical Report UU-CS-1999-28, Department of Computer Science, University of Utrecht.
-
(1999)
Proceedings of the 1999 Haskell Workshop, Paris, France
-
-
Jones, M.1
Peyton Jones, S.2
-
12
-
-
0003465573
-
-
Distinguished Dissertations in Computer Science. Cambridge University Press
-
M. P. Jones. Qualified Types: Theory and Practice. Distinguished Dissertations in Computer Science. Cambridge University Press, 1994.
-
(1994)
Qualified Types: Theory and Practice
-
-
Jones, M.P.1
-
14
-
-
0033705215
-
Implicit parameters: Dynamic scoping with static types
-
Jan
-
J. Lewis, M. Shields, E. Meijer, and J. Launchbury. Implicit parameters: Dynamic scoping with static types. In Proceedings of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'00), Boston, Massachusetts, pages 108-118, Jan 2000.
-
(2000)
Proceedings of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'00), Boston, Massachusetts
, pp. 108-118
-
-
Lewis, J.1
Shields, M.2
Meijer, E.3
Launchbury, J.4
-
15
-
-
0021230898
-
An ideal model for recursive polymorphic types
-
D. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. In Proceedings of the Eleventh Annual ACM Symposium on Principles of Programming Languages (POPL'84), Salt Lake City, Utah, pages 165-174, 1984.
-
(1984)
Proceedings of the Eleventh Annual ACM Symposium on Principles of Programming Languages (POPL'84), Salt Lake City, Utah
, pp. 165-174
-
-
MacQueen, D.1
Plotkin, G.2
Sethi, R.3
-
17
-
-
0033707829
-
Typechecking for XML transformers
-
May
-
T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. In Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (SIGMOD/PODS 2000), Dallas, Texas, pages 11-22, May 2000.
-
(2000)
Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (SIGMOD/PODS 2000), Dallas, Texas
, pp. 11-22
-
-
Milo, T.1
Suciu, D.2
Vianu, V.3
-
18
-
-
0032761040
-
Type inference with constrained types
-
M. Odersky, M. Sulzmann, and M. Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35-55, 1999.
-
(1999)
Theory and Practice of Object Systems
, vol.5
, Issue.1
, pp. 35-55
-
-
Odersky, M.1
Sulzmann, M.2
Wehr, M.3
-
19
-
-
0029404987
-
A polymorphic record calculus and its compilation
-
Nov Earlier version appears in POPL'93, pp. 99-112
-
A. Ohori. A polymorphic record calculus and its compilation. ACM Transactions on Programming Languages and Systems, 17(6):844-895, Nov 1995. Earlier version appears in POPL'93, pp. 99-112.
-
(1995)
ACM Transactions on Programming Languages and Systems
, vol.17
, Issue.6
, pp. 844-895
-
-
Ohori, A.1
-
21
-
-
0005096066
-
Intersection types and bounded polymorphism
-
Apr
-
B. C. Pierce. Intersection types and bounded polymorphism. Mathematical Structures in Computer Science, 7(2):129-193, Apr 1997.
-
(1997)
Mathematical Structures in Computer Science
, vol.7
, Issue.2
, pp. 129-193
-
-
Pierce, B.C.1
-
23
-
-
1542766965
-
Type inference for records in a natural extension of ML
-
C. A. Gunter and J. C. Mitchell, editors, The MIT Press, Earlier verision appears in POPL'89
-
D. Rémy. Type inference for records in a natural extension of ML. In C. A. Gunter and J. C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. The MIT Press, 1993. Earlier verision appears in POPL'89, pp. 77-87.
-
(1993)
Theoretical Aspects of Object-Oriented Programming. Types, Semantics and Language Design
, pp. 77-87
-
-
Rémy, D.1
-
24
-
-
0013419335
-
Design of the programming language FORSYTHE
-
P. W. O'Hearn and R. D. Tennent, editors, Birkhäuser
-
J. C. Reynolds. Design of the programming language FORSYTHE. In P. W. O'Hearn and R. D. Tennent, editors, ALGOL-like Languages, pages 173-233. Birkhäuser, 1997.
-
(1997)
ALGOL-like Languages
, pp. 173-233
-
-
Reynolds, J.C.1
-
25
-
-
0005007555
-
-
PhD thesis, Oregon Graduate Institute, Jan To appear
-
M. Shields. Static Types for Dynamic Documents. PhD thesis, Oregon Graduate Institute, Jan 2001. (To appear. Draft available at http://vw.cse.ogi.edu/~mbs).
-
(2001)
Static Types for Dynamic Documents
-
-
Shields, M.1
-
26
-
-
0032675774
-
An algorithm for general set unification and its complexity
-
Jan
-
F. Stolzenburg. An algorithm for general set unification and its complexity. Journal of Automated Reasoning, 22(1):45-63, Jan 1999.
-
(1999)
Journal of Automated Reasoning
, vol.22
, Issue.1
, pp. 45-63
-
-
Stolzenburg, F.1
-
30
-
-
0023210290
-
Complete type inference for simple objects
-
Jun Corrigendum in LICS'88, p. 132
-
M. Wand. Complete type inference for simple objects. In Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, (LICS'87), Ithaca, New York, pages 37-44, Jun 1987. Corrigendum in LICS'88, p. 132.
-
(1987)
Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, (LICS'87), Ithaca, New York
, pp. 37-44
-
-
Wand, M.1
-
31
-
-
0026187053
-
Type inference for record concatenation and multiple inheritance
-
Jul
-
M. Wand. Type inference for record concatenation and multiple inheritance. Information and Computation, 93(1):1-15, Jul 1991.
-
(1991)
Information and Computation
, vol.93
, Issue.1
, pp. 1-15
-
-
Wand, M.1
|