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=56
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A polynomial determination of the most-recent property in Pascal-like programs
D. Armbruster
Theoretical Computer Science
56
(1), 1988, January, pp. 3-15
A safe approach to parallel combinator reduction
C. Hankin
,
G. Burn
,
S. Peyton Jones
Theoretical Computer Science
56
(1), 1988, January, pp. 17-36
Rewriting with a nondeterministic choice operator
S. Kaplan
Theoretical Computer Science
56
(1), 1988, January, pp. 37-57
Two-level semantics and code generation
F. Nielson
,
H.R. Nielson
Theoretical Computer Science
56
(1), 1988, January, pp. 59-133
Proving entailment between conceptual state specifications
E.W. Stark
Theoretical Computer Science
56
(1), 1988, January, pp. 135-154
C-tree systolic automata
E. Fachini
,
M. Napoli
Theoretical Computer Science
56
(2), 1988, February, pp. 155-186
A natural semantics for modal logic over databases
W. Marek
Theoretical Computer Science
56
(2), 1988, February, pp. 187-209
On the computational complexity of the abelian permutation group structure, membership and intersection problems
C.S. Iliopoulos
Theoretical Computer Science
56
(2), 1988, February, pp. 211-222
One-step recurrent terms in lambda - beta -calculus
S. Sekimoto
,
S. Hirokawa
Theoretical Computer Science
56
(2), 1988, February, pp. 223-231
Multidimensional unrepetitive configurations
A. Carpi
Theoretical Computer Science
56
(2), 1988, February, pp. 233-241
A remark on the length problem
J. Mohrherr
Theoretical Computer Science
56
(2), 1988, February, pp. 243-248
Complexity, combinatorial group theory and the language of palutators
C. Tretkoff
Theoretical Computer Science
56
(3), 1988, March, pp. 253-275
Delaying unification algorithms for lambda calculi
J. Staples
Theoretical Computer Science
56
(3), 1988, March, pp. 277-288
Subclasses of Presburger arithmetic and the polynomial-time hierarchy
E. Gradel
Theoretical Computer Science
56
(3), 1988, March, pp. 289-301
A quantitative interpretation of Girard's system F
A. Martino
Theoretical Computer Science
56
(3), 1988, March, pp. 303-320
The interchange or pump (DI)lemmas for context-free languages
R. Boonyavatana
,
G. Slutzki
Theoretical Computer Science
56
(3), 1988, March, pp. 321-338
An answer to a question about finite maximal prefix sets of words
V. Bruyere
Theoretical Computer Science
56
(3), 1988, March, pp. 339-344
Unification in commutative idempotent monoids
F. Baader
,
W. Buttner
Theoretical Computer Science
56
(3), 1988, March, pp. 345-353