SN Combinators and Partial Combinatory Algebras

We introduce an intersection typing system for combinatory logic. We prove the soundness and completeness for the class of partial combinatory algebras. We derive that a term of combinatory logic is typeable iff it is SN. Let F be the class of non-empty filters which consist of types. Then F is an extensional non-total partial combinatory algebra. Furthermore, it is a fully abstract model with respect to the set of sn c terms of combinatory logic. By F, we can solve Bethke-Klop's question; “find a suitable representation of the finally collapsed partial combinatory algebra of P”. Here, P is a partial combinatory algebra, and is the set of closed sn terms of combinatory logic modulo the inherent equality. Our solution is the following: the finally collapsed partial combinatory algebra of P is representable in F. To be more precise, it is isomorphically embeddable into F.

[1]  M. Beeson.  Foundations of Constructive Mathematics , 1985 .

[2]  Yohji Akama,et al.  A Lambda-to-CL Translation for Strong Normalization , 1997, TLCA.

[3]  Steffen van Bakel,et al.  Complete Restrictions of the Intersection Type Discipline , 1992, Theor. Comput. Sci..

[4]  C.-H. Luke Ong,et al.  Modified Realizability Toposes and Strong Normalization Proofs , 1993, TLCA.

[5]  Ramón Pino Pérez.  An Extensional Partial Combinatory Algebra Based on Lamda-Terms , 1991, MFCS.

[6]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[7]  M. Hyland.  A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus , 1976 .

[8]  Jan Willem Klop,et al.  Collapsing Partial Combinatory Algebras , 1995, HOA.

[9]  R. Lathe.  Phd by thesis , 1988, Nature.

[10]  Benedetto Intrigila,et al.  Some New Results on Easy lambda-Terms , 1993, Theor. Comput. Sci..

[11]  Gordon D. Plotkin,et al.  Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..

[12]  Harold T. Hodes,et al.  The | lambda-Calculus. , 1988 .

[13]  Carl A. Gunter.  Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

[14]  Furio Honsell,et al.  Operational, denotational and logical descriptions: a case study , 1992, Fundam. Informaticae.

[15]  Christopher P. Wadsworth,et al.  The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus , 1976, SIAM J. Comput..

[16]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[17]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[18]  Bernhard Gramlich,et al.  Termination and confluence: properties of structured rewrite systems , 1996 .

[19]  Mariangiola Dezani-Ciancaglini,et al.  Intersection Types for Combinatory Logic , 1992, Theor. Comput. Sci..

[20]  Ingemarie Bethke,et al.  On the existence of extensional partial combinatory algebras , 1987, Journal of Symbolic Logic.

[21]  Giuseppe Jacopini,et al.  A condition for identifying two elements of whatever model of combinatory logic , 1975, Lambda-Calculus and Computer Science Theory.

[22]  J. Roger Hindley,et al.  Combinatory Weak Reduction in Lambda Calculus , 1998, Theor. Comput. Sci..

[23]  Yohji AKAMA.  A -to-CL Translation for Strong Normalization , 1997 .