On Higher-Order Probabilistic Subrecursion
DOI10.1007/978-3-662-54458-7_22zbMath1486.68038OpenAlexW2613426697MaRDI QIDQ2988381
Agathe Herrou, Flavien Breuvart, Ugo Dal Lago
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
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lectures on the Curry-Howard isomorphism
- The lambda calculus, its syntax and semantics
- Semantics of probabilistic programs
- The typed lambda-calculus is not elementary recursive
- A higher-order characterization of probabilistic polynomial time
- Probabilistic Termination
- Probabilistic operational semantics for the lambda calculus
- Probabilistic Recursion Theory and Implicit Computational Complexity
- On the Hardness of Almost–Sure Termination
- On Higher-Order Probabilistic Subrecursion
- Computational Complexity of Probabilistic Turing Machines
- Semantics for probabilistic programming
- Abstraction, Refinement and Proof for Probabilistic Systems
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi
- Probabilistic Turing Machines and Computability
- Term Rewriting and Applications
- Computer Vision
This page was built for publication: On Higher-Order Probabilistic Subrecursion
