Functional logic programming in Maude

DOI10.1007/978-3-642-54624-2_16MaRDI QIDQ5403075zbMATH OpenOpenAlexFDO

Authors Santiago Escobar

Publication date 25 March 2014

Published in Specification, Algebra, and Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54624-2_16

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18)

Recommendations

• Maude: specification and programming in rewriting logic
• Programming and symbolic computation in Maude
• scientific article; zbMATH DE number 4043306
• Evaluation strategies for functional logic programming
• Specification and proof in membership equational logic

Cites work

• scientific article; zbMATH DE number 4018380 (Why is no real title available?)
• scientific article; zbMATH DE number 1185498 (Why is no real title available?)
• scientific article; zbMATH DE number 1189278 (Why is no real title available?)
• scientific article; zbMATH DE number 1332654 (Why is no real title available?)
• A needed narrowing strategy
• Abstract logical model checking of infinite-state systems using narrowing
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• An Efficient Unification Algorithm
• An approach to declarative programming based on a rewriting logic
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Completion of a Set of Rules Modulo a Set of Equations
• Conditional rewriting logic as a unified model of concurrency
• Equality, types, modules, and (why not?) generics for logic programming
• Essentials of term graph rewriting
• Evaluation strategies for functional logic programming
• Folding variant narrowing and optimal variant termination
• Foundations of equational logic programming
• Functional Logic Programming: From Theory to Curry
• Functional and Logic Programming
• Multi-paradigm Declarative Languages
• Narrowing Data-Structures with Pointers
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• Paramodulation-based theorem proving
• Programming with narrowing: a tutorial
• Symbolic Model Checking of Infinite-State Systems Using Narrowing
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Term Rewriting and Applications
• The integration of functions into logic programming: From theory to practice
• Transformation and debugging of functional logic programs
• Variants, unification, narrowing, and symbolic reachability in Maude 2.6

Cited in

(6)

• Symbolic Specialization of Rewriting Logic Theories with Presto
• scientific article; zbMATH DE number 970726 (Why is no real title available?)
• Programming and symbolic computation in Maude
• scientific article; zbMATH DE number 1336275 (Why is no real title available?)
• Two Decades of Maude
• Functional Logic Programming: From Theory to Curry

Describes a project that uses

Uses Software

• Curry
• Maude

This page was built for publication: Functional logic programming in Maude

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403075)