Lambda-calculus and combinators, an introduction

Lambda-Calculus and Combinators, an Introduction

Volumn 9780521898850, Issue , 2008, Pages 1-345

  Hindley, J Roger ^a   Seldin, Jonathan P ^b  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF LETHBRIDGE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); SEMANTICS;

COMBINATORS; INTRODUCTORY COURSE; LAMBDA CALCULUS; SEMANTICS OF PROGRAMMING LANGUAGES; TYPE THEORY;

CALCULATIONS;

EID: 84924438284     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511809835     Document Type: Book

References (197)

1. F. Alessi, F. Barbanera and M. Dezani. Intersection types and lambda models. Theoretical Computer Science, 355:108-126, 2006.
2. P. Aczel. Non-Well-Founded Sets. CSLI (Centre for the Study of Language and Information), Ventura Hall, Stanford University, Stanford, CA 94305-4115, USA, 1988.
3. F. Alessi, M. Dezani and F. Honsell. Inverse limit models as filter models. In D. Kesner, F. van Raamsdonk and J. Wells, editors, HOR’04, Proceedings of Workshop on Higher Order Rewriting, 2004, pages 3-25, Aachen, Germany, 2004. Technische Hochschule Aachen. AIB2004-03, ISSN 0935-3232.
4. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. Gab- bay and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, Oxford, England, 1994. Also available online.
5. A. Asperti and G. Longo. Categories, Types and Structures. An Introduction to Category Theory for the Working Computer Scientist. M.I.T. Press, Cambridge, Mass., USA, 1991.
6. T. Altenkirch. A formalization of the strong normalization proof for System F in LEGO. In M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science, pages 13-28. Springer-Verlag, Berlin, 1993.
7. P. B. Andrews. A Transfinite Type Theory with Type Variables. NorthHolland Co., Amsterdam, 1965.
8. P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: to Truth Through Proof. Kluwer, Dordrecht, Netherlands, 2002. 2nd edn. (1st was 1986, Academic Press, USA).
9. J. Backus. Can programming be liberated from the von Neumann style? Communications of the ACM, 21(8):613-641, 1978.
10. H. P. Barendregt. Combinatory logic and the axiom of choice. Indaga, tiones Mathematicae 35: 203-221, 1973. Journal also appears as Proc. Nederl. Akad. van Wetenschappen.
11. H. P. Barendregt. Pairing without conventional restraints. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 20:289-306, 1974. Journal now called Mathematical Logic Quarterly.
12. H. P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland Co., Amsterdam, 1984. 2nd (revised) edn., reprinted 1997 (1st edn. was 1981).
13. H. P. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gab- bay and T. Maibaum, editors, Handbook of Logic in Computer Science, Volume 2, Background: Computational Structures, pages 117-309. Clarendon Press, Oxford, England, 1992.
14. J. Baeten and B. Boerboom. Q can be anything it shouldn’t be. Indagationes Mathematicae, 41:111-120, 1979. Journal also appears as Proc. Nederl. Akad. van Wetenschappen.
15. H. P. Barendregt, M. Coppo and M. Dezani. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48:931-940, 1983.
16. C. Böhm, M. Dezani, P. Peretti, and S. Ronchi. A discrimination algorithm inside A/3-calculus. Theoretical Computer Science, 8:271-291, 1979.
17. H. P. Barendregt, W. Dekkers, and R. Statman. Typed Lambda Calculus, Volume 1. In preparation.
18. S. Berardi. Encoding of data types in pure construction calculus: a semantic justification. In H. Huet and G. Plotkin, editors, Logical Environments, pages 30-60. Cambridge University Press, 1993.
19. C. Berline. From computation to foundations via functions and application: the λ-calculus and its webbed models. Theoretical Computer Science, 249:81-161, 2000.
20. C. Berline. Graph models of λ-calculus at work, and variations. At website, 2005. Web address hal.ccsd.cnrs.fr/ccsd-00004473/en/.
21. I. Bethke. Annotated Bibliography of Lambda Calculi, Combinatory Logics and Type Theory. At website, 1999. File type ‘.ps’. Web address www. science. uva.nl/~ inge/Bib/
22. C. Böhm and W. Gross. Introduction to the CUCH. In E. Caianiello, editor, Automata Theory, pages 35-65. Academic Press, New York, 1966.
23. M. W. Bunder, J. R. Hindley and J. P. Seldin. On adding (ξ) to weak equality in combinatory logic. Journal of Symbolic Logic, 54:590-607, 1989.
24. H. P. Barendregt and K. Koymans. Comparing some classes of lambda calculus models. In Hindley and Seldin [HS80], pages 287-301.
25. H. P. Barendregt and G. Longo. Equality of A-terms in the model T. In Hindley and Seldin [HS80], pages 303-337.
26. K. Bruce and G. Longo. A note on combinatory algebras and their expansions. Theoretical Computer Science, 31:31-40, 1984.
27. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, England, 1998.
28. C. Böhm. Alcune proprietà delle forme β-η-normali nel A-K-calcolo. Pubblicazione no. 696, Istituto per le Applicazioni del Calcolo, C.N.R., Roma, 1968.
29. N. G. de Bruijn. The mathematical language AUTOMATH. In M. Laudet, D. Lacombe, L. Nolin and M. Schützenberger, editors, Symposium on Automatic Demonstration, IRIA Versailles 1968, volume 125 of Lecture Notes in Mathematics, pages 29-61. Springer-Verlag, Berlin, 1970.
30. N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indagationes Mathematicae, 34:381-392, 1972.
31. M. W. Bunder. Combinators, proofs and implicational logics. In D. M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 6, pages 229-286. Springer (Kluwer), Berlin, 2002.
32. R. Byerly. An invariance notion in recursion theory. Journal of Symbolic Logic, 47:48-66, 1982.
33. R. Byerly. Recursion theory and the lambda calculus. Journal of Symbolic Logic, 47:67-83, 1982.
34. L. Cardelli. A polymorphic λ-calculus with Type: Type. Technical report, Systems Research Center of Digital Equipment Corporation, Palo Alto, California, May 1986.
35. F. Cardone and M. Coppo. Two extensions of Curry’s type inference system. In P. Odifreddi, editor, Logic and Computer Science, volume 31 of APIC Studies in Data Processing, pages 19-76. Academic Press, USA, 1990.
36. F. Cardone and M. Coppo. Type inference with recursive types: syntax and semantics. Information and Computation, 92(1):48-80, 1991.
37. M. Coppo and M. Dezani. A new type assignment for A-terms. Archiv fur Mathematische Logik, 19:139-156, 1978. Journal now called Archive for Mathematical Logic.
38. M. Coppo, M. Dezani, F. Honsell and G. Longo. Extended type structures and filter lambda models. In G. Lolli, G. Longo and A. Mar- cja, editors, Logic Colloquium’82, pages 241-262. North-Holland Co., Amsterdam, 1984.
39. M. Coppo, M. Dezani and P. Salle. Functional characterization of some semantic equalities inside A-calculus. In H. Maurer, editor, Automata, Languages and Programming, Sixth Colloquium, volume 71 of Lecture Notes in Computer Science, pages 133-146. Springer-Verlag, Berlin, 1979.
40. M. Coppo, M. Dezani, and B. Venneri. Functional characters of solvable terms. Zeitschrift fur Mathematische Logik, 27:45-58, 1981. Journal now called Mathematical Logic Quarterly.
41. M. Coppo, M. Dezani, and M. Zacchi. Type theories, normal forms and D^-lambda models. Information and Computation, 72:85-116, 1987.
42. H. B. Curry and R. Feys. Combinatory Logic, Volume I. North-Holland Co., Amsterdam, 1958. 1st. edn. (3rd edn. 1974).
43. T. Coquand and G. Huet. The calculus of constructions. Information and Computation, 76:95-120, 1988.
44. N. Cagman and J. R. Hindley. Combinatory weak reduction in lambda calculus. Theoretical Computer Science, 198:239-247, 1998.
45. H. B. Curry, J. R. Hindley and J. P. Seldin. Combinatory Logic, Volume II. North-Holland Co., Amsterdam, 1972.
46. A. Church. A note on the Entscheidungsproblem. Journal of Symbolic Logic, 1:40-41, 1936. See also correction in pp. 101-102.
47. A. Church. An unsolvable problem of elementary number theory. American, Journal of Mathematics, 58:345-363, 1936.
48. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
49. A. Church. The Calculi of Lambda Conversion. Princeton University Press, Princeton, New Jersey, USA, 1941.
50. D. E. Cohen. Computability and Logic. Ellis-Horwood, England, 1987.
51. A. Church and J. B. Rosser. Some properties of conversion. Transactions of the American Mathematical Society, 39:472-482, 1936.
52. R. Crole. Categories for Types. Cambridge University Press, England, 1994.
53. H. B. Curry. Grundlagen der kombinatorischen Logik. American Journal of Mathematics, 52:509-536, 789-834, 1930.
54. H. B. Curry. Functionality in combinatory logic. Proceedings of the National Academy of Sciences of the USA, 20:584-590, 1934.
55. H. B. Curry. Modified basic functionality in combinatory logic. Dialectica, 23:83-92, 1969.
56. D. T. van Daalen. The language theory of Automath, Chapter 1 Sections 1-5. In Nederpelt et al. [NGdV94], pages 163-200. From author’s thesis, University of Eindhoven 1980.
57. D. van Dalen. Logic and Structure. Springer-Verlag, Berlin, 1997. 3rd edn.
58. Richard Dedekind. Was sind und was sollen die Zahlen? Friedrich Vieweg & Sohn, Braunschweig, 1887. (10th edn. 1965).
59. H. B. Enderton. A Mathematical Introduction to Logic. Harcourt/Academic Press, New York, 2000. 2nd edn.
60. E. Engeler. Algebras and combinators. Algebra Universalis, 13:389-392, 1981.
61. J. L. Fiadero. Categories for Software Engineering. Springer-Verlag, Berlin, 2005.
62. F. B. Fitch. Representation of sequential circuits in combinatory logic. Philosophy of Science, 25:263-279, 1958.
63. G. Frege. Grundgesetze der Arithmetik. Verlag Hermann Pohle, Jena, 1893. Two vols. Reprinted 1962 as one vol. by Georg Olms, Hildesheim, Germany, and 1966 as No. 32 in series Olms Paperbacks.
64. H Friedman. Axiomatic recursive function theory. In R. Gandy and.C E. M. Yates, editors, Logic Colloquium’69, pages 113-137. North- Holland Co., Amsterdam, 1971.
65. H. Geuvers. Logic and Type Systems. Ph.D. thesis, Catholic University of Nijmegen, 1993.
66. H. Geuvers. Induction is not derivable in second order dependent type theory. In S. Abramsky, editor, Proceedings of Typed Lambda Calculus and Applications (TLCA 2001), Krakow, Poland, May 2001, volume 2044 of Lecture Notes in Computer Science, pages 166-181. Springer, 2001.
67. G. Gierz, K. Hofmann, K. Keimel, J. Lawson, M. Mislove and Scott. Continuous lattices and domains. In Encyclopedia of Mathematics and its Applications, volume 93. Cambridge University Press, England, 2003.
68. J.-Y. Girard. Une extension de l’interprétation de Gödel à l’analyse, et son application à l’élimination des coupures dans l’analyse et la théorie des types. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63-92. North-Holland Co., Amsterdam, 1971.
69. J.-Y. Girard. Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Ph.D. thesis, University of Paris VII, France, 1972.
70. C. Hankin. An Introduction to Lambda Calculi for Computer Scientists. King’s College Publications, London, England, 2004. Revised edn. of Lambda Calculi, Clarendon Press, Oxford, 1994.
71. L. Henkin. Completeness in the theory of types. Journal of Symbolic Logic, 15:81-91, 1950.
72. R. Harper, F. Honsell and G. Plotkin. A framework for defining logics. In Proceedings Second Symposium of Logic in Computer Science (Ithaca, NY), pages 194-204. IEEE, 1987.
73. J. R. Hindley. The Church-Rosser Theorem and a Result in Combinatory Logic. Ph.D. thesis, University of Newcastle upon Tyne, England, 1964.
74. J. R. Hindley. Axioms for strong reduction in combinatory logic. Journal of Symbolic Logic, 32:224-236, 1967.
75. J. R. Hindley. The principal type-scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29-60, 1969.
76. J. R. Hindley. Combinatory reductions and lambda reductions compared. Zeitschrift für Mathematische Logik, 23:169-180, 1977. Journal now called Mathematical Logic Quarterly.
77. J. R. Hindley. Reductions of residuals are finite. Transactions of the American Mathematical Society, 240:345-361, 1978.
78. J. R. Hindley. The discrimination theorem holds for combinatory weak reduction. Theoretical Computer Science, 8:393-394, 1979.
79. J. R. Hindley. Types with intersection, an introduction. Formal Aspects of Computing, 4:470-486, 1992.
80. J. R. Hindley. Basic Simple Type Theory. Cambridge University Press, England, 1997.
81. J. R. Hindley and B. Lercher. A short proof of Curry’s normal form theorem. Proceedings of the American Mathematical Society, 24:808-810, 1970.
82. J. R. Hindley and G. Longo. Lambda-calculus models and extensional- ity. Zeitschrift für Mathematische Logik, 26:289-310, 1980. Journal now called Mathematical Logic Quarterly.
83. J. R. Hindley, B. Lercher and J. P. Seldin. Introduction to Combinatory Logic. Cambridge University Press, England, 1972. Also Italian (revised) edn: Introduzione alla Logica Combinatoria, Boringhieri, Torino, 1975.
84. W. A. Howard. The formulae-as-types notion of construction. In Hindley and Seldin, pages 479-490. Manuscript circulated 1969.
85. J. R. Hindley and J. P. Seldin, editors. To H. B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, London, 1980.
86. J. R. Hindley and J. P. Seldin. Introduction to Combinators and λ- calculus. Cambridge University Press, England, 1986.
87. G. Huet. An analysis of Böhm’s theorem. Theoretical Computer Science, 121:154-167, 1993.
88. G. Huet. Residual theory in λ-calculus: a formal development. Journal of Functional Programming, 4:371-394, 1994.
89. J. M. E. Hyland. A syntactic characterization of the equality in some models for the lambda calculus. Journal of the London Mathematical Society, Series 2, 12:361-370, 1976.
90. B. Jacobs. Categorical Logic and Type Theory. North-Holland Co., Amsterdam, 1999.
91. J. L. Kelley. General Topology. Van Nostrand, New York, 1955.
92. S. C. Kleene. λ-definability and recursiveness. Duke Mathematical Journal, 2:340-353, 1936.
93. S. C. Kleene. Introduction to Metamathematics. Van Nostrand, New York, 1952.
94. F. Kamareddine, T. Laan and R. Nederpelt. A modern Perspective on Type Theory: from its Origins until Today. Kluwer, Dordrecht, Boston and London, 2004.
95. J. W. Klop. Combinatory Reduction Systems. Ph.D. thesis, University of Utrecht, 1980. Published by Mathematisch Centrum, 413 Kruislaan, Amsterdam.
96. J. W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, Volume 2: Background, Computational Structures, pages 1-116. Oxford University Press, England, 1992.
97. C. P. J. Koymans. Models of the lambda calculus. Information and Control, 52:306-332, 1982. (Journal now called Information and Computation).
98. C. P. J. Koymans. Models of the Lambda Calculus. Ph.D. thesis, University of Utrecht, The Netherlands, 1984.
99. F. Kamareddine and A. Rios. A λ-calculus à la de Bruijn with explicit substitutions. In M. Hermenegildo and S. D. Swierstra, editors, Programming Languages, Implementations, Logics and Programs, 7th International Symposium, volume 982 of Lecture Notes in Computer Science, pages 45-62. Springer-Verlag, Berlin, 1995.
100. J.-L. Krivine. Lambda-Calculus, Types and Models. Ellis-Horwood, U.S.A. and Prentice-Hall, U.K., 1993. English translation of Lambda calcul, Types et Modèles, Masson, Paris 1990.
101. J. W. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science, 121(1-2):279-308, 1993.
102. J. Lambek. From λ-calculus to cartesian closed categories. In Hindley and Seldin [HS80], pages 375-402.
103. P. J. Landin. A correspondence between ALGOL 60 and Church’s lambda notation. Communications of the ACM, 8:89-101, 158-165, 1965.
104. P. J. Landin. The next 700 programming languages. Communications of the ACM, 9(3):157-166, 1966.
105. H. Läuchli. Intuitionistic propositional calculus and definably nonempty terms. Journal of Symbolic Logic, 30:263, 1965. Abstract only.
106. H. Läuchli. An abstract notion of realizability for which intuitionistic predicate calculus is complete. In A. Kino, J. Myhill and R. Vesley, editors, Intuitionism and Proof Theory, pages 227-234. North-Holland Co., Amsterdam, 1970. Proceedings of conference at Buffalo, N.Y. 1968.
107. B. Lercher. Strong Reduction and Recursion in Combinatory Logic. Ph.D. thesis, Mathematics Department, Pennsylvania State University, USA, 1963.
108. B. Lercher. The decidability of Hindley’s axioms for strong reduction. Journal of Symbolic Logic, 32:237-239, 1967.
109. B. Lercher. Strong reduction and normal form in combinatory logic. Journal of Symbolic Logic, 32:213-223, 1967.
110. B. Lercher. Lambda-calculus terms that reduce to themselves. Notre Dame Journal of Formal Logic, 17:291-292, 1976.
111. G. Longo and S. Martini. Computability in higher types and the universal domain Pw. In M. Fontet and K. Mehlhorn, editors, STACS 84, Symposium of Theoretical Aspects of Computer Science, volume 166 of Lecture Notes in Computer Science, pages 186-197. Springer-Verlag, Berlin, 1984.
112. G. Longo and E. Moggi. Constructive natural deduction and its w-set interpretation. Mathematical Structures in Computer Science, 1(2):215-254, 1991.
113. G. Longo. Set-theoretical models of λ-calculi: theories, expansions, isomorphisms. Annals of Mathematical Logic, 24:153-188, 1983. Journal now called Annals of Pure and Applied Logic.
114. J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, England, 1986.
115. Z. Luo. An extended calculus of constructions. Ph.D. thesis, Univerisity of Edinburgh, 1990.
116. S. MacLane. Categories for the Working Mathematician. Springer- Verlag, Berlin, 1971.
117. R. K. Meyer, M. W. Bunder and L. Powers. Implementing the “fool’s model” of combinatory logic. Journal of Automated Reasoning, 7:597–630, 1991.
118. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine. Communications of the ACM, 3:184-195, 1960.
119. E. Mendelson. Introduction to Mathematical Logic. Chapman and Hall, New York, 1997. 4th edn.
120. A. R. Meyer. What is a model of the lambda calculus? Information and Control, 52:87-122, 1982. Journal now called Information and Computation.
121. M. Mezghiche. On pseudo-Сβ-normal form in combinatory logic. The.oretical Computer Science, 66:323-331, 1989.
122. G. Michaelson. An Introduction to Functional Programming through Lambda Calculus. Addison-Wesley, England and USA, 1988.
123. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
124. J. C. Mitchell. Foundations for programming Languages. M.I.T. Press, Cambridge, Massachusetts, USA, 1996.
125. P. Martin-Löf. An intuitionistic theory of types: predicative part. In E. Rose and J. C. Shepherdson, editors, Logic Colloquium 73, pages 73-118, North-Holland Co., Amsterdam, 1975.
126. P. Mosses. Denotational semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, pages 575-631. Elsevier, Amsterdam and M.I.T. Press, Cambridge, Massachusetts, USA, 1990.
127. R. P. Nederpelt and J. H. Geuvers. Twenty-Five Years of Automath Research. In Nederpelt et al. [NGdV94], pages 3-54.
128. R. P. Nederpelt, J. H. Geuvers and R. C. de Vrijer, editors. Selected Papers on Automath. Elsevier, Amsterdam, 1994.
129. B. C. Pierce. Basic Category Theory for Computer Scientists. M.I.T. Press, Cambridge, Massachusetts, USA, 1991.
130. B. C. Pierce. Types and Programming Languages. M.I.T. Press, Cambridge, Massachusetts, USA, 2002.
131. G. D. Plotkin. The λ-calculus is ω-incomplete. Journal of Symbolic Logic, 39:313-317, 1974.
132. G. D. Plotkin. Tω as a universal domain. Journal of Computer and, System Sciences, 17:209-236, 1978.
133. G. D. Plotkin. Set-theoretical and other elementary models of the λ- calculus. Theoretical Computer Science, 121:351-409, 1993. (Updated version of a paper informally circulated in 1972).
134. G. D. Plotkin. A semantics for static type-inference. Information and, Computation, 109:256-299, 1994.
135. R. Pollack. Closure under alpha-conversion. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs, volume 806 of Lecture Notes in Computer Science, pages 313-332. Springer-Verlag, Berlin, 1993.
136. G. Pottinger. A type assignment for the strongly normalizable λ-terms. In Hindley and Seldin [HS80], pages 561-579.
137. D. Prawitz. Natural Deduction. Almqvist and Wiksell, Stockholm, Reissued in 2006, with new preface and errata-list, by Dover Inc., Mineola, N.Y., USA.
138. D. Pigozzi and A. Salibra. Lambda abstraction algebras: representation theorems. Theoretical Computer Science, 140:5-52, 1995.
139. D. Pigozzi and A. Salibra. Lambda abstraction algebras: coordinatizing models of lambda calculus. Fundamenta Informaticae, 33:149-200, 1998.
140. W. Rautenberg. A Concise Introduction to Mathematical Logic. Springer-Verlag, Berlin, 2006.
141. S. Reeves and M. Clarke. Logic for Computer Science. Addison-Wesley Co., U.S.A., 1990.
142. G. R. Renardel de Lavalette. Strictness analysis via abstract interpretation for recursively defined types. Information and Computation, 99(2):154-177, 1992.
143. G. Révész. Lambda-calculus, Com, bina, tors and Functional Programming. Cambridge University Press, England, 1988.
144. J. C. Reynolds. Towards a theory of type structure. In B. Robinet, editor, Programming Symposium, volume 19 of Lecture Notes in Computer Science, pages 408-425. Springer-Verlag, Berlin, 1974.
145. J. C. Reynolds. Theories of Programming Languages. Cambridge University Press, England, 1998.
146. A. Rezus. A Bibliography of Lambda-Calculi, Combinatory Logics and, Related Topics. Mathematisch Centrum, 413 Kruislaan, Amsterdam, 1982. ISBN 90-6196234-X.
147. M. von Rimscha. Mengentheoretische Modelle des λK-Kalküls. Archiv für Mathematische Logik, 20:65-74, 1980. Journal now called Archive for Mathematical Logic.
148. J. B. Rosser. A mathematical logic without variables, Part 1. Annals of Mathematics, Series 2, 36:127-150, 1935. Also Part 2: Duke Mathematical Journal 1 (1935), pp. 328-355.
149. P. Rosenbloom. The Elements of Mathematical Logic. Dover Inc., New York, 1950.
150. J. B. Rosser. Deux Esquisses de Logique. Gauthier-Villars, Paris, and Nauwelaerts, Louvain, 1955.
151. B. K. Rosen. Tree manipulating systems and Church-Rosser theorems. Journal of the Association for Computing Machinery, 20:160-187, 1973.
152. P. Sallé. Une extension de la théorie des types en λ-calcul. In G. Ausiello and C. Böhm, editors, Automata, Languages and Programming, Fifth Colloquium, volume 62 of Lecture Notes in Computer Science, pages 398410. Springer-Verlag, Berlin, 1978.
153. A. Salibra. On the algebraic models of lambda calculus. Theoretical Computer Science, 249:197-240, 2000.
154. L. E. Sanchis. Functionals defined by recursion. Notre Dame Journal of Formal Logic, 8:161-174, 1967.
155. L. E. Sanchis. Reducibilities in two models for combinatory logic. Journal of Symbolic Logic, 44:221-234, 1979.
156. M. Schönfinkel. Über die Bausteine der mathematischen Logik. Mathematische Annalen, 92:305-316, 1924. English translation: On the building blocks of mathematical logic, in From Frege to Gödel, edited by J. van Heijenoort, Harvard University Press, USA 1967, pp. 355-366.
157. D. E. Schroer. The Church-Rosser Theorem. Ph.D. thesis, Cornell University, 1965. Informally circulated 1963.
158. H. Schwichtenberg. Definierbare Funktionen im λ-Kalkül mit Typen. Archiv für Mathematische Logik, 17:113-114, 1976.
159. D. S. Scott. Constructive validity. In M. Laudet, D. Lacombe, L. No- lin and M. Schützenberger, editors, Symposium on Automatic Demonstration, volume 125 of Lecture Notes in Mathematics, pages 237-275. Springer-Verlag, Berlin, 1970. (Proceedings of a conference in Versailles 1968).
160. D. S. Scott. Outline of a mathematical theory of computation. In Proceedings of the Fourth Annual Princeton Conference on Information Sciences and Systems, pages 169-176. Department of Electrical Engineering, Princeton University, 1970.
161. D. S. Scott. Continuous lattices. In F. W. Lawvere, editor, Toposes, Algebraic Geometry and Logic, volume 274 of Lecture Notes in Mathematics, pages 97-136, Berlin, 1972. Springer-Verlag. (Informally circulated in 1970).
162. D. S. Scott. Models for various type-free calculi. In P. Suppes and others, editors, Logic, Methodology and Philosophy of Science IV, pages 157-187. North-Holland Co., Amsterdam, 1973. (Proceedings of a conference in 1971).
163. D. S. Scott. Data types as lattices. SIAM Journal on Computing, 5:522-587, 1976.
164. D. S. Scott. Lambda calculus: some models, some philosophy. In J. Barwise et al., editors, The Kleene Symposium, pages 223-265. North- Holland Co., Amsterdam, 1980.
165. D. S. Scott. Relating theories of the λ-calculus. In Hindley and Seldin [HS80], pages 403-450.
166. D. S. Scott. Domains for denotational semantics. In M. Nielsen and E. Schmidt, editors, Automata, Languages and Programming, Ninth International Colloquium, volume 140 of Lecture Notes in Computer Science, pages 577-613. Springer-Verlag, Berlin, 1982.
167. D. S. Scott. Lectures on a mathematical theory of computation. In M. Broy and G. Schmidt, editors, Theoretical Foundations of Programming Methodology. D. Reidel Co., Dordrecht, The Netherlands, 1982.
168. D. S. Scott. A type-theoretical alternative to ISWIM, CUCH, OWHY. Theoretical Computer Science, 121:411-440, 1993. (Informally circulated in 1969).
169. J. P. Seldin. A sequent calculus for type assignment. Journal of Symbolic Logic, 42:11-28, 1977.
170. J. P. Seldin. Progress report on generalized functionality. Annals of Mathematical Logic, 17:29-59, 1979. Condensed from manuscript Theory of Generalized Functionality, informally circulated in 1975. Journal now called Annals of Pure and Applied Logic.
171. J. P. Seldin. On the proof theory of Coquand’s calculus of constructions. Annals of Pure and Applied Logic, 83:23-101, 1997.
172. J. P. Seldin. A Gentzen-style sequent calculus of constructions with expansion rules. Theoretical Computer Science, 243:199-215, 2000.
173. J. P. Seldin. On lists and other abstract data types in the calculus of constructions. Mathematical Structures in Computer Science, 10:261-276, 2000.
174. J. R. Shoenfield. Mathematical Logic. A. K. Peters, USA, 2001. (1st edn. by Addison-Wesley 1967).
175. H. Simmons. Derivation and Computation. Cambridge University Press, England, 2000.
176. R. M. Smullyan. To Mock a Mocking-Bird. Alfred Knopf Inc., U.S.A., 1985. Also Oxford University Press, England, 1990.
177. S. Stenlund. Combinators, λ-terms and Proof Theory. D. Reidel Co., Dordrecht, The Netherlands, 1972.
178. J. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. M.I.T. Press, Cambridge, Massachusetts, USA, 1977.
179. A. Stoughton. Substitution revisited. Theoretical Computer Science, 59(3):317-325, 1988.
180. H. R. Strong. Algebraically generalized recursive function theory. I.B.M. Journal of Research and Development,12:465-475, 1968.
181. M. H. Sorensen and P. Urzyczyn. Lectures on the Curry-Howard Isomorphism,. Elsevier, Amsterdam, 2006.
182. W. W. Tait. Intensional interpretations of functionals of finite type. Journal of Symbolic Logic, 32:198-212, 1967.
183. Masako Takahashi. Theory of Computation, Computability and Lambda Calculus. Kindai Kagaku Sha, Tokyo, 1991. In Japanese.
184. Masako Takahashi. Parallel reductions in λ-calculus. Information and, Computation, 118:120-127, 1995. Earlier version: J. Symbolic Computation 7 (1989), 113-123.
185. A. S. Troelstra and D. van Dalen. Constructivism in Mathematics, an Introduction. North-Holland Co., Amsterdam, 1988. (Vols. 1 and 2).
186. A. S. Troelstra, editor. Metamathematical Investigations of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1973. (Also 2nd edn. 1993, publ. as Preprint no. X-93-05 by Institute for Logic, Language and Computation, University of Amsterdam. Plantage Muidergracht 24, 1018TV Amsterdam).
187. A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, England, 2000.
188. D. A. Turner. SASL Language Manual. University of St. Andrews, Scotland, 1976.
189. R. Vestergaard and J. Brotherton. A formalised first-order confluence proof for the λ-calculus using one-sorted variable names. Information and Computation, 183:212-244, 2003.
190. L. S. van Benthem Jutting. Typing in Pure Type Systems. Information and Computation, 105:30-41, 1993.
191. C. P. Wadsworth. The relation between computational and denota- tional properties for Scott’s Dx models of the lambda-calculus. SIAM Journal of Computing, 5:488-521, 1976.
192. C. P. Wadsworth. Approximate reduction and lambda-calculus models. SIAM Journal of Computing, 7:337-356, 1978.
193. E. Wagner. Uniformly reflexive structures. Transactions of the American Mathematical Society, 144:1-41, 1969.
194. G. Winskel. The Formal Semantics of Programming Languages, an Introduction. M.I.T. Press, USA, 2001. (1st edn. 1993).
195. V. E. Wolfengagen. Combinatory Logic in Programming. JurInfoR Ltd., Moscow, Russia, 2003. 2nd edn., in English.
196. V. E. Wolfengagen. Methods and Means for Computation with Objects. JurInfoR Ltd., Moscow, Russia, 2004. In Russian.
197. J. Zashev. On the recursion theorem in iterative operative spaces. Journal of Symbolic Logic, 66:1727-1748, 2001.