• Corpus ID: 171666708

Una aproximación al fallo en programación declarativa multiparadigma

@inproceedings{Hernndez2004UnaAA,
  title={Una aproximaci{\'o}n al fallo en programaci{\'o}n declarativa multiparadigma},
  author={Jaime S{\'a}nchez Hern{\'a}ndez},
  year={2004}
}
La negacion en programacion logica es un tema ampliamente investigado desde los inicios de este estilo de programacion. En este trabajo se estudia un recurso similar para la programacion logico-funcional. La contrapartida natural a la negacion en el contexto logico-funcional es el fallo en la reduccion, que es donde se centra la tesis. Se toma como referencia la negacion constructiva de la programacion logica, que es capaz de encontrar valores para las variables de los objetivos, y en ese mismo… 
A logic programming approach to the verification of functional-logic programs
TLDR
This paper addresses the question of how to verify program properties in modern functional logic languages, where it is allowed the presence of non-deterministic functions with call-time choice semantics, and shows how CRWL, a well known logical framework for functional logic programming, can be easily mapped into logic programming.
A logical approach to the verification of functional-logic programs
TLDR
This paper shows how CRWL, a well known logical framework for functional logic programming, can be easily mapped into logic programming and explores then how to prove properties of the resulting logic programming translation by means of different existing interactive proof assistants.
Constructive Failure in Functional-Logic Programming: From Theory to Implementation
TLDR
This paper adapts a formal framework for checking (finite) failure of reduction for building a prototype for a functional-logic language with constructive failure as the natural counterpart to negation in logic programming.
Implementing Constructive Failure in Functional-Logic Programming
TLDR
This paper adapts a formal framework for checking ( nite) failure of reduction in previous works for implementing a prototype for a functional-logic language with constructive failure as the natural counterpart to negation in logic programming.
A simple rewrite notion for call-time choice semantics
TLDR
The proposed notion of rewriting uses an explicit representation for sharing with let-constructions and is proved to be equivalent to the CRWL approach, providing in particular soundness and completeness of let-rewriting with respect to rewriting for a class of programs which are confluent in a certain semantic sense.

References

SHOWING 1-10 OF 143 REFERENCES
Programación funcional y lógica con restricciones
EN ESTE TRABAJO PRESENTAMOS E INVESTIGAMOS EL ESQUEMA TEORICO CFLP(X) PARA LA PROGRAMACION LOGICO FUNCIONAL PEREZOSA CON RESTRICCIONES, CADA ESTRUCTURA CON RESTRICCIONES X, QUE CONSISTE EN UN DOMINIO
Tecnicas de diagnostico y depuracion declarativa para lenguajes logico-funcionales
La falta de herramientas auxiliares tales como depuradores o entornos graficos ha sido senalada como una posible limitacion para el exito, fuerade ambitos puramente academicos, de los lenguajes
Programación declarativa con restricciones sobre tipos de datos algebraicos
El objetivo principal de esta tesis es introducir constructoras de datos algebraicas y restricciones dentro de la programacion logico funcional perezosa, Por constructoras de datos algebraicas
Curry: A Truly Functional Logic Language
TLDR
The functional logic language Curry is proposed which can deal as a standard language in this area and includes important ideas of existing functional logic languages and recent developments, and combines the most important features of functional and logic languages.
A Partial Evaluation Framework for Curry Programs
TLDR
This work is the first attempt to formally define and prove correct a general scheme for the partial evaluation of functional logic programs with delays, and is relevant for program optimization in Curry, a functional logic language intended to become a standard in this area.
Constraint logic programming
TLDR
A class of programming languages, the CLP languages, are defined, all of which share the same essential semantic properties, and are highly declarative and are soundly based within a unified framework of formal semantics.
Polymorphic Types in Functional Logic Programming
TLDR
An extension of CRWL with a polymorphic type system is presented, and the consequences of type discipline both at the semantic level and at the operational level are investigated.
Narrowing Failure in Functional Logic Programming
TLDR
This paper addresses the problem of the operational mechanism for the execution of functional logic programs using failure by proposing a narrowing relation able to deal with failures, which is constructive in the usual sense of the term in the context of negation, that is, narrowing is able to find substitutions for variables even in presence of failures.
A logical approach to the verification of functional-logic programs
TLDR
This paper shows how CRWL, a well known logical framework for functional logic programming, can be easily mapped into logic programming and explores then how to prove properties of the resulting logic programming translation by means of different existing interactive proof assistants.
Le Fun: Logic, Equations and Functions
TLDR
This work proposes a computation delaying mechanism called residuation that allows a clear distinction between functional evaluation and logical deduction, and describes an implementation of the residuation paradigm as a prototype language called Le Fun—Logic, equations, and Functions.
...
...