Verifying Termination and Reduction Properties about Higher-Order Logic Programs

ISSN： 0168-7433

Source： Journal of Automated Reasoning, Vol.34, Iss.2, 2005-12, pp. : 179-207

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Predicate transformers and higher-order programs

By Naumann D.A.

Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. : 111-159

Elsevier

Access to resources Recommend Favorite

Automatic verification of reduction techniques in Higher Order Logic

By Abed Sa’ed Ait Mohamed Otmane Al Sammane Ghiath

Formal Aspects of Computing, Vol. 25, Iss. 6, 2013-11 ,pp. : 971-991

Springer Publishing Company

Access to resources Recommend Favorite

Verification of FPGA Layout Generators in Higher-Order Logic

By Pell Oliver

Journal of Automated Reasoning, Vol. 37, Iss. 1-2, 2006-08 ,pp. : 117-152

Springer Publishing Company

Access to resources Recommend Favorite

A combinatory logic approach to higher-order E-unification

By Dougherty D.J. Johann P.

Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. : 207-242

Elsevier

Access to resources Recommend Favorite

On behavioural abstraction and behavioural satisfaction in higher-order logic

By Hofmann M. Sannella D.

Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. : 3-45

Elsevier

Access to resources Recommend Favorite