Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-8448b6f56d-dnltx Total loading time: 0 Render date: 2024-04-24T15:28:46.512Z Has data issue: false hasContentIssue false

7 - Program semantics and infinite regular terms

Published online by Cambridge University Press:  06 August 2010

By
Bruno Courcelle
Edited by
Yves Bertot ,
Gérard Huet ,
Jean-Jacques Lévy  and
Gordon Plotkin
Bruno Courcelle
Affiliation:
Institut Universitaire de France Université Bordeaux 1, Laboratoire Bordelais de Recherche en Informatique
Yves Bertot
Affiliation:
INRIA-Sophia Antipolis, France
Gérard Huet
Affiliation:
Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
Jean-Jacques Lévy
Affiliation:
Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
Gordon Plotkin
Affiliation:
University of Edinburgh
Get access

Summary

Abstract

The communication by Gilles Kahn, Jean Vuillemin and myself at the second International Colloquium on Automata, Languages and Programming, held in Saarbrücken in 1974 is in French in the proceedings, and has not been published as a journal article. However, Todd Veldhuizen wrote in 2002 an English translation that is reproduced in the next chapter.

À propos Chapter 8

It was quite a surprise for me to receive a message from Todd Veldhuizen saying that he had translated from French a 30-year-old conference paper presented at the second International Colloquium on Automata, Languages and Programming, held in Saarbrücken in 1974, of which I am coauthor with G. Kahn and J. Vuillemin. He did that work because he felt the paper was “seminal”. First of all I would like to thank him for this work. The publication of his translation in a volume dedicated to the memory of Gilles Kahn is a testimony of the gratitude of Jean Vuillemin and myself to him, and the recognition of an important scientific contribution of Gilles among many others.

In this overview, I indicate a few research directions that can be traced back to that communication. I give only a few related references, this overview is not a thorough bibliographical review of related articles.

Type
Chapter
Information
From Semantics to Computer Science
Essays in Honour of Gilles Kahn
 , pp. 165 - 168
Publisher: Cambridge University Press
Print publication year: 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]F., Cardone and M., Coppo, Decidability properties of recursive types. ICTCS 2003, Bertinoro, Italy, Lecture Notes in Computer Science 2841, pp. 242–255, Springer-Verlag, 2003.Google Scholar
[2]D., Caucal, On infinite terms having a decidable monadic theory. MFCS 2002, Lecture Notes in Computer Science 2420, pp. 165–176, Springer-Verlag, 2002.Google Scholar
[3]A., Colmerauer, Prolog and infinite trees, logic programming, In: W., Clark and S., Tarnlund (eds.), pp. 153–172. Academic Press, 1982.
[4]B., Courcelle, Fundamental properties of infinite trees, Theoretical Computer Science, 25:95–169, 1983.Google Scholar
[5]B., Courcelle, Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars. Theoretical Computer Science, 42:1–122, 1986.Google Scholar
[6]B., Courcelle, Recursive applicative program schemes. In: J., Van Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume B, pp. 459–492. Elsevier, 1990.Google Scholar
[7]B., Courcelle and T., Knapik, The evaluation of first-order substitution is monadic second-order compatible. Theoretical Computer Science, 281:177–206, 2002.Google Scholar
[8]B., Courcelle and J., Vuillemin, Completeness results for the equivalence of recursive schemas. Journal of Computing Systems Science, 12:179–197, 1976.Google Scholar
[9]I., Guessarian, Algebraic Semantics, Lecture Notes in Computer Science 99, Springer Verlag, 1981.Google Scholar
[10]C., Gunter and D., Scott, Semantic domains. In: J., Van Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume B, pp. 633–674. Elsevier, 1990.Google Scholar
[11]G., Huet, Résolution d'équations dans des langages d'ordre 1, 2, …, ω. Doctoral dissertation, Université Paris 7, 1976.Google Scholar
[12]P., Mosses, Denotational semantics. In: J., Van Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume B, pp. 575–632. Elsevier, 1990.Google Scholar
[13]M., Rabin, Decidability of second-order theories and automata on infinite trees, Transactions of the American Mathematical Society, 141:1–35, 1969.Google Scholar
[14]G., Sénizergues, Complete formal systems for equivalence problems, Theoretical Computer Science, 231:309–334, 1999.Google Scholar
[15]G., Sénizergues, L(A) = L(B)?, Theoretical Computer Science, 251:1–166, 2001.Google Scholar
[16]I., Walukiewicz, Completeness of Kozen's axiomatization of propositional µ-calculus, Information and Computation, 157:142–182, 2000.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Program semantics and infinite regular terms
    • By Bruno Courcelle, Institut Universitaire de France Université Bordeaux 1, Laboratoire Bordelais de Recherche en Informatique
  • Edited by Yves Bertot, Gérard Huet, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, Jean-Jacques Lévy, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, Gordon Plotkin, University of Edinburgh
  • Book: From Semantics to Computer Science
  • Online publication: 06 August 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511770524.008
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Program semantics and infinite regular terms
    • By Bruno Courcelle, Institut Universitaire de France Université Bordeaux 1, Laboratoire Bordelais de Recherche en Informatique
  • Edited by Yves Bertot, Gérard Huet, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, Jean-Jacques Lévy, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, Gordon Plotkin, University of Edinburgh
  • Book: From Semantics to Computer Science
  • Online publication: 06 August 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511770524.008
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Program semantics and infinite regular terms
    • By Bruno Courcelle, Institut Universitaire de France Université Bordeaux 1, Laboratoire Bordelais de Recherche en Informatique
  • Edited by Yves Bertot, Gérard Huet, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, Jean-Jacques Lévy, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, Gordon Plotkin, University of Edinburgh
  • Book: From Semantics to Computer Science
  • Online publication: 06 August 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511770524.008
Available formats
×