PARTIAL POLYMORPHIC TYPE INFERENCE IS UNDECIDABLE.

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1985, Pages 339-345

  Boehm, Hans J ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY;

DECIDABILITY; PARTIAL POLYMORPHIC TYPE INFERENCE; POLYMORPHIC TYPE SYSTEMS; STATIC TYPE-CHECKING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0022241075     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1985.44     Document Type: Conference Paper

References (16)