On Equivalences, Metrics, and Polynomial Time

DOI10.1007/978-3-319-22177-9_24zbMath1436.94044arXiv1506.03710OpenAlexW2277937096MaRDI QIDQ2947890

Alberto Cappai, Ugo Dal Lago

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Combinatory logic and lambda calculus (03B40)

Related Items

On Equivalences, Metrics, and Polynomial Time, Metric Reasoning About $$\lambda $$-Terms: The General Case, Probabilistic Termination by Monadic Affine Sized Typing, Mitigating Multi-target Attacks in Hash-Based Signatures, Implicit computation complexity in higher-order programming languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Safe recursion with higher types and BCK-algebra
• Proving congruence of bisimulation in functional programming languages
• On Equivalences, Metrics, and Polynomial Time
• The computational SLR: a logic for reasoning about computational indistinguishability
• A Higher-Order Characterization of Probabilistic Polynomial Time
• Foundations of Cryptography
• Probabilistic Recursion Theory and Implicit Computational Complexity
• A Calculus for Game-Based Security Proofs
• On coinductive equivalences for higher-order probabilistic functional programs
• On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi