Pages that link to "Item:Q2905328"

The following pages link to Probabilistic operational semantics for the lambda calculus (Q2905328):

Displaying 36 items.

• On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem (Q265002) (← links)
• The vectorial \(\lambda\)-calculus (Q529049) (← links)
• Distributive semantics for nondeterministic typed \(\lambda\)-calculi (Q760418) (← links)
• A probabilistic semantics for the pure \(\lambda\)-calculus (Q1675793) (← links)
• Semantics of quantum programming languages: Classical control, quantum control (Q2168785) (← links)
• Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy (Q2177476) (← links)
• Stochastic \(\lambda\)-calculi: an extended abstract (Q2250553) (← links)
• QPCF: higher-order languages and quantum circuits (Q2331073) (← links)
• Confluence in probabilistic rewriting (Q2333318) (← links)
• Mitigating Multi-target Attacks in Hash-Based Signatures (Q2798784) (← links)
• Probabilistic approach to the lambda definability for fourth order types (Q2851692) (← links)
• Probabilistic operational semantics for the lambda calculus (Q2905328) (← links)
• Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics (Q2912692) (← links)
• On quantum lambda calculi: a foundational perspective (Q2973238) (← links)
• A lambda-calculus foundation for universal probabilistic programming (Q2981999) (← links)
• On Higher-Order Probabilistic Subrecursion (Q2988381) (← links)
• Metric Reasoning About $$\lambda $$-Terms: The General Case (Q2988646) (← links)
• Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
• $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations (Q2988843) (← links)
• Probabilistic  -calculus and Quantitative Program Analysis (Q3025332) (← links)
• A Type Theory for Probabilistic $$\lambda $$–calculus (Q3297838) (← links)
• On Applicative Similarity, Sequentiality, and Full Abstraction (Q3449626) (← links)
• (Q4957786) (← links)
• (Q5018491) (← links)
• (Q5028447) (← links)
• (Q5089021) (← links)
• (Q5089025) (← links)
• (Q5089028) (← links)
• (Q5094133) (← links)
• A deterministic rewrite system for the probabilistic λ-calculus (Q5108532) (← links)
• (Q5129945) (← links)
• The Benefit of Being Non-Lazy in Probabilistic λ-calculus (Q5145645) (← links)
• Stochastic lambda calculus and monads of probability distributions (Q5178903) (← links)
• Program equivalence in a typed probabilistic call-by-need functional language (Q6052951) (← links)
• Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language (Q6151555) (← links)
• Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications (Q6178717) (← links)