Sciweavers

1705 search results - page 55 / 341
» Representing Constraints with Automata
Sort
View
DBPL
2007
Springer
98views Database» more  DBPL 2007»
14 years 1 months ago
Towards Practical Typechecking for Macro Tree Transducers
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
Alain Frisch, Haruo Hosoya
ACSC
2004
IEEE
13 years 11 months ago
Self-Replicating Expressions in the Lambda Calculus
The study of self-replicating structures in Computer Science has been taking place for more than half a century, motivated by the desire to understand the fundamental principles a...
James Larkin, Phil Stocks
KBSE
2010
IEEE
13 years 6 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
IWRIDL
2006
ACM
141views Education» more  IWRIDL 2006»
14 years 1 months ago
Shallow syntax analysis in Sanskrit guided by semantic nets constraints
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
Gérard P. Huet
CSLP
2004
Springer
14 years 1 months ago
Property Grammars: A Fully Constraint-Based Theory
Abstract. This paper presents the basis of Property Grammars, a fully constraintbased theory. In this approach, all kinds of linguistic information is represented by means of const...
Philippe Blache