Información del autor
Documentos disponibles escritos por este autor (5)
Añadir el resultado a su cesta Hacer una sugerencia Refinar búsqueda
texto impreso
Constructor-based term rewriting systems are a useful subclass of TRS, in particular for programming purposes. In this kind of systems constructors determine a universe of values, which are the expected output of the computations. Then it would [...]texto impreso
In a recent work we have proposed let-rewriting, a simple one-step relation close to ordinary term rewriting but able, via local bindings, to express sharing of computed values. In this way, let-rewriting reflects the call-time choice semantics [...]texto impreso
Type systems are widely used in programming languages as a powerful tool providing safety to programs, and forcing the programmers to write code in a clearer way. Functional logic languages have inherited Damas & Milner type system from their fu[...]texto impreso
Non-strict non-deterministic functions are one of the most distinctive features of functional-logic languages. Traditionally, two semantic alternatives have been considered for this kind of functions: call-time choice and run-time choice. While [...]texto impreso
López-Fraguas, Francisco Javier ; Rodríguez-Hortalá, Juan ; Sánchez-Hernández, Jaime | Springer | 2008It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approaches to reduction like ordinary term rewriting systems or A-calculu[...]
