Hostname: page-component-7479d7b7d-wxhwt Total loading time: 0 Render date: 2024-07-11T22:57:23.947Z Has data issue: false hasContentIssue false

Introduction to the special issue: Unification

Published online by Cambridge University Press:  08 October 2020

Mauricio Ayala-Rincón
Affiliation:
Brasília, and Toulouse
Philippe Balbiani
Affiliation:
Brasília, and Toulouse
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In the days of its foundation, the field of science covered by UNIF – a series of annual international workshops on unification – was still in its infancy. With the advent of automated reasoning, term rewriting, logic programming, natural language processing, and program analysis, the areas of computer science concerned by unification were seething with excitement. With the coming out of researches in constraint solving and admissibility of inference rules and with the breaking out of applications, such as type checking, query answering, and cryptographic protocol analysis, the development of unification was not long in going at full speed.

Type
Introduction
Copyright
© The Author(s), 2020. Published by Cambridge University Press