Static typing for a substructural lambda calculus

DOI10.1007/S11704-011-9106-1MaRDI QIDQ352080zbMATH OpenOpenAlexFDO

Authors Baojian Hua

Publication date 4 July 2013

Published in Frontiers of Computer Science in China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11704-011-9106-1

zbMATH Keywords

linear type systemsprogramming languagessubstructural type systemsubtyping theorytype preserving translation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• Type classes for lightweight substructural types
• Substructural Type Systems for Program Analysis
• Strong normalizability of typed lambda-calculi for substructural logics
• scientific article; zbMATH DE number 1670475
• A Substructural Type System for Delimited Continuations

Cites work

• An effective theory of type refinements
• scientific article; zbMATH DE number 1629948 (Why is no real title available?)
• scientific article; zbMATH DE number 46118 (Why is no real title available?)
• scientific article; zbMATH DE number 1342286 (Why is no real title available?)
• Linear logic
• On regions and linear types (extended abstract)
• On the unity of logic

Cited in

(9)

• Polymorphic lambda calculus and subtyping.
• Type Class Instances for Type-Level Lambdas in Haskell
• Type classes for lightweight substructural types
• Computational adequacy for substructural lambda calculi
• Superficially substructural types
• Substructural meta-theory of a type-safe language for web programming
• Substructural Type Systems for Program Analysis
• Additive types in quantitative type theory
• A framework for substructural type systems

This page was built for publication: Static typing for a substructural lambda calculus

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