Abstract
Many concrete notions of function application, suitable for interpreting typed lambda calculi with recursive types, have been introduced in the literature. These arise in different fields such as set theory, multiset theory, type theory and functor theory and are apparently unrelated. In this paper we introduce the general concept of applicative exponential structure and show that it subsumes all these notions. Our approach is based on a generalization of the notion of intersection type. We construe all these structures in a finitary way, so as to be able to utilize uniformly a general form of type assignment system for defining the interpretation function. Applicative exponential structures are just combinatory algebras, in general. Our approach suggests a wide variety of entirely new concrete notions of function application: e.g. in connection with boolean sets. Applicative exponential structures can be used for modeling various forms of non-deterministic operators.
Preview
Unable to display preview. Download preview PDF.
References
S.Abramsky: Domain Theory in Logical Form. Annals of Pure and Applied Logic, (1991)
H.Barendregt: Lambda Calculus: its Syntax and Semantics revised version. Studies in Logic. Amsterdam: North Holland 1984
H.Barendregt, M.Coppo, M.Dezani, Ciancaglini: A Filter Lambda Model and the Completeness of Type Assignment, Journal to Symbolic Logic, 48, 4 (1983)
M.Coppo, M.Dezani Ciancaglini, F.Honsell, G.Longo: Extended Type Structures and Filter Lambda Models. In: G.Longo et al. (eds.): Logic Colloquium'82. Amsterdam: North Holland 1983
M.Coppo, M.Dezani Ciancaglini, B.Venneri: Principal Type Schemes and Lambda Calculus Semantics. In: J.Seldin et al. (eds): To H.B.Curry: Essays. Academic Press 1980
P.Di Gianantonio, F.Honsell: A General Type Assignment System for an Abstract Notion of Domain. Talks given at the 4th and 6th Meetings of the Jumelage Typed Lambda Calculus. Edinburgh, October 1989 and Paris, January 1991
E.Engeler: Algebras and Combinators. Berichte des Instituts f. Informatik 32, ETH, Zurich 1979
J.Y.Girard: Normal Functors Power Series and Lambda Calculus. Annals of Pure and Applied Logic, 37, 2 (1988)
R.Hindley, G.Longo: Lambda Calculus Models and Extensionalily. Zeit. f. Math. Logik u. Grund. d. Math., 26 (1980)
F.Honsell, S.Ronchi della Rocca: Reasoning about interpretations in qualitative Lambda Models. In: M.Broy et al. (eds.) Programming Concepts and Methods. 1990
F.Lamarche: Quantitative Domains and Infinitary Algebras. Unpublished manuscript, 1990
Ch.-E.Ore: Introducing Girard's quantitative domains. PhD Thesis, Research Report 113. University of Oslo 1988
G.Plotkin: A set-theoretical definition of application. Memorandum MIP-R-95, School of Artificial Intelligence, University of Edinburgh, 1972
G.Plotkin: Domains for Denotational Semantics, course notes, Stanford 1985
D.Scott: Some philosophical issues concerning theories of combinators, lambda calculus and computer science theory. In LNCS 37, Springer Verlag, 1975
D.Scott: Data Types as Lattices. SIAM Journal of computing, 5 (1976)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gianantonio, P., Honsell, F. (1993). An abstract notion of application. In: Bezem, M., Groote, J.F. (eds) Typed Lambda Calculi and Applications. TLCA 1993. Lecture Notes in Computer Science, vol 664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037102
Download citation
DOI: https://doi.org/10.1007/BFb0037102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56517-8
Online ISBN: 978-3-540-47586-6
eBook Packages: Springer Book Archive