Computing with coercions

V. Breazu-Tannen, C. A. Gunter, A. Scedrov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper relates two views of the operational semantics of a language with multiple inheritance. It is shown that the introduction of explicit coercions as an interpretation for the implicit coercion of inheritance does not affect the evaluation of a program in an essential way. The result is proved by semantic means using a denotational model and a computational adequacy result to relate the operational and denotational semantics.

Original languageEnglish (US)
Title of host publicationProc 1990 ACM Conf LISP Funct Program
Editors Anon
PublisherPubl by ACM
Pages44-60
Number of pages17
ISBN (Print)089791368X
StatePublished - Dec 1 1990
Externally publishedYes
EventProceedings of the 1990 ACM Conference on LISP and Functional Programming - Nice, Fr
Duration: Jun 27 1990Jun 29 1990

Publication series

NameProc 1990 ACM Conf LISP Funct Program

Other

OtherProceedings of the 1990 ACM Conference on LISP and Functional Programming
CityNice, Fr
Period6/27/906/29/90

ASJC Scopus subject areas

  • Engineering(all)
  • Software
  • Modeling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Computing with coercions'. Together they form a unique fingerprint.

Cite this