Sciweavers

1151 search results - page 194 / 231
» Collaborative Programming: Applications of Logic and Automat...
Sort
View
LOPSTR
2009
Springer
15 years 4 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...
LPNMR
2009
Springer
15 years 4 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
FLOPS
2004
Springer
15 years 3 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
ICLP
1997
Springer
15 years 1 months ago
A Practical Approach to Structure Reuse of Arrays in Single Assignment Languages
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
Andreas Kågedal, Saumya K. Debray
CL
2006
Springer
14 years 10 months ago
Runtime bytecode transformation for Smalltalk
Transforming programs to alter their semantics is of wide interest, for purposes as diverse as off-the-shelf component adaptation, optimization,tracegeneration,andexperimentationw...
Marcus Denker, Stéphane Ducasse, Éri...