186 search results - page 3 / 38 » Decidable Extensions of Church's Problem |
108
click to vote
ISSAC
2004
Springer
15 years 7 months ago
2004
Springer
We present a streamlined and refined version of Karr’s summation algorithm. Karr’s original approach constructively decides the telescoping problem in ΠΣ-fields, a very ge...
243
click to vote
ICFP
2009
ACM
16 years 2 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
118
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
123
click to vote
AMAI
2007
Springer
15 years 1 months ago
2007
Springer
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
137
click to vote
CADE
2007
Springer
16 years 2 months ago
2007
Springer
We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for forma...