BibSLEIGH — polymorphism tag

polymorphism

polymorphism

Tag #polymorphism

314 papers:

FSCD-2019-0001K #higher-order #termination: Polymorphic Higher-Order Termination (LC0, CK), p. 18.
Haskell-2019-Devriese #approach #case study #composition #haskell #morphism #taxonomy #verification: Modular effects in Haskell through effect polymorphism and explicit dictionary applications: a new approach and the μVeriFast verifier as a case study (DD), pp. 1–14.
ICFP-2019-ZhaoOS #formal method #type inference: A mechanical formalization of higher-ranked polymorphic type inference (JZ, BCdSO, TS), p. 29.
ECOOP-2019-ShaikhhaP #algebra #linear: Finally, a Polymorphic Linear Algebra Language (Pearl) (AS, LP), p. 29.
OOPSLA-2019-WangHZTT #named #performance #type system: IVT: an efficient method for sharing subtype polymorphic objects (YPW, XQH, ZXZ, WT, GT), p. 22.
POPL-2019-DunfieldK #bidirectional #morphism #rank: Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types (JD, NRK), p. 28.
POPL-2019-ParkHSR #multi #symmetry: Polymorphic symmetric multiple dispatch with variance (GP, JH, GLSJ, SR), p. 28.
GPCE-2019-Shaikhha #pattern matching #semantics: Polymorphic extractors for semantic and portable pattern matching (short paper) (AS), pp. 61–67.
ESOP-2019-BiXOS #composition #morphism #programming: Distributive Disjoint Polymorphism for Compositional Programming (XB, NX, BCdSO, TS), pp. 381–409.
ESOP-2019-SekiyamaI #algebra: Handling Polymorphic Algebraic Effects (TS, AI), pp. 353–380.
ICFP-2018-HackettH #morphism #parametricity: Parametric polymorphism and operational improvement (JH, GH), p. 24.
ICFP-2018-OhoriUM #compilation #morphism #optimisation: Finitary polymorphism for optimizing type-directed compilation (AO, KU, HM), p. 29.
CIKM-2018-KhattabHS #in memory #manycore #named #paradigm: PolyHJ: A Polymorphic Main-Memory Hash Join Paradigm for Multi-Core Machines (OK, MH, OS), pp. 1323–1332.
PLDI-2018-SerranoHVJ #morphism: Guarded impredicative polymorphism (AS0, JH, DV, SPJ), pp. 783–796.
POPL-2018-BernardyBNJS #haskell #higher-order #linear: Linear Haskell: practical linearity in a higher-order polymorphic language (JPB, MB, RRN, SPJ, AS), p. 29.
PPDP-2018-NadathurW #morphism #proving: Schematic Polymorphism in the Abella Proof Assistant (GN, YW), p. 13.
ESOP-2018-ToninhoY #encoding #on the: On Polymorphic Sessions and Functions - A Tale of Two (Fully Abstract) Encodings (BT, NY), pp. 827–855.
ICFP-2017-IgarashiSI #on the #type system: On polymorphic gradual typing (YI, TS, AI), p. 29.
ECOOP-2017-Gordon #approach: A Generic Approach to Flow-Sensitive Polymorphic Effects (CSG), p. 31.
OOPSLA-2017-ZhangM #interface #morphism #named #product line: Familia: unifying interfaces, type classes, and family polymorphism (YZ, ACM), p. 31.
PLDI-2017-EisenbergJ #morphism: Levity polymorphism (RAE, SPJ), pp. 525–539.
POPL-2017-Crary #abstraction #morphism #parametricity: Modules, abstraction, and parametric polymorphism (KC), pp. 100–113.
POPL-2017-DolanM #morphism #type inference #type system: Polymorphism, subtyping, and type inference in MLsub (SD, AM), pp. 60–72.
CC-2017-LiLX #execution #morphism #symbolic computation: Dynamic symbolic execution for polymorphism (LL, YL, JX), pp. 120–130.
ESOP-2017-AlpuimOS #morphism: Disjoint Polymorphism (JA, BCdSO, ZS), pp. 1–28.
FSCD-2016-AkiyoshiT #normalisation #λ-calculus: Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule. (RA, KT), p. 15.
ICFP-2016-CastagnaP0: Set-theoretic types for polymorphic variants (GC, TP, KN0), pp. 378–391.
OOPSLA-2016-PetrashkoULO #graph #morphism #parametricity: Call graphs for languages with parametric polymorphism (DP, VU, OL, MO), pp. 394–409.
PLDI-2016-NoonanLC #type inference: Polymorphic type inference for machine code (MN, AL, DC), pp. 27–41.
PLDI-2016-PolikarpovaKS #refinement #synthesis: Program synthesis from polymorphic refinement types (NP, IK, ASL), pp. 522–538.
CSL-2016-Laird #game studies #semantics: Polymorphic Game Semantics for Dynamic Binding (JL), p. 16.
ICPC-2015-MilojkovicCLNRR #java #morphism #smalltalk: Polymorphism in the spotlight: studying its prevalence in Java and Smalltalk (NM, AC, MFL, ON, DR, RR), pp. 186–195.
TLCA-2015-AtkeyGFRS #modelling #morphism #physics: Models for Polymorphism over Physical Dimension (RA, NG, FNF, TR, SS), pp. 45–59.
ICFP-2015-Dunfield #morphism: Elaborating evaluation-order polymorphism (JD), pp. 256–268.
ICFP-2015-ZilianiS #algorithm #coq #morphism #unification: A unification algorithm for Coq featuring universe polymorphism and overloading (BZ, MS), pp. 179–191.
ICGT-2015-Lowe #category theory #graph grammar: Polymorphic Sesqui-Pushout Graph Rewriting (ML), pp. 3–18.
CHI-2015-AndersonKJEHV #how: How Polymorphic Warnings Reduce Habituation in the Brain: Insights from an fMRI Study (BBA, CBK, JLJ, DE, SH, AV), pp. 2883–2892.
CHI-2015-LernerFG #user interface: Polymorphic Blocks: Formalism-Inspired UI for Structured Connectors (SL, SRF, WGG), pp. 3063–3072.
ECOOP-2015-LongLR #morphism: Intensional Effect Polymorphism (YL, YDL, HR), pp. 346–370.
OOPSLA-2015-ToroT #scala: Customizable gradual polymorphic effects for Scala (MT, ÉT), pp. 935–953.
PEPM-2015-PoulsenMT #abstract interpretation #imperative #morphism: Imperative Polymorphism by Store-Based Types as Abstract Interpretations (CBP, PDM, PT), pp. 3–8.
POPL-2015-Castagna0XA #re-engineering #type inference: Polymorphic Functions with Set-Theoretic Types: Part 2: Local Type Inference and Type Reconstruction (GC, KN, ZX, PA), pp. 289–302.
FLOPS-2014-YallopW #lightweight #morphism: Lightweight Higher-Kinded Polymorphism (JY, LW), pp. 119–135.
Haskell-2014-MuranushiE #case study #experience #haskell #research: Experience report: type-checking polymorphic units for astrophysics research in Haskell (TM, RAE), pp. 31–38.
PEPM-J-2013-WeijersHH14 #fault #higher-order #security: Security type error diagnosis for higher-order, polymorphic languages (JW, JH, SH), pp. 200–218.
PLDI-2014-GreenmanMT #bound #morphism: Getting F-bounded polymorphism into shape (BG, FM, RT), p. 12.
PLDI-2014-Simon: Optimal inference of fields in row-polymorphic records (AS), p. 13.
POPL-2014-Castagna0XILP #evaluation #semantics #syntax: Polymorphic functions with set-theoretic types: part 1: syntax, semantics, and evaluation (GC, KN, ZX, HI, SL, LP), pp. 5–18.
ESOP-2014-SlepakSM #morphism #rank: An Array-Oriented Language with Static Rank Polymorphism (JS, OS, PM), pp. 27–46.
FASE-2014-LoweKS #category theory #graph transformation: Polymorphic Single-Pushout Graph Transformation (ML, HK, CS), pp. 355–369.
SMT-2014-BonichonDT #morphism: Extending SMT-LIB v2 with λ-Terms and Polymorphism (RB, DD, CT), pp. 53–62.
CSMR-2013-MihanceaM #correlation #fault #morphism #question: Changes, Defects and Polymorphism: Is There Any Correlation? (PFM, CM), pp. 341–344.
Haskell-2013-BernardyP #for free: Names for free: polymorphic views of names and binders (JPB, NP), pp. 13–24.
ICFP-2013-DunfieldK #bidirectional #morphism #rank: Complete and easy bidirectional typechecking for higher-rank polymorphism (JD, NRK), pp. 429–442.
OOPSLA-2013-UrecheTO #morphism #named #parametricity #trade-off: Miniboxing: improving the speed to code size tradeoff in parametric polymorphism translations (VU, CT, MO), pp. 73–92.
PEPM-2013-WeijersHH #fault #higher-order #security: Security type error diagnosis for higher-order, polymorphic languages (JW, JH, SH), pp. 3–12.
ESOP-2013-CairesPPT #behaviour #communication #morphism #parametricity: Behavioral Polymorphism and Parametricity in Session-Based Communication (LC, JAP, FP, BT), pp. 330–349.
TACAS-2013-BlanchetteBPS #encoding: Encoding Monomorphic and Polymorphic Types (JCB, SB, AP, NS), pp. 493–507.
CADE-2013-BlanchetteP #first-order #morphism #named: TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism (JCB, AP), pp. 414–420.
LICS-2013-FioreH #algebra #equation #logic #multi #semantics #syntax: Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic (MPF, MH), pp. 520–529.
RTA-2012-SattlerB #equation: Turing-Completeness of Polymorphic Stream Equation Systems (CS, FB), pp. 256–271.
TOOLS-EUROPE-J-2011-IngesmanE12 #calculus #java #morphism: Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 1–23.
ECOOP-2012-RytzOH #lightweight: Lightweight Polymorphic Effects (LR, MO, PH), pp. 258–282.
DATE-2012-SekaninaV #optimisation #satisfiability: A SAT-based fitness function for evolutionary optimization of polymorphic circuits (LS, ZV), pp. 715–720.
ICLP-2012-Hadjichristodoulou #prolog #type system: A Gradual Polymorphic Type System with Subtyping for Prolog (SH), pp. 451–457.
ICFP-2011-CastagnaX #morphism #parametricity #type system: Set-theoretic foundation of parametric polymorphism and subtyping (GC, ZX), pp. 94–106.
ICFP-2011-GesbertGL #logic #morphism #parametricity #semantics #type system: Parametric polymorphism and semantic subtyping: the logical connection (NG, PG, NL), pp. 107–116.
DHM-2011-TangwenF #analysis #architecture #cumulative #learning: Polymorphic Cumulative Learning in Integrated Cognitive Architectures for Analysis of Pilot-Aircraft Dynamic Environment (TY, SF), pp. 409–416.
OOPSLA-2011-AllenHKLRCS #composition #inheritance #morphism #multi #parametricity #type checking: Type checking modular multiple dispatch with parametric polymorphism and multiple inheritance (EEA, JH, SK, VL, SR, DC, GLSJ), pp. 973–992.
TOOLS-EUROPE-2011-IngesmanE #calculus #java #morphism: Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 179–193.
PPDP-2011-ChristiansenS #strict: Minimally strict polymorphic functions (JC, DS), pp. 53–64.
ESEC-FSE-2011-HackettA #morphism: Inferring data polymorphism in systems code (BH, AA), pp. 332–342.
HPCA-2011-AnsariFGM #design #named #robust: Archipelago: A polymorphic cache design for enabling robust near-threshold operation (AA, SF, SG, SAM), pp. 539–550.
ESOP-2011-BeloGIP #contract: Polymorphic Contracts (JFB, MG, AI, BCP), pp. 18–37.
FoSSaCS-2011-Hamana #syntax: Polymorphic Abstract Syntax via Grothendieck Construction (MH), pp. 381–395.
CSL-2011-BernadetL #modelling #morphism #orthogonal: Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism (AB, SL), pp. 51–66.
ICPC-2010-Mihancea #named #visualisation: Patrools: Visualizing the Polymorphic Usage of Class Hierarchies (PFM), pp. 36–37.
ICALP-v2-2010-Laird #call-by #game studies #morphism #semantics: Game Semantics for Call-by-Value Polymorphism (JL), pp. 187–198.
FLOPS-2010-ThiemannS #combinator #generative: Tag-Free Combinators for Binding-Time Polymorphic Program Generation (PT, MS), pp. 87–102.
ICFP-2010-HoldermansH #analysis #higher-order: Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators (SH, JH), pp. 63–74.
SAC-2010-RytzO #design #object-oriented #scala: Named and default arguments for polymorphic object-oriented languages: a discussion on the design implemented in the Scala language (LR, MO), pp. 2090–2095.
ESOP-2010-BernardyJC #testing: Testing Polymorphic Properties (JPB, PJ, KC), pp. 125–144.
TACAS-2010-LeinoR #design #encoding #logic #verification: A Polymorphic Intermediate Verification Language: Design and Logical Encoding (KRML, PR), pp. 312–327.
LICS-2010-Laird #game studies #programming language #semantics: Game Semantics for a Polymorphic Programming Language (JL), pp. 41–49.
VLDB-2009-FriedmanPC #approach #named #pipes and filters #self #sql: SQL/MapReduce: A practical approach to self-describing, polymorphic, and parallelizable user-defined functions (EF, PMP, JC), pp. 1402–1413.
TLCA-2009-Petit #type system #λ-calculus: A Polymorphic Type System for the λ-Calculus with Constructors (BP), pp. 234–248.
ICFP-2009-RompfMO #continuation #implementation: Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform (TR, IM, MO), pp. 317–328.
MoDELS-2009-Maoz #modelling #semantics #specification: Polymorphic Scenario-Based Specification Models: Semantics and Applications (SM), pp. 499–513.
MoDELS-2009-Maoz #modelling #semantics #specification: Polymorphic Scenario-Based Specification Models: Semantics and Applications (SM), pp. 499–513.
PEPM-2009-RungtaM #model checking #morphism #source code: Guided model checking for programs with polymorphism (NR, EGM), pp. 21–30.
POPL-2009-Leijen #flexibility #morphism #robust #type inference: Flexible types: robust type inference for first-class polymorphism (DL), pp. 66–77.
SAS-2009-YasuokaT: Polymorphic Fractional Capabilities (HY, TT), pp. 36–51.
ESOP-2009-StricklandTF #morphism: Practical Variable-Arity Polymorphism (TSS, STH, MF), pp. 32–46.
FoSSaCS-2009-BirkedalST #morphism #parametricity #recursion #semantics: Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (LB, KS, JT), pp. 456–470.
CSL-2009-Sumii #equivalence #λ-calculus: A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (ES), pp. 455–469.
LICS-2009-Dominguez #calculus #logic #similarity: Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus (LD), pp. 81–90.
ICFP-2008-Jones08a #functional #morphism #perspective #programming: Polymorphism and page tables: systems programming from a functional programmer’s perspective (MPJ), pp. 265–266.
ICFP-2008-Leijen #morphism #named #type inference: HMF: simple type inference for first-class polymorphism (DL), pp. 283–294.
ICFP-2008-VytiniotisWJ #haskell #morphism #named: FPH: first-class polymorphism for Haskell (DV, SW, SLPJ), pp. 295–306.
IFL-2008-TellerSV #fault #lightweight #ml #performance #type safety: Catch Me If You Can — Looking for Type-Safe, Hierarchical, Lightweight, Polymorphic and Efficient Error Management in OCaml (DT, AS, TV), pp. 249–271.
LOPSTR-2008-SchrijversBG: From Monomorphic to Polymorphic Well-Typings and Beyond (TS, MB, JPG), pp. 152–167.
PPDP-2008-Lu #dependence #logic programming #precise #source code: Inferring precise polymorphic type dependencies in logic programs (LL), pp. 143–151.
SAS-2008-CominiDV #abstract interpretation #on the #recursion #type system: On Polymorphic Recursion, Type Systems, and Abstract Interpretation (MC, FD, SV), pp. 144–158.
GPCE-2008-HoferORM #domain-specific language: Polymorphic embedding of dsls (CH, KO, TR, AM), pp. 137–148.
ESOP-2008-MatthewsA #exclamation #morphism #parametricity #runtime #theorem: Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices! (JM, AA), pp. 16–31.
FoSSaCS-2008-Mishra-LingerS #morphism #type system: Erasure and Polymorphism in Pure Type Systems (NML, TS), pp. 350–364.
LICS-2008-LassenL #bisimulation #morphism #normalisation #parametricity: Typed Normal Form Bisimulation for Parametric Polymorphism (SBL, PBL), pp. 341–352.
SEKE-2007-MaZPYL #adaptation #architecture #self: Constructing Self-Adaptive Systems with Polymorphic Software Architecture (XM, YZ, JP, PY, JL), pp. 2–8.
CADE-2007-CouchotL #automation #deduction #morphism: Handling Polymorphism in Automated Deduction (JFC, SL), pp. 263–278.
ICALP-v2-2006-Mogelberg #formal method #modelling #morphism #parametricity: Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism (REM), pp. 372–383.
Haskell-2006-Kagawa #haskell: Polymorphic variants in Haskell (KK), pp. 37–47.
ICFP-2006-NanevskiMB #hoare #morphism #type system: Polymorphism and separation in hoare type theory (AN, GM, LB), pp. 62–73.
POPL-2006-KimYC #multi #type system: A polymorphic modal type system for lisp-like multi-staged languages (ISK, KY, CC), pp. 257–268.
POPL-2006-Vouillon: Polymorphic regular tree types and patterns (JV), pp. 103–114.
PPDP-2006-NguyenO #compilation #layout #ml #morphism: Compiling ML polymorphism with explicit layout bitmap (HDN, AO), pp. 237–248.
PPDP-2006-SchrijversB #algebra #data type #re-engineering: Polymorphic algebraic data type reconstruction (TS, MB), pp. 85–96.
ICSE-2006-HeineL #detection #static analysis: Static detection of leaks in polymorphic containers (DLH, MSL), pp. 252–261.
ESOP-2006-FurrF #type inference: Polymorphic Type Inference for the JNI (MF, JSF), pp. 309–324.
ESOP-2006-SummersB #calculus #morphism: Approaches to Polymorphism in Classical Sequent Calculus (AJS, SvB), pp. 84–99.
LICS-2006-TerauchiA #on the #recursion: On Typability for Rank-2 Intersection Types with Polymorphic Recursion (TT, AA), pp. 111–122.
ITiCSE-2005-BerginWCGK #education #morphism: Teaching polymorphism early (JB, EW, MEC, MG, MK), pp. 342–343.
ICSM-2005-Demeyer #morphism #performance #question #what: Refactor Conditionals into Polymorphism: What’s the Performance Cost of Introducing Virtual Calls? (SD), pp. 627–630.
TLCA-2005-BartheGP #termination #type system: Practical Inference for Type-Based Termination in a Polymorphic Setting (GB, BG, FP), pp. 71–85.
TLCA-2005-Damiani #recursion: Rank-2 Intersection and Polymorphic Recursion (FD), pp. 146–161.
TLCA-2005-Fujita: Galois Embedding from Polymorphic Types into Existential Types (KeF), pp. 194–208.
Haskell-2005-Bird #string: Polymorphic string matching (RSB), pp. 110–115.
ICFP-2005-DantasWWW #aspect-oriented #functional #named #programming language: Poly_AML: a polymorphic aspect-oriented functional programming language (DSD, DW, GW, SW), pp. 306–319.
OOPSLA-2005-OanceaW #architecture #component #morphism #parametricity: Parametric polymorphism for software component architectures (CEO, SMW), pp. 147–166.
POPL-2005-AnconaDDZ #bytecode #compilation #composition #java: Polymorphic bytecode: compositional compilation for Java-like languages (DA, FD, SD, EZ), pp. 26–37.
POPL-2005-HosoyaFC #morphism #parametricity #xml: Parametric polymorphism for XML (HH, AF, GC), pp. 50–62.
WRLA-2004-LiquoriW05 #calculus #type checking #type inference: The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference] (LL, BW), pp. 89–111.
ESOP-2005-MakholmW #calculus #mobile #process #reduction #type system: Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close (HM, JBW), pp. 389–407.
ESOP-2005-SecoC #component #type system: Subtyping First-Class Polymorphic Components (JCS, LC), pp. 342–356.
FoSSaCS-2005-JeffreyR #abstraction #π-calculus: Full Abstraction for Polymorphic π-Calculus (AJ, JR), pp. 266–281.
CSL-2005-CollinsonPR #morphism #on the: On Bunched Polymorphism (MC, DJP, ER), pp. 36–50.
LICS-2005-MelliesV #framework #parametricity #recursion: Recursive Polymorphic Types and Parametricity in an Operational Framework (PAM, JV), pp. 82–91.
ICEIS-v3-2004-Mirbel #development #information management #process #scalability: A Polymorphic Context Frame to Support Scalability and Evolvability of Information System Development Processes (IM), pp. 131–138.
PADL-2004-Hudak #algebra: An Algebraic Theory of Polymorphic Temporal Media (PH), pp. 1–15.
POPL-2004-PottierG: Polymorphic typed defunctionalization (FP, NG), pp. 89–98.
PPDP-2004-HondaY #composition #higher-order #logic: A compositional logic for polymorphic higher-order functions (KH, NY), pp. 191–202.
DATE-v2-2004-GoudarziHM #implementation #modelling #morphism #object-oriented: Overhead-Free Polymorphism in Network-on-Chip Implementation of Object-Oriented Models (MG, SH, AM), pp. 1380–1381.
ESOP-2004-Thielecke #call-by #continuation #morphism: Answer Type Polymorphism in Call-by-Name Continuation Passing (HT), pp. 279–293.
ICFP-2003-WashburnW #encoding #higher-order #morphism #parametricity #syntax: Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism (GW, SW), pp. 249–262.
IFL-2003-Choppella #equation #re-engineering #using: Polymorphic Type Reconstruction Using Type Equations (VC), pp. 53–68.
IFL-2003-VasconcelosH #equation #functional #higher-order #recursion #source code: Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs (PBV, KH), pp. 86–101.
ICSE-2003-RountevMR #analysis #java #morphism #testing: Fragment Class Analysis for Testing of Polymorphism in Java Software (AR, AM, BGR), pp. 210–220.
GPCE-2003-JarviWL #concept #morphism: Concept-Controlled Polymorphism (JJ, JW, AL), pp. 228–244.
FoSSaCS-2003-AbramskyJ #game studies #morphism #semantics: A Game Semantics for Generic Polymorphism (SA, RJ), pp. 1–22.
FLOPS-2002-Smaus #recursion: The Head Condition and Polymorphic Recursion (JGS), pp. 259–274.
ICFP-2002-NeubauerT #higher-order #morphism: Type classes with more higher-order polymorphism (MN, PT), pp. 179–190.
TOOLS-USA-2002-SoundarajanT #behaviour #testing: Testing Polymorphic Behavior (NS, BT), pp. 173–188.
LCTES-SCOPES-2002-HuKVISZ #morphism: Compiler-directed cache polymorphism (JSH, MTK, NV, MJI, HS, WZ), pp. 165–174.
ICLP-2002-CoqueryF #morphism #named #parametricity #type system: TCLP: Overloading, Subtyping and Parametric Polymorphism Made Practical for CLP (EC, FF), p. 480.
SCAM-2001-ByersK #morphism #parametricity #slicing: Static Slicing and Parametric Polymorphism (DB, MK), pp. 181–186.
TLCA-2001-AltenkirchC #λ-calculus: A Finitary Subsystem of the Polymorphic λ-Calculus (TA, TC), pp. 22–28.
TLCA-2001-MurawskiO #evolution #game studies #morphism: Evolving Games and Essential Nets for Affine Polymorphism (ASM, CHLO), pp. 360–375.
ECOOP-2001-Ernst #morphism #product line: Family Polymorphism (EE), pp. 303–326.
POPL-2001-RehofF #analysis #type system: Type-base flow analysis: from polymorphic subtyping to CFL-reachability (JR, MF), pp. 54–66.
PPDP-2001-RychlikowskiT #logic programming: Polymorphic Directional Types for Logic Programming (PR, TT), pp. 61–72.
SAC-2001-Viroli #implementation #java #morphism #parametricity #performance: Parametric polymorphism in Java: an efficient implementation for parametric methods (MV), pp. 610–619.
IFL-2000-GustavssonS #analysis #bound #morphism #type system: A Usage Analysis with Bounded Usage Polymorphism and Subtyping (JG, JS), pp. 140–157.
OOPSLA-2000-ViroliN #approach #java #morphism #parametricity: Parametric polymorphism in Java: an approach to translation based on reflective features (MV, AN), pp. 146–165.
AdaEurope-2000-LinM #morphism: (True) Polymorphism in SPARK2000 (TML, JAM), pp. 252–265.
SAS-2000-FosterFA #analysis #c #points-to: Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C (JSF, MF, AA), pp. 175–198.
ESOP-2000-AmtoftT: Faithful Translations between Polyvariant Flows and Polymorphic Types (TA, FAT), pp. 26–40.
CSL-2000-AbramskyL #ml: A Fully Complete PER Model for ML Polymorphic Types (SA, ML), pp. 140–155.
PODS-1999-BusscheW #algebra #relational #type inference: Type Inference in the Polymorphic Relational Algebra (JVdB, EW), pp. 80–90.
TLCA-1999-Fujita #call-by #morphism #λ-calculus #μ-calculus: Explicitly Typed λμ-Calculus for Polymorphism an Call-by-Value (KeF), pp. 162–176.
ICFP-1999-OhoriY #compilation #ml #morphism #rank #type inference: Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML (AO, NY), pp. 160–171.
OOPSLA-1999-RinatMS #morphism #object-oriented: Correspondence Polymorphism for Object-Oriented Languages (RR, MM, SFS), pp. 167–186.
TOOLS-USA-1999-AlexanderO #analysis #testing: Analysis Techniques for Testing Polymorphic Relationships (RTA, AJO), p. 104–?.
POPL-1999-WansbroughJ: Once Upon a Polymorphic Type (KW, SLPJ), pp. 15–28.
ICSE-1999-BenlarbiM #metric #morphism #predict #risk management: Polymorphism Measures for Early Risk Prediction (SB, WLM), pp. 334–344.
LICS-1999-BanerjeeHR #analysis #λ-calculus: Region Analysis and the Polymorphic λ Calculus (AB, NH, JGR), pp. 88–97.
ICFP-1998-CraryWM #morphism #semantics: Intensional Polymorphism in Type-Erasure Semantics (KC, SW, JGM), pp. 301–312.
ICFP-1998-Nordlander #type system: Pragmatic Subtyping in Polymorphic Languages (JN), pp. 216–227.
OOPSLA-1998-Litvinov #morphism #static typing #towards #type system: Contraint-Based Polymorphism in Cecil: Towards a Practical and Static Type System (VL), pp. 388–411.
OOPSLA-1998-SolorzanoA #java #morphism #parametricity: Parametric Polymorphism for Java: A Reflective Solution (JS, SA), pp. 216–225.
TOOLS-USA-1998-SoundarajanF #behaviour #reasoning: Reasoning About Polymorphic Behavior (NS, SF), p. 346–?.
POPL-1998-Jensen #strict: Inference of Polymorphic and Conditional Strictness Properties (TPJ), pp. 209–221.
POPL-1998-Schubert #higher-order #morphism #type inference #unification: Second-Order Unification and Type Inference for Church-Style Polymorphism (AS), pp. 279–288.
SAS-1998-Duggan #finite #morphism #type inference #type system: Finite Subtype Inference with Explicit Polymorphism (DD), pp. 295–310.
HCI-CC-1997-SavidisSE #design #incremental #interface #physics: Abstract Task Definition and Incremental Polymorphic Physical Instantiation: The Unified Interface Design Method (AS, CS, PLE), pp. 465–468.
TOOLS-ASIA-1997-PengCC #analysis #morphism #multi #performance: The Implement Mechanism and Efficiency Analysis of Multiinheritance and Polymorphism (RP, JC, SC), pp. 389–392.
TOOLS-ASIA-1997-StobartPT #case study #object-oriented #source code #testing #using: Using Extended General Statecharts to Generate Test Cases for Overloaded/Polymorphic Object-Oriented Programs: A Case Study (SS, NP, BYT), pp. 96–103.
TOOLS-PACIFIC-1997-NayaNYHOA #development #execution #morphism #object-oriented #optimisation: Object-Oriented Development Based on Polymorphism Patterns and Optimization to Reduce Executable Code Size (HN, FN, TY, LH, KO, MA), pp. 68–79.
PEPM-1997-Sheard #online: A Type-directed, On-line, Partial Evaluator for a Polymorphic Language (TS), pp. 22–35.
POPL-1997-BourdoncleM #higher-order #multi: Type-Checking Higher-Order Polymorphic Multi-Methods (FB, SM), pp. 302–315.
POPL-1997-Jones #morphism #type inference: First-class Polymorphism with Type Inference (MPJ), pp. 483–496.
POPL-1997-PierceS #behaviour #equivalence #π-calculus: Behavioral Equivalence in the Polymorphic π-calculus (BCP, DS), pp. 242–255.
ICSE-1997-TonellaAFM #analysis #c++ #morphism #pointer #slicing: Flow Insensitive C++ Pointers and Polymorphism Analysis and its Application to Slicing (PT, GA, RF, EM), pp. 433–443.
TACAS-1997-BeeckBCDFKMSS #graph #morphism #power of: Graphs in METAFrame: The Unifying Power of Polymorphism (MvdB, VB, AC, AD, CF, DK, TMS, FS, BS), pp. 112–129.
TAPSOFT-1997-Arenas-SanchezR #algebra #framework #functional #logic programming #semantics: A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 453–464.
ILPS-1997-Arenas-SanchezR #algebra #calculus #functional #lazy evaluation #logic programming: A Lazy Narrowing Calculus for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 53–67.
ICALP-1996-MitchellV #effectiveness #modelling #morphism #recursion #type system: Effective Models of Polymorphism, Subtyping and Recursion (JCM, RV), pp. 170–181.
ICPR-1996-BurgeBM #component #learning #recognition: Recognition and learning with polymorphic structural components (MB, WB, WM), pp. 19–23.
ECOOP-1996-RinatM #morphism #reuse: Metaphoric Polymorphism: Taking Code Reuse One Step Further (RR, MM), pp. 449–471.
ALP-1996-Almendros-JimenezGG #algebra #functional #logic programming #order #semantics: Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types (JMAJ, AGF, AGL), pp. 299–313.
ALP-1996-Nazareth96a #semantics #specification: The Semantic Treatment of Polymorphic Specification Languages (DN), pp. 330–344.
PLILP-1996-LouvetR #morphism #parametricity #prolog: Parametric Polymorphism for Typed Prolog and λ-Prolog (PL, OR), pp. 47–61.
ESOP-1996-SmithV #c #towards #type system: Towards an ML-Style Polymorphic Type System for C (GS, DMV), pp. 341–355.
STOC-1996-BonetPWY: Constructing Evolutionary Trees in the Presence of Polymorphic Characters (MLB, CAP, TW, SY), pp. 220–229.
LICS-1996-AltenkirchHS #normalisation: Reduction-Free Normalisation for a Polymorphic System (TA, MH, TS), pp. 98–106.
TLCA-1995-BellucciAC #morphism #parametricity: A Model for Formal Parametric Polymorphism: A PER Interpretation for System R (RB, MA, PLC), pp. 32–46.
TLCA-1995-CosmoP #morphism: Expanding Extensional Polymorphism (RDC, AP), pp. 139–153.
AFP-1995-Jones95 #functional #higher-order #morphism #programming: Functional Programming with Overloading and Higher-Order Polymorphism (MPJ), pp. 97–136.
FPCA-1995-HengleinR #ml #type inference: Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML (FH, JR), pp. 192–203.
FPCA-1995-Rittri #recursion: Dimension Inference Under Polymorphic Recursion (MR), pp. 147–159.
FPCA-1995-Thiemann #revisited #type system: Unboxed Values and Polymorphic Typing Revisited (PT), pp. 24–35.
ECOOP-1995-Agesen #algorithm #morphism #parametricity #precise #type inference: The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism (OA), pp. 2–26.
ECOOP-1995-BruceSG #named #object-oriented #type safety: PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language (KBB, AS, RvG), pp. 27–51.
OOPSLA-1995-DayGLM #morphism #parametricity #type system: Subtypes vs. Where Clauses: Constraining Parametric Polymorphism (MD, RG, BL, ACM), pp. 156–168.
OOPSLA-1995-EifrigST #type inference: Sound Polymorphic Type Inference for Objects (JE, SFS, VT), pp. 169–184.
PLILP-1995-SaglamG #approximate #constraints #logic programming #source code #using: Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions (HS, JPG), pp. 461–462.
POPL-1995-DuboisRW #morphism: Generic Polymorphism (CD, FR, PW), pp. 118–129.
POPL-1995-HarperM #analysis #compilation #morphism #using: Compiling Polymorphism Using Intensional Type Analysis (RH, JGM), pp. 130–141.
SAS-1995-DussartHM #analysis #polynomial #recursion #type system: Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time (DD, FH, CM), pp. 118–135.
SAS-1995-Seward #analysis #haskell #implementation #prototype: Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell (JS), pp. 382–399.
ICLP-1995-Beierle #logic programming #order #source code: Type Inferencing for Polymorphic Order-Sorted Logic Programs (CB), pp. 765–779.
PODS-1994-OhoriT #calculus: A Polymorphic Calculus for Views and Object Sharing (AO, KT), pp. 255–266.
POPL-1994-GarrigueA #λ-calculus: The Typed Polymorphic Label-Selective λ-Calculus (JG, HAK), pp. 35–47.
SAS-1994-Agesen #constraints #morphism #parametricity #type inference: Constraint-Based Type Inference and Parametric Polymorphism (OA), pp. 78–100.
SAS-1994-CodishD #dependence #logic programming #multi #source code #using: Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop (MC, BD), pp. 281–296.
SAC-1994-StansiferW #morphism #re-engineering: Type reconstruction for coercion polymorphism (RS, DW), pp. 420–424.
ESOP-1994-Boerio #higher-order #λ-calculus: Extending Pruning Techniques to Polymorphic Second order λ-Calculus (LB), pp. 120–134.
ESOP-1994-HengleinM #analysis: Polymorphic Binding-Time Analysis (FH, CM), pp. 287–301.
ESOP-1994-JayC #morphism: Shapely Types and Shape Polymorphism (CBJ, JRBC), pp. 302–316.
ESOP-1994-Kahrs #ml #morphism: First-Class Polymorphism for ML (SK), pp. 333–347.
ESOP-1994-OHearnR #morphism #parametricity: Fully Abstract Translations and Parametric Polymorphism (PWO, JGR), pp. 454–468.
ICLP-1994-CairesM #higher-order #logic programming #unification: Higher-Order Polymorphic Unification for Logic Programming (LC, LM), pp. 419–433.
ILPS-1994-Brisset #logic programming #programming language #type checking: Avoiding Dynamic Type Checking in a Polymorphic Logic Programming Language (PB), p. 674.
LICS-1994-RobinsonR #graph #morphism #parametricity #reflexive: Reflexive Graphs and Parametric Polymorphism (EPR, GR), pp. 364–371.
TLCA-1993-Pierce #bound #morphism: Intersection Types and Bounded Polymorphism (BCP), pp. 346–360.
TLCA-1993-PlotkinA #logic #morphism #parametricity: A Logic for Parametric Polymorphism (GDP, MA), pp. 361–375.
FPCA-1993-AdityaC #re-engineering: Compiler-directed Type Reconstruction for Polymorphic Languages (SA, AC), pp. 74–82.
FPCA-1993-Jones #higher-order #morphism: A System of Constructor Classes: Overloading and Implicit Higher-Order Polymorphism (MPJ), pp. 52–64.
TOOLS-PACIFIC-1993-DongD #morphism: Class Union and Polymorphism (JSD, RD), pp. 181–190.
PEPM-1993-Seward #analysis #strict #using: Polymorphic Strictness Analysis using Frontiers (JS), pp. 186–193.
POPL-1993-AbadiCC #morphism #parametricity: Formal Parametric Polymorphism (MA, LC, PLC), pp. 157–170.
POPL-1993-HarperL #continuation #morphism: Explicit Polymorphism and CPS Conversion (RH, ML), pp. 206–219.
POPL-1993-Leroy #continuation #morphism: Polymorphism by Name for References and Continuations (XL), pp. 220–231.
POPL-1993-OhoriK #communication #semantics: Semantics for Communication Primitives in an Polymorphic Language (AO, KK), pp. 99–112.
POPL-1993-Reynolds #logic #morphism #parametricity #tutorial: An Introduction to Logical Relations and Parametric Polymorphism — Tutorial (JCR), pp. 155–156.
WSA-1993-Monsuez: Polymorphic Types and Widening Operators (BM), pp. 267–281.
TAPSOFT-1993-Smith #type inference #type system: Polymorphic Type Inference with Overloading and Subtyping (GS), pp. 671–685.
LFP-1992-GoldbergG #garbage collection #re-engineering: Polymorphic Type Reconstruction for Garbage Collection Without Tags (BG, MG), pp. 53–65.
TOOLS-USA-1992-Alagic92a: Associated paper: Polymorphic and Reflective Type Structures (SA), p. 297.
POPL-1992-BruceM #higher-order #modelling #morphism #recursion #type system: PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism (KBB, JCM), pp. 316–327.
POPL-1992-Leroy #type system: Unboxed Objects and Polymorphic Typing (XL), pp. 177–188.
POPL-1992-Ohori #calculus #compilation: A Compilation Method for ML-Style Polymorphic Record Calculi (AO), pp. 154–165.
FPCA-1991-AdityaN #incremental #morphism: Incremental Polymorphism (SA, RSN), pp. 379–405.
FPCA-1991-Baraki #abstract interpretation: A Note on Abstract Interpretation of Polymorphic Functions (GB), pp. 367–378.
ECOOP-1991-HolzleCU #dynamic typing #object-oriented #optimisation: Optimizing Dynamically-Typed Object-Oriented Languages With Polymorphic Inline Caches (UH, CC, DU), pp. 21–38.
PEPM-1991-MichaylovP #compilation #λ-calculus: Compiling the Polymorphic λ-Calculus (SM, FP), pp. 285–296.
PEPM-1991-NielBV #functional: Program Bifurcation for a Polymorphic Typed Functional Language (ADN, EB, KDV), pp. 142–153.
POPL-1991-AbramskyJ #analysis #approach #higher-order #relational #strict: A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions (SA, TPJ), pp. 49–54.
POPL-1991-LeroyW #type inference: Polymorphic Type Inference and Assignment (XL, PW), pp. 291–302.
WSA-1991-DornicJG #complexity: Polymorphic Time Systems for Estimating Program Complexity (VD, PJ, DKG), pp. 9–17.
WSA-1991-Monsuez #abstract interpretation: An Attempt to Find Polymorphic Types by Abstract Interpretation (BM), pp. 18–25.
WSA-1991-TalpinJ: Polymorphic Type, Region and Effect Inference (JPT, PJ), pp. 26–32.
ISLP-1991-BeierleMS #automaton #order: Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution (CB, GM, HS), pp. 272–286.
LICS-1991-KiferW #first-order #logic programming #morphism: A First-Order Theory of Types and Polymorphism in Logic Programming (MK, JW), pp. 310–321.
ICALP-1990-Malecki: Generic Terms Having No Polymorphic Types (SM), pp. 46–59.
LFP-1990-Leivant #morphism: Discrete Polymorphism (DL), pp. 288–297.
PLILP-1990-Leroy #data transformation #performance #representation: Efficient Data Representation in Polymorphic Languages (XL), pp. 255–276.
LICS-1990-AbadiP #morphism #recursion: A Per Model of Polymorphism and Recursive Types (MA, GDP), pp. 355–365.
LICS-1990-GuzmanH #thread #λ-calculus: Single-Threaded Polymorphic λ Calculus (JCG, PH), pp. 333–343.
LICS-1990-KfouryT #re-engineering #λ-calculus: Type Reconstruction in Finite-Rank Fragments of the Polymorphic λ-Calculus (AJK, JT), pp. 2–11.
LICS-1990-RobinsonR #call-by #morphism #set: Polymorphism, Set Theory, and Call-by-Value (ER, GR), pp. 12–18.
SIGMOD-1989-OhoriBT #database #programming #static typing #type inference: Database Programming in Machiavelli — a Polymorphic Language with Static Type Inference (AO, PB, VT), pp. 46–57.
ICALP-1989-TannenG #algebra #confluence #normalisation: Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence (VT, JHG), pp. 137–150.
FPCA-1989-CanningCHOM #bound #morphism #object-oriented #programming: F-Bounded Polymorphism for Object-Oriented Programming (PSC, WRC, WLH, WGO, JCM), pp. 273–280.
FPCA-1989-Ohori #ml #morphism #semantics: A Simple Semantics for ML Polymorphism (AO), pp. 281–292.
FPCA-1989-RuncimanT #component: Retrieving Re-Usable Software Components by Polymorphic Type (CR, IT), pp. 166–173.
PLDI-1989-OTooleG #re-engineering: Type Reconstruction with First-Class Polymorphic Values (JO, DKG), pp. 207–217.
POPL-1989-KanellakisM #ml #type system #unification: Polymorphic Unification and ML Typing (PCK, JCM), pp. 105–115.
POPL-1989-Meseguer #modelling #morphism: Relating Models of Polymorphism (JM), pp. 228–241.
POPL-1989-WadlerB #ad hoc #how #morphism: How to Make ad-hoc Polymorphism Less ad-hoc (PW, SB), pp. 60–76.
CCIPL-1989-FuhM #type inference #type system: Polymorphic Subtype Inference: Closing the Theory-Practice Gap (YCF, PM), pp. 167–183.
CCIPL-1989-Hanus #horn clause #semantics #source code: Horn Clause Programs with Polymorphic Types: Semantics and Resolution (MH), pp. 225–240.
CCIPL-1989-HarperP #ambiguity #calculus #morphism #type checking: Type Checking, Universe Polymorphism, and Typical Ambiguity in the Calculus of Constructions (Draft) (RH, RP), pp. 241–256.
CCIPL-1989-PfenningL #morphism #named: LEAP: A Language with Eval And Polymorphism (FP, PL), pp. 345–359.
CSL-1989-Leiss #recursion: Polymorphic Recursion and Semi-Unification (HL), pp. 211–224.
LICS-1989-AbadiPP #modelling #recursion: Faithful Ideal Models for Recursive Polymorphic Types (MA, BCP, GDP), pp. 216–225.
LICS-1989-Leivant #morphism: Stratified Polymorphism (DL), pp. 39–47.
LICS-1989-Pitts #type system: Non-trivial Power Types Can’t Be Subtypes of Polymorphic Types (AMP), pp. 6–13.
NACLP-1989-PyoR #logic programming #source code: Inference of Polymorphic Types for Logic Programs (CP, USR), pp. 1115–1132.
VDME-1988-BorzyszkowskiKS #formal method #λ-calculus: A Set-Theoretic Model for a Typed Polymorphic λ Calculus — A Contribution to MetaSoft (AMB, RK, SS), pp. 267–298.
LFP-1988-Pfenning #higher-order #type inference #unification: Partial Polymorphic Type Inference and Higher-Order Unification (FP), pp. 153–163.
POPL-1988-LucassenG: Polymorphic Effect Systems (JML, DKG), pp. 47–57.
ESOP-1988-DietrichH #prolog #type system: A Polymorphic Type System with Subtypes for Prolog (RD, FH), pp. 79–93.
ESOP-1988-Kaes #parametricity #programming language: Parametric Overloading in Polymorphic Programming Languages (SK), pp. 131–144.
JICSCP-1988-Emden88 #type inference: Conditional Answers for Polymorphic Type Inference (MHvE), pp. 590–603.
LICS-1988-FreydGSS #parametricity #semantics #λ-calculus: Semantic Parametricity in Polymorphic λ Calculus (PJF, JYG, AS, PJS), pp. 274–279.
LICS-1988-GianniniR: Characterization of typings in polymorphic type discipline (PG, SRDR), pp. 61–70.
LICS-1988-KfouryTU #on the #power of #recursion: On the Computational Power of Universally Polymorphic Recursion (AJK, JT, PU), pp. 72–81.
FPCA-1987-ToynDR #morphism #performance: Performance polymorphism (IT, AJD, CR), pp. 325–346.
POPL-1987-MeyerMMS #λ-calculus: Empty Types in Polymorphic λ Calculus (ARM, JCM, EM, RS), pp. 253–262.
CFLP-1987-TannenC #modelling #morphism: Extensional Models for Polymorphism (VT, TC), pp. 291–307.
ICLP-1987-Zobel87 #prolog #source code: Derivation of Polymorphic Types for PROLOG Programs (JZ), pp. 817–838.
LICS-1987-Breazu-TannenM #morphism: Polymorphism is conservative over simple types (VT, ARM), pp. 7–17.
LICS-1987-FreydS #aspect-oriented #semantics #λ-calculus: Some Semantic Aspects of Polymorphic λ Calculus (PJF, AS), pp. 315–319.
LFP-1986-Mitchell #approach #reduction #semantics: A Type-Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions (JCM), pp. 308–319.
OOPSLA-1986-Ingalls #morphism #multi: A Simple Technique for Handling Multiple Polymorphism (DHHI), pp. 347–349.
FPCA-1985-Nikhil85 #morphism: Practical Polymorphism (RSN), pp. 319–333.
FPCA-1985-Turner85 #functional #named #strict: Miranda: A Non-Strict Functional language with Polymorphic Types (DAT), pp. 1–16.
POPL-1984-MacQueenPS #recursion: An Ideal Model for Recursive Polymorphic Types (DBM, GDP, RS), pp. 165–174.
POPL-1984-Wand #morphism #semantics: A Types-as-Sets Semantics for Milner-Style Polymorphism (MW), pp. 158–164.
POPL-1983-LampsonS #using: Practical Use of a Polymorphic Applicative Language (BWL, EES), pp. 237–255.
POPL-1983-Leivant #type inference: Polymorphic Type Inference (DL), pp. 88–98.
POPL-1983-Leivant83a #data type #semantics: Structural Semantics for Polymorphic Data Types (DL), pp. 155–166.
POPL-1983-Meertens #incremental #type checking: Incremental Polymorphic Type Checking in B (LGLTM), pp. 265–275.
STOC-1981-Leivant #complexity #independence #parametricity #programming language #theorem: The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories) (DL), pp. 38–45.
POPL-1978-DemersDS #data type #encapsulation #morphism: Data Types as Values: Polymorphism, Type-Checking, Encapsulation (AJD, JED, GS), pp. 23–30.