Chapter PDF
Keywords
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.
References
Barendregt H., 1981 The Lambda Calculus: its syntax and semantics, North Holland, (Amsterdam).
Barendregt H, Coppo M., Dezani M., 1981 A filter λ-model and the completeness of type assignment, Journal of Symbolic Logic, 64,4.
Coppo M., Dezani M., 1980a An extension of the basic Functionality Theory for the L-calculus, Notre Dame Journal of Formal Logic, 21,4.
Coppo M., Dezani M., Venneri B., 1980b Principal type scheme and λ-calculus semantics, in: J.P. Seldin,J.R. Hindley eds, To H.B.Curry.Essays on Combinatory Logic, λ-calculus and Formalism, Academic Press, London, 1980, pp 535–560.
Curry H.B., Feys R., 1958 Combinatory Logic, vol.1, North Holland (Amsterdam).
Hindley R., The principal type scheme as an object in combinatory logic, Trans. Amer. Math. Soc., 146.
Hindley R., The completeness theorem for typing λ-terms, Theoretical Computer Science, 22.
Milner R., A theory of type polimorphism in programming, J. Comput. System Sci.,17.
Milner R., Damas L., Principal type schemes for functional programs, 9-th Symp. on Principle of programming languages.
Robinson J.A., A machine oriented logic based on the resolution principle, Journal of ACM, 12.
Ronchi Della Rocca S., Venneri B., Principal type scheme for an extended type theory, Theoretical Computer Science, 28.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Della Rocca, S.R. (1987). An unification semi-algorithm for intersection type schemes. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds) TAPSOFT '87. CAAP 1987. Lecture Notes in Computer Science, vol 249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17660-8_46
Download citation
DOI: https://doi.org/10.1007/3-540-17660-8_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17660-2
Online ISBN: 978-3-540-47746-4
eBook Packages: Springer Book Archive