C-expressions: A variable-free calculus for equational logic programming

DOI10.1016/0304-3975(93)90170-XzbMath0779.68014OpenAlexW2047596129MaRDI QIDQ1208416

M. Eugenia Occhiuto, Marco Bellia

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90170-x

zbMATH Keywords

term rewritingfunctional and logic languagesvariable free syntax

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (2)

Declarative Compilation for Constraint Logic Programming ⋮ Constraint logic programming with a relational machine

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Properties of substitutions and unifications
• The occur-check problem in Prolog
• Linear unification
• How to invent a Prolog machine
• Suprema of open and closed formulas and their application to resolution
• On the sequential nature of unification
• A logical reconstruction of Prolog II
• The relation between logic and functional languages: a survey
• The occur-check problem revisited
• Logic and functional programming by retractions : operational semantics
• An implementation of narrowing
• An Efficient Unification Algorithm
• A verified prolog compiler for the Warren Abstract Machine
• A new implementation technique for applicative languages
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: C-expressions: A variable-free calculus for equational logic programming