3513 search results - page 471 / 703 » Super Logic Programs |
130
click to vote
IPL
2008
15 years 3 months ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
214
click to vote
FSTTCS
2010
Springer
15 years 16 days ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
170
click to vote
LOGCOM
2010
14 years 10 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
132
click to vote
TKDE
2010
14 years 10 months ago
2010
We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-bas...
117
click to vote
CSL
2006
Springer
15 years 6 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...