scientific article; zbMATH DE number 7471685
From MaRDI portal
Publication:5028447
zbMath1486.68039arXiv1701.04786MaRDI QIDQ5028447
Ugo Dal Lago, Agathe Herrou, Flavien Breuvart
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/1701.04786
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Cites Work
- Lectures on the Curry-Howard isomorphism
- 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
- On the Hardness of Almost–Sure Termination
- Probabilistic Recursion Theory and Implicit Computational Complexity
- Abstraction, Refinement and Proof for Probabilistic Systems
- A Convenient Category for Higher-Order Probability Theory
- Computational Complexity
- The geometry of parallelism: classical, probabilistic, and quantum effects
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
