Sciweavers

3738 search results - page 391 / 748
» Parametrized Logic Programming
Sort
View
166
Voted
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
15 years 3 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
LPNMR
2007
Springer
15 years 9 months ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele
127
Voted
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
16 years 12 days ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
143
Voted
PPDP
2004
Springer
15 years 9 months ago
Semi-naive evaluation in linear tabling
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato
119
Voted
APLAS
2000
ACM
15 years 8 months ago
An Open Environment for Cooperative Equational Solving
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Tetsuo Ida, Mircea Marin