论文信息 - Semantics for Dual and Symmetric Combinatory Calculi

Semantics for Dual and Symmetric Combinatory Calculi

We define dual and symmetric combinatory calculi (inequational and equational ones), and prove their consistency. Then, we introduce algebraic and set theoretical– relational and operational – semantics, and prove soundness and completeness. We analyze the relationship between these logics, and argue that inequational dual logics are the best suited to model computation.

Katalin Bimbó | K. Bimbó

[1] E. Engeler. Algebras and combinators , 1981 .

[2] Giuseppe Longo,et al. Set-theoretical models of λ-calculus: theories, expansions, isomorphisms , 1983, Ann. Pure Appl. Log..

[3] Stefano Berardi,et al. A Symmetric Lambda Calculus for Classical Program Extraction , 1994, Inf. Comput..

[4] J. M. Dunn,et al. Dual combinators bite the dust , 1998 .

[5] J. Roger Hindley,et al. Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[6] Katalin Bimbó. Investigation into Combinatory Systems with Dual Combinators , 2000, Stud Logica.

[7] R. Meyer,et al. Algebraic analysis of entailment I , 1972 .

[8] Robert K. Meyer,et al. Combinators and Structurally Free Logic , 1997, Log. J. IGPL.

[9] J. Michael Dunn,et al. Relevance Logic and Entailment , 1986 .

[10] Katalin Bimbó,et al. The Church-Rosser property in dual combinatory logic , 2003, Journal of Symbolic Logic.

[11] STEPHrN L. BLOOM,et al. Varieties of Ordered Algebras , 1976, J. Comput. Syst. Sci..

[12] Richard Sylvan,et al. The semantics of entailment—II , 1972, Journal of Philosophical Logic.