The calculus of constructions as a framework for proof search with set variable instantiation

Author： Felty A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.232, Iss.1, 2000-02, pp. : 187-229

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

Variable and large neighborhood search to solve the multiobjective set covering problem

By Lust T.   Tuyttens D.  

Journal of Heuristics, Vol. 20, Iss. 2, 2014-04 ,pp. : 165-188

Springer Publishing Company

Access to resources Recommend Favorite

Polarized proof-nets and -calculus

By Laurent O.  

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 161-188

Elsevier

Access to resources Recommend Favorite

A Framework for Proof Systems

By Nigam Vivek   Miller Dale  

Journal of Automated Reasoning, Vol. 45, Iss. 2, 2010-08 ,pp. : 157-188

Springer Publishing Company

Access to resources Recommend Favorite

A simple proof for the constructions of optical priority queues

By Chiu Hsien-Chen   Chang Cheng-Shang   Cheng Jay   Lee Duan-Shin  

Queueing Systems, Vol. 56, Iss. 2, 2007-06 ,pp. : 73-77

Springer Publishing Company

Access to resources Recommend Favorite

A compositional -calculus proof system for statecharts processes

By Levi F.  

Theoretical Computer Science, Vol. 216, Iss. 1, 1999-03 ,pp. : 271-310

Elsevier

Access to resources Recommend Favorite