A Lightweight Combination of Semantics for Non-deterministic Functions

Simple item page
dc.creatorLopez-Fraguas, Francisco Javier
dc.creatorRodriguez-Hortala, Juan
dc.creatorSanchez-Hernandez, Jaime
dc.date2009-03-12
dc.date.accessioned2026-07-07T12:51:55Z
dc.date.available2026-07-07T12:51:55Z
dc.descriptionThe use of non-deterministic functions is a distinctive feature of modern functional logic languages. The semantics commonly adopted is call-time choice, a notion that at the operational level is related to the sharing mechanism of lazy evaluation in functional languages. However, there are situations where run-time choice, closer to ordinary rewriting, is more appropriate. In this paper we propose an extension of existing call-time choice based languages, to provide support for run-time choice in localized parts of a program. The extension is remarkably simple at three relevant levels: syntax, formal operational calculi and implementation, which is based on the system Toy.
dc.descriptionPaper presented at the 18th Workshop on Logic-based Methods in Programming Environments (WLPE2008) (Report-No: WLPE/2008). Paper submitted by a co-editor of the Workshop proceedings
dc.identifierhttps://arxiv.org/abs/0903.2205
dc.identifierhttp://arxiv.org/abs/0903.2205
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223144
dc.subjectProgramming Languages
dc.titleA Lightweight Combination of Semantics for Non-deterministic Functions
dc.typetext

Files

Collections

arXiv