J. Auerbach, C. Barton, M. Chu-Carroll and M. Raghavachari, "Mockingbird: Flexible Stub Compilation from Pairs of Declarations," 11 19th IEEE International Conference on Distributed Computing Systems, May 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient and Flexible Matching of Recursive Types - Palsberg, Zhao (2000) (3 citations) (Correct)
....a translation may be helpful when building a new software component that should be connected to an existing one. However, when faced with connecting two existing software components, type matching and automatic bridge code generation seems more helpful. CORBA [20] PolySpin [6] and Mockingbird [5, 3] are systems for gluing together components from di erent languages. In some multi language applications, software modules can be considered to be of two kinds, object and client. Objects must include public interfaces to allow access from clients written in di erent languages. CORBA style ....
Joshua Auerbach, Charles Barton, Mark Chu-Carroll, and Mukund Raghavachari. Mockingbird: Flexible stub compilation from pairs of declarations. In Proceedings of the 19th International Conference on Distributed Computing Systems, pages 393-402, June 1999.
Efficient and Flexible Matching of Recursive Types - Palsberg, Zhao (2000) (3 citations) (Correct)
....programmers for distributed applications may want to provide interfaces to facilitate interoperability with other programs already written in several di erent languages. In any case, mechanisms are needed to glue these multi lingual components together. CORBA [22] PolySpin [6] and Mockingbird [5, 3], etc. are systems designed to overcome this diculty. In multi language applications, software modules can be considered to be of two kinds, object and client. Objects must include public interfaces to 10 allow access from clients written in di erent languages. CORBA style approaches utilize a ....
J. Auerbach, C. Barton, M. Chu-Carroll, and M. Raghavachari. Mockingbird: Flexible stub compilation from pairs of declarations. In Proceedings of the 19th International Conference on Distributed Computing Systems, pages 393{ 402, June 1999.
Efficient and Flexible Matching of Recursive Types - Palsberg, Zhao (2000) (3 citations) (Correct)
....programmers for distributed applications may want to provide interfaces to facilitate interoperability with other programs already written in several different languages. In any case, mechanisms are needed to glue these multi lingual components together. CORBA [22] PolySpin [6] and Mockingbird [5, 3], etc. are systems designed to overcome this difficulty. In multi language applications, software modules can be considered to be of two kinds, object and client. Objects must include public interfaces to 10 allow access from clients written in different languages. CORBA style approaches ....
J. Auerbach, C. Barton, M. Chu-Carroll, and M. Raghavachari. Mockingbird: Flexible stub compilation from pairs of declarations. In Proceedings of the 19th International Conference on Distributed Computing Systems, pages 393-- 402, June 1999.
M-types and Their Coercions - Barton (1999) Self-citation (Barton) (Correct)
....the natural transformations and leaf coercions that occur in a coercion c denote injective (resp. surjective bijective) maps, we show the same for c. We also show how to invert formally a bijective coercion. 1 Introduction The problems considered in this report grew out of the Mockingbird project [4], which has developed a tool to generate adapters between programs written in possibly different programming languages and running in a distributed environment. The tool analyzes a pair of type declarations in the two languages and generates stub code to convert values of one type to values of the ....
....and the user interface, as well as in more theoretical questions. The original strategy of translating type declaration to an internal form and matching these comes from a paper of Auerbach and Russell [6] Not all aspects of the project have been presented but a series of references is available ([2, 3, 4, 5]) This report provides a solution to one of the theoretical questions raised by the project. Some of the remaining theoretical issues are discussed later (Section 9) The equivalences found by the tool are based on structure rather than on names. Starting from identifications between primitive ....
[Article contains additional citation context not shown here]
Joshua Auerbach, Charles Barton, Mark Chu-Carroll, and Mukund Raghavachari. Mockingbird: Flexible stub compilation from pairs of declarations. In 1999 IEEE International Conference on Distributed Computing Systems, July 1999.
Design of Large-Scale Polylingual Systems - Grechanik, Batory, Perry (2004) (1 citation) (Correct)
No context found.
J. Auerbach, C. Barton, M. Chu-Carroll and M. Raghavachari, "Mockingbird: Flexible Stub Compilation from Pairs of Declarations," 11 19th IEEE International Conference on Distributed Computing Systems, May 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC