Výsledky vyhledávání - "Implicit computational complexity"

A higher-order characterization of probabilistic polynomial time Autor Dal Lago, Ugo, Parisen Toldin, Paolo

“…) characterization of the class BPP can be obtained. RSLR is an extension of Hofmann's SLR with a probabilistic primitive, which enjoys basic properties such as subject reduction and confluence…”
Získat plný text

On the system CL12 of computability logic Autor Japaridze, Giorgi

“…Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game…”
Získat plný text

Light types for polynomial time computation in lambda calculus Autor Baillot, Patrick, Terui, Kazushige

“… (and not only on proof-nets): subject reduction is satisfied and a well-typed term admits a polynomial bound on the length of any of its beta reduction sequences…”
Získat plný text