Luca Cardelli

Print Print
Reading time 4:12

Luca Cardelli
DSC 4698 HiRes Crop.jpg
Born
Luca Andrea Cardelli

Montecatini Terme, Italy
EducationUniversity of Pisa[1]
PhD, University of Edinburgh, 1982
Known forTheory of Objects[2] with Martín Abadi
AwardsFellow of the Royal Society (2005)
Dahl–Nygaard Prize (2007)
Fellow of the ACM (2005)
Scientific career
FieldsType theory
Operational semantics
InstitutionsBell Labs
Microsoft Research
Digital Equipment Corporation
University of Edinburgh
University of Oxford[3]
ThesisAn algebraic approach to hardware description and verification (1982)
Doctoral advisorGordon Plotkin[4]
Websitelucacardelli.name

Luca Andrea Cardelli, Fellow of the Royal Society (FRS), is an Italian computer scientist who is a Research Professor at the University of Oxford in Oxford, UK.[1][5] Cardelli is well known for his research in type theory and operational semantics.[6][7] Among other contributions, in programming languages, he helped design the language Modula-3, implemented the first compiler for the (non-pure) functional language ML, defined the concept of typeful programming, and helped develop the experimental language Polyphonic C#.[2][8][9][10][11][12]

Education

He was born in Montecatini Terme, Italy. He attended the University of Pisa[1] before receiving his Doctor of Philosophy (PhD) from the University of Edinburgh in 1982.[13] Before joining the University of Oxford in 2014, and Microsoft Research in Cambridge, UK in 1997, he worked for Bell Labs and Digital Equipment Corporation,[1] and contributed to Unix software including vismon.[14]

Awards

In 2004 he was inducted as a Fellow of the Association for Computing Machinery. He is a Fellow of the Royal Society. In 2007, Cardelli was awarded the Senior AITO Dahl–Nygaard Prize named for Ole-Johan Dahl and Kristen Nygaard.[15]

References

  1. ^ a b c d "Cardelli, Luca". Who's Who 2013, A & C Black, an imprint of Bloomsbury Publishing plc, 2013; online edn, Oxford University Press.(subscription required)
  2. ^ a b Cardelli, Luca; Abadi, Martín (1996). A theory of objects. Berlin: Springer. ISBN 978-0-387-94775-4.
  3. ^ Cardelli, Luca (2021). "Luca Cardelli". Department of Computer Science. University of Oxford.
  4. ^ Luca Cardelli at the Mathematics Genealogy Project
  5. ^ Dalchau, N.; Phillips, A.; Goldstein, L. D.; Howarth, M.; Cardelli, L.; Emmott, S.; Elliott, T.; Werner, J. M. (2011). Chakraborty, Arup K (ed.). "A Peptide Filtering Relation Quantifies MHC Class I Peptide Optimization". PLOS Computational Biology. 7 (10): e1002144. Bibcode:2011PLSCB...7E2144D. doi:10.1371/journal.pcbi.1002144. PMC . PMID 22022238.
  6. ^ Cardelli, L. (1996). "Bad engineering properties of object-orient languages". ACM Computing Surveys. 28 (4es): 150–es. doi:10.1145/242224.242415. S2CID 12105785.
  7. ^ Cardelli, Luca; Wegner, Peter (December 1985). "On understanding types, data abstraction, and polymorphism" (PDF). ACM Computing Surveys. 17 (4): 471–523. CiteSeerX . doi:10.1145/6041.6042. ISSN 0360-0300. S2CID 2921816.
  8. ^ Luca Cardelli author profile page at the ACM Digital Library
  9. ^ Luca Cardelli at DBLP Bibliography Server Edit this at Wikidata
  10. ^ List of publications from Microsoft Academic
  11. ^ Luca Cardelli's publications indexed by the Scopus bibliographic database. (subscription required)
  12. ^ Abadi, M.; Cardelli, L.; Curien, P. L.; Levy, J. J. (1990). "Explicit substitutions". Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL) '90. p. 31–46. CiteSeerX . doi:10.1145/96709.96712. ISBN 978-0897913430. S2CID 7265577.
  13. ^ Cardelli, Luca (1982). An algebraic approach to hardware description and verification (PhD thesis). University of Edinburgh.
  14. ^ McIlroy, M. D. (1987). A Research Unix reader: annotated excerpts from the Programmer's Manual, 1971–1986 (PDF) (Technical report). CSTR. Bell Labs. 139.
  15. ^ "The AITO Dahl–Nygaard Prize Winners for 2007". Association Internationale pour les Technologies Objets. Mjølner Informatics. 2007.

External links

By: Wikipedia.org
Edited: 2021-06-18 19:29:55
Source: Wikipedia.org