Functional Logic Programming in Maude
From MaRDI portal
Publication:5403075
DOI10.1007/978-3-642-54624-2_16zbMath1407.68081OpenAlexW1005406636MaRDI QIDQ5403075
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
Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Logic programming (68N17)
Related Items (3)
Two Decades of Maude ⋮ Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ Programming and symbolic computation in Maude
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Programming with narrowing: a tutorial
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Conditional rewriting logic as a unified model of concurrency
- Foundations of equational logic programming
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Folding variant narrowing and optimal variant termination
- Evaluation strategies for functional logic programming
- Abstract Logical Model Checking of Infinite-State Systems Using Narrowing
- A needed narrowing strategy
- Narrowing Data-Structures with Pointers
- Transformation and Debugging of Functional Logic Programs
- Multi-paradigm Declarative Languages
- Completion of a Set of Rules Modulo a Set of Equations
- An Efficient Unification Algorithm
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- The integration of functions into logic programming: From theory to practice
- An approach to declarative programming based on a rewriting logic
- Functional Logic Programming: From Theory to Curry
- Essentials of Term Graph Rewriting
- Functional and Logic Programming
- Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Term Rewriting and Applications
- Equality, types, modules, and (why not?) generics for logic programming
This page was built for publication: Functional Logic Programming in Maude
