Interface definition language conversions: recursive types

Authors:
David E. Gay
Affiliations:
Swiss Federal Institute of Technology, Lausanne, Computer Engineering Department, EPFL-DI-LIT, CH-1015 Lausanne, Switzerland
Venue:
IDL '94 Proceedings of the workshop on Interface definition languages
Year:
1994

Citing 3
Cited 2

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
A Value Transmission Method for Abstract Data Types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness

Efficient and flexible matching of recursive types

Information and Computation
Efficient and Flexible Matching of Recursive Types

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A large heterogeneous network contains many applications developed in different environments, each with its own incompatible interface definition language. One way of dealing with this diversity is to define a conversion from the interfaces of one system into another, thus giving access from the second system to the first. This presents a number of difficulties, amongst which is the different representation of recursive types in different languages. This paper gives two algorithms for converting the representation of such recursive types between different styles of interface definition languages.