On higher-order probabilistic subrecursion

zbMATH Open1486.68039arXiv1701.04786MaRDI QIDQ5028447FDOQ5028447

Authors: Flavien Breuvart, Ugo Dal Lago, Agathe Herrou 

Publication date: 9 February 2022

Full work available at URL: https://arxiv.org/abs/1701.04786

Recommendations

• On higher-order probabilistic subrecursion
• Probabilistic recursion theory and implicit computational complexity
• Probabilistic Recursion Theory and Implicit Computational Complexity
• On the termination problem for probabilistic higher-order recursive programs
• Probabilistic operational semantics for the lambda calculus

zbMATH Keywords

lambda calculusrandomized computationhigher-order recursion

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational Complexity
• Probabilistic operational semantics for the lambda calculus
• Title not available (Why is that?)
• Lectures on the Curry-Howard isomorphism
• The typed lambda-calculus is not elementary recursive
• Title not available (Why is that?)
• Abstraction, Refinement and Proof for Probabilistic Systems
• Semantics of probabilistic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic Turing Machines and Computability
• Probabilistic coherence spaces are fully abstract for probabilistic PCF
• Computer vision. Models, learning, and inference. Foreword by Andrew Fitzgibbon.
• Title not available (Why is that?)
• A Convenient Category for Higher-Order Probability Theory
• Probabilistic termination: soundness, completeness, and compositionality
• Title not available (Why is that?)
• Title not available (Why is that?)
• Term Rewriting and Applications
• Probabilistic Recursion Theory and Implicit Computational Complexity
• On the hardness of almost-sure termination
• On probabilistic applicative bisimulation and call-by-value \(\lambda \)-calculi
• A higher-order characterization of probabilistic polynomial time
• The geometry of parallelism: classical, probabilistic, and quantum effects

Cited In (4)

• Probabilistic recursion theory and implicit computational complexity
• On higher-order probabilistic subrecursion
• Subquadratic SNARGs in the random oracle model
• A higher-order characterization of probabilistic polynomial time

This page was built for publication: On higher-order probabilistic subrecursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028447)