A semantics for _str^\\,\: A calculus with overloading and late-binding

DOI10.1093/LOGCOM/11.4.527MaRDI QIDQ2761748zbMATH OpenOpenAlexFDO

Authors Thomas Studer

Publication date 22 May 2003

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://boris.unibe.ch/115282/1/110527.pdf

zbMATH Keywords

\(\lambda\)-calculusobject-oriented programming languagereductionssubtypingtype-checking

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 512775
• Semantics of the typed -calculus with substitution in a cartesian closed category
• Unifying overloading and \(\lambda\)-abstraction: \(\lambda^{\{\,\}}\)
• Publication:4490732
• A calculus for overloaded functions with subtyping

Cited in

(7)

• Formalizing non-termination of recursive programs
• Unifying overloading and \(\lambda\)-abstraction: \(\lambda^{\{\,\}}\)
• A calculus for overloaded functions with subtyping
• A computationally adequate model for overloading via domain-valued functors
• scientific article; zbMATH DE number 512775 (Why is no real title available?)
• scientific article; zbMATH DE number 1479619 (Why is no real title available?)
• Explicit mathematics: power types and overloading

This page was built for publication: A semantics for \(\lambda_{str}^{\{\,\}}\): A calculus with overloading and late-binding

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