6274 search results - page 245 / 1255 » Proofs, Programs, Processes |
154
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
174
click to vote
CIE
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
187
click to vote
PADL
2004
Springer
15 years 12 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
180
click to vote
ICFP
2000
ACM
15 years 11 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
183
click to vote
ECOOP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Component software means reuse and separate marketing of pre-manufactured binary components. This requires components from different vendors to be composed very late, pos...