From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition

ISSN： 1388-3690

Source： LISP and Symbolic Computation, Vol.14, Iss.4, 2001-12, pp. : 387-409

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

A Syntactic Approach to Foundational Proof-Carrying Code

By Hamid Nadeem Shao Zhong Trifonov Valery Monnier Stefan Ni Zhaozhong

Journal of Automated Reasoning, Vol. 31, Iss. 3-4, 2003-11 ,pp. : 191-229

Springer Publishing Company

Access to resources Recommend Favorite

Behavioural theories and the proof of behavioural properties

By Bidoit M. Hennicker R.

Theoretical Computer Science, Vol. 165, Iss. 1, 1996-09 ,pp. : 3-55

Elsevier

Access to resources Recommend Favorite

From Macrogeneration to Syntactic Abstraction

By Dybvig R.K.

LISP and Symbolic Computation, Vol. 13, Iss. 1-2, 2000-04 ,pp. : 57-63

Springer Publishing Company

Access to resources Recommend Favorite

Automating teleoperation

By Pegman Geoff

Industrial Robot: An International Journal, Vol. 26, Iss. 3, 1999-04 ,pp. : 184-187

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem

By Mano K. Ogawa M.

Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. : 169-208

Elsevier

Access to resources Recommend Favorite