Light logics and higher-order processes
From MaRDI portal
Recommendations
- Light logics and higher-order processes
- Intuitionistic light affine logic
- Light logics and optimal reduction: completeness and complexity
- Light linear logic
- Light linear logic
- scientific article; zbMATH DE number 1926604
- Theoretical Computer Science
- scientific article; zbMATH DE number 1852930
- scientific article; zbMATH DE number 1028827
- scientific article; zbMATH DE number 3323813
Cites work
- A Hybrid Type System for Lock-Freedom of Mobile Processes
- A Soft Type Assignment System for λ-Calculus
- Bisimulation for higher-order process calculi
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Differential interaction nets
- Light linear logic
- Linear logic
- Soft linear logic and polynomial time
- Taming Modal Impredicativity: Superlazy Reduction
- Termination in higher-order concurrent calculi
- Termination in impure concurrent languages
- The intuitionism behind statecharts steps
Cited in
(6)- Causal computational complexity of distributed processes
- Types for complexity of parallel computation in pi-calculus
- An elementary affine -calculus with multithreading and side effects
- Light logics and higher-order processes
- Implicit computation complexity in higher-order programming languages
- Theoretical Computer Science
This page was built for publication: Light logics and higher-order processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971072)