2236 search results - page 131 / 448 » Language Independence and Language Tolerance in Logic Progra... |
195
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
289
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
180
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
274
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
In this paper we propose a type-based framework for using logic programming for XML processing. We transform XML documents into terms and DTDs into regular types. We implemented a ...
179
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...