Contraction algebras and unification of (infinite) terms

DOI10.1016/0022-0000(92)90002-ZzbMath0743.68089OpenAlexW2064891547MaRDI QIDQ1185240

Răzvan Diaconescu

Publication date: 28 June 1992

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(92)90002-z

zbMATH Keywords

logic programmingsemantics of programming languagesunification algorithmregular systems of equationsBanach principle of contractioninfinite termstheory of recursive program schemes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Cites Work

• All solutions of a system of recursion equations in infinite trees and other contraction theories
• Fundamental properties of infinite trees
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Metric interpretations of infinite trees and semantics of non deterministic recursive programs
• An Efficient Unification Algorithm
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Contraction algebras and unification of (infinite) terms