Back to Results
First PageMeta Content
Software engineering / Type inference / Lambda calculus / Standard ML / Kind / System F / Type system / Hindley–Milner / Unification / Type theory / Programming language theory / Theoretical computer science


Type Inference for First-Class Messages with Match-Functions Paritosh Shroff Scott F. Smith
Add to Reading List

Document Date: 2010-10-26 21:47:01


Open Document

File Size: 147,96 KB

Share Result on Facebook

/

Facility

Match-Functions Paritosh Shroff Scott F. Smith Johns Hopkins University / /

IndustryTerm

simplification algorithm / polymorphic variant type systems / proxy server / distributed object-oriented computing / equational simplification algorithm / type inference algorithm / type systems / above algorithm / static type systems / /

Organization

Johns Hopkins University / /

Person

Scott Smith / Atsushi Ohori / Damien Doligez / Michele Bugliesi / Jacques Garrigue / Edward L. Wimmers / David Robson / Susumu Nishimura / Lewis J. Pinson / Adele Goldberg / Valery Trifonov / Xavier Leroy / Alexander Aiken / Ken Wakita / Silvia Crafa / Jonathan Eifrig / Scott F. Smith Johns / /

Position

same second author / interpreter / /

ProgrammingLanguage

Objective Caml / Standard ML / Smalltalk-80 / Java / Smalltalk / Objective-C / ML / C++ / /

PublishedMedium

Electronic Notes in Theoretical Computer Science / /

Technology

functional programming / object-oriented programming / above algorithm / following algorithm / simplification algorithm / equational simplification algorithm / proxy server / Java / firewall / Object Technologies / dom / type inference algorithm / /

URL

http /

SocialTag