S. Bellantoni and S. Cook, A New Recursion-Theoretic Characterization of the Polytime Functions, Proceedings of 24th ACM Symposium on the Theory of Computing (1992), 283--293. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Proof-Theoretic Characterization of the Basic Feasible.. - Strahm (2002) (Correct)
....directly carries over to PS, PTLS, and LS and the corresponding classes of type two functionals. Last but not least, let us mention the important activities in the program of so called implicit computational complexity and tiered formalisms in the sense of Bellantoni, Cook, and Leivant (cf. e.g. [4, 20, 22]) There questions regarding higher types have recently been of interest, see for example Leivant [21] Bellantoni, Niggl, Schwichtenberg [5] and Hofmann [17] For applicative theories based on safe induction, see Cantini [8] Recently and independently, Leivant has given a proof theoretic ....
Bellantoni, S., and Cook, S. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity 2 (1992), 97--110.
On Characterizations of the Basic Feasible Functionals Part II - Irwin, Kapron, Royer (2002) (1 citation) (Correct)
....was introduced as a compromise between the prior two in order to better explain the machine based model. Our type2 inflationary tiered loop programs (abbreviated, ITLP 2 ) system is a typed programming formalism inspired by type theoretic characterizations of PF due to Bellantoni and Cook [BC92] and Leivant and Marion [Lei95, LM93] ITLP 2 is nonetheless very close to the polynomially clocked OTMs. ITLP 2 di#ers from BTLP 2 in that ITLP 2 types can incorporate certain complexity theoretic information. It also di#ers in that certain types and iteration bounds are inflationary in the sense ....
....clear in what sense the BFFs correspond to higher type polynomial time. A large part of the motivation of this paper is to provide appropriate settings for the E = BFF Theorem in order to extract full analogues of the Kapron Cook Theorem. Implicit Computational Complexity. Bellantoni and Cook s [BC92] and Leivant and Marion s [Lei95, LM93] type theoretic characterizations of PF inspired Bellantoni, Girard, Hofmann, Leivant, Marion, Niggl, Schwichtenberg [BNS00, Gir98, Lei94, LM02, Hof97, Hof99b] and others to investigate the use of type systems in restricted programming languages to ....
S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity 2 (1992), 97--110.
On Semantic and Type-Theoretic - Aspects Of Polynomial-Time (Correct)
....reinstated, which calls for new methods of reducing complexity. Cobham s paper [27] on bounded recursion was the rst contribution to this goal. The idea has been further developed in a logical context in [30, 24, 82] the last of which has in turn suggested the strati cation (tiering) technique [81, 16]. The method has inspired many researchers [25, 92, 23] was shown to equivalent to a modal typing system [54] and extended to higher order functions [55] Moreover, the strati cation regime turned out unnecessary in frameworks that prevent functions from increasing the size of input [56] ....
....explanations of its properties. At the very end, we shortly discuss Soft Linear Logic [77] the latest development in the area capturing P rather than FP. Chapter 3 investigates the scope for programming in Light Ane Logic. In particular, we seek connections with the Bellantoni Cook algebra BC [16, 81] of FP functions, in which input arguments are divided into normal and safe ones. Having identi ed a related concept of normal and safe in the logic, we show that a subsystem of BC, called BC , can be translated into LAL so that normal and safe arguments correspond to normal and safe variables. ....
[Article contains additional citation context not shown here]
S. Bellantoni and S. A. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97-110, 1992.
On Characterizations of the Basic Feasible Functionals Part II - Irwin, Kapron, Royer (2002) (1 citation) (Correct)
....was introduced as a compromise between the prior two in order to better explain the machine based model. Our type2 in ationary tiered loop programs (abbreviated, ITLP 2 ) system is a typed programming formalism inspired by type theoretic characterizations of PF due to Bellantoni and Cook [BC92] and Leivant and Marion [Lei95, LM93] ITLP 2 is nonetheless very close to the polynomially clocked OTMs. ITLP 2 di ers from BTLP 2 in that ITLP 2 types can incorporate certain complexity theoretic information. It also di ers in that certain types and iteration bounds are in ationary in the sense ....
....clear in what sense the BFFs correspond to higher type polynomial time. A large part of the motivation of this paper is to provide appropriate settings for the E = BFF Theorem in order to extract full analogues of the Kapron Cook Theorem. Implicit Computational Complexity. Bellantoni and Cook s [BC92] and Leivant and Marion s [Lei95, LM93] type theoretic characterizations of PF inspired Bellantoni, Girard, Hofmann, Leivant, Marion, Niggl, Schwichtenberg [BNS00, Gir98, Lei94, LM02, Hof97, Hof99b] and others to investigate the use of type systems in restricted programming languages to ....
S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity 2 (1992), 97-110.
Theories With Self-Application and Computational Complexity - Strahm (2002) (Correct)
....are directly contained in the applicative theory PT for the polynomial time computable functions. Apart from the world of bounded recursion schemas, bounded arithmetic and bounded applicative theories there is the world of so called tiered systems in the sense of Cook and Bellantoni (cf. e.g. [5]) and Leivant (cf. e.g. 49, 51] Crucial for this approach to characterizing complexities is a strictly predicative regime which distinguishes between di#erent uses of variables in induction and recursion schemas, thus severely restricting the definable or provably total functions in various ....
Bellantoni, S., and Cook, S. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity 2 (1992), 97--110. 44
Safe Weak Minimization Revisited - Spreen (Correct)
....version of relaxed minimization is used that only allows to minimize safe arguments. The ramified (predicative) approach to resource bounded computations, now referred to as implicit computational complexity , has independently been introduced by Simmons [11] Leivant [7] and Bellantoni and Cook [3]. One underlying idea is that data objects are used computationally in di#erent guises. One has two types of values: values which are known in their entirety and which therefore can be examined completely, e.g. being recursed upon; and those values which are still emerging and which therefore can ....
....being written to the left of a semicolon and the safes ones to the right. The variables x, y, z are usually used in normal position, and a, b, c are usually used in safe position. For a function class B the subclass consisting of the functions with only normal arguments is denoted by Norm(B) In [1, 3] Bellantoni and Cook characterized the class FP of polytime functions inductively by using a set B 0 of initial functions and safe composition as well as safe recursion on notation as closure operations. Definition 2.1 The set B 0 consists of the functions (1) 5) below: 1. Constant) 0 (a ....
[Article contains additional citation context not shown here]
S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity 2 (1992) 97--110.
A New Recursion-Theoretic - Characterization Of The Self-citation (Bellantoni Cook) (Correct)
....uses an explicit bound on the recursively defined function. Our notion of Predicative Recursion on Notation, which was developed independently, is comparable to Leivant s tiered recurrence [18] The functions defined there are the much smaller class of extended polynomials. Following our work ([3]) Leivant and Marion [19] 20] have expanded the results of [18] Further results are discussed in the conclusion below. In the subject of program synthesis and automatic theorem proving, Fegaras, Sheard and Stemple [14] have independently formulated a recursion scheme which seems related to ....
S. Bellantoni and S. Cook, "A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract)", in Proc. 24th Symposium on the Theory Of Computing, ACM, 1992.
Tailoring Recursion for Complexity - Erich Gradel Lehrgebiet (Correct)
No context found.
S. Bellantoni and S. Cook, A New Recursion-Theoretic Characterization of the Polytime Functions, Proceedings of 24th ACM Symposium on the Theory of Computing (1992), 283--293.
LAL Is Square: Representation and Expressiveness in Light.. - Neergaard, Mairson (2002) (Correct)
No context found.
Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the polytime functions (extended abstract). In Proc. 24th Symp. Theory of Computing, pages 283--293, 1992.
Feasible Functionals And Intersection Of Ramified Types - Leivant (2003) (Correct)
No context found.
Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the poly-time functions, 1992.
A Functional Language for Logarithmic Space - Neergaard (2004) (Correct)
No context found.
S. Bellantoni and S. A. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97--110, 1992.
A Functional Language for Logarithmic Space - Neergaard (2004) (Correct)
No context found.
S. Bellantoni and S. A. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97--110, 1992.
How Light Is Safe Recursion? Compositional Translations.. - Neergaard, Mairson (2001) (Correct)
No context found.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97-110, 1992.
A Functional Scenario for Bytecode Verification of Resource Bounds - Amadio, al. (2004) (Correct)
No context found.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97--110, 1992.
Resource Control for Synchronous Cooperative Threads - Amadio (2004) (Correct)
No context found.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97--110, 1992.
A Functional Scenario for Bytecode Verification of.. - Amadio.. (2004) (Correct)
No context found.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97--110, 1992.
Resource Control for Synchronous Cooperative Threads - Amadio, Zilio (2004) (Correct)
No context found.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97--110, 1992.
logspace and ptime Characterized by Programming - Languages Neil Jones (1999) (4 citations) (Correct)
No context found.
S. Bellantoni, S. A. Cook, A new recursion-theoretic characterization of the polytime functions, Proceedings 24th Symposium on the Theory of Computing, pp. 283-293, ACM Press, 1992.
Type Systems For Polynomial Time - Hofmann (2000) (Correct)
No context found.
Stephen Bellantoni and Stephen Cook. New recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97--110, 1992.
Higher-Order Linear Ramified Recurrence - Lago, Martini, Roversi (2004) (Correct)
No context found.
Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97-110, 1992.
Continuous Time Computation with Restricted Integration.. - Campagnolo (2004) (1 citation) (Correct)
No context found.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97--110, 1992.
BC_ε: Recursion-Theoretic Characterization of LOGSPACE - Neergaard (2004) (Correct)
No context found.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97--110, 1992.
Sharply Bounded Alternation within P - Bloch (1995) (2 citations) (Correct)
No context found.
S. Bellantoni and S. Cook, "A new recursion-theoretic characterization of the polytime functions," Computational Complexity 2 (1992) 97--110.
On Characterizations of the Basic Feasible Functionals Part II - Irwin, Kapron, Royer (2002) (1 citation) (Correct)
No context found.
S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity 2 (1992), 97-110.
Proof Theoretic Complexity - Ostrin Inst Fur (2002) (Correct)
No context found.
S. Bellantoni and S. Cook, A new recursion theoretic characterization of the polytime functions, Computational Complexity Vol. 2 (1992) pp. 97 - 110.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC