Light logics and higher-order processes
From MaRDI portal
Publication:2971072
DOI10.1017/S0960129514000310zbMath1362.68209MaRDI QIDQ2971072
Ugo Dal Lago, Simone Martini, Davide Sangiorgi
Publication date: 4 April 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (4)
Types for complexity of parallel computation in pi-calculus ⋮ An Elementary Affine λ-Calculus with Multithreading and Side Effects ⋮ Causal computational complexity of distributed processes ⋮ Implicit computation complexity in higher-order programming languages
Cites Work
- Linear logic
- Bisimulation for higher-order process calculi
- Differential interaction nets
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Light linear logic
- Soft linear logic and polynomial time
- Termination in Higher-Order Concurrent Calculi
- A Hybrid Type System for Lock-Freedom of Mobile Processes
- Termination in Impure Concurrent Languages
- Taming Modal Impredicativity: Superlazy Reduction
- A Soft Type Assignment System for λ-Calculus
- The intuitionism behind Statecharts steps
This page was built for publication: Light logics and higher-order processes
