Skip to main content
SpringerLink
Log in

Application and Formal Specification of Sorted Term-Position Algebras

  • Conference paper
Recent Trends in Algebraic Development Techniques (WADT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3423))

Included in the following conference series:

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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Milner, R., Tofte, M., Harper, R.: The Definition of Standard ML. MIT Press, Cambridge (1990)

    Google Scholar 

  2. Guttag, J.V., Horning, J.J.: Larch: Languages and Tools for Formal Specification. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  3. 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)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bidoit, M., Mosses, P.D. (eds.): CASL User Manual. LNCS, vol. 2900. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  5. CoFI (The Common Framework Initiative); Mosses, P.D. (ed.): CASL Reference Manual. LNCS, vol. 2960. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  6. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  7. Poetzsch-Heffter, A.: Prototyping realistic programming languages based on formal specifications. Acta Informatica 34, 737–772 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bauer, B., Höllerer, R.: Übersetzung objektorientierter Programmiersprachen. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  9. Slonneger, K.: Executing continuation semantics: A comparison. Software – Practice and Experience 23, 1379–1397 (1993)

    Article  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. Mossakowski, T.: Introduction into HOL-Casl (Version 0.82). Technical report, University of Bremen (2002)

    Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. 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)

    Chapter  Google Scholar 

  14. 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)

    Chapter  Google Scholar 

  15. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Kaiserslautern,  

    Arnd Poetzsch-Heffter & Nicole Rauch

Authors
  1. Arnd Poetzsch-Heffter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicole Rauch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    José Luiz Fiadeiro

  2. Department of Computer Science, Swansea University, UK

    Peter D. Mosses

  3. Dpto de L.S.I., Universitat Politècnica de Catalunya, Campus Nord, Mòdul Omega, Jordi Girona 1-3, 08034, Barcelona, Spain

    Fernando Orejas

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation