On the description of time varying systems in lambda - calculus

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.

[1]  Sven Skyum.  On Extentions of Algol-like Languages , 1974 .

[2]  P. Wegner.  Programming Languages, Information Structures, and Machine Organization. , 1968 .

[3]  A. Lindenmayer.  Developmental systems without cellular interactions, their languages and grammars. , 1971, Journal of theoretical biology.

[4]  Arto Salomaa,et al.  Parallelism in Rewriting Systems , 1974, ICALP.

[5]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

[6]  T. B. Steel,et al.  Introduction to the CUCH , 1975 .

[7]  F. B. Fitch.  Representation of Sequential Circuits in Combinatory Logic , 1958, Philosophy of Science.

[8]  P. J. Landin,et al.  Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.

[9]  Rod M. Burstall,et al.  Program Proving as Hand Simulation with a Little Induction , 1974, IFIP Congress.

[10]  R J Orgass,et al.  A theory of programming languages. , 1969, Studium generale; Zeitschrift fur die Einheit der Wissenschaften im Zusammenhang ihrer Begriffsbildungen und Forschungsmethoden.

[11]  James H. Morris,et al.  Lambda-calculus models of programming languages. , 1969 .

[12]  Sven Skyum.  On Extensions of ALGOL-Like Languages , 1974, Inf. Control..