Modular Inference of Linear Types for Multiplicity-Annotated Arrows

DOI10.1007/978-3-030-44914-8_17OpenAlexW3022512114MaRDI QIDQ5041106

Kazutaka Matsuda

Publication date: 13 October 2022

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.00268

zbMATH Keywords

type inferencelinear typesqualified typing

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Uses Software

• Alms
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A list of successes that can change the world. Essays dedicated to Philip Wadler on the occasion of his 60th birthday
• Light types for polynomial time computation in lambda calculus
• Bounded linear logic: A modular approach to polynomial-time computability
• An arithmetic for non-size-increasing polynomial-time computation
• Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
• A Semantics for Propositions as Sessions
• Towards a Reversible Functional Language
• A theory of overloading
• The best of both worlds: linear functional programming without compromise
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Qualified Types
• <scp>OutsideIn(X)</scp>Modular type inference with local assumptions
• Practical affine types
• Bounded Linear Types in a Resource Semiring
• A lambda calculus for quantum computation with classical control
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Typed Lambda Calculi and Applications

This page was built for publication: Modular Inference of Linear Types for Multiplicity-Annotated Arrows