3307 search results - page 229 / 662 » The meaning of concurrent programs |
214
click to vote
PLPV
2009
ACM
16 years 3 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
185
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
162
click to vote
POPL
1998
ACM
15 years 10 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
185
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We present a logic for reasoning about properties of agent programs under different agent execution strategies. Using the agent programming language SimpleAPL as an example, we sh...
173
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...