scientific article; zbMATH DE number 7566061

MaRDI QIDQ5094133

Claudia Faggian

Publication date: 2 August 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Uses Software

• PMaude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weak lambda calculus as a reasonable machine
• Combinatory weak reduction in lambda calculus
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Representations and solutions for game-theoretic problems
• On probabilistic term rewriting
• Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
• Skew confluence and the lambda calculus with letrec
• Transfinite reductions in orthogonal term rewriting systems
• Termination of nondeterministic probabilistic programs
• Confluence in probabilistic rewriting
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• On theories with a combinatorial definition of 'equivalence'
• Probabilistic Termination
• Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits
• Confluence Results for a Quantum Lambda Calculus with Measurements
• Probabilistic operational semantics for the lambda calculus
• Probabilistic  -calculus and Quantitative Program Analysis
• Proving Positive Almost Sure Termination Under Strategies
• Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
• Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
• A deterministic rewrite system for the probabilistic λ-calculus
• The Benefit of Being Non-Lazy in Probabilistic λ-calculus
• Stochastic lambda calculus and monads of probability distributions
• A probabilistic language based upon sampling functions
• Probabilistic coherence spaces are fully abstract for probabilistic PCF
• Random Descent
• Probabilistic automata
• Computability by Probabilistic Turing Machines
• Term Rewriting and Applications

This page was built for publication: