Type inference with constrained types

被引：0
|
作者：
Odersky, M [1 ]
Sulzmann, M
Wehr, M
机构：
[1] Univ S Australia, Sch Comp & Informat Sci, The Levels, SA 5095, Australia
[2] Yale Univ, Dept Comp Sci, New Haven, CT 06520 USA
[3] Univ Edinburgh, LFCS, Edinburgh EH7 3JZ, Midlothian, Scotland
来源：
THEORY AND PRACTICE OF OBJECT SYSTEMS | 1999年 / 5卷 / 01期
关键词：
D O I：
10.1002/(SICI)1096-9942(199901/03)5:1<35::AID-TAPO4>3.0.CO;2-4
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present a general framework HM(X) for type systems with constraints. The framework stays in the tradition of the Hindley/Milner type system. Its type system instances are sound under a standard untyped compositional semantics. We can give a generic type inference algorithm for HM(X) so that, under sufficient conditions on X, type inference will always compute the principal type of a term. We discuss instances of the framework that deal with polymorphic records, equational theories, and subtypes. (C) 1999 John Wiley & Sons, Inc.
引用
收藏
页码：35 / 55
页数：21
相关论文
共 50 条
  • [41] Inference with constrained hidden Markov models in PRISM
    Christiansen, Henning
    Have, Christian Theil
    Lassen, Ole Torp
    Petit, Matthieu
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2010, 10 : 449 - 464
  • [42] Haplotype Inference Constrained by Plausible Haplotype Data
    Fellows, Michael R.
    Hartman, Tzvika
    Hermelin, Danny
    Landau, Gad M.
    Rosamond, Frances
    Rozenberg, Liat
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2009, 5577 : 339 - +
  • [43] Inference for Constrained Estimation of Tumor Size Distributions
    Ghosh, Debashis
    Banerjee, Moulinath
    Biswas, Pinaki
    BIOMETRICS, 2008, 64 (04) : 1009 - 1017
  • [44] Optimal Probability Weights for Inference With Constrained Precision
    Santacatterina, Michele
    Bottai, Matteo
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2018, 113 (523) : 983 - 991
  • [45] Dynamic Inference of Static Types for Ruby
    An, Jong-hoon
    Chaudhuri, Avik
    Foster, Jeffrey S.
    Hicks, Michael
    POPL 11: PROCEEDINGS OF THE 38TH ANNUAL ACM SIGPLAN-SIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES, 2011, : 459 - 471
  • [46] SCHEME FOR THE AUTOMATIC INFERENCE OF VARIABLE TYPES
    KAPLAN, MA
    ULLMAN, JD
    JOURNAL OF THE ACM, 1980, 27 (01) : 128 - 145
  • [47] Java']Java SAM Typed Closures: A Sound and Complete Type Inference System for Nominal Types
    Bellia, Marco
    Occhiuto, M. Eugenia
    FUNDAMENTA INFORMATICAE, 2013, 128 (1-2) : 17 - 33
  • [48] Dynamic inference of polymorphic lock types
    Rose, J
    Swamy, N
    Hicks, M
    SCIENCE OF COMPUTER PROGRAMMING, 2005, 58 (03) : 366 - 383
  • [49] An Automatic Inference of Minimal Security Types
    Bollmann, Dominik
    Lortz, Steffen
    Mantel, Heiko
    Starostin, Artem
    INFORMATION SYSTEMS SECURITY, (ICISS 2015), 2015, 9478 : 395 - 415
  • [50] TYPE INFERENCE AND TYPE CONTAINMENT
    MITCHELL, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1984, 173 : 257 - 277
12345