Sciweavers

2474 search results - page 10 / 495
» Learning Languages in a Union
Sort
View
ENTCS
2006
133views more  ENTCS 2006»
13 years 7 months ago
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages
The advent of proof-carrying code has generated significant interest in reasoning about low-level languages. It is widely believed that low-level languages with jumps must be diff...
Ando Saabas, Tarmo Uustalu
MFCS
2001
Springer
13 years 12 months ago
Characterization of Context-Free Languages with Polynomially Bounded Ambiguity
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
Klaus Wich
DLT
2008
13 years 9 months ago
Hierarchies of Piecewise Testable Languages
The classes of languages which are boolean combinations of languages of the form A a1A a2A . . . A a A , where a1, . . . , a A, k , for a fixed k 0, form a natural hierarchy wit...
Ondrej Klíma, Libor Polák
ER
2004
Springer
90views Database» more  ER 2004»
14 years 27 days ago
WUML: A Web Usage Manipulation Language for Querying Web Log Data
In this paper, we develop a novel Web Usage Manipulation Language (WUML) which is a declarative language for manipulating Web log data. We assume that a set of trails formed by use...
Qingzhao Tan, Yiping Ke, Wilfred Ng
PPDP
2004
Springer
14 years 26 days ago
Characterizing strong normalization in a language with control operators
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...