A Generalization of Short-Cut Fusion and its Correctness Proof

ISSN： 1388-3690

Source： LISP and Symbolic Computation, Vol.15, Iss.4, 2002-12, pp. : 273-300

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

An algebraic correctness criterion for intuitionistic multiplicative proof-nets

By de Groote P.

Theoretical Computer Science, Vol. 224, Iss. 1, 1999-08 ,pp. : 115-134

Elsevier

Access to resources Recommend Favorite

Coloured Petri net refinement specification and correctness proof with Coq

By Choppy Christine

Innovations in Systems and Software Engineering, Vol. 6, Iss. 3, 2010-09 ,pp. : 195-202

Springer Publishing Company

Access to resources Recommend Favorite

A short proof of representability of fork algebras

By Gyuris V.

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 211-220

Elsevier

Access to resources Recommend Favorite

A semantic proof of strong cut-admissibility for first-order Gdel logic

By Lahav Ori Avron Arnon

Journal of Logic and Computation, Vol. 23, Iss. 1, 2013-02 ,pp. : 59-86

Oxford University Press

Access to resources Recommend Favorite

Towards short-circuit proof design of power transformers

By Bakshi Amit Kulkarni S.V.

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 31, Iss. 2, 2012-03 ,pp. : 692-702

Emerald Group Publishing Ltd

Access to resources Recommend Favorite