3440 search results - page 425 / 688 » Logics For Context-Free Languages |
190
click to vote
ESWS
2006
Springer
15 years 11 months ago
2006
Springer
In the extensive usage of ontologies envisaged by the Semantic Web there is a compelling need for expressing mappings between the components of heterogeneous ontologies. These mapp...
168
click to vote
LICS
1995
IEEE
15 years 10 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
244
click to vote
CONCUR
1991
Springer
15 years 10 months ago
1991
Springer
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
198
click to vote
ICFP
2010
ACM
15 years 8 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
227
click to vote
POPL
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...