Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1130.68054DBLPconf/cie/2006OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898816

Thomas Ehrhard, Laurent Regnier

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

Mathematics Subject Classification ID

Related Items (23)

A semantic account of strong normalization in linear logic ⋮ Relational graph models, Taylor expansion and extensionality ⋮ Unnamed Item ⋮ Categorical Models for Simply Typed Resource Calculi ⋮ Unnamed Item ⋮ An introduction to differential linear logic: proof-nets, models and antiderivatives ⋮ Transport of finiteness structures and applications ⋮ Execution time of λ-terms via denotational semantics and intersection types ⋮ Coherent differentiation ⋮ Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach ⋮ Uniformity and the Taylor expansion of ordinary lambda-terms ⋮ A semantic measure of the execution time in linear logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms ⋮ The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus ⋮ Differential Linear Logic and Polarization ⋮ On the Taylor expansion of probabilistic λ-terms ⋮ Classical lambda calculus in modern dress

This page was built for publication: Logical Approaches to Computational Barriers