130 search results - page 12 / 26 » The Language Theory of Bounded Context-Switching |
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
MLQ
1998
13 years 7 months ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
There is a clear intuitive connection between the notion of leakage of information in a program and concepts from information theory. This intuition has not been satisfactorily pi...
DAGSTUHL
2006
13 years 8 months ago
2006
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...