3440 search results - page 206 / 688 » Logics For Context-Free Languages |
221
click to vote
PPDP
2007
Springer
16 years 1 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
204
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
219
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
172
click to vote
LFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We address the problem of quantitative comparison of classical and intuitionistic logics within the language of the full propositional system. We apply two different app...
174
click to vote
ICDT
2007
ACM
16 years 1 months ago
2007
ACM
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...