64 search results - page 4 / 13 » Proving Church's Thesis |
MLQ
1998
14 years 9 months ago
1998
In 1990, J.L. Krivine introduced the notion of storage operator to simulate, for Church integers, the “call by value” in a context of a “call by name” strategy. In this pre...
ICALP
1990
Springer
15 years 1 months ago
1990
Springer
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
FCS
2006
14 years 11 months ago
2006
This paper is based on the idea that the Church-Turing-Deutsch (CTD) principle can play a very fundamental role in Physics similar to those of conservation laws in the constructio...
AMC
2006
14 years 9 months ago
2006
-- Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A ...
IJSI
2008
14 years 9 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...