Abstract
An implementation of packages is described. The implementation is based on viewing packages as substitutions. Using a few operations on packages it is possible to build any package, from a small collection of basic packages. Generic packages can be built, that can be used as building blocks for new packages. The packages defined by the model lend themselves well to algebraic manipulation.
The authors were partially supported by NSF grant MCS 83-14600.
On leave of absence from Rensselaer Polytechnic Institute.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
8. References
Ada Programming Language, MIL-STD-1815, 10 December 1980.
Agnarsson, S. and M. S. Krishnamoorthy, Towards a Theory of Packages, to appear in proceedings of SIGPLAN '85, 1985.
Agnarsson, S., Packages as Substitutions, Forthcoming Ph.D. Thesis, RPI, Troy, NY, April 1985.
Bloom, Stephen L., Calvin C. Elgot and Jesse B. Wright, Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation, SIAM Journal of Computing, 9, No. 1, February 1980.
Bloom, Stephen L., James W. Thatcher, Eric G. Wagner and Jesse B. Wright, Recursion and Iteration in Continuous Theories: The "M-Construction", Journal of Computer and System Sciences, 27 (1983) 148–164.
Bloom, Stephen L., All Solutions of a System of Recursion Equations in Infinite Trees and Other Contraction Theories, Journal of Computer and System Sciences, 27 (1983) 225–255.
Burstall, R., Programming with Modules as Typed Functional Programming, Proc. International Conference on Fifth Generation Computing Systems, Tokyo, November 1984.
Burstall, R. and B. Lampson, A Kernel Language for Abstract Data Types and Modules, Lecture Notes in Computer Science, Vol. 173, Springer-Verlag, New York, 1984.
Courcelle, B., A representation of trees by languages, Theoretical Computer Science, 6 (1978) 225–279 and 7 (1978) 25–55.
Courcelle, B., Infinite Trees in Normal Form and Recursive Equations Having a Unique Solution, Mathematical Systems Theory, 13 (1979) 131–180.
Courcelle, B., Fundamental Properties of Infinite Trees, Theoretical Computer Science, 25 (1983) 95–169.
Demers, A. J., and J. E. Donahue, "Type Completeness" as a Language Principle, Proceedings Seventh Annual Principles of Programming Languages Symposium, 1980, pp. 234–244.
Demers, A. J., and J. E. Donahue, Data Types, Parameters and Type Checking, Proceedings Seventh Annual Principles of Programming Languages Symposium, 1980, pp. 12–23.
Gallier, J. DPDA's in’ atomic normal form’ and applications to the equivalence problems, Theoretical Computer Science, 14 (1981) 155–186.
Ginali, Susanna, Regular Trees and the Free Iterative Theory, Journal of Computer and System Sciences, 18 (1979) 228–242.
Goguen, Joseph A., Parameterized Programming, IEEE Transactions on Software Engineering, Vol. SE-10, 5, September 1984.
Jenks, R. D., A Primer: 11 Keys to New Scratchpad, Lecture Notes in Computer Science, Vol. 174. Springer-Verlag, New York, 1984.
Liskov, Barbara, Russell Atkinson, Toby Bloom, Eliot Moss, J. Craig Schaffert, Robert Scheifler and Alan Snyder, CLU Reference Manual, Lecture Notes in Computer Science, Vol. 114, Springer-Verlag, New York, 1981.
Milner, R., A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences 17, 348–375 (1978).
Reynolds, John C., GEDANKEN — A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept, Communications of the ACM 17, no. 5, pp. 308–319, May, 1970.
Wirth, Niklaus, Programming in MODULA-2, Springer-Verlag, New York, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agnarsson, S., Krishnamoorthy, M.S., Saunders, B.D. (1985). An algebraic implementation of packages. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_280
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_280
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive