Computer Science – Programming Languages
Scientific paper
2009-03-12
Computer Science
Programming Languages
Paper presented at the 18th Workshop on Logic-based Methods in Programming Environments (WLPE2008) (Report-No: WLPE/2008). Pap
Scientific paper
The 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.
Lopez-Fraguas Francisco Javier
Rodriguez-Hortala Juan
Sanchez-Hernandez Jaime
No associations
LandOfFree
A Lightweight Combination of Semantics for Non-deterministic Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Lightweight Combination of Semantics for Non-deterministic Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Lightweight Combination of Semantics for Non-deterministic Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-36781