3440 search results - page 499 / 688 » Logics For Context-Free Languages |
314
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
240
click to vote
PPDP
2005
Springer
16 years 18 days ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
205
click to vote
PPSWR
2005
Springer
16 years 18 days ago
2005
Springer
Abstract. We discuss language architecture for the Semantic Web, and in particular different proposals for extending this architecture with a rules component. We argue that an arch...
195
click to vote
PLDI
2010
ACM
16 years 6 days ago
2010
ACM
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
213
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...