Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach

DOI10.1017/S0960129516000311zbMath1390.68169OpenAlexW2552773083MaRDI QIDQ4637628

Marco Solieri

Publication date: 25 April 2018

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129516000311

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items

Abstract machines, optimal reduction, and streams

Uses Software

• PELCR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logarithmic space and permutations
• Intuitionistic differential nets and lambda-calculus
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Linear logic
• Paths, computations and labels in the \(\lambda\)-calculus
• Differential interaction nets
• Uniformity and the Taylor expansion of ordinary lambda-terms
• The differential lambda-calculus
• A call-by-name lambda-calculus machine
• Weak linearization of the lambda calculus
• Unary Resolution: Characterizing Ptime
• Context semantics, linear logic, and computational complexity
• Parsimonious Types and Non-uniform Computation
• The Separation Theorem for Differential Interaction Nets
• The geometry of synchronization
• On context semantics and interaction nets
• Parallelism and Synchronization in an Infinitary Context
• PELCR
• Simple Parsimonious Types and Logarithmic Space
• Applying quantitative semantics to higher-order quantum computing
• Characterizingco-NLby a group action
• Logical Approaches to Computational Barriers