Abstract
We extend the Type System defined in [San95] with Axiomlike Conditional Categories with the additional property of Static Typing and Checking. Categories and Domains may contain conditionals in their bodies, which are elaborated by our compiler by techniques used in standard typing. We define an appropriate calculus and discuss its properties. Examples inspired by the Axiom library illustrate the power of our approach and its application in constructing algebraic concepts. The full calculus has been implemented and tested with our LA compiler which generates executable files.
I thank Manuel Bronstein, Richard Jenks, Barry Trager and Stephen Watt for support and discussions on the Axiom system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Cardelli, B. Pierce, G. Plotkin. Dynamic Typing in a Statically Typed Language. ACM Transactions on Programming Languages and Systems. 13(2). April 1991.
M. Abadi, L. Cardelli, B. Pierce, G. Plotkin, D. Remy. Dynamic Typing in Polymorphic Languages. In Proc. the ACM Workshop on ML. ACM. June 1992.
A. Aiken, E.L.Wimmers, T.K. Lakshman. Soft Typing with Conditional Types. In Proc. of the 21st Sumposium on Principles of Programming Languages (POPL'94). ACM Press. 1994.
R. Cartwright, M. Fagan. Soft Typing. POPL'93. ACM Press. 1993.
K. O. Geddes, S. R. Czapor, G. Labahn. Algorithms for Computer Algebra. Kluwier Academic Publishers. 1992.
R. W. Harper, M. D. Lillibridge. A Type-Theoretic Approach to Higher-Order Modules with Sharing. POPL'94. ACM Press. 1994.
R.W. Harper, J.C. Mitchell. On the Type Structure of SML. ACM Transactions on Programming Languages and Systems. 15(2). pp. 211–252. 1993.
R. D. Jenks, R. S. Sutor. Axiom: The Scientific Computation System. NAG, Springer Verlag. 1992.
R. D. Jenks, B. M. Trager. How to make Axiom into a scratchpad. In Proc. of ISSAC'94. ACM Press. 1994.
X. Leroy. Manifest Types, Modules and Separate Compilation. POPL'94. pp. 109–122. ACM Press. 1994.
X. Leroy, M. Mauny. Dynamics in ML. J. of Functional Progr., 3(4). 1993
D. B. MacQueen. Using Dependent Types to express Modular Structure. Proc. of POPL'86. pp. 277–286. ACM Press, Fla. 1986.
M. Monagan. Gauss: a Parameterized Domains of Computation System with Support for Signature Functions. Proceedings of DISCO'93. pp. 81–94. LNCS 722, Springer Verlag. 1994.
P. S. Santas. A Type System for Computer Algebra. Journal of Symbolic Computation. (19). pp 79–109. 1995.
S. Thate. Type Inference with Partial Types. In Automata, Languages and Programming. LNCS, 317. July 1988.
S.M. Watt, P.A. Broadbery, S.S. Dooley, P. Iglio, S.C. Morrison, J.M. Steinbach, R.S. Sutor. A# User's Guide. NAG. 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santas, P.S. (1996). Conditional categories and domains. In: Calmet, J., Limongelli, C. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1996. Lecture Notes in Computer Science, vol 1128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61697-7_11
Download citation
DOI: https://doi.org/10.1007/3-540-61697-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61697-9
Online ISBN: 978-3-540-70635-9
eBook Packages: Springer Book Archive