UNIFYING OVERLOADING AND LAMBDA-ABSTRACTION - LAMBDA(())

Authors
CASTAGNA G
Citation
G. Castagna, UNIFYING OVERLOADING AND LAMBDA-ABSTRACTION - LAMBDA(()), Theoretical computer science, 176(1-2), 1997, pp. 337-345
Citations number
7
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
176
Issue
1-2
Year of publication
1997
Pages
337 - 345
Database
ISI
SICI code
0304-3975(1997)176:1-2<337:UOAL-L>2.0.ZU;2-B
Abstract
In this short note, we present a minimal system to deal with overloade d functions with late binding, in which lambda-abstractions are seen a s a special case of overloaded functions with just one code. We prove some relevant properties that this system enjoys, and show its connect ion with the lambda&-calculus. We end by showing the practical interes t of this system, in particular in modeling object-oriented languages.