Functional Logic Programming in Maude

Escobar, Santiago

doi:10.1007/978-3-642-54624-2_16

Cited by 4 publications

(2 citation statements)

References 37 publications

(55 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multiparadigm, functional logic languages combine features from functional programming (efficient evaluation strategies, nested expressions, genericity, advanced typing, algebraic data types) and LP (logical variables, partial data structures, nondeterministic search for solutions, constraint solving modulo theories) (Meseguer 1992b;Hanus 1997;Escobar 2014). The operational principle that supports functional and logic language integration is called narrowing (Fay 1979;Slagle 1974), which is a goal-solving mechanism that subsumes the resolution principle of logic languages and the reduction principle of functional languages.…”

Section: Introductionmentioning

confidence: 99%

Symbolic Specialization of Rewriting Logic Theories with`Presto`

Alpuente¹,

Escobar²,

Sapiña³

et al. 2022

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

This paper introduces $\tt{{Presto}}$ , a symbolic partial evaluator for Maude’s rewriting logic theories that can improve system analysis and verification. In $\tt{{Presto}}$ , the automated optimization of a conditional rewrite theory $\mathcal{R}$ (whose rules define the concurrent transitions of a system) is achieved by partially evaluating, with respect to the rules of $\mathcal{R}$ , an underlying, companion equational logic theory $\mathcal{E}$ that specifies the algebraic structure of the system states of $\mathcal{R}$ . This can be particularly useful for specializing an overly general equational theory $\mathcal{E}$ whose operators may obey complex combinations of associativity, commutativity, and/or identity axioms, when being plugged into a host rewrite theory $\mathcal{R}$ as happens, for instance, in protocol analysis, where sophisticated equational theories for cryptography are used. $\tt{{Presto}}$ implements different unfolding operators that are based on folding variant narrowing (the symbolic engine of Maude’s equational theories). When combined with an appropriate abstraction algorithm, they allow the specialization to be adapted to the theory termination behavior and bring significant improvement while ensuring strong correctness and termination of the specialization. We demonstrate the effectiveness of $\tt{{Presto}}$ in several examples of protocol analysis where it achieves a significant speed-up. Actually, the transformation provided by $\tt{{Presto}}$ may cut down an infinite folding variant narrowing space to a finite one, and moreover, some of the costly algebraic axioms and rule conditions may be eliminated as well. As far as we know, this is the first partial evaluator for Maude that respects the semantics of functional, logic, concurrent, and object-oriented computations.

show abstract

Section: Introductionmentioning

confidence: 99%

Symbolic Specialization of Rewriting Logic Theories with`Presto`

Alpuente¹,

Escobar²,

Sapiña³

et al. 2022

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…An alternative way of representing Eqlog programs can be found in[56] using system modules and narrowing search, and also in[57] using functional modules and folding variant narrowing.…”

mentioning

confidence: 99%

Programming and symbolic computation in Maude

Durán

Eker

Escobar

et al. 2020

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite theories. Maude has also a formal environment of verification tools. Symbolic computation is a powerful technique for reasoning about the correctness of concurrent systems and for increasing the power of formal tools. We present several new symbolic features of Maude that enhance formal reasoning about Maude programs and the effectiveness of formal tools. They include: (i) very general unification modulo user-definable equational theories, and (ii) symbolic reachability analysis of concurrent systems using narrowing. The paper does not focus just on symbolic features: it also describes several other new Maude features, including: (iii) Maude's strategy language for controlling rewriting, and (iv) external objects that allow flexible interaction of Maude object-based concurrent systems with the external world. In particular, metainterpreters are external objects encapsulating Maude interpreters that can interact with many other objects. To make the paper self-contained and give a reasonably complete language overview, we also review the basic Maude features for equational rewriting and rewriting with rules, Maude programming of concurrent object systems, and reflection. Furthermore, we include many examples illustrating all the Maude notions and features described in the paper.

show abstract