On Higher-Order Probabilistic Subrecursion (Q2988381): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2613426697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus, its syntax and semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Higher-Order Probabilistic Subrecursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A higher-order characterization of probabilistic polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic operational semantics for the lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Recursion Theory and Implicit Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic coherence spaces are fully abstract for probabilistic PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Almost–Sure Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of probabilistic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction, Refinement and Proof for Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Vision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Turing Machines and Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the Curry-Howard isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typed lambda-calculus is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics for probabilistic programming / rank
 
Normal rank

Latest revision as of 20:54, 13 July 2024

scientific article
Language Label Description Also known as
English
On Higher-Order Probabilistic Subrecursion
scientific article

    Statements

    On Higher-Order Probabilistic Subrecursion (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references