2496 search results - page 210 / 500 » Error-detecting properties of languages |
131
click to vote
ACL
1998
15 years 6 months ago
1998
Starting from descriptions of French connectives (in particular "donc"---therefore), on the one hand, and aspectual properties of French tenses pass4 simple and imparfai...
119
click to vote
IWFM
1998
15 years 6 months ago
1998
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
140
click to vote
ACL
1989
15 years 5 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
146
click to vote
DLT
2008
15 years 5 months ago
2008
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
134
Voted
APAL
2008
15 years 4 months ago
2008
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....