hrcak mascot   Srce   HID

Izvorni znanstveni članak

Discriminators in Lambda Calculus

Svitan Gaborovič ; Faculty of Civil Engineering, University of Maribor, Maribor, Slovenia

Puni tekst: engleski, pdf (10 MB) str. 255-277 preuzimanja: 57* citiraj
APA 6th Edition
Gaborovič, S. (1995). Discriminators in Lambda Calculus. Journal of computing and information technology, 3 (4), 255-277. Preuzeto s https://hrcak.srce.hr/150416
MLA 8th Edition
Gaborovič, Svitan. "Discriminators in Lambda Calculus." Journal of computing and information technology, vol. 3, br. 4, 1995, str. 255-277. https://hrcak.srce.hr/150416. Citirano 21.02.2020.
Chicago 17th Edition
Gaborovič, Svitan. "Discriminators in Lambda Calculus." Journal of computing and information technology 3, br. 4 (1995): 255-277. https://hrcak.srce.hr/150416
Harvard
Gaborovič, S. (1995). 'Discriminators in Lambda Calculus', Journal of computing and information technology, 3(4), str. 255-277. Preuzeto s: https://hrcak.srce.hr/150416 (Datum pristupa: 21.02.2020.)
Vancouver
Gaborovič S. Discriminators in Lambda Calculus. Journal of computing and information technology [Internet]. 1995 [pristupljeno 21.02.2020.];3(4):255-277. Dostupno na: https://hrcak.srce.hr/150416
IEEE
S. Gaborovič, "Discriminators in Lambda Calculus", Journal of computing and information technology, vol.3, br. 4, str. 255-277, 1995. [Online]. Dostupno na: https://hrcak.srce.hr/150416. [Citirano: 21.02.2020.]

Sažetak
The paper treats the problems of discriminability and separability for a wide class of infinite sets of terms in the pure lambda calculus. The technique used is a generalization of the Bohm out technique for extracting substitutional instances from the sets of terms. A unification of this technique on an appropriate class of terms enables the construction of an algorithm of extraction which leads to the construction of a discriminator for an infinite set of terms having the distinctive paths. In [11] some conditions under which a r.e. set of terms is a numeral system were done. For the opposite direction, i.e. construction of the distinctive paths for the discriminable or separable set of terms, we used the sequentiality and continuity theorem with a combination of a slight generalization of the Wadsworth's version of the lambda calculus (cf. [8]). The connection between the semantic notion of discriminability and the syntactic notion of distinctiveness, as known in the case of finite sets of terms, is extended here to the class of terms on which the (generalized) Bohm out technique can be applied.

Ključne riječi
Lambda calculus; lambda term; discriminator; separability of terms; discriminability; numeral

Hrčak ID: 150416

URI
https://hrcak.srce.hr/150416

Posjeta: 101 *