Safe run-time overloading

1 January 1990

proceedings article
Published by Association for Computing Machinery (ACM)

p. 355-366
https://doi.org/10.1145/96709.96746

Abstract

We present a functional language featuring a form of dynamic overloading akin to message passing in object oriented languages. We give a dynamic semantics describing a non-deterministic evaluation, as well as a type discipline (static semantics) supporting type inference. The type system ensures that a well-typed program has a correct execution, unique up to a semantic equivalence relation, and allows this execution to proceed deterministically, while resolving overloading at run-time.

Keywords

SAFE RUN-TIME OVERLOADING
DYNAMIC SEMANTICS
TYPE INFERENCE
TYPE DISCIPLINE
FUNCTIONAL LANGUAGE
SEMANTIC EQUIVALENCE RELATION
NON-DETERMINISTIC EVALUATION
STATIC SEMANTICS
CORRECT EXECUTION
WELL-TYPED PROGRAM
TYPE SYSTEM
MESSAGE PASSING
OBJECT ORIENTED LANGUAGE
EQUIVALENCE RELATION

This publication has 0 references indexed in Scilit: