An approach to declarative programming based on a rewriting logic
From MaRDI portal
Publication:4700443
DOI10.1016/S0743-1066(98)10029-8zbMath0942.68060OpenAlexW2063521547MaRDI QIDQ4700443
M. Teresa Hortalá-González, Juan Carlos Gonzalez-Moreno, Francisco J. López Fraguas, Mario Rodríguez Artalejo
Publication date: 1 November 1999
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0743-1066(98)10029-8
Related Items
Rewriting logic: Roadmap and bibliography, From Logic to Functional Logic Programs, Compiling a Functional Logic Language: The Fair Scheme, On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP, Constraint functional logic programming over finite domains, Database query languages and functional logic programming, Improving the Efficiency of Non-Deterministic Computations1 1Supported in part by NSF grants INT-9981317 and CCR-0110496 and by the Spanish Knowledge Society Foundation, the Spanish Research Funding Agency (CICYT) TIC 2001-2705-C03-01, by Acción Integrade Hispano-Italiana HI2000-0161, and the Valencian Research Council under grant GV01-424., A new generic scheme for functional logic programming with constraints, A Relation Algebraic Semantics for a Lazy Functional Logic Language, On a Tighter Integration of Functional and Logic Programming, Default rules for Curry, Unnamed Item, Unnamed Item, Operational semantics for declarative multi-paradigm languages, Evaluation strategies for functional logic programming, Transforming Functional Logic Programs into Monadic Functional Programs, An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry, Functional Logic Programming in Maude, Singular and plural functions for functional logic programming, Rewriting and narrowing for constructor systems with call-time choice semantics, Functional Logic Programming: From Theory to Curry, Unnamed Item, Unnamed Item, Purely functional lazy nondeterministic programming, Programming with narrowing: a tutorial, A liberal type system for functional logic programs, A declarative framework for object-oriented programming with genetic inheritance, Rewriting and Call-Time Choice: The HO Case, A Fully Abstract Semantics for Constructor Systems, Reduction Strategies for Declarative Programming, A Declarative Debugging System for Lazy Functional Logic Programs, Comparing Meseguer's Rewriting Logic with the Logic CRWL, Denotation by Transformation, Semantic Determinism and Functional Logic Program Properties, Lazy Context Cloning for Non-Deterministic Graph Rewriting, Extra Variables Can Be Eliminated from Functional Logic Programs, Equivalence of Two Formal Semantics for Functional Logic Programs, A Framework for Interpreting Traces of Functional Logic Computations, Implementing Dynamic-Cut in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">T</mml:mi></mml:math>OY
Uses Software
