An extension of λ-calculus, called label-selective λ-calculus, is presented. This calculus was developed by H.Aït-Kaci. In label- selective λ-calculus the arguments of functions are selected by labels. The labels include numerical positions as well as symbolic keywords. In this way, concurrency in language expressivity is introduced without losing the propety of confluence. In this paper, an interpreter in Prolog that systematizes the application of label-selective λ-calculus reduction system in built and some selected examples of execution are given.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados