Unifying overloading and \(\lambda\)-abstraction: \(\lambda^{\{\,\}}\)

DOI10.1016/S0304-3975(97)81497-1zbMath0903.68021MaRDI QIDQ1392284

Giuseppe Castagna

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(\lambda\&\)-calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Basic theory of \(F\)-bounded quantification.

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• A calculus for overloaded functions with subtyping
• Unnamed Item

This page was built for publication: Unifying overloading and \(\lambda\)-abstraction: \(\lambda^{\{\,\}}\)