Results 1 - 10
of
2,423
Extending Casl by Late Binding
- Recent Trends in Algebraic Development Techniques, 14th International Workshop, WADT'99
, 2000
"... 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 ti ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
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
OO languages late-binding signature
- In FOOL 9 (The Ninth International Workshop on Foundations of Object-Oriented Languages
, 2002
"... 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, b ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
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
The design and implementation of an intentional naming system
- 17TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '99) PUBLISHED AS OPERATING SYSTEMS REVIEW, 34(5):186--201, DEC. 1999
, 1999
"... This paper presents the design and implementation of the Intentional Naming System (INS), a resource discovery and service location system for dynamic and mobile networks of devices and computers. Such environments require a naming system that is (i) expressive, to describe and make requests based o ..."
Abstract
-
Cited by 518 (14 self)
- Add to MetaCart
.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
Stimuli Generation with Late Binding of Values
"... Generating test-cases that reach corner cases in the de-sign is one of the main challenges in the functional verifi-cation of complex designs. In this paper, we describe a new technique that increases the ability of test generators by de-laying assignment of values in the generated stimuli, un-til t ..."
Abstract
- Add to MetaCart
-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
Proof contexts with late binding
- In Typed Lambda Calculi and Applications, volume 3461 of LNCS
, 2005
"... 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 ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
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
An Incremental Query Compiler with Resolution of Late Binding
, 1994
"... 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 overloa ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
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
A Formal Framework with Late Binding
- Fundamental Approaches to Software Engineering - Second International Conference, FASE'99
, 1999
"... 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 o ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
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
Late-Binding: Enabling unordered load-store queues
- In Proceedings of the 34th Annual International symposium on Computer Architecture
, 2007
"... 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” ..."
Abstract
-
Cited by 21 (6 self)
- Add to MetaCart
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
A Semantics for ...: A Calculus With Overloading and Late-Binding
, 2000
"... 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 co ..."
Abstract
- Add to MetaCart
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
PRODUCTS Late-Binding ™ Data Warehouse
"... 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 ..."
Abstract
- Add to MetaCart
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
Results 1 - 10
of
2,423