A matching process modulo a theory of categorical products

DOI10.1007/3-540-53162-9_45MaRDI QIDQ5096201zbMATH OpenOpenAlexFDO

Authors Françoise Bellegarde

Publication date 16 August 2022

Published in Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53162-9_45

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)

Recommendations

• Matching with multiplication and exponentiation (extended abstract)
• Combining matching algorithms: The regular case
• scientific article; zbMATH DE number 1722712
• scientific article; zbMATH DE number 1696596
• Higher-order matching for program transformation

Cites work

• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 4048997 (Why is no real title available?)
• A system which automatically improves programs
• A unification algorithm for typed \(\bar\lambda\)-calculus
• An Efficient Unification Algorithm
• Can programming be liberated from the von Neumann style?
• Equational problems and disunification
• On the Axiomatization of “If-Then-Else”
• Proving and applying program transformations expressed with second-order patterns
• Rewriting systems on FP expressions to reduce the number of sequences yielded
• Varieties of ”If-Then-Else“

This page was built for publication: A matching process modulo a theory of categorical products

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