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 YEAR=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Formal parametric polymorphism
M. Abadi
,
L. Cardelli
,
P.-L. Curien
Theoretical Computer Science
121
(1-2), 1993, pp. 9-58
Constructive proofs of the range property in lambda calculus
Henk Barendregt
Theoretical Computer Science
121
(1-2), 1993, pp. 59-69
Some new results on easy lambda-terms
Alessandro Berarducci
,
Benedetto Intrigila
Theoretical Computer Science
121
(1-2), 1993, pp. 71-88
Computational foundations of basic recursive function theory
Robert L. Constable
,
Scott F. Smith
Theoretical Computer Science
121
(1-2), 1993, pp. 89-112
Type inference, abstract interpretation and strictness analysis
Mario Coppo
,
Alberto Ferrari
Theoretical Computer Science
121
(1-2), 1993, pp. 113-143
An analysis of Böhm's theorem
Gérard Huet
Theoretical Computer Science
121
(1-2), 1993, pp. 145-167
General recursive functions in a very simply interpretable typed
\lambda
-calculus
G. Jacopini
,
G. Sontacchi
Theoretical Computer Science
121
(1-2), 1993, pp. 169-178
Historical introduction to ``Concrete domains'' by G. Kahn and G.D. Plotkin
Stephen Brookes
Theoretical Computer Science
121
(1-2), 1993, pp. 179-186
Concrete domains
G. Kahn
,
G.D. Plotkin
Theoretical Computer Science
121
(1-2), 1993, pp. 187-277
Combinatory reduction systems: introduction and survey
Jan Willem Klop
,
Vincent van Oostrom
,
Femke van Raamsdonk
Theoretical Computer Science
121
(1-2), 1993, pp. 279-308
Functions over free algebras definable in the simply typed lambda calculus
Daniel Leivant
Theoretical Computer Science
121
(1-2), 1993, pp. 309-321
The genericity theorem and parametricity in the polymorphic
\lambda
-calculus
Giuseppe Longo
,
Kathleen Milsted
,
Sergei Soloviev
Theoretical Computer Science
121
(1-2), 1993, pp. 323-349
Set-theoretical and other elementary models of the
\lambda
-calculus
Gordon D. Plotkin
Theoretical Computer Science
121
(1-2), 1993, pp. 351-409
A type-theoretical alternative to ISWIM, CUCH, OWHY
Dana S. Scott
Theoretical Computer Science
121
(1-2), 1993, pp. 411-440
Some examples of non-existent combinators
Rick Statman
Theoretical Computer Science
121
(1-2), 1993, pp. 441-448
Equality and abductive residua for Horn clauses
E. Knill
,
P.T. Cox
,
T. Pietrzykowski
Theoretical Computer Science
120
(1), 1993, pp. 1-44
Legality concepts for three-valued logic programs
G. Nota
,
S. Orefice
,
G. Pacini
,
F. Ruggiero
,
G. Tortora
Theoretical Computer Science
120
(1), 1993, pp. 45-68
On the status of proving program properties in effective interpretations
Michaƚ Grabowski
Theoretical Computer Science
120
(1), 1993, pp. 69-81
A class of programs for which SLDNF resolution and NAF rule are complete
Stefano Baratella
Theoretical Computer Science
120
(1), 1993, pp. 83-99
The poset of infinitary traces
Paul Gastin
,
Brigitte Rozoy
Theoretical Computer Science
120
(1), 1993, pp. 101-121
``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs
P. Cousot
,
R. Cousot
Theoretical Computer Science
120
(1), 1993, pp. 123-155
Cut formulas in propositional logic
Wenhui Zhang
Theoretical Computer Science
120
(1), 1993, pp. 157-168
Composition is almost (but not quite) as good as s-1-1
Yves Marcoux
Theoretical Computer Science
120
(2), 1993, pp. 169-195
Regular expressions into finite automata
Anne Brüggemann-Klein
Theoretical Computer Science
120
(2), 1993, pp. 197-213
Deriving algorithms on reconfigurable networks based on function decomposition
Gen-Huey Chen
,
Biing-Feng Wang
,
Hungwen Li
Theoretical Computer Science
120
(2), 1993, pp. 215-227
Seiten 1
2
3
4
5
6
7
8
9
10
>