Regular Tree Language Recognition with Static Information

13 years 10 months ago

Download www.cduce.org

This paper presents our compilation strategy to produce efﬁcient code for pattern matching in the CDuce compiler, taking into account static information provided by the type system.

Alain Frisch

Real-time Traffic

Account Static Information | CDuce Compiler | Communications | IFIPTCS 2004 | Pattern Matching |

claim paper

» Bounded repairability for regular tree languages

» Regular Expression Types for Strings in a Text Processing Language

» Efficient language model lookahead probabilities generation using lower order LM lookahead...

» Neural network based language models for highly inflective languages

» XPath Typing Using a Modal Logic with Converse for Finite Trees

» Using Random Forests in the Structured Language Model

» OntologyBased Design Pattern Recognition

» Layout Transformations for Heap Objects Using Static Access Patterns

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	IFIP
Authors	Alain Frisch

Comments (0)

Sciweavers

Regular Tree Language Recognition with Static Information

Account Static Information | CDuce Compiler | Communications | IFIPTCS 2004 | Pattern Matching |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers