Classical Combinatory Logic

Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original combinatory calculus corresponds to minimal implicative logic written...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. DMTCS Proceedings vol. AF,...; H. Proceedings; S. 87 - 96
1. Verfasser:	Nour, Karim
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	DMTCS 01.01.2005 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Schriftenreihe:	DMTCS Proceedings
Schlagworte:	[info.info-lo] computer science [cs]/logic in computer science [cs.lo] [info.info-sc] computer science [cs]/symbolic computation [cs.sc] combinatory logic Computer Science lambda-calculus Logic in Computer Science propositional classical logic Symbolic Computation Combinatory logic Propositional classical logic Lambda-calculus
ISSN:	1365-8050, 1462-7264, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!