Implementation of a UU-algorithm for primitive recursive tree functions

DOI10.1007/3-540-60249-6_55MaRDI QIDQ5055894zbMATH OpenOpenAlexFDO

Authors Heinz Fassbender

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60249-6_55

zbMATH Keywords

equational theoriesuniversal unification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 522849
• scientific article; zbMATH DE number 1332630
• A practically efficient and almost linear unification algorithm
• scientific article; zbMATH DE number 672020
• scientific article; zbMATH DE number 36613

Cites work

• An Efficient Unification Algorithm
• scientific article; zbMATH DE number 4053009 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 672020 (Why is no real title available?)
• Logic programming with functions and predicates: The language Babel
• Modular tree transducers
• The integration of functions into logic programming: From theory to practice
• Unification theory

Cited in

(2)

• scientific article; zbMATH DE number 1332630 (Why is no real title available?)
• scientific article; zbMATH DE number 522849 (Why is no real title available?)

Describes a project that uses

Uses Software

• BABEL

This page was built for publication: Implementation of a UU-algorithm for primitive recursive tree functions

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