A matching process modulo a theory of categorical products

DOI10.1007/3-540-53162-9_45zbMATH Open1493.68100OpenAlexW1555052368MaRDI QIDQ5096201FDOQ5096201

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

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

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)

Cites Work

• Title not available (Why is that?)
• An Efficient Unification Algorithm
• A unification algorithm for typed \(\bar\lambda\)-calculus
• Equational problems and disunification
• Proving and applying program transformations expressed with second-order patterns
• Can programming be liberated from the von Neumann style?
• A system which automatically improves programs
• Title not available (Why is that?)
• Rewriting systems on FP expressions to reduce the number of sequences yielded
• Varieties of ”If-Then-Else“
• On the Axiomatization 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)