A calculus for type predicates and type coercion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3702 LNAI, Issue , 2005, Pages 123-137

  Giese, Martin ^a  

^a JOHANN RADON INSTITUTE FOR COMPUTATIONAL AND APPLIED MATHEMATICS   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; OBJECT ORIENTED PROGRAMMING; SPECIFICATIONS;

FIRST-ORDER LOGIC; TABLEAU CALCULUS; TYPE COERCION;

FORMAL LOGIC;

EID: 33646186296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554554_11     Document Type: Conference Paper

References (3)

1. Leo Bachmair and Harald Ganzinger. Resolution theorem proving. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automaled Reasoning, volume I, chapter 2, pages 19-99. Elsevier Science, 2001.
2. Christoph Weidenbach, First-order tableaux with sorts. Journal of the Interest Group in Pure and Applied Logics, IGPL, 3(6):887-906, 1995.
3. Wolfgang Wernecke and Peter H. Schmitt. Tableau calculus for order-sorted logic. In U. Hedstück, C.-R. Rollinger, and K. H. Bläsius, editors, Sorts and Types in Artificial Intelligence, Proc. of the Workshop, Ehringerfeld, volume 418 of Lecture Notes in AI, pages 49-60. Springer Verlag, 1990.