Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Böhm, C.; W. Gross, Introduction to the CUCH, in Automata theory, Caianiello Ed., Academic Press, 1966.
Böhm, C., The CUCH as a formal and description language, in Formal languages description languages for computer programming. North Holland, 1966.
Landin, P.J., A correspondence between ALGOL 60 and Church's lambda notation, Communications ACM, 8, 1965
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.
Morris, J.H., Lambda calculus models of programming languages, Ph. D. Thesis, MIT, 1968.
Orgass, R.J.; F.B. Fitch, A theory of computing machines; A theory of programming languages, Studium Generale, 22, 1969.
Wegner, P., Programming languages, information structures and machine organization, Mc Graw-Hill, 1968.
Rescher, N.; A. Urquart, Temporal logic, Springer Verlag, 1971.
Burstall, R.M., Program proving as hand simulation with a little induction, Proceedings of IFIP 74, 1974.
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.
Salomaa, A., Parallelism in rewriting systems, in Automata, Languages and Programming, Lecture Notes in Computer Science 14, Springer Verlag, 1974
Fitch, F., Representation of sequential circuits in combinatory logic, Phil. of Science, 25, 1958
Lindenmayer, A., Developmental systems without cellular interactions, their languages and grammars, J. Theoretical Biology, 30, 1971
Skyum, S., On extensions of ALGOL-like languages, DAIMI Publications, University of Aarhus, 1974
Open House in Unusual Automata Theory, DAIMI Publications, University of Aarhus, 1973
Salomaa, A., L-systems, Lecture Notes in Computer Science, Springer Verlag, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ausiello, G. (1975). On the description of time varying systems in λ-calculus. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029525
Download citation
DOI: https://doi.org/10.1007/BFb0029525
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07416-8
Online ISBN: 978-3-540-37944-7
eBook Packages: Springer Book Archive