On the expressive power of simply typed and let-polymorphic lambda calculi

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 1996, Pages 253-263

  Hillebrand, Gerd ^a   Kanellakis, Paris ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES;

POLYMORPHIC LAMBDA CALCULI; SYNTACTIC CHARACTERIZATION;

COMPUTATIONAL COMPLEXITY;

EID: 0029699818     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (40)