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=212
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some complexity bounds for subtype inequalities
Marcin Benke
Theoretical Computer Science
212
(1-2), 1999, pp. 3-27
Infinite
\lambda
-calculus and types
Alessandro Berarducci
,
Mariangiola Dezani-Ciancaglini
Theoretical Computer Science
212
(1-2), 1999, pp. 29-75
Functional-logic integration via minimal reciprocal extensions
Harold Boley
Theoretical Computer Science
212
(1-2), 1999, pp. 77-99
Matching for the lambda calculus of objects
Viviana Bono
,
Michele Bugliesi
Theoretical Computer Science
212
(1-2), 1999, pp. 101-140
Permutability of proofs in intuitionistic sequent calculi
Roy Dyckhoff
,
Luís Pinto
Theoretical Computer Science
212
(1-2), 1999, pp. 141-155
Extending the type checker of Standard ML by polymorphic recursion
Martin Emms
,
Hans Leiss̈
Theoretical Computer Science
212
(1-2), 1999, pp. 157-181
Semantical analysis of perpetual strategies in
\lambda
-calculus
Furio Honsell
,
Marina Lenisa
Theoretical Computer Science
212
(1-2), 1999, pp. 183-209
Orders, reduction graphs and spectra
B. Intrigila
,
M. Venturini Zilli
Theoretical Computer Science
212
(1-2), 1999, pp. 211-231
An algebraic view of the Böhm-out technique
Adolfo Piperno
Theoretical Computer Science
212
(1-2), 1999, pp. 233-246
Termination of permutative conversions in intuitionistic Gentzen calculi
Helmut Schwichtenberg
Theoretical Computer Science
212
(1-2), 1999, pp. 247-260
On functions preserving levels of approximation: A refined model construction for various lambda calculi
Dieter Spreen
Theoretical Computer Science
212
(1-2), 1999, pp. 261-303