Substructural Type Systems for Program Analysis

DOI10.1007/978-3-540-78969-7_3zbMATH Open1137.68356OpenAlexW4242658509MaRDI QIDQ5458425FDOQ5458425

Authors: Naoki Kobayashi 

Publication date: 11 April 2008

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78969-7_3

Recommendations

• Static typing for a substructural lambda calculus
• Type classes for lightweight substructural types
• Linear logic propositions as session types
• Type systems for concurrent programs.
• A Substructural Type System for Delimited Continuations

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Cited In (8)

• Subtyping inheritance and its application in languages for symbolic computation systems
• Strictness analysis via abstract interpretation for recursively defined types
• Type systems equivalent to data-flow analyses for imperative languages
• Type-base flow analysis
• A type-based escape analysis for functional languages
• Static typing for a substructural lambda calculus
• Type classes for lightweight substructural types
• Title not available (Why is that?)

This page was built for publication: Substructural Type Systems for Program Analysis

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