A matching process modulo a theory of categorical products

DOI10.1007/3-540-53162-9_45zbMath1493.68100OpenAlexW1555052368MaRDI QIDQ5096201

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Equational problems and disunification
• A system which automatically improves programs
• A unification algorithm for typed \(\bar\lambda\)-calculus
• 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“
• On the Axiomatization of “If-Then-Else”
• An Efficient Unification Algorithm
• Can programming be liberated from the von Neumann style?