Semi-unification

Socher-Ambrosius, Rolf

Local TagsRelease HistoryDetailsSummary

Semi-unification

Socher-Ambrosius, R.(1992). Semi-unification (MPI-I-92-207). Saarbrücken: Max-Planck-Institut für Informatik.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-B1B8-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002D-E365-4

Genre: Report

Files

show Files

hide Files

:

MPI-I-92-207.pdf (Any fulltext), 62KB

View Save

File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0014-B1BA-D

Name:
MPI-I-92-207.pdf

Description:
-

OA-Status:

Visibility:
Public

MIME-Type / Checksum:
application/pdf / [MD5]

Technical Metadata:

View

Copyright Date:
-

Copyright Info:
-

License:
-

Locators

show

Creators

show

hide

Creators:
Socher-Ambrosius, Rolf¹, Author

Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045

Content

show

hide

Free keywords: -

Abstract: Semi-unifiability is a generalization of both unification and matching. It is used to check nontermination of rewrite rules. In this paper an inference system is presented that decides semi-unifiability of two terms s and t and computes a semi-unifier. In contrast to an algorithm by Kapur, Musser et al, this inference system comes very close to the one for ordinary unification.

Details

show

hide

Language(s): eng - English

Dates: Date issued: 1992

Publication Status: Issued

Pages: 10 p.

Publishing info: Saarbrücken : Max-Planck-Institut für Informatik

Table of Contents: -

Rev. Type: -

Identifiers: Report Nr.: MPI-I-92-207
BibTex Citekey: Socher-Ambrosius92b

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Research Report / Max-Planck-Institut für Informatik

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -