Proofs as computations in linear logic

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.258, Iss.1, 2001-05, pp. : 269-297

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

Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic

By Okada M.

Theoretical Computer Science, Vol. 227, Iss. 1, 1999-09 ,pp. : 333-396

Elsevier

Access to resources Recommend Favorite

Designing polylibraries to speed up linear algebra computations

By Alberti Pedro Alonso Pedro Vidal Antonio M. Cuenca Javier Gimenez Domingo

International Journal of High Performance Computing and Networking, Vol. 1, Iss. 1-2, 2005-08 ,pp. : 75-84

Inderscience Publishers

Access to resources Recommend Favorite

Operational interpretations of linear logic

By Turner D.N. Wadler P.

Theoretical Computer Science, Vol. 227, Iss. 1, 1999-09 ,pp. : 231-248

Elsevier

Access to resources Recommend Favorite

Interaction nets for linear logic

By Mackie I.

Theoretical Computer Science, Vol. 247, Iss. 1, 2000-09 ,pp. : 83-140

Elsevier

Access to resources Recommend Favorite

On proof normalization in linear logic

By Perrier G.

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 353-354

Elsevier

Access to resources Recommend Favorite