On higher-order probabilistic subrecursion

DOI10.1007/978-3-662-54458-7_22MaRDI QIDQ2988381zbMATH OpenOpenAlexFDO

Authors Flavien Breuvart, Ugo Dal Lago, Agathe Herrou

Publication date 19 May 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01639379/file/main.pdf

Mathematics Subject Classification ID

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

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

Cites work

• A higher-order characterization of probabilistic polynomial time
• Abstraction, Refinement and Proof for Probabilistic Systems
• Computational Complexity of Probabilistic Turing Machines
• Computer vision. Models, learning, and inference. Foreword by Andrew Fitzgibbon.
• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 1231645 (Why is no real title available?)
• scientific article; zbMATH DE number 1408945 (Why is no real title available?)
• Lectures on the Curry-Howard isomorphism
• On higher-order probabilistic subrecursion
• On probabilistic applicative bisimulation and call-by-value \(\lambda \)-calculi
• On the hardness of almost-sure termination
• Probabilistic coherence spaces are fully abstract for probabilistic PCF
• Probabilistic operational semantics for the lambda calculus
• Probabilistic recursion theory and implicit computational complexity
• Probabilistic termination: soundness, completeness, and compositionality
• Probabilistic Turing Machines and Computability
• Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
• Semantics of probabilistic programs
• Term Rewriting and Applications
• The lambda calculus, its syntax and semantics
• The typed lambda-calculus is not elementary recursive

Cited in

(5)

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

Describes a project that uses

Uses Software

• Church

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 Q2988381)