Quantitative weak linearisation
From MaRDI portal
Publication:6164467
DOI10.1007/978-3-031-17715-6_7MaRDI QIDQ6164467FDOQ6164467
Authors: Sandra Alves, Daniel Lima Ventura 
Publication date: 28 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Linear logic
- The lambda calculus. Its syntax and semantics. Rev. ed.
- An extension of basic functionality theory for \(\lambda\)-calculus
- Perpetual reductions in \(\lambda\)-calculus
- Geometry of synthesis: a structured approach to VLSI design
- A linearization of the Lambda-calculus and consequences
- Geometry of synthesis III
- Title not available (Why is that?)
- The Principal Type-Scheme of an Object in Combinatory Logic
- The linear abstract machine
- Paths, computations and labels in the \(\lambda\)-calculus
- Functionality in Combinatory Logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weak linearization of the lambda calculus
- Linearization of the lambda-calculus and its relation with intersection type systems
- Non-idempotent intersection types for the lambda-calculus
- Tight typings and split bounds, fully developed
- Types by need
- Types of fireballs
- A resource aware semantics for a focused intuitionistic calculus
- Title not available (Why is that?)
- Consuming and persistent types for classical logic
This page was built for publication: Quantitative weak linearisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164467)
