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

DOI10.1093/LOGCOM/11.4.527zbMATH Open1010.68032OpenAlexW1597392200MaRDI QIDQ2761748

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

reductions\(\lambda\)-calculusobject-oriented programming languagesubtypingtype-checking

Mathematics Subject Classification ID

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

Related Items (2)

Formalizing non-termination of recursive programs ⋮ 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)