Abstract
This paper presents a method for checking the consistency of equations involving physical units, by applying techniques similar to type inference in programming languages over a formal specification of the system to check. The checking is performed by a physical units inference system relying both on the algebraic structure of the international physical units system and a formal notation we designed to express the equations. The inference system is a three steps process: first, variables are assigned to the various expressions of the system; second, a set of equations representing the constraints of the international units system involving these variables is constructed. Finally, this set of equations is handled by a specific algorithm, which decides if the original system is consistent, and computes the physical units in a polymorphic way. We show that specializing the traditional type inference algorithms to the particular structure of the international units system boils down to solving classical linear systems symbolically.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Afnor. Grandeurs et Unites. Edition Afnor, 1985.
Delcroix V. Contenu et forme des diagrammes fonctionnels analogiques. Techn. Rep. EDF; 1992.
Dormoy JL, Ginoux B, Jimenez C, Laurent P, Lucas JY. The “Descartes” project, EDF; 1991–1996.
Doutre JL, Keriel Y, Daffos V. Bibliotheque de blocs fonctionnels elementaires, Techn. Rep. EDF; 1996.
Field A, Harrison P: Type inference and type checking. In: Functional Programming. Addison-Wesley, 1988, pp 143–165.
Lebbah Y, Dormoy JL, Mari B. Controle de coherence des dimensions dans un Diagramme Fonctionnel Analogique. Tech. Rep. EDF-HI-29/96/031, 1996.
Mairson H. Deciding ML typability is complete for deterministic exponential time. POPL, ACM Press, 1990;382–401.
Milner R. A theory of type polymorphism in programming. Journal of computer and System Sciences, 1978;17:348–375.
Paterson MS, Wegman MN. Linear unification. Journal of Computer and system science, 1978;16:158–167.
Schwartzback MI. Polymorphic Type Inference. BRICS Lecture Series LS-95-3, June 1995.
Wand M. A Simple algorithm and proof for type inference. Fundamentae Informaticae, 1987;10:115–122.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag London Limited
About this paper
Cite this paper
Lebbah, Y. (1997). Consistency Checking by Type Inference and Constraint Satisfaction. In: Daniel, P. (eds) Safe Comp 97. Springer, London. https://doi.org/10.1007/978-1-4471-0997-6_20
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0997-6_20
Publisher Name: Springer, London
Print ISBN: 978-3-540-76191-4
Online ISBN: 978-1-4471-0997-6
eBook Packages: Springer Book Archive