An abstract notion of application

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 664 LNCS, Issue , 1993, Pages 124-138

  Di Gianantonio, Pietro ^a   Honsell, Furio ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; BOOLEAN FUNCTIONS; PATHOLOGY;

ABSTRACT NOTIONS; COMBINATORY ALGEBRAS; INTERSECTION TYPES; NONDETERMINISTIC OPERATORS; RECURSIVE TYPES; TYPE THEORY;

CONCRETES;

EID: 84974766843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0037102     Document Type: Conference Paper

References (16)

1. S.Abramsky: Domain Theory in Logical Form. Annals of Pure and Applied Logic, (1991)
2. H.Barendregt: Lambda Calculus: its Syntax and Semantics lrevised version. Studies in Logic. Amsterdam: North Holland 1984
3. H.Barendregt, M.Coppo, M.Dezani Ciancaglini: A Filter Lambda Model and the Completeness of Type Assignment. Journal fo Symbolic Logic, 48, 4 (1983)
4. 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
5. M.Coppo, M.Dezani Ciancaglini, B.Venneri: Principal Type Schemes and Lambda Calculus Semantics. 111: J.Seldin et al. (eds): To H.B.Cun’y: Essays. Academic Press 1980
6. 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 Pails, January 1991
7. E.Engeler: Algebras and Combinators. Berichte des Instituts f: lnformatik 32, ETH, Zurich 1979
8. J.Y.Girard: Normal Functors Power Series and Lambda Calculus. Annals of Pure and Applied Logic, 37, 2 (1988)
9. R.Hindley, G.Longo: La,nbda Calculus Models and Extensionality. Zeit. f. Math. Logik u. Grund. d. Math., 26 (1980)
10. F.Honsell, S.Ronchi della Rocca: Reasoning about interpretations in qualitative Lambda Models. In: M.Broy et al. (eds.) Programming Concepts and Methods. 1990
11. F.Lamarche: Quantitative Domains and Infinitary Algebras. Unpublished manuscript, 1990
12. Ch.-E.Ore: Introducing Girard’s quantitative domains. PhD Thesis, Research Report 113. University of Oslo 1988
13. G.Plotkin: A set-theoretical definition of applicatio,a. Memorandum MIP-R-95, School of Artificial Intelligence, University of Edinburgh, 1972
14. G.Plotkin: Domains lbr Denotational Semantics, course notes, Stanford 1985
15. D.Scott: Some philosophical issues concerning theories of combinators, lambda calculus and computer science theory. In LNCS 37, Springer Verlag, 1975
16. D.Scott: Data Types as Lattices. SIAM Journal of computing, 5 (1976)