Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Artificial Intelligence pp 221–276Cite as

Term Rewriting as a Basis for the Design of a Functional and Parallel Programming Language

A case study: the Language FP2

  • Chapter

Part of the book series: Springer Study Edition ((SSE))

Abstract

The semantic elegance and the mathematical properties of applicative and functional programming languages are now widely recognized as relevant and useful qualities for implementing the large and complex algorithms of the kind encountered in artificial intelligence.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • ARKAXHIU, E. “Un environnement et un langage graphique pour la spécification de processus parallèles communicants.” Thèse, LIFIA, Grenoble, 1984.

    Google Scholar 

  • AUSTRY, D. “Aspects syntaxiques de MEIJE, un calcul pour le parallélisme. Applications.” Thèse, LITP, Paris, 1984.

    Google Scholar 

  • AUSTRY, D. and BOUDOL, G. “Algèbre de processus et synchronisation.” Theoretical Computer Science, 1984.

    Google Scholar 

  • BACKUS, J. W. “Can Programming Be Liberated From The Von Neumann Style ? A functional style and its algebra of programs.” Communications of the ACM. Vol. 21, no. 8, 1978.

    Google Scholar 

  • BACKUS, J. W. “The algebra of functional programs: function level reasoning, linear equations and extended definitions.” Lecture Notes in Computer Science no. 107, 1981.

    Google Scholar 

  • BACKUS, J. W. “Function Level Programs as Mathematical Objects.” Conference on Functional Programming Languages & Computer Architecture, ACM, 1981.

    Google Scholar 

  • BERT, D. “Specification algébrique et axiomatique des exceptions.” RR IMAG 183, LIFIA, Grenoble, 1980.

    Google Scholar 

  • BERT, D. “Refinements of Generic Specifications with Algebraic Tools.” IFIP Congress, North Holland, 1983.

    Google Scholar 

  • BERT, D. “Generic Programming: a tool for designing universal operators.” RR IMAG 336, LIFIA, Grenoble, 1982.

    Google Scholar 

  • BERT, D. “Manuel de référence de LPG, Version 1.2.” RR IMAG 408, LIFIA, Grenoble, 1983.

    Google Scholar 

  • BERT, D. and BENSALEM, S. “Algèbre des opérateurs génériques et transformation de programmes en LPG.” RR IMAG 488 (LIFIA 14), Grenoble, 1984.

    Google Scholar 

  • BERT, D. and JACQUET, P. “Some validation problems with parameterized types and generic functions.” 3rd International Symposium on Programming, Dunod, Paris, 1978.

    Google Scholar 

  • BIDOIT, M. “Une méthode de presentation des types abstraits: applications.” Thèse, LRI, Orsay, 1981.

    Google Scholar 

  • BJØRNER, D. and JONES, C. B. “The Vienna Development Method: The Meta-Language.” Lecture Notes in Computer Science no. 61, 1978.

    Book  MATH  Google Scholar 

  • BJØRNER, D. and JONES, C. B. “Formal specification & software development.” Prentice Hall International, Englewood Cliffs, New Jersey 1982.

    MATH  Google Scholar 

  • BOUDOL, G. “Computational semantics of terms rewriting systems.” RR 192, INRIA, 1983.

    Google Scholar 

  • BROOKES, S. D. “A model for communicating sequential processes.” Thesis, Carnegie-Mellon University, 1983.

    Google Scholar 

  • BURSTALL, R. M., MACQUEEN, D.B. and Sannella, D.T. “HOPE: an experimental applicative language.” CSR-62–80, University of Edinburgh, 1981.

    Google Scholar 

  • CISNEROS, M. “Programmation parallèle et programmation fonctionnelle: propositions pour un langage.” Thèse, LIFIA, Grenoble, 1984.

    Google Scholar 

  • DERSHOWITZ, N. “Computing with rewrite systems.” ATR-83 (8478)-l, Aerospace Corporation, 1983.

    Google Scholar 

  • GOGUEN, J. A., THATCHER, J. W. and WAGNER, E. G. “An initial algebra approach to the specification, correctness, and implementation of abstract data types.” Current Trends in Programming Methodology, Vol. 4, Prentice Hall, Englewood Cliffs, New Jersey, 1978.

    Google Scholar 

  • GUERREIRO, P. J. V. D. “Sémantique relationnelle des programmes non-déterministes et des processus communicants.” Thèse, IMAG, Grenoble, juillet 1981.

    Google Scholar 

  • GUTTAG, J. V. and HORNING, J. J. “The algebraic specification of abstract data types.” Acta Informatica, 1978.

    Google Scholar 

  • HOARE, C. A. R. “Communicating sequential processes.” Communications of the ACM, Vol. 21, no. 8, 1978.

    Google Scholar 

  • HOARE, C. A. R. “Notes on communicating processes.” PRG-33, Oxford University, 1983.

    Google Scholar 

  • HUFFLEN, J. M. “Notes sur FP et son implantation en LPG.” RR IMAG 518 (LIFIA 20), Grenoble, 1985.

    Google Scholar 

  • JORRAND, PH. “Specification of communicating processes and process implementation correctness.” Lecture Notes in Computer Science no. 137, 1982.

    Google Scholar 

  • JORRAND, PH. “FP2: “Functional Parallel Programming based on term substitution.” RR IMAG 482 (LIFIA 15), Grenoble, 1984.

    Google Scholar 

  • MAY, D. “OCCAM.” SIGPLAN Notices, Vol. 13, no. 4, 1983.

    Google Scholar 

  • MILNER, R. “A calculus of communicating systems.” Lecture Notes in Computer Science, no. 92, 1980.

    Book  MATH  Google Scholar 

  • PEREIRA, J. M. “Processus communicants: un langage formel et ses modèles. Problèmes d’analyse.” Thèse, LIFIA, Grenoble, 1984.

    Google Scholar 

  • SOLER, R. “Une approche de la théorie de D. Scott et application à la sémantique des types abstraits algébriques.” Thèse, LIFIA, Grenoble, septembre 1982.

    Google Scholar 

  • TURNER, D. A. “The semantic elegance of applicative languages.” Conference on Functional Programming Languages & Computer Architecture, ACM, 1981.

    Google Scholar 

  • WILLIAMS J. H. “On the development of the algebra of functional programs.” ACM Transactions on Programming Languages and Systems, Vol. 4, no. 4, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFIA, Institut National Polytechnique de Grenoble, France

    Philippe Jorrand

Authors
  1. Philippe Jorrand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, Postfach 202420, D-8000, München 2, Germany

    W. Bibel

  2. LIFIA-IMAG, BP 68, F-38402, St. Martin d’Hères Cédex, France

    Ph. Jorrand

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jorrand, P. (1987). Term Rewriting as a Basis for the Design of a Functional and Parallel Programming Language. In: Bibel, W., Jorrand, P. (eds) Fundamentals of Artificial Intelligence. Springer Study Edition. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-40145-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-40145-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-39157-0

  • Online ISBN: 978-3-662-40145-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation