Stem type$ (all stems)

2219 papers:

CASE-2015-ToneS

Deforming control for object transportation with ferrofluid-based sheet-type soft robot (TT, KS), pp. 1171–1176.

DAC-2015-DingCM #self

Detailed routing for spacer-is-metal type self-aligned double/quadruple patterning lithography (YD, CCNC, WKM), p. 6.

ITiCSE-2015-AhadiPBL #query #sql

A Quantitative Study of the Relative Difficulty for Novices of Writing Seven Different Types of SQL Queries (AA, JCP, VB, RL), pp. 201–206.

ESOP-2015-ChengR #detection #spreadsheet #static analysis

Static Analysis of Spreadsheet Applications for Type-Unsafe Operations Detection (TC, XR), pp. 26–52.

ESOP-2015-Chugh #named #recursion #self #type system

IsoLATE: A Type System for Self-recursion (RC), pp. 257–282.

ESOP-2015-CicekGA #complexity #incremental #refinement

Refinement Types for Incremental Computational Complexity (EÇ, DG, UAA), pp. 406–431.

ESOP-2015-FetscherCPHF #automation #generative #random #type system

Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System (BF, KC, MHP, JH, RBF), pp. 383–405.

ESOP-2015-GotsmanY #data type

Composite Replicated Data Types (AG, HY), pp. 585–609.

ESOP-2015-Ricciotti #data type

Binding Structures as an Abstract Data Type (WR), pp. 762–786.

ESOP-2015-SeidelVJ #testing

Type Targeted Testing (ELS, NV, RJ), pp. 812–836.

ESOP-2015-SiekVCTG #performance #type system

Monotonic References for Efficient Gradual Typing (JGS, MMV, MC, STH, RG), pp. 432–456.

ESOP-2015-VasconcelosJFH #analysis #functional #lazy evaluation #recursion #type system

Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages (PBV, SJ, MF, KH), pp. 787–811.

FASE-2015-AndriescuMI #automaton #data type #using

Composing Message Translators and Inferring Their Data Types Using Tree Automata (EA, TM, VI), pp. 35–50.

FoSSaCS-2015-CloustonBGB #induction #programming #reasoning #recursion

Programming and Reasoning with Guarded Recursion for Coinductive Types (RC, AB, HBG, LB), pp. 407–421.

FoSSaCS-2015-PfenningG

Polarized Substructural Session Types (FP, DG), pp. 3–22.

FoSSaCS-2015-SalvatiW #type system

Typing Weak MSOL Properties (SS, IW), pp. 343–357.

ICSME-2015-MondalRS #case study #comparative

A comparative study on the bug-proneness of different types of code clones (MM, CKR, KAS), pp. 91–100.

SCAM-2015-LemosPSL #code search #query #question #scalability

Can the use of types and query expansion help improve large-scale code search? (OALL, ACdP, HS, CVL), pp. 41–50.

PEPM-2015-HoekH #analysis #php

Object-sensitive Type Analysis of PHP (HEVdH, JH), pp. 9–20.

PEPM-2015-KootH #analysis #exception #functional #higher-order #semantics #strict #type system

Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics (RK, JH), pp. 127–138.

PEPM-2015-LiWXH #adaptation #api #java #named #towards #type safety

SWIN: Towards Type-Safe Java Program Adaptation between APIs (JL, CW, YX, ZH), pp. 91–102.

PEPM-2015-PoulsenMT #abstract interpretation #imperative #morphism #polymorphism

Imperative Polymorphism by Store-Based Types as Abstract Interpretations (CBP, PDM, PT), pp. 3–8.

PLDI-2015-OseraZ #synthesis

Type-and-example-directed program synthesis (PMO, SZ), pp. 619–630.

PLDI-2015-ZhangMVJ #fault

Diagnosing type errors with class (DZ, ACM, DV, SLPJ), pp. 12–21.

SAS-2015-ChoiCNS #javascript #layout #named #type system

SJS: A Type System for JavaScript with Fixed Object Layout (WC, SC, GCN, KS), pp. 181–198.

SAS-2015-HashimotoU #constraints #optimisation #refinement #type inference

Refinement Type Inference via Horn Constraint Optimization (KH, HU), pp. 199–216.

DLT-2015-BealH #finite

Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (MPB, PH), pp. 167–178.

ICALP-v2-2015-AbramskyJV #dependent type #game studies

Games for Dependent Types (SA, RJ, MV), pp. 31–43.

ICALP-v2-2015-MazzaT

Parsimonious Types and Non-uniform Computation (DM, KT), pp. 350–361.

LATA-2015-Zinoviadis #2d #finite

Hierarchy and Expansiveness in 2D Subshifts of Finite Type (CZ), pp. 365–377.

FM-2015-SchmittU #axiom #first-order #logic

Axiomatization of Typed First-Order Logic (PHS, MU), pp. 470–486.

SFM-2015-CoppoDPY #multi

A Gentle Introduction to Multiparty Asynchronous Session Types (MC, MDC, LP, NY), pp. 146–178.

ICFP-2015-BuirasVR #data flow #dynamic typing #haskell #named #type system

HLIO: mixing static and dynamic typing for information-flow control in Haskell (PB, DV, AR), pp. 289–301.

ICFP-2015-DannerLR #functional #induction #semantics

Denotational cost semantics for functional languages with inductive types (ND, DRL, R), pp. 140–151.

ICFP-2015-GenevesG #problem #static typing #type system #xquery

XQuery and static typing: tackling the problem of backward axes (PG, NG), pp. 88–100.

ICFP-2015-Pavlinovic0W #fault #locality #smt

Practical SMT-based type error localization (ZP, TK, TW), pp. 412–423.

ICFP-2015-SchererR #question

Which simple types have a unique inhabitant? (GS, DR), pp. 243–255.

ICFP-2015-VazouBJ #bound #refinement

Bounded refinement types (NV, AB, RJ), pp. 48–61.

ICFP-2015-ZhuNJ #learning #refinement

Learning refinement types (HZ, AVN, SJ), pp. 400–411.

GaM-2015-Moreau #graph

Aggregation by Provenance Types: A Technique for Summarising Provenance Graphs (LM), pp. 129–144.

ICGT-2015-Bruggink0NZ #graph #graph transformation #proving #termination #using

Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings (HJSB, BK, DN, HZ), pp. 52–68.

CHI-2015-FowlerPCBOZ #modelling #performance #personalisation #type system

Effects of Language Modeling and its Personalization on Touchscreen Typing Performance (AF, KP, CC, XB, TO, SZ), pp. 649–658.

CHI-2015-SmithBZ #gesture #optimisation #type system

Optimizing Touchscreen Keyboards for Gesture Typing (BAS, XB, SZ), pp. 3365–3374.

DUXU-DD-2015-TarkkanenHR #analysis #problem #testing #usability

Are We Testing Utility? Analysis of Usability Problem Types (KT, VH, PR), pp. 269–280.

HCI-IT-2015-MeleMR #communication #predict #type system #user interface

Beyond Direct Gaze Typing: A Predictive Graphic User Interface for Writing and Communicating by Gaze (MLM, DM, CER), pp. 66–77.

HCI-IT-2015-SatoAOO #analysis #automation #classification #image

Automatic Classification Between Involuntary and Two Types of Voluntary Blinks Based on an Image Analysis (HS, KA, SO, MO), pp. 140–149.

HIMI-IKC-2015-GotzeB #comparison #what

Urban Driving: Where to Present What Types of Information — Comparison of Head-Down and Head-Up Displays (MG, KB), pp. 190–200.

ICEIS-v1-2015-Castanon-PugaSG #algorithm #data mining #fuzzy #logic #mining #mobile #using

Hybrid-Intelligent Mobile Indoor Location Using Wi-Fi Signals — Location Method Using Data Mining Algorithms and Type-2 Fuzzy Logic Systems (MCP, ASC, CGP, GLS, MFP, EAT), pp. 609–615.

KDD-2015-RenEWH #approach #automation #corpus #mining #network #recognition #type system

Automatic Entity Recognition and Typing from Massive Text Corpora: A Phrase and Network Mining Approach (XR, AEK, CW, JH), pp. 2319–2320.

KDD-2015-RenEWTVH #clustering #effectiveness #named #recognition #type system

ClusType: Effective Entity Recognition and Typing by Relation Phrase-Based Clustering (XR, AEK, CW, FT, CRV, JH), pp. 995–1004.

SIGIR-2015-BastBH

Relevance Scores for Triples from Type-Like Relations (HB, BB, EH), pp. 243–252.

ECMFA-2015-ZolotasMDKP #flexibility #modelling #type inference

Type Inference in Flexible Model-Driven Engineering (AZ, NDM, SD, DSK, RFP), pp. 75–91.

MoDELS-2015-LaraGC #modelling #type system

A-posteriori typing for Model-Driven Engineering (JdL, EG, JSC), pp. 156–165.

MoDELS-2015-SzvetitsZ #modelling #reuse #runtime

Reusable event types for models at runtime to support the examination of runtime phenomena (MS, UZ), pp. 4–13.

ECOOP-2015-Chevalier-Boisvert #effectiveness #lazy evaluation #version control

Simple and Effective Type Check Removal through Lazy Basic Block Versioning (MCB, MF), pp. 101–123.

ECOOP-2015-HaqueP #type inference

Type Inference for Place-Oblivious Objects (RH, JP), pp. 371–395.

ECOOP-2015-JonesHN #type system

Brand Objects for Nominal Typing (TJ, MH, JN), pp. 198–221.

ECOOP-2015-KloosMV

Asynchronous Liquid Separation Types (JK, RM, VV), pp. 396–420.

ECOOP-2015-PradelS #empirical #javascript

The Good, the Bad, and the Ugly: An Empirical Study of Implicit Type Conversions in JavaScript (MP, KS), pp. 519–541.

ECOOP-2015-RichardsNV #typescript

Concrete Types for TypeScript (GR, FZN, JV), pp. 76–100.

ECOOP-2015-TakikawaFDFFTF #towards #type system

Towards Practical Gradual Typing (AT, DF, ED, MF, RBF, STH, MF), pp. 4–27.

ECOOP-2015-VekrisCJ #trust #type system #verification

Trust, but Verify: Two-Phase Typing for Dynamic Languages (PV, BC, RJ), pp. 52–75.

Onward-2015-GreweEWM #performance #proving #type system

Type systems for the masses: deriving soundness proofs and efficient checkers (SG, SE, PW, MM), pp. 137–150.

Onward-2015-Petricek

Against a universal definition of “Type” (TP), pp. 254–266.

OOPSLA-2015-BostonSGC #approximate #flexibility #probability #programming #type inference

Probability type inference for flexible approximate programming (BB, AS, DG, LC), pp. 470–487.

OOPSLA-2015-ErdwegBKKM #incremental #type checking

A co-contextual formulation of type rules and its application to incremental type checking (SE, OB, EK, MK, MM), pp. 880–897.

GPCE-2015-ReyndersDP #api #bound #generative

Generating safe boundary APIs between typed EDSLs and their environments (BR, DD, FP), pp. 31–34.

PPDP-2015-Tarau #combinator #on the #representation

On a uniform representation of combinators, arithmetic, λ terms and types (PT), pp. 244–255.

PADL-2015-Tarau #combinator #generative #logic programming #normalisation #on the #type inference

On Logic Programming Representations of λ Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization (PT), pp. 115–131.

POPL-2015-BartheGAHRS #approximate #design #difference #higher-order #privacy #refinement #relational

Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy (GB, MG, EJGA, JH, AR, PYS), pp. 55–68.

POPL-2015-Castagna0XA #polymorphism #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.

POPL-2015-DelawarePGC #data type #deduction #named #proving #synthesis

Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant (BD, CPC, JG, AC), pp. 689–700.

POPL-2015-GarciaC #source code

Principal Type Schemes for Gradual Programs (RG, MC), pp. 303–315.

POPL-2015-KrishnaswamiPB #dependent type #linear

Integrating Linear and Dependent Types (NRK, PP, NB), pp. 17–30.

POPL-2015-LourencoC #data flow

Dependent Information Flow Types (LL, LC), pp. 317–328.

POPL-2015-MelliesZ #refinement

Functors are Type Refinement Systems (PAM, NZ), pp. 3–16.

POPL-2015-RastogiSFBV #performance #type system #typescript

Safe & Efficient Gradual Typing for TypeScript (AR, NS, CF, GMB, PV), pp. 167–180.

POPL-2015-Sojakova #algebra #induction

Higher Inductive Types as Homotopy-Initial Algebras (KS), pp. 31–42.

SAC-2015-ElyasovPHRVC #equivalence #execution #testing

AB=ᗺA: execution equivalence as a new type of testing oracle (AE, WP, JH, UR, TEJV, NCF), pp. 1559–1566.

SAC-2015-LopezR #analysis #metaprogramming

Meta-programming with well-typed code analysis (ML, GDR), pp. 2119–2121.

SAC-2015-OmarWA #composition #metaprogramming #syntax

Composable and hygienic typed syntax macros (CO, CW, JA), pp. 1986–1991.

ICSE-v1-2015-PetrosyanRM #api #classification #information management #using

Discovering Information Explaining API Types Using Text Classification (GP, MPR, RDM), pp. 869–879.

ICSE-v1-2015-PradelSS #analysis #consistency #javascript #named #nondeterminism

TypeDevil: Dynamic Type Inconsistency Analysis for JavaScript (MP, PS, KS), pp. 314–324.

ICSE-v1-2015-VakilianPEJ #named

Cascade: A Universal Programmer-Assisted Type Qualifier Inference Tool (MV, AP, MDE, REJ), pp. 234–245.

SPLC-2015-DudderRH #composition #design #staged #type safety #using

Synthesizing type-safe compositions in feature oriented software designs using staged composition (BD, JR, GTH), pp. 398–401.

CC-2015-NgCY #code generation #protocol

Protocols by Default — Safe MPI Code Generation Based on Session Types (NN, JGdFC, NY), pp. 212–232.

CAV-2015-ReinkingP #approach #program repair

A Type-Directed Approach to Program Repair (AR, RP), pp. 511–517.

CSL-2015-Mazza

Simple Parsimonious Types and Logarithmic Space (DM), pp. 24–40.

ICLP-2015-Tarau #generative #on the

On Type-directed Generation of λ Terms (PT).

LICS-2015-DisneyF #game studies #semantics

Game Semantics for Type Soundness (TD, CF), pp. 104–114.

RTA-2015-LepperW #performance #towards

A Simple and Efficient Step Towards Type-Correct XSLT Transformations (ML, BTyW), pp. 350–364.

TLCA-2015-AhrensCS #type system

Non-Wellfounded Trees in Homotopy Type Theory (BA, PC, RS), pp. 17–30.

TLCA-2015-BessaiDDCdR #composition #mixin #synthesis

Mixin Composition Synthesis Based on Intersection Types (JB, AD, BD, TCC, Ud, JR), pp. 76–91.

TLCA-2015-FairweatherFST #dependent type

Dependent Types for Nominal Terms with Atom Substitutions (EF, MF, NS, AT), pp. 180–195.

TLCA-2015-HirschowitzHT #type system

Wild ω-Categories for the Homotopy Hypothesis in Type Theory (AH, TH, NT), pp. 226–240.

TLCA-2015-JouannaudL #termination

Termination of Dependently Typed Rewrite Rules (JPJ, JL), pp. 257–272.

TLCA-2015-WangC #independence #type system

A Proof-theoretic Characterization of Independence in Type Theory (YW, KC), pp. 332–346.

VMCAI-2015-MukundRS #bound #data type #implementation

Bounded Implementations of Replicated Data Types (MM, GSR, SPS), pp. 355–372.

VMCAI-2015-ZhuNJ #array #testing #type inference

Dependent Array Type Inference from Tests (HZ, AVN, SJ), pp. 412–430.

ASE-2014-PruijtKWB #architecture #named #set

HUSACCT: architecture compliance checking with rich sets of module and rule types (LJP, CK, JMvdW, SB), pp. 851–854.

CASE-2014-JinNHXC #policy

Threshold-type admission policy for remanufacturing systems (XJ, JN, SJH, GX, QC), pp. 467–473.

CASE-2014-ToneVS

Sheet type soft robot with magnetic fluid for object transportation (TT, FV, KS), pp. 852–857.

CASE-2014-WuBZ #approach #linear #scheduling

Linear programming-based approach to scheduling of crude oil operations in refinery with oil type mixing requirement (NW, LB, MZ), pp. 430–435.

VLDB-2014-ZhengBST #fuzzy #named

MESA: A Map Service to Support Fuzzy Type-ahead Search over Geo-Textual Data (YZ, ZB, LS, AKHT), pp. 1545–1548.

ITiCSE-2014-Tirronen #case study #concept #type system

Study on difficulties and misconceptions with modern type systems (VT), pp. 303–308.

TFPIE-2014-IshiiA #debugging

Report on a User Test and Extension of a Type Debugger for Novice Programmers (YI, KA), pp. 1–18.

ESOP-2014-GhicaS #bound #linear

Bounded Linear Types in a Resource Semiring (DRG, AIS), pp. 331–350.

ESOP-2014-ThiemannF #type system

Gradual Typing for Annotated Type Systems (PT, LF), pp. 47–66.

FASE-2014-HuangDM #analysis #java #type system #web

Type-Based Taint Analysis for Java Web Applications (WH, YD, AM), pp. 140–154.

FoSSaCS-2014-Padovani #linear #re-engineering #recursion #π-calculus

Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types (LP), pp. 88–102.

ICPC-2014-PetersenHR #api #comparison #eclipse #empirical #groovy #ide #java #type system

An empirical comparison of static and dynamic type systems on API usage in the presence of an IDE: Java vs. groovy with eclipse (PP, SH, RR), pp. 212–222.

SCAM-2014-RahmanR #empirical

A Change-Type Based Empirical Study on the Stability of Cloned Code (MSR, CKR), pp. 31–40.

PEPM-J-2013-Simon14 #type inference #using

Deriving a complete type inference for Hindley-Milner and vector sizes using expansion (AS), pp. 254–271.

PEPM-J-2013-WeijersHH14 #fault #higher-order #polymorphism #security

Security type error diagnosis for higher-order, polymorphic languages (JW, JH, SH), pp. 200–218.

PEPM-2014-0008E #c++ #detection #fault

Early detection of type errors in C++ templates (SC, ME), pp. 133–144.

PEPM-2014-Garcia-PerezNS #λ-calculus

Deriving interpretations of the gradually-typed λ calculus (ÁGP, PN, IS), pp. 157–168.

PEPM-2014-LeatherJLS #semantics

Type-changing rewriting and semantics-preserving transformation (SL, JJ, AL, BS), pp. 109–120.

PLDI-2014-AhnCSGT #javascript #performance #type system

Improving JavaScript performance by deconstructing the type system (WA, JC, TS, MJG, JT), p. 51.

PLDI-2014-DeVitoRFAH #generative #runtime #using

First-class runtime generation of high-performance types using exotypes (ZD, DR, MF, AA, PH), p. 11.

FLOPS-2014-BalabonskiPP

Type Soundness and Race Freedom for Mezzo (TB, FP, JP), pp. 253–269.

FLOPS-2014-ChenE #debugging

Guided Type Debugging (SC, ME), pp. 35–51.

FLOPS-2014-HoffmannS #analysis #array #integer #type system

Type-Based Amortized Resource Analysis with Integers and Arrays (JH, ZS), pp. 152–168.

FLOPS-2014-Sacchini #calculus #linear

Linear Sized Types in the Calculus of Constructions (JLS), pp. 169–185.

CIAA-2014-DemailleDLSS #automaton #type system

A Type System for Weighted Automata and Rational Expressions (AD, ADL, SL, LS, JS), pp. 162–175.

ICALP-v2-2014-BonsangueRABR #algebra #induction

A Coalgebraic Foundation for Coinductive Union Types (MMB, JR, DA, FSdB, JJMMR), pp. 62–73.

ICFP-2014-ChenE #analysis #parametricity #product line #type system

Type-based parametric analysis of program families (SC, ME), pp. 39–51.

ICFP-2014-VazouSJVJ #haskell #refinement

Refinement types for Haskell (NV, ELS, RJ, DV, SLPJ), pp. 269–282.

ICFP-2014-Weirich

Depending on types (SW), p. 241.

IFL-2014-AdsitF #analysis #control flow #performance #system f

An Efficient Type- and Control-Flow Analysis for System F (CA, MF), p. 3.

IFL-2014-AmorimGAH #linear #type checking

Really Natural Linear Indexed Type Checking (AAdA, MG, EJGA, JH), p. 5.

IFL-2014-Christiansen #low level #syntax

Type-Directed Elaboration of Quasiquotations: A High-Level Syntax for Low-Level Reflection (DRC), p. 1.

IFL-2014-DomoszlaiLP #editing #named #type system

Editlets: type-based, client-side editors for iTasks (LD, BL, RP), p. 6.

IFL-2014-KoopmanPJ #data type #encoding #functional #harmful #implementation

Church Encoding of Data Types Considered Harmful for Implementations: Functional Pearl (PWMK, RP, JMJ), p. 4.

CHI-2014-BurgbacherH #gesture #type system #verification

An implicit author verification system for text messages based on gesture typing biometrics (UB, KHH), pp. 2951–2954.

CHI-2014-LiuCBLM #classification #navigation

Effects of display size and navigation type on a classification task (CL, OC, MBL, EL, WEM), pp. 4147–4156.

CHI-2014-TaylorKHIH

Type-hover-swipe in 96 bytes: a motion sensing mechanical keyboard (ST, CK, OH, SI, JH), pp. 1695–1704.

DUXU-DI-2014-PaulinBA #case study #experience #user interface

The Study of the Relations between the BrainHex Player Profiles, MBTI Psychological Types and Emotions as Means to Enhance User Experience (REP, ALB, MMA), pp. 732–741.

HCI-AIMT-2014-FleischmannSS #case study #comparative #interactive #modelling #process

Tangible or Not Tangible — A Comparative Study of Interaction Types for Process Modeling Support (AF, WS, CS), pp. 544–555.

HCI-AIMT-2014-TsurudaHYI #mobile #using

Emotion Transmission System Using a Cellular Phone-Type Teleoperated Robot with a Mobile Projector (YT, MH, HY, YI), pp. 707–714.

HIMI-DE-2014-KoltzRRVMSB #feedback

Effects of Type and Strength of Force Feedback on the Path of Movement in a Target Selection Task (MTK, RCR, JR, KPLV, PM, TZS, VB), pp. 217–225.

HIMI-DE-2014-LeeY14a #documentation

Types of Document Search Tasks and Users’ Cognitive Information Seeking Strategies (HEL, WCY), pp. 449–460.

SCSM-2014-FraidakiPD #how #information management #process #social #social media

Living in the Era of Social Media: How the Different Types of Social Media May Affect Information Acquisition Process (KF, KP, GID), pp. 178–185.

ICEIS-v3-2014-PaulinsBA #visualisation

e-Learning Material Presentation and Visualization Types and Schemes (NP, SB, IA), pp. 138–143.

ICML-c2-2014-ChakrabartiFCM #multi #network #scalability

Joint Inference of Multiple Label Types in Large Networks (DC, SF, JC, SAM), pp. 874–882.

ICML-c2-2014-ShamirS0 #approximate #distributed #optimisation #using

Communication-Efficient Distributed Optimization using an Approximate Newton-type Method (OS, NS, TZ), pp. 1000–1008.

ICPR-2014-DongPHLDJ #classification #network #using

Vehicle Type Classification Using Unsupervised Convolutional Neural Network (ZD, MP, YH, TL, YD, YJ), pp. 172–177.

ICPR-2014-HafnerLUW #classification

Bridging the Resolution Gap between Endoscope Types for a Colonic Polyp Classification (MH, ML, AU, GW), pp. 2739–2744.

ICPR-2014-PinheiroRCJS #fuzzy #independence #robust #verification

Type-2 Fuzzy GMMs for Robust Text-Independent Speaker Verification in Noisy Environments (HNBP, TIR, GDCC, IJT, JS), pp. 4531–4536.

ICPR-2014-PohjankukkaNPHHSH #recognition

Arctic Soil Hydraulic Conductivity and Soil Type Recognition Based on Aerial Gamma-Ray Spectroscopy and Topographical Data (JP, PN, TP, PH, EH, RS, JH), pp. 1822–1827.

ICPR-2014-SlavkovikjVNHW #classification

Image-Based Road Type Classification (VS, SV, WDN, SVH, RVdW), pp. 2359–2364.

KDIR-2014-Nakano #induction #string

Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation (RN), pp. 397–402.

SEKE-2014-OrtinPQG #framework #implementation #named #object-oriented

TyS — A Framework to Facilitate the Implementation of Object-Oriented Type Checkers (FO, DZP, JQ, MG), pp. 150–155.

BX-2014-GrohneLV #bidirectional #dependent type #formal method #semantics

Formalizing Semantic Bidirectionalization with Dependent Types (HG, AL, JV), pp. 75–81.

ECOOP-2014-AnconaC #induction #object-oriented #type system

Sound and Complete Subtyping between Coinductive Types for Object-Oriented Languages (DA, AC), pp. 282–307.

ECOOP-2014-BiermanAT #comprehension #typescript

Understanding TypeScript (GMB, MA, MT), pp. 257–281.

ECOOP-2014-GramoliG #concurrent #data type #reuse

Reusable Concurrent Data Types (VG, RG), pp. 182–206.

ECOOP-2014-MillerHO #concurrent #named #type system

Spores: A Type-Based Foundation for Closures in the Age of Concurrency and Distribution (HM, PH, MO), pp. 308–333.

ECOOP-2014-OmarKNCPA #composition

Safely Composable Type-Specific Languages (CO, DK, LN, BC, AP, JA), pp. 105–130.

Onward-2014-Kell

In Search of Types (SK), pp. 227–241.

Onward-2014-SpasojevicLN #ecosystem #mining #type inference

Mining the Ecosystem to Improve Type Inference for Dynamically Typed Languages (BS, ML, ON), pp. 133–142.

OOPSLA-2014-AllendeFGT #type system

Confined gradual typing (EA, JF, RG, ÉT), pp. 251–270.

OOPSLA-2014-AminRO #dependent type

Foundations of path-dependent types (NA, TR, MO), pp. 233–249.

OOPSLA-2014-BartensteinL #source code

Rate types for stream programs (TB, YDL), pp. 213–232.

OOPSLA-2014-FeldthausM #correctness #interface #javascript #library #typescript

Checking correctness of TypeScript interfaces for JavaScript libraries (AF, AM), pp. 1–16.

OOPSLA-2014-PavlinovicKW #fault

Finding minimum type error sources (ZP, TK, TW), pp. 525–542.

PLATEAU-2014-CoblenzAMS

Considering Productivity Effects of Explicit Type Declarations (MJC, JA, BAM, JS), pp. 59–61.

PPDP-J-2012-LagoP14 #call-by #dependent type #linear

Linear dependent types in a call-by-value scenario (UDL, BP), pp. 77–100.

PPDP-2014-AsaiFTZ #partial evaluation #specification

A Type Theoretic Specification of Partial Evaluation (KA, LF, PT, YZ), pp. 57–68.

PPDP-2014-ChenDY #on the #precise #type system

On the Preciseness of Subtyping in Session Types (TCC, MDC, NY), pp. 135–146.

PPDP-2014-FerreiraP #bidirectional #source code

Bidirectional Elaboration of Dependently Typed Programs (FF, BP), pp. 161–174.

PPDP-2014-Ramsay #abstraction #recursion #safety

Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes (SJR), pp. 175–186.

PPDP-2014-Schopp #low level #source code #using

Organising Low-Level Programs using Higher Types (US), pp. 199–210.

PADL-2014-ElsmanS #evaluation #named #rule-based #static typing #user interface

Typelets — A Rule-Based Evaluation Model for Dynamic, Statically Typed User Interfaces (ME, ASN), pp. 184–199.

PADL-2014-WinantDPS #haskell

Partial Type Signatures for Haskell (TW, DD, FP, TS), pp. 17–32.

POPL-2014-AtkeyGJ #dependent type #parametricity #type system

A relationally parametric model of dependent type theory (RA, NG, PJ), pp. 503–516.

POPL-2014-BurckhardtGYZ #data type #specification #verification

Replicated data types: specification, verification, optimality (SB, AG, HY, MZ), pp. 271–284.

POPL-2014-CasinghinoSW #proving #source code

Combining proofs and programs in a dependently typed language (CC, VS, SW), pp. 33–46.

POPL-2014-Castagna0XILP #evaluation #polymorphism #semantics #syntax

Polymorphic functions with set-theoretic types: part 1: syntax, semantics, and evaluation (GC, KN, ZX, HI, SL, LP), pp. 5–18.

POPL-2014-ChenE #debugging #fault #type system

Counter-factual typing for debugging type errors (SC, ME), pp. 583–594.

POPL-2014-CoughlinC #analysis #composition #invariant

Fissile type analysis: modular checking of almost everywhere invariants (DC, BYEC), pp. 73–86.

POPL-2014-EisenbergVJW #equation #product line

Closed type families with overlapping equations (RAE, DV, SLPJ, SW), pp. 671–684.

POPL-2014-RamsayNO #abstraction #approach #higher-order #model checking #refinement

A type-directed abstraction refinement approach to higher-order model checking (SJR, RPN, CHLO), pp. 61–72.

POPL-2014-SwamyFRBCSB #embedded #javascript #type system

Gradual typing embedded securely in JavaScript (NS, CF, AR, KB, JC, PYS, GMB), pp. 425–438.

ICSE-2014-EndrikatHRS #api #documentation #how #question #static typing #type system #usability

How do API documentation and static typing affect API usability? (SE, SH, RR, AS), pp. 632–642.

ASPLOS-2014-BornholtMM #first-order #named #nondeterminism

Uncertain: a first-order type for uncertain data (JB, TM, KSM), pp. 51–66.

ICLP-J-2014-DuckHS #confluence #consistency #on the #termination #type inference

On Termination, Confluence and Consistent CHR-based Type Inference (GJD, RH, MS), pp. 619–632.

ICLP-J-2014-SerranoLH #abstract interpretation #analysis #logic programming #resource management #source code #using

Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (AS, PLG, MVH), pp. 739–754.

ISSTA-2014-WeitzKSE #string #type system

A type system for format strings (KW, GK, SS, MDE), pp. 127–137.

ISSTA-2014-ZhangW #concurrent #parallel #runtime #thread

Runtime prevention of concurrency related type-state violations in multithreaded applications (LZ, CW), pp. 1–12.

LICS-CSL-2014-Ilik #axiom #decidability #morphism

Axioms and decidability for type isomorphism in the presence of sums (DI), p. 7.

LICS-CSL-2014-Jeffrey #functional

Functional reactive types (AJ), p. 9.

LICS-CSL-2014-LicataF #type system

Eilenberg-MacLane spaces in homotopy type theory (DRL, EF), p. 9.

LICS-CSL-2014-Mogelberg #effectiveness #recursion #type system

A type theory for productive coprogramming via guarded recursion (REM), p. 10.

LICS-CSL-2014-Munch-Maccagnoni #type system

Formulae-as-types for an involutive negation (GMM), p. 10.

RTA-TLCA-2014-BizjakBM #nondeterminism #type system

A Model of Countable Nondeterminism in Guarded Type Theory (AB, LB, MM), pp. 108–123.

RTA-TLCA-2014-Dezani-CiancagliniG #precise #type system

Preciseness of Subtyping on Intersection and Union Types (MDC, SG), pp. 194–207.

RTA-TLCA-2014-EscardoS #data type #type system

Abstract Datatypes for Real Numbers in Type Theory (MHE, AS), pp. 208–223.

RTA-TLCA-2014-FuS #encoding

Self Types for Dependently Typed λ Encodings (PF, AS), pp. 224–239.

RTA-TLCA-2014-HondaYB #interactive #process #π-calculus

Process Types as a Descriptive Tool for Interaction — Control and the π-Calculus (KH, NY, MB), pp. 1–20.

RTA-TLCA-2014-RouxD #type system

The Structural Theory of Pure Type Systems (CR, FvD), pp. 364–378.

CASE-2013-MartinezA #design

Optimal switched-type control design for a class of nonlinear systems (JCM, VA), pp. 1069–1074.

CASE-2013-SustoSPPMB #fault #maintenance #predict

A predictive maintenance system for integral type faults based on support vector machines: An application to ion implantation (GAS, AS, SP, DP, SFM, AB), pp. 195–200.

CASE-2013-ZhuGX #scheduling

MDP-based appointment scheduling for one examination of two types of outpatients (LZ, NG, XX), pp. 764–769.

ESOP-2013-HofmannR #analysis #automation #type inference

Automatic Type Inference for Amortised Heap-Space Analysis (MH, DR), pp. 593–613.

ESOP-2013-KobayashiI #higher-order #model checking #recursion #source code

Model-Checking Higher-Order Programs with Recursive Types (NK, AI), pp. 431–450.

ESOP-2013-LuPX #correlation

Structural Lock Correlation with Ownership Types (YL, JP, JX), pp. 391–410.

ESOP-2013-VazouRJ #refinement

Abstract Refinement Types (NV, PMR, RJ), pp. 209–228.

FoSSaCS-2013-HainryMP #analysis #complexity #process #type system

Type-Based Complexity Analysis for Fork Processes (EH, JYM, RP), pp. 305–320.

TACAS-2013-BlanchetteBPS #encoding #polymorphism

Encoding Monomorphic and Polymorphic Types (JCB, SB, AP, NS), pp. 493–507.

MSR-2013-AllamanisS #stack overflow #topic #what #why

Why, when, and what: analyzing stack overflow questions by topic, type, and code (MA, CAS), pp. 53–56.

MSR-2013-SahaRSP #case study #comprehension #evolution

Understanding the evolution of type-3 clones: an exploratory study (RKS, CKR, KAS, DEP), pp. 139–148.

SCAM-2013-NicolayNRM #javascript #type inference #using

Determining dynamic coupling in JavaScript using object type inference (JN, CN, CDR, WDM), pp. 126–135.

PEPM-2013-Lopez-FraguasM #evaluation #functional #type system

Typing as functional-logic evaluation (FJLF, EMM), pp. 23–32.

PEPM-2013-SagonasST #fault #precise #type system

Precise explanation of success typing errors (KFS, JS, ST), pp. 33–42.

PEPM-2013-Simon #type inference #using

Deriving a complete type inference for hindley-milner and vector sizes using expansion (AS), pp. 13–22.

PEPM-2013-WeijersHH #fault #higher-order #polymorphism #security

Security type error diagnosis for higher-order, polymorphic languages (JW, JH, SH), pp. 3–12.

PLDI-2013-ElwazeerAKSB #data type #detection #scalability

Scalable variable and data type detection in a binary rewriter (KE, KA, AK, MS, RB), pp. 51–60.

PLDI-2013-GordonEG #alias #refinement

Rely-guarantee references for refinement types over aliased mutable data (CSG, MDE, DG), pp. 73–84.

PLDI-2013-GveroKKP #using

Complete completion using types and weights (TG, VK, IK, RP), pp. 27–38.

PLDI-2013-Titzer #parametricity #tuple

Harmonizing classes, functions, tuples, and type parameters in virgil iii (BT), pp. 85–94.

ICALP-v2-2013-DenielouY #automaton #communication #multi #synthesis

Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types (PMD, NY), pp. 174–186.

ICALP-v2-2013-ImNP #data type #parametricity #recursion

Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types (HI, KN, SP), pp. 299–311.

ICALP-v2-2013-Padovani #type system

Fair Subtyping for Open Session Types (LP), pp. 373–384.

ICALP-v2-2013-Stirling #proving #λ-calculus

Proof Systems for Retracts in Simply Typed λ Calculus (CS), pp. 398–409.

SEFM-2013-DardhaGL #component #type system

A Type System for Components (OD, EG, ML), pp. 167–181.

CEFP-2013-Brady #dependent type #domain-specific language #embedded #implementation #programming language

The Idris Programming Language — Implementing Embedded Domain Specific Languages with Dependent Types (EB), pp. 115–186.

ICFP-2013-BernardyM

Type-theory in color (JPB, GM), pp. 61–72.

ICFP-2013-Brady #algebra #dependent type #programming #reasoning

Programming and reasoning with algebraic effects and dependent types (EB), pp. 133–144.

ICFP-2013-DevrieseP #metaprogramming

Typed syntactic meta-programming (DD, FP), pp. 73–86.

ICFP-2013-LorenzenE #automation #composition #verification

Modular and automated type-soundness verification for language extensions (FL, SE), pp. 331–342.

ICFP-2013-Norell #dependent type #interactive #programming

Interactive programming with dependent types (UN), pp. 1–2.

ICFP-2013-St-AmourT #case study #experience #random testing #testing

Experience report: applying random testing to a base type environment (VSA, NT), pp. 351–356.

ICFP-2013-ZilianiDKNV #coq #monad #named #programming

Mtac: a monad for typed tactic programming in Coq (BZ, DD, NRK, AN, VV), pp. 87–100.

IFL-2013-FowlerB #dependent type #programming #web

Dependent Types for Safe and Secure Web Programming (SF, EB), p. 49.

IFL-2013-Protzenko #implementation

The implementation of the Mezzo type-checker (JP), p. 129.

GCM-J-2012-MantzTL #co-evolution #graph

Co-Transformation of Type and Instance Graphs Supporting Merging of Types and Retyping (FM, GT, YL).

CHI-2013-BirkM #game studies #motivation

Control your game-self: effects of controller type on enjoyment, motivation, and personality in game (MB, RLM), pp. 685–694.

CHI-2013-CrossBCAT #education #named #online

TypeRighting: combining the benefits of handwriting and typeface in online educational videos (AC, MB, EC, AA, WT), pp. 793–796.

CHI-2013-DevendorfR #interactive #named

AnyType: provoking reflection and exploration with aesthetic interaction (LD, KR), pp. 1041–1050.

CHI-2013-GoelJMPW #mobile #named #using

ContextType: using hand posture information to improve mobile touch screen text entry (MG, AJ, TM, SNP, JOW), pp. 2795–2798.

CHI-2013-HartSA #exclamation

Love it or hate it!: interactivity and user types (JH, AGS, ADA), pp. 2059–2068.

CHI-2013-OrjiMVG #game studies #health #persuasion

Tailoring persuasive health games to gamer type (RO, RLM, JV, KMG), pp. 2467–2476.

CSCW-2013-ChoiHHLS #communication #mining #social #using

Mining social relationship types in an organization using communication patterns (JC, SH, JH, GL, JS), pp. 295–302.

DHM-HB-2013-KimATBHJ #performance #process #type system

The Effects of Touch Screen Virtual Keyboard Key Sizes on Typing Performance, Typing Biomechanics and Muscle Activity (JHK, LSA, OT, MCB, CAH, PWJ), pp. 239–244.

HCI-III-2013-TsurudaHYI #generative #mobile #using

Generation of Facial Expression Emphasized with Cartoon Techniques Using a Cellular-Phone-Type Teleoperated Robot with a Mobile Projector (YT, MH, HY, YI), pp. 391–400.

HIMI-LCCB-2013-TanikawaA #case study

The Study to Clarify the Type of “Otome-Game” User (MT, YA), pp. 625–631.

VISSOFT-2013-AbuthawabehBZD #matrix #multi #visualisation

Finding structures in multi-type code couplings with node-link and matrix visualizations (AA, FB, DZ, SD), pp. 1–10.

ICEIS-v1-2013-Castanon-PugaCF #fuzzy #java #library #named #object-oriented

JT2FIS: Java Type-2 Fuzzy Inference System — An Object-oriented Class Library for Building Java Intelligent Applications (MCP, JRC, MFP), pp. 524–529.

ICEIS-v2-2013-KuCY #approach #recommendation

Effect of Product Type and Recommendation Approach on Consumers’ Intention to Purchase Recommended Products (YCK, CHC, CSY), pp. 475–480.

ICEIS-v2-2013-SierraCVCV #education #re-engineering #recommendation

Microworld-type Ethnoeducational Computer Materials to Support the Teaching of Nasa-Yuwe — Recommendations from a Software Engineering Disciplines Viewpoint for Constructing Microworld-type Ethnoeducational Materials Aimed at Supporting Nasa Yuwe Language Teaching (LMS, EASC, JAV, TRC, EMV), pp. 526–531.

ECIR-2013-JeongM #classification #dependence #recognition #using

Using WordNet Hypernyms and Dependency Features for Phrasal-Level Event Recognition and Type Classification (YJ, SHM), pp. 267–278.

ECMFA-2013-SunCDF #using

Using Model Types to Support Contract-Aware Model Substitutability (WS, BC, SD, RBF), pp. 118–133.

ICMT-2013-KrauseDG #co-evolution #evolution #graph transformation #metamodelling

Metamodel-Specific Coupled Evolution Based on Dynamically Typed Graph Transformations (CK, JD, HG), pp. 76–91.

ECOOP-2013-LernerELK #source code #static typing

Combining Form and Function: Static Types for JQuery Programs (BSL, LE, JL, SK), pp. 79–103.

ECOOP-2013-ServettoMPN #composition

The Billion-Dollar Fix — Safe Modular Circular Initialisation with Placeholders and Placeholder Types (MS, JM, AP, JN), pp. 205–229.

OOPSLA-2013-BalatsourasS #graph

Class hierarchy complementation: soundly completing a partial type graph (GB, YS), pp. 515–532.

OOPSLA-2013-BolzDT

Storage strategies for collections in dynamically typed languages (CFB, LD, LT), pp. 167–182.

OOPSLA-2013-DeLozierENOMZ #c++ #set #type safety

Ironclad C++: a library-augmented type-safe subset of c++ (CD, RAE, SN, PMO, MMKM, SZ), pp. 287–304.

OOPSLA-2013-HoppeH #comparison #developer #empirical #java

Do developers benefit from generic types?: an empirical comparison of generic and raw types in java (MH, SH), pp. 457–474.

GPCE-2013-ChapinSSW #named #network #programming #staged

Scalaness/nesT: type specialized staged programming for sensor networks (PCC, CS, SFS, MW), pp. 135–144.

GPCE-2013-GerakiosBS #java #parametricity #using

Reified type parameters using Java annotations (PG, AB, YS), pp. 61–64.

GPCE-2013-KolesnikovRHA #comparison #type checking

A comparison of product-based, feature-based, and family-based type checking (SSK, AvR, CH, SA), pp. 115–124.

LOPSTR-2013-AlbertGG #analysis #approach

A Transformational Approach to Resource Analysis with Typed-Norms (EA, SG, RG), pp. 38–53.

PPDP-2013-CaballeroST #constraints #finite #programming

Finite type extensions in constraint programming (RC, PJS, ATF), pp. 217–227.

PPDP-2013-StewartBN #data flow #data type #dependent type #policy #semistructured data

Dependent types for enforcement of information flow and erasure policies in heterogeneous data structures (GS, AB, AN), pp. 145–156.

PADL-2013-Jeffrey #html #web

Dependently Typed Web Client Applications — FRP in Agda in HTML5 (AJ), pp. 228–243.

POPL-2013-AtkeyJK #abstraction #algebra

Abstraction and invariance for algebraically indexed types (RA, PJ, AK), pp. 87–100.

POPL-2013-CairesS #behaviour

The type discipline of behavioral separation (LC, JCS), pp. 275–286.

POPL-2013-GaboardiHHNP #dependent type #difference #linear #privacy

Linear dependent types for differential privacy (MG, AH, JH, AN, BCP), pp. 357–370.

POPL-2013-LagoP #geometry

The geometry of types (UDL, BP), pp. 167–178.

SAC-OOPS-J-2009-SaitoI13 #type system

Matching MyType to subtyping (CS, AI), pp. 933–952.

SAC-2013-AnconaBM #consistency #dynamic analysis #multi #protocol

Constrained global types for dynamic checking of protocol conformance in multi-agent systems (DA, MB, VM), pp. 1377–1379.

SAC-2013-HongJ #named #network #object-oriented #programming language

Meso: an object-oriented programming language for building strongly-typed internet-based network applications (SH, YJJ), pp. 1579–1586.

SAC-2013-LourencoSM #concurrent

Concurrent typed intermediate language (LML, JCS, FM), pp. 1587–1588.

SAC-2013-RenTSF #ruby

The ruby type checker (BMR, JT, TSS, JSF), pp. 1565–1572.

SAC-2013-UmemotoYNT #behaviour #predict #query

Predicting query reformulation type from user behavior (KU, TY, SN, KT), pp. 894–901.

ESEC-FSE-2013-PhamW #abstraction #algebra #data type #named #reasoning

RADA: a tool for reasoning about algebraic data types with abstractions (THP, MWW), pp. 611–614.

SLE-2013-WachsmuthKVGV #analysis #incremental #independence

A Language Independent Task Engine for Incremental Name and Type Analysis (GW, GDPK, VAV, DMG, EV), pp. 260–280.

CADE-2013-BlanchetteP #first-order #morphism #named #polymorphism

TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism (JCB, AP), pp. 414–420.

CSL-2013-GianantonioL #game studies #semantics

Innocent Game Semantics via Intersection Type Assignment Systems (PDG, ML), pp. 231–247.

CSL-2013-Leivant #induction #semantics #type system

Global semantic typing for inductive and coinductive computing (DL), pp. 469–483.

CSL-2013-Statman #normalisation

A New Type Assignment for Strongly Normalizable Terms (RS), pp. 634–652.

CSL-2013-WangB #decidability #equation #semantics #type system

Semantics of Intensional Type Theory extended with Decidable Equational Theories (QW, BB), pp. 653–667.

LICS-2013-BirkedalM #fixpoint #recursion #type system

Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes (LB, REM), pp. 213–222.

LICS-2013-GhaniMFS #data type

Fibred Data Types (NG, LM, FNF, AS), pp. 243–252.

LICS-2013-GundersenHP #λ-calculus

Atomic λ Calculus: A Typed λ-Calculus with Explicit Sharing (TG, WH, MP), pp. 311–320.

LICS-2013-HirschkoffMS #calculus

Name-Passing Calculi: From Fusions to Preorders and Types (DH, JMM, DS), pp. 378–387.

LICS-2013-Kobayashi #type system

Pumping by Typing (NK0), pp. 398–407.

LICS-2013-LairdMMP #modelling #relational #λ-calculus

Weighted Relational Models of Typed λ-Calculi (JL, GM, GM, MP), pp. 301–310.

LICS-2013-LicataS #type system

Calculating the Fundamental Group of the Circle in Homotopy Type Theory (DRL, MS), pp. 223–232.

LICS-2013-Sacchini #calculus #type system

Type-Based Productivity of Stream Definitions in the Calculus of Constructions (JLS), pp. 233–242.

TLCA-2013-DudderMR #type system

Intersection Type Matching with Subtyping (BD, MM, JR), pp. 125–139.

TLCA-2013-FridlenderP #algorithm #evaluation #normalisation #type system

A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation (DF, MP), pp. 140–155.

TLCA-2013-Peyton-Jones #compilation #haskell

Type-Directed Compilation in the Wild: Haskell and Core (SLPJ), p. 1.

VMCAI-2013-Pearce #type system

Sound and Complete Flow Typing with Unions, Intersections and Negations (DJP), pp. 335–354.

VMCAI-2013-ZhuJ #composition #dependent type #lightweight #ml #type inference

Compositional and Lightweight Dependent Type Inference for ML (HZ, SJ), pp. 295–314.

CASE-2012-KimLKCH #algorithm

Proposal of built-in-guide-rail type building façade cleaning robot and its motion planning algorithm (DHK, SL, MK, BIC, CSH), pp. 1004–1009.

CASE-2012-KwonSY #pipes and filters #synthesis

A linkage type mechanical clutch synthesis for pipeline inspection robot (YSK, JTS, BJY), pp. 618–623.

CASE-2012-NilakantanP #assembly #performance #problem

An efficient PSO for type II robotic assembly line balancing problem (JMN, SGP), pp. 600–605.

CASE-2012-SawadaS #design #feedback #on the #optimisation

On numerical optimization design of continuous-time feedback type quantizer for networked control systems (KS, SS), pp. 1144–1149.

CASE-2012-ShinPKA #analysis #linear

Structural analysis of built-in sensor frame in jaws with linear type gripper (DHS, TSP, YGK, JA), pp. 810–814.

DocEng-2012-KimHKL #classification #library

Scientific table type classification in digital library (SK, KH, SYK, YL), pp. 133–136.

VLDB-2012-Bidoit-TolluCU #detection #independence #type system #xml

Type-Based Detection of XML Query-Update Independence (NBT, DC, FU), pp. 872–883.

CSEET-2012-Virseda #algebra #data type #implementation #specification #testing #verification

A Software Testing Tool for the Verification of Abstract Data Type Implementations from Formal Algebraic Specifications (RdVV), pp. 100–104.

ITiCSE-2012-Khalifa #data type

Intuitive thinking while dealing with abstract data types (WK), p. 391.

ESOP-2012-DenielouY #automaton #communication #multi

Multiparty Session Types Meet Communicating Automata (PMD, NY), pp. 194–213.

ESOP-2012-KrishnaswamiB #equation #system f

Adding Equations to System F Types (NRK, NB), pp. 417–435.

ESOP-2012-LuPZX #parallel #source code #thread

A Type and Effect System for Determinism in Multithreaded Programs (YL, JP, CZ, JX), pp. 518–538.

ESOP-2012-SergeyC

Gradual Ownership Types (IS, DC), pp. 579–599.

FoSSaCS-2012-ToninhoCP #process

Functions as Session-Typed Processes (BT, LC, FP), pp. 346–360.

ICPC-2012-KleinschmagerHRS #empirical #maintenance #static typing #type system

Do static type systems improve the maintainability of software systems? An empirical study (SK, SH, RR, ÉT, AS), pp. 153–162.

MSR-2012-GigerPG #analysis #empirical #predict

Can we predict types of code changes? An empirical analysis (EG, MP, HCG), pp. 217–226.

WCRE-2012-JanaN #detection #dynamic analysis #precise #using

Precise Detection of Uninitialized Variables Using Dynamic Analysis — Extending to Aggregate and Vector Types (AJ, RN), pp. 197–201.

PEPM-2012-CaretteS #towards #type system

Towards typing for small-step direct reflection (JC, AS), pp. 93–96.

PEPM-2012-GotoS #approach #functional

An approach to completing variable names for implicitly typed functional languages (TG, IS), pp. 131–140.

PEPM-2012-Lopez-FraguasMR #functional #logic programming

Well-typed narrowing with extra variables in functional-logic programming (FJLF, EMM, JRH), pp. 83–92.

PLDI-2012-ChenDA #automation

Type-directed automatic incrementalization (YC, JD, UAA), pp. 299–310.

PLDI-2012-HackettG #hybrid #javascript #performance #precise #type inference

Fast and precise hybrid type inference for JavaScript (BH, SyG), pp. 239–250.

PLDI-2012-PerelmanGBG

Type-directed completion of partial expressions (DP, SG, TB, DG), pp. 275–286.

SAS-2012-ChengR #abstract domain #spreadsheet

An Abstract Domain to Infer Types over Zones in Spreadsheets (TC, XR), pp. 94–110.

STOC-2012-EtessamiSY #algorithm #branch #context-free grammar #multi #polynomial #probability #process

Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars (KE, AS, MY), pp. 579–588.

FLOPS-2012-Weirich #haskell #programming

Dependently-Typed Programming in GHC (SW), p. 3.

CIAA-2012-AmaviCR #recursion #xml

Weak Inclusion for Recursive XML Types (JA, JC, PR), pp. 78–89.

CIAA-2012-Oliveira #algebra #automaton #linear #probability

Typed Linear Algebra for Weigthed (Probabilistic) Automata (JNO), pp. 52–65.

ICALP-v2-2012-AtseriasD #approximate #bound #quantifier

Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (AA, AD), pp. 67–78.

ICALP-v2-2012-Honda #distributed

Session Types and Distributed Computing (KH), p. 23.

ICALP-v2-2012-OngT #game studies #recursion #semantics

Two-Level Game Semantics, Intersection Types, and Recursion Schemes (CHLO, TT), pp. 325–336.

LATA-2012-GeilkeZ #algorithm #learning #pattern matching #polynomial

Polynomial-Time Algorithms for Learning Typed Pattern Languages (MG, SZ), pp. 277–288.

ICFP-2012-ChenEW #type system #λ-calculus

An error-tolerant type system for variational λ calculus (SC, ME, EW), pp. 29–40.

ICFP-2012-Chitil #contract #lazy evaluation

Practical typed lazy contracts (OC), pp. 67–76.

ICFP-2012-Dunfield

Elaborating intersection and union types (JD), pp. 17–28.

ICFP-2012-HenryMCM #type system

Typing unmarshalling without marshalling types (GH, MM, EC, PM), pp. 287–298.

ICFP-2012-KrishnaswamiTDG

Superficially substructural types (NRK, AT, DD, DG), pp. 41–54.

ICFP-2012-McBride #dependent type #programming

Agda-curious?: an exploration of programming with dependent types (CTM), pp. 1–2.

ICFP-2012-SeveriV #finite #normalisation #recursion #type system

Pure type systems with corecursion on streams: from finite to infinitary normalisation (PS, FJdV), pp. 141–152.

ICFP-2012-VytiniotisJM #compilation #fault #proving #similarity

Equality proofs and deferred type errors: a compiler pearl (DV, SLPJ, JPM), pp. 341–352.

IFL-2012-Fluet #analysis #control flow #system f

A Type- and Control-Flow Analysis for System F (MF), pp. 122–139.

IFL-2012-IonescuJ #modelling #programming

Dependently-Typed Programming in Scientific Computing — Examples from Economic Modelling (CI, PJ), pp. 140–156.

IFL-2012-TsushimaA #debugging #embedded

An Embedded Type Debugger (KT, KA), pp. 190–206.

GT-VMT-2012-NatschlagerS #algebra #approach #graph #graph transformation #inheritance

A Flattening Approach for Attributed Type Graphs with Inheritance in Algebraic Graph Transformation (CN, KDS).

GT-VMT-2012-Taentzer #generative #graph #multi

Instance Generation from Type Graphs with Arbitrary Multiplicities (GT).

ICGT-2012-TaentzerML #co-evolution #graph

Co-transformation of Graphs and Type Graphs with Application to Model Co-evolution (GT, FM, YL), pp. 326–340.

CHI-2012-BruunS #testing #usability

The effect of task assignments and instruction types on remote asynchronous usability testing (AB, JS), pp. 2117–2126.

CHI-2012-FindlaterW #adaptation #automation #personalisation #type system

Personalized input: improving ten-finger touchscreen typing through automatic adaptation (LF, JOW), pp. 815–824.

CHI-2012-GoelFW #mobile #named #using

WalkType: using accelerometer data to accomodate situational impairments in mobile touch screen text entry (MG, LF, JOW), pp. 2687–2696.

CHI-2012-HenzeRB #behaviour #mobile #type system #using

Observational and experimental investigation of typing behaviour using virtual keyboards for mobile devices (NH, ER, SB), pp. 2659–2668.

CHI-2012-KumarPL #interactive #speech #type system

Voice typing: a new speech interaction model for dictation on touchscreen devices (AK, TP, BL), pp. 2277–2286.

CHI-2012-NicolauJ #comprehension #type system #using

Touch typing using thumbs: understanding the effect of mobility and hand posture (HN, JAJ), pp. 2683–2686.

CHI-2012-RaihaO #case study #fault #type system

An exploratory study of eye typing fundamentals: dwell time, text entry rate, errors, and workload (KJR, SO), pp. 3001–3010.

CSCW-2012-EiriksdottirKCMMXP #comprehension #game studies #health #multi #pervasive

This is not a one-horse race: understanding player types in multiplayer pervasive health games for youth (EE, DK, RC, EDM, ADM, YX, ESP), pp. 843–852.

HILT-2012-Kirtchev #compilation #implementation #performance #robust

A new robust and efficient implementation of controlled types in the GNAT compiler (HHK), pp. 43–50.

CAiSE-2012-Guizzardi #ontology

Ontological Meta-properties of Derived Object Types (GG), pp. 318–333.

CIKM-2012-BalogN12a #identification #query

Hierarchical target type identification for entity-oriented queries (KB, RN), pp. 2391–2394.

CIKM-2012-NguyenNMF #clustering #wiki

Clustering Wikipedia infoboxes to discover their types (THN, HDN, VM, JF), pp. 2134–2138.

CIKM-2012-SunG #learning

Active learning for relation type extension with local and global data views (AS, RG), pp. 1105–1112.

ICPR-2012-CaoL #categorisation #fuzzy

Type-2 fuzzy labeled latent Dirichlet allocation for human action categorization (XQC, ZQL), pp. 1338–1341.

ICPR-2012-JiaYZZT #database #multi

A cross-device matching fingerprint database from multi-type sensors (XJ, XY, YZ, NZ, JT), pp. 3001–3004.

KDD-2012-ShanZCSWYYL #multi #named #retrieval

EventSearch: a system for event discovery and retrieval on multi-type historical data (DS, WXZ, RC, BS, ZW, JY, HY, XL), pp. 1564–1567.

KDIR-2012-AbdullinN #clustering #data type #framework #learning

A Semi-supervised Learning Framework to Cluster Mixed Data Types (AA, ON), pp. 45–54.

RecSys-2012-KramarB #personalisation

Dynamically selecting an appropriate context type for personalisation (TK, MB), pp. 321–324.

SIGIR-2012-CartrightCDDGKWYAMS #framework #multi #retrieval

A framework for manipulating and searching multiple retrieval types (MAC, EFC, WD, JD, LG, KK, XW, IZY, JA, RM, DAS), p. 1001.

SIGIR-2012-LiWLF #performance #query

Supporting efficient top-k queries in type-ahead search (GL, JW, CL, JF), pp. 355–364.

BX-2012-PachecoCH #induction #lens

Delta Lenses over Inductive Types (HP, AC, ZH), pp. 21–37.

ICMT-2012-GeorgeWS #domain-specific language #model transformation #scala #type safety

Type-Safe Model Transformation Languages as Internal DSLs in Scala (LG, AW, MS), pp. 160–175.

ICMT-2012-VallecilloG #model transformation #type system #using

Typing Model Transformations Using Tracts (AV, MG), pp. 56–71.

ECOOP-2012-BurckhardtFLW #consistency

Cloud Types for Eventual Consistency (SB, MF, DL, BPW), pp. 283–307.

ECOOP-2012-OstlundW #multi

Multiple Aggregate Entry Points for Ownership Types (JÖ, TW), pp. 156–180.

Onward-2012-Heinlein #composition #named #programming language #static typing

MOST-flexiPL: modular, statically typed, flexibly extensible programming language (CH), pp. 159–178.

Onward-2012-PolitzVK

Progressive types (JGP, HQdlV, SK), pp. 55–66.

OOPSLA-2012-CastanosEINNOW #compilation #jit #on the #scripting language #static typing

On the benefits and pitfalls of extending a statically typed language JIT compiler for dynamic scripting languages (JGC, DE, KI, PN, TN, TO, PW), pp. 195–212.

OOPSLA-2012-ChughHJ #dependent type #javascript

Dependent types for JavaScript (RC, DH, RJ), pp. 587–606.

OOPSLA-2012-CohenZSL #energy

Energy types (MC, HSZ, EES, YDL), pp. 831–850.

OOPSLA-2012-MayerHRTS #empirical #static typing #type system #usability

An empirical study of the influence of static type systems on the usability of undocumented software (CM, SH, RR, ÉT, AS), pp. 683–702.

OOPSLA-2012-SolodkyyRS #c++ #performance

Open and efficient type switch for C++ (YS, GDR, BS), pp. 963–982.

OOPSLA-2012-SuenagaFI #concurrent #type system

Type-based safe resource deallocation for shared-memory concurrency (KS, RF, AI), pp. 1–20.

OOPSLA-2012-TakikawaSDTF #type system

Gradual typing for first-class classes (AT, TSS, CD, STH, MF), pp. 793–810.

LOPSTR-2012-MantelS #analysis #data flow #dependence

Types vs. PDGs in Information Flow Analysis (HM, HS), pp. 106–121.

PPDP-2012-DardhaGS #revisited

Session types revisited (OD, EG, DS), pp. 139–150.

PPDP-2012-LagoP #call-by #dependent type #linear

Linear dependent types in a call-by-value scenario (UDL, BP), pp. 115–126.

PPDP-2012-Martin-MartinR

Transparent function types: clearing up opacity (EMM, JRH), pp. 127–138.

PADL-2012-St-AmourTFF #type system

Typing the Numeric Tower (VSA, STH, MF, MF), pp. 289–303.

POPL-2012-BhatAVG #probability #type system

A type theory for probability density functions (SB, AA, RWV, AGG), pp. 545–556.

POPL-2012-CaveP #data type #programming

Programming with binders and indexed data-types (AC, BP), pp. 413–424.

POPL-2012-ChughRJ #logic #type system

Nested refinements: a logic for duck typing (RC, PMR, RJ), pp. 231–244.

POPL-2012-LicataH #2d #type system

Canonicity for 2-dimensional type theory (DRL, RH), pp. 337–348.

POPL-2012-NadenBAB #type system

A type system for borrowing permissions (KN, RB, JA, KB), pp. 557–570.

POPL-2012-RastogiCH #type inference

The ins and outs of gradual type inference (AR, AC, BH), pp. 481–494.

SAC-2012-BernardiH #contract #modelling #using

Modelling session types using contracts (GB, MH), pp. 1941–1946.

SAC-2012-DamianiPW #object-oriented #programming #type system

A type system for checking specialization of packages in object-oriented programming (FD, APH, YW), pp. 1737–1742.

SAC-2012-TangJ #analysis #precise

Exploiting regularity of user-defined types to improve precision of program analyses (XT, JJ), pp. 1743–1750.

SAC-2012-TarauH #on the

On computing with types (PT, DH), pp. 1889–1896.

SAC-2012-YanZM #data type #fuzzy #logic

f-SROIQ(G): an expressive fuzzy Description Logic supporting fuzzy data type group (LY, FZ, ZMM), pp. 320–325.

FSE-2012-MilanovaH

Inference and checking of context-sensitive pluggable types (AM, WH), p. 26.

LDTA-2012-LinckeS #concept #higher-order #object-oriented

From HOT to COOL: transforming higher-order typed languages to concept-constrained object-oriented languages (DL, SS), p. 3.

SLE-2012-BettiniSVC #implementation #tool support #type system #xtext

Approaches and Tools for Implementing Type Systems in Xtext (LB, DS, MV, SC), pp. 392–412.

SLE-2012-HillsKV #metalanguage #type safety

Meta-language Support for Type-Safe Access to External Resources (MH, PK, JJV), pp. 372–391.

CAV-2012-BrazdilCKN #game studies #multi #performance #synthesis

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types (TB, KC, AK, PN), pp. 23–38.

CAV-2012-RondonBKJ #c #named #verification

CSolve: Verifying C with Liquid Types (PMR, AB, MK, RJ), pp. 744–750.

CSL-2012-DeYoungCPT #communication #linear #logic #reduction

Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication (HD, LC, FP, BT), pp. 228–242.

CSL-2012-Ehrhard

Collapsing non-idempotent intersection types (TE), pp. 259–273.

ICLP-2012-Hadjichristodoulou #polymorphism #prolog #type system

A Gradual Polymorphic Type System with Subtyping for Prolog (SH), pp. 451–457.

ICLP-2012-ZomboriCS #constraints #logic programming #static typing #type inference #using

Static Type Inference for the Q language using Constraint Logic Programming (ZZ, JC, PS), pp. 119–129.

ICLP-J-2012-BaralDGG #algorithm #correctness #programming #set #λ-calculus

Typed answer set programming λ calculus theories and correctness of inverse λ algorithms with respect to them (CB, JD, MAG, AG), pp. 775–791.

ICST-2012-McMinnSS #data type #generative #query #search-based #string #using #web

Search-Based Test Input Generation for String Data Types Using the Results of Web Queries (PM, MS, MS), pp. 141–150.

ISSTA-2012-PradelHG #detection #parametricity #static analysis #type system

Static detection of brittle parameter typing (MP, SH, TRG), pp. 265–275.

ISSTA-2012-YiDFF #concurrent #java #thread

Cooperative types for controlling thread interference in Java (JY, TD, SNF, CF), pp. 232–242.

LICS-2012-AwodeyGS #induction #type system

Inductive Types in Homotopy Type Theory (SA, NG, KS), pp. 95–104.

LICS-2012-JaberTS #type system

Extending Type Theory with Forcing (GJ, NT, MS), pp. 395–404.

RTA-2012-Terui #complexity #evaluation #semantics #λ-calculus

Semantic Evaluation, Intersection Types and Complexity of Simply Typed λ Calculus (KT), pp. 323–338.

VMCAI-2012-Jhala #verification

Software Verification with Liquid Types (RJ), p. 23.

ASE-2011-RasoolM #design pattern #detection #flexibility

Flexible design pattern detection based on feature types (GR, PM), pp. 243–252.

CASE-2011-CatalanSBRC #communication #distributed

Communication types for manufacturing systems. A proposal to distributed control system based on IEC 61499 (CC, FS, AB, JMR, JMC), pp. 767–772.

CASE-2011-LeeL #clustering #concurrent #multi

Concurrent processing of multiple wafer types in a single-armed cluster tool (JHL, TEL), pp. 102–107.

CASE-2011-MaramisDLK #automation #type system

A system for automatic HPV typing via PCR-RFLP gel electrophoresis (CM, AD, AFL, SPK), pp. 549–556.

CASE-2011-PrudhommeBFG

Preclinically assessed optimal control of postprandial glucose excursions for type 1 patients with diabetes (TP, AB, GF, DG), pp. 702–707.

CASE-2011-Ruiz-VelazquezAFQ #modelling

Neural modeling of the blood glucose level for Type 1 Diabetes Mellitus patients (ERV, AYA, RF, GQ), pp. 696–701.

DAC-2011-BanLP #2d #composition #flexibility #framework #layout

Flexible 2D layout decomposition framework for spacer-type double pattering lithography (YB, KL, DZP), pp. 789–794.

DRR-2011-KimLT #automation #identification #using

Automated identification of biomedical article type using support Vector machines (ICK, DXL, GRT), pp. 1–10.

SIGMOD-2011-RoyC #database #performance #semantics

Location-aware type ahead search on spatial databases: semantics and efficiency (SBR, KC), pp. 361–372.

ESOP-2011-BonoMP #message passing #type system

Typing Copyless Message Passing (VB, CM, LP), pp. 57–76.

ESOP-2011-CairesPSVF #data access #type system

Type-Based Access Control in Data-Centric Systems (LC, JAP, JCS, HTV, LF), pp. 136–155.

ESOP-2011-GuhaSK #analysis #type system #using

Typing Local Control and State Using Flow Analysis (AG, CS, SK), pp. 256–275.

ESOP-2011-HuntS #exponential #polynomial #security #type system

From Exponential to Polynomial-Time Security Typing via Principal Types (SH, DS), pp. 297–316.

FASE-2011-CunhaVAS #evolution #spreadsheet #type safety

Type-Safe Evolution of Spreadsheets (JC, JV, TLA, JS), pp. 186–201.

FoSSaCS-2011-Abel #similarity #type system

Irrelevance in Type Theory with a Heterogeneous Equality Judgement (AA0), pp. 57–71.

FoSSaCS-2011-AtkeyJG #induction #question #refinement

When Is a Type Refinement an Inductive Type? (RA, PJ, NG), pp. 72–87.

FoSSaCS-2011-BernadetL #complexity #normalisation

Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types (AB, SL), pp. 88–107.

FoSSaCS-2011-BernardyL #parametricity #type system

Realizability and Parametricity in Pure Type Systems (JPB, ML), pp. 108–122.

SCAM-J-2009-TiarksKF11 #assessment #detection #state of the art #tool support

An extended assessment of type-3 clones as detected by state-of-the-art tools (RT, RK, RF), pp. 295–331.

ICSM-2011-MihaliczaPG #c++ #profiling

Type-preserving heap profiler for C++ (JM, ZP, AG), pp. 457–466.

PEPM-2011-Martin-Martin #functional #logic programming

Type classes in functional logic programming (EMM), pp. 121–130.

PEPM-2011-PlasmeijerAKLNG #evolution #runtime #type safety #workflow

iTasks for a change: type-safe run-time change in dynamically evolving workflows (RP, PA, PWMK, BL, TvN, JHGvG), pp. 151–160.

PLDI-2011-SampsonDFGCG #approximate #data type #named #power management

EnerJ: approximate data types for safe and general low-power computation (AS, WD, EF, DG, LC, DG), pp. 164–174.

PLDI-2011-TateLL #java #type system

Taming wildcards in Java’s type system (RT, AL, SL), pp. 614–627.

CIAA-2011-AmaviCAR #xml

Weak Inclusion for XML Types (JA, JC, MHFA, PR), pp. 30–41.

CIAA-2011-BechetDF #strict

Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages (DB, AJD, AF), pp. 42–52.

LATA-2011-CorranHKT #automation #finite #monad

Singular Artin Monoids of Finite Coxeter Type Are Automatic (RC, MH, DK, RMT), pp. 250–261.

ICFP-2011-DevrieseP #on the

On the bright side of type classes: instance arguments in Agda (DD, FP), pp. 143–155.

ICFP-2011-JayP #pattern matching #self

Typed self-interpretation by pattern matching (CBJ, JP), pp. 247–258.

ICFP-2011-SwamyCFSBY #dependent type #distributed #programming

Secure distributed programming with value-dependent types (NS, JC, CF, PYS, KB, JY), pp. 266–278.

AGTIVE-2011-MantzJT #concept #consistency #evolution #graph transformation #metamodelling #migration

Graph Transformation Concepts for Meta-model Evolution Guaranteeing Permanent Type Conformance throughout Model Migration (FM, SJ, GT), pp. 3–18.

CHI-2011-FindlaterWW #type system

Typing on flat glass: examining ten-finger expert typing patterns on touch surfaces (LF, JOW, DW), pp. 2453–2462.

CSCW-2011-SinghJM #community #developer #online

Types of newcomers in an online developer community (VS, AJ, RM), pp. 717–720.

DHM-2011-QinTD #type system #using

The Upper Extremity Loading during Typing Using One, Two and Three Fingers (JQ, MT, JTD), pp. 178–185.

DUXU-v2-2011-ChangH #performance

Effects of Menu Types and Item Lengths on Operation Efficiency (YHC, TKPH), pp. 376–383.

HCI-DDA-2011-LekkasTGMS

The Effects of Personality Type in User-Centered Appraisal Systems (ZL, NT, PG, CM, GS), pp. 388–396.

HCI-MIIE-2011-KimPCJ #clustering #effectiveness #traversal

The Effective IVIS Menu and Control Type of an Instrumental Gauge Cluster and Steering Wheel Remote Control with a Menu Traversal (SMK, JP, JC, ESJ), pp. 401–410.

HCI-MIIE-2011-YuC #hybrid #interactive

Reacting with Care: The Hybrid Interaction Types in a Sensible Space (GJY, TWC), pp. 250–258.

HCI-UA-2011-HsuL

Effects of Age Groups and Distortion Types on Text-Based CAPTCHA Tasks (CHH, YLL), pp. 453–455.

HCI-UA-2011-KallinenKR #case study #experience #multi #tablet #user interface

The Effects of Content Type and Presentation Style on User Experiences of Multimedia Content on a Tablet PC (KK, JK, NR), pp. 466–475.

ICEIS-J-2011-Li11f #analysis #approach #case study #machine learning #type system #using

A Study on Noisy Typing Stream Analysis Using Machine Learning Approach (JL0), pp. 149–161.

ICEIS-v2-2011-Fan #case study

Study on the Green Transport in Bi-typed Society Construction (XF), pp. 394–399.

ICEIS-v4-2011-Jung #comprehension #game studies #video

Understanding Media Violence from a Role-play Perspective — Effects of Various Types of Violent Video Games on Players’ Cognitive Aggression (YJ), pp. 261–266.

CIKM-2011-AkerG #comprehension

Understanding the types of information humans associate with geographic objects (AA, RJG), pp. 1929–1932.

CIKM-2011-KazaiKM #crowdsourcing

Worker types and personality traits in crowdsourcing relevance labels (GK, JK, NMF), pp. 1941–1944.

CIKM-2011-LiuFYW #enterprise

Finding relevant information of certain types from enterprise data (XL, HF, CY, MW), pp. 47–56.

CIKM-2011-WangHD #clustering #matrix #multi #relational #symmetry

Simultaneous clustering of multi-type relational data via symmetric nonnegative matrix tri-factorization (HW, HH, CHQD), pp. 279–284.

ECIR-2011-AktolgaAS #ranking #using

Passage Reranking for Question Answering Using Syntactic Structures and Answer Types (EA, JA, DAS), pp. 617–628.

ECIR-2011-GyllstromM #query #topic

Clash of the Typings — Finding Controversies and Children’s Topics Within Queries (KG, MFM), pp. 80–91.

ICML-2011-JimenezS #performance

Fast Newton-type Methods for Total Variation Regularization (ÁBJ, SS), pp. 313–320.

KDIR-2011-HagenauLN #feature model #predict

Impact of Feature Selection and Feature Types on Financial Stock Price Prediction (MH, ML, DN), pp. 303–308.

KDIR-2011-MoralesCT #clustering

Clustering of Heterogeneously Typed Data with Soft Computing (AFKM, LECB, DTB), pp. 499–502.

KMIS-2011-IguchiK #enterprise #information management #research

The Research of Knowledge Management System for Supporting Hyper Text Type of Enterprise Organization (MI, YK), pp. 312–317.

SIGIR-2011-AgeevGLA #game studies #interactive #modelling #using #web

Find it if you can: a game for modeling different types of web search success using interaction data (MA, QG, DL, EA), pp. 345–354.

BX-2011-Cunha #evolution #spreadsheet #type safety

Type-safe Evolution of Spreadsheets (JC), p. 55.

ECOOP-2011-BaltopoulosBG #database #maintenance #refinement

Maintaining Database Integrity with Refinement Types (IGB, JB, ADG), pp. 484–509.

ECOOP-2011-BocchinoA #framework #object-oriented #parallel #programming

Types, Regions, and Effects for Safe Programming with Object-Oriented Parallel Frameworks (RLBJ, VSA), pp. 306–332.

ECOOP-2011-DietlEM #static analysis

Tunable Static Inference for Generic Universe Types (WD, MDE, PM), pp. 333–357.

ECOOP-2011-WintherS

Related Types (JW, MIS), pp. 434–458.

Onward-2011-KnollGM

Naturalistic types (RK, VG, MM), pp. 33–48.

OOPSLA-2011-AdamsKMMCD #polynomial

Flow-sensitive type recovery in linear-log time (MDA, AWK, JM, MM, AC, RKD), pp. 483–498.

OOPSLA-2011-AllenHKLRCS #composition #inheritance #morphism #multi #parametricity #polymorphism #type checking

Type checking modular multiple dispatch with parametric polymorphism and multiple inheritance (EEA, JH, SK, VL, SR, DC, GLSJ), pp. 973–992.

OOPSLA-2011-ImNGP #recursion #type system

A syntactic type system for recursive modules (HI, KN, JG, SP), pp. 993–1012.

OOPSLA-2011-InaI #type system

Gradual typing for generics (LI, AI), pp. 609–624.

OOPSLA-2011-SummersM #lightweight #type system

Freedom before commitment: a lightweight type system for object initialisation (AJS, PM), pp. 1013–1032.

OOPSLA-2011-TovP #formal method

A theory of substructural types and control (JAT, RP), pp. 625–642.

TOOLS-EUROPE-2011-WelschS #distributed #object-oriented #programming

Location Types for Safe Distributed Object-Oriented Programming (YW, JS), pp. 194–210.

GPCE-J-2005-LutterothDW11 #generative #type system

A type system for reflective program generators (CL, DD, GW), pp. 392–422.

PPDP-2011-AlvesFFM #recursion #λ-calculus

Linearity and recursion in a typed λ-calculus (SA, MF, MF, IM), pp. 173–182.

PPDP-2011-BiernackaBL #continuation #type system

Typing control operators in the CPS hierarchy (MB, DB, SL), pp. 149–160.

PPDP-2011-ColazzoS #complexity #precise #type inference #xquery

Precision and complexity of XQuery type inference (DC, CS), pp. 89–100.

PPDP-2011-ToninhoCP #linear #type system

Dependent session types via intuitionistic linear type theory (BT, LC, FP), pp. 161–172.

POPL-2011-AnCFH #ruby #static typing

Dynamic inference of static types for ruby (Jh(A, AC, JSF, MH), pp. 459–472.

POPL-2011-DenielouY #multi

Dynamic multirole session types (PMD, NY), pp. 435–446.

POPL-2011-GhicaS #geometry #resource management #synthesis #type inference

Geometry of synthesis III: resource management through type inference (DRG, AS), pp. 345–356.

POPL-2011-OngR #algebra #data type #functional #higher-order #pattern matching #source code #verification

Verifying higher-order functional programs with pattern-matching algebraic data types (CHLO, SJR), pp. 587–598.

POPL-2011-Pottier

A typed store-passing translation for general references (FP), pp. 147–158.

POPL-2011-RamseyD #composition #dependent type #independence #low level #type system #using

Resourceable, retargetable, modular instruction selection using a machine-independent, type-based tiling of low-level intermediate code (NR, JD), pp. 575–586.

POPL-2011-TovP

Practical affine types (JAT, RP), pp. 447–458.

POPL-2011-WeirichVJZ #abstraction #generative

Generative type abstraction and type-level computation (SW, DV, SLPJ, SZ), pp. 227–240.

SAC-2011-GafurovBBY #authentication

Fusion in fingerprint authentication: two finger types vs. two scanner types (DG, CB, PB, BY), pp. 13–18.

SAC-2011-HauptPH #approach #programming language #type system

Type harvesting: a practical approach to obtaining typing information in dynamic programming languages (MH, MP, RH), pp. 1282–1289.

SAC-2011-MakanjuZM #retrieval #using

Storage and retrieval of system log events using a structured schema based on message type transformation (AM, ANZH, EEM), pp. 528–533.

SAC-2011-WangZG #classification #identification #network

Traffic classification beyond application level: identifying content types from network traces (YW, ZZ, LG), pp. 540–541.

ESEC-FSE-2011-GligoricBJ #mutation testing #named #testing

SMutant: a tool for type-sensitive mutation testing in a dynamic language (MG, SB, RJ), pp. 424–427.

ICSE-2011-DietlDEMS #using

Building and using pluggable type-checkers (WD, SD, MDE, KM, TWS), pp. 681–690.

LDTA-2011-MametjanovWL #precise #type system

More precise typing of rewrite strategies (AM, VLW, RL), p. 3.

LDTA-2011-SergeyC #automaton #recursion #type checking

From type checking by recursive descent to type checking with an abstract machine (IS, DC), p. 2.

SLE-2011-Wojciechowski #communication #concurrent #scripting language

Typed First-Class Communication Channels and Mobility for Concurrent Scripting Languages (PTW), pp. 378–387.

HPCA-2011-AndersonFCE #architecture #javascript #mobile

Checked Load: Architectural support for JavaScript type-checking on mobile processors (OA, EF, LC, SJE), pp. 419–430.

LCTES-2011-BenvenisteBCP #compilation #hybrid

Divide and recycle: types and compilation for a hybrid synchronous language (AB, TB, BC, MP), pp. 61–70.

CAV-2011-HagueL #data type #model checking #recursion #source code

Model Checking Recursive Programs with Numeric Data Types (MH, AWL), pp. 743–759.

CAV-2011-Jhala #using #verification

Using Types for Software Verification (RJ), p. 20.

CSL-2011-BernadetL #modelling #morphism #orthogonal #polymorphism

Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism (AB, SL), pp. 51–66.

ICLP-2011-JacksonBS #canonical

Canonical Regular Types (EKJ, NB, WS), pp. 73–83.

ICLP-2011-ZomboriCS #functional #prolog #static typing #type checking

Static Type Checking for the Q Functional Language in Prolog (ZZ, JC, PS), pp. 62–72.

ICST-2011-SmithW #detection #heuristic #sql #using #web

Using SQL Hotspots in a Prioritization Heuristic for Detecting All Types of Web Application Vulnerabilities (BHS, LW), pp. 220–229.

ISSTA-2011-PradelG #detection #order

Detecting anomalies in the order of equally-typed method arguments (MP, TRG), pp. 232–242.

LICS-2011-BarrasJSW #decidability #first-order #higher-order #named #type system

CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory (BB, JPJ, PYS, QW), pp. 143–151.

LICS-2011-Clairambault #higher-order #morphism

Isomorphisms of Types in the Presence of Higher-Order References (PC), pp. 152–161.

LICS-2011-LagoG #dependent type #linear

Linear Dependent Types and Relative Completeness (UDL, MG), pp. 133–142.

LICS-2011-Marion #analysis #complexity #type system

A Type System for Complexity Flow Analysis (JYM), pp. 123–132.

RTA-2011-Roux #dependence #higher-order #refinement

Refinement Types as Higher-Order Dependency Pairs (CR), pp. 299–312.

RTA-2011-StumpKO #confluence #problem

Type Preservation as a Confluence Problem (AS, GK, REHO), pp. 345–360.

TAP-2011-SoekenWD #data type #encoding #modelling #ocl #satisfiability #uml #verification

Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models (MS, RW, RD), pp. 152–170.

TLCA-2011-AbelP #dependent type #higher-order #unification

Higher-Order Dynamic Pattern Unification for Dependent Types and Records (AA, BP), pp. 10–26.

TLCA-2011-ArndtK #formal method #modelling #type system

Homotopy-Theoretic Models of Type Theory (PA, KK), pp. 45–60.

TLCA-2011-BourreauS #game studies #semantics #λ-calculus

Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus (PB, SS), pp. 61–75.

TLCA-2011-ClairambaultD #category theory

The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories (PC, PD), pp. 91–106.

TLCA-2011-RehofU #combinator #finite #logic

Finite Combinatory Logic with Intersection Types (JR, PU), pp. 169–183.

TLCA-2011-SvendsenBN #dependent type

Partiality, State and Dependent Types (KS, LB, AN), pp. 198–212.

ASE-2010-Balint #automation #behaviour #data type

Automatic inference of abstract type behavior (MB), pp. 499–504.

ASE-2010-KhatchadourianM #automation #java #refactoring

Enumeration refactoring: a tool for automatically converting Java constants to enumerated types (RK, BM), pp. 181–182.

DocEng-2010-MullerRB #file system

A file-type sensitive, auto-versioning file system (AM, SR, UMB), pp. 271–274.

PODS-2010-GeladeIMN #approximate #xml

Simplifying XML schema: single-type approximations of regular tree languages (WG, TI, WM, FN), pp. 251–260.

PODS-2010-MeierSWL #optimisation #query #semantics

Semantic query optimization in the presence of types (MM, MS, FW, GL), pp. 111–122.

VLDB-2010-LimayeSC #using #web

Annotating and Searching Web Tables Using Entities, Types and Relationships (GL, SS, SC), pp. 1338–1347.

VLDB-2010-WuLLZ #named

Seaform: Search-As-You-Type in Forms (HW, GL, CL, LZ), pp. 1565–1568.

ESOP-2010-TovP #contract

Stateful Contracts for Affine Types (JAT, RP), pp. 550–569.

FoSSaCS-2010-TsukadaK #infinity #recursion

Untyped Recursion Schemes and Infinite Intersection Types (TT, NK), pp. 343–357.

FoSSaCS-2010-YoshidaDBH #multi

Parameterised Multiparty Session Types (NY, PMD, AB, RH), pp. 128–145.

MSR-2010-NagappanV #mining

Abstracting log lines to log event types for mining software system logs (MN, MAV), pp. 114–117.

SCAM-2010-TroshinaDC #decompiler #re-engineering

Reconstruction of Composite Types for Decompilation (KT, YD, AC), pp. 179–188.

PEPM-2010-BoustaniH #java #source code

Corrective hints for type incorrect generic Java programs (NEB, JH), pp. 5–14.

PEPM-2010-RudolphT #bytecode #code generation #named #runtime #type safety

Mnemonics: type-safe bytecode generation at run time (JR, PT), pp. 15–24.

PLDI-2010-AcarBLTT #data type #self

Traceable data types for self-adjusting computation (UAA, GEB, RLW, KT, DT), pp. 483–496.

PLDI-2010-ChenCS #compilation #security #verification

Type-preserving compilation of end-to-end verification of security enforcement (JC, RC, NS), pp. 412–423.

PLDI-2010-Chlipala #metaprogramming #named #static typing

Ur: statically-typed metaprogramming with type-level record computation (AC), pp. 122–133.

PLDI-2010-KhooCF #execution #symbolic computation #type checking

Mixing type checking and symbolic execution (YPK, BYEC, JSF), pp. 436–447.

PLDI-2010-TateCH #assembly #object-oriented

Inferable object-oriented typed assembly language (RT, JC, CH), pp. 424–435.

PLDI-2010-YangH #automation #operating system #type safety #verification

Safe to the last instruction: automated verification of a type-safe operating system (JY, CH), pp. 99–110.

STOC-2010-LeeM #metric

Bilipschitz snowflakes and metrics of negative type (JRL, MM), pp. 621–630.

FLOPS-2010-AltenkirchDLO #dependent type #named

ΠΣ: Dependent Types without the Sugar (TA, NAD, AL, NO), pp. 40–55.

FLOPS-2010-OrchardS #constraints #haskell

Haskell Type Constraints Unleashed (DAO, TS), pp. 56–71.

FLOPS-2010-Pientka #dependent type #named #programming

Beluga: Programming with Dependent Types, Contextual Data, and Contexts (BP), pp. 1–12.

FLOPS-2010-Sagonas #concurrent #detection #erlang #fault #source code #static analysis #using

Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs (KFS), pp. 13–18.

CIAA-2010-TirnaucaT #automaton #identification #query

Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (CT, CIT), pp. 272–281.

ICALP-v2-2010-GenestGMW #automaton

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (BG, HG, AM, IW), pp. 52–63.

LATA-2010-YoshinakaKS #context-free grammar #multi

Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages (RY, YK, HS), pp. 596–607.

ICFP-2010-BernardyJP #dependent type #parametricity

Parametricity and dependent types (JPB, PJ, RP), pp. 345–356.

ICFP-2010-HoldermansH #analysis #higher-order #polymorphism

Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators (SH, JH), pp. 63–74.

ICFP-2010-MorgensternL #programming

Security-typed programming within dependently typed programming (JM, DRL), pp. 169–180.

ICFP-2010-MorrisJ #programming

Instance chains: type class programming without overlapping instances (JGM, MPJ), pp. 375–386.

ICFP-2010-ReedP #calculus #difference #distance #privacy

Distance makes the types grow stronger: a calculus for differential privacy (JR, BCP), pp. 157–168.

ICFP-2010-StampoulisS #logic #named

VeriML: typed computation of logical terms inside a language with effects (AS, ZS), pp. 333–344.

ICFP-2010-Tobin-HochstadtF #logic

Logical types for untyped languages (STH, MF), pp. 117–128.

IFL-2010-MiddelkoopDS #attribute grammar

Dependently Typed Attribute Grammars (AM, AD, SDS), pp. 105–120.

ILC-2010-Mehnert #detection #fault #type inference #type system

Extending Dylan’s type system for better type inference and error detection (HM), pp. 1–10.

ICGT-2010-Jurack #emf #graph #inheritance #modelling

Composite EMF Modeling Based on Typed Graphs with Inheritance and Containment Structures (SJ), pp. 397–399.

ICGT-2010-JurackT #component #concept #graph #inheritance

A Component Concept for Typed Graphs with Inheritance and Containment Structures (SJ, GT), pp. 187–202.

ICGT-2010-Khomenko #behaviour

A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes (VK), pp. 75–90.

ICGT-2010-Ujhelyi #model transformation #source code #static typing #type checking

Static Type Checking of Model Transformation Programs (ZU), pp. 413–415.

CHI-2010-KapteinNM #analysis #consistency

Powerful and consistent analysis of likert-type ratingscales (MCK, CN, PM), pp. 2391–2394.

AdaEurope-2010-HongHBB #ada #named #programming #type system

AdaStreams: A Type-Based Programming Extension for Stream-Parallelism with Ada 2005 (GH, KH, BB, JB), pp. 208–221.

EDOC-2010-AtkinsonDG #process #specification

Typed Business Process Specification (CA, DD, VG), pp. 69–78.

ICPR-2010-AdamsWDMBG #feature model #less is more #recognition

Genetic-Based Type II Feature Extraction for Periocular Biometric Recognition: Less is More (JA, DLW, GVD, PEM, KSB, GG), pp. 205–208.

ICPR-2010-ParkKS #detection #markov #modelling #recognition #using #visual notation

Visual Recognition of Types of Structural Corridor Landmarks Using Vanishing Points Detection and Hidden Markov Models (YP, SSK, IHS), pp. 3292–3295.

KDD-2010-ReichartzKP #dependence #kernel #semantics

Semantic relation extraction with kernels over typed dependency trees (FR, HK, GP), pp. 773–782.

KEOD-2010-Akinkunmi

Temporal Entities — Types, Tokens and Qualifications (BOA), pp. 288–294.

SIGIR-2010-KimC #documentation #multi #ranking #using

Ranking using multiple document types in desktop search (JK, WBC), pp. 50–57.

SIGIR-2010-LiuB #information retrieval #multi #personalisation

Personalizing information retrieval for multi-session tasks: the roles of task stage and task type (JL, NJB), pp. 26–33.

ECOOP-2010-BiermanMT #c#

Adding Dynamic Types to C^# (GMB, EM, MT), pp. 76–100.

ECOOP-2010-Hanenberg #developer #empirical #programming #static typing #type system

Doubts about the Positive Impact of Static Type Systems on Programming Tasks in Single Developer Projects — An Empirical Study (SH), pp. 300–303.

ECOOP-2010-HeideggerT #scripting language

Recency Types for Analyzing Scripting Languages (PH, PT), pp. 200–224.

ECOOP-2010-HuKPYH #java #type safety

Type-Safe Eventful Sessions in Java (RH, DK, OP, NY, KH), pp. 329–353.

ECOOP-2010-VaziriTDHV #type system

A Type System for Data-Centric Synchronization (MV, FT, JD, CH, JV), pp. 304–328.

OOPSLA-2010-BurckhardtBL #concurrent #programming

Concurrent programming with revisions and isolation types (SB, AB, DL), pp. 691–707.

OOPSLA-2010-Hanenberg #development #empirical #static typing #type system

An experiment about static and dynamic type systems: doubts about the positive impact of static type systems on development time (SH), pp. 22–35.

OOPSLA-2010-KulkarniLS #pervasive

Task types for pervasive atomicity (AK, YDL, SFS), pp. 671–690.

OOPSLA-2010-MatsakisG #type system

A time-aware type system for data-race protection and guaranteed initialization (NDM, TRG), pp. 634–651.

OOPSLA-2010-OliveiraMO

Type classes as objects and implicits (BCdSO, AM, MO), pp. 341–360.

OOPSLA-2010-WegielK #type safety

Cross-language, type-safe, and transparent object sharing for co-located managed runtimes (MW, CK), pp. 223–240.

TOOLS-EUROPE-2010-CameronN #encoding #java

Encoding Ownership Types in Java (NRC, JN), pp. 271–290.

TOOLS-EUROPE-2010-MadsenE #parametricity

Revisiting Parametric Types and Virtual Classes (ABM, EE), pp. 233–252.

GPCE-J-2007-JungH10 #architecture #component #framework #scalability #specification

A type-centric framework for specifying heterogeneous, large-scale, component-oriented, architectures (GJ, JH), pp. 615–637.

GPCE-2010-MiaoS #incremental #metaprogramming

Incremental type-checking for type-reflective metaprograms (WM, JGS), pp. 167–176.

GPCE-2010-MiddelkoopDS #attribute grammar #type inference

Iterative type inference with attribute grammars (AM, AD, SDS), pp. 43–52.

LOPSTR-2010-VoetsS #analysis #logic programming #source code #using

Non-termination Analysis of Logic Programs Using Types (DV, DDS), pp. 133–148.

PPDP-2010-BaillotH #linear #logic #type inference

Type inference in intuitionistic linear logic (PB, MH), pp. 219–230.

PPDP-2010-BrabrandT #ambiguity #pattern matching #regular expression #string #using

Typed and unambiguous pattern matching on strings using regular expressions (CB, JGT), pp. 243–254.

PPDP-2010-Jeltsch #combinator #static typing #type checking

Generic record combinators with static type checking (WJ), pp. 143–154.

PPDP-2010-SnowBN #approach #logic programming #metaprogramming

A meta-programming approach to realizing dependently typed logic programming (ZS, DB, GN), pp. 187–198.

PADL-2010-Iborra #exception #haskell

Explicitly Typed Exceptions for Haskell (JI), pp. 43–57.

POPL-2010-BhargavanFG #composition #protocol #security #type system #verification

Modular verification of security protocol code by typing (KB, CF, ADG), pp. 445–456.

POPL-2010-GayVRGC #composition #distributed #object-oriented #programming

Modular session types for distributed object-oriented programming (SJG, VTV, AR, NG, AZC), pp. 299–312.

POPL-2010-JiaZSW #dependent type #equivalence

Dependent types and program equivalence (LJ, JZ, VS, SW), pp. 275–286.

POPL-2010-RondonKJ #low level

Low-level liquid types (PMR, MK, RJ), pp. 131–144.

POPL-2010-SchaferM #datalog #type inference

Type inference for datalog with complex type hierarchies (MS, OdM), pp. 145–156.

POPL-2010-SuterDK #abstraction #algebra #data type

Decision procedures for algebraic data types with abstractions (PS, MD, VK), pp. 199–210.

POPL-2010-Terauchi #dependent type

Dependent types from counterexamples (TT), pp. 119–130.

POPL-2010-WrigstadNLOV #scripting language

Integrating typed and untyped code in a scripting language (TW, FZN, SL, JÖ, JV), pp. 377–388.

SAC-2010-AhmedLSH #identification #performance

Fast file-type identification (IA, KsL, HS, MH), pp. 1601–1602.

FSE-2010-ErnstA #type system #using

Building and using pluggable type systems (MDE, MA), pp. 375–376.

FSE-2010-KneussSK #named #php

Phantm: PHP analyzer for type mismatch (EK, PS, VK), pp. 373–374.

LDTA-2009-BaarsSV10

Typed Transformations of Typed Grammars: The Left Corner Transform (AIB, SDS, MV), pp. 51–64.

LDTA-2010-BrandMSH #case study #domain-specific language #experience

Formally specified type checkers for domain specific languages: experience report (MvdB, APvdM, AS, ATH), p. 12.

LDTA-2010-HoldermansH #on the #program transformation #type system

On the rôle of minimal typing derivations in type-driven program transformation (SH, JH), p. 2.

SPLC-2010-ElsnerULS #bound #consistency #product line

Consistent Product Line Configuration across File Type and Product Line Boundaries (CE, PU, DL, WSP), pp. 181–195.

CC-2010-LogozzoV #abstract interpretation #agile #analysis #javascript #named #optimisation

RATA: Rapid Atomic Type Analysis by Abstract Interpretation — Application to JavaScript Optimization (FL, HV), pp. 66–83.

HPDC-2010-PerryS #communication #data type

Improving MPI communication via data type fission (BP, DMS), pp. 352–355.

CAV-2010-KawaguchiRJ #named #safety #verification

Dsolve: Safety Verification via Liquid Types (MK, PMR, RJ), pp. 123–126.

CSL-2010-Pous #algebra #linear #logic #proving

Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic (DP), pp. 484–498.

ICLP-2010-Snow10 #λ-calculus

Realizing the Dependently Typed λ Calculus (ZS), pp. 294–299.

IJCAR-2010-ShermanGD #partial order #type system

A Slice-Based Decision Procedure for Type-Based Partial Orders (ES, BJG, MBD), pp. 156–170.

LICS-2010-SilesH #similarity #type system

Equality Is Typable in Semi-full Pure Type Systems (VS, HH), pp. 21–30.

RTA-2010-FujitaS #problem #system f

The Undecidability of Type Related Problems in Type-free Style System F (KeF, AS), pp. 103–118.

VMCAI-2010-HenzingerHKV #invariant #matrix #type inference

Invariant and Type Inference for Matrices (TAH, TH, LK, AV), pp. 163–179.

ASE-2009-AnCF #ruby #static typing #type system

Static Typing for Ruby on Rails (Jh(A, AC, JSF), pp. 590–594.

ASE-2009-MunkbyS #fault tolerance #predict #type inference

Type Inference for Soft-Error Fault-Tolerance Prediction (GM, SS), pp. 65–75.

CASE-2009-KhawP #assembly #multi #optimisation #problem

Multi-rule multi-objective Ant Colony Optimization for straight and U-type assembly line balancing problem (CLEK, SGP), pp. 177–182.

HT-2009-AlfordM #process #research

Scholarly research process: investigating the effects of link type and directionality (MLA, EM), pp. 99–108.

ICDAR-2009-BenjelilKMA #identification

Arabic and Latin Script Identification in Printed and Handwritten Types Based on Steerable Pyramid Features (MB, SK, RM, AMA), pp. 591–595.

ICDAR-2009-LinsSSFSST #classification #documentation #image #quality

Image Classification to Improve Printing Quality of Mixed-Type Documents (RDL, GPeS, SJS, JF, MQS, PS, MT), pp. 1106–1110.

ICDAR-2009-Rodriguez-SerranoP #image #query #retrieval #word

Handwritten Word Image Retrieval with Synthesized Typed Queries (JARS, FP), pp. 351–355.

SIGMOD-2009-LiJLF #approach #performance #relational

Efficient type-ahead search on relational data: a TASTIER approach (GL, SJ, CL, JF), pp. 695–706.

SIGMOD-2009-YalamanchiG #data type

Compensation-aware data types in RDBMS (AY, DG), pp. 931–938.

ESOP-2009-CairesV

Conversation Types (LC, HTV), pp. 285–300.

ESOP-2009-CraciunCHQ #parametricity

An Interval-Based Inference of Variant Parametric Types (FC, WNC, GH, SQ), pp. 112–127.

ESOP-2009-KikuchiK #authentication #automation #encryption #protocol #type system #verification

Type-Based Automated Verification of Authenticity in Cryptographic Protocols (DK, NK), pp. 222–236.

ESOP-2009-LakinP #functional #higher-order #induction #programming

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming (MRL, AMP), pp. 47–61.

ESOP-2009-MostrousYH #commutative #type system

Global Principal Typing in Partially Commutative Asynchronous Sessions (DM, NY, KH), pp. 316–332.

ESOP-2009-WadlerF #source code

Well-Typed Programs Can’t Be Blamed (PW, RBF), pp. 1–16.

FASE-2009-HermannEE #graph #inheritance #network #security

Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks (FH, HE, CE), pp. 325–339.

FoSSaCS-2009-BirkedalST #morphism #parametricity #polymorphism #recursion #semantics

Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (LB, KS, JT), pp. 456–470.

ICPC-2009-TroshinaCF #decompiler #re-engineering

Profile-based type reconstruction for decompilation (KT, AC, AF), pp. 263–267.

SCAM-2009-Gode #evolution

Evolution of Type-1 Clones (NG), pp. 77–86.

SCAM-2009-TiarksKF #assessment #detection #state of the art #tool support

An Assessment of Type-3 Clones as Detected by State-of-the-Art Tools (RT, RK, RF), pp. 67–76.

WCRE-1999-BernardiL99a #analysis #identification #named #object-oriented

ConAn: A Tool for the Identification of Crosscutting Concerns in Object Oriented Systems Based on Type Hierarchy Analysis (MLB, GADL), pp. 319–320.

WCRE-1999-MerloL99a

Computing Structural Types of Clone Syntactic Blocks (EM, TL), pp. 274–278.

PEPM-2009-BoustaniH #error message #fault #java

Improving type error messages for generic java (NEB, JH), pp. 131–140.

PEPM-2009-FradeSU #analysis #bidirectional #data flow

Bidirectional data-flow analyses, type-systematically (MJF, AS, TU), pp. 141–150.

PEPM-2009-MatsudaHT #type system #xml

Type-based specialization of xml transformations (KM, ZH, MT), pp. 61–72.

PEPM-2009-SalamaMTGO #consistency #dependent type #using

Static consistency checking for verilog wire interconnects: using dependent types to check the sanity of verilog descriptions (CS, GM, WT, JG, JO), pp. 121–130.

PLDI-2009-GalESAMHKHZORSRBCF

Trace-based just-in-time type specialization for dynamic languages (AG, BE, MS, DA, DM, MRH, BK, GH, BZ, JO, JR, EWS, RR, MB, MC, MF), pp. 465–478.

PLDI-2009-KawaguchiRJ #data type #type system #verification

Type-based data structure verification (MK, PMR, RJ), pp. 304–315.

PLDI-2009-RendelOH #self

Typed self-representation (TR, KO, CH), pp. 293–303.

SAS-2009-JensenMT #analysis #javascript

Type Analysis for JavaScript (SHJ, AM, PT), pp. 238–255.

ICALP-v1-2009-AubrunB #decidability #finite

Decidability of Conjugacy of Tree-Shifts of Finite Type (NA, MPB), pp. 132–143.

ICALP-v2-2009-AcciaiB #behaviour #infinity #safety #π-calculus

Deciding Safety Properties in Infinite-State π-Calculus via Behavioural Types (LA, MB), pp. 31–42.

LATA-2009-MitranaT #network #on the

On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes (VM, BT), pp. 588–600.

SFM-2009-CarboneYH #exception #interactive #multi

Asynchronous Session Types: Exceptions and Multiparty Interactions (MC, NY, KH), pp. 187–212.

SFM-2009-Vasconcelos

Fundamentals of Session Types (VTV), pp. 158–186.

CEFP-2009-Kennedy #theory and practice

Types for Units-of-Measure: Theory and Practice (AK), pp. 268–305.

ICFP-2009-RompfMO #continuation #implementation #polymorphism

Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform (TR, IM, MO), pp. 317–328.

ICFP-2009-SchrijversJSV #data type #decidability #type inference

Complete and decidable type inference for GADTs (TS, SLPJ, MS, DV), pp. 341–352.

ICFP-2009-SculthorpeN #dependent type #functional #programming

Safe functional reactive programming through dependent types (NS, HN), pp. 23–34.

ICFP-2009-SwamyHB #formal method

A theory of typed coercions and its applications (NS, MWH, GMB), pp. 329–340.

ICFP-2009-Voigtlander #functional #theorem

Free theorems involving type constructor classes: functional pearl (JV), pp. 173–184.

CHI-2009-HoffmannSB #fault #named

TypeRight: a keyboard with tactile error prevention (AH, DS, JOB), pp. 2265–2268.

CHI-2009-MajarantaAS #performance #type system

Fast gaze typing with an adjustable dwell time (PM, UKA, OS), pp. 357–360.

HCI-VAD-2009-LeeC #game studies #information management #online

The Effects of Quest Types and Gaming Motivations on Players’ Knowledge Acquisitions in an Online Role-Playing Game Environment (JL, CYC), pp. 353–358.

HIMI-II-2009-HiremathPFFY #comparison

Comparison of Pilot Recovery and Response Times in Two Types of Cockpits (VH, RWP, ROF, RGF, JPY), pp. 766–775.

SIGAda-2009-Mentis #ada #api #type safety

A robotics API dialect for type-safe robots: translating Myro to Ada (ASM), pp. 91–102.

EDOC-2009-AtkinsonB #development #towards

Towards a Client-Oriented Model of Types and States in Service-Oriented Development (CA, PB), pp. 119–127.

ICEIS-DISI-2009-AmiratO #architecture #first-order #metamodelling #named

C3: A Metamodel for Architecture Description Language based on First-order Connector Types (AA, MO), pp. 76–81.

CIKM-2009-ColazzoGPS #linear #regular expression #xml

Linear inclusion for XML regular expression types (DC, GG, LP, CS), pp. 137–146.

CIKM-2009-PinchakRL #information retrieval #type system

Answer typing for information retrieval (CP, DR, DL), pp. 1955–1958.

KDIR-2009-NettletonMM #case study #evaluation #image #internet

User Study of the Assignment of Objective and Subjective Type Tags to Images in Internet — Evaluation for Native and non Native English Language Taggers (DFN, MCM, BML), pp. 99–104.

SEKE-2009-MitaniMIBMM #empirical #feedback #metric

An Empirical Study of the Feedback of the In-process Measurement in a Japanese Consortium-type Software Project (YM, TM, KI, MB, AM, KiM), pp. 631–636.

SIGIR-2009-GuanBMCW #graph #multi #personalisation #ranking #recommendation #using

Personalized tag recommendation using graph-based ranking on multi-type interrelated objects (ZG, JB, QM, CC, CW), pp. 540–547.

SIGIR-2009-Schanda #detection

Novelty detection across different source types and languages (JS), p. 854.

SIGIR-2009-WangLF #automation #fuzzy #predict #using

Automatic URL completion and prediction using fuzzy type-ahead search (JW, GL, JF), pp. 634–635.

ICMT-2009-VignagaJBB #model management #type system

Typing in Model Management (AV, FJ, MCB, HB), pp. 197–212.

MoDELS-2009-CuccuruRGT #classification #parametricity #uml

Constraining Type Parameters of UML 2 Templates with Substitutable Classifiers (AC, AR, SG, FT), pp. 644–649.

MoDELS-2009-CuccuruRGT #classification #parametricity #uml

Constraining Type Parameters of UML 2 Templates with Substitutable Classifiers (AC, AR, SG, FT), pp. 644–649.

ECOOP-2009-AnconaL #induction #object-oriented #type system

Coinductive Type Systems for Object-Oriented Languages (DA, GL), pp. 2–26.

ECOOP-2009-HaackP #flexibility #type system

Type-Based Object Immutability with Flexible Initialization (CH, EP), pp. 520–545.

ECOOP-2009-Jones #haskell #what #why

Classes, Jim, But Not as We Know Them — Type Classes in Haskell: What, Why, and Whither (SLPJ), p. 1.

OOPSLA-2009-BocchinoADAHKOSSV #java #parallel

A type and effect system for deterministic parallel Java (RLBJ, VSA, DD, SVA, SH, RK, JO, PS, HS, MV), pp. 97–116.

OOPSLA-2009-DucournauMP #assessment #empirical #implementation #inheritance #multi #object-oriented #static typing #type system

Empirical assessment of object-oriented implementations with multiple inheritance and static typing (RD, FM, JP), pp. 41–60.

OOPSLA-2009-FurrAF #scripting language #static typing #type system

Profile-guided static typing for dynamic scripting languages (MF, Jh(A, JSF), pp. 283–300.

OOPSLA-2009-SaitoI

Self type constructors (CS, AI), pp. 263–282.

GPCE-2009-GarciaL #metaprogramming #towards

Toward foundations for type-reflective metaprogramming (RG, AL), pp. 25–34.

PPDP-2009-BiernackaB #proving #termination

Context-based proofs of termination for typed delimited-control operators (MB, DB), pp. 289–300.

PPDP-2009-CastagnaDGP

Foundations of session types (GC, MDC, EG, LP), pp. 219–230.

PPDP-2009-UnnoK #dependent type #type inference

Dependent type inference with interpolants (HU, NK), pp. 277–288.

PPDP-2009-Vasconcelos #functional #linear #parallel #programming #thread

Session types for linear multithreaded functional programming (VTV), pp. 1–6.

PADL-2009-ZookPS #datalog

Typed Datalog (DZ, EP, BSS), pp. 168–182.

POPL-2009-ConditHLQ #low level #type checking

Unifying type checking and property checking for low-level code (JC, BH, SKL, SQ), pp. 302–314.

POPL-2009-Kobayashi #higher-order #recursion #source code #verification

Types and higher-order recursion schemes for verification of higher-order programs (NK), pp. 416–428.

POPL-2009-Leijen #flexibility #morphism #polymorphism #robust #type inference

Flexible types: robust type inference for first-class polymorphism (DL), pp. 66–77.

POPL-2009-MontaguR #data type #modelling

Modeling abstract types in modules with open existential types (BM, DR), pp. 354–365.

POPL-2009-QiM

Masked types for sound object initialization (XQ, ACM), pp. 53–65.

POPL-2009-Simpson #linear

Linear types for computational effects (AS), p. 301.

SAC-2009-BriggsA #algebra #constraints #parametricity #specification

Algebraic specification techniques for parametric types with logic-based constraints (DB, SA), pp. 1890–1897.

SAC-2009-FurrAFH #ruby #static typing #type inference

Static type inference for Ruby (MF, Jh(A, JSF, MWH), pp. 1859–1866.

SAC-2009-GroppeNL #java #named #query #rdf #satisfiability #semantics #type safety #web

SWOBE — embedding the semantic web languages RDF, SPARQL and SPARUL into java for guaranteeing type safety, for checking the satisfiability of queries and for the determination of query result types (SG, JN, VL), pp. 1239–1246.

SAC-2009-SaitoI #type system

Matching ThisType to subtyping (CS, AI), pp. 1851–1858.

SAC-2009-Tarau #data type #finite #haskell #morphism

Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell (PT), pp. 1898–1902.

ICSE-2009-SantelicesJYH #lightweight #multi #using

Lightweight fault-localization using multiple coverage types (RAS, JAJ, YY, MJH), pp. 56–66.

CSL-2009-Abel #evaluation #normalisation

Typed Applicative Structures and Normalization by Evaluation for System Fω (AA0), pp. 40–54.

CSL-2009-BlanquiR #on the #semantics #termination

On the Relation between Sized-Types Based Termination and Semantic Labelling (FB, CR), pp. 147–162.

CSL-2009-Coquand #type system

Forcing and Type Theory (TC), p. 2.

CSL-2009-Dezani-CiancagliniGR #quantifier

Intersection, Universally Quantified, and Reference Types (MDC, PG, SRDR), pp. 209–224.

CSL-2009-EggerMS #calculus #linear

Enriching an Effect Calculus with Linear Types (JE, REM, AS), pp. 240–254.

CSL-2009-HofmannR #analysis #performance

Efficient Type-Checking for Amortised Heap-Space Analysis (MH, DR), pp. 317–331.

ICLP-2009-HildebrandtL #concurrent #constraints #pattern matching #programming

Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming (TTH, HAL), pp. 417–431.

ICST-2009-FuGX #testing #user interface

Inferring Types of References to GUI Objects in Test Scripts (CF, MG, QX), pp. 1–10.

LICS-2009-BasaldellaF #exponential #interactive

Ludics with Repetitions (Exponentials, Interactive Types and Completeness) (MB, CF), pp. 375–384.

LICS-2009-KobayashiO #calculus #higher-order #model checking #recursion #type system #μ-calculus

A Type System Equivalent to the Modal μ-Calculus Model Checking of Higher-Order Recursion Schemes (NK, CHLO), pp. 179–188.

RTA-2009-KimuraT #calculus #induction

Dual Calculus with Inductive and Coinductive Types (DK, MT), pp. 224–238.

TLCA-2009-AbelCP #algorithm #composition #proving #type system

A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance (AA, TC, MP), pp. 5–19.

TLCA-2009-AwodeyR #semantics #type system

Kripke Semantics for Martin-Löf’s Extensional Type Theory (SA, FR), pp. 249–263.

TLCA-2009-FujitaS #type system

Existential Type Systems with No Types in Terms (KeF, AS), pp. 112–126.

TLCA-2009-LovasP #proving #refinement

Refinement Types as Proof Irrelevance (WL, FP), pp. 157–171.

TLCA-2009-Lumsdaine #type system

Weak ω-Categories from Intensional Type Theory (PLL), pp. 172–187.

TLCA-2009-Petit #polymorphism #type system #λ-calculus

A Polymorphic Type System for the λ-Calculus with Constructors (BP), pp. 234–248.

TLCA-2009-Urzyczyn #rank

Inhabitation of Low-Rank Intersection Types (PU), pp. 356–370.

ECSA-2008-SoriaPC #architecture #evolution

Managing Dynamic Evolution of Architectural Types (CCS, JP, JÁC), pp. 281–289.

WICSA-2008-Aldrich #architecture #using

Using Types to Enforce Architectural Structure (JA), pp. 211–220.

ASE-2008-FluriGG

Discovering Patterns of Change Types (BF, EG, HCG), pp. 463–466.

ASE-2008-KastnerA #approach #formal method #product line

Type-Checking Software Product Lines — A Formal Approach (CK, SA), pp. 258–267.

DAC-2008-ChangHHLWL

Type-matching clock tree for zero skew clock gating (CMC, SHH, YKH, JZL, HPW, YSL), pp. 714–719.

PODS-2008-MoorSAV #datalog #optimisation #query #type inference

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

Type inference and type checking for queries on execution traces (DD, TM), pp. 352–363.

ITiCSE-2008-Bower08a #taxonomy

A taxonomy of task types in computing (MB), pp. 281–285.

ITiCSE-2008-ThorntonE #data flow #data type #online

A data type to exploit online data sources (MT, SHE), pp. 114–118.

ESOP-2008-Boudol #type system

Typing Safe Deallocation (GB), pp. 116–130.

ESOP-2008-PetersenBNM #hoare #type system

A Realizability Model for Impredicative Hoare Type Theory (RLP, LB, AN, GM), pp. 337–352.

ESOP-2008-PoswolskyS #dependent type #encoding #higher-order #programming

Practical Programming with Higher-Order Encodings and Dependent Types (AP, CS), pp. 93–107.

FoSSaCS-2008-BarrasB #calculus #dependent type #programming language

The Implicit Calculus of Constructions as a Programming Language with Dependent Types (BB, BB), pp. 365–379.

FoSSaCS-2008-Mishra-LingerS #morphism #polymorphism #type system

Erasure and Polymorphism in Pure Type Systems (NML, TS), pp. 350–364.

FoSSaCS-2008-Walukiewicz

Finding Your Way in a Forest: On Different Types of Trees and Their Properties (IW), pp. 1–4.

CSMR-2008-TsantalisCC #identification #named #smell

JDeodorant: Identification and Removal of Type-Checking Bad Smells (NT, TC, AC), pp. 329–331.

ICSM-2008-KinneerR #algorithm #control flow #java #maintenance #representation #type inference

Assessing the usefulness of type inference algorithms in representing Java control flow to support software maintenance tasks (AK, GR), pp. 127–136.

SCAM-2008-Mihancea #approach #re-engineering #visual notation

Type Highlighting: A Client-Driven Visual Approach for Class Hierarchies Reengineering (PFM), pp. 207–216.

WCRE-2008-DolgovaC #automation #c #re-engineering #source code

Automatic Type Reconstruction in Disassembled C Programs (KD, AC), pp. 202–206.

PEPM-2008-GillenwaterMSZTGO #hardware #static typing #using

Synthesizable high level hardware descriptions: using statically typed two-level languages to guarantee verilog synthesizability (JG, GM, CS, AYZ, WT, JG, JO), pp. 41–50.

PEPM-2008-KameyamaKS #staged

Closing the stage: from staged code to typed closures (YK, OK, CcS), pp. 147–157.

PEPM-2008-PietrzakCPH #analysis #composition #prolog #source code #verification

A practical type analysis for verification of modular prolog programs (PP, JC, GP, MVH), pp. 61–70.

PLDI-2008-ChenHPECCP #compilation #object-oriented #optimisation #scalability

Type-preserving compilation for large-scale optimizing object-oriented compilers (JC, CH, FP, ME, JC, DC, PP), pp. 183–192.

PLDI-2008-RondonKJ

Liquid types (PMR, MK, RJ), pp. 159–169.

PLDI-2008-WegielK #communication #coordination #memory management #named #type safety

XMem: type-safe, transparent, shared memory for cross-runtime communication and coordination (MW, CK), pp. 327–338.

SAS-2008-CominiDV #abstract interpretation #on the #polymorphism #recursion #type system

On Polymorphic Recursion, Type Systems, and Abstract Interpretation (MC, FD, SV), pp. 144–158.

SAS-2008-RuggieriM #constraints #linear #source code #type system

Typing Linear Constraints for Moding CLP() Programs (SR, FM), pp. 128–143.

FLOPS-2008-AbelCD #algebra #on the #proving #type system

On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory (AA, TC, PD), pp. 3–13.

FLOPS-2008-Benton #declarative #dynamic typing #type system

Undoing Dynamic Typing (Declarative Pearl) (NB), pp. 224–238.

FLOPS-2008-KameyamaY #continuation

Typed Dynamic Control Operators for Delimited Continuations (YK, TY), pp. 239–254.

FLOPS-2008-Kobayashi #program analysis #type system

Substructural Type Systems for Program Analysis (NK), p. 14.

FLOPS-2008-Tatsuta #normalisation

Types for Hereditary Head Normalizing Terms (MT), pp. 195–209.

FLOPS-2008-UnnoK #dependent type #on-demand #refinement

On-Demand Refinement of Dependent Types (HU, NK), pp. 81–96.

FLOPS-2008-Yokouchi #algorithm #analysis #difference #lazy evaluation #strict

Strictness Analysis Algorithms Based on an Inequality System for Lazy Types (HY), pp. 255–271.

AFL-2008-JurgensenM #morphism

Homomorphisms Preserving Types of Density (HJ, IM), pp. 183–194.

ICALP-B-2008-BergerHY #abstraction #logic #mobile #process

Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes (MB, KH, NY), pp. 99–111.

LATA-2008-BechetDFG

Optional and Iterated Types for Pregroup Grammars (DB, AJD, AF, EG), pp. 88–100.

AFP-2008-Norell08 #programming

Dependently Typed Programming in Agda (UN), pp. 230–266.

ICFP-2008-AhmedB #equivalence

Typed closure conversion preserves observational equivalence (AA, MB), pp. 157–168.

ICFP-2008-CastagnaN #xml

Typed iterators for XML (GC, KN), pp. 15–26.

ICFP-2008-GuillemetteM #compilation #haskell

A type-preserving compiler in Haskell (LJG, SM), pp. 75–86.

ICFP-2008-Krauss #data type #problem #recursion

Pattern minimization problems over recursive data types (AK), pp. 267–274.

ICFP-2008-Leijen #morphism #named #polymorphism #type inference

HMF: simple type inference for first-class polymorphism (DL), pp. 283–294.

ICFP-2008-NanevskiMSGB #dependent type #imperative #named #source code

Ynot: dependent types for imperative programs (AN, GM, AS, PG, LB), pp. 229–240.

ICFP-2008-RemyY #constraints #ml #performance #type inference

From ML to ML^F: graphic type constraints with efficient type inference (DR, BY), pp. 63–74.

ICFP-2008-SchrijversJCS #type checking

Type checking with open type functions (TS, SLPJ, MMTC, MS), pp. 51–62.

IFL-2008-LijnseP #automation #data type #database #programming #relational #using

Between Types and Tables — Using Generic Programming for Automated Mapping between Data Types and Relational Databases (BL, RP), pp. 272–290.

IFL-2008-TellerSV #fault #lightweight #ml #performance #polymorphism #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.

IFL-2008-TrojahnerG #array #dependent type #representation

Descriptor-Free Representation of Arrays with Dependent Types (KT, CG), pp. 100–117.

GT-VMT-2006-HermannET08 #diagrams #graph grammar #inheritance #sequence chart #syntax #uml

A Typed Attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams (FH, HE, GT), pp. 261–269.

GT-VC-2007-BruniBGM08 #architecture #graph grammar #modelling #using

Modelling Dynamic Software Architectures using Typed Graph Grammars (RB, AB, SG, HCM), pp. 39–53.

GT-VMT-2008-AzabP #c++ #graph #source code #type checking

Type Checking C++ Template Instantiation by Graph Programs (KA, KHP).

GT-VMT-2008-Xing #graph #representation

A Graph-Based Type Representation for Objects (CCX).

CHI-2008-ClawsonLRIS #automation #fault #type system #using

Automatic whiteout++: correcting mini-QWERTY typing errors using keypress timing (JC, KL, AR, RAI, TS), pp. 573–582.

CHI-2008-GeyerDDMBM #reuse #social

Use and reuse of shared lists as a social content type (WG, CD, JMD, DRM, BB, MJM), pp. 1545–1554.

CHI-2008-MorrisBM #named #type system #using

SuperBreak: using interactivity to enhance ergonomic typing breaks (DM, AJBB, BM), pp. 1817–1826.

AdaEurope-2008-VilloingB #database #interface #type safety

A Type-Safe Database Interface (FV, EB), pp. 144–157.

CIKM-2008-StroeBNP #approach #approximate #string

An approximate string matching approach for handling incorrectly typed urls (MS, RB, CN, DP), pp. 1339–1340.

ICPR-2008-LuiC #multi

Three related types of multi-value association patterns (TWHL, DKYC), pp. 1–4.

SIGIR-2008-ValletZ #approach #query #semantics

Inferring the most important types of a query: a semantic approach (DV, HZ), pp. 857–858.

SIGIR-2008-ZhangHZ #clustering #comparative #documentation #evaluation

A comparative evaluation of different link types on enhancing document clustering (XZ, XH, XZ), pp. 555–562.

ECOOP-2008-RajanL #named #quantifier

Ptolemy: A Language with Quantified, Typed Events (HR, GTL), pp. 155–179.

ECOOP-2008-SrinivasanM #java #named

Kilim: Isolation-Typed Actors for Java (SS, AM), pp. 104–128.

OOPSLA-2008-BellamyAMS #performance #type inference

Efficient local type inference (BB, PA, OdM, DS), pp. 475–492.

OOPSLA-2008-GilM #java #named #type system

Whiteoak: introducing structural typing into java (JYG, IM), pp. 73–90.

OOPSLA-2008-NystromSPG #object-oriented

Constrained types for object-oriented languages (NN, VAS, JP, CG), pp. 457–474.

OOPSLA-2008-OliveiraWG #component #reuse #type safety #visitor

The visitor pattern as a reusable, generic, type-safe component (BCdSO, MW, JG), pp. 439–456.

OOPSLA-2008-RobersonHDB #model checking #performance #type system

Efficient software model checking of soundness of type systems (MR, MH, PTD, CB), pp. 493–504.

OOPSLA-2008-SmithC #java #question #type inference

Java type inference is broken: can we fix it? (DS, RC), pp. 505–524.

TOOLS-EUROPE-2008-NielsenE #composition #optimisation #static typing

Optimizing Dynamic Class Composition in a Statically Typed Language (ABN, EE), pp. 161–177.

GPCE-2008-LienhardtSS #communication #component #type system

Typing communicating component assemblages (ML, AS, JBS), pp. 125–136.

LOPSTR-2008-SchrijversBG #polymorphism

From Monomorphic to Polymorphic Well-Typings and Beyond (TS, MB, JPG), pp. 152–167.

PPDP-2008-BenzakenCCM #programming #query #visual notation #xml

Pattern by example: type-driven visual programming of XML queries (VB, GC, DC, CM), pp. 131–142.

PPDP-2008-Lu #dependence #logic programming #polymorphism #precise #source code

Inferring precise polymorphic type dependencies in logic programs (LL), pp. 143–151.

PPDP-2008-MontenegroPS #correctness #memory management #proving #type system

A type system for safe memory management and its proof of correctness (MM, RP, CS), pp. 152–162.

POPL-2008-AlaviGG #encoding

Extensible encoding of type hierarchies (HSA, SG, RG), pp. 349–358.

POPL-2008-FournetR #data flow #encryption #implementation #security

Cryptographically sound implementations for typed information-flow security (CF, TR), pp. 323–335.

POPL-2008-HondaYC #multi

Multiparty asynchronous session types (KH, NY, MC), pp. 273–284.

POPL-2008-Pientka #higher-order #programming #syntax

A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions (BP), pp. 371–382.

POPL-2008-Tobin-HochstadtF #design #implementation

The design and implementation of typed scheme (STH, MF), pp. 395–406.

SAC-2008-BaveraB #analysis #bytecode #data flow #policy #type system

Type-based information flow analysis for bytecode languages with variable object field policies (FB, EB), pp. 347–351.

SAC-2008-CimadamoreV #java #prolog #type inference

Integrating Java and Prolog through generic methods and type inference (MC, MV), pp. 198–205.

SAC-2008-LucasCD #classification #fuzzy

General type-2 fuzzy classifiers to land cover classification (LAL, TMC, MRD), pp. 1743–1747.

SAC-2008-SchroederM #logic #xml

Conversion of generalization hierarchies and union types from extended entity-relationship model to an XML logical model (RS, RdSM), pp. 1036–1037.

CC-2008-MalePPD #bytecode #java #verification

Java Bytecode Verification for @NonNull Types (CM, DJP, AP, CD), pp. 229–244.

CGO-2008-MurphyMSSA #type safety

Fault-safe code motion for type-safe languages (BRM, VM, FTS, TS, ARAT), pp. 144–154.

LCTES-2008-DelavalGP #automation #data flow #higher-order #source code #type system

A type system for the automatic distribution of higher-order synchronous dataflow programs (GD, AG, MP), pp. 101–110.

PPoPP-2008-ChandraSSB #analysis #data type #distributed #locality #type inference

Type inference for locality analysis of distributed data structures (SC, VAS, VS, RB), pp. 11–22.

CAV-2008-KobayashiS #hybrid #mobile #process #type system

A Hybrid Type System for Lock-Freedom of Mobile Processes (NK, DS), pp. 80–93.

CSL-2008-BartheGR #termination #type system

Type-Based Termination with Sized Products (GB, BG, CR), pp. 493–507.

CSL-2008-Dezani-CiancagliniCGT #morphism #on the

On Isomorphisms of Intersection Types (MDC, RDC, EG, MT), pp. 461–477.

CSL-2008-HermantL #approach #axiom #semantics

A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (OH, JL), pp. 169–183.

CSL-2008-NakazawaTKN #λ-calculus

Undecidability of Type-Checking in Domain-Free Typed λ-Calculi with Existence (KN, MT, YK, HN), pp. 478–492.

ICLP-2008-SchrijversCWD #prolog #towards

Towards Typed Prolog (TS, VSC, JW, BD), pp. 693–697.

ISSTA-2008-PapiACPE #java

Practical pluggable types for java (MMP, MA, TLCJ, JHP, MDE), pp. 201–212.

LICS-2008-Burel #deduction #first-order #representation #type system #using

A First-Order Representation of Pure Type Systems Using Superdeduction (GB), pp. 253–263.

LICS-2008-LassenL #bisimulation #morphism #normalisation #parametricity #polymorphism

Typed Normal Form Bisimulation for Parametric Polymorphism (SBL, PBL), pp. 341–352.

LICS-2008-Tatsuta

Types for Hereditary Permutators (MT), pp. 83–92.

TAP-2008-DunetsSR #analysis #bound #data type #relational

Bounded Relational Analysis of Free Data Types (AD, GS, WR), pp. 99–115.

CASE-2007-KavakliogluK #fuzzy

A Type-2 Fuzzy Planner with Semi Qualitative World Model for Robocup Domain (CK, OK), pp. 795–799.

ITiCSE-2007-GalpinSC #learning #student

Learning styles and personality types of computer science students at a South African university (VCG, IDS, PyC), pp. 201–205.

WRLA-J-2004-CervesatoS07 #dependent type #logic #representation #specification

Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types (IC, MOS), pp. 3–35.

ESOP-2007-BlanquiHW #data type #implementation #on the

On the Implementation of Construction Functions for Non-free Concrete Data Types (FB, TH, PW), pp. 95–109.

ESOP-2007-ConditHAGN #dependent type #low level #programming

Dependent Types for Low-Level Programming (JC, MH, ZRA, DG, GCN), pp. 520–535.

ESOP-2007-DreyerB #composition #source code

Principal Type Schemes for Modular Programs (DD, MB), pp. 441–457.

ESOP-2007-KnowlesF #re-engineering #refinement

Type Reconstruction for General Refinement Types (KLK, CF), pp. 505–519.

ESOP-2007-KuanMF #semantics #type inference

A Rewriting Semantics for Type Inference (GK, DM, RBF), pp. 426–440.

ESOP-2007-NanevskiAMB #data type #hoare #type system

Abstract Predicates and Mutable ADTs in Hoare Type Theory (AN, AA, GM, LB), pp. 189–204.

ESOP-2007-Pitts #equivalence #higher-order

Techniques for Contextual Equivalence in Higher-Order, Typed Languages (AMP), p. 1.

ESOP-2007-SuenagaK #analysis #calculus #concurrent #type system

Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts (KS, NK), pp. 490–504.

FASE-2007-BachFS #eclipse #plugin #programming

Declared Type Generalization Checker: An Eclipse Plug-In for Systematic Programming with More General Types (MB, FF, FS), pp. 117–120.

FoSSaCS-2007-AlvesFFM

Iterator Types (SA, MF, MF, IM), pp. 17–31.

FoSSaCS-2007-BartolettiDFZ #analysis #resource management

Types and Effects for Resource Usage Analysis (MB, PD, GLF, RZ), pp. 32–47.

TACAS-2007-AnandOH #analysis #execution #program transformation #symbolic computation

Type-Dependence Analysis and Program Transformation for Symbolic Execution (SA, AO, MJH), pp. 117–133.

TACAS-2007-JhalaMX #type inference

State of the Union: Type Inference Via Craig Interpolation (RJ, RM, RGX), pp. 553–567.

ICSM-2007-KhatchadourianSR #automation #java #legacy #refactoring

Automated Refactoring of Legacy Java Software to Enumerated Types (RK, JS, AR), pp. 224–233.

PEPM-2007-FogartyPST #exclamation #named

Concoqtion: indexed types now! (SF, EP, JGS, WT), pp. 112–121.

PLDI-2007-BurckhardtAM #concurrent #consistency #data type #memory management #modelling #named

CheckFence: checking consistency of concurrent data types on relaxed memory models (SB, RA, MMKM), pp. 12–21.

PLDI-2007-Chlipala #assembly #compilation #λ-calculus

A certified type-preserving compiler from λ calculus to assembly language (AC), pp. 54–65.

PLDI-2007-GenevesLS #performance #static analysis #xml

Efficient static analysis of XML paths and types (PG, NL, AS), pp. 342–351.

PLDI-2007-LernerFGC #error message

Searching for type-error messages (BSL, MF, DG, CC), pp. 425–434.

PLDI-2007-PerryMRLAW #assembly #fault tolerance

Fault-tolerant typed assembly language (FP, LWM, GAR, JL, DIA, DW), pp. 42–53.

SAS-2007-ChenWWKC #aspect-oriented #compilation #functional

A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages (KC, SCW, MW, SCK, CHC), pp. 34–51.

SAS-2007-Tip #constraints #refactoring #using

Refactoring Using Type Constraints (FT), pp. 1–17.

ICALP-2007-KobayashiS #behaviour #calculus #type system

Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π -Calculus (NK, TS), pp. 740–751.

IFM-2007-FaberJS #data type #parametricity #specification #verification

Verifying CSP-OZ-DC Specifications with Complex Data Types and Timing Parameters (JF, SJ, VSS), pp. 233–252.

IFM-2007-Toben #communication #data type #reduction

Non-interference Properties for Data-Type Reduction of Communicating Systems (TT), pp. 619–638.

ICFP-2007-Dreyer #recursion #type system

A type system for recursive modules (DD), pp. 289–302.

ICFP-2007-FilinskiS #data type #induction #reasoning

Inductive reasoning about effectful data types (AF, KS), pp. 97–110.

ICFP-2007-Leijen #system f

A type directed translation of MLF to system F (DL), pp. 111–122.

ICFP-2007-Park #higher-order #type safety

Type-safe higher-order channels in ML-like languages (SP), pp. 191–202.

ICFP-2007-Pfenning #revisited #type system

Subtyping and intersection types revisited (FP), p. 219.

IFL-2007-HerhutSBGT #contract #dependent type #partial evaluation #proving #towards

From Contracts Towards Dependent Types: Proofs by Partial Evaluation (SH, SBS, RB, CG, KT), pp. 254–273.

IFL-2007-Kleeblatt #dependent type #using

Checking Dependent Types Using Compiled Code (DK), pp. 165–182.

IFL-2007-SulzmannL #haskell #named #regular expression

XHaskell — Adding Regular Expression Types to Haskell (MS, KZML), pp. 75–92.

IFL-2007-VriesPA #type system

Uniqueness Typing Simplified (EdV, RP, DMA), pp. 201–218.

HCI-AS-2007-MorimotoMT #process #reuse

Perspectives on Reuse Process Support Systems for Document-Type Knowledge (YM, HM, HT), pp. 682–691.

HCI-AS-2007-NahHCL #comparison #online

An Examination of Online Product Comparison Service: Fit Between Product Type and Disposition Style (FFHN, WH, LC, HHL), pp. 90–94.

HCI-AS-2007-PoratLT #design

E-Stores Design: The Influence of E-Store Design and Product Type on Consumers’ Emotions and Attitudes (TP, RL, NT), pp. 712–721.

HCI-IPT-2007-ChoH #recognition

Drawing Type Tactile Presentation for Tactile Letter Recognition (JHC, MH), pp. 798–807.

HIMI-MTT-2007-LeeJ #case study #using

A Study on a Stereoscopic Display System Using a Rotary Disk Type Beam Shutter (KHL, TJJ), pp. 868–875.

HIMI-MTT-2007-MiyakeT #coordination #realtime

Internal Timing Mechanism for Real-Time Coordination — Two Types of Control in Synchronized Tapping (YM, KT), pp. 876–883.

CAiSE-2007-Guizzardi #aspect-oriented

Modal Aspects of Object Types and Part-Whole Relations and the de re/de dicto Distinction (GG), pp. 5–20.

CIKM-2007-LiA #approach #clustering #multi #named #relational

Diva: a variance-based clustering approach for multi-type relational data (TL, SSA), pp. 147–156.

CIKM-2007-PragerLC #comparison #framework

Type nanotheories: a framework for term comparison (JMP, SL, JCC), pp. 701–710.

CIKM-2007-ZaragozaRMACA #ranking #wiki

Ranking very many typed entities on wikipedia (HZ, HR, PM, JA, MC, GA), pp. 1015–1018.

ECIR-2007-XuCLCH #documentation

Searching Documents Based on Relevance and Type (JX, YC, HL, NC, YH), pp. 629–636.

ECIR-2007-YeungBCK #approach #documentation #learning

A Bayesian Approach for Learning Document Type Relevance (PCKY, SB, CLAC, MK), pp. 753–756.

SIGIR-2007-YeungCB #documentation #retrieval

Improving retrieval accuracy by weighting document types with clickthrough data (PCKY, CLAC, SB), pp. 759–760.

ECOOP-2007-DietlDM

Generic Universe Types (WD, SD, PM), pp. 28–53.

ECOOP-2007-SiekT #type system

Gradual Typing for Objects (JGS, WT), pp. 2–27.

ECOOP-2007-VaziriTFD #declarative #using

Declarative Object Identity Using Relation Types (MV, FT, SF, JD), pp. 54–78.

OOPSLA-2007-FahndrichX #invariant

Establishing object invariants with delayed types (MF, SX), pp. 337–350.

OOPSLA-2007-GreenfieldboyceF #java

Type qualifier inference for java (DG, JSF), pp. 321–336.

OOPSLA-2007-IgarashiV #scalability

Variant path types for scalable extensibility (AI, MV), pp. 113–132.

OOPSLA-2007-MullerR

Ownership transfer in universe types (PM, AR), pp. 461–478.

TOOLS-EUROPE-2007-EkmanH #java

Pluggable checking and inferencing of nonnull types for Java (TE, GH), pp. 455–475.

TOOLS-EUROPE-2007-SteimannM #analysis #design #interface #towards

Type Access Analysis: Towards Informed Interface Design (FS, PM), pp. 147–164.

GPCE-2007-JungH #architecture #component #framework #scalability #specification

A type-centric framework for specifying heterogeneous, large-scale, component-oriented, architectures (GJ, JH), pp. 33–42.

LOPSTR-2007-AlbertGGP #online #partial evaluation #type system

Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (EA, JPG, MGZ, GP), pp. 23–42.

PPDP-2007-BentonZ #compilation #formal method #semantics #verification

Formalizing and verifying semantic type soundness of a simple compiler (NB, UZ), pp. 1–12.

PPDP-2007-Charatonik #logic programming #source code

Regular directional types for logic programs (WC), p. 209.

PPDP-2007-Skalka #data access #type safety #virtual machine

Type safe dynamic linking for JVM access control (CS), pp. 51–62.

POPL-2007-AppelMRV #type system

A very modal model of a modern, major, general type system (AWA, PAM, CDR, JV), pp. 109–122.

POPL-2007-BugliesiG #abstraction #implementation

Secure implementations of typed channel abstractions (MB, MG), pp. 251–262.

POPL-2007-Chen #compilation #inheritance #multi

A typed intermediate language for compiling multiple inheritance (JC), pp. 25–30.

POPL-2007-DreyerHCK #composition

Modular type classes (DD, RH, MMTC, GK), pp. 63–70.

POPL-2007-PolishchukLS #comprehension #debugging #type inference

Dynamic heap type inference for program understanding and debugging (MP, BL, CWS), pp. 39–46.

POPL-2007-TuchKN #logic

Types, bytes, and separation logic (HT, GK, MN), pp. 97–108.

SAC-OOPS-J-2006-IgarashiN07 #object-oriented #programming

Union Types for Object-Oriented Programming (AI, HN), pp. 47–68.

SAC-OOPS-J-2006-LagorioZ07 #java #named

Just: Safe Unknown Types in Java-like Languages (GL, EZ), pp. 69–98.

SAC-OOPS-J-2006-Steimann07 #interface #programming #refactoring

The Infer Type Refactoring and its Use for Interface-Based Programming (FS), pp. 99–120.

SAC-2007-Lu #implementation #type system

Implementing type-based constructive negation (LL), pp. 1299–1306.

SAC-2007-SonJF

Exploiting types for improved schema mapping (YS, HMJ, FF), pp. 423–429.

LCTES-2007-PermandlaRB #java #type system #virtual machine

A type system for preventing data races and deadlocks in the java virtual machine language: 1 (PP, MR, CB), p. 10.

SMT-J-2006-BarrettST07 #data type #formal method #induction

An Abstract Decision Procedure for a Theory of Inductive Data Types (CB, IS, CT), pp. 21–46.

CSL-2007-GaboardiR #calculus

A Soft Type Assignment System for λ -Calculus (MG, SRDR), pp. 253–267.

CSL-2007-LassenL #bisimulation #normalisation

Typed Normal Form Bisimulation (SBL, PBL), pp. 283–297.

LICS-2007-AbelCD #evaluation #normalisation #similarity #type system

Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements (AA, TC, PD), pp. 3–12.

TAP-2007-Haiyan #algorithm #distributed #proving #testing #type system

Testing and Proving Distributed Algorithms in Constructive Type Theory (QH), pp. 79–94.

TLCA-2007-Abel #induction #normalisation

Strong Normalization and Equi-(Co)Inductive Types (AA0), pp. 8–22.

TLCA-2007-Baillot #linear #logic #polynomial #type system

From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing (PB), pp. 2–7.

TLCA-2007-CousineauD #calculus #type system

Embedding Pure Type Systems in the λ-π-Calculus Modulo (DC, GD), pp. 102–117.

TLCA-2007-DavidN #calculus #equation #normalisation #proving #recursion

An Arithmetical Proof of the Strong Normalization for the λ -Calculus with Recursive Equations on Types (RD, KN), pp. 84–101.

TLCA-2007-KiselyovS #continuation #type system

A Substructural Type System for Delimited Continuations (OK, CcS), pp. 223–239.

TLCA-2007-Kusmierek #problem #rank

The Inhabitation Problem for Rank Two Intersection Types (DK), pp. 240–254.

TLCA-2007-MostrousY #higher-order #mobile #process #type system

Two Session Typing Systems for Higher-Order Mobile Processes (DM, NY), pp. 321–335.

ASE-2006-PaarT #data type #owl #programming language #xml

Programming Language Inherent Support for Constrained XML Schema Definition Data Types and OWL DL (AP, WFT), pp. 281–284.

DATE-2006-BartzasMPACST #data type #design #energy #network #refinement

Dynamic data type refinement methodology for systematic performance-energy design exploration of network applications (AB, SM, GP, DA, FC, DS, AT), pp. 740–745.

DocEng-2006-Moore #documentation

Every page is different: a new document type for commercial printing (KM), p. 2.

VLDB-2006-BenzakenCCN #type system #xml

Type-Based XML Projection (VB, GC, DC, KN), pp. 271–282.

ESOP-2006-Ahmed #logic #quantifier #recursion

Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types (AJA), pp. 69–83.

ESOP-2006-ChinMMP

Inference of User-Defined Type Qualifiers and Qualifier Rules (BC, SM, TDM, JP), pp. 264–278.

ESOP-2006-DrossopoulouCN

Types for Hierarchic Shapes (SD, DGC, JN), pp. 1–6.

ESOP-2006-Fruja #dot-net #runtime #type safety

Type Safety of Generics for the .NET Common Language Runtime (NGF), pp. 325–341.

ESOP-2006-FurrF #polymorphism #type inference

Polymorphic Type Inference for the JNI (MF, JSF), pp. 309–324.

ESOP-2006-HofmannJ #analysis #type system

Type-Based Amortised Heap-Space Analysis (MH, SJ), pp. 22–37.

ESOP-2006-SecoC #configuration management

Types for Dynamic Reconfiguration (JCS, LC), pp. 214–229.

ESOP-2006-YuI #assembly

A Typed Assembly Language for Confidentiality (DY, NI), pp. 162–179.

ICPC-2006-FluriG

Classifying Change Types for Qualifying Change Couplings (BF, HCG), pp. 35–45.

PEPM-2006-WangCK #aspect-oriented #functional #higher-order #weaving

Type-directed weaving of aspects for higher-order functional languages (MW, KC, SCK), pp. 78–87.

PLDI-2006-DhurjatiKA #alias #analysis #named

SAFECode: enforcing alias analysis for weakly typed languages (DD, SK, VSA), pp. 144–157.

FLOPS-2006-DijkstraS #named #programming

Ruler: Programming Type Rules (AD, SDS), pp. 30–46.

FLOPS-2006-GregoireTW #approach #type system

A Computational Approach to Pocklington Certificates in Type Theory (BG, LT, BW), pp. 97–113.

FLOPS-2006-HinzeJL #contract #functional #programming

Typed Contracts for Functional Programming (RH, JJ, AL), pp. 208–225.

FLOPS-2006-SulzmannWS #algebra #data type #framework

A Framework for Extended Algebraic Data Types (MS, JW, PJS), pp. 47–64.

FLOPS-2006-Tozawa #transducer #type checking #using #xml

XML Type Checking Using High-Level Tree Transducer (AT), pp. 81–96.

ICALP-v2-2006-Haghverdi #exponential

Typed GoI for Exponentials (EH), pp. 384–395.

FM-2006-CunhaOV #data transformation #type safety

Type-Safe Two-Level Data Transformation (AC, JNO, JV), pp. 284–299.

ICFP-2006-JonesVWW #data type #type inference

Simple unification-based type inference for GADTs (SLPJ, DV, SW, GW), pp. 50–61.

ICFP-2006-NanevskiMB #hoare #morphism #polymorphism #type system

Polymorphism and separation in hoare type theory (AN, GM, LB), pp. 62–73.

ICFP-2006-VytiniotisWJ #rank

Boxy types: inference for higher-rank types and impredicativity (DV, SW, SLPJ), pp. 251–262.

ICFP-2006-WalkerMLRA #static typing #type system #λ-calculus

Static typing for a faulty λ calculus (DW, LWM, JL, GAR, DIA), pp. 38–49.

IFL-2006-HageH #fault #heuristic

Heuristics for Type Error Discovery and Recovery (JH, BH), pp. 199–216.

IFL-2006-VriesPA #type system

Uniqueness Typing Redefined (EdV, RP, DMA), pp. 181–198.

CHI-2006-DillonKCB #using #visual notation

Visual search and reading tasks using ClearType and regular displays: two experiments (AD, LK, GOC, RGB), pp. 503–511.

AdaEurope-2006-MirandaS #c++ #interface

Abstract Interface Types in GNAT: Conversions, Discriminants, and C++ (JM, ES), pp. 179–190.

ICML-2006-LongZWY #clustering #multi #relational

Spectral clustering for multi-type relational data (BL, Z(Z, XW, PSY), pp. 585–592.

ICPR-v1-2006-NegriCMP #algorithm #classification

An Oriented-Contour Point Based Voting Algorithm for Vehicle Type Classification (PN, XC, MM, RP), pp. 574–577.

ICPR-v1-2006-ZengL06a #fuzzy #markov #random #recognition

Type-2 Fuzzy Markov Random Fields to Handwritten Character Recognition (JZ, ZQL), pp. 1162–65.

ICPR-v4-2006-ChouSCC #multi #recognition

Iris Recognition with Multi-Scale Edge-Type Matching (CTC, SWS, WSC, VWC), pp. 545–548.

SIGIR-2006-BastW #performance

Type less, find more: fast autocompletion search with a succinct index (HB, IW), pp. 364–371.

SIGIR-2006-WangSCZ #analysis #multi #semantics

Latent semantic analysis for multiple-type interrelated data objects (XW, JTS, ZC, CZ), pp. 236–243.

ECOOP-2006-AndreaeCGNVZ #aspect-oriented #java #realtime

Scoped Types and Aspects for Real-Time Java (CA, YC, CG, JN, JV, TZ), pp. 124–147.

ECOOP-2006-Dezani-CiancagliniMYD #object-oriented

Session Types for Object-Oriented Languages (MDC, DM, NY, SD), pp. 328–352.

OOPSLA-2006-AndreaeNMM #framework #implementation #type system

A framework for implementing pluggable type systems (CA, JN, SM, TDM), pp. 57–74.

OOPSLA-2006-ChinCKP #approach #parametricity

A flow-based approach for variant parametric types (WNC, FC, SCK, CP), pp. 273–290.

OOPSLA-2006-WasserrabNST #c++ #inheritance #multi #semantics #type safety

An operational semantics and type safety prooffor multiple inheritance in C++ (DW, TN, GS, FT), pp. 345–362.

GPCE-2006-LammelO #integration

Software extension and integration with type classes (RL, KO), pp. 161–170.

PPDP-2006-AbrahamE #spreadsheet #type inference

Type inference for spreadsheets (RA, ME), pp. 73–84.

PPDP-2006-BundgaardS #graph #π-calculus

Typed polyadic π-calculus in bigraphs (MB, VS), pp. 1–12.

PPDP-2006-ColazzoS #algorithm #performance #xml

An efficient algorithm for XML type projection (DC, CS), pp. 51–60.

PPDP-2006-Hanus #type system #user interface #web

Type-oriented construction of web user interfaces (MH), pp. 27–38.

PPDP-2006-LindahlS #type inference

Practical type inference based on success typings (TL, KFS), pp. 167–178.

PPDP-2006-LohH #data type #open data

Open data types and open functions (AL, RH), pp. 133–144.

PPDP-2006-MatsunoO #type system

A type system equivalent to static single assignment (YM, AO), pp. 249–260.

PPDP-2006-SchrijversB #algebra #data type #polymorphism #re-engineering

Polymorphic algebraic data type reconstruction (TS, MB), pp. 85–96.

PPDP-2006-Sulzmann #proving #source code

Extracting programs from type class proofs (MS), pp. 97–108.

PPDP-2006-YuseI #generative #multi #persistent #type system

A modal type system for multi-level generating extensions with persistent code (YY, AI), pp. 201–212.

POPL-2006-Flanagan #hybrid #type checking

Hybrid type checking (CF), pp. 245–256.

POPL-2006-HuntS #on the #security

On flow-sensitive security types (SH, DS), pp. 79–90.

POPL-2006-KimYC #multi #polymorphism #type system

A polymorphic modal type system for lisp-like multi-staged languages (ISK, KY, CC), pp. 257–268.

POPL-2006-McKinna #dependent type #matter #why

Why dependent types matter (JM), p. 1.

POPL-2006-PottierR #algebra #data type #type inference

Stratified type inference for generalized algebraic data types (FP, YRG), pp. 232–244.

POPL-2006-Thielecke #pointer

Frame rules from answer types for code pointers (HT), pp. 309–319.

POPL-2006-Vouillon #polymorphism

Polymorphic regular tree types and patterns (JV), pp. 103–114.

SAC-2006-HanenbergAU #aspect-oriented

Aspect-specification based on structural type information (SH, MAM, RU), pp. 1575–1579.

SAC-2006-IgarashiN #object-oriented #programming

Union types for object-oriented programming (AI, HN), pp. 1435–1441.

SAC-2006-LagorioZ #java

Introducing safe unknown types in Java-like languages (GL, EZ), pp. 1429–1434.

SAC-2006-Poernomo

The meta-object facility typed (IP), pp. 1845–1849.

SAC-2006-Xing #strict

Enhancing program verifications by restricting object types (CCX), pp. 1816–1821.

FSE-2006-JhalaM #reasoning

Bit level types for high level reasoning (RJ, RM), pp. 128–140.

ICSE-2006-JiangS #c #correctness #named #source code #type system #validation

Osprey: a practical type system for validating dimensional unit correctness of C programs (LJ, ZS), pp. 262–271.

LDTA-2006-EichbergKKMS #analysis #incremental

Incremental Confined Types Analysis (ME, SK, SK, MM, TS), pp. 81–96.

CC-2006-Necula #dependent type #low level #type system #using

Using Dependent Types to Port Type Systems to Low-Level Languages (GCN), p. 1.

CGO-2006-VenstermansEB #java

Space-Efficient 64-bit Java Objects through Selective Typed Virtual Addressing (KV, LE, KDB), pp. 76–86.

LCTES-2006-Mine #analysis #c #embedded #pointer #source code

Field-sensitive value analysis of embedded C programs with union types and pointer arithmetics (AM), pp. 54–63.

OSDI-2006-SivathanuSZ #type safety

Type-Safe Disks (GS, SS, EZ), pp. 15–28.

CAV-2006-BurckhardtAM #bound #case study #concurrent #data type #memory management #model checking #modelling

Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study (SB, RA, MMKM), pp. 489–502.

CSL-2006-Abel #termination

Semi-continuous Sized Types and Termination (AA0), pp. 72–88.

CSL-2006-Aehlig #automaton #finite #infinity #semantics

A Finite Semantics of Simply-Typed λ Terms for Infinite Runs of Automata (KA), pp. 104–118.

CSL-2006-LengrandDM #calculus #type system

A Sequent Calculus for Type Theory (SL, RD, JM), pp. 441–455.

IJCAR-2006-Brown #set #type system

Combining Type Theory and Untyped Set Theory (CEB), pp. 205–219.

IJCAR-2006-Rabe #dependent type #first-order #logic

First-Order Logic with Dependent Types (FR), pp. 377–391.

IJCAR-2006-Werner #on the

On the Strength of Proof-Irrelevant Type Theories (BW), pp. 604–618.

IJCAR-2006-ZamanskyA #calculus #canonical #quantifier

Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers (AZ, AA), pp. 251–265.

ISSTA-2006-GuoPME #data type

Dynamic inference of abstract types (PJG, JHP, SM, MDE), pp. 255–265.

LICS-2006-TerauchiA #on the #polymorphism #recursion

On Typability for Rank-2 Intersection Types with Polymorphic Recursion (TT, AA), pp. 111–122.

RTA-2006-Salvati #equation #linear #type system #λ-calculus

Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus (SS), pp. 151–165.

SAT-2006-ChenIJSS #constraints #problem #theorem

A Dichotomy Theorem for Typed Constraint Satisfaction Problems (SC, TI, KJ, DS, MS), pp. 226–239.

ASE-2005-AgarwalSWS #concurrent #detection #runtime #using

Optimized run-time race detection and atomicity checking using partial discovered types (RA, AS, LW, SDS), pp. 233–242.

DATE-2005-LiS05a #algorithm

An O(bn2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types (ZL, WS), pp. 1324–1329.

DRR-2005-BairdR #named #segmentation

ScatterType: a reading CAPTCHA resistant to segmentation attack (HSB, TPR), pp. 197–207.

ICDAR-2005-BairdMW #named

ScatterType: A Legible but Hard-to-Segment CAPTCHA (HSB, MAM, SYW), pp. 935–939.

PODS-2005-ManethBPS #metaprogramming #transducer #type checking #xml

XML type checking with macro tree transducers (SM, AB, TP, HS), pp. 283–294.

VLDB-2005-JinKLT #approximate #retrieval

Indexing Mixed Types for Approximate Retrieval (LJ, NK, CL, AKHT), pp. 793–804.

WRLA-2004-CervesatoS05 #dependent type #logic #representation #specification

Representing the MSR Cryptoprotocol Specification Language in an Extension of Rewriting Logic with Dependent Types (IC, MOS), pp. 183–207.

WRLA-2004-LiquoriW05 #calculus #polymorphism #type checking #type inference

The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference] (LL, BW), pp. 89–111.

ESOP-2005-FournetGM #policy

A Type Discipline for Authorization Policies (CF, ADG, SM), pp. 141–156.

ESOP-2005-MakholmW #calculus #mobile #polymorphism #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-NaikP #model checking #type system

A Type System Equivalent to a Model Checker (MN, JP), pp. 374–388.

ESOP-2005-Thiemann #javascript #source code #towards #type system

Towards a Type System for Analyzing JavaScript Programs (PT), pp. 408–422.

ESOP-2005-TseZ #classification #design

A Design for a Security-Typed Language with Certificate-Based Declassification (ST, SZ), pp. 279–294.

FASE-2005-TaentzerR #constraints #graph #inheritance #modelling

Ensuring Structural Constraints in Graph-Based Models with Type Inheritance (GT, AR), pp. 64–79.

TACAS-2005-KomondoorRCF #comprehension #dependent type

Dependent Types for Program Understanding (RK, GR, SC, JF), pp. 157–173.

WCRE-2005-SpoonS #higher-order #navigation #scalability #semantics

Semantic Navigation of Large Code Bases in Higher-Order, Dynamically Typed Languages (SAS, OS), pp. 219–228.

PLDI-2005-ChinMM #semantics

Semantic type qualifiers (BC, SM, TDM), pp. 85–95.

PLDI-2005-FurrF #type safety

Checking type safety of foreign function calls (MF, JSF), pp. 62–72.

PLDI-2005-KrishnaswamiA #encapsulation #higher-order

Permission-based ownership: encapsulating state in higher-order typed languages (NRK, JA), pp. 96–106.

SAS-2005-BruynoogheGH #analysis #logic programming #source code #termination

Inference of Well-Typings for Logic Programs with Application to Termination Analysis (MB, JPG, WVH), pp. 35–51.

SAS-2005-GlewPG #architecture #optimisation #plugin #type safety

Type-Safe Optimisation of Plugin Architectures (NG, JP, CG), pp. 135–154.

SAS-2005-Gordon #calculus #process #security

From Typed Process Calculi to Source-Based Security (ADG), p. 2.

SAS-2005-HarrenN #assembly #dependent type #safety #using

Using Dependent Types to Certify the Safety of Assembly Code (MH, GCN), pp. 155–170.

DLT-2005-Maletti #power of #transducer

The Power of Tree Series Transducers of Type I and II (AM), pp. 338–349.

ICALP-2005-HanedaKT

Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y2=x2k+1+ax (MH, MK, TT), pp. 539–550.

ICFP-2005-ChakravartyKJ

Associated type synonyms (MMTC, GK, SLPJ), pp. 241–253.

ICFP-2005-Dreyer #recursion

Recursive type generativity (DD), pp. 41–53.

ICFP-2005-LeijenL

Qualified types for MLF (DL, AL), pp. 144–155.

ICFP-2005-MakholmW #mixin #morphism #type inference

Type inference, principal typings, and let-polymorphism for first-class mixin modules (HM, JBW), pp. 156–167.

ICFP-2005-Nilsson #algebra #data type #functional #optimisation #programming #using

Dynamic optimization for functional reactive programming using generalized algebraic data types (HN), pp. 54–65.

ICFP-2005-Pottier #ml #type inference

From ML type inference to stratified type inference (FP), p. 1.

ICFP-2005-Remy #system f

Simple, partial type-inference for System F based on type-containment (DR), pp. 130–143.

IFL-2005-BradyH #execution #framework #static analysis

A Dependently Typed Framework for Static Analysis of Program Execution Costs (EB, KH), pp. 74–90.

CHI-2005-WangN #performance

Less visible and wireless: two experiments on the effects of microphone type on users’ performance and perception (QW, CN), pp. 809–818.

AdaEurope-2005-MirandaSD #ada #compilation #implementation #interface

The Implementation of Ada 2005 Interface Types in the GNAT Compiler (JM, ES, GD), pp. 208–219.

ICEIS-v3-2005-ZhaoVB #collaboration #distributed #interactive #trust

Type and Scope of Trust Relationships in Collaborative Interactions in Distributed Environments (WZ, VV, GB), pp. 331–336.

CIKM-2005-CulottaM #multi #relational

Joint deduplication of multiple record types in relational data (AC, AM), pp. 257–258.

CIKM-2005-PuM #equation #functional #query #specification

Typed functional query languages with equational specifications (KQP, AOM), pp. 233–234.

MoDELS-2005-SteelJ #modelling #reuse #type system

Model Typing for Improving Reuse in Model-Driven Engineering (JS, JMJ), pp. 84–96.

MoDELS-2005-SteelJ #modelling #reuse #type system

Model Typing for Improving Reuse in Model-Driven Engineering (JS, JMJ), pp. 84–96.

ECOOP-2005-AndersonGD #javascript #towards #type inference

Towards Type Inference for JavaScript (CA, PG, SD), pp. 428–452.

ECOOP-2005-LuP #reachability #type system

A Type System for Reachability and Acyclicity (YL, JP), pp. 479–503.

ECOOP-2005-Meyer #object-oriented #problem #programming

Attached Types and Their Application to Three Open Problems of Object-Oriented Programming (BM), pp. 1–32.

OOPSLA-2005-JarviWL #constraints #object-oriented

Associated types and constraint propagation for mainstream object-oriented generics (JJ, JW, AL), pp. 1–19.

OOPSLA-2005-KennedyR #algebra #data type #object-oriented #programming

Generalized algebraic data types and object-oriented programming (AK, CVR), pp. 21–40.

GPCE-2005-BravenboerVVV #ambiguity #metaprogramming #source code #syntax #type system

Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax (MB, RV, JJV, EV), pp. 157–172.

GPCE-2005-DraheimLW #generative #type system

A Type System for Reflective Program Generators (DD, CL, GW), pp. 327–341.

LOPSTR-2005-GallagherPA #abstract domain #type system

Converting One Type-Based Abstract Domain to Another (JPG, GP, EA), pp. 147–162.

LOPSTR-2005-SuenagaKY #approach #automation #generative #source code #type system

Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives (KS, NK, AY), pp. 98–114.

PPDP-2005-TombF #automation #partial evaluation #type inference

Automatic type inference via partial evaluation (AT, CF), pp. 106–116.

PPDP-2005-Wojciechowski #transaction #type system #version control

Isolation-only transactions by typing and versioning (PTW), pp. 70–81.

PADL-2005-HeerenH

Type Class Directives (BH, JH), pp. 253–267.

POPL-2005-ChakravartyKJM

Associated types with class (MMTC, GK, SLPJ, SM), pp. 1–13.

POPL-2005-ChenT #object-oriented

A simple typed intermediate language for object-oriented languages (JC, DT), pp. 38–49.

POPL-2005-Goguen #approach #similarity #type system

A syntactic approach to eta equality in type theory (HG), pp. 75–84.

POPL-2005-SumiiP #abstraction #bisimulation #recursion

A bisimulation for type abstraction and recursion (ES, BCP), pp. 63–74.

SAC-2005-RimassaV #comprehension #java #parametricity #strict

Understanding access restriction of variant parametric types and Java wildcards (GR, MV), pp. 1390–1397.

ICSE-2005-CookR #execution #query #static typing

Safe query objects: statically typed objects as remotely executable queries (WRC, SR), pp. 97–106.

CC-2005-QianH #analysis #case study #jit

A Study of Type Analysis for Speculative Method Inlining in a JIT Environment (FQ, LJH), pp. 255–270.

PPoPP-2005-SasturkarAWS #analysis #automation #type system

Automated type-based analysis of data races and atomicity (AS, RA, LW, SDS), pp. 83–94.

CADE-2005-Brown #reasoning #similarity #type system

Reasoning in Extensional Type Theory with Equality (CEB), pp. 23–37.

CSL-2005-BarrasG #calculus #induction #on the

On the Role of Type Decorations in the Calculus of Inductive Constructions (BB, BG), pp. 151–166.

CSL-2005-Blanqui #algebra #calculus #decidability

Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations (FB), pp. 135–150.

CSL-2005-HaghverdiS #geometry #interactive #towards

Towards a Typed Geometry of Interaction (EH, PJS), pp. 216–231.

CSL-2005-Lambov #analysis #complexity #framework

Complexity and Intensionality in a Type-1 Framework for Computable Analysis (BL), pp. 442–461.

ICLP-2005-CoqueryF #type system

A Type System for CHR (EC, FF), pp. 402–403.

LICS-2005-BirkedalTY #higher-order #semantics #type system

Semantics of Separation-Logic Typing and Higher-Order Frame Rules (LB, NTS, HY), pp. 260–269.

LICS-2005-MelliesV #framework #parametricity #polymorphism #recursion

Recursive Polymorphic Types and Parametricity in an Operational Framework (PAM, JV), pp. 82–91.

LICS-2005-Rossman

Existential Positive Types and Preservation under Homomorphisisms (BR), pp. 467–476.

RTA-2005-AotoY #dependence #term rewriting

Dependency Pairs for Simply Typed Term Rewriting (TA, TY), pp. 120–134.

TLCA-2005-BaillotT #algorithm #logic #type system

A Feasible Algorithm for Typing in Elementary Affine Logic (PB, KT), pp. 55–70.

TLCA-2005-BartheGP #polymorphism #termination #type system

Practical Inference for Type-Based Termination in a Polymorphic Setting (GB, BG, FP), pp. 71–85.

TLCA-2005-CosmoPR #commutative #recursion #type system

Subtyping Recursive Types Modulo Associative Commutative Products (RDC, FP, DR), pp. 179–193.

TLCA-2005-Fujita #polymorphism

Galois Embedding from Polymorphic Types into Existential Types (KeF), pp. 194–208.

TLCA-2005-Herbelin #logic #on the

On the Degeneracy of Σ-Types in Presence of Computational Classical Logic (HH), pp. 209–220.

TLCA-2005-LindleyS

Reducibility and TT-Lifting for Computation Types (SL, IS), pp. 262–277.

WICSA-2004-NortonF #architecture

Reactive Types for Dataflow-Oriented Software Architectures (BN, MF), pp. 211–220.

DAC-2004-ShiB #automation #communication #data type #fixpoint #optimisation

Automated fixed-point data-type optimization tool for signal processing and communication systems (CS, RWB), pp. 478–483.

HT-2004-LepthienA #behaviour

Unifying structure, behavior, and data with themis types and templates (WVL, KMA), pp. 256–265.

HT-2004-RoyJK #automation #categorisation #web

Automatic categorization of web sites based on source types (SR, SJ, RK), pp. 38–39.

ITiCSE-WGR-2004-CanningMRR #c #using

Reading types in C using the right left walk method (JC, WM, AR, DR), pp. 52–54.

ESOP-2004-CarlierPWK #flexibility #linear #type system

System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types (SC, JP, JBW, AJK), pp. 294–309.

ESOP-2004-DuckPSS #decidability #dependence #functional #type inference

Sound and Decidable Type Inference for Functional Dependencies (GJD, SLPJ, PJS, MS), pp. 49–63.

ESOP-2004-EnnalsSM #linear

Linear Types for Packet Processing (RE, RS, AM), pp. 204–218.

ESOP-2004-HirschowitzLW #call-by #mixin #reduction #semantics

Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types (TH, XL, JBW), pp. 64–78.

ESOP-2004-LhoussaineS #calculus

A Dependently Typed Ambient Calculus (CL, VS), pp. 171–187.

ESOP-2004-Thielecke #call-by #continuation #morphism #polymorphism

Answer Type Polymorphism in Call-by-Name Continuation Passing (HT), pp. 279–293.

FASE-2004-GhezziMP #static analysis #type system

Enhancing Remote Method Invocation through Type-Based Static Analysis (CG, VM, GPP), pp. 339–353.

TACAS-2004-LingerS #analysis #constraints #ml #theorem proving #type inference

Binding-Time Analysis for MetaML via Type Inference and Constraint Solving (NL, TS), pp. 266–279.

PEPM-2004-PopeeaC #correctness #protocol #proving #type system #verification

A type system for resource protocol verification and its correctness proof (CP, WNC), pp. 135–146.

SAS-2004-FlanaganF #type inference

Type Inference Against Races (CF, SNF), pp. 116–132.

ICALP-2004-AbbottAG #induction #representation #using

Representing Nested Inductive Types Using W-Types (MA, TA, NG), pp. 59–71.

ICALP-2004-DengS #algebra #mobile #process #towards

Towards an Algebraic Theory of Typed Mobile Processes (YD, DS), pp. 445–456.

ICALP-2004-Hofmann #logic #question #type system #what

What Do Program Logics and Type Systems Have in Common? (MH0), pp. 4–7.

ICALP-2004-Katsumata

A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems (SyK), pp. 831–845.

IFM-2004-BeckertS #data type #integer #refinement #verification

Software Verification with Integrated Data Type Refinement for Integer Arithmetic (BB, SS), pp. 207–226.

AFP-2004-AchtenEPW04 #agile #interactive #named #prototype #tool support #type safety

GEC: A Toolkit for Generic Rapid Prototyping of Type Safe Interactive Applications (PA, MCJDvE, RP, AvW), pp. 210–244.

AFP-2004-DijkstraS04 #attribute grammar #haskell #type system

Typing Haskell with an Attribute Grammar (AD, SDS), pp. 1–72.

AFP-2004-McBride04 #dependent type #named #programming

Epigram: Practical Programming with Dependent Types (CM), pp. 130–170.

AFP-2004-PlasmeijerW04 #functional

A Functional Shell That Operates on Typed and Compiled Applications (RP, AvW), pp. 245–272.

ICFP-2004-AriolaHS #continuation

A type-theoretic foundation of continuations and prompts (ZMA, HH, AS), pp. 40–53.

ICFP-2004-ColazzoGMS #correctness #query #xml

Types for path correctness of XML queries (DC, GG, PM, CS), pp. 126–137.

ICFP-2004-GauthierP #canonical #first-order #higher-order #matter #recursion

Numbering matters: first-order canonical forms for second-order recursive types (NG, FP), pp. 150–161.

ICFP-2004-NeergaardM #type system #why

Types, potency, and idempotency: why nonlinearity and amnesia make a type system work (PMN, HGM), pp. 138–149.

IFL-2004-Gast #data flow #fault #ml

Explaining ML Type Errors by Data Flows (HG), pp. 72–89.

ICGT-2004-EhrigPT #graph transformation

Fundamental Theory for Typed Attributed Graph Transformation (HE, UP, GT), pp. 161–177.

ICGT-2004-Klempien-HinrichsKK #graph transformation #type system

Typing of Graph Transformation Units (RKH, HJK, SK), pp. 112–127.

CHI-2004-LyonsSPFLDL #mobile #type system

Twiddler typing: one-handed chording text entry for mobile phones (KL, TS, DP, JF, AL, AD, EWL), pp. 671–678.

EDOC-2004-HoffnerFF #flexibility #type system

Strong and Flexible Domain Typing for Dynamic E-Business (YH, SF, CF), pp. 98–107.

ICEIS-v5-2004-RousseauBMFM #multi #personalisation #profiling #repository #resource management #using

Personalised Resource Discovery Searching over Multiple Repository Types: Using User and Information Provider Profiling (BR, PB, PM, PF, VM), pp. 35–43.

ICML-2004-XingSJ #process #type inference

Bayesian haplo-type inference via the dirichlet process (EPX, RS, MIJ).

ICPR-v1-2004-ChenD #recognition

A Universal Method for Single Character Type Recognition (LC, XD), pp. 413–416.

ICPR-v1-2004-GarciaS #distance #estimation

Estimation of Distance to Planar Surfaces and Type of Material with Infrared Sensors (MAG, AS), pp. 745–748.

ICPR-v1-2004-ZengL #fuzzy #markov #modelling #recognition

Type-2 Fuzzy Hidden Markov Models to Phoneme Recognition (JZ, ZQL), pp. 192–195.

ICPR-v3-2004-LuoKGHSRH #learning #multi

Active Learning to Recognize Multiple Types of Plankton (TL, KK, DBG, LOH, SS, AR, TH), pp. 478–481.

ICPR-v3-2004-PetrovicC #recognition #refinement

Vehicle Type Recognition with Match Refinement (VSP, TFC), pp. 95–98.

ICPR-v4-2004-Cheatle #smarttech #video

Media Content and Type Selection from Always-on Wearable Video (PC), pp. 979–982.

ECOOP-2004-SpoonS #precise #scalability #type inference

Demand-Driven Type Inference with Subgoal Pruning: Trading Precision for Scalability (SAS, OS), pp. 51–74.

ECOOP-2004-SutterTD #constraints #java #library #using

Customization of Java Library Classes Using Type Constraints and Profile Information (BDS, FT, JD), pp. 585–610.

OOPSLA-2004-BirkaE #type system

A practical type system and language for reference immutability (AB, MDE), pp. 35–49.

OOPSLA-2004-ScharliBD #encapsulation #object-oriented

Object-oriented encapsulation for dynamically typed languages (NS, APB, SD), pp. 130–149.

GPCE-2004-PasalicL #metaprogramming

Meta-programming with Typed Object-Language Representations (EP, NL), pp. 136–167.

LOPSTR-2004-Lopez-GarciaBH #analysis #logic programming #source code #using

Determinacy Analysis for Logic Programs Using Mode and Type Information (PLG, FB, MVH), pp. 19–35.

LOPSTR-2004-Moody #locality #logic

Logical Mobility and Locality Types (JM), pp. 69–84.

PPDP-2004-CarlierW #type inference

Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction (SC, JBW), pp. 132–143.

PADL-2004-AtanassowCJ #haskell #named #xml

UUXML: A Type-Preserving XML Schema-Haskell Data Binding (FA, DC, JJ), pp. 71–85.

PADL-2004-ChenSX #approach #inheritance #multi #object-oriented #programming

A Typeful Approach to Object-Oriented Programming with Multiple Inheritance (CC, RS, HX), pp. 23–38.

PADL-2004-ChenZX #case study #dependent type #haskell #implementation #simulation

Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell (CC, DZ, HX), pp. 239–254.

PADL-2004-ElsmanL #html #ml #type system #web

Typing XHTML Web Applications in ML (ME, KFL), pp. 224–238.

PADL-2004-MoralesCH #c #compilation #prolog #using

Improved Compilation of Prolog to C Using Moded Types and Determinism Information (JFM, MC, MVH), pp. 86–103.

PADL-2004-NeubauerT #implementation

An Implementation of Session Types (MN, PT), pp. 56–70.

POPL-2004-AnconaZ #java

Principal typings for Java-like languages (DA, EZ), pp. 306–317.

POPL-2004-BalatCF #normalisation #partial evaluation #λ-calculus

Extensional normalisation and type-directed partial evaluation for typed λ calculus with sums (VB, RDC, MPF), pp. 64–76.

POPL-2004-Dreyer #recursion #type system

A type system for well-founded recursion (DD), pp. 293–305.

POPL-2004-Fiore #morphism #polynomial #recursion

Isomorphisms of generic recursive polynomial types (MPF), pp. 77–88.

POPL-2004-PottierG #polymorphism

Polymorphic typed defunctionalization (FP, NG), pp. 89–98.

POPL-2004-VouillonM #fresh look #semantics

Semantic types: a fresh look at the ideal model for types (JV, PAM), pp. 52–63.

POPL-2004-Yoshida #dependent type #higher-order #mobile #process

Channel dependent types for higher-order mobile processes (NY), pp. 147–160.

SAC-2004-SurazhskyG #c++ #type safety

Type-safe covariance in C++ (VS, JYG), pp. 1496–1502.

SAC-PL-J-2004-Jorgensen #alias #component #independence #integration #multi

Integration of Independently Developed Components through Aliased Multi-Object Type Widening (BNJ), pp. 55–76.

FSE-2004-EdwardsJT #modelling #type system

A type system for object models (JE, DJ, ET), pp. 189–199.

CAV-2004-Arons #algorithm #execution #verification

Verification of an Advanced mips-Type Out-of-Order Execution Algorithm (TA), pp. 414–426.

CSL-2004-AbelM #fixpoint #recursion

Fixed Points of Type Constructors and Primitive Recursion (AA, RM), pp. 190–204.

CSL-2004-SchoppS #dependent type #type system

A Dependent Type Theory with Names and Binding (US, IS), pp. 235–249.

CSL-2004-Vouillon #type system

Subtyping Union Types (JV), pp. 415–429.

ICLP-2004-GallagherH #abstract domain

Abstract Domains Based on Regular Types (JPG, KSH), pp. 27–42.

LICS-2004-BaillotT #polynomial #λ-calculus

Light Types for Polynomial Time Computation in λ-Calculus (PB, KT), pp. 266–275.

RTA-2004-Blanqui #higher-order #term rewriting #termination #type system

A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems (FB), pp. 24–39.

TestCom-2004-Schulz #consistency #protocol #testing

Derivation of Abstract Protocol Type Definitions for the Conformance Testing of Text-Based Protocols (SS), pp. 177–192.

VMCAI-2004-AgarwalS #java #type inference

Type Inference for Parameterized Race-Free Java (RA, SDS), pp. 149–160.

VMCAI-2004-BartheBR #compilation #security

Security Types Preserving Compilation: (Extended Abstract) (GB, AB, TR), pp. 2–15.

VMCAI-2004-TanASW #assembly #semantics

Construction of a Semantic Model for a Typed Assembly Language (GT, AWA, KNS, DW), pp. 30–43.

ASE-2003-AhmadAGK #detection #fault #spreadsheet #type system

A Type System for Statically Detecting Spreadsheet Errors (YA, TA, SG, SK), pp. 174–183.

DATE-2003-CaldariCCMGOT #modelling

SystemC Modeling of a Bluetooth Transceiver: Dynamic Management of Packet Type in a Noisy Channel (MC, MC, PC, GM, FDG, SO, CT), pp. 20214–20219.

DocEng-2003-ScheffczykBRS #consistency #documentation #formal method #repository #type safety

Consistent document engineering: formalizing type-safe consistency rules for heterogeneous repositories (JS, UMB, PR, LS), pp. 140–149.

DRR-2003-OgataWIYFSF #identification #implementation

Form-type identification for banking applications and its implementation issues (HO, SW, AI, TY, NF, HS, HF), pp. 208–218.

ICDAR-2003-AllierE #prototype #using

Font Type Extraction and Character Prototyping Using Gabor Filters (BA, HE), pp. 799–803.

ICDAR-2003-SakoSFII #identification #recognition

Form Reading based on Form-type Identification and Form-data Recognition (HS, MS, NF, HI, AI), p. 926–?.

ICDAR-2003-TomaiS #using

Combination of Type III Digit Recognizers using the Dempster-Shafer Theory of Evidence (CIT, SNS), pp. 854–858.

PODS-2003-Segoufin #bound #complexity #documentation #query #type system #xml

Typing and querying XML documents: some complexity bounds (LS), pp. 167–178.

SIGMOD-2003-BenediktCFFR #constraints #integration

Capturing both Types and Constraints in Data Integration (MB, CYC, WF, JF, RR), pp. 277–288.

ESOP-2003-ErwigR #programming #type safety

Programming Type-Safe Program Updates (ME, DR), pp. 269–283.

ESOP-2003-HaackW #fault #higher-order #slicing

Type Error Slicing in Implicitly Typed Higher-Order Languages (CH, JBW), pp. 284–301.

ESOP-2003-Lhoussaine #distributed #type inference #π-calculus

Type Inference for a Distributed π-Calculus (CL), pp. 253–268.

FoSSaCS-2003-DunfieldP #call-by

Type Assignment for Intersections and Unions in Call-by-Value Languages (JD, FP), pp. 250–266.

SCAM-2003-OlmosV #compilation #dynamic typing #static typing #type system

Turning Dynamic Typing into Static Typing by Program Specialization in a Compiler Front-end for Octave (KO, EV), pp. 141–150.

PEPM-2003-ChenX #implementation #program transformation

Implementing typeful program transformations (CC, HX), pp. 20–28.

PEPM-2003-ChinKX #analysis

Extending sized type with collection analysis (WNC, SCK, DNX), pp. 75–84.

PLDI-2003-BoyapatiSBR #java #memory management #realtime

Ownership types for safe region-based memory management in real-time Java (CB, AS, WSB, MCR), pp. 324–337.

PLDI-2003-FlanaganQ

A type and effect system for atomicity (CF, SQ), pp. 338–349.

SAS-2003-LiblitAY #distributed #type system

Type Systems for Distributed Data Sharing (BL, AA, KAY), pp. 273–294.

STOC-2003-BartalLMN #metric #on the

On metric ramsey-type phenomena (YB, NL, MM, AN), pp. 463–472.

ICALP-2003-GutierrezR #calculus #type system

Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems (FG, BCR), pp. 956–968.

ICALP-2003-Hannay #axiom #data type #higher-order

Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types (JEH), pp. 903–917.

SEFM-2003-Sangiorgi #mobile #process #using

Taming Mobile Processes Using Types (DS), p. 64–?.

SEFM-2003-Xi #dependent type #verification

Facilitating Program Verification with Dependent Types (HX), pp. 72–81.

ICFP-2003-ChenX #metaprogramming #representation

Meta-programming through typeful code representation (CC, HX), pp. 275–286.

ICFP-2003-HeerenHS #process #type inference

Scripting the type inference process (BH, JH, SDS), pp. 3–13.

ICFP-2003-HiguchiO #data access #static typing #type system #virtual machine

A static type system for JVM access control (TH, AO), pp. 227–237.

ICFP-2003-LeiferPSW

Global abstraction-safe marshalling with hash types (JJL, GP, PS, KW), pp. 87–98.

ICFP-2003-MandelbaumWH #effectiveness

An effective theory of type refinements (YM, DW, RH), pp. 213–225.

ICFP-2003-NeubauerT #fault

Discriminative sum types locate the source of type errors (MN, PT), pp. 15–26.

ICFP-2003-Simonet #bound #data type

An extension of HM(X) with bounded existential and universal data-types (VS), pp. 39–50.

IFL-2003-Choppella #equation #polymorphism #re-engineering #using

Polymorphic Type Reconstruction Using Type Equations (VC), pp. 53–68.

ICEIS-v1-2003-RossiterNH #formal method #information management #middleware #tool support

Formalizing Types with Ultimate Closure for Middleware Tools in Information Systems Engineering (BNR, DAN, MAH), pp. 366–373.

SIGIR-2003-KangK #classification #documentation #query #retrieval #web

Query type classification for web document retrieval (IHK, GCK), pp. 64–71.

SIGIR-2003-WangZCLTM #clustering #multi #named

ReCoM: reinforcement clustering of multi-type interrelated data objects (JW, HJZ, ZC, HL, LT, WYM), pp. 274–281.

ECOOP-2003-GapeyevP

Regular Object Types (VG, BCP), pp. 151–175.

ECOOP-2003-LamR #analysis #automation #design #type system

A Type System and Analysis for the Automatic Extraction and Enforcement of Design Information (PL, MCR), pp. 275–302.

ECOOP-2003-OderskyCRZ #dependent type

A Nominal Theory of Objects with Dependent Types (MO, VC, CR, MZ), pp. 201–224.

OOPSLA-2003-FahndrichL #object-oriented

Declaring and checking non-null types in an object-oriented language (MF, KRML), pp. 302–312.

OOPSLA-2003-TipKB #constraints #refactoring #using

Refactoring for generalization using type constraints (FT, AK, DB), pp. 13–26.

PPDP-2003-Damiani #rank

Rank 2 intersection types for modules (FD), pp. 67–78.

PPDP-2003-MiculanS #framework #semantics

A framework for typed HOAS and semantics (MM, IS), pp. 184–194.

PPDP-2003-Rossberg #data type

Generativity and dynamic opacity for abstract types (AR), pp. 241–252.

PADL-2003-CoelhoF #logic programming #type system #xml

Type-Based XML Processing in Logic Programming (JC, MF), pp. 273–285.

POPL-2003-BartheCKL #type system

Pure patterns type systems (GB, HC, CK, LL), pp. 250–261.

POPL-2003-BoyapatiLS #encapsulation

Ownership types for object encapsulation (CB, BL, LS), pp. 213–223.

POPL-2003-Crary #assembly #towards

Toward a foundational typed assembly language (KC), pp. 198–212.

POPL-2003-DreyerCH #higher-order #type system

A type system for higher-order modules (DD, KC, RH), pp. 236–249.

POPL-2003-PetersenHCP #layout #memory management #type system

A type theory for memory allocation and data layout (LP, RH, KC, FP), pp. 172–184.

POPL-2003-Thielecke #continuation

From control effects to typed continuation passing (HT), pp. 139–149.

POPL-2003-ZibinG #algorithm #incremental

Incremental algorithms for dispatching in dynamically typed languages (YZ, JYG), pp. 126–138.

POPL-2003-ZibinGC #algorithm #morphism #performance

Efficient algorithms for isomorphisms of simple types (YZ, JYG, JC), pp. 160–171.

SAC-2003-SatoA #multi

Accessee Controlled Type Selection for a Multiple-Type Object (HS, MA), pp. 515–521.

CC-2003-BurrowsFW #runtime #source code #type checking

Run-Time Type Checking for Binary Programs (MB, SNF, JLW), pp. 90–105.

CC-2003-JoishaB #matlab #type inference

The MAGICA Type Inference Engine for MATLAB (PGJ, PB), pp. 121–125.

CC-2003-LeagueST #compilation #java #precise

Precision in Practice: A Type-Preserving Java Compiler (CL, ZS, VT), pp. 106–120.

CADE-2003-Stump #set

Subset Types and Partial Functions (AS), pp. 151–165.

CSL-2003-DavidG #normalisation #λ-calculus

Strong Normalization of the Typed λws-Calculus (RD, BG), pp. 155–168.

CSL-2003-Khoussainov #algebra #data type #on the #specification

On Algebraic Specifications of Abstract Data Types (BK), pp. 299–313.

ICLP-2003-LagoonMS #analysis #termination

Termination Analysis with Types Is More Accurate (VL, FM, PJS), pp. 254–268.

ICLP-2003-Morrisett #low level #type safety

Achieving Type Safety for Low-Level Code (JGM), pp. 1–2.

LICS-2003-Kopylov #type system

Dependent Intersection: A New Way of Defining Records in Type Theory (AK), pp. 86–95.

LICS-2003-KuncakR #decidability #recursion #type system

Structural Subtyping of Non-Recursive Types is Decidable (VK, MCR), pp. 96–107.

LICS-2003-Murawski #equivalence #on the

On Program Equivalence in Languages with Ground-Type References (ASM), p. 108–?.

LICS-2003-Pierce #generative #programming language

Types and Programming Languages: The Next Generation (BCP), p. 32–?.

RTA-2003-AotoY #term rewriting #termination

Termination of Simply Typed Term Rewriting by Translation and Labelling (TA, TY), pp. 380–394.

RTA-2003-McAllester #algorithm #logic #ml #type inference

Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference (DAM), pp. 436–451.

TLCA-2003-Abel #termination

Termination and Productivity Checking with Continuous Types (AA0), pp. 1–15.

TLCA-2003-Blanqui #algebra #calculus #induction

Inductive Types in the Calculus of Algebraic Constructions (FB), pp. 46–59.

TLCA-2003-Boudol #normalisation #on the

On Strong Normalization in the Intersection Type Discipline (GB), pp. 60–74.

TLCA-2003-CoppolaR #logic #type system

Principal Typing in Elementary Affine Logic (PC, SRDR), pp. 90–104.

TLCA-2003-CoquandPT #framework #logic

A Logical Framework with Dependently Typed Records (TC, RP, MT), pp. 105–119.

TLCA-2003-Joly #encoding #problem

Encoding of the Halting Problem into the Monster Type & Applications (TJ), pp. 153–166.

TLCA-2003-Kahrs #source code

Well-Going Programs Can Be Typed (SK), pp. 167–179.

VMCAI-2003-GoriL #interpreter

Properties of a Type Abstract Interpreter (RG, GL), pp. 132–145.

VMCAI-2003-Levi #communication #evolution

Types for Evolving Communication in Safe Ambients (FL), pp. 102–115.

DATE-2002-LinLC #feedback #performance

An Efficient Test and Diagnosis Scheme for the Feedback Type of Analog Circuits with Minimal Added Circuits (JWL, CLL, JEC), p. 1119.

ITiCSE-2002-AlmBEOS #c# #exclamation #set

You’d better set down for this!: creating a set type for CS1 & CS2 in C# (JA, RB, SE, CDO, AS), pp. 14–18.

ESOP-2002-AspinallH #type system

Another Type System for In-Place Update (DA, MH), pp. 36–52.

ESOP-2002-Grossman #imperative

Existential Types for Imperative Languages (DG), pp. 21–35.

ESOP-2002-Morrisett #type checking

Type Checking Systems Code (JGM), pp. 1–5.

ESOP-2002-Weirich #analysis #higher-order

Higher-Order Intensional Type Analysis (SW), pp. 98–114.

ESOP-2002-WellsH #branch

Branching Types (JBW, CH), pp. 115–132.

FASE-2002-BernardoF #architecture

Architectural Types Revisited: Extensible And/Or Connections (MB, FF), pp. 113–127.

FoSSaCS-2002-JhaPZ #performance

Efficient Type Matching (SJ, JP, TZ), pp. 187–204.

WRLA-2002-CirsteaKL #calculus

Rewriting Calculus with(out) Types (HC, CK, LL), pp. 3–19.

SCAM-J-2001-SouterP02 #automation #identification

Characterization and automatic identification of type infeasible call chains (ALS, LLP), pp. 721–732.

ICSM-2002-Curtis #maturity #principle

The Principle of Organizational Maturity and E-Type Dynamics (BC), p. 68.

ASIA-PEPM-2002-IwamaK #type system #virtual machine

A new type system for JVM lock primitives (FI, NK), pp. 71–82.

ASIA-PEPM-2002-LopezH

Principal type specialisation (PEML, JH), pp. 94–105.

ASIA-PEPM-2002-SheardL #analysis #search-based #using

Search-based binding time analysis using type-directed pruning (TS, NL), pp. 20–31.

ASIA-PEPM-2002-Xi #functional #object-oriented #programming

Unifying object-oriented programming with typed functional programming (HX), pp. 117–125.

PEPM-2002-BartheU #continuation #induction

CPS translating inductive and coinductive types (GB, TU), pp. 131–142.

PLDI-2002-FahndrichD #imperative #linear #programming

Adoption and Focus: Practical Linear Types for Imperative Programming (MF, RD), pp. 13–24.

PLDI-2002-FosterTA

Flow-Sensitive Type Qualifiers (JSF, TT, AA), pp. 1–12.

SAS-2002-BruynoogheCGV #analysis #logic programming #reuse #source code #termination

Reuse of Results in Termination Analysis of Typed Logic Programs (MB, MC, SG, WV), pp. 477–492.

SAS-2002-LuK #type checking #type inference

Backward Type Inference Generalises Type Checking (LL, AK), pp. 85–101.

SAS-2002-VaucheretB #logic programming #performance #precise #source code #type inference

More Precise Yet Efficient Type Inference for Logic Programs (CV, FB), pp. 102–116.

SAS-2002-WhaleyL #analysis #performance #points-to #strict

An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages (JW, MSL), pp. 180–195.

SAS-2002-Zanotti #abstract interpretation #security

Security Typings by Abstract Interpretation (MZ), pp. 360–375.

STOC-2002-JainV #algorithm

Equitable cost allocations via primal-dual-type algorithms (KJ, VVV), pp. 313–321.

ICALP-2002-Wells

The Essence of Principal Typings (JBW), pp. 913–925.

AFP-2002-Wadler02 #functional #named #query #xml #xquery

XQuery: A Typed Functional Language for Querying XML (PW), pp. 188–212.

ICFP-2002-BaarsS #dynamic typing #type system

Typing dynamic typing (AIB, SDS), pp. 157–166.

ICFP-2002-CraryV #scalability #type system

An expressive, scalable type theory for certified code (KC, JV), pp. 191–205.

ICFP-2002-DubeF #adaptation #analysis

A demand-driven adaptive type analysis (DD, MF), pp. 84–97.

ICFP-2002-NeubauerT #higher-order #morphism #polymorphism

Type classes with more higher-order polymorphism (MN, PT), pp. 179–190.

ICFP-2002-PasalicTS #staged

Tagless staged interpreters for typed languages (EP, WT, TS), pp. 218–229.

IFL-2002-LindahlS #compilation #float

Unboxed Compilation of Floating Point Arithmetic in a Dynamically Typed Language Environment (TL, KFS), pp. 134–149.

IFL-2002-WeeldenP #functional #operating system #towards

Towards a Strongly Typed Functional Operating System (AvW, MJP), pp. 215–231.

ICGT-2002-HeckelKT #confluence #graph transformation

Confluence of Typed Attributed Graph Transformation Systems (RH, JMK, GT), pp. 161–176.

CAiSE-2002-Olive #concept #modelling #representation

Representation of Generic Relationship Types in Conceptual Modeling (AO), pp. 675–691.

ICEIS-2002-Olive #concept #modelling

Specific Relationship Types in Conceptual Modeling: The Cases of Generic and with Common Participants (AO), p. 9.

ICPR-v3-2002-Kwon #classification #clustering #using

Hangul Tree Classifier for Type Clustering Using Horizontal and Vertical Strokes (YBK), pp. 228–231.

SEKE-2002-BarbutiTBF #bytecode #java #verification

Fixing the Java bytecode verifier by a suitable type domain (RB, LT, CB, NDF), pp. 377–382.

ECOOP-2002-AlagicK #behaviour #self

Behavioral Compatibility of Self-Typed Theories (SA, SK), pp. 585–608.

ECOOP-2002-GlewP #type safety

Type-Safe Method Inlining (NG, JP), pp. 525–544.

ECOOP-2002-IgarashiV #on the #parametricity #type system

On Variance-Based Subtyping for Parametric Types (AI, MV), pp. 441–469.

ECOOP-2002-Zenger #component #evolution #prototype #type safety

Type-Safe Prototype-Based Component Evolution (MZ), pp. 470–497.

OOPSLA-2002-BoyapatiLR #programming

Ownership types for safe programming: preventing data races and deadlocks (CB, RL, MCR), pp. 211–230.

OOPSLA-2002-ClarkeD #encapsulation

Ownership, encapsulation and the disjointness of type and effect (DGC, SD), pp. 292–310.

GPCE-2002-BalatD #partial evaluation

Memoization in Type-Directed Partial Evaluation (VB, OD), pp. 78–92.

LOPSTR-2002-GutierrezR #calculus #type system #verification

A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene (FG, BCR), pp. 17–31.

PPDP-2002-Fiore #analysis #evaluation #normalisation #semantics #λ-calculus

Semantic analysis of normalisation by evaluation for typed λ calculus (MPF), pp. 26–37.

PPDP-2002-HiguchiO #bytecode #calculus #java

Java bytecode as a typed term calculus (TH, AO), pp. 201–211.

PPDP-2002-Shafarenko #morphism #type inference #type system

Coercion as homomorphism: type inference in a system with subtyping and overloading (AVS), pp. 14–25.

PADL-2002-LammelV #combinator #traversal

Typed Combinators for Generic Traversal (RL, JV), pp. 137–154.

PADL-2002-Thiemann #composition #named #web

WASH/CGI: Server-Side Web Scripting with Sessions and Typed, Compositional Forms (PT), pp. 192–208.

POPL-2002-AbadiB #logic programming #protocol #security #source code

Analyzing security protocols with secrecy types and logic programs (MA, BB), pp. 33–44.

POPL-2002-ChakiRR #message passing #model checking #modelling #source code

Types as models: model checking message-passing programs (SC, SKR, JR), pp. 45–57.

POPL-2002-HondaY #data flow

A uniform type structure for secure information flow (KH, NY), pp. 81–92.

POPL-2002-NeculaMW #legacy #named #type safety

CCured: type-safe retrofitting of legacy code (GCN, SM, WW), pp. 128–139.

POPL-2002-ShaoSTP #type system

A type system for certified binaries (ZS, BS, VT, NP), pp. 217–232.

POPL-2002-ShufGBS #memory management #optimisation

Exploiting prolific types for memory management and optimizations (YS, MG, RB, JPS), pp. 295–306.

CADE-2002-Ahrendt #data type #deduction #fault #generative #specification #using

Deductive Search for Errors in Free Data Type Specifications Using Model Generation (WA), pp. 211–225.

CSL-2002-Goubault-LarrecqLN #logic #monad

Logical Relations for Monadic Types (JGL, SL, DN), pp. 553–568.

CSL-2002-Leivant #complexity

Implicit Computational Complexity for Higher Type Functionals (DL), pp. 367–381.

LICS-2002-FioreCB #morphism #λ-calculus

Remarks on Isomorphisms in Typed λ Calculi with Empty and Sum Types (MPF, RDC, VB), p. 147–?.

LICS-2002-PalsbergZ #performance #type inference #type system

Efficient Type Inference for Record Concatenation and Subtyping (JP, TZ), pp. 125–136.

LICS-2002-Simpson #modelling #recursion #set

Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory (AKS), pp. 287–298.

VMCAI-2002-GoriL #abstract interpretation #empirical #type inference #verification

An Experiment in Type Inference and Verification by Abstract Interpretation (RG, GL), pp. 225–239.

ASE-2001-Erwig #data type #source code

Programs Are Abstract Data Types (ME), pp. 400–403.

DATE-2001-CichonB #data type #network

Annotated data types for addressed token passing networks (GC, WB), p. 801.

DocEng-2001-Tozawa #static typing #towards #type checking

Towards static type checking for XSLT (AT), pp. 18–27.

ESOP-2001-AmtoftKP #question #what

What Are Polymorphically-Typed Ambients? (TA, AJK, SMPG), pp. 206–220.

ESOP-2001-ConchonP #calculus #constraints #type inference

JOIN(X): Constraint-Based Type Inference for the Join-Calculus (SC, FP), pp. 221–236.

ESOP-2001-Thiemann #safety #using

Enforcing Safety Properties Using Type Specialization (PT), pp. 62–76.

ESOP-2001-Weirich #analysis #encoding

Encoding Intensional Type Analysis (SW), pp. 92–106.

FASE-2001-LoginovYHR #debugging #runtime #type checking

Debugging via Run-Time Type Checking (AL, SHY, SH, TWR), pp. 217–232.

FoSSaCS-2001-AbadiB #communication #symmetry

Secrecy Types for Asymmetric Communication (MA, BB), pp. 25–41.

FoSSaCS-2001-BartheP #dependent type #morphism #proving #reuse #type system

Type Isomorphisms and Proof Reuse in Dependent Type Theory (GB, OP), pp. 57–71.

FoSSaCS-2001-BuscemiS #calculus #petri net

High-Level Petri Nets as Type Theories in the Join Calculus (MGB, VS), pp. 104–120.

FoSSaCS-2001-Coppo #equation #recursion #type inference

Type Inference with Recursive Type Equations (MC), pp. 184–198.

IWPC-J-1999-DeursenM01 #cobol #empirical

An empirical study into COBOL type inferencing (AvD, LM), pp. 189–211.

ICSM-2001-OrsoSH #incremental #slicing

Incremental Slicing Based on Data-Dependences Types (AO, SS, MJH), p. 158–?.

ICSM-2001-TonellaP #c++ #diagrams #reverse engineering #uml

Reverse Engineering of the UML Class Diagram from C++ Code in Presence of Weakly Typed Containers (PT, AP), pp. 376–385.

PASTE-2001-Palsberg #analysis #type system

Type-based analysis and applications (JP), pp. 20–27.

SCAM-2001-MaggiS #analysis #bytecode #data flow #java #using

Using Data Flow Analysis to Infer Type Information in Java Bytecode (PM, RS), p. 213–?.

SCAM-2001-SouterP

Type Infeasible Call Chains (ALS, LLP), pp. 196–205.

WCRE-2001-Guilfanov #re-engineering #type system

A Simple Type System for Program Reengineering (IG), pp. 357–361.

WCRE-2001-MycroftOK #decompiler #type system

Comparing Type-Based and Proof-Directed Decompilation (AM, AO, SyK), pp. 362–367.

PLDI-2001-AmmeDFR #named #representation #type safety

SafeTSA: A Type Safe and Referentially Secure Mobile-Code Representation Based on Static Single Assignment Form (WA, ND, MF, JvR), pp. 137–147.

SAS-2001-GordonJ #analysis #protocol #security

A Type and Effect Analysis of Security Protocols (ADG, AJ), p. 432.

SAS-2001-Myers #distributed

Security-Typed Languages and Distributed Computation (ACM), pp. 437–438.

FLOPS-J1-1998-Tsukada01 #framework #type system

Martin-Löf’s Type Theory as an Open-Ended Framework (YT), pp. 31–67.

FLOPS-2001-DanvyR #haskell #syntax

A Simple Take on Typed Abstract Syntax in Haskell-like Languages (OD, MR), pp. 343–358.

FLOPS-2001-DeransartS #logic programming #source code

Well-Typed Logic Programs Are not Wrong (PD, JGS), pp. 280–295.

FLOPS-2001-LagoonS #analysis #framework #logic programming #source code

A Framework for Analysis of Typed Logic Programs (VL, PJS), pp. 296–310.

FLOPS-2001-SatoSK #calculus

A Simply Typed Context Calculus with First-Class Environments (MS, TS, YK), pp. 359–374.

FLOPS-2001-Sulzmann #framework #type inference

A General Type Inference Framework for Hindley/Milner Style Systems (MS), pp. 248–263.

ICFP-2001-Chitil #algorithm #composition #debugging #fault

Compositional Explanation of Types and Algorithmic Debugging of Type Errors (OC), pp. 193–204.

ICFP-2001-DimockWMTW #ml #standard #type safety

Functioning without Closure: Type-Safe Customized Function Representations for Standard ML (AD, IW, RM, FAT, JBW), pp. 14–25.

ICFP-2001-Duggan #type system

Type-Based Hot Swapping of Running Modules (DD), pp. 62–73.

ICFP-2001-GanzST #generative #metaprogramming #multi #type safety

Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML (SEG, AS, WT), pp. 74–85.

ICFP-2001-Sheard #unification

Generic Unification via Two-Level Types and Parameterized Modules (TS), pp. 86–97.

ICFP-2001-WalkerW #linear #on the

On Regions and Linear Types (DW, KW), pp. 181–192.

ICFP-2001-XiH #assembly

A Dependently Typed Assembly Language (HX, RH), pp. 169–180.

IFL-2001-Kreye #array #compilation

A Compilation Scheme for a Hierarchy of Array Types (DK), pp. 18–54.

IFL-2001-PenaS #type system

Sized Types for Typing Eden Skeletons (RP, CS), pp. 1–17.

KDD-2001-ChiuFCWJ #algorithm #clustering #database #robust #scalability

A robust and scalable clustering algorithm for mixed type attributes in large database environment (TC, DF, JC, YW, CJ), pp. 263–268.

ECOOP-2001-ClarkeNP

Simple Ownership Types for Object Containment (DGC, JN, JP), pp. 53–76.

ECOOP-2001-RaynaudT #encoding #performance #testing

A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests (OR, ET), pp. 165–180.

ECOOP-2001-WangS #constraints #java #precise #type inference

Precise Constraint-Based Type Inference for Java (TW, SFS), pp. 99–117.

OOPSLA-2001-BoyapatiR #java #source code #type system

A Parameterized Type System for Race-Free Java Programs (CB, MCR), pp. 56–69.

OOPSLA-2001-GrothoffPV #encapsulation

Encapsulating Objects with Confined Types (CG, JP, JV), pp. 241–253.

TOOLS-USA-2001-Li #data type #on the

On ODMG Data Types (LL), pp. 219–228.

LOPSTR-2001-Caldwell #recursion #type system

Extracting General Recursive Program Schemes in Nuprl’s Type Theory (JLC), pp. 233–244.

LOPSTR-2001-LeuschelG #deduction #model checking #using

Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking (ML, SG), pp. 91–110.

PPDP-2001-BossiCR #logic programming #source code #termination

Termination of Well-Typed Logic Programs (AB, NC, SR), pp. 73–81.

PPDP-2001-Gordon #type system

Types for Cyphers: Thwarting Mischief and Malice with Type Theory (ADG), p. 136.

PPDP-2001-RychlikowskiT #logic programming #polymorphism

Polymorphic Directional Types for Logic Programming (PR, TT), pp. 61–72.

PADL-2001-FlenerHK #compilation #constraints #programming

Compiling High-Level Type Constructors in Constraint Programming (PF, BH, ZK), pp. 229–244.

POPL-2001-Gil #type system

Subtyping arithmetical types (JYG), pp. 276–289.

POPL-2001-GordonS #multi #type system

Typing a multi-language intermediate code (ADG, DS), pp. 248–260.

POPL-2001-IgarashiK #type system #π-calculus

A generic type system for the π-calculus (AI, NK), pp. 128–141.

POPL-2001-OderskyZZ #type inference

Colored local type inference (MO, CZ, MZ), pp. 41–53.

POPL-2001-RehofF #analysis #polymorphism #type system

Type-base flow analysis: from polymorphic subtyping to CFL-reachability (JR, MF), pp. 54–66.

POPL-2001-Sewell #data type #distributed #version control

Modules, abstract types, and distributed versioning (PS), pp. 236–247.

POPL-2001-ShieldsM

Type-indexed rows (MS, EM), pp. 261–275.

POPL-2001-WangA #garbage collection

Type-preserving garbage collectors (DCW, AWA), pp. 166–178.

CC-2001-SchuppGML #generative #type system

User-Extensible Simplification — Type-Based Optimizer Generators (SS, DG, DRM, SML), pp. 86–101.

CSL-2001-AbramskyL #modelling #λ-calculus

Fully Complete Minimal PER Models for the Simply Typed λ-Calculus (SA, ML), pp. 443–457.

CSL-2001-Courtieu #normalisation

Normalized Types (PC), pp. 554–569.

CSL-2001-KopylovN #markov #type system

Markov’s Principle for Propositional Type Theory (AK, AN), pp. 570–584.

CSL-2001-Schroder

Life without the Terminal Type (LS), pp. 429–442.

IJCAR-2001-AvronL #canonical #type system

Canonical Propositional Gentzen-Type Systems (AA, IL), pp. 529–544.

LICS-2001-AltenkirchDHS #evaluation #normalisation #λ-calculus

Normalization by Evaluation for Typed λ Calculus with Coproducts (TA, PD, MH, PJS), pp. 303–310.

LICS-2001-Jeffrey #induction #lts #type system

A Symbolic Labelled Transition System for Coinductive Subtyping of Fμ≤ Types (AJ), pp. 323–333.

LICS-2001-Pfenning #proving #type system

Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory (FP), pp. 221–230.

LICS-2001-Xi #dependent type #termination #verification

Dependent Types for Program Termination Verification (HX), pp. 231–242.

RTA-2001-Yamada #confluence #term rewriting #termination

Confluence and Termination of Simply Typed Term Rewriting Systems (TY), pp. 338–352.

TLCA-2001-Altenkirch #algebra #first-order

Representations of First Order Function Types as Terminal Coalgebras (TA), pp. 8–21.

TLCA-2001-CoppolaM #constraints #linear #logic #type system

Typing λ Terms in Elementary Logic with Linear Constraints (PC, SM), pp. 76–90.

TLCA-2001-Danner #dependent type

Ramified Recurrence with Dependent Types (ND), pp. 91–105.

TLCA-2001-deLiguoro #calculus #convergence

Characterizing Convergent Terms in Object Calculi via Intersection Types (Ud), pp. 315–328.

TLCA-2001-DoughertyL #reduction

Reductions, Intersection Types, and Explicit Substitutions (DJD, PL), pp. 121–135.

TLCA-2001-Geuvers #dependent type #higher-order #induction #type system

Induction Is Not Derivable in Second Order Dependent Type Theory (HG), pp. 166–181.

TLCA-2001-Hofmann #behaviour #bound #complexity #memory management #type system

From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour (MH0), pp. 2–3.

TLCA-2001-Jay #calculus #data type

Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types (CBJ), pp. 217–239.

TLCA-2001-Joly #λ-calculus

The Finitely Generated Types of the λ-Calculus (TJ), pp. 240–252.

TLCA-2001-Matthes #higher-order #induction #λ-calculus #μ-calculus

Parigot’s Second Order λμ-Calculus and Inductive Types (RM), pp. 329–343.

TLCA-2001-Padovani

Retracts in Simple Types (VP), pp. 376–384.

SIGMOD-2000-GarofalakisGRSS #documentation #named #xml

XTRACT: A System for Extracting Document Type Descriptors from XML Documents (MNG, AG, RR, SS, KS), pp. 165–176.

ESOP-2000-AmtoftT #polymorphism

Faithful Translations between Polyvariant Flows and Polymorphic Types (TA, FAT), pp. 26–40.

ESOP-2000-CejtinJW

Flow-Directed Closure Conversion for Typed Languages (HC, SJ, SW), pp. 56–71.

ESOP-2000-Charatonik #logic programming #source code #type checking

Directional Type Checking for Logic Programs: Beyond Discriminative Types (WC), pp. 72–87.

ESOP-2000-Hofmann #bound #functional #type system

A Type System for Bounded Space and Functional In-Place Update--Extended Abstract (MH0), pp. 165–179.

ESOP-2000-HondaVY #behaviour #data flow #process

Secure Information Flow as Typed Process Behaviour (KH, VTV, NY), pp. 180–199.

ESOP-2000-Hughes #correctness

The Correctness of Type Specialisation (JH), pp. 215–229.

ESOP-2000-Jones #dependence #functional

Type Classes with Functional Dependencies (MPJ), pp. 230–244.

ESOP-2000-Pottier #type inference

A 3-Part Type Inference Engine (FP), pp. 320–335.

ESOP-2000-SmithW #analysis

Polyvariant Flow Analysis with Constrained Types (SFS, TW), pp. 382–396.

ESOP-2000-SmithWM #alias

Alias Types (FS, DW, JGM), pp. 366–381.

FoSSaCS-2000-Damiani #rank #type system

Typing Local Definitions and Conditional Expressions with Rank 2 Intersection (FD), pp. 82–97.

FoSSaCS-2000-HonsellLST #refinement #λ-calculus

Constructive Data Refinement in Typed λ Calculus (FH, JL, DS, AT), pp. 161–176.

FoSSaCS-2000-MaiettiPR #category theory #linear #modelling #type system

Categorical Models for Intuitionistic and Linear Type Theory (MEM, VdP, ER), pp. 223–237.

FoSSaCS-2000-Schubert #first-order #logic #type inference

Type Inference for First-Order Logic (AS), pp. 297–313.

FoSSaCS-2000-Zimmer #algorithm #mobile #type system

Subtyping and Typing Algorithms for Mobile Ambients (PZ), pp. 375–390.

TACAS-2000-XiongL #component #design #type system

An Extensible Type System for Component-Based Design (YX, EAL), pp. 20–37.

WRLA-2000-CirsteaK #calculus

The simply typed rewriting calculus (HC, CK), pp. 24–42.

WCRE-J-1997-GirardK00 #comparison #data type

A comparison of abstract data types and objects recovery techniques (JFG, RK), pp. 149–181.

ICSM-2000-Chapin00b #maintenance #perspective

Software Maintenance Types — A Fresh View (NC), p. 247–?.

IWPC-2000-GirardW #approach #classification #data type #detection

Evaluating the Accessor Classification Approach to Detect Abstract Data Types (JFG, MW), pp. 87–95.

IWPC-2000-KuipersM #concept analysis #legacy

Types and Concept Analysis for Legacy Systems (TK, LM), pp. 221–230.

WCRE-2000-DeursenM #legacy #using

Exploring Legacy Systems using Types (AvD, LM), pp. 32–41.

PEPM-2000-ChinK

Calculating Sized Types (WNC, SCK), pp. 62–72.

PEPM-2000-GrobauerY #partial evaluation

The Second Futamura Projection for Type-Directed Partial Evaluation (BG, ZY), pp. 22–32.

PEPM-2000-Kobayashi #type system

Type-Based Useless Variable Elimination (NK), pp. 84–93.

PLDI-2000-FlanaganF #concurrent #detection #java #type system

Type-based race detection for Java (CF, SNF), pp. 219–232.

SAS-2000-FinkKS #analysis #array

Unified Analysis of Array and Object References in Strongly Typed Languages (SJF, KK, VS), pp. 155–174.

SAS-2000-GagnonHM #bytecode #java #performance #static typing

Efficient Inference of Static Types for Java Bytecode (EG, LJH, GM), pp. 199–219.

ICALP-2000-CalcagnoMT #approach #imperative #multi #programming

Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming (CC, EM, WT), pp. 25–36.

ICALP-2000-Konig #mobile #process #type system

Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System (BK0), pp. 403–414.

WLC-2000-Saito

Acts over Right, Left Regular Bands and Semilattices Types (TS), pp. 396–402.

ICFP-2000-ChakravartyK #parallel #programming

More types for nested data parallel programming (MMTC, GK), pp. 94–105.

ICFP-2000-Crary #compilation #type system

Typed compilation of inclusive subtyping (KC), pp. 68–81.

ICFP-2000-DaviesP

Intersection types and computational effects (RD, FP), pp. 198–208.

ICFP-2000-HosoyaVP #regular expression #xml

Regular expression types for XML (HH, JV, BCP), pp. 11–22.

ICFP-2000-SkalkaS #security

Static enforcement of security with types (CS, SFS), pp. 34–45.

ICFP-2000-TrifonovSS #analysis #reflexive

Fully reflexive intensional type analysis (VT, BS, ZS), pp. 82–93.

ICFP-2000-Weirich #functional #type safety

Type-safe cast: functional pearl (SW), pp. 58–67.

ICPR-v2-2000-HiraokaHHMMY #algorithm #analysis #learning #linear

Successive Learning of Linear Discriminant Analysis: Sanger-Type Algorithm (KH, KiH, MH, HM, TM, SY), pp. 2664–2667.

ICPR-v3-2000-MullerH #image #invariant #on the

On the Use of SDF-Type Filters for Distortion Invariant Image Location (NM, BMH), pp. 3530–3533.

SIGIR-2000-EfthimiadisF #behaviour #case study #database #image #query

The effect of query type on subject searching behavior of image databases: an exploratory study (ENE, RF), pp. 328–330.

SIGIR-2000-Vakkari #documentation #performance

Relevance and contributing information types of searched documents in task performance (PV), pp. 2–9.

ECOOP-2000-DobsonM

Ionic Types (SAD, BM), pp. 296–312.

ECOOP-2000-MalabarbaPGBB #java #runtime #type safety

Runtime Support for Type-Safe Dynamic Java Classes (SM, RP, JG, ETB, JFB), pp. 337–361.

ECOOP-2000-SecoC #component

A Basic Model of Typed Components (JCS, LC), pp. 108–128.

TOOLS-ASIA-2000-JiangLX #process #type system #uml

Embedding UML and Type Theory to Formalize the Process of Requirement Engineering (HJ, DL, XX), pp. 32–39.

TOOLS-PACIFIC-2000-ColnetL #eiffel

Match-O, A Dialect of Eiffel with Match-Types (DC, LL), pp. 190–201.

PPDP-2000-HanusS #functional #logic programming #nondeterminism #source code #type system

Type-based nondeterminism checking in functional logic programs (MH, FS), pp. 202–213.

PPDP-2000-Lu #analysis #logic programming #precise #source code

A precise type analysis of logic programs (LL), pp. 214–225.

SAIG-2000-BerardiCDG #functional #source code #type system

Type-Based Useless-Code Elimination for Functional Programs (SB, MC, FD, PG), pp. 172–189.

SAIG-2000-Makholm #on the

On Jones-Optimal Specialization for Strongly Typed Languages (HM), pp. 129–148.

PADL-2000-ChuangM #functional #programming #type system

Out-of-Core Functional Programming with Type-Based Primitives (TRC, SCM), pp. 32–46.

POPL-2000-AppelF #semantics

A Semantic Model of Types and Machine Instuctions for Proof-Carrying Code (AWA, APF), pp. 243–253.

POPL-2000-Bawden #metaprogramming

First-Class Macros have Types (AB), pp. 133–141.

POPL-2000-KnoblockR #bytecode #java #type system

Type Elaboration and Subtype Completion for Java Bytecode (TBK, JR), pp. 228–242.

POPL-2000-LewisLMS #parametricity #static typing

Implicit Parameters: Dynamic Scoping with Static Types (JRL, JL, EM, MS), pp. 108–118.

POPL-2000-LiblitA #data type #distributed #type system

Type Systems for Distributed Data Structures (BL, AA), pp. 199–213.

POPL-2000-SandholmS #documentation #type system #web

A Type System for Dynamic Web Documents (AS, MIS), pp. 290–301.

POPL-2000-StoneH #equivalence

Deciding Type Equivalence with Singleton Kinds (CAS, RH), pp. 214–227.

POPL-2000-Walker #policy #security #type system

A Type System for Expressive Security Policies (DW), pp. 254–267.

SAC-2000-LenartSG #analysis #constant

SSA-based Flow-sensitive Type Analysis: Combining Constant and Type Propagation (AL, CS, SKSG), pp. 813–817.

FSE-2000-BernardoCD #algebra #architecture #formal method #on the #process

On the formalization of architectural types with process algebras (MB, PC, LD), pp. 140–148.

ISMM-2000-HirzelD #garbage collection #on the

On the Type Accuracy of Garbage Collection (MH, AD), pp. 1–11.

CADE-2000-AndrewsBB #proving #theorem proving #type system

System Description: TPS: A Theorem Proving System for Type Theory (PBA, MB, CEB), pp. 164–169.

CADE-2000-BezemHN #automation #proving #type system #using

Automated Proof Construction in Type Theory Using Resolution (MB, DH, HdN), pp. 148–163.

CL-2000-Fitting #database

Databases and Higher Types (MF), pp. 41–52.

CSL-2000-AbramskyL #ml #polymorphism

A Fully Complete PER Model for ML Polymorphic Types (SA, ML), pp. 140–155.

CSL-2000-Aspinall #type system

Subtyping with Power Types (DA), pp. 156–171.

CSL-2000-BauerB #dependent type

Continuous Functionals of Dependent Types and Equilogical Spaces (AB, LB), pp. 202–216.

CSL-2000-HancockS #dependent type #interactive #source code #type system

Interactive Programs in Dependent Type Theory (PH, AS), pp. 317–331.

LICS-2000-BussK #bound

Resource-Bounded Continuity and Sequentiality for Type-Two Functionals (SRB, BMK), pp. 77–83.

LICS-2000-Miquel #type system

A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping (AM), pp. 18–29.

LICS-2000-PalsbergZ #flexibility #performance #recursion

Efficient and Flexible Matching of Recursive Types (JP, TZ), pp. 388–398.

LICS-2000-Xi #dependent type #imperative #programming

Imperative Programming with Dependent Types (HX), pp. 375–387.

LICS-2000-YoshidaH #process

Assigning Types to Processes (NY, MH), pp. 334–345.

TestCom-2000-MaggioreVP #approach #quality

The Test Sub Group (TSG): A Cooperative Approach to Improve the Release Quality before Type Acceptance (GM, SV, JP), p. 239–?.

ASE-1999-Kreuer #automation #case study #network #testing

Applying Test Automation to Type Acceptance Testing of Telecom Networks: A Case Study with Customer Participation (DK), pp. 216–223.

ASE-1999-Krustev #generative #refinement #testing #using

Software Test Generation Using Refinement Types (DNK), pp. 279–282.

DATE-1999-RadetzkiSPN #analysis #data type #hardware #modelling #object-oriented #synthesis

Data Type Analysis for Hardware Synthesis from Object-Oriented Models (MR, AS, WPR, WN), p. 491–?.

ICDAR-1999-GarainC #documentation

Extraction of Type Style based Meta-Information from Imaged Documents (UG, BBC), pp. 341–344.

ICDAR-1999-KochiS #documentation #identification

User-defined Template for Identifying Document Type and Extracting Information from Documents (TK, TS), pp. 127–130.

PODS-1999-BunemanFW #constraints #interactive

Interaction between Path and Type Constraints (PB, WF, SW), pp. 56–67.

PODS-1999-BusscheW #algebra #polymorphism #relational #type inference

Type Inference in the Polymorphic Relational Algebra (JVdB, EW), pp. 80–90.

PODS-1999-MiloS #query #semistructured data #type inference

Type Inference for Queries on Semistructured Data (TM, DS), pp. 215–226.

VLDB-1999-BouganimCDDGS #data flow #data type #multi #semistructured data #web

Miro Web: Integrating Multiple Data Sources through Semistructured Data Types (LB, TCSY, TTDN, JLD, GG, FS), pp. 750–753.

VLDB-1999-ChenCFGJMTW

High Level Indexing of User-Defined Types (WC, JHC, YCF, JG, MJ, NMM, BTT, YW), pp. 554–564.

VLDB-1999-DeRose #question #what #xml

What Do Those Weird XML Types Want, Anyway? (SJD), pp. 721–724.

VLDB-1999-FuhDCMTLDRM #implementation #inheritance #sql

Implementation of SQL3 Structured Types with Inheritance and Value Substitutability (YCF, SD, WC, NMM, BTT, BGL, LD, SR, DM), pp. 565–574.

ESOP-1999-FlanaganA

Types for Safe Locking (CF, MA), pp. 91–108.

ESOP-1999-GayH #interactive #type system

Types and Subtypes for Client-Server Interactions (SJG, MH), pp. 74–90.

ESOP-1999-Mycroft #decompiler #re-engineering #type system

Type-Based Decompilation (or Program Reconstruction via Type Reconstruction) (AM), pp. 208–223.

FoSSaCS-1999-Sangiorgi #concurrent #reasoning #using

Reasoning About Concurrent Systems Using Types (DS), pp. 31–40.

IWPC-1999-DeursenM #cobol #comprehension #using

Understanding COBOL Systems using Inferred Types (AvD, LM), pp. 74–81.

PASTE-1999-ChandraR #c #physics #type checking

Physical Type Checking for C (SC, TWR), pp. 66–75.

PASTE-1999-Preston #fortran #legacy

New Type Signatures for Legacy Fortran Subroutines (NWP), pp. 76–85.

WCRE-1999-DucasseRN #object-oriented #re-engineering

Type-Check Elimination: Two Object-Oriented Reengineering Patterns (SD, TR, RN), p. 157–?.

PEPM-1999-Rhiger #static typing

Deriving a Statically Typed Type-Directed Partial Evaluator (MR), pp. 25–29.

PEPM-1999-Thiemann #type system

Interpreting Specialization in Type Theory (PT), pp. 30–43.

PLDI-1999-FosterFA #formal method

A Theory of Type Qualifiers (JSF, MF, AA), pp. 192–203.

STOC-1999-Indyk99a #combinator #design #symmetry

Inerpolation of Symmetric Functions and a New Type of Combinatorial Design (PI), pp. 736–740.

FLOPS-1999-AntoyT #higher-order

Typed Higher-Order Narrowing without Higher-Order Strategies (SA, APT), pp. 335–353.

FLOPS-1999-BeierleM #approximate #prolog #source code #type checking #using

Using Types as Approximations for Type Checking Prolog Programs (CB, GM), pp. 251–266.

FLOPS-1999-CamaraoF #strict #type inference

Type Inference for Overloading without Restrictions, Declarations or Annotations (CC, LF), pp. 37–52.

FLOPS-1999-Gonzalez-MorenoHR #functional #logic programming #semantics

Semantics and Types in Functional Logic Programming (JCGM, MTHG, MRA), pp. 1–20.

FLOPS-1999-RidouxBM #prolog #static analysis

Typed Static Analysis: Application to Groundness Analysis of PROLOG and λ-PROLOG (OR, PB, FM), pp. 267–283.

FLOPS-1999-VerbaetenS #analysis #logic programming #source code #termination #using

Termination Analysis of Tabled Logic Programs Using Mode and Type Information (SV, DDS), pp. 163–178.

ICALP-1999-CardelliGG #mobile

Mobility Types for Mobile Ambients (LC, ADG, GG), pp. 230–239.

ICALP-1999-CraryM #low level #programming language

Type Structure for Low-Level Programming Languages (KC, JGM), pp. 40–54.

ICALP-1999-RieckeT #continuation

Typed Exeptions and Continuations Cannot Macro-Express Each Other (JGR, HT), pp. 635–644.

IFM-1999-BoltonDW #data type #on the #process #refinement #simulation

On the Refinement and Simulation of Data Types and Processes (CB, JD, JW), pp. 273–292.

ICFP-1999-Chitil #deforestation #type inference

Type Inference Builds a Short Cut to Deforestation (OC), pp. 249–260.

ICFP-1999-CraryW #analysis #flexibility

Flexible Type Analysis (KC, SW), pp. 233–248.

ICFP-1999-Glew

Type Dispatch for Named Hierarchical Types (NG), pp. 172–182.

ICFP-1999-KfouryMTW #type system

Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract) (AJK, HGM, FAT, JBW), pp. 90–101.

ICFP-1999-LeagueST #java #representation

Representing Java Classes in a Typed Intermediate Language (CL, ZS, VT), pp. 183–196.

ICFP-1999-OhoriY #compilation #ml #morphism #polymorphism #rank #type inference

Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML (AO, NY), pp. 160–171.

ICFP-1999-Okasaki #matrix #performance

From Fast Exponentiation to Square Matrices: An Adventure in Types (CO), pp. 28–35.

ICFP-1999-SplawskiU #fixpoint #recursion

Type Fixpoints: Iteration vs. Recursion (ZS, PU), pp. 102–113.

ICFP-1999-WallaceR #combinator #haskell #question #type system #xml

Haskell and XML: Generic Combinators or Type-Based Translation? (MW, CR), pp. 148–159.

IFL-1999-Chitil #deforestation

Type-Inference Based Short Cut Deforestation (Nearly) without Inlining (OC), pp. 19–35.

CHI-1999-GoldsteinBAT #interface #mobile #type system

Non-Keyboard QWERTY Touch Typing: A Portable Input Interface for The Mobile User (MG, RB, GA, ST), pp. 32–39.

HCI-EI-1999-ChenMRK #empirical #evaluation #metric

The Physiological Measurement of User Comfort Levels: An Evaluation Experiment for Comparing Three Types of CRTs (SC, YM, XR, HK), pp. 193–196.

AdaEurope-1999-Hagenauer #distributed #on the #simulation

On the Use of Controlled Types for Fossil Collection in a Distributed Simulation Systems (HH), pp. 238–249.

ICEIS-1999-CarvalhoPJ99a #logic programming #type inference

Type Inference in Logic Programming Context (CLdC, ECP, RMdSJ), p. 764.

ICEIS-1999-RuizPPC #maintenance

Maintenance Types in the MANTEMA Methodology (FR, MP, MP, CC), p. 773.

CIKM-1999-MatsudaF #classification #documentation #retrieval #web

Task-Oriented World Wide Web Retrieval by Document Type Classification (KM, TF), pp. 109–113.

SIGIR-1999-HoelscherS #web

Searching on the Web: Two Types of Expertise (poster abstract) (CH, GS), pp. 305–306.

SIGIR-1999-MandalaTT #multi #query

Combining Multiple Evidence from Different Types of Thesaurus for Query Expansion (RM, TT, HT), pp. 191–197.

UML-1999-Clark #diagrams #type checking #uml

Type Checking UML Static Diagrams (TC), pp. 503–517.

ECOOP-1999-IgarashiP

Foundations for Virtual Types (AI, BCP), pp. 161–185.

ECOOP-1999-Kniesel #adaptation #component #runtime #type safety

Type-Safe Delegation for Run-Time Component Adaptation (GK), pp. 351–366.

ECOOP-1999-MillsteinC #composition #multi #static typing

Modular Statically Typed Multimethods (TDM, CC), pp. 279–303.

ECOOP-1999-ThorupT

Unifying Genericity — Combining the Benefits of Virtual Types and Parameterized Classes (KKT, MT), pp. 186–204.

OOPSLA-1999-Duggan #composition #java #reverse engineering #type system

Modular Type-Based Reverse Engineering of Parameterized Types in Java Code (DD), pp. 97–113.

OOPSLA-1999-VitekB

Confined Types (JV, BB), pp. 82–96.

TOOLS-ASIA-1999-LiZL #communication #csp #process #type system

The Typing of Communicating Sequential Processes (WL, XZ, SL), pp. 61–66.

TOOLS-PACIFIC-1999-SchmolitzkyEKM #how #question #type safety

How Can Covariance in Pragmatical Class Methods be Made Statically Type-Safe? (AS, ME, JLK, GM), pp. 200–209.

GCSE-1999-ForaxR #java #pattern matching #recursion

Recursive Types and Pattern-Matching in Java (RF, GR), pp. 147–164.

LOPSTR-1999-SmausHK #analysis #logic programming #source code

Mode Analysis Domains for Typed Logic Programs (JGS, PMH, AK), pp. 82–101.

PPDP-1999-DowdSHCJ #runtime

Run Time Type Information in Mercury (TD, ZS, FH, TCC, DJ), pp. 224–243.

PPDP-1999-Filinski #partial evaluation #semantics

A Semantic Account of Type-Directed Partial Evaluation (AF), pp. 378–395.

PPDP-1999-Russo #dependent type #ml #standard

Non-dependent Types for Standard ML Modules (CVR), pp. 80–97.

PADL-1999-Xi #dependent type

Dead Code Elimination through Dependent Types (HX), pp. 228–242.

POPL-1999-CardelliG #mobile

Types for Mobile Ambients (LC, ADG), pp. 79–92.

POPL-1999-CraryWM #calculus #memory management

Typed Memory Management in a Calculus of Capabilities (KC, DW, JGM), pp. 262–275.

POPL-1999-EidorffHMNST #named #type system

AnnoDomini: From Type Theory to Year 2000 Conversion Tool (PHE, FH, CM, HN, MHS, MT), pp. 1–14.

POPL-1999-GlewM #assembly #composition #type safety

Type-Safe Linking and Modular Assembly Language (NG, JGM), pp. 250–261.

POPL-1999-KfouryW #decidability #type inference

Principality and Decidable Type Inference for Finite-Rank Intersection Types (AJK, JBW), pp. 161–174.

POPL-1999-Kobayashi

Quasi-Linear Types (NK), pp. 29–42.

POPL-1999-OCallahn #bytecode #java #type system

A Simple, Comprehensive Type System for Java Bytecode Subroutines (RO), pp. 70–78.

POPL-1999-PessauxL #analysis #exception #type system

Type-Based Analysis of Uncaught Exceptions (FP, XL), pp. 276–290.

POPL-1999-RielyH #mobile #trust #type system

Trust and Partial Typing in Open Systems of Mobile Agents (JR, MH), pp. 93–104.

POPL-1999-WansbroughJ #polymorphism

Once Upon a Polymorphic Type (KW, SLPJ), pp. 15–28.

POPL-1999-XiP #dependent type #programming

Dependent Types in Practical Programming (HX, FP), pp. 214–227.

ESEC-FSE-1999-Bokowski #constraints #java #named

CoffeeStrainer: Statically-Checked Constraints on the Definition and Use of Types in Java (BB), pp. 355–374.

ESEC-FSE-1999-GrimaudLV #named #smarttech

FACADE: A Typed Intermediate Language Dedicated to Smart Cards (GG, JLL, JJV), pp. 476–493.

ESEC-FSE-1999-SiffCBKR #c

Coping with Type Casts in C (MS, SC, TB, KK, TWR), pp. 180–198.

CSL-1999-AltenkirchR #induction #monad #using

Monadic Presentations of λ Terms Using Generalized Inductive Types (TA, BR), pp. 453–468.

CSL-1999-BalatC #linear #logic #morphism

A Linear Logical View of Linear Type Isomorphisms (VB, RDC), pp. 250–265.

CSL-1999-GeuversPZ #proving #type system

Safe Proof Checking in Type Theory with Y (HG, EP, JZ), pp. 439–452.

CSL-1999-Howe #interactive #proving #theorem proving #type system #using

Interactive Theorem Proving Using Type Theory (DJH), p. 578.

CSL-1999-IshtiaqP #modelling #λ-calculus

Kripke Resource Models of a Dependently-Typed, Bunched λ-Calculus (SSI, DJP), pp. 235–249.

ICLP-1999-Bezem #logic programming #source code

Extensionality of Simply Typed Logic Programs (MB), pp. 395–410.

ICLP-1999-LuC #analysis #logic programming #source code

A Regular Type Analysis of Logic Programs (LL, JGC), p. 613.

ICLP-1999-Penn #encoding #prolog

An Optimized Prolog Encoding of Typed Feature Structures (GP), pp. 124–138.

LICS-1999-Altenkirch #similarity #type system

Extensional Equality in Intensional Type Theory (TA), pp. 412–420.

LICS-1999-BucciarelliLPS

Some Computational Properties of Intersection Types (AB, SDL, AP, IS), pp. 109–118.

LICS-1999-ColazzoG #kernel #recursion #type system

Subtyping Recursive Types in Kernel Fun (DC, GG), pp. 137–146.

LICS-1999-Hofmann99a #linear #polynomial

Linear Types and Non-Size-Increasing Polynomial Time Computation (MH0), pp. 464–473.

LICS-1999-KfouryP #recursion #type inference

Type Inference for Recursive Definitions (AJK, SMPG), pp. 119–128.

TLCA-1999-BrodaD

Counting a Type’s Principal Inhabitants (SB, LD), pp. 69–82.

TLCA-1999-Damiani #algebra #data type #detection

Useless-Code Detection and Elimination for PCF with Algebraic Data types (FD), pp. 83–97.

TLCA-1999-EidorffHMNST #approach #problem

AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem (PHE, FH, CM, HN, MHS, MT), pp. 6–13.

TLCA-1999-Fujita #call-by #morphism #polymorphism #λ-calculus #μ-calculus

Explicitly Typed λμ-Calculus for Polymorphism an Call-by-Value (KeF), pp. 162–176.

TLCA-1999-Goguen #framework #logic #semantics

Soundness of the Logical Framework for Its Typed Operational Semantics (HG), pp. 177–197.

TLCA-1999-Hasegawa #linear #logic

Logical Predicates for Intuitionistic Linear Type Theories (MH), pp. 198–212.

TLCA-1999-PollZ #data type #logic

A Logic for Abstract Data Types as Existential Types (EP, JZ), pp. 310–324.

TLCA-1999-Zwanenburg #type system

Pure Type Systems with Subtyping (JZ), pp. 381–396.

HT-1998-FurtadoM #flexibility #hypermedia #type system

Enforcing Strong Object Typing in Flexible Hypermedia (PF, HM), pp. 171–179.

PODS-1998-NevenBGV #database #query

Typed Query Languages for Databases Containing Queries (FN, JVdB, DVG, GV), pp. 189–196.

ITiCSE-1998-FarthingJM #multi #performance

Permutational multiple-choice questions: an objective and efficient alternative to essay-type examination questions (DWF, DMJ, DM), pp. 81–85.

ITiCSE-1998-HabermanSS #data type #development

Abstract data types as a project development organiser (BH, ZS, EYS), pp. 102–104.

ESOP-1998-ChatterjeeRL #complexity #exception

Complexity of Concrete Type-Inference in the Presence of Exceptions (RC, BGR, WL), pp. 57–74.

ESOP-1998-HondaVK #programming

Language Primitives and Type Discipline for Structured Communication-Based Programming (KH, VTV, MK), pp. 122–138.

ESOP-1998-Leino #logic #object-oriented #recursion #source code

Recursive Object Types in a Logic of Object-Oriented Programs (KRML), pp. 170–184.

FoSSaCS-1998-AmadioC #analysis #type system

Analysis of a Guard Condition in Type Theory (Extended Abstract) (RMA, SCG), pp. 48–62.

WCRE-1998-DeursenM #cobol #type inference

Type Inference for COBOL Systems (AvD, LM), pp. 220–230.

PLDI-1998-AgesenDM #garbage collection #java #liveness #virtual machine

Garbage Collection and Local Variable Type-Precision and Liveness in Java Virtual Machines (OA, DD, JEBM), pp. 269–279.

PLDI-1998-DiwanMM #alias #analysis #type system

Type-Based Alias Analysis (AD, KSM, JEBM), pp. 106–117.

PLDI-1998-XiP #array #bound #dependent type

Eliminating Array Bound Checking Through Dependent Types (HX, FP), pp. 249–257.

SAS-1998-CharatonikP #logic programming #source code #type inference

Directional Type Inference for Logic Programs (WC, AP), pp. 278–294.

SAS-1998-Volpe #alias #first-order #logic programming #source code

A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs (PV), pp. 184–199.

FLOPS-1998-Danvy #online #partial evaluation

Online Type-Directed Partial Evaluation (OD), pp. 271–295.

FLOPS-1998-Takeuti #type system

A Type Theory for Cyclic Strcture (IT), pp. 207–226.

FLOPS-1998-Tsukada #equation #reasoning

Type-free Equational Reasoning in the Theeory of Inductively Defined Types (YT), pp. 227–246.

ICALP-1998-Danvy

A Simple Solution to Type Specialization (OD), pp. 908–917.

ICALP-1998-Gimenez #recursion #type system

Structural Recursive Definitions in Type Theory (EG), pp. 397–408.

ICALP-1998-Pitts #equivalence #logic

Existential Types: Logical Relations and Operational Equivalence (AMP), pp. 309–326.

ICALP-1998-TahaBS #axiom #multi #programming #type safety

Multi-Stage Programming: Axiomatization and Type Safety (WT, ZEAB, TS), pp. 918–929.

AFP-1998-Augustsson98 #dependent type #named

Cayenne — A Language with Dependent Types (LA), pp. 240–267.

ICFP-1998-AnP #approach

A Structured Approach to Retrieving Functions by Types (NA, YP), p. 344.

ICFP-1998-Augustsson #dependent type #named

Cayenne — a Language with Dependent Types (LA), pp. 239–250.

ICFP-1998-CraryWM #morphism #polymorphism #semantics

Intensional Polymorphism in Type-Erasure Semantics (KC, SW, JGM), pp. 301–312.

ICFP-1998-Ennals98a #type system

Verbose Typing (RE), p. 340.

ICFP-1998-Gustavsson #analysis #optimisation

A Type Based Sharing Analysis for Update Avoidance and Optimisation (JG), pp. 39–50.

ICFP-1998-Kieburtz #monad #type system

Taming Effects with Monadic Typing (RBK), pp. 51–62.

ICFP-1998-McAdam #fault

Type Errors Confuse the Programmer (Poster Abstract) (BJM), p. 338.

ICFP-1998-MinamideG #complexity #on the #runtime

On the Runtime Complexity of Type-Directed Unboxing (YM, JG), pp. 1–12.

ICFP-1998-Pottier #framework #type inference #type system

A Framework for Type Inference with Subtyping (FP), pp. 228–238.

ICFP-1998-Shao #compilation

Typed Cross-Module Compilation (ZS), pp. 141–152.

ICFP-1998-ShaoLM #implementation

Implementing Typed Intermediate Languages (ZS, CL, SM), pp. 313–323.

ICFP-1998-Yang #encoding

Encoding Types in ML-Like Languages (ZY), pp. 289–300.

IFL-1998-McAdam #interface #on the #unification

On the Unification of Substitutions in Type Interfaces (BJM), pp. 137–152.

IFL-1998-Pil

Dynamic Types and Type Dependent Functions (MP), pp. 169–185.

SIGAda-1998-KiddleW

Extensible Protected Types (OPK, AJW), pp. 229–239.

CIKM-1998-PalopoliSU #automation #database #detection

An Automatic Techniques for Detecting Type Conflicts in Database Schemes (LP, DS, DU), pp. 306–313.

ECOOP-1998-BruceOW #static typing

A Statically Safe Alternative to Virtual Types (KBB, MO, PW), pp. 523–549.

ECOOP-1998-GilI #analysis #complexity #object-oriented #source code

The Complexity of Type Analysis of Object Oriented Programs (JYG, AI), pp. 601–634.

ECOOP-1998-Guimaraes #static typing

Reflection for Statically Typed Languages (JdOG), pp. 440–461.

OOPSLA-1998-BuchiW #java

Compound Types for Java (MB, WW), pp. 362–373.

OOPSLA-1998-CartwrightS #java #programming language #runtime

Compatible Genericity with Run-Time Types for the Java Programming Language (RC, GLSJ), pp. 201–215.

OOPSLA-1998-ClarkePN #alias #flexibility

Ownership Types for Flexible Alias Protection (DGC, JP, JN), pp. 48–64.

OOPSLA-1998-FreundM #bytecode #java #type system

A Type System for Object Initialization in the Java Bytecode Language (SNF, JCM), pp. 310–327.

OOPSLA-1998-Litvinov #morphism #polymorphism #static typing #towards #type system

Contraint-Based Polymorphism in Cecil: Towards a Practical and Static Type System (VL), pp. 388–411.

TOOLS-USA-1998-MengerKES #implementation #library #object-oriented

Collection Types and Implementations in Object-Oriented Software Libraries (GM, JLK, ME, AS), p. 97–?.

ALP-PLILP-1998-ClearyL #using

Constructive Negation Using Typed Existence Properties (JGC, LL), pp. 411–426.

ALP-PLILP-1998-LeviS #empirical #logic programming #refinement #source code

An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs (GL, FS), pp. 152–169.

LOPSTR-1998-AvelloneFM #data type #source code #synthesis

Synthesis of Programs in Abstract Data Types (AA, MF, PM), pp. 81–100.

POPL-1998-LeroyR #security

Security Properties of Typed Applets (XL, FR), pp. 391–403.

POPL-1998-MorrisettWCG #assembly #system f

From System F to Typed Assembly Language (JGM, DW, KC, NG), pp. 85–97.

POPL-1998-NipkowO #java #type safety

JavaNone is Type-Safe — Definitely (TN, DvO), pp. 161–170.

POPL-1998-Nishimura #static typing #type system

Static Typing for Dynamic Messages (SN), pp. 266–278.

POPL-1998-PalsbergP

From Polyvariant Flow Information to Intersection and Union Types (JP, CP), pp. 197–208.

POPL-1998-PierceT #type inference

Local Type Inference (BCP, DNT), pp. 252–265.

POPL-1998-RielyH #distributed #mobile #process

A Typed Language for Distributed Mobile Processes (Extended Abstract) (JR, MH), pp. 378–390.

POPL-1998-Schubert #higher-order #morphism #polymorphism #type inference #unification

Second-Order Unification and Type Inference for Church-Style Polymorphism (AS), pp. 279–288.

POPL-1998-ShieldsSJ #dynamic typing #staged #type inference #type system

Dynamic Typing as Staged Type Inference (MS, TS, SLPJ), pp. 289–302.

POPL-1998-StataA #bytecode #java #type system

A Type System for Java Bytecode Subroutines (RS, MA), pp. 149–160.

ISMM-1998-KakkadJW #compilation #runtime

Portable Run-Time Type Description for Conventional Compilers (SVK, MSJ, PRW), pp. 146–153.

CADE-1998-Crary #fixpoint #induction

Admissibility of Fixpoint Induction over Partial Types (KC), pp. 270–285.

CSL-1998-Altenkirch #induction #logic

Logical Relations and Inductive/Coinductive Types (TA), pp. 343–354.

CSL-1998-Barthe #normalisation #type system

Existence and Uniqueness of Normal Forms in Pure Type Systems with βη-Conversion (GB), pp. 241–259.

CSL-1998-Matthes #fixpoint #normalisation

Monotone Fixed-Point Types and Strong Normalization (RM), pp. 298–312.

CSL-1998-Vorobyov #functional #type system

Subtyping Functional+Nonempty Record Types (SGV), pp. 283–297.

JICSLP-1998-FagesP #type system

A Generic Type System for CLP(chi) (FF, MP), pp. 353–354.

LICS-1998-BirkedalCRS #category theory #type system

Type Theory via Exact Categories (LB, AC, GR, DSS), pp. 188–198.

LICS-1998-DawarHS #finite #quantifier

Ordering Finite Variable Types with Generalized Quantifiers (AD, LH, AS), pp. 28–43.

LICS-1998-FioreH #axiom #game studies #process #recursion #representation

Recursive Types in Games: Axiomatics and Process Representation (MPF, KH), pp. 345–356.

LICS-1998-Viswanathan #abstraction #first-order #recursion #type system

Full Abstraction for First-Order Objects with Recursive Types and Subtyping (RV), pp. 380–391.

LICS-1998-Yokouchi #quantifier

Completeness of Type Assignment Systems with Intersection, Union, and Type Quantifiers (HY), pp. 368–379.

ASE-1997-GirardKS #approach #data type #detection

A Metric-based Approach to Detect Abstract Data Types and State Encapsulations (JFG, RK, GS), pp. 82–89.

ASE-1997-Lerner #automation #evolution #named #persistent

TESS: Automated Support for the Evolution of Persistent Types (BSL), p. 172–?.

ICDAR-1997-TsengC #documentation #recognition

The Recognition of Form Documents Based on Three Types of Line Segments (LYT, RCC), pp. 71–75.

SIGMOD-1997-SeshadriP #data type #named

PREDATOR: An OR-DBMS with Enhanced Data Types (PS, MP), pp. 568–571.

VLDB-1997-SeshadriLR #data type

The Case for Enhanced Abstract Data Types (PS, ML, RR), pp. 66–75.

TACAS-1997-OwreRS #integration #model checking

Integration in PVS: Tables, Types, and Model Checking (SO, JMR, NS), pp. 366–383.

WCRE-1997-GirardKS #architecture #comparison #comprehension #data type #detection #encapsulation

Comparison of Abstract Data Type and Abstract State Encapsulation Detection Techniques for Architectural Understanding (JFG, RK, GS), pp. 66–75.

PEPM-1997-Sheard #online #polymorphism

A Type-directed, On-line, Partial Evaluator for a Polymorphic Language (TS), pp. 22–35.

SAS-1997-IgarashiK #analysis #communication #concurrent #programming language #type system

Type-Based Analysis of Communication for Concurrent Programming Languages (AI, NK), pp. 187–201.

SAS-1997-JagannathanWW #analysis

Type-Directed Flow Analysis for Typed Intermediate Languages (SJ, SW, AKW), pp. 232–249.

ICALP-1997-Gianantonio #data type

An Abstract Data Type for Real Numbers (PDG), pp. 121–131.

ICFP-1997-Banerjee #analysis #composition #type system

A Modular, Polyvariant, and Type-Based Closure Analysis (AB), pp. 1–10.

ICFP-1997-BellBH

Type-Driven Defunctionalization (JMB, FB, JH), pp. 25–37.

ICFP-1997-DimockMTW #representation

Strongly Typed Flow-Directed Representation Transformations (AD, RM, FAT, JBW), pp. 11–24.

ICFP-1997-Dornan

Affordable Dynamic Types (CD), p. 311.

ICFP-1997-DussartHT #imperative

Type Specialization for Imperative Languages (DD, JH, PT), pp. 204–216.

ICFP-1997-LaunchburyS #axiom #monad #type safety

Monadic State: Axiomatization and Type Safety (JL, AS), pp. 227–238.

ICFP-1997-McAdam #ml

BigTypes in ML (BJM), p. 316.

IFL-1997-Agat

Types for Register Allocation (JA), pp. 92–111.

IFL-1997-Mogensen

Types for 0, 1 or Many Uses (TÆM), pp. 112–122.

HCI-CC-1997-ShimizuSSSTIY #difference

Differences of Force Distribution Patterns on Grip Types in Human Grasping Motions (SS, MS, SS, YS, AT, YI, MY), pp. 425–428.

EDOC-1997-MunkeLCM #distributed #reuse

Type Management: A Key to Software Reuse in Open Distributed Systems (MM, WL, BOC, KMJ), pp. 78–89.

ECOOP-1997-Almeida #data type

Balloon Types: Controlling Sharing of State in Data Types (PSA), pp. 32–59.

ECOOP-1997-DrossopoulouE #java #type safety

Java is Type Safe — Probably (SD, SE), pp. 389–418.

ECOOP-1997-KrallVH #encoding

Near Optimal Hierarchical Encoding of Types (AK, JV, RNH), pp. 128–145.

ECOOP-1997-Puntigam #coordination #requirements

Coordination Requirements Expressed in Types for Active Objects (FP), pp. 367–388.

ECOOP-1997-Thorup #java

Genericity in Java with Virtual Types (KKT), pp. 444–471.

OOPSLA-1997-AgesenFM #java

Adding Type Parameterization to the Java Language (OA, SNF, JCM), pp. 49–65.

OOPSLA-1997-VitekHK #performance #testing

Efficient Type Inclusion Tests (JV, RNH, AK), pp. 142–157.

TOOLS-PACIFIC-1997-EveredKMS #java #named

Genja — A New Proposal for Parameterised Types in Java (ME, JLK, GM, AS), pp. 181–195.

TOOLS-PACIFIC-1997-KeedyESM #implementation

Attribute Types and Bracket Implementations (JLK, ME, AS, GM), pp. 325–339.

TOOLS-PACIFIC-1997-WongC #multi #type safety

Method Dispatching and Type Safety for Objects with Multiple Roles (RKW, HLC), pp. 286–296.

ALP-1997-Almendros-JimenezG #lazy evaluation #order #parametricity

Lazy Narrowing with Parametric Order Sorted Types (JMAJ, AGL), pp. 159–173.

ALP-1997-BartheR #algebra #approach #termination #type system

Termination of Algebraic Type Systems: The Syntactic Approach (GB, FvR), pp. 174–193.

POPL-1997-BankLM #java

Parameterized Types for Java (ACM, JAB, BL), pp. 132–145.

POPL-1997-BourdoncleM #higher-order #multi #polymorphism

Type-Checking Higher-Order Polymorphic Multi-Methods (FB, SM), pp. 302–315.

POPL-1997-ChenH #linear #monad

Rolling Your Own MADT — A Connection Between Linear Types and Monads (CPC, PH), pp. 54–66.

POPL-1997-Cousot #abstract interpretation

Types as Abstract Interpretations (PC), pp. 316–331.

POPL-1997-FradetM

Shape Types (PF, DLM), pp. 27–39.

POPL-1997-Jones #morphism #polymorphism #type inference

First-class Polymorphism with Type Inference (MPJ), pp. 483–496.

POPL-1997-Rehof #type system

Minimal Typings in Atomic Subtyping (JR), pp. 278–291.

POPL-1997-Ruf #analysis #clustering #data flow #using

Partitioning Dataflow Analyses Using Types (ER), pp. 15–26.

POPL-1997-Saibi #algorithm #inheritance #type system

Typing Algorithm in Type Theory with Inheritance (AS), pp. 292–301.

ICSE-1997-OCallahanJ #comprehension #named #type inference

Lackwit: A Program Understanding Tool Based on Type Inference (RO, DJ), pp. 338–348.

ASF+SDF-1997-DineshT #approach #case study #fault

A case study of a slicing-based approach for locating type errors (TBD, FT), p. 8.

CADE-1997-GanzingerMW #order #type system

Soft Typing for Ordered Resolution (HG, CM, CW), pp. 321–335.

CSL-1997-Moschovakis #concurrent #game studies #recursion #λ-calculus

A Game-Theoretic, Concurrent and Fair Model of the Typed λ-calculus, with Full Recursion (YNM), pp. 341–359.

CSL-1997-Pezzoli #complexity #on the

On the Computational Complexity of Type 2 Functionals (EP), pp. 373–388.

ICLP-1997-SmausHK #analysis #logic programming #source code

Domain Construction for Mode Analysis of Typed Logic Programs (JGS, PMH, AK), p. 418.

ILPS-1997-Arenas-SanchezR #algebra #calculus #functional #lazy evaluation #logic programming #polymorphism

A Lazy Narrowing Calculus for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 53–67.

ILPS-1997-Pietrzak #type inference

Type Inference for CLP(FD) (PP), p. 407.

LICS-1997-Grohe #finite #scalability

Large Finite Structures with Few Lk-Types (MG), pp. 216–227.

LICS-1997-HengleinR #complexity #type system

The Complexity of Subtype Entailment for Simple Types (FH, JR), pp. 352–361.

LICS-1997-Kobayashi #calculus #concurrent #process

A Partially Deadlock-Free Typed Process Calculus (NK0), pp. 128–139.

RTA-1997-KuhlerW #data type #equation #induction #proving #specification #theorem proving

Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving (UK, CPW), pp. 38–52.

TLCA-1997-BelleM #analysis

Typed Intermediate Languages for Shape Analysis (GB, EM), pp. 11–29.

TLCA-1997-BerardiB #data type #functional

Minimum Information Code in a Pure Functional Language with Data Types (SB, LB), pp. 30–45.

TLCA-1997-BrandtH #axiom #induction #recursion #similarity #type system

Coinductive Axiomatization of Recursive Type Equality and Subtyping (MB, FH), pp. 63–81.

TLCA-1997-Courant #calculus #type system

A Module Calculus for Pure Type Systems (JC), pp. 112–128.

TLCA-1997-Ghani #calculus #dependent type #type system

Eta-Expansions in Dependent Type Theory — The Calculus of Constructions (NG), pp. 164–180.

TLCA-1997-Kurata

A Type Theoretical View of Böhm-Trees (TK), pp. 231–247.

TLCA-1997-Urzyczyn #approach #λ-calculus

Inhabitation in Typed λ-Calculi (A Syntactic Approach) (PU), pp. 373–389.

TLCA-1997-Xi #normalisation #λ-calculus

Weak and Strong β Normalisations in Typed λ-Calculi (HX), pp. 390–404.

HT-1996-Allen #automation #hypermedia #type system

Automatic Hypertext Link Typing (JFA), pp. 42–52.

ESOP-1996-BakelBF #abstraction #normalisation #term rewriting

Rewrite Systems with Abstraction and β-Rule: Types, Approximants and Normalization (SvB, FB, MF), pp. 387–403.

ESOP-1996-Bechet #encoding #partial evaluation #using

Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages (DB), pp. 77–91.

ESOP-1996-LaunchburyP #parametricity

Parametricity and Unboxing with Unpointed Types (JL, RP), pp. 204–218.

ESOP-1996-SmithV #c #polymorphism #towards #type system

Towards an ML-Style Polymorphic Type System for C (GS, DMV), pp. 341–355.

WCRE-1996-GravleyL #identification

Identifying Enumeration Types Modeled with Symbolic Constants (JMG, AL), p. 227–?.

PLDI-1996-TarditiMCSHL #compilation #ml #named #optimisation

TIL: A Type-Directed Optimizing Compiler for ML (DT, JGM, PC, CAS, RH, PL), pp. 181–192.

SAS-1996-CoppoDG #program analysis #refinement

Refinement Types for Program Analysis (MC, FD, PG), pp. 143–158.

SAS-1996-TrifonovS #type system

Subtyping Constrained Types (VT, SFS), pp. 349–365.

Best-of-PLDI-1996-TarditiMCSHL96a #compilation #ml #named #optimisation

TIL: a type-directed, optimizing compiler for ML (with retrospective) (DT, JGM, PC, CAS, RH, PL), pp. 554–567.

ICALP-1996-BookVW #on the #probability #quantifier

On Type-2 Probabilistic Quantifiers (RVB, HV, KWW), pp. 369–380.

ICALP-1996-Mossakowski #framework #logic

Different Types of Arrow Between Logical Frameworks (TM), pp. 158–169.

ICFP-1996-GostanzaPN #data type #pattern matching

A New Look to Pattern Matching in Abstract Data Types (PPG, RP, MN), pp. 110–121.

ICFP-1996-Howard #induction

Inductive, Coinductive, and Pointed Types (BTH), pp. 102–109.

IFL-1996-DebbabiFT #algorithm #analysis #concurrent #control flow #higher-order #source code #type system

A Type-Based Algorithm for the Control-Flow Analysis of Higher-Order Concurrent Programs (MD, AF, NT), pp. 247–266.

AdaEurope-1996-MundieFK #embedded #implementation

Implementing Protected Types on Embedded Targets (DM, JF, EK), pp. 287–297.

ICPR-1996-ManabeI #image #recognition #using

Recognition of material types using spectral image (YM, SI), pp. 840–843.

ICPR-1996-ShioyamaJ #3d #constraints

Numerical 3-D shape inference from shading with new type of constraint (TS, WBJ), pp. 364–368.

ICPR-1996-ZibulskiZ #component #multi

Signal- and image-component separation by a multi-window Gabor-type scheme (MZ, YYZ), pp. 835–839.

ECOOP-1996-BoylandC #compilation #type safety

Type-Safe Compilation of Covariant Specialization: A Practical Case (JB, GC), pp. 3–25.

ECOOP-1996-BrandtK #type system

Generalising the BETA Type System (SB, JLK), pp. 421–448.

ECOOP-1996-GaweckiM #perspective #quantifier #type system

Integrating Subtyping, Matching and Type Quantification: A Practical Perspective (AG, FM), pp. 26–47.

ECOOP-1996-QianK #functional #object-oriented #programming

Typed Object-Oriented Functional Programming with Late Binding (ZQ, BKB), pp. 48–72.

OOPSLA-1996-DiwanMM #analysis #effectiveness #object-oriented #source code #static typing

Simple and Effective Analysis of Statically Typed Object-Oriented Programs (AD, JEBM, KSM), pp. 292–305.

ALP-1996-Almendros-JimenezGG #algebra #functional #logic programming #order #polymorphism #semantics

Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types (JMAJ, AGF, AGL), pp. 299–313.

ALP-1996-Nazareth #specification #type system

Specifying Type Systems (DN), pp. 314–329.

LOPSTR-1996-MartinKS #logic programming #source code

Typed Norms for Typed Logic Programs (JCM, AK, PS), pp. 224–238.

PLILP-1996-AponteC #morphism

Type Isomorphisms for Module Signatures (MVA, RDC), pp. 334–346.

PLILP-1996-DanvyV #case study #compilation #partial evaluation #semantics

Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation (OD, RV), pp. 182–197.

PLILP-1996-LouvetR #morphism #parametricity #polymorphism #prolog

Parametric Polymorphism for Typed Prolog and λ-Prolog (PL, OR), pp. 47–61.

POPL-1996-AbadiCV

An Interpretation of Objects and Object Types (MA, LC, RV), pp. 396–409.

POPL-1996-Danvy #partial evaluation

Type-Directed Partial Evaluation (OD), pp. 242–257.

POPL-1996-HughesPS #correctness #proving #using

Proving the Correctness of Reactive Systems Using Sized Types (JH, LP, AS), pp. 410–423.

POPL-1996-Jim #question #what

What Are Principal Typings and What Are They Good For? (TJ), pp. 42–53.

POPL-1996-MinamideMH

Typed Closure Conversion (YM, JGM, RH), pp. 271–283.

POPL-1996-OderskyL

Putting Type Annotations to Work (MO, KL), pp. 54–67.

FSE-1996-MedvidovicORT #architecture #design #object-oriented #type system #using

Using Object-Oriented Typing to Support Architectural Design in the C2 Style (NM, PO, JER, RNT), pp. 24–32.

CC-1996-Steensgaard #analysis #points-to #source code #type inference

Points-to Analysis by Type Inference of Programs with Structures and Unions (BS), pp. 136–150.

CC-1996-VitekH #object-oriented

Compact Dispatch Tables for Dynamically Typed Object Oriented Languages (JV, RNH), pp. 309–325.

CADE-1996-Sengler #algorithm #data type #termination

Termination of Algorithms over Non-freely Generated Data Types (CS), pp. 121–135.

CSL-1996-BartheM #algebra #on the #reduction #type system

On the Subject Reduction Property for Algebraic Type Systems (GB, PAM), pp. 34–57.

CSL-1996-Geuvers #dependent type #higher-order #logic #modelling #type system

Extending Models of Second Order Predicate Logic to Models of Second Dependent Type Theory (HG), pp. 167–181.

CSL-1996-Luo #type system

Coercive Subtyping in Type Theory (ZL), pp. 276–296.

CSL-1996-Roversi #resource management #λ-calculus

A Type-Free Resource-Aware λ-Calculus (LR), pp. 399–413.

JICSLP-1996-TanL #logic programming #source code #synthesis

Type Synthesis for Logic Programs (JT, IPL), pp. 200–214.

LICS-1996-AbadiF #recursion

Syntactic Considerations on Recursive Types (MA, MPF), pp. 242–252.

LICS-1996-AspinallC #dependent type #summary #type system

Subtyping Dependent Types (Summary) (DA, ABC), pp. 86–97.

LICS-1996-HillebrandK #on the #power of #λ-calculus

On the Expressive Power of Simply Typed and Let-Polymorphic λ Calculi (GGH, PCK), pp. 253–263.

LICS-1996-Ong #category theory #proving #semantics

A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract) (CHLO), pp. 230–241.

LICS-1996-TiurynU #decidability #higher-order #problem #type system

The Subtyping Problem for Second-Order Types is Undecidable (JT, PU), pp. 74–85.

RTA-1996-FettigL #finite #higher-order #unification #λ-calculus

Unification of Higher-Order patterns in a Simply Typed λ-Calculus with Finite Products and terminal Type (RF, BL), pp. 347–361.

RTA-1996-Virga #dependent type #higher-order

Higher-Order Superposition for Dependent Types (RV), pp. 123–137.

KBSE-1995-Reuss #deduction #synthesis #towards #type system

Towards High-Level Deductive Program Synthesis Based on Type Theory (HR), pp. 174–183.

KBSE-1995-Richardson #automation #data type #functional #source code

Automating Changes of Data Type in Functional Programs (JR), pp. 166–173.

ICDAR-v1-1995-LeeK95b #network #recognition

A new type of recurrent neural network for handwritten character recognition (SWL, YJK), pp. 38–41.

VLDB-1995-TreschPL #classification #documentation

Type Classification of Semi-Structured Documents (MT, NP, AL), pp. 263–274.

ESOP-J-1994-HankinM95 #lazy evaluation #program analysis #type inference

Lazy Type Inference and Program Analysis (CH, DLM), pp. 219–249.

WCRE-1995-YehHR #data type

Recovering Abstract Data Types and Object Instances from a Conventional Procedural Language (ASY, DRH, HBR), pp. 227–236.

PEPM-1995-Lu #analysis #logic programming #source code

Type Analysis of Logic Programs in the Presence of Type Definitions (LL), pp. 241–252.

PEPM-1995-Monsuez #abstract interpretation #strict #type inference #using

Using Abstract Interpretation to Define a Strictness Type Inference System (BM), pp. 122–133.

PLDI-1995-ShaoA #compilation #ml #standard #type system

A Type-Based Compiler for Standard ML (ZS, AWA), pp. 116–129.

SAS-1995-Hannan #analysis #functional #stack #type system

A Type-based Analysis for Stack Allocation in Functional Languages (JH), pp. 172–188.

SAS-1995-Heintze #analysis #control flow #type system

Control-Flow Analysis and Type Systems (NH), pp. 189–206.

SAS-1995-RaoS #execution #prolog #source code

Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs (MRKKR, RKS), pp. 243–260.

FPCA-1995-AikenF #dynamic typing #type inference #type system

Dynamic Typing and Subtype Inference (AA, MF), pp. 182–191.

FPCA-1995-HengleinR #ml #polymorphism #type inference

Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML (FH, JR), pp. 192–203.

FPCA-1995-Jones

Simplifying and Improving Qualified Types (MPJ), pp. 160–169.

FPCA-1995-MeijerH #exponential

Bananas in Space: Extending Fold and Unfold to Exponential Types (EM, GH), pp. 324–333.

FPCA-1995-Thiemann #polymorphism #revisited #type system

Unboxed Values and Polymorphic Typing Revisited (PT), pp. 24–35.

FPCA-1995-TurnerWM

Once Upon a Type (DNT, PW, CM), pp. 1–11.

CIKM-1995-Tammet #using

Using Resolution for Extending KL-ONE-type Languages (TT), pp. 326–332.

ECOOP-1995-Agesen #algorithm #morphism #parametricity #polymorphism #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 #polymorphism #type safety

PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language (KBB, AS, RvG), pp. 27–51.

ECOOP-1995-StroudW #data type #protocol #using

Using Metaobject Protocols to Implement Atomic Data Types (RJS, ZW), pp. 168–189.

OOPSLA-1995-AgesenH #comparison #feedback #object-oriented #optimisation #type inference

Type Feedback vs. Concrete Type Inference: A Comparison of Optimization Techniques for Object-Oriented Languages (OA, UH), pp. 91–107.

OOPSLA-1995-EifrigST #polymorphism #type inference

Sound Polymorphic Type Inference for Objects (JE, SFS, VT), pp. 169–184.

PLILP-1995-BarendsenS #type inference

Uniqueness Type Inference (EB, SS), pp. 189–206.

PLILP-1995-SaglamG #approximate #constraints #logic programming #polymorphism #source code #using

Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions (HS, JPG), pp. 461–462.

POPL-1995-HarperM #analysis #compilation #morphism #polymorphism #using

Compiling Polymorphism Using Intensional Type Analysis (RH, JGM), pp. 130–141.

POPL-1995-HoangM #bound #type inference #type system

Lower Bounds on Type Inference with Subtypes (MH, JCM), pp. 176–185.

POPL-1995-PalsbergO #analysis #type system

A Type System Equivalent to Flow Analysis (JP, PO), pp. 367–378.

SAC-1995-Gibson #algorithm #data type #multi #optimisation #problem #search-based

A genetic algorithm for optimizing problems with multiple disparate data types (GMG), pp. 300–304.

SAC-1995-Scholz #concurrent #data type #functional #programming language

Turning a functional data type into a concurrent programming language (ES), pp. 135–139.

ASF+SDF-1995-MauwM #data type #library

A PSF Library of Data Types (SM, JCM), pp. 53–64.

ICLP-1995-Beierle #logic programming #order #polymorphism #source code

Type Inferencing for Polymorphic Order-Sorted Logic Programs (CB), pp. 765–779.

ICLP-1995-BoyeM #aspect-oriented

Two Aspects of Directional Types (JB, JM), pp. 747–761.

ICLP-1995-TanL #logic programming #source code #synthesis

Type Synthesis for Logic Programs (JT, IPL), p. 823.

ILPS-1995-BigotD #approach

A Simple Approach to Supporting Untagged Objects in Dynamically Typed Languages (PAB, SKD), pp. 257–271.

ILPS-1995-Liu #datalog #named #set #tuple

Relationlog: A Typed Extension to Datalog with Sets and Tuples (Extended Abstract) (ML), pp. 83–97.

ILPS-1995-MalfonF #approach #semantics #source code

Type Correct programs: A semantic approach (BM, GF), pp. 576–590.

LICS-1995-Constable #experience #type system

Experience with Type Theory as a Foundation for Computer Science (RLC), pp. 266–279.

LICS-1995-GayN #calculus #process

A Typed Calculus of Synchronous Processes (SJG, RN), pp. 210–220.

LICS-1995-Jeffrey #concurrent #functional #monad #semantics

A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types (AJ), pp. 255–264.

LICS-1995-KfouryW #normalisation #proving #reduction #semantics #λ-calculus

New Notions of Reduction and Non-Semantic Proofs of β-Strong Normalization in Typed λ-Calculi (AJK, JBW), pp. 311–321.

LICS-1995-MiculanG #process

Modal μ-Types for Processes (MM, FG), pp. 221–231.

TLCA-1995-Barthe #type system

Extensions of Pure Type Systems (GB), pp. 16–31.

TLCA-1995-Goguen #semantics

Typed Operational Semantics (HG), pp. 186–200.

TLCA-1995-Hofmann

A Simple Model for Quotient Types (MH0), pp. 216–234.

TLCA-1995-Holmes #type system #λ-calculus

Untyped λ-Calculus with Relative Typing (MRH), pp. 235–248.

TLCA-1995-Kondoh #data type #equation

Basic Properties of Data Types with Inequational Refinements (HK), pp. 279–296.

TLCA-1995-KurataT #decidability #type system

Decidable Properties of Intersection Type Systems (TK, MT), pp. 297–311.

TLCA-1995-Mellie #λ-calculus

Typed λ-calculi with explicit substitutions may not terminate (PAM), pp. 328–334.

TLCA-1995-RitterP #ml #standard #λ-calculus

A Fully Abstract Translation between a λ-Calculus with Reference Types and Standard ML (ER, AMP), pp. 397–413.

TLCA-1995-Simpson #category theory #λ-calculus

Categorical completeness results for the simply-typed λ-calculus (AKS), pp. 414–427.

TLCA-1995-Springintveld #higher-order

Third-Order Matching in the Presence of Type Constructors (JS), pp. 428–442.

EDAC-1994-AGZS #functional #testing

Functional Tests for Ring-Address SRAM-type FIFOs (AJvdG, YZ, IS), p. 666.

EDAC-1994-SchoofsGM #architecture #design #multi #optimisation

Signal Type Optimisation in the Design of Time-Multiplexed DSP Architectures (KS, GG, HDM), pp. 502–506.

HT-ECHT-1994-AmannSR #multi #query

Querying Typed Hypertexts in Multicard/O2 (BA, MS, AR), pp. 198–205.

PODS-1994-HillebrandK #database #functional #order #query #λ-calculus

Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (GGH, PCK), pp. 222–231.

PODS-1994-Tannen #named #tutorial

Tutorial: Languages for Collection Types (VT), pp. 150–154.

ESOP-J-1992-Henglein94 #dynamic typing #proving #syntax #type system

Dynamic Typing: Syntax and Proof Theory (FH), pp. 197–230.

ESOP-J-1992-Jones94 #formal method

A Theory of Qualified Types (MPJ), pp. 231–256.

ESOP-J-1992-Larcheveque94 #interprocedural #object-oriented

Interprocedural Type Propagation for Object-Oriented Languages (JML), pp. 257–282.

ESOP-1994-Amtoft #fixpoint #re-engineering

Local Type Reconstruction by Means of Symbolic Fixed Point Iteration (TA), pp. 43–57.

ESOP-1994-HallHJW #haskell

Type Classes in Haskell (CVH, KH, SLPJ, PW), pp. 241–256.

ESOP-1994-HankinM #analysis #lazy evaluation #strict #type inference

Lazy Type Inference for the Strictness Analysis of Lists (CH, DLM), pp. 257–271.

ESOP-1994-JayC #morphism #polymorphism

Shapely Types and Shape Polymorphism (CBJ, JRBC), pp. 302–316.

ESOP-1994-Kennedy

Dimension Types (AK), pp. 348–362.

ICSM-1994-CanforaCTM #data type #identification #precise #reuse

A Precise Method for Identifying Reusable Abstract Data Types in Code (GC, AC, MT, MM), pp. 404–413.

PEPM-1994-Baker-Finch #higher-order #static analysis #type system

Type Theory and Projections for Higher-Order Static Analysis (CABF), pp. 43–52.

PEPM-1994-CourtenageC #type inference #λ-calculus

Analysing Resource Use in the λ Calculus by Type Inference (SC, CDC), pp. 33–41.

PLDI-1994-HentenryckCC #analysis #graph #prolog #using

Type Analysis of Prolog Using Type Graphs (PVH, AC, BLC), pp. 337–348.

PLDI-1994-HolzleU #feedback #optimisation #runtime

Optimizing Dynamically-Dispatched Calls with Run-Time Type Feedback (UH, DU), pp. 326–336.

SAS-1994-Agesen #constraints #morphism #parametricity #polymorphism #type inference

Constraint-Based Type Inference and Parametric Polymorphism (OA), pp. 78–100.

SAS-1994-AikenL #logic programming #source code #type checking

Directional Type Checking of Logic Programs (AA, TKL), pp. 43–60.

SAS-1994-BanerjeeS #call-by #λ-calculus

Stackability in the Simply-Typed Call-by-Value λ Calculus (AB, DAS), pp. 131–146.

SAS-1994-CodishD #dependence #logic programming #multi #polymorphism #source code #using

Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop (MC, BD), pp. 281–296.

SAS-1994-HankinM #framework #program analysis #type system

A Type-based Framework for Program Analysis (CH, DLM), pp. 380–394.

SAS-1994-Henglein #analysis #fixpoint #strict #type system

Iterative Fixed Point Computation for Type-Based Strictness Analysis (FH), pp. 395–407.

ICALP-1994-HintermeierKK #dynamic typing #equation #order

Dynamically-Typed Computations for Order-Sorted Equational Presentations (CH, CK, HK), pp. 450–461.

ICALP-1994-KanellakisHM #analysis #re-engineering

An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction (PCK, GGH, HGM), pp. 83–105.

LFP-1994-AdityaFH #garbage collection #re-engineering #runtime #using

Garbage Collection for Strongly-Typed Languages Using Run-Time Type Reconstruction (SA, CHF, JEH), pp. 12–23.

LFP-1994-Cosmadakis #algebra #proving

Complete Proof Systems for Algebraic Simply-Typed Terms (SSC), pp. 220–226.

LFP-1994-DzengH #re-engineering

Type Reconstruction for Variable-Arity Procedures (HD, CTH), pp. 239–249.

LFP-1994-Hall #representation #type inference #using

Using Hindley-Milner Type Inference to Optimise List Representation (CVH), pp. 162–172.

LFP-1994-KfouryW #algorithm #higher-order #type inference #λ-calculus

A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order λ-Calculus (AJK, JBW), pp. 196–207.

LFP-1994-Thatte #revisited #semantics

Semantics of Type Classes Revisited (SRT), pp. 208–219.

LFP-1994-Tolmach #garbage collection #parametricity #using

Tag-Free Garbage Collection Using Explicit Type Parameters (APT), pp. 1–11.

LFP-1994-WrightC #type system

A Practical Soft Type System for Scheme (AKW, RC), pp. 250–262.

TAGT-1994-CorradiniELMP #category theory #graph grammar

The Category of Typed Graph Grammars and its Adjunctions with Categories (AC, HE, ML, UM, JP), pp. 56–74.

AdaEurope-1994-BarbeyB #ada #data type #specification #testing #using

Testing Ada Abstract Data Types Using Formal Specifications (SB, DB), pp. 76–89.

AdaEurope-1994-SotirovskiJK #data type

Beyond Abstract Data Types: Giving Life to Objects (DMS, SSJ, PK), pp. 111–120.

TRI-Ada-1994-ComarP #ada #implementation

Ada 9X Tagged Types and Their Implementation in GNAT (CC, BP), pp. 71–81.

TRI-Ada-1994-Kempe #ada #data type

Abstract Data Types are Under Full Control with Ada 9X (MK), pp. 141–152.

CAiSE-1994-SeoL #data type #formal method #process #reuse #using

Formalisation of Data and Process Model Reuse Using Hierarchic Data Types (DS, PL), pp. 256–268.

ECOOP-1994-Vasconcelos #concurrent

Typed Concurrent Objects (VTV), pp. 100–117.

ECOOP-1994-VitekH #message passing #performance

Taming Message Passing: Efficient Method Look-Up for Dynamically Typed Languages (JV, RNH), pp. 432–449.

OOPSLA-1994-EifrigSTZ #decidability #object-oriented #type system

Application of OOP Type Theory: State, Decidability, Integragtion (JE, SFS, VT, AEZ), pp. 16–30.

OOPSLA-1994-KobayashiY #concurrent #object-oriented #programming

Type-Theoretic Foundations for Concurrent Object-Oriented Programming (NK, AY), pp. 31–45.

OOPSLA-1994-PlevyakC #object-oriented #precise #type inference

Precise Concrete Type Inference for Object-Oriented Languages (JP, AAC), pp. 324–340.

TOOLS-EUROPE-1994-LawsonHQ #eiffel #inheritance

The Potential For Reverse Type Inheritance in Eiffel (TL, CH, MQ), pp. 349–357.

TOOLS-EUROPE-1994-SurendharA #evolution #object-oriented #using

Object-Oriented Type Evolution Using Reflection (MS, SA), pp. 271–280.

LOPSTR-1994-MarakakisG #data type #design #logic programming #source code #top-down #using

Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types (EIM, JPG), pp. 138–153.

LOPSTR-1994-SolnonR #dependence #type inference

Propagation of Inter-argument Dependencies in “Tuple-distributive” Type Inference Systems (CS, MR), pp. 199–214.

LOPSTR-1994-Wiggins #re-engineering

Improving the Whelk System: A Type-Theoretic Reconstruction (GAW), pp. 231–247.

POPL-1994-AikenWL #type system

Soft Typing with Conditional Types (AA, ELW, TKL), pp. 163–173.

POPL-1994-BosschereDGK #interprocedural #optimisation

Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages (KDB, SKD, DG, SK), pp. 409–420.

POPL-1994-GarrigueA #polymorphism #λ-calculus

The Typed Polymorphic Label-Selective λ-Calculus (JG, HAK), pp. 35–47.

POPL-1994-HankinM #algorithm #analysis #strict #type inference

Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis (CH, DLM), pp. 202–212.

POPL-1994-HarperL #approach #higher-order

A Type-Theoretic Approach to Higher-Order Modules with Sharing (RH, ML), pp. 123–137.

POPL-1994-KatiyarLM #prototype #type system

A Type System for Prototyping Languages (DK, DCL, JCM), pp. 138–150.

POPL-1994-Leroy #compilation

Manifest Types, Modules, and Separate Compilation (XL), pp. 109–122.

POPL-1994-TofteT #call-by #implementation #stack #using #λ-calculus

Implementation of the Typed Call-by-Value λ-Calculus using a Stack of Regions (MT, JPT), pp. 188–201.

ICRE-1994-Eckert #analysis #object-oriented

Types, classes and collections in object-oriented analysis (GE), pp. 32–39.

SAC-1994-KaraliH #data type #parallel #prolog

Abstract data type support in Prolog and its relation to parallelism (IK, CH), pp. 415–419.

SAC-1994-StansiferW #morphism #polymorphism #re-engineering

Type reconstruction for coercion polymorphism (RS, DW), pp. 420–424.

FSE-1994-BowdidgeG #automation #data type #encapsulation

Automated Support for Encapsulating Abstract Data Types (RWB, WGG), pp. 97–110.

CADE-1994-Jackson #algebra #type system

Exploring Abstract Algebra in Constructive Type Theory (PJ), pp. 590–604.

ILPS-1994-Brisset #logic programming #polymorphism #programming language #type checking

Avoiding Dynamic Type Checking in a Polymorphic Logic Programming Language (PB), p. 674.

LICS-1994-AbadiC #semantics

A Semantics of Object Types (MA, LC), pp. 332–341.

LICS-1994-GeuversW #on the #type system

On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study (HG, BW), pp. 320–329.

LICS-1994-HuthJK #approximate #linear

Linear Types, Approximation, and Topology (MH, AJ, KK), pp. 110–114.

LICS-1994-Palsberg #performance

Efficient Inference of Object Types (JP), pp. 186–195.

LICS-1994-PipernoR #type inference

Type Inference and Extensionality (AP, SRDR), pp. 196–205.

LICS-1994-Urzyczyn #problem

The Emptiness Problem for Intersection Types (PU), pp. 300–309.

LICS-1994-Wells #decidability #higher-order #λ-calculus

Typability and Type-Checking in the Second-Order λ-Calculus are Equivalent and Undecidable (JBW), pp. 176–185.

HT-1993-NanardN #empirical

Should Anchors be Typed Too? An Experiment with MacWeb (JN, MN), pp. 51–62.

PODS-1993-Wong #normalisation #query

Normal Forms and Conservative Properties for Query Languages over Collection Types (LW), pp. 26–36.

CSM-1993-CanforaCMT #c #case study #data type #source code

Extracting Abstract Data Types from C Programs: A Case Study (GC, AC, MM, CJT), pp. 200–209.

WCRE-1993-CanforaCM #data type #identification #reuse #reverse engineering

A Reverse Engineering Method for Identifying Reusable Abstract Data Types (GC, AC, MM), pp. 73–82.

PLDI-1993-AdamsCS #data type

First-Class Data-Type Representations in SchemeXerox (NA, PC, MS), pp. 139–146.

PLDI-1993-PetersonJ #implementation

Implementing Type Classes (JP, MPJ), pp. 227–236.

WSA-1993-Monsuez #polymorphism

Polymorphic Types and Widening Operators (BM), pp. 267–281.

WSA-1993-WrightB #analysis #reduction

Usage Analysis with Natural Reduction Types (DAW, CABF), pp. 254–266.

DLT-1993-Vaida #programming language

Iteration Conditions of W. Ogden’s Type and Applications to Programming Languages (II) (DV), pp. 44–50.

ICALP-1993-CosmoK #confluence #recursion #reduction #λ-calculus

A Confluent Reduction for the Extensional Typed λ-Calculus with Pairs, Sums, Recursion and terminal Object (RDC, DK), pp. 645–656.

FPCA-1993-AdityaC #polymorphism #re-engineering

Compiler-directed Type Reconstruction for Polymorphic Languages (SA, AC), pp. 74–82.

FPCA-1993-AikenW #constraints #type inference

Type Inclusion Constraints and Type Inference (AA, ELW), pp. 31–41.

HCI-ACS-1993-KanSH #evaluation #towards #type system

Toward a Cognitive Ergonomics Evaluation System of Typing Chinese Characters into Computers (ZK, GS, ZH), pp. 380–385.

INTERCHI-1993-GoldbergR

Touch-typing with a stylus (DG, CR), pp. 80–87.

INTERCHI-1993-GoldbergR93a

Touch-typing with a stylus (abstract) (DG, CR), p. 520.

SEKE-1993-ShinCY #prolog #source code #type inference

Mode Based Type Inference for Prolog Programs (DS, YC, HY), pp. 239–243.

ECOOP-1993-AgesenPS #type inference

Type Inference of SELF (OA, JP, MIS), pp. 247–267.

ECOOP-1993-BalstersBZ #database #object-oriented #set

Typed Sets as a Basis for Object-Oriented Database Schemas (HB, RAdB, RZ), pp. 161–184.

ECOOP-1993-CaseauP #higher-order #object-oriented

Attaching Second-Order Types to Methods in an Object-Oriented Language (YC, LP), pp. 142–160.

OOPSLA-1993-BruceCMGDM #decidability #object-oriented #type checking

Safe and Decidable Type Checking in an Object-Oriented Language (KBB, JC, TPM, RvG, AD, RM), pp. 29–46.

OOPSLA-1993-Hauck #approach #inheritance

Inheritance Modeled with Explicit Bindings: An Approach to Typed Inheritance (FJH), pp. 231–239.

OOPSLA-1993-Lamping #interface #type system

Typing the Specialization Interface (JL), pp. 201–214.

OOPSLA-1993-Nierstrasz

Regular Types for Active Objects (ON), pp. 1–15.

LOPSTR-1993-BoeckC #logic #prolog

Mechanical Transformation of Logic Definitions Augmented with Type Information into Prolog Procedures: Some Experiments (PDB, BLC), pp. 229–245.

POPL-1993-Aponte #parametricity #type system

Extending Record Typing to Type Parametric Modules with Sharing (MVA), pp. 465–478.

POPL-1993-Bruce #object-oriented #programming language #static typing #type checking

Safe Type Checking in a Statically-Typed Object-Oriented Programming Language (KBB), pp. 285–298.

POPL-1993-KlarlundS #graph

Graph Types (NK, MIS), pp. 196–205.

POPL-1993-NipkowP #type checking

Type Checking Type Classes (TN, CP), pp. 409–418.

POPL-1993-PierceT #object-oriented #programming #recursion

Object-Oriented Programming without Recursive Types (BCP, DNT), pp. 299–312.

POPL-1993-ReickeS #algebra #reasoning

Algebraic Reasoning and Completeness in Typed Languages (JGR, RS), pp. 185–195.

SAC-1993-StansiferW #object-oriented #reuse

Method Reuse in Typed Object-Oriented Languages (RS, DW), pp. 63–70.

CSL-1993-Raffalli #data type #infinity #similarity

Data Types, Infinity and Equality in System AF2 (CR), pp. 280–294.

CSL-1993-Ritter #normalisation #λ-calculus

Normalization for Typed λ Calculi with Explicit Substitution (ER), pp. 295–304.

ILPS-1993-KohlhaseP #unification #λ-calculus

Unification in a λ-Calculus with Intersection Types (MK, FP), pp. 488–505.

RTA-1993-Gallier #proving

Proving Properties of Typed λ Terms: Realizability, Covers, and Sheaves (Abstract) (JHG), p. 136.

TLCA-1993-Bakel #term rewriting

Partial Intersection Type Assignment in Applicative Term Rewriting Systems (SvB), pp. 29–44.

TLCA-1993-BarbaneraF #higher-order #term rewriting

Combining First and Higher Order Rewrite Systems with Type Assignment Systems (FB, MF), pp. 60–74.

TLCA-1993-Ghelli #recursion

Recursive Types Are not Conservative over F (GG), pp. 146–162.

TLCA-1993-JacobsM #dependent type #higher-order #logic #type system

Translating Dependent Type Theory into Higher Order Logic (BJ, TFM), pp. 209–229.

TLCA-1993-Leiss #recursion

Combining Recursive and Dynamic Types (HL), pp. 258–273.

TLCA-1993-McKinnaP #type system

Pure Type Systems Formalized (JM, RP), pp. 289–305.

TLCA-1993-Pierce #bound #morphism #polymorphism

Intersection Types and Bounded Polymorphism (BCP), pp. 346–360.

TLCA-1993-Springintveld #bound #reduction

Lower and Upper Bounds for Reductions of Types in λω and λP (JS), pp. 391–405.

TLCA-1993-Urzyczyn #decidability #re-engineering

Type reconstruction in Fω is undecidable (PU), pp. 418–432.

KBSE-1992-Novak #clustering #reuse

Software Reuse through View Type Clusters (GSN), p. 15.

ESOP-1992-BossiCF

Typed Norms (AB, NC, MF), pp. 73–92.

ESOP-1992-DohS #action semantics #semantics #type system

Extraction of Strong Typing Laws from Action Semantics Definitions (KGD, DAS), pp. 151–166.

ESOP-1992-Henglein #dynamic typing #type system

Dynamic Typing (FH), pp. 233–253.

ESOP-1992-Jones #formal method

A Theory of Qualified Types (MPJ), pp. 287–306.

ESOP-1992-Larcheveque #interprocedural #object-oriented

Interprocedural Type Propagation for Object-Oriented Languages (JML), pp. 321–340.

ESOP-1992-Odersky #linear

Observers for Linear Types (MO), pp. 390–407.

ESOP-1992-OKeefeW #decidability #type inference

Type Inference for Partial Types is Decidable (PO, MW), pp. 408–417.

ESOP-1992-Wright #type system

Typing References by Effect Inference (AKW), pp. 473–491.

PLDI-1992-DiwanMH #compilation #garbage collection #static typing

Compiler Support for Garbage Collection in a Statically Typed Language (AD, JEBM, RLH), pp. 273–282.

WSA-1992-BreuerB #decompiler #performance

Decompilation is the Efficient Enumeration of Types (PTB, JPB), pp. 255–273.

WSA-1992-GloessHLH #on the

On Boolean Feature Types (PYG, YNH, CML, MAH), pp. 213–220.

WSA-1992-Monsuez

Fractional Types (BM), pp. 274–284.

LFP-1992-ChenHO #parametricity

Parametric Type Classes (KC, PH, MO), pp. 170–181.

LFP-1992-GoldbergG #garbage collection #polymorphism #re-engineering

Polymorphic Type Reconstruction for Garbage Collection Without Tags (BG, MG), pp. 53–65.

LFP-1992-Henglein #optimisation #type inference

Global Tagging Optimization by Type Inference (FH), pp. 205–215.

LFP-1992-Kaes #recursion #type inference #type system

Type Inference in the Presence of Overloading, Subtyping and Recursive Types (SK), pp. 193–204.

LFP-1992-WangH #analysis #recursion

Analysis of Recursive Types in Lisp-Like Languages (EW, PNH), pp. 216–225.

TRI-Ada-C-1992-DismukesR #ada #implementation

Implementing Tagged Types and Type Extensions for Ada 9X (GD, MAR), pp. 68–78.

ECOOP-1992-DodaniT #named #object-oriented #programming #type system

ACTS: A Type System for Object-Oriented Programming Based on Abstract and Concrete Classes (MD, CST), pp. 309–328.

ECOOP-1992-OxhojPS #type inference

Making Type Inference Practical (NO, JP, MIS), pp. 329–349.

TOOLS-EUROPE-1992-BuschmannKS #c++ #information management #runtime

A Runtime Type Information System for C++ (FB, KK, MS), pp. 265–274.

TOOLS-USA-1992-Alagic #object-oriented #type system

Object-Oriented Type Systems (SA), p. 295.

TOOLS-USA-1992-Alagic92a #polymorphism

Associated paper: Polymorphic and Reflective Type Structures (SA), p. 297.

ALP-1992-Ait-Kaci #calculus #object-oriented

Outline of an Object-Oriented Calculus of Higher Type (Abstract) (HAK), pp. 1–2.

LOPSTR-1992-GallagherW #logic programming #source code

Deletion of Redundant Unary Type Predicates from Logic Programs (JPG, DAdW), pp. 151–167.

POPL-1992-BruceM #higher-order #modelling #morphism #polymorphism #recursion #type system

PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism (KBB, JCM), pp. 316–327.

POPL-1992-Cosmo #framework #morphism

Type Isomorphisms in a Type-Assignment Framework (RDC), pp. 200–210.

POPL-1992-Leroy #polymorphism #type system

Unboxed Objects and Polymorphic Typing (XL), pp. 177–188.

POPL-1992-LincolnM #algorithm #aspect-oriented #type inference #type system

Algorithmic Aspects of Type Inference with Subtypes (PL, JCM), pp. 293–304.

POPL-1992-Remy #for free #type system

Typing Record Concatenation for Free (DR), pp. 166–176.

IWMM-1992-LamWM #garbage collection #locality

Object Type Directed Garbage Collection To Improve Locality (MSL, PRW, TGM), pp. 404–425.

CADE-1992-ChouG #geometry #proving

Proving Geometry Statements of Constructive Type (SCC, XSG), pp. 20–34.

CSL-1992-Marzetta #formal method

Universes in the Theory of Types and Names (MM), pp. 340–351.

CSL-1992-Smith #type system

Kleene’s Slash and Existence of Values of Open Terms in Type Theory (JMS), pp. 395–402.

JICSLP-1992-RouzaudN #prolog #type system

Integrating Modes and Subtypes into a Prolog Type-Checker (YR, LNP), pp. 85–97.

LICS-1992-Geuvers #λ-calculus

The Church-Rosser Property for βη-reduction in Typed λ-Calculi (HG), pp. 453–460.

LICS-1992-LiguoroPS #λ-calculus

Retracts in simply typed λβη-calculus (Ud, AP, RS), pp. 461–469.

LICS-1992-Seth #axiom #recursion

There is No Recursive Axiomatization for Feasible Functionals of Type~2 (AS), pp. 286–295.

LICS-1992-TalpinJ

The Type and Effect Discipline (JPT, PJ), pp. 162–173.

HT-1991-NanardN #hypermedia #using

Using Structured Types to Incorporate Knowledge in Hypertext (JN, MN), pp. 329–343.

VLDB-1991-Albert #algebra #data type

Algebraic Properties of Bag Data Types (JA), pp. 211–219.

ESOP-J-1990-Helmink91 #type system

Resolution and Type Theory (LH), pp. 119–138.

ESOP-J-1990-Thatte91 #scalability #type system

A Type System for Implicit Scaling (ST), pp. 217–245.

PEPM-1991-NielBV #functional #polymorphism

Program Bifurcation for a Polymorphic Typed Functional Language (ADN, EB, KDV), pp. 142–153.

PEPM-1991-RufW #using

Using Types to Avoid Redundant Specialization (ER, DW), pp. 321–333.

PLDI-1991-CartwrightF #type system

Soft Typing (RC, MF), pp. 278–292.

PLDI-1991-FreemanP #ml #refinement

Refinement Types for ML (TF, FP), pp. 268–277.

PLDI-1991-Goldberg #garbage collection #programming language

Tag-Free Garbage Collection for Strongly Typed Programming Languages (BG), pp. 165–176.

WSA-1991-BoeckC #analysis #automation #prolog #type checking

Automatic Construction of Prolog Primitives for Type Checking Analysis (PDB, BLC), pp. 165–172.

WSA-1991-Monsuez #abstract interpretation #polymorphism

An Attempt to Find Polymorphic Types by Abstract Interpretation (BM), pp. 18–25.

WSA-1991-NielBV #functional #partial evaluation #problem #representation

Partial Evaluation of Polymorphically Typed Functional Languages: the Representation Problem (ADN, EB, KDV), pp. 90–97.

WSA-1991-TalpinJ #polymorphism

Polymorphic Type, Region and Effect Inference (JPT, PJ), pp. 26–32.

Best-of-PLDI-1991-CartwrightF91a #type system

Soft typing (with retrospective) (RC, MF), pp. 412–428.

VDME-1991-1-DammHB #consistency #on the #type checking

On Type Checking in VDM and Related Consistency Issues (FMD, BSH, HB), pp. 45–62.

FPCA-1991-Henglein #analysis #higher-order #performance #type inference

Efficient Type Inference for Higher-Order Binding-Time Analysis (FH), pp. 448–472.

FPCA-1991-Launchbury #self

A Strongly-Typed Self-Applicable Partial Evaluator (JL), pp. 145–164.

FPCA-1991-LillieH

A Projection Model of Types (DJL, PGH), pp. 259–288.

FPCA-1991-NipkowS #order #unification

Type Classes and Overloading Resolution via Order-Sorted Unification (TN, GS), pp. 1–14.

FPCA-1991-Thatte #morphism

Coercive Type Isomorphism (SRT), pp. 29–49.

AdaEurope-1991-Gudenberg #ada #parallel

Modellin SIMD — Type Parallel Arithmetic Operations in Ada (JWvG), pp. 110–124.

ECOOP-1991-HolzleCU #dynamic typing #object-oriented #optimisation #polymorphism

Optimizing Dynamically-Typed Object-Oriented Languages With Polymorphic Inline Caches (UH, CC, DU), pp. 21–38.

ECOOP-1991-MugridgeHH #multi #programming language #static typing

Multi-Methods in a Statically-Typed Programming Language (WBM, JH, JGH), pp. 307–324.

ECOOP-1991-PalsbergS #question #reuse #type safety #what

What is Type-Safe Code Reuse? (JP, MIS), pp. 325–341.

ECOOP-1991-Wills #smalltalk #verification

Capsules and Types in Fresco: Program Verification in Smalltalk (AW), pp. 59–76.

OOPSLA-1991-AgrawalDL #multi #static typing #type checking

Static Type Checking of Multi-Methods (RA, LGD, BGL), pp. 113–128.

OOPSLA-1991-Ghelli #message passing #static typing #type system

A Static Type System for Message Passing (GG), pp. 129–145.

OOPSLA-1991-PalsbergS #object-oriented #type inference

Object-Oriented Type Inference (JP, MIS), pp. 146–161.

PLILP-1991-FileS #abstract interpretation #type checking

Abstract Interpretation for Type Checking (GF, PS), pp. 311–322.

PLILP-1991-Gloess #logic #order

U-Log, An Ordered Sorted Logic with Typed Attributes (PYG), pp. 275–286.

POPL-1991-AikenM #static typing #type inference

Static Type Inference in a Dynamically Typed Language (AA, BRM), pp. 279–290.

POPL-1991-AmadioC #recursion #type system

Subtyping Recursive Types (RMA, LC), pp. 104–118.

POPL-1991-DubaHM #continuation #ml #type system

Typing First-Class Continuations in ML (BFD, RH, DBM), pp. 163–173.

POPL-1991-HengleinM #complexity #higher-order #type inference #λ-calculus

The Complexity of Type Inference for Higher-Order Typed λ Calculi (FH, HGM), pp. 119–130.

POPL-1991-JouvelotG #algebra #re-engineering

Algebraic Reconstruction of Types and Effects (PJ, DKG), pp. 303–310.

POPL-1991-LeroyW #polymorphism #type inference

Polymorphic Type Inference and Assignment (XL, PW), pp. 291–302.

ICSE-1991-ChillaregeKC #fault

Defect Type and Its Impact on the Growth Curve (RC, WlK, RGC), pp. 246–255.

CSL-1991-BeierleB #correctness #proving

Correctness Proof For the WAM with Types (CB, EB), pp. 15–34.

CSL-1991-Feferman #approach #data type

A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation (SF), pp. 79–95.

CSL-1991-Meinke #combinator #data type #equation #specification

Equational Specification of Abstract Types and Combinators (KM), pp. 257–271.

ICLP-1991-Miller #logic programming #unification

Unification of Simply Typed Lamda-Terms as Logic Programming (DM), pp. 255–269.

ICLP-1991-YardeniFS #logic programming #source code

Polymorphically Typed Logic Programs (EY, TWF, EYS), pp. 379–393.

ISLP-1991-Carpenter #first-order

Typed Feature Structures: A Generalization of First-Order Terms (BC), pp. 187–201.

ISLP-1991-LakshmanR #prolog #re-engineering #semantics #type system

Typed Prolog: A Semantic Reconstruction of the Mycroft-O’Keefe Type System (TLL, USR), pp. 202–217.

LICS-1991-BergerS #evaluation #functional #λ-calculus

An Inverse of the Evaluation Functional for Typed λ-calculus (UB, HS), pp. 203–211.

LICS-1991-FruhwirthSVY #logic programming #source code

Logic Programs as Types for Logic Programs (TWF, EYS, MYV, EY), pp. 300–309.

LICS-1991-Howe #on the #type system

On Computational Open-Endedness in Martin-Löf’s Type Theory (DJH), pp. 162–172.

LICS-1991-KiferW #first-order #logic programming #morphism #polymorphism

A First-Order Theory of Types and Polymorphism in Logic Programming (MK, JW), pp. 310–321.

LICS-1991-Mendler #recursion

Predicative Type Universes and Primitive Recursion (NPM), pp. 173–184.

DAC-1990-ButlerM #design #fault #performance

The Influences of Fault Type and Topology on Fault Model Performance and the Implications to Test and Testable Design (KMB, MRM), pp. 673–678.

DAC-1990-WhitcombN #data type #synthesis

Abstract Data Types and High-Level Synthesis (GSW, ARN), pp. 680–685.

ESOP-1990-BarendregtH #programming language #λ-calculus

Types in λ Calculi and Programming Languages (HB, KH), pp. 1–35.

ESOP-1990-EvenS #action semantics #semantics #type inference

Type Inference for Action Semantics (SE, DAS), pp. 118–133.

ESOP-1990-Helmink #type system

Resolution and Type Theory (LH), pp. 197–211.

ESOP-1990-Thatte #scalability #type inference

Type Inference and Implicit Scaling (ST), pp. 406–420.

PLDI-1990-ChambersU #analysis #dynamic typing #object-oriented #optimisation #source code

Iterative Type Analysis and Extended Message Splitting: Optimizing Dynamically-Typed Object-Oriented Programs (CC, DU), pp. 150–164.

PLDI-1990-CormackW #parametricity

Type-Dependent Parameter Inference (GVC, AKW), pp. 127–136.

PLDI-1990-Jacobs #constraints #logic programming #type system

Type Declarations as Subtype Constraints in Logic Programming (DJ), pp. 165–173.

ICALP-1990-Jones #partial evaluation #self

Partial Evaluation, Self-Application and Types (NDJ), pp. 639–659.

ICALP-1990-Malecki #polymorphism

Generic Terms Having No Polymorphic Types (SM), pp. 46–59.

ICALP-1990-NaherM #algorithm #data type #library #named #performance

LEDA: A Library of Efficient Data Types and Algorithms (SN, KM), pp. 1–5.

ICALP-1990-TuckerWZ #data type

Provable Computable Functions on Abstract Data Types (JVT, SSW, JIZ), pp. 660–673.

VDME-1990-PlatHKOPT #type checking

Type Checking BSI/VDM-SL (NP, RH, JvK, GvO, KP, HT), pp. 399–425.

VDME-1990-SpiveyS #type inference

Type Inference in Z (JMS, BS), pp. 426–451.

LFP-1990-Gomard #functional #source code #type inference

Partial Type Inference for Untyped Functional Programs (CKG), pp. 282–287.

LFP-1990-SheldonG #dependent type

Static Dependent Types for First Class Modules (MAS, DKG), pp. 20–29.

OOPSLA-ECOOP-1990-MadsenMM #object-oriented #revisited #type system

Strong Typing of Object-Oriented Languages Revisited (OLM, BM, BMP), pp. 140–150.

OOPSLA-ECOOP-1990-PalsbergS #object-oriented #programming

Type Substitution for Object-Oriented Programming (JP, MIS), pp. 151–160.

OOPSLA-ECOOP-1990-StraubeO #consistency #database #object-oriented #query

Type Consistency of Queries in an Object-Oriented Database System (DDS, MTÖ), pp. 224–233.

ALP-1990-Hanus #equation #logic programming #source code #specification

Logic Programs with Equational Type Specifications (Extended Abstract) (MH), pp. 70–85.

PLILP-1990-BoeckC #analysis #correctness #prolog #static typing

Static Type Analysis of Prolog Procedures for Ensuring Correctness (PDB, BLC), pp. 222–237.

POPL-1990-GraverJ #smalltalk #type system

A Type System for Smalltalk (JOG, REJ), pp. 136–150.

POPL-1990-Griffin #type system

A Formulae-as-Types Notion of Control (TG), pp. 47–58.

POPL-1990-Mitchell #inheritance #towards

Toward a Typed Foundation for Method Specialization and Inheritance (JCM), pp. 109–124.

POPL-1990-Thatte #static typing #type system

Quasi-Static Typing (SRT), pp. 367–381.

PPoPP-1990-BennettCZ #distributed #memory management #named

Munin: Distributed Shared Memory Based on Type-Specific Memory Coherence (JKB, JBC, WZ), pp. 168–176.

CADE-1990-FeltyM #encoding #logic programming #programming language #λ-calculus

Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language (APF, DM), pp. 221–235.

CADE-1990-PymW #first-order

Investigations into Proof-Search in a System of First-Order Dependent Function Types (DJP, LAW), pp. 236–250.

CADE-1990-Rittri #equation #identifier #library

Retrieving Library Identifiers via Equational Matching of Types (MR), pp. 603–617.

CLP-1990-Pfenning90 #logic programming

Types in Logic Programming (FP), p. 786.

CSL-1990-BorgerS #prolog #semantics

A Formal Operational Semantics for Languages of Type Prolog III (EB, PHS), pp. 67–79.

LICS-1990-AbadiP #morphism #polymorphism #recursion

A Per Model of Polymorphism and Recursive Types (MA, GDP), pp. 355–365.

LICS-1990-CosmadakisMR #lazy evaluation

Completeness for typed lazy inequalities (SSC, ARM, JGR), pp. 312–320.

LICS-1990-Freyd #induction #recursion

Recursive Types Reduced to Inductive Types (PJF), pp. 498–507.

LICS-1990-KfouryT #polymorphism #re-engineering #summary #λ-calculus

Type Reconstruction in Finite-Rank Fragments of the Polymorphic λ-Calculus (Extended Summary) (AJK, JT), pp. 2–11.

NACLP-1990-OzawaHH #garbage collection #generative #logic #parallel

Generation Type Garbage Collection for Parallel Logic Languages (TO, AH, AH), pp. 291–305.

NACLP-1990-Reddy #logic programming #source code

Types for Logic Programs (USR), pp. 836–840.

DAC-1989-MaoC #fault #testing

A Simplified Six-waveform Type Method for Delay Fault Testing (WM, MDC), pp. 730–733.

PODS-1989-Borgida #inheritance #query #strict #type system

Type Systems for Querying Class Hierarchies with Non-strict Inheritance (AB), pp. 394–400.

SIGMOD-1989-OhoriBT #database #polymorphism #programming #static typing #type inference

Database Programming in Machiavelli — a Polymorphic Language with Static Type Inference (AO, PB, VT), pp. 46–57.

PLDI-1989-Boehm #abstraction #type inference

Type Inference in the Presence of Type Abstraction (HJB), pp. 192–206.

PLDI-1989-ChambersU #compilation #dynamic typing #named #object-oriented #optimisation #programming language

Customization: Optimizing Compiler Technology for SELF, A Dynamically-Typed Object-Oriented Programming Language (CC, DU), pp. 146–160.

PLDI-1989-OTooleG #polymorphism #re-engineering

Type Reconstruction with First-Class Polymorphic Values (JO, DKG), pp. 207–217.

STOC-1989-GoodmanPS #coordination #exponential #order #representation

Coordinate Representation of Order Types Requires Exponential Storage (JEG, RP, BS), pp. 405–410.

Best-of-PLDI-1989-ChambersU89a #compilation #dynamic typing #object-oriented #optimisation #programming language

A retrospective on: “customization: optimizing compiler technology for self, a dynamically-typed object-oriented programming language” (with retrospective) (CC, DU), pp. 295–312.

ICALP-1989-Cardone #bound #quantifier #recursion #relational #semantics

Relational Semantics for Recursive Types and Bounded Quantification (FC), pp. 164–178.

FPCA-1989-KuoM #analysis #strict #type inference

Strictness Analysis: A New Perspective Based on Type Inference (TMK, PM), pp. 260–272.

FPCA-1989-Rittri #library #using

Using Types as Search Keys in Function Libraries (MR), pp. 174–183.

FPCA-1989-RuncimanT #component #polymorphism

Retrieving Re-Usable Software Components by Polymorphic Type (CR, IT), pp. 166–173.

FPCA-1989-WandO #complexity #on the #type inference

On the Complexity of Type Inference with Coercion (MW, PO), pp. 293–298.

CHI-1989-JohnN #human-computer #type system

Cumulating the science of HCI: from s-R compatibility to transcription typing (BEJ, AN), pp. 109–114.

ECOOP-1989-Cook #eiffel #type safety

A Proposal for Making Eiffel Type-Safe (WRC), pp. 57–70.

OOPSLA-1989-CanningCHO #interface #object-oriented #programming

Interfaces for Strongly-Typed Object-Oriented Programming (PSC, WRC, WLH, WGO), pp. 457–467.

OOPSLA-1989-ChambersUL #dynamic typing #implementation #object-oriented #performance #prototype

An Efficient Implementation of SELF — a Dynamically-Typed Object-Oriented Language Based on Prototypes (CC, DU, EL), pp. 49–70.

OOPSLA-1989-ConnorDMB #inheritance #multi

An Object Addressing Mechanism for Statically Types Languages with Multiple Inheritance (RCHC, AD, RM, ALB), pp. 279–285.

OOPSLA-1989-OhoriB #parametricity #static typing #type inference

Static Type Inference for Parametric Classes (AO, PB), pp. 445–456.

OOPSLA-1989-RosenblattWW #development #named #towards

OROS: Toward a Type Model for Software Development Environments (WRR, JCW, ALW), pp. 297–304.

POPL-1989-AbadiCPP #dynamic typing #static typing #type system

Dynamic Typing in a Statically-Typed Language (MA, LC, BCP, GDP), pp. 213–227.

POPL-1989-CardelliDJKN #type system

The Modula-3 Type System (LC, JED, MJJ, BK, GN), pp. 202–212.

POPL-1989-KanellakisM #ml #polymorphism #type system #unification

Polymorphic Unification and ML Typing (PCK, JCM), pp. 105–115.

POPL-1989-Monteleone

Generalized Conjunctive Types (GM), pp. 242–249.

POPL-1989-YelickZ #logic programming #type system

Moded Type Systems for Logic Programming (KAY, JLZ), pp. 116–124.

ICSE-1989-JadoulDP #agile #algebra #data type #prototype #specification

An Algebraic Data Type Specification Language and Its Rapid Prototyping Environment (LJ, LD, WVP), pp. 74–84.

LICS-1989-AbadiPP #modelling #polymorphism #recursion

Faithful Ideal Models for Recursive Polymorphic Types (MA, BCP, GDP), pp. 216–225.

LICS-1989-Cosmadakis #recursion

Computing with Recursive Types (Extended Abstract) (SSC), pp. 24–38.

LICS-1989-Goerdt #complexity #recursion

Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions (AG), pp. 364–374.

LICS-1989-Pitts #polymorphism #type system

Non-trivial Power Types Can’t Be Subtypes of Polymorphic Types (AMP), pp. 6–13.

LICS-1989-Wand #inheritance #multi #type inference

Type Inference for Record Concatenation and Multiple Inheritance (MW), pp. 92–97.

NACLP-1989-PyoR #logic programming #polymorphism #source code

Inference of Polymorphic Types for Logic Programs (CP, USR), pp. 1115–1132.

RTA-1989-Baader #unification

Characterization of Unification Type Zero (FB), pp. 2–14.

RTA-1989-Elliott #higher-order #unification

Higher-order Unification with Dependent Function Types (CE), pp. 121–136.

DAC-1988-WolfL #data transformation #modelling

Object Type Oriented Data Modeling for VLSI Data Management (PvdW, TGRvL), pp. 351–356.

PODS-1988-HerlihyW #concurrent #data type #hybrid

Hybrid Concurrency Control for Abstract Data Types (MH, WEW), pp. 201–210.

PODS-1988-HullS #database #on the #power of #query

On the Expressive Power of Database Queries with Intermediate Types (RH, JS), pp. 39–51.

VLDB-1988-LinnemannKDPEKSWW #data type #database #design #implementation

Design and Implementation of an Extensible Database Management System Supporting User Defined Data Types and Functions (VL, KK, PD, PP, RE, AK, NS, GW, MW), pp. 294–305.

ESOP-1988-DietrichH #polymorphism #prolog #type system

A Polymorphic Type System with Subtypes for Prolog (RD, FH), pp. 79–93.

ESOP-1988-FuhM #type inference #type system

Type Inference with Subtypes (YCF, PM), pp. 94–114.

ESOP-1988-Parigot #higher-order #programming #proving #type system

Programming with Proofs: A Second Order Type Theory (MP), pp. 145–159.

PLDI-1988-Rose #design #type system

Refined Types: Highly Differentiated Type Systems and Their Use in the Design of Intermediate Langages (JRR), pp. 278–287.

ICALP-1988-Thatte #type inference

Type Inference with Partial Types (ST), pp. 615–629.

VDME-1988-BorzyszkowskiKS #formal method #polymorphism #λ-calculus

A Set-Theoretic Model for a Typed Polymorphic λ Calculus — A Contribution to MetaSoft (AMB, RK, SS), pp. 267–298.

LFP-1988-Henglein #type inference

Type Inference and Semi-Unification (FH), pp. 184–197.

LFP-1988-OhoriB #database #programming language #type inference

Type Inference in a Database Programming Language (AO, PB), pp. 174–183.

LFP-1988-Pfenning #higher-order #polymorphism #type inference #unification

Partial Polymorphic Type Inference and Higher-Order Unification (FP), pp. 153–163.

ALP-1988-BeierleP #data type #equation #logic programming #specification

Integrating Logic Programming and Equational Specification of Abstract Data Types (CB, UP), pp. 71–82.

ALP-1988-Dayantis #abstraction #composition #logic programming

Types, Modularisation and Abstraction in Logic Programming (GD), pp. 127–136.

ALP-1988-Smolka #logic programming #order

Logic Programming with Polymorphically Order-Sorted Types (GS), pp. 53–70.

POPL-1988-Cardelli #type system

Structural Subtyping and the Notion of Power Type (LC), pp. 70–79.

POPL-1988-GarlandG #data type #induction #reasoning

Inductive Methods for Reasoning about Abstract Data Types (SJG, JVG), pp. 219–228.

POPL-1988-KfouryTU #effectiveness #ml

A Proper Extension of ML with an Effective Type-Assignment (AJK, JT, PU), pp. 58–69.

POPL-1988-NielsonN #analysis #automation #λ-calculus

Automatic Binding Time Analysis for a Typed λ-Calculus (HRN, FN), pp. 98–106.

POPL-1988-Stansifer #type inference #type system

Type Inference with Subtypes (RS), pp. 88–97.

ICSE-1988-EmbleyW #ada #data type #quality

Assessing the Quality of Abstract Data Types Written in Ada (DWE, SNW), pp. 144–153.

CCHSC-1988-Levy #in the large #type checking

Type Checking in the Large (MRL), pp. 137–145.

CADE-1988-Azzoune #prolog #type inference

Type Inference in Prolog (HA), pp. 258–277.

CSL-1988-Goerdt #complexity #recursion

Characterizing Complexity Classes by General Recursive Definitions in Higher Types (AG), pp. 99–117.

JICSCP-1988-BruynoogheJ88 #abstract interpretation

An Instance of Abstract Interpretation Integrating Type and Mode Inferencing (MB, GJ), pp. 669–683.

JICSCP-1988-Emden88 #polymorphism #type inference

Conditional Answers for Polymorphic Type Inference (MHvE), pp. 590–603.

JICSCP-1988-FooRTW88 #deduction

Deduced Relevant Types and Constructive Negation (NYF, ASR, AT, AW), pp. 126–139.

JICSCP-1988-Voda88

Types of Trilogy (PJV), pp. 580–589.

JICSCP-1988-XuW88 #prolog #type inference

A Type Inference System for Prolog (JX, DSW), pp. 604–619.

LICS-1988-Bloom #modelling #λ-calculus

Can LCF Be Topped? Flat Lattice models of Typed λ Calculus (Preliminary Report) (BB), pp. 282–295.

LICS-1988-Breazu-Tannen88a #algebra #higher-order

Combining Algebra and Higher-Order Types (VT), pp. 82–90.

LICS-1988-GianniniR #polymorphism

Characterization of typings in polymorphic type discipline (PG, SRDR), pp. 61–70.

LICS-1988-SalvesenS #set #type system

The Strength of the Subset Type in Martin-Löf’s Type Theory (AS, JMS), pp. 384–391.

LICS-1988-Wand #named #type inference

Corrigendum: Complete Type Inference for Simple Objects (MW), p. 132.

SIGMOD-1987-CroftS #architecture #documentation

Supporting Offics Document Architectures with Constrained Types (WBC, DWS), pp. 504–509.

PLDI-1987-ShebsK #automation #data type #design #implementation

Automatic design and implementation of language data types (SS, RRK), pp. 26–37.

PLDI-1987-SutorJ #interpreter #type inference

The type inference and coercion facilities in the scratchpad II interpreter (RSS, RDJ), pp. 56–63.

VDME-1987-Airchinnigh87b #data type #specification

Specification by Data Types (MMaA), pp. 362–388.

VDME-1987-Monahan

A Type Model for VDM (BQM), pp. 210–236.

HCI-SES-1987-HartBCWM #simulation

Responses of Type A and Type B Individuals Performing a Supervisory Control Simulation (SGH, VB, MAC, MMW, MM), pp. 67–74.

ECOOP-1987-HalbertO #inheritance #object-oriented #using

Using Types and Inheritance in Object-Oriented Languages (DCH, PDO), pp. 20–31.

OOPSLA-1987-Thorelli #ll #type checking

Modules and Type Checking in PL/LL (LET), pp. 268–276.

POPL-1987-MeyerMMS #polymorphism #λ-calculus

Empty Types in Polymorphic λ Calculus (ARM, JCM, EM, RS), pp. 253–262.

ICSE-1987-EmbleyW #data type #reuse

A Knowledge Structure for Reusing Abstract Data Types (DWE, SNW), pp. 360–368.

ICSE-1987-Kramer #data type #distributed #named #petri net #specification

SEGRAS — A Formal and Semigraphical Language Combining Petri Nets and Abstract Data Types for the Specification of Distributed Systems (BJK), pp. 116–125.

ASPLOS-1987-SteenkisteH #hardware #lisp #type checking

Tags and Type Checking in Lisp: Hardware and Software Approaches (PS, JLH), pp. 50–59.

CSL-1987-Jager #induction

Induction in the Elementary Theory of Types and Names (GJ), pp. 118–128.

CSL-1987-Leiss #object-oriented #on the #programming language #type inference

On Type Inference for Object-Oriented Programming Languages (HL), pp. 151–172.

ICLP-1987-Kluzniak87 #prolog #synthesis

Type Synthesis for Ground Prolog (FK), pp. 788–816.

ICLP-1987-Zobel87 #polymorphism #prolog #source code

Derivation of Polymorphic Types for PROLOG Programs (JZ), pp. 817–838.

LICS-1987-Allen

A Non-Type-Theoretic Definition of Martin-Löf’s Types (SA), pp. 215–221.

LICS-1987-Breazu-TannenM #morphism #polymorphism

Polymorphism is conservative over simple types (Preliminary Report) (VT, ARM), pp. 7–17.

LICS-1987-ConstableS #type system

Partial Objects In Constructive Type Theory (RLC, SFS), pp. 183–193.

LICS-1987-KfouryTU #functional #source code

The Hierarchy of Finitely Typed Functional Programs (Short Version) (AJK, JT, PU), pp. 225–235.

LICS-1987-Mendler #constraints #higher-order #recursion #λ-calculus

Recursive Types and Type Constraints in Second-Order λ Calculus (NPM), pp. 30–36.

LICS-1987-MitchellM #modelling #λ-calculus

Kripke-Style models for typed λ calculus (JCM, EM), pp. 303–314.

LICS-1987-Reynolds #algol

Conjunctive Types and Algol-like Languages (JCR), p. 119.

LICS-1987-Wand #type inference

Complete Type Inference for Simple Objects (MW), pp. 37–44.

VLDB-1986-PistorA #design #interface

Designing A Generalized NF2 Model with an SQL-Type Language Interface (PP, FA), pp. 278–285.

LFP-1986-Mitchell #approach #polymorphism #reduction #semantics #summary

A Type-Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions (Summary) (JCM), pp. 308–319.

OOPSLA-1986-Johnson #smalltalk

Type-Checking Smalltalk (REJ), pp. 315–321.

OOPSLA-1986-LangP #named #object-oriented

Oaklisp: an Object-Oriented Scheme with First Class Types (KJL, BAP), pp. 30–37.

OOPSLA-1986-Olthoff #concept #data type #experience #object-oriented #programming #type system

Augmentation of Object-Oriented Programming by Concepts of Abstract Data Type Theory: The ModPascal Experience (WGO), pp. 429–443.

OOPSLA-1986-SkarraZ #database #object-oriented

The Management of Changing Types in an Object-Oriented Database (AHS, SBZ), pp. 483–495.

POPL-1986-JohnsonW #approach #incremental #type inference

A Maximum-Flow Approach to Anomaly Isolation in Unification-Based Incremental Type Inference (GFJ, JAW), pp. 44–57.

POPL-1986-MacQueen #composition #dependent type #using

Using Dependent Types to Express Modular Structure (DBM), pp. 277–286.

POPL-1986-MeyerR

“Type” Is Not A Type (ARM, MBR), pp. 287–295.

POPL-1986-Wand #fault

Finding the Source of Type Errors (MW), pp. 38–43.

LICS-1986-CoppoZ #logic #type inference

Type inference and logical relations (MC, MZ), pp. 218–226.

LICS-1986-KnoblockC #type system

Formalized Metareasoning in Type Theory (TBK, RLC), pp. 237–248.

LICS-1986-MendlerPC #infinity #type system

Infinite Objects in Type Theory (NPM, PP, RLC), pp. 249–255.

VLDB-1985-BarbicR #concept #documentation #retrieval

The Type Concept in Office Document Retrieval (FB, FR), pp. 34–48.

STOC-1985-BruceL #equation #modelling #morphism

Provable Isomorphisms and Domain Equations in Models of Typed Languages (Preliminary Version) (KBB, GL), pp. 263–272.

ICALP-1985-Coppo #recursion #theorem

A Completeness Theorem for Recursively Defined Types (MC), pp. 120–129.

FPCA-1985-Turner85 #functional #named #polymorphism #strict

Miranda: A Non-Strict Functional language with Polymorphic Types (DAT), pp. 1–16.

POPL-1985-Cartwright

Types as Intervals (RC), pp. 22–36.

POPL-1985-LamportS #alias #approach #constraints #named #type system

Constraints: A Uniform Approach to Aliasing and Typing (LL, FBS), pp. 205–216.

POPL-1985-MishraR #type checking

Declaration-Free Type Checking (PM, USR), pp. 7–21.

POPL-1985-MitchellP #data type

Abstract Types Have Existential Type (JCM, GDP), pp. 37–51.

POPL-1985-Wand #semantics

Embedding Type Structure in Semantics (MW), pp. 1–6.

RTA-1985-Ait-Kaci #equation #graph grammar

Solving Type Equations by Graph Rewriting (HAK), pp. 158–179.

RTA-1985-Zaionc #regular expression #set #λ-calculus

The Set of Unifiers in Typed λ-Calculus as Regular Expression (MZ), pp. 430–440.

PODS-1984-StempleS #database #specification #verification

Specification and Verification of Abstract Database Types (DWS, TS), pp. 248–257.

SIGMOD-1984-StonebrakerAHR #data type

Quel as a Data Type (MS, EA, ENH, WBR), pp. 208–214.

VLDB-1984-BatoryB #data type #framework #modelling

Molecular Objects, Abstract Data Types, and Data Models: A Framework (DSB, APB), pp. 172–184.

SCC-1984-Levy #compilation #reuse #type checking

Type checking, separate compilation and reusability (MRL), pp. 285–289.

LFP-1984-Katayama #approach #functional #programming language #type checking #type inference

Type Inference and Type Checking for Functional Programming Languages: A Reduced Computation Approach (TK), pp. 263–272.

POPL-1984-MacQueenPS #polymorphism #recursion

An Ideal Model for Recursive Polymorphic Types (DBM, GDP, RS), pp. 165–174.

POPL-1984-Mitchell #type inference

Coercion and Type Inference (JCM), pp. 175–185.

POPL-1984-Myers #data type #performance

Efficient Applicative Data Types (EWM), pp. 66–75.

POPL-1984-Sherman #abstraction #named #novel

Paragon: Novel Uses of Type Hierarchies for Data Abstraction (MS), pp. 208–217.

POPL-1984-Thiel #data type #semistructured data #specification

Stop Losing Sleep Over Incomplete Data Type Specifications (JJT), pp. 76–82.

POPL-1984-Wand #morphism #polymorphism #semantics

A Types-as-Sets Semantics for Milner-Style Polymorphism (MW), pp. 158–164.

CADE-1984-Kirchner84a #algorithm #data type #induction

A General Inductive Completion Algorithm and Application to Abstract Data Types (HK), pp. 282–302.

ILPC-1984-GoguenM84 #logic programming #similarity

Equality, Types, Modules and Generics for Logic Programming (JAG, JM), pp. 115–125.

SLP-1984-Mishra84 #formal method #prolog #towards

Towards a Theory of Types in Prolog (PM), pp. 289–298.

ICALP-1983-Ganzinger #compilation #composition #data type #semantics

Modular Compiler Descriptions Based on Abstract Semantic Data Types (Extended Abstract) (HG), pp. 237–249.

POPL-1983-Kieburtz #data type #precise #specification #type system

Precise Typing of Abstract Data Type Specifications (RBK), pp. 109–116.

POPL-1983-Leivant #polymorphism #type inference

Polymorphic Type Inference (DL), pp. 88–98.

POPL-1983-Leivant83a #data type #polymorphism #semantics

Structural Semantics for Polymorphic Data Types (DL), pp. 155–166.

POPL-1983-Meertens #incremental #polymorphism #type checking

Incremental Polymorphic Type Checking in B (LGLTM), pp. 265–275.

RE-1983-PartschP #data type

Abstract Data Types as a Tool for Requirement Engineering (HP, PP), pp. 42–55.

PODS-1982-Vardi #dependence #finite #problem

The Implication and Finite Implication Problems for Typed Template Dependencies (MYV), pp. 230–238.

SIGMOD-1982-ManolaP #database #named #query

CQLF — A Query Language for CODASYL-Type Databases (FM, AP), pp. 94–103.

VLDB-1982-DahlB #database #design #interactive #named

IDBD — An Interactive Design Tool for CODASYL-DBTG-Type Data bases (RD, JABJ), pp. 108–121.

ICALP-1982-BergstraK #algebra #data type #parametricity #specification

Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras (JAB, JWK), pp. 23–34.

LFP-1982-MacQueenS #semantics

A Semantic Model of Types for Applicative Languages (DBM, RS), pp. 243–252.

POPL-1982-BorningI #smalltalk

A Type Declaration and Inference System for Smalltalk (AB, DHHI), pp. 133–141.

POPL-1982-DamasM #functional #source code

Principal Type-Schemes for Functional Programs (LD, RM), pp. 207–212.

ICSE-1982-SakabeIH #data type #specification

Specification of Abstract Data Types with Partially Defined Operations (TS, YI, NH), pp. 218–224.

ICALP-1981-Istrail #product line

Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types (SI), pp. 333–347.

ICALP-1981-Loeckx #algorithm #data type #specification

Algorithmic Specifications of Abstract Data Types (JL), pp. 129–147.

ICALP-1981-Subrahmanyam #data type #nondeterminism

Nondeterminism in Abstract Data Types (PAS), pp. 148–164.

PS-1981-Cristian #data type #robust

Robust Data Types (FC), pp. 215–254.

POPL-1981-Suzuki #smalltalk

Inferring Types in Smalltalk (NS), pp. 187–199.

ICSE-1981-CashinJKL #composition #experience

Experience with a Modular Typed Language: PROTEL (PMC, MLJ, RFK, DML), pp. 136–143.

ICSE-1981-CunhaM #data type #programming

Resource = Abstract Data Type + Synchronization — A Methodology for Message Oriented Programming (PRFC, TSEM), pp. 263–272.

ICSE-1981-SchwartzM #data type

The Finalization Operation for Abstract Types (RLS, PMMS), pp. 273–282.

ICALP-1980-AstesianoC

Languages with Reducing Reflective Types (EA, GC), pp. 38–50.

ICALP-1980-BergstraT #data type #equation #finite #specification

A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method (JAB, JVT), pp. 76–90.

ICALP-1980-EhrigKP #algebra #concept #correctness #data type #implementation #semantics #syntax

Algebraic Implementation of Abstract Data Types: Concept, Syntax, Semantics and Correctness (HE, HJK, PP), pp. 142–156.

ICALP-1980-EhrigKTWW #algebra #data type #specification

Parameterized Data Types in Algebraic Specification Languages (Short Version) (HE, HJK, JWT, EGW, JBW), pp. 157–168.

ICALP-1980-HornungR #algebra #data type #semantics

Terminal Algebra Semantics and Retractions for Abstract Data Types (GH, PR), pp. 310–323.

LISP-1980-Cartwright #axiom #data type

A Constructive Alternative to Axiomatic Data Type Definitions (RC), pp. 46–55.

POPL-1980-DemersD #data type #parametricity #type checking

Data Types, Parameters, and Type Checking (AJD, JED), pp. 12–23.

POPL-1980-DemersD80a #design #principle

“Type-Completeness” as a Language Design Principle (AJD, JED), pp. 234–244.

POPL-1980-Kamin #data type #specification

Final Data Tye Specifications: A New Data Type Specification Method (SNK), pp. 131–138.

POPL-1980-Musser #data type #induction #on the #proving

On Proving Inductive Properties of Abstract Data Types (DRM), pp. 154–162.

SDCG-1980-Gaudel #compilation #data type #specification

Specification of compilers as abstract data type representations (MCG), pp. 140–164.

CADE-1980-Nederpelt #approach #proving #theorem proving #λ-calculus

An Approach to Theorem Proving on the Basis of a Typed Lambda-Calculus (RN), pp. 182–194.

SCC-1979-HoltW #implementation

A model for implementing Euclid modules and type templates (RCH, DBW), pp. 8–12.

STOC-1979-Fredman #data type #problem #query

A Near Optimal Data Structure for a Type of Range Query Problem (MLF), pp. 62–66.

ICALP-1979-BroyDPPW #data type #quantifier

Existential Quantifiers in Abstract Data Types (MB, WD, HP, PP, MW), pp. 73–87.

FM-1979-BergG #data type #specification

Hierarchical Specification of Abstract Data Types (HKB, WKG), pp. 150–196.

POPL-1979-GullJ

Decisions for “Type” in APL (WEG, MAJ), pp. 190–196.

POPL-1979-Miller #type checking

Type Checking in an Imperfect World (TCM), pp. 237–243.

DAC-1978-Harvel #classification #effectiveness

Classification of PCB types for cost effective solutions (JTH), pp. 444–445.

VLDB-1978-BrodieS #data type #question #what

What is the Use of Abstract Data Types? (MLB, JWS), pp. 140–141.

STOC-1978-ThatcherWW #data type #power of #specification

Data Type Specification: Parameterization and the Power of Specification Techniques (JWT, EGW, JBW), pp. 119–132.

ICALP-1978-Berry #modelling #λ-calculus

Stable Models of Typed λ-Calculi (GB), pp. 72–89.

ICALP-1978-DammF #on the #power of #recursion #self

On the Power of Self-Application and Higher Type-Recursion (WD, EF), pp. 177–191.

ICALP-1978-EhrigKP #data type #implementation #specification

Stepwise Specification and Implementation of Abstract Data Types (HE, HJK, PP), pp. 205–226.

GG-1978-EhrichL #data type #specification

Constructive Specifications of Abstract Data Types by Replacements (HDE, VGL), pp. 180–191.

POPL-1978-DemersDS #data type #encapsulation #morphism #polymorphism

Data Types as Values: Polymorphism, Type-Checking, Encapsulation (AJD, JED, GS), pp. 23–30.

POPL-1978-KaplanU #automation

A General Scheme for the Automatic Inference of Variable Types (MAK, JDU), pp. 60–75.

POPL-1978-Solomon #parametricity

Type Definitions with Parameters (MHS), pp. 31–38.

ICSE-1978-KieburtzBH #pascal

A Type-Checking Program Linkage System for Pascal (RBK, WB, CRH), pp. 23–28.

SIGMOD-1977-Schmidt

Some High-level Language Constructs for Data of Type Relation (Abstract) (JWS), p. 9.

ICALP-1977-Damm

Languages Defined by Higher Type Program Schemes (WD), pp. 164–179.

ICALP-1977-DikovskyM #ambiguity #context-free grammar #on the

On Three Types of Unambiguity of Context-Free Languages (AJD, LSM), pp. 193–205.

ICALP-1977-ShamirW #data type

Data Types as Objects (AS, WWW), pp. 465–479.

ICALP-1976-Cartwright #data type #lisp #source code #verification

User-Defined Data Types as an Aid to Verifying LISP Programs (RC), pp. 228–256.

DIPL-1976-Brosgol #data type #type checking

Some issues in data types and type checking (BMB), pp. 102–130.

DIPL-1976-DemersDTW #data type #encapsulation

Encapsulated data types and generic (AJD, JED, RTT, JHW), pp. 171–214.

DIPL-1976-Nestor #data type #modelling

Models of data objects and data types (JRN), pp. 131–170.

ICSE-1976-GuttagHM #data type #design #specification

The Design of Data Type Specifications (JVG, EH, DRM), pp. 414–420.

DAC-1975-ThompsonS #fault #simulation

Three levels of accuracy for the simulation of different fault types in digital systems (EWT, SAS), pp. 105–113.

STOC-1973-Constable #complexity

Type Two Computational Complexity (RLC), pp. 108–121.

POPL-1973-LewisR #data type #recursion

Recursively Defined Data Types (CHL, BKR), pp. 125–138.

POPL-1973-Morris #set

Types are Not Sets (JHMJ), pp. 120–124.

SHARE-1964-SimpsonA #analysis

Space frame analysis and applications to other types of structures (HS, JA).