Practical affine types

DOI10.1145/1926385.1926436MaRDI QIDQ5408563zbMATH OpenOpenAlexFDO

Authors Jesse A. Tov, Riccardo Pucella

Publication date 10 April 2014

Published in Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1926385.1926436

zbMATH Keywords

affine typeslinear logicmodulespolymorphismtype systems

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of programming languages (68N15)

Recommendations

• Stateful contracts for affine types
• Bounded Linear Types in a Resource Semiring
• Lilac: a functional programming language based on linear logic
• Type classes for lightweight substructural types
• A modality for safe resource sharing and code reentrancy

Cited in

(19)

• A message-passing interpretation of adjoint logic
• Polymorphic lambda calculus with context-free session types
• Graded modal dependent type theory
• Practical Optional Types for Clojure
• Linearity, control effects, and behavioral types
• Context-free session type inference
• Alms
• Stateful contracts for affine types
• LNL-FPC: the linear/non-linear fixpoint calculus
• Type classes for lightweight substructural types
• Modular inference of linear types for multiplicity-annotated arrows
• A simple library implementation of binary sessions
• Linearity and uniqueness: an entente cordiale
• Safe session-based concurrency with shared linear state
• Uniqueness types for efficient and verifiable aliasing-free embedded systems programming
• Formally understanding Rust's ownership and borrowing system at the memory level
• Adjoint natural deduction
• Kind inference for the \textsc{FreeST} programming language
• Parameterized dataflow (extended abstract)

Describes a project that uses

Uses Software

• ML

This page was built for publication: Practical affine types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408563)