Static typing for a substructural lambda calculus

DOI10.1007/S11704-011-9106-1zbMATH Open1267.68086OpenAlexW2078715622MaRDI QIDQ352080FDOQ352080

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

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

zbMATH Keywords

programming languageslinear type systemssubstructural type systemsubtyping theorytype preserving translation

Mathematics Subject Classification ID

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

Cites Work

• Linear logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On regions and linear types (extended abstract)
• An effective theory of type refinements
• On the unity of logic

Cited In (8)

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

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)