Preview
Unable to display preview. Download preview PDF.
Bibliographie
De BAKKER,J., de ROEVER, W., "A calculus for polyadic récursive schemas". Manuscrit non publié, (1972).
LE BERRE,F., L'ELGOUAC'H,J., manuscrit non publié, (1972).
LUCKHAM,D., GARLAND,S., UCLA Computer Science Department report (1971).
NIVAT,M., "Automata, Langages and Programming," North Holland p 293–307 (1973).
PATERSON,M., Hewitt,C., "Comparative Schematology" Project MAC, M.I.T., (1971).
SCOTT,D., "Symposium on Semantics of Algorithmic langages," Lectures notes in Mathematics No 188. p 311–372 (1971).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guessarian, I. (1974). Equivalences dans l'algèbre des schémas de programme. In: Robinet, B. (eds) Programming Symposium. Lecture Notes in Computer Science, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06859-7_135
Download citation
DOI: https://doi.org/10.1007/3-540-06859-7_135
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06859-4
Online ISBN: 978-3-540-37819-8
eBook Packages: Springer Book Archive