2012 search results - page 253 / 403 » CORAL - Control, Relations and Logic |
144
click to vote
AML
2006
15 years 6 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
136
click to vote
ENTCS
2007
15 years 6 months ago
2007
This paper relates on a first attempt to see if aspect-oriented programming (AOP) and logic meta-programming (LMP) can help with the revitalisation of legacy business software. B...
147
click to vote
TCS
2008
15 years 6 months ago
2008
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
183
click to vote
ENTCS
2002
15 years 6 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
163
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...