Sciweavers

552 search results - page 11 / 111
» Languages Modulo Normalization
Sort
View
ESOP
1994
Springer
14 years 27 days ago
Compilation of Head and Strong Reduction
Functional language compilers implement only weak-head reduction. However, there are cases where head normal forms or full normal forms are needed. Here, we study how to use cps c...
Pascal Fradet
PODS
2007
ACM
107views Database» more  PODS 2007»
14 years 9 months ago
Polynomial time fragments of XPath with variables
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot...
ACL
1990
13 years 10 months ago
Normal State Implicature
In the right situation, a speaker can use an unqualified indefinite description without being misunderstood. This use of language, normal slate implicature, is a kind of conversat...
Nancy Green
JALC
2006
90views more  JALC 2006»
13 years 8 months ago
Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form
-- Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2
Peter R. J. Asveld
TLCA
2001
Springer
14 years 1 months ago
Strong Normalization of Classical Natural Deduction with Disjunction
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
Philippe de Groote