BibSLEIGH — type inference tag

type inference

type inference

Tag #type inference

176 papers:

ICFP-2019-ZhaoOS #formal method #polymorphism: A mechanical formalization of higher-ranked polymorphic type inference (JZ, BCdSO, TS), p. 29.
PEPM-2019-SatoI0 #higher-order #model checking #refinement: Combining higher-order model checking with refinement type inference (RS, NI, NK0), pp. 47–53.
POPL-2019-MiyazakiSI #type system: Dynamic type inference for gradual Hindley-Milner typing (YM0, TS, AI), p. 29.
OOPSLA-2018-VazouTH: Gradual liquid type inference (NV, ÉT, DVH), p. 25.
ESEC-FSE-2018-HellendoornBBA #learning: Deep learning type inference (VJH, CB, ETB, MA), pp. 152–162.
CAV-2018-HassanUE0 #python: MaxSMT-Based Type Inference for Python 3 (MH, CU, ME, PM0), pp. 12–19.
ICPC-2017-MilojkovicGN #lightweight: Exploiting type hints in method argument names to improve lightweight type inference (NM, MG, ON), pp. 77–87.
ICFP-2017-AvanziniL #analysis #automation #complexity: Automating sized-type inference for complexity analysis (MA, UDL), p. 29.
POPL-2017-DolanM #morphism #polymorphism #type system: Polymorphism, subtyping, and type inference in MLsub (SD, AM), pp. 60–72.
ASE-2017-ChengZS0S #automation #fault #integer #named: IntPTI: automatic integer error repair with proper-type inference (XC, MZ0, XS, MG0, JS), pp. 996–1001.
ESOP-2017-Padovani: Context-Free Session Type Inference (LP), pp. 804–830.
Onward-2016-MilojkovicN #heuristic: Exploring cheap type inference heuristics in dynamically typed languages (NM, ON), pp. 43–56.
OOPSLA-2016-ChandraGJSSTC #compilation #javascript: Type inference for static compilation of JavaScript (SC, CSG, JBJ, CS, MS, FT, YIC), pp. 410–429.
OOPSLA-2016-Loncaric0SS #fault #framework: A practical framework for type inference error explanation (CL, SC0, CS, MS), pp. 781–799.
PLDI-2016-NoonanLC #polymorphism: Polymorphic type inference for machine code (MN, AL, DC), pp. 27–41.
POPL-2016-0008E #data type: Principal type inference for GADTs (SC0, ME), pp. 416–428.
POPL-2016-EmmiE #data type: Symbolic abstract data type inference (ME, CE), pp. 513–525.
FSE-2016-XuZCPX #natural language #probability #python: Python probabilistic type inference with natural language support (ZX, XZ0, LC0, KP, BX), pp. 607–618.
ECMFA-2015-ZolotasMDKP #flexibility #modelling: Type Inference in Flexible Model-Driven Engineering (AZ, NDM, SD, DSK, RFP), pp. 75–91.
ECOOP-2015-HaqueP: Type Inference for Place-Oblivious Objects (RH, JP), pp. 371–395.
OOPSLA-2015-BostonSGC #approximate #flexibility #probability #programming: Probability type inference for flexible approximate programming (BB, AS, DG, LC), pp. 470–487.
PADL-2015-Tarau #combinator #generative #logic programming #normalisation #on the: On Logic Programming Representations of λ Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization (PT), pp. 115–131.
POPL-2015-Castagna0XA #polymorphism #re-engineering: Polymorphic Functions with Set-Theoretic Types: Part 2: Local Type Inference and Type Reconstruction (GC, KN, ZX, PA), pp. 289–302.
SAS-2015-HashimotoU #constraints #optimisation #refinement: Refinement Type Inference via Horn Constraint Optimization (KH, HU), pp. 199–216.
VMCAI-2015-ZhuNJ #array #testing: Dependent Array Type Inference from Tests (HZ, AVN, SJ), pp. 412–430.
Onward-2014-SpasojevicLN #ecosystem #mining: Mining the Ecosystem to Improve Type Inference for Dynamically Typed Languages (BS, ML, ON), pp. 133–142.
PEPM-J-2013-Simon14 #using: Deriving a complete type inference for Hindley-Milner and vector sizes using expansion (AS), pp. 254–271.
ICLP-J-2014-DuckHS #confluence #consistency #on the #termination: On Termination, Confluence and Consistent CHR-based Type Inference (GJD, RH, MS), pp. 619–632.
SCAM-2013-NicolayNRM #javascript #using: Determining dynamic coupling in JavaScript using object type inference (JN, CN, CDR, WDM), pp. 126–135.
PEPM-2013-Simon #using: Deriving a complete type inference for hindley-milner and vector sizes using expansion (AS), pp. 13–22.
ESOP-2013-HofmannR #analysis #automation: Automatic Type Inference for Amortised Heap-Space Analysis (MH, DR), pp. 593–613.
VMCAI-2013-ZhuJ #composition #dependent type #lightweight #ml: Compositional and Lightweight Dependent Type Inference for ML (HZ, SJ), pp. 295–314.
PLDI-2012-HackettG #hybrid #javascript #performance #precise: Fast and precise hybrid type inference for JavaScript (BH, SyG), pp. 239–250.
POPL-2012-RastogiCH: The ins and outs of gradual type inference (AR, AC, BH), pp. 481–494.
ICLP-2012-ZomboriCS #constraints #logic programming #static typing #using: Static Type Inference for the Q language using Constraint Logic Programming (ZZ, JC, PS), pp. 119–129.
POPL-2011-GhicaS #geometry #resource management #synthesis: Geometry of synthesis III: resource management through type inference (DRG, AS), pp. 345–356.
PPDP-2011-ColazzoS #complexity #precise #xquery: Precision and complexity of XQuery type inference (DC, CS), pp. 89–100.
ILC-2010-Mehnert #detection #fault #type system: Extending Dylan’s type system for better type inference and error detection (HM), pp. 1–10.
POPL-2010-SchaferM #datalog: Type inference for datalog with complex type hierarchies (MS, OdM), pp. 145–156.
PPDP-2010-BaillotH #linear #logic: Type inference in intuitionistic linear logic (PB, MH), pp. 219–230.
GPCE-2010-MiddelkoopDS #attribute grammar: Iterative type inference with attribute grammars (AM, AD, SDS), pp. 43–52.
VMCAI-2010-HenzingerHKV #invariant #matrix: Invariant and Type Inference for Matrices (TAH, TH, LK, AV), pp. 163–179.
ICFP-2009-SchrijversJSV #data type #decidability: Complete and decidable type inference for GADTs (TS, SLPJ, MS, DV), pp. 341–352.
POPL-2009-Leijen #flexibility #morphism #polymorphism #robust: Flexible types: robust type inference for first-class polymorphism (DL), pp. 66–77.
PPDP-2009-UnnoK #dependent type: Dependent type inference with interpolants (HU, NK), pp. 277–288.
ASE-2009-MunkbyS #fault tolerance #predict: Type Inference for Soft-Error Fault-Tolerance Prediction (GM, SS), pp. 65–75.
SAC-2009-FurrAFH #ruby #static typing: Static type inference for Ruby (MF, Jh(A, JSF, MWH), pp. 1859–1866.
PODS-2008-MoorSAV #datalog #optimisation #query: Type inference for datalog and its application to query optimisation (OdM, DS, PA, MV), pp. 291–300.
VLDB-2008-DeutchM #execution #query #type checking: Type inference and type checking for queries on execution traces (DD, TM), pp. 352–363.
ICSM-2008-KinneerR #algorithm #control flow #java #maintenance #representation: Assessing the usefulness of type inference algorithms in representing Java control flow to support software maintenance tasks (AK, GR), pp. 127–136.
ICFP-2008-Leijen #morphism #named #polymorphism: HMF: simple type inference for first-class polymorphism (DL), pp. 283–294.
ICFP-2008-RemyY #constraints #ml #performance: From ML to ML^F: graphic type constraints with efficient type inference (DR, BY), pp. 63–74.
OOPSLA-2008-BellamyAMS #performance: Efficient local type inference (BB, PA, OdM, DS), pp. 475–492.
OOPSLA-2008-SmithC #java #question: Java type inference is broken: can we fix it? (DS, RC), pp. 505–524.
SAC-2008-CimadamoreV #java #prolog: Integrating Java and Prolog through generic methods and type inference (MC, MV), pp. 198–205.
PPoPP-2008-ChandraSSB #analysis #data type #distributed #locality: Type inference for locality analysis of distributed data structures (SC, VAS, VS, RB), pp. 11–22.
POPL-2007-PolishchukLS #comprehension #debugging: Dynamic heap type inference for program understanding and debugging (MP, BL, CWS), pp. 39–46.
ESOP-2007-KuanMF #semantics: A Rewriting Semantics for Type Inference (GK, DM, RBF), pp. 426–440.
TACAS-2007-JhalaMX: State of the Union: Type Inference Via Craig Interpolation (RJ, RM, RGX), pp. 553–567.
ICFP-2006-JonesVWW #data type: Simple unification-based type inference for GADTs (SLPJ, DV, SW, GW), pp. 50–61.
ICML-2006-XingSJT #multi #process: Bayesian multi-population haplotype inference via a hierarchical dirichlet process mixture (EPX, KAS, MIJ, YWT), pp. 1049–1056.
POPL-2006-PottierR #algebra #data type: Stratified type inference for generalized algebraic data types (FP, YRG), pp. 232–244.
PPDP-2006-AbrahamE #spreadsheet: Type inference for spreadsheets (RA, ME), pp. 73–84.
PPDP-2006-LindahlS: Practical type inference based on success typings (TL, KFS), pp. 167–178.
ESOP-2006-FurrF #polymorphism: Polymorphic Type Inference for the JNI (MF, JSF), pp. 309–324.
SAT-2006-LynceM #satisfiability: SAT in Bioinformatics: Making the Case with Haplotype Inference (IL, JMS), pp. 136–141.
ICFP-2005-MakholmW #mixin #morphism: Type inference, principal typings, and let-polymorphism for first-class mixin modules (HM, JBW), pp. 156–167.
ICFP-2005-Pottier #ml: From ML type inference to stratified type inference (FP), p. 1.
ECOOP-2005-AndersonGD #javascript #towards: Towards Type Inference for JavaScript (CA, PG, SD), pp. 428–452.
PPDP-2005-TombF #automation #partial evaluation: Automatic type inference via partial evaluation (AT, CF), pp. 106–116.
SAC-2005-HuangCC #algorithm #approximate: An approximation algorithm for haplotype inference by maximum parsimony (YTH, KMC, TC), pp. 146–150.
WRLA-2004-LiquoriW05 #calculus #polymorphism #type checking: The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference] (LL, BW), pp. 89–111.
ICML-2004-XingSJ #process: Bayesian haplo-type inference via the dirichlet process (EPX, RS, MIJ).
ECOOP-2004-SpoonS #precise #scalability: Demand-Driven Type Inference with Subgoal Pruning: Trading Precision for Scalability (SAS, OS), pp. 51–74.
PPDP-2004-CarlierW: Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction (SC, JBW), pp. 132–143.
SAS-2004-FlanaganF: Type Inference Against Races (CF, SNF), pp. 116–132.
ESOP-2004-DuckPSS #decidability #dependence #functional: Sound and Decidable Type Inference for Functional Dependencies (GJD, SLPJ, PJS, MS), pp. 49–63.
TACAS-2004-LingerS #analysis #constraints #ml #theorem proving: Binding-Time Analysis for MetaML via Type Inference and Constraint Solving (NL, TS), pp. 266–279.
VMCAI-2004-AgarwalS #java: Type Inference for Parameterized Race-Free Java (RA, SDS), pp. 149–160.
RTA-2003-McAllester #algorithm #logic #ml: Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference (DAM), pp. 436–451.
ICFP-2003-HeerenHS #process: Scripting the type inference process (BH, JH, SDS), pp. 3–13.
CC-2003-JoishaB #matlab: The MAGICA Type Inference Engine for MATLAB (PGJ, PB), pp. 121–125.
ESOP-2003-Lhoussaine #distributed #π-calculus: Type Inference for a Distributed π-Calculus (CL), pp. 253–268.
PPDP-2002-Shafarenko #morphism #type system: Coercion as homomorphism: type inference in a system with subtyping and overloading (AVS), pp. 14–25.
SAS-2002-LuK #type checking: Backward Type Inference Generalises Type Checking (LL, AK), pp. 85–101.
SAS-2002-VaucheretB #logic programming #performance #precise #source code: More Precise Yet Efficient Type Inference for Logic Programs (CV, FB), pp. 102–116.
LICS-2002-PalsbergZ #performance #type system: Efficient Type Inference for Record Concatenation and Subtyping (JP, TZ), pp. 125–136.
VMCAI-2002-GoriL #abstract interpretation #empirical #verification: An Experiment in Type Inference and Verification by Abstract Interpretation (RG, GL), pp. 225–239.
FLOPS-2001-Sulzmann #framework: A General Type Inference Framework for Hindley/Milner Style Systems (MS), pp. 248–263.
ECOOP-2001-WangS #constraints #java #precise: Precise Constraint-Based Type Inference for Java (TW, SFS), pp. 99–117.
POPL-2001-OderskyZZ: Colored local type inference (MO, CZ, MZ), pp. 41–53.
ESOP-2001-ConchonP #calculus #constraints: JOIN(X): Constraint-Based Type Inference for the Join-Calculus (SC, FP), pp. 221–236.
FoSSaCS-2001-Coppo #equation #recursion: Type Inference with Recursive Type Equations (MC), pp. 184–198.
ESOP-2000-Pottier: A 3-Part Type Inference Engine (FP), pp. 320–335.
FoSSaCS-2000-Schubert #first-order #logic: Type Inference for First-Order Logic (AS), pp. 297–313.
PODS-1999-BusscheW #algebra #polymorphism #relational: Type Inference in the Polymorphic Relational Algebra (JVdB, EW), pp. 80–90.
PODS-1999-MiloS #query #semistructured data: Type Inference for Queries on Semistructured Data (TM, DS), pp. 215–226.
FLOPS-1999-CamaraoF #strict: Type Inference for Overloading without Restrictions, Declarations or Annotations (CC, LF), pp. 37–52.
ICFP-1999-Chitil #deforestation: Type Inference Builds a Short Cut to Deforestation (OC), pp. 249–260.
ICFP-1999-OhoriY #compilation #ml #morphism #polymorphism #rank: Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML (AO, NY), pp. 160–171.
ICEIS-1999-CarvalhoPJ99a #logic programming: Type Inference in Logic Programming Context (CLdC, ECP, RMdSJ), p. 764.
POPL-1999-KfouryW #decidability: Principality and Decidable Type Inference for Finite-Rank Intersection Types (AJK, JBW), pp. 161–174.
LICS-1999-KfouryP #recursion: Type Inference for Recursive Definitions (AJK, SMPG), pp. 119–128.
WCRE-1998-DeursenM #cobol: Type Inference for COBOL Systems (AvD, LM), pp. 220–230.
ICFP-1998-Pottier #framework #type system: A Framework for Type Inference with Subtyping (FP), pp. 228–238.
POPL-1998-PierceT: Local Type Inference (BCP, DNT), pp. 252–265.
POPL-1998-Schubert #higher-order #morphism #polymorphism #unification: Second-Order Unification and Type Inference for Church-Style Polymorphism (AS), pp. 279–288.
POPL-1998-ShieldsSJ #dynamic typing #staged #type system: Dynamic Typing as Staged Type Inference (MS, TS, SLPJ), pp. 289–302.
SAS-1998-CharatonikP #logic programming #source code: Directional Type Inference for Logic Programs (WC, AP), pp. 278–294.
SAS-1998-Duggan #finite #morphism #polymorphism #type system: Finite Subtype Inference with Explicit Polymorphism (DD), pp. 295–310.
POPL-1997-Jones #morphism #polymorphism: First-class Polymorphism with Type Inference (MPJ), pp. 483–496.
ICSE-1997-OCallahanJ #comprehension #named: Lackwit: A Program Understanding Tool Based on Type Inference (RO, DJ), pp. 338–348.
ILPS-1997-Pietrzak: Type Inference for CLP(FD) (PP), p. 407.
CC-1996-Steensgaard #analysis #points-to #source code: Points-to Analysis by Type Inference of Programs with Structures and Unions (BS), pp. 136–150.
FPCA-1995-AikenF #dynamic typing #type system: Dynamic Typing and Subtype Inference (AA, MF), pp. 182–191.
FPCA-1995-HengleinR #ml #polymorphism: Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML (FH, JR), pp. 192–203.
ECOOP-1995-Agesen #algorithm #morphism #parametricity #polymorphism #precise: The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism (OA), pp. 2–26.
OOPSLA-1995-AgesenH #comparison #feedback #object-oriented #optimisation: Type Feedback vs. Concrete Type Inference: A Comparison of Optimization Techniques for Object-Oriented Languages (OA, UH), pp. 91–107.
OOPSLA-1995-EifrigST #polymorphism: Sound Polymorphic Type Inference for Objects (JE, SFS, VT), pp. 169–184.
PEPM-1995-Monsuez #abstract interpretation #strict #using: Using Abstract Interpretation to Define a Strictness Type Inference System (BM), pp. 122–133.
PLILP-1995-BarendsenS: Uniqueness Type Inference (EB, SS), pp. 189–206.
POPL-1995-HoangM #bound #type system: Lower Bounds on Type Inference with Subtypes (MH, JCM), pp. 176–185.
ESOP-J-1994-HankinM95 #lazy evaluation #program analysis: Lazy Type Inference and Program Analysis (CH, DLM), pp. 219–249.
LFP-1994-Hall #representation #using: Using Hindley-Milner Type Inference to Optimise List Representation (CVH), pp. 162–172.
LFP-1994-KfouryW #algorithm #higher-order #λ-calculus: A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order λ-Calculus (AJK, JBW), pp. 196–207.
OOPSLA-1994-PlevyakC #object-oriented #precise: Precise Concrete Type Inference for Object-Oriented Languages (JP, AAC), pp. 324–340.
LOPSTR-1994-SolnonR #dependence: Propagation of Inter-argument Dependencies in “Tuple-distributive” Type Inference Systems (CS, MR), pp. 199–214.
PEPM-1994-CourtenageC #λ-calculus: Analysing Resource Use in the λ Calculus by Type Inference (SC, CDC), pp. 33–41.
POPL-1994-HankinM #algorithm #analysis #strict: Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis (CH, DLM), pp. 202–212.
SAS-1994-Agesen #constraints #morphism #parametricity #polymorphism: Constraint-Based Type Inference and Parametric Polymorphism (OA), pp. 78–100.
ESOP-1994-HankinM #analysis #lazy evaluation #strict: Lazy Type Inference for the Strictness Analysis of Lists (CH, DLM), pp. 257–271.
LICS-1994-PipernoR: Type Inference and Extensionality (AP, SRDR), pp. 196–205.
FPCA-1993-AikenW #constraints: Type Inclusion Constraints and Type Inference (AA, ELW), pp. 31–41.
SEKE-1993-ShinCY #prolog #source code: Mode Based Type Inference for Prolog Programs (DS, YC, HY), pp. 239–243.
ECOOP-1993-AgesenPS: Type Inference of SELF (OA, JP, MIS), pp. 247–267.
TAPSOFT-1993-Smith #polymorphism #type system: Polymorphic Type Inference with Overloading and Subtyping (GS), pp. 671–685.
LFP-1992-Henglein #optimisation: Global Tagging Optimization by Type Inference (FH), pp. 205–215.
LFP-1992-Kaes #recursion #type system: Type Inference in the Presence of Overloading, Subtyping and Recursive Types (SK), pp. 193–204.
ECOOP-1992-OxhojPS: Making Type Inference Practical (NO, JP, MIS), pp. 329–349.
POPL-1992-LincolnM #algorithm #aspect-oriented #type system: Algorithmic Aspects of Type Inference with Subtypes (PL, JCM), pp. 293–304.
ESOP-1992-OKeefeW #decidability: Type Inference for Partial Types is Decidable (PO, MW), pp. 408–417.
FPCA-1991-Henglein #analysis #higher-order #performance: Efficient Type Inference for Higher-Order Binding-Time Analysis (FH), pp. 448–472.
OOPSLA-1991-PalsbergS #object-oriented: Object-Oriented Type Inference (JP, MIS), pp. 146–161.
POPL-1991-AikenM #static typing: Static Type Inference in a Dynamically Typed Language (AA, BRM), pp. 279–290.
POPL-1991-HengleinM #complexity #higher-order #λ-calculus: The Complexity of Type Inference for Higher-Order Typed λ Calculi (FH, HGM), pp. 119–130.
POPL-1991-LeroyW #polymorphism: Polymorphic Type Inference and Assignment (XL, PW), pp. 291–302.
CAAP-1991-Schwartzbach: Type Inference with Inequalities (MIS), pp. 441–455.
VDME-1990-SpiveyS: Type Inference in Z (JMS, BS), pp. 426–451.
LFP-1990-Gomard #functional #source code: Partial Type Inference for Untyped Functional Programs (CKG), pp. 282–287.
ESOP-1990-EvenS #action semantics #semantics: Type Inference for Action Semantics (SE, DAS), pp. 118–133.
ESOP-1990-Thatte #scalability: Type Inference and Implicit Scaling (ST), pp. 406–420.
SIGMOD-1989-OhoriBT #database #polymorphism #programming #static typing: Database Programming in Machiavelli — a Polymorphic Language with Static Type Inference (AO, PB, VT), pp. 46–57.
FPCA-1989-KuoM #analysis #strict: Strictness Analysis: A New Perspective Based on Type Inference (TMK, PM), pp. 260–272.
FPCA-1989-WandO #complexity #on the: On the Complexity of Type Inference with Coercion (MW, PO), pp. 293–298.
OOPSLA-1989-OhoriB #parametricity #static typing: Static Type Inference for Parametric Classes (AO, PB), pp. 445–456.
PLDI-1989-Boehm #abstraction: Type Inference in the Presence of Type Abstraction (HJB), pp. 192–206.
CCIPL-1989-FuhM #polymorphism #type system: Polymorphic Subtype Inference: Closing the Theory-Practice Gap (YCF, PM), pp. 167–183.
LICS-1989-Wand #inheritance #multi: Type Inference for Record Concatenation and Multiple Inheritance (MW), pp. 92–97.
ICALP-1988-Thatte: Type Inference with Partial Types (ST), pp. 615–629.
LFP-1988-Henglein: Type Inference and Semi-Unification (FH), pp. 184–197.
LFP-1988-OhoriB #database #programming language: Type Inference in a Database Programming Language (AO, PB), pp. 174–183.
LFP-1988-Pfenning #higher-order #polymorphism #unification: Partial Polymorphic Type Inference and Higher-Order Unification (FP), pp. 153–163.
POPL-1988-Stansifer #type system: Type Inference with Subtypes (RS), pp. 88–97.
ESOP-1988-FuhM #type system: Type Inference with Subtypes (YCF, PM), pp. 94–114.
CADE-1988-Azzoune #prolog: Type Inference in Prolog (HA), pp. 258–277.
JICSCP-1988-Emden88 #polymorphism: Conditional Answers for Polymorphic Type Inference (MHvE), pp. 590–603.
JICSCP-1988-XuW88 #prolog: A Type Inference System for Prolog (JX, DSW), pp. 604–619.
LICS-1988-Wand #named: Corrigendum: Complete Type Inference for Simple Objects (MW), p. 132.
PLDI-1987-SutorJ #interpreter: The type inference and coercion facilities in the scratchpad II interpreter (RSS, RDJ), pp. 56–63.
CSL-1987-Leiss #object-oriented #on the #programming language: On Type Inference for Object-Oriented Programming Languages (HL), pp. 151–172.
LICS-1987-Wand: Complete Type Inference for Simple Objects (MW), pp. 37–44.
POPL-1986-JohnsonW #approach #incremental: A Maximum-Flow Approach to Anomaly Isolation in Unification-Based Incremental Type Inference (GFJ, JAW), pp. 44–57.
LICS-1986-CoppoZ #logic: Type inference and logical relations (MC, MZ), pp. 218–226.
LFP-1984-Katayama #approach #functional #programming language #type checking: Type Inference and Type Checking for Functional Programming Languages: A Reduced Computation Approach (TK), pp. 263–272.
POPL-1984-Mitchell: Coercion and Type Inference (JCM), pp. 175–185.
POPL-1983-Leivant #polymorphism: Polymorphic Type Inference (DL), pp. 88–98.