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=135
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Proofs as processes
Samson Abramsky
Theoretical Computer Science
135
(1), 1994, pp. 5-9
On the
\pi
-calculus and linear logic
G. Bellin
,
P.J. Scott
Theoretical Computer Science
135
(1), 1994, pp. 11-65
On proof normalization in linear logic
Didier Galmiche
,
Guy Perrier
Theoretical Computer Science
135
(1), 1994, pp. 67-110
Head linear reduction and pure proof net extraction
G.F. Mascari
,
M. Pedicini
Theoretical Computer Science
135
(1), 1994, pp. 111-137
First-order linear logic without modalities ist NEXPTIME-hard
P. Lincoln
,
A. Scedrov
Theoretical Computer Science
135
(1), 1994, pp. 139-153
Constant-only multiplicative linear logic is NP-complete
Patrick Lincoln
,
Timothy Winkler
Theoretical Computer Science
135
(1), 1994, pp. 155-169
Denotational semantics in the cpo and metric approach
Christian Baier
,
Mila E. Majster-Cederbaum
Theoretical Computer Science
135
(2), 1994, pp. 171-220
Functorial theory of parameterized specifications in a general specification framework
Hartmut Ehrig
,
Martin Große-Rhode
Theoretical Computer Science
135
(2), 1994, pp. 221-266
An algebraic approach to semantics of programming languages
Alexey L. Lastovetsky
,
Sergey S. Gaissaryan
Theoretical Computer Science
135
(2), 1994, pp. 267-288
Labelled domains and automata with concurrency
Felipe Bracho
,
Manfred Droste
Theoretical Computer Science
135
(2), 1994, pp. 289-318
Automatizing termination proofs of recursively defined functions
Pascal Manoury
,
Marianne Simonot
Theoretical Computer Science
135
(2), 1994, pp. 319-343
Weights for total division orderings on strings
E.A. Scott
Theoretical Computer Science
135
(2), 1994, pp. 345-359
Some complexity results on transition systems and elementary net systems
Kunihiko Hiraishi
Theoretical Computer Science
135
(2), 1994, pp. 361-376
Fair Petri nets and structural induction for rings of processes
Jianan Li
,
Ichiro Suzuki
,
Masafumi Yamashita
Theoretical Computer Science
135
(2), 1994, pp. 377-404
Combinatory abstraction using
B
,
B
' and friends
Peter Trigg
,
J. Roger Hindley
,
Martin W. Bunder
Theoretical Computer Science
135
(2), 1994, pp. 405-422
The Inf function in the system
F
R. David
Theoretical Computer Science
135
(2), 1994, pp. 423-431