Sciweavers

DLT
2010
14 years 27 days ago
Algorithmic Properties of Millstream Systems
Abstract. Millstream systems have recently been proposed as a formalization of the linguistic idea that natural language should be described as a combination of different modules r...
Suna Bensch, Henrik Björklund, Frank Drewes
ACL
2008
14 years 27 days ago
Regular Tree Grammars as a Formalism for Scope Underspecification
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel a...
Alexander Koller, Michaela Regneri, Stefan Thater
SAS
1999
Springer
14 years 3 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
POPL
2006
ACM
14 years 11 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon