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: Journal=Theor.~Comput.~Sci. AND Volume=146
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of lambda definability in categorical models of implicit polymorphism
Moez Alimohamed
Theoretical Computer Science
146
(1-2), 1995, pp. 5-23
Structural operational semantics for weak bisimulations
Bard Bloom
Theoretical Computer Science
146
(1-2), 1995, pp. 25-68
Properties of a first-order functional language with sharing
Zena M. Ariola
,
Arvind
Theoretical Computer Science
146
(1-2), 1995, pp. 69-108
Compilation of the ELECTRE reactive language into finite transition systems
Franck Cassez
,
Olivier Roux
Theoretical Computer Science
146
(1-2), 1995, pp. 109-143
Bottom-up evaluation and query optimization of well-founded models
David B. Kemp
,
Divesh Srivastava
,
Peter J. Stuckey
Theoretical Computer Science
146
(1-2), 1995, pp. 145-184
Formalizing Dijkstra's predicate transformer
wp
in weak second-order logic
Rudolf Berghammer
,
Birgit Elbl
,
Ulf Schmerl
Theoretical Computer Science
146
(1-2), 1995, pp. 185-197
Towards a foundation of completion procedures as semidecision procedures
Maria Paola Bonacina
,
Jieh Hsiang
Theoretical Computer Science
146
(1-2), 1995, pp. 199-242
A complete and recursive feature theory
Rolf Backofen
,
Gert Smolka
Theoretical Computer Science
146
(1-2), 1995, pp. 243-268
Argument reduction by factoring
J.F. Naughton
,
R. Ramakrishnan
,
Y. Sagiv
,
J.D. Ullman
Theoretical Computer Science
146
(1-2), 1995, pp. 269-310
A fixed-point theorem in a category of compact metric spaces
Fabio Alessi
,
Paolo Baldan
,
Gianna Bellè
Theoretical Computer Science
146
(1-2), 1995, pp. 311-320
A finitely presented monoid which has solvable word problem but has no regular complete presentation
Yuji Kobayashi
Theoretical Computer Science
146
(1-2), 1995, pp. 321-329
On maximal stable functions
Guo-Qiang Zhang
Theoretical Computer Science
146
(1-2), 1995, pp. 331-339
Late and early semantics coincide for testing
Anna Ingólfsdóttir
Theoretical Computer Science
146
(1-2), 1995, pp. 341-349