3738 search results - page 514 / 748 » Parametrized Logic Programming |
98
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
116
Voted
IPL
2008
15 years 21 days 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...
183
click to vote
FSTTCS
2010
Springer
14 years 10 months 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...
147
click to vote
LOGCOM
2010
14 years 7 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...
114
Voted
TKDE
2010
14 years 7 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...