On the description of time varying systems in λ-calculus

  • Giorgio Ausiello
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 37)


The properties of λ-calculus and related formal systems as description languages of programs and machines have been studied by several authors. In this paper we examine how λ-calculus can be used to describe the behaviour of time varying systems; for this purpose a particular kind of typed calculus is introduced. The problem of synchronization is then considered and an application to rewriting and developmental systems is shown.


Time Parameter Developmental System Description Language Reduction Rule Automaton Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Böhm, C.; W. Gross, Introduction to the CUCH, in Automata theory, Caianiello Ed., Academic Press, 1966.Google Scholar
  2. [2]
    Böhm, C., The CUCH as a formal and description language, in Formal languages description languages for computer programming. North Holland, 1966.Google Scholar
  3. [3]
    Landin, P.J., A correspondence between ALGOL 60 and Church's lambda notation, Communications ACM, 8, 1965Google Scholar
  4. [4]
    Ausiello, G.; C. Böhm, Applicazione del linguaggio CUCH alla programmazione delle macchine analogiche sequenziali, Atti del IX Convegno della Automazione e Strumentazione, FAST, 1966.Google Scholar
  5. [5]
    Morris, J.H., Lambda calculus models of programming languages, Ph. D. Thesis, MIT, 1968.Google Scholar
  6. [6]
    Orgass, R.J.; F.B. Fitch, A theory of computing machines; A theory of programming languages, Studium Generale, 22, 1969.Google Scholar
  7. [7]
    Wegner, P., Programming languages, information structures and machine organization, Mc Graw-Hill, 1968.Google Scholar
  8. [8]
    Rescher, N.; A. Urquart, Temporal logic, Springer Verlag, 1971.Google Scholar
  9. [9]
    Burstall, R.M., Program proving as hand simulation with a little induction, Proceedings of IFIP 74, 1974.Google Scholar
  10. [10]
    Batini, C., Time structures with a root and a sink: a completeness proof, to be published in Pubblicazioni dell'Istituto di Automatica, Univ. di Roma, 1974.Google Scholar
  11. [11]
    Salomaa, A., Parallelism in rewriting systems, in Automata, Languages and Programming, Lecture Notes in Computer Science 14, Springer Verlag, 1974Google Scholar
  12. [12]
    Fitch, F., Representation of sequential circuits in combinatory logic, Phil. of Science, 25, 1958Google Scholar
  13. [13]
    Lindenmayer, A., Developmental systems without cellular interactions, their languages and grammars, J. Theoretical Biology, 30, 1971Google Scholar
  14. [14]
    Skyum, S., On extensions of ALGOL-like languages, DAIMI Publications, University of Aarhus, 1974Google Scholar
  15. [15]
    Open House in Unusual Automata Theory, DAIMI Publications, University of Aarhus, 1973Google Scholar
  16. [16]
    Salomaa, A., L-systems, Lecture Notes in Computer Science, Springer Verlag, 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Giorgio Ausiello
    • 1
  1. 1.Centro di Studio dei Sistemi di Controllo e Calcolo AutomaticiRomaItaly

Personalised recommendations