Functional unification of higher-order patterns

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

66 Scopus citations

Abstract

The complete development of a unification algorithm for so-called higher-order patterns, a subclass of λ-terms, is presented. The starting point is a formulation of unification by transformation, the result a directly executable functional program. In a final development step the result is adapted to λ-terms in de Bruijn's notation. The algorithms work for both simply typed and untyped terms.

Original languageEnglish
Title of host publicationLogic in Computer Science
PublisherPubl by IEEE
Pages64-72
Number of pages9
ISBN (Print)0818631422, 9780818631429
DOIs
StatePublished - 1993
EventProceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science - Montreal, Quebec, Can
Duration: 19 Jun 199323 Jun 1993

Publication series

NameProceedings - Symposium on Logic in Computer Science

Conference

ConferenceProceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science
CityMontreal, Quebec, Can
Period19/06/9323/06/93

Fingerprint

Dive into the research topics of 'Functional unification of higher-order patterns'. Together they form a unique fingerprint.

Cite this