An implementation of narrowing

DOI10.1016/0743-1066(89)90030-7MaRDI QIDQ3821639zbMATH OpenOpenAlexFDO

Authors Alan Josephson, Nachum Dershowitz

Publication date 1989

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(89)90030-7

zbMATH Keywords

conditional equationsdemonsdirected equationseager rewritingenumerative nondeterminismimplementationlazy narrowinglogic programsredexesRite

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) General topics in the theory of software (68N01)

Recommendations

• scientific article; zbMATH DE number 1761888
• Narrowing directed by a graph of terms
• A needed narrowing strategy
• scientific article; zbMATH DE number 4041327
• Conditional narrowing modulo a set of equations

Cited in

(8)

• C-expressions: A variable-free calculus for equational logic programming
• Logical debugging
• scientific article; zbMATH DE number 4164122 (Why is no real title available?)
• scientific article; zbMATH DE number 4035204 (Why is no real title available?)
• Uniform Lazy Narrowing
• An abstract concurrent machine for rewriting
• Activation through a Narrow Opening
• A rationale for conditional equational programming

This page was built for publication: An implementation of narrowing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3821639)