Abstract
Sorted term-position algebras are an extension of term algebras. In addition to sorted terms with constructor and selector functions, they provide term positions as algebra elements and functions that relate term positions. This paper describes possible applications of term-position algebras and investigates their formal specification in existing specification frameworks. In particular, it presents an algebraic specification of term-positions in Casl and in a higher-order logic.
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
Milner, R., Tofte, M., Harper, R.: The Definition of Standard ML. MIT Press, Cambridge (1990)
Guttag, J.V., Horning, J.J.: Larch: Languages and Tools for Formal Specification. Springer, Heidelberg (1993)
Astesiano, E., Bidoit, M., Kirchner, H., Krieg-Brückner, B., Mosses, P.D., Sannella, D., Tarlecki, A.: Casl: The Common Algebraic Specification Language. Theoretical Computer Science 286, 153–196 (2002)
Bidoit, M., Mosses, P.D. (eds.): CASL User Manual. LNCS, vol. 2900. Springer, Heidelberg (2004)
CoFI (The Common Framework Initiative); Mosses, P.D. (ed.): CASL Reference Manual. LNCS, vol. 2960. Springer, Heidelberg (2004)
Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
Poetzsch-Heffter, A.: Prototyping realistic programming languages based on formal specifications. Acta Informatica 34, 737–772 (1997)
Bauer, B., Höllerer, R.: Übersetzung objektorientierter Programmiersprachen. Springer, Heidelberg (1998)
Slonneger, K.: Executing continuation semantics: A comparison. Software – Practice and Experience 23, 1379–1397 (1993)
Roggenbach, M., Schröder, L.: Towards trustworthy specifications I: Consistency checks. In: Cerioli, M., Reggio, G. (eds.) WADT 2001 and CoFI WG Meeting 2001. LNCS, vol. 2267, p. 305. Springer, Heidelberg (2002)
Mossakowski, T.: Introduction into HOL-Casl (Version 0.82). Technical report, University of Bremen (2002)
Börger, E., Schulte, W.: Programmer Friendly Modular Definition of the Semantics of Java. In: Alves-Foss, J. (ed.) Formal Syntax and Semantics of Java. LNCS, vol. 1523, Springer, Heidelberg (1999)
Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Wise, D.S. (ed.) SIGPLAN 1988 Conference on Progamming Language Design and Implementation. SIGPLAN Notices, vol. 23(7), pp. 199–208. ACM Press, New York (1988)
Klarlund, N.: Mona & Fido: The logic-automaton connection in practice. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 311–326. Springer, Heidelberg (1998)
Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 16–31. ACM Press, New York (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poetzsch-Heffter, A., Rauch, N. (2005). Application and Formal Specification of Sorted Term-Position Algebras. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds) Recent Trends in Algebraic Development Techniques. WADT 2004. Lecture Notes in Computer Science, vol 3423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31959-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-31959-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25327-3
Online ISBN: 978-3-540-31959-7
eBook Packages: Computer ScienceComputer Science (R0)