A unification algorithm for typed \(\bar\lambda\)-calculus
type: Item
instance of: scholarly article
title: A unification algorithm for typed \(\bar\lambda\)-calculus
zbMATH Open document ID: 0332.02035
DOI: 10.1016/0304-3975(75)90011-0
published in: Theoretical Computer Science
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 3518772
author: Gérard Huet
MaRDI profile type: Publication
full work available at URL: 0304-3975(75)90011-0
OpenAlex ID: W2034676877
cites work: Resolution in type theory
cites work: A formulation of the simple theory of types
cites work: Q5677084
cites work: Q5686017
cites work: Q5663463
cites work: The undecidability of unification in third order logic
cites work: Application à la viscoélasticité non linéaire du calcul symbolique à plusieurs variables
cites work: Mechanizing \(\omega\)-order type theory through unification
cites work: A Complete Mechanization of Second-Order Type Theory
cites work: Q5624683
cites work: A Machine-Oriented Logic Based on the Resolution Principle
description: scientific article; zbMATH DE number 3518772