Rocquencourt / Cambridge / Rapport / Toronto / LNCS / /
Company
Prentice-Hall / Implementation Logic Programming Systems / Sun Microsystems / MIT Press / 3M / ACM Press / /
Country
Netherlands / France / Canada / Australia / / /
Event
Person Communication and Meetings / /
Facility
New Jersey library / Carnegie Mellon University / Stanford University / towers I I / University of Technology / University of Maryland / towers This / /
IndustryTerm
software system / extended type checking algorithm / generation/solution / binary search function / dot product / non-integer solutions / remote site / usual binary search function / binary search / incomplete algorithm / type systems / elaboration algorithm / static type systems / software life-cycle / sort algorithm / /
Organization
University of Maryland / MIT / University of Technology / Sydney / School of Computer Science / Stanford University / Carnegie Mellon University / Eliminating Array Bound Checking Through Dependent Types* Frank Pfenning Department of Computer Science Carnegie Mellon University Hongwei Xi Department / /
Person
Peter Lee / C. Murthy / George NecuIa / Necula / Nuprl / Frank Pfenning / Rowan Davies / Paulin-Mohring / /
Position
queen / Constable / assistant / programmer / /
ProgrammingLanguage
Java / Java bytecode / Standard ML / ML / /
ProvinceOrState
New Jersey / New Brunswick / Maryland / Massachusetts / Ontario / /
Eliminating Array Bound Checking Through Dependent Types* Frank Pfenning Department of Computer Science Carnegie Mellon University