We define an extension of Casl, the standard language for algebraic specification, with a late binding mechanism. More precisely, we introduce a special kind of functions called methods, for which, differently to what happens for usual functions, overloading resolution is delayed at evaluation

Most comparisons among OO languages focus on structural or philosophical features but rarely on dynamic ones. Beyond all these structural properties, late-binding is, to our opinion, the key property of OO paradigm; the operational consequence of inheritance use. All OO languages use late-binding

.e., their intent), not where to find things (i.e., not hostnames). INS implements a late binding mechanism that integrates name resolution and message routing, enabling clients to continue communicating with end-nodes even if the name-to-address mappings change while a session is in progress. INS resolvers self

-til these values are used in the design. This late-binding al-lows the generator to have a more accurate view of the state of the design, and thus it can better choose the correct val-ues. Experimental results show that late-binding can signif-icantly improve coverage, with a reasonable penalty in sim-ulation time

Abstract. The Focal language (formerly FoC) allows one to incre-mentally build modules and to formally prove their correctness. In this paper, we present two formal semantics for encoding Focal construc-tions in the Coq proof assistant. The first one is implemented in the Focal compiler to have the correctness of Focal libraries verified with the Coq proof-checker. The second one formalizes the Focal structures and their main properties as Coq terms (called mixDrecs). The relations between the two embeddings are examined in the last part of the paper. 1

This paper presents the extensions made to the query compiler of an object-relational database management system (ORDBMS) to make it function incrementally and to make it resolve when late binding of function calls must be used. The object-oriented model consists of features such as operator

We define a specification formalism (formally, an institution) which provides a notion of dynamic type (the type which is associated to a term by a particular evaluation) and late binding (the fact that the function version to be invoked in a function application depends on the dynamic type of one

Conventional load/store queues (LSQs) are an impediment to both power-efficient execution in superscalar processors and scaling to large-window designs. In this paper, we propose techniques to improve the area and power efficiency of LSQs by allocating entries when instructions issue (“late binding

Up to now there was no interpretation available for #-calculi featuring overloading and late-binding, although these are two of the main principles of any object-oriented programming language. In this paper we provide a new semantics for a stratified version of Castagna's # {} , a #-calculus

Implemented a successful, collaborative spine care coordination program 16 percent reduction in LOS 3.6 percent reduction in post-op complications Projected $2.7 million savings with supplies standardization