Complexity of subtype entailment for simple types

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 1997, Pages 352-361

  Henglein, Fritz ^a   Rehof, Jakob ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; THEOREM PROVING;

SUBTYPE ENTAILMENT;

COMPUTATIONAL COMPLEXITY;

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

References (24)