Sciweavers

1194 search results - page 148 / 239
» A Language for Implementing Arbitrary Logics
Sort
View
DLOG
2004
13 years 10 months ago
Extended Query Facilities for Racer and an Application to Software-Engineering Problems
er reports on a pragmatic query language for Racer. The abstract syntax and semantics of this query language is defined. Next, the practical relevance of this query language is sh...
Volker Haarslev, Ralf Möller, Ragnhild Van De...
POPL
2010
ACM
14 years 6 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
CL
2010
Springer
13 years 9 months ago
Isolating untrusted software extensions by custom scoping rules
In a modern programming language, scoping rules determine the visibility of names in various regions of a program [15]. In this work, we examine the idea of allowing an applicatio...
Philip W. L. Fong, Simon A. Orr
POPL
2008
ACM
14 years 9 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
LICS
2009
IEEE
14 years 3 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp