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: Series=LNCS AND Volume=700
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A partial solution for
D
-unification based on a reduction to
AC1
-unification
Evelyne Contejean
Lecture Notes in Computer Science
700
, 1993, pp. 621-632
Efficient analysis of concurrent constraint logic programs
Michael Codish
,
Moreno Falaschi
,
Kim Marriott
,
William Winsborough
Lecture Notes in Computer Science
700
, 1993, pp. 633-644
A confluent reduction for the extensional typed
\lambda
-calculus with pairs, sums, recursion and terminal object
Roberto di Cosmo
,
Delia Kesner
Lecture Notes in Computer Science
700
, 1993, pp. 645-656
Modularity of termination and confluence in combinations of rewrite systems with
\lambda_{\omega}
Franco Barbanera
,
Maribel Fernández
Lecture Notes in Computer Science
700
, 1993, pp. 657-668
From domains to automata with concurrency
Felipe Bracho
,
Manfred Droste
Lecture Notes in Computer Science
700
, 1993, pp. 669-681
Seiten
<
1
2
3