Skip to main content
SpringerLink
Log in

Functional evaluation of strongly non circular typol specifications

  • Relationships With Other Formalisms II
  • Conference paper
  • First Online:
Book cover Attribute Grammars and their Applications

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 461))

  • 147 Accesses

Abstract

Typol is a language to implement Natural Semantics inside the Centaur Programming Environment. We explain why Natural Semantics can be considered as a generalization of the Attribute Grammars formalism. This relationship suggests introducing in the Typol setting some concepts from the Attribute Grammars framework. With these concepts, we can provide specialized evaluators to some classes of Typol programs, instead of the general Prolog machine currently used to execute such programs. More precisely, we prove that under acceptable conditions, the unification process is no longer required and can be replaced by a simple pattern-matching mechanism. This makes it possible to give a functional implementation of Typol programs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Attali I. “Compilation de programmes Typol par Attributs Sémantiques” Doctoral thesis, University of Nice, April 1989.

    Google Scholar 

  2. Attali I. & Franchi-Zannettacci P. “Unification-free Execution of Typol Programs by Semantic Attribute Evaluation”, Proceedings Fifth International Conference Symposium on Logic Programming, Seattle, August 1988, MIT Press.

    Google Scholar 

  3. Berry G. & Sethi R. “From regular expressions to deterministic automata” TCS 48, 1, 1986

    Google Scholar 

  4. Clément D., Despeyroux J., Despeyroux T. & Kahn G. “A simple applicative language: Mini-ML” Symp. on Functional Programming Languages and Computer Architecture, 1986

    Google Scholar 

  5. Courcelle B. & Franchi-Zannettacci P. “Attribute Grammars and recursive program schemes” (I and II) TCS 17 2 pp 163–191 and TCS 17 3 pp 235–257, 1982

    Google Scholar 

  6. Damas L. & Milner R. “Principal type-schemes for functional programs” Proceedings of the ACM Conference on Principles of Programming Languages, 1982, pp 207–212

    Google Scholar 

  7. Deransart P. & Maluszynski J. “Relating Logic Programs and Attribute Grammars” J. Logic Programming vol 2 n 2 pp 119–155, 1985

    Article  Google Scholar 

  8. Deransart P., Jourdan M., & Lorho B. “Attribute Grammars: Definitions, Systems and Bibliography” LNCS 323, Springer Verlag, 1988

    Google Scholar 

  9. Despeyroux T. “Executable Specification of semantics” Semantics of Data Types, LNCS 173, 1984

    Google Scholar 

  10. Despeyroux T. “Typol: a formalism to implement Natural Semantics” INRIA res. rep. 94, 1988

    Google Scholar 

  11. Engelfriet J. “Attribute Grammars: Attribute Evaluation Methods” in Methods and Tools for Compiler Construction, ed. B. Lorho, pp 103–138, Cambridge University Press, 1984

    Google Scholar 

  12. Gentzen G. “Investigation into Logical Deduction” Thesis 1935, reprinted in “The collected papers of Gerhard Gentzen” E. Szabo, North-Holland, Amsterdam, 1969

    Google Scholar 

  13. Hannan J. & Miller D. “A meta-logic for functional programming” in Abramson H. and Rogers M. editors, Meta-programming in Logic Programming, Chapter 24, pp 453–476, MIT Press, 1989

    Google Scholar 

  14. Isakowitz T. “Relating Logic Programs and Attribute Grammars” Research Report, Univ. Pennsylvania, 1988

    Google Scholar 

  15. Jourdan M. “Strongly Non-Circular Attribute Grammars and their recursive evaluation” ACM Sigplan Symp. on Compiler Construction, Montreal Sigplan Notices 19, 6, 1984

    Google Scholar 

  16. Kahn G. “Natural Semantics” Proc. of Symp on Theoretical Aspects of Computer Science, Passau, Germany, LNCS 247, 1987

    Google Scholar 

  17. Kennedy K. & Warren S. K. “Automatic generation of efficient evaluators for Attribute Grammars” Proc. of the 3rd ACM Conf on Principle of Programming Languages, Atlanta, 1976

    Google Scholar 

  18. Knuth D. E. “Semantics of Context-Free Languages” Math. Syst. Theory 2, 1968

    Google Scholar 

  19. Komorowski H. J. & Maluszynski J. “Unification-free execution of logic programs” 1985 IEEE Symp. on Logic Programming, Boston, 1985, pp 78–86

    Google Scholar 

  20. Plotkin G. D. “A structural approach to operational semantics” Report DAIMI FN-19, Computer Science Dpt, Aarhus Univ., Aarhus, Denmark, 1981

    Google Scholar 

  21. Warren D. H. D. “Logic Programming and Compiler Writing” Software Practice and Experience, 10, 1980, pp 97–125

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA - Sophia-Antipolis Route des Lucioles, 06565, Valbonne Cedex, France

    Isabelle Attali

  2. CNRS I3S & Math. Dpt, University of Nice, 06034, Nice Cedex, France

    Jacques Chazarain

Authors
  1. Isabelle Attali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Chazarain
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Deransart M. Jourdan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Attali, I., Chazarain, J. (1990). Functional evaluation of strongly non circular typol specifications. In: Deransart, P., Jourdan, M. (eds) Attribute Grammars and their Applications. Lecture Notes in Computer Science, vol 461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53101-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-53101-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53101-2

  • Online ISBN: 978-3-540-46666-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation