Asynchronous process calculi: the first- and higher-order paradigms

Author： Sangiorgi D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.253, Iss.2, 2001-02, pp. : 311-350

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

Recursive equations in higher-order process calculi

By Ying  

Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. : 839-852

Elsevier

Access to resources Recommend Favorite

The recursive path and polynomial ordering for first-order and higher-order terms

By Bofill Miquel   Borralleras Cristina   Rodrguez-Carbonell Enric   Rubio Albert  

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

Oxford University Press

Access to resources Recommend Favorite

Higher-order subtyping

By Pierce B.   Steffen M.  

Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. : 235-282

Elsevier

Access to resources Recommend Favorite

A Higher-Order Removal Method

By Chin W-N.  

LISP and Symbolic Computation, Vol. 9, Iss. 4, 1996-01 ,pp. : 287-322

Springer Publishing Company

Access to resources Recommend Favorite

Higher-Order UnCurrying

By Hannan J.  

LISP and Symbolic Computation, Vol. 13, Iss. 3, 2000-09 ,pp. : 179-216

Springer Publishing Company

Access to resources Recommend Favorite