Categorical completeness results for the simply-typed lambda-calculus

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

Volumn 902, Issue , 1995, Pages 414-427

  Simpson, Alex K ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); PATHOLOGY;

CARTESIAN CLOSED CATEGORY; SIMPLY TYPED LAMBDA CALCULUS;

CALCULATIONS;

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

References (17)

1. Y. Akama. On Mints' reduction for ccc-calculus. In M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, Proceedings of TLCA '93. LNCS 664, Springer Verlag, 1993.
2. H. P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North Holland, Amsterdam, 1984. Second edition.
3. U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed A-calculus. In Proceedings of 6th Annual Symposium on Logic in Computer Science, pages 203-211, 1991.
4. D. Ćubrić. Embedding of a free cartesian closed category into the category of sets. Journal of Pure and Applied Algebra, to appear, 1995.
5. H. Friedman. Equality between functionals. In R. Parikh, editor, Logic Colloquium, Springer-.Verlag, New York, 1975.
6. N. Ghani. βη-equality for coproducts. This volume, 1995.
7. C. B. Jay and N. Ghani. The virtues of eta-expansion. Journal of Functional Programming, to appear, 1995.
8. J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Number 7 in Cambridge studies in advanced mathematics. Cambridge University Press, 1986.
9. E. Moggi. The Partial Lambda-Calculus. Ph.D. thesis, Department of Computer Science, University of Edinburgh, 1988. Available as LFCS report no. ECS-LFCS-88-63.
10. G. D. Plotkin. Lambda-definability and logical relations. Technical Report SAI-RM-4, School of Artificial Intelligence, University of Edinburgh, 1973.
11. G. D. Plotkin. Lambda-definability in the full type hierarchy. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, New York, 1980.
12. J. G. Riecke. Statman's 1-Section Theorem. Information and Computation, to appear, 1995.
13. S. Soloviev. The category of finite sets and CCCs. Journal of Soviet Mathematics, 22:1387-1400, 1983.
14. R. Statman. On the existence of closed terms in the typed A-calculus I. In J. P. Seldin and J. R. Hindley, editors, To H. B. Gurry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, New York, 1980.
15. R. Statman. Completeness, invariance and A-definability. Journal of Symbolic Logic, 47:17-26, 1982.
16. R. Statman. A-definable functionals and fin conversion. Archiv fur Math. Logik und Grund., 23:21-26, 1983.
17. R. Statman. Equality between functionals revisited. In L. A. Harrington et al, editors, Harvey Friedman's Research on the Foundations of Mathematics. Elsevier Science Publishers, 1985.