A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions

Vírseda, Rafael del Vado; Castiñeiras, Ignacio

doi:10.1007/978-3-642-11999-6_11

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this debugger is often very difficult to use and to understand. Another approach to the debugging problem is the use of algorithmic debugging [42] and declarative debuggers (see [43][44][45]) like Freja [46,47] or Buddha [48,49]. Both of them try to find the faulty code by asking some automatic questions to the programmers and by analyzing their answers.…”

Section: Introductionmentioning

confidence: 99%

A Semantic Framework to Debug Parallel Lazy Functional Languages

et al. 2020

View full text Add to dashboard Cite

It is not easy to debug lazy functional programs. The reason is that laziness and higher-order complicates basic debugging strategies. Although there exist several debuggers for sequential lazy languages, dealing with parallel languages is much harder. In this case, it is important to implement debugging platforms for parallel extensions, but it is also important to provide theoretical foundations to simplify the task of understanding the debugging process. In this work, we deal with the debugging process in two parallel languages that extend the lazy language Haskell. In particular, we provide an operational semantics that allows us to reason about our parallel extension of the sequential debugger Hood. In addition, we show how we can use it to analyze the amount of speculative work done by the processes, so that it can be used to optimize their use of resources.

show abstract

Section: Introductionmentioning

confidence: 99%

A Semantic Framework to Debug Parallel Lazy Functional Languages

et al. 2020

View full text Add to dashboard Cite

show abstract

A modular semantics for higher-order declarative programming with constraints

Vírseda

Morente

2011

Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming

Self Cite

View full text Add to dashboard Cite

Modularity is a key issue in the construction of large multiparadigm declarative programs involving complex features like higher-order, polymorphism or constraints. The modular framework defined in this paper for higher-order declarative constraint programming builds complex software systems by combining and composing existing components or modules from a number of composition operations expressive enough to model typical modularization issues like export/import relationships and inheritance. The effectiveness of our approach relies on a higher-order constraint rewriting logic over a parametrically given constraint domain as the basis of a model-theoretic and fixpoint semantics for program modules, and a modular semantics given by a suitable immediate consequence operator which is compositional and fully abstract, offering the possibility of reasoning on the composition process itself. The availability of this well-founded semantics characterization for structuring and modularizing higher-order declarative constraint programs provides the ground to perform sound semantics-based transformation, analysis, debugging and verification of declarative software.

show abstract

A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions

Cited by 2 publications

References 16 publications

A Semantic Framework to Debug Parallel Lazy Functional Languages

A Semantic Framework to Debug Parallel Lazy Functional Languages

A modular semantics for higher-order declarative programming with constraints

Contact Info

Product

Resources

About