Quantitative weak linearisation

DOI10.1007/978-3-031-17715-6_7MaRDI QIDQ6164467

Daniel Lima Ventura, Sandra Alves

Publication date: 28 July 2023

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

zbMATH Keywords

intersection typeslinearisationminimal typings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Paths, computations and labels in the \(\lambda\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The linear abstract machine
• An extension of basic functionality theory for \(\lambda\)-calculus
• Perpetual reductions in \(\lambda\)-calculus
• Weak linearization of the lambda calculus
• Geometry of synthesis
• A linearization of the Lambda-calculus and consequences
• A resource aware semantics for a focused intuitionistic calculus
• Non-idempotent intersection types for the Lambda-Calculus
• Functionality in Combinatory Logic
• Tight typings and split bounds, fully developed
• Consuming and Persistent Types for Classical Logic
• Geometry of synthesis III
• The Principal Type-Scheme of an Object in Combinatory Logic
• Linearization of the lambda-calculus and its relation with intersection type systems
• Types by need
• Types of fireballs

This page was built for publication: Quantitative weak linearisation