Tags
Language
Tags
April 2024
Su Mo Tu We Th Fr Sa
31 1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 1 2 3 4

Theorem Proving in Higher Order Logics (Lecture Notes in Computer Science) by Elsa L. Gunter (Repost)

Posted By: pepoimc
Theorem Proving in Higher Order Logics (Lecture Notes in Computer Science) by Elsa L. Gunter (Repost)

Theorem Proving in Higher Order Logics (Lecture Notes in Computer Science) by Elsa L. Gunter (Repost)
Publisher: Springer; 1 edition (September 12, 1997) | ISBN: 3540633790 | Pages: 339 | PDF | 25.43 MB

This book constitutes the refereed proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs '97, held in Murray Hill, NJ, USA, in August 1997. The volume presents 19 carefully revised full papers selected from 32 submissions during a thorough reviewing process. The papers cover work related to all aspects of theorem proving in higher order logics, particularly based on secure mechanization of those logics; the theorem proving systems addressed include Coq, HOL, Isabelle, LEGO, and PVS.

Theorem Proving in Higher Order Logics (Lecture Notes in Computer Science) by Elsa L. Gunter (Repost)