A Natural Implementation of Plural Semantics in Maude

Recently, a new semantics for non-deterministic lazy functional(-logic) programming has been presented, in which the treatment of parameter passing was different to previous proposals like call-time choice (CRWL) and run-time choice (term rewriting). There, the semantics was formalized through the @pCRWL calculus, and a program transformation to simulate @pCRWL with term rewriting was proposed. In the present work we use the Maude system to implement that transformation and to get an interpreter for @pCRWL, thus providing a first implementation of this new semantics. Besides, in order to improve the performance of the prototype, an implementation of the natural rewriting on-demand strategy has been developed, therefore taking the first steps towards obtaining a framework for on-demand evaluation of Maude system modules.

[1]  Alexander K. Petrenko,et al.  Electronic Notes in Theoretical Computer Science , 2009 .

[2]  J. S anchez-Hern andez.  A Flexible Framework for Programming with Non-deterministic Functions ? , 2008 .

[3]  Bernd Brassel,et al.  On a Tighter Integration of Functional and Logic Programming , 2007, APLAS.

[4]  Santiago Escobar.  Implementing Natural Rewriting and Narrowing Efficiently , 2004, FLOPS.

[5]  José Meseguer,et al.  Specification and proof in membership equational logic , 2000, Theor. Comput. Sci..

[6]  Heinrich Hussmann,et al.  Nondeterminism in Algebraic Specifications and Algebraic Programs , 1993 .

[7]  José Meseguer,et al.  The Rewriting Logic Semantics Project , 2006, Electron. Notes Theor. Comput. Sci..

[8]  José Meseguer,et al.  Natural Narrowing for General Term Rewriting Systems , 2004, RTA.

[9]  Juan Rodríguez-Hortalá,et al.  A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems , 2008, FSTTCS.

[10]  José Meseguer,et al.  Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic , 2007, Theor. Comput. Sci..

[11]  Peter Sestoft,et al.  Non-Determinism in Functional Languages , 1992, Comput. J..

[12]  Francisco Javier López-Fraguas,et al.  TOY: A Multiparadigm Declarative System , 1999, RTA.

[13]  Francisco Durán,et al.  On-demand Evaluation for Maude , 2005, Electron. Notes Theor. Comput. Sci..

[14]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[15]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[16]  José Meseguer,et al.  Natural Rewriting for General Term Rewriting Systems , 2004, LOPSTR.

[17]  Alex S. Taylor,et al.  Machine intelligence , 2009, CHI.

[18]  David S. Warren.  Higher-Order Extensions to Prolog , 1993 .

[19]  Juan Rodríguez-Hortalá,et al.  A flexible framework for programming with non-deterministicfunctions , 2009, PEPM '09.

[20]  Michael Hanus,et al.  Functional Logic Design Patterns , 2002, FLOPS.

[21]  J. C. Gonz Alez-Moreno,et al.  An Approach to Declarative Programming Based on a Rewriting Logic , 2022 .

[22]  J. S anchez Hern andez.  TO Y: A Multiparadigm Declarative System ? , 1999 .

[23]  Alberto Verdejo,et al.  Deduction, Strategies, and Rewriting , 2007, STRATEGIES@IJCAR.

[24]  Sergio Antoy.  Definitional Trees , 1992, ALP.