Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Huet, G."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complete sets of unifiers and matchers in equational theories
F. Fages
,
G. Huet
Theoretical Computer Science
43
(2-3), 1986, pp. 189-200
Constructions - A Higher Order Proof System for Mechanizing Mathematics
T. Coquand
,
G. Huet
Proceedings of Eurocal 85, Vol.~1. Lecture Notes in Computer Science
203
, 1985, pp. 151-184
Proofs by induction in equational theories with constructors
G. Huet
,
J.-M. Hullot
Journal of Computer and System Sciences
25
(2), 1982, October, pp. 239-266
Proofs by induction in equational theories with constructors
G. Huet
,
J.M. Hullot
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, FOCS'80 (Syracuse, NY, October 13-15, 1980)
, 1980, pp. 96-107
Confluent reductions: Abstract properties and applications to term rewriting systems
G. Huet
Journal of the ACM
27
(4), 1980, pp. 797-821
Proving and applying program transformations expressed with second-order patterns
G. Huet
,
B. Lang
Acta Informatica
11
(1), 1978, pp. 31-55
An algorithm to generate the basis of solutions to homogeneous linear diophantine equations
G. Huet
Information Processing Letters
7
(3), 1978, April, pp. 144-147
Confluent reductions: Abstract properties and applications to term rewriting systems
G. Huet
Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, FOCS'77 (Providence, RI, October 31 - November 2, 1977)
, 1977, pp. 30-45
A unification algorithm for typed
\lambda
-calculus
G.P. Huet
Theoretical Computer Science
1
(1), 1975, pp. 27-57