| J. Auerbach, M. C. Chu-Carrol, C. Barton, and M. Raghavachari. Mockingbird: Flexible stub generation from pairs of declarations. Technical Report RC 21309, IBM Yorktown Heights, 1998. |
.... The type isomorphisms based approach can help in retrieving complex software components from large libraries of functions [15, 24, 25] or modules [29, 3, 4] and in automatically producing bridge code between different representations of a (possibly recursive) data type in systems like Mockingbird [6, 7] or PolySpin [21] These active areas are currently attracting the attention of many researchers. Unfortunately, the general problem of characterizing isomorphic types for a full fledged type system, including sums, products, polymorphic and recursive types such as that underlying Mockingbird ....
J. Auerbach, M. C. Chu-Carrol, C. Barton, and M. Raghavachari. Mockingbird: Flexible stub generation from pairs of declarations. Technical Report RC 21309, IBM Yorktown Heights, 1998.
.... The type isomorphisms based approach can help in retrieving complex software components from large libraries of functions [15, 24, 25] or modules [28, 3, 4] and in automatically producing bridge code between different representations of a (possibly recursive) data type in systems like Mockingbird [6, 7] or PolySpin [21] These active areas are currently attracting the attention of many researchers. Unfortunately, the general problem of characterizing isomorphic types for a full fledged type system, including sums, products, polymorphic and recursive types such as that underlying Mockingbird ....
J. Auerbach, M. C. Chu-Carrol, C. Barton, and M. Raghavachari. Mockingbird: Flexible stub generation from pairs of declarations. Technical Report RC 21309, IBM Yorktown Heights, 1998.
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