Quantitative weak linearisation

DOI10.1007/978-3-031-17715-6_7MaRDI QIDQ6164467zbMATH OpenFDO

Authors Sandra Alves, Daniel Lima Ventura

Publication date 28 July 2023

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

Full work available at URL https://doi.org/10.1007/978-3-031-17715-6_7

zbMATH Keywords

intersection typeslinearisationminimal typings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A linearization of the Lambda-calculus and consequences
• A resource aware semantics for a focused intuitionistic calculus
• An extension of basic functionality theory for -calculus
• Consuming and persistent types for classical logic
• Functionality in Combinatory Logic
• Geometry of synthesis III
• Geometry of synthesis: a structured approach to VLSI design
• scientific article; zbMATH DE number 3619856 (Why is no real title available?)
• scientific article; zbMATH DE number 1042221 (Why is no real title available?)
• scientific article; zbMATH DE number 1479634 (Why is no real title available?)
• Linear logic
• Linearization of the lambda-calculus and its relation with intersection type systems
• Non-idempotent intersection types for the lambda-calculus
• Non-idempotent types for classical calculi in natural deduction style
• Paths, computations and labels in the \(\lambda\)-calculus
• Perpetual reductions in -calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The linear abstract machine
• The Principal Type-Scheme of an Object in Combinatory Logic
• Tight typings and split bounds, fully developed
• Types by need
• Types of fireballs
• Weak linearization of the lambda calculus

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)