Skip to main content
Conference ProceedingsOPEN ACCESS

Regular tree language recognition with static information

IFIP Advances in Information and Communication Technology (2004) 155 661-674
DOI: 10.1007/1-4020-8141-3_50
20Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type system. © 2004 Springer Science + Business Media, Inc.

Cite

CITATION STYLE

APA

Frisch, A. (2004). Regular tree language recognition with static information. In IFIP Advances in Information and Communication Technology (Vol. 155, pp. 661–674). Springer New York LLC. https://doi.org/10.1007/1-4020-8141-3_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free