• Home
  • Search
  • A rewrite-based computational model for functional logic programming
  • https://doi.org/10.29007/3ks9Copy DOI Icon

A rewrite-based computational model for functional logic programming

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Functional logic programming extends the functional programming style with two important features: the possibility to define nondeterministic operations with overlapping rules, and the usage of logic variables in both defining rules and expressions to evaluate. Conditional constructor-based term rewrite systems (CB-CTRSs) emerged as a suitable model for functional logic programs, because they can be easily transformed into an equivalent program in a core language where computations can be performed more efficiently.We consider a recent proposal by Antoy and Hanus, of translating CB-CTRSs into an equivalent class of programs where computation can be performed by mere rewriting. His computational model has the limitation of computing only ground answer substitutions for equations with strict semantics interpreted as joinability to a value.We propose two adjustments of their computational models, which are capable to compute non-ground answers.

Similar Papers
  • Book Chapter
  • Citations1

Default Rules for Curry

  • Jan 01, 2016
  • Sergio Antoy +1
  • Research Article
  • Citations8

Default rules for Curry

  • Jul 01, 2016
  • Theory and Practice of Logic Programming
  • Sergio Antoy +1
  • Research Article
  • Citations101

Partial evaluation of functional logic programs

  • Jul 01, 1998
  • ACM Transactions on Programming Languages and Systems
  • María Alpuente +2
  • Research Article
  • Citations4

Verification by Reduction to Functional Programs

  • Jan 01, 2017
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne)
  • Régis Blanc
  • Book Chapter
  • Citations15

Transforming Functional Logic Programs into Monadic Functional Programs

  • Jan 01, 2011
  • Bernd Braßel +3
  • Research Article
  • Citations24

Specialization of functional logic programs based on needed narrowing

  • May 01, 2005
  • Theory and Practice of Logic Programming
  • María Alpuente +3
  • Book Chapter
  • Citations2

A Relational Algebra for Functional Logic Deductive Databases

  • Jan 01, 2004
  • Jesús Manuel Almendros-Jiménez +1
  • Book Chapter

Logicality of conditional rewrite systems

  • Jan 01, 1997
  • Toshiyuki Yamada +3
  • Research Article
  • Citations5

Function definitions in term rewriting and applicative programming

  • Dec 01, 1986
  • Information and Control
  • Chilukuri K Mohan +1
  • Research Article
  • Citations33

Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language

  • Nov 18, 2010
  • Journal of Visual Languages & Computing
  • Steffen Mazanek +1
  • Conference Article
  • Citations34

Specialization of inductively sequential functional logic programs

  • Sep 01, 1999
  • María Alpuente +3
  • Research Article
  • Citations29

A proof theoretic approach to failure in functional logic programming

  • Jan 01, 2004
  • Theory and Practice of Logic Programming
  • Francisco J López-Fraguas +1
  • Book Chapter
  • Citations3

Qualified Computations in Functional Logic Programming

  • Jan 01, 2009
  • Rafael Caballero +2
  • Research Article
  • Citations1

The Interactive Curry Observation Debugger iCODE

  • May 30, 2007
  • Electronic Notes in Theoretical Computer Science
  • Parissa H Sadeghi +1
  • Research Article
  • Citations14

Should ML be Object-Oriented?

  • Jul 01, 2002
  • Formal Aspects of Computing
  • David Macqueen
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.