Bounded quantification is undecidable

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1992, Pages 305-315

  Pierce, Benjamin C ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; OBJECT ORIENTED PROGRAMMING; TURING MACHINES;

BOUNDED QUANTIFICATION; LAMBDA CALCULUS; POLYMORPHISM; SUBTYPING; TYPECHECKING;

PROGRAMMING THEORY;

EID: 0026972623     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/143165.143228     Document Type: Conference Paper

References (34)