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=266
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Primitive recursion for higher-order abstract syntax
Carsten Schürmann
,
Joëlle Despeyroux
,
Frank Pfenning
Theoretical Computer Science
266
(1-2), 2001, pp. 1-57
The accepting power of unary string logic programs
Tatsuru Matsushita
,
Colin Runciman
Theoretical Computer Science
266
(1-2), 2001, pp. 59-79
Reductions for non-clausal theorem proving
G. Aguilera
,
I.P. de Guzmán
,
M. Ojeda-Aciego
,
A. Valverde
Theoretical Computer Science
266
(1-2), 2001, pp. 81-112
Combination of constraint systems II: Rational amalgamation
Klaus U. Schulz
,
Stephan Kepser
Theoretical Computer Science
266
(1-2), 2001, pp. 113-157
On the asymptotic behaviour of primitive recursive algorithms
René David
Theoretical Computer Science
266
(1-2), 2001, pp. 159-193
Refinement and state machine abstraction
Karl Lermer
,
Paul Strooper
Theoretical Computer Science
266
(1-2), 2001, pp. 195-235
Divergence in testing and readiness semantics
Michele Boreale
,
Rocco De Nicola
,
Rosario Pugliese
Theoretical Computer Science
266
(1-2), 2001, pp. 237-248
A typed context calculus
Masatomo Hashimoto
,
Atsushi Ohori
Theoretical Computer Science
266
(1-2), 2001, pp. 249-272
Subtyping dependent types
David Aspinall
,
Adriana Compagnoni
Theoretical Computer Science
266
(1-2), 2001, pp. 273-309
Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
Manolis Koubarakis
Theoretical Computer Science
266
(1-2), 2001, pp. 311-339
Finitary PCF is not decidable
Ralph Loader
Theoretical Computer Science
266
(1-2), 2001, pp. 341-364
Normal forms and syntactic completeness proofs for functional independencies
Duminda Wijesekera
,
M. Ganesh
,
Jaideep Srivastava
,
Anil Nerode
Theoretical Computer Science
266
(1-2), 2001, pp. 365-405
Proof-term synthesis on dependent-type systems via explicit substitutions
César Muñoz
Theoretical Computer Science
266
(1-2), 2001, pp. 407-440
Loop checks for logic programs with functions
Yi-Dong Shen
,
Li-Yan Yuan
,
Jia-Huai You
Theoretical Computer Science
266
(1-2), 2001, pp. 441-461
Node rewriting in graphs and hypergraphs: A categorical framework
Michel Bauderon
,
Hélène Jacquet
Theoretical Computer Science
266
(1-2), 2001, pp. 463-487
A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
Susumu Yamasaki
,
Yoshinori Kurose
Theoretical Computer Science
266
(1-2), 2001, pp. 489-512
Partial correctness for probabilistic demonic programs
A.K. MecIver
,
Carroll Morgan
Theoretical Computer Science
266
(1-2), 2001, pp. 513-541
On the expressive power of first-order Boolean function in PCF
Riccardo Pucella
,
Prakash Panangaden
Theoretical Computer Science
266
(1-2), 2001, pp. 543-567
Bisimulations in the join-calculus
Cédric Fournet
,
Cosimo Laneve
Theoretical Computer Science
266
(1-2), 2001, pp. 569-603
Basic process algebra with deadlocking states
Jiȓí Srba
Theoretical Computer Science
266
(1-2), 2001, pp. 605-630
The parallel composition of uniform processes with data
Jan Friso Groote
,
Jos van Wamel
Theoretical Computer Science
266
(1-2), 2001, pp. 631-652
Self-stabilizing
l
-exlusion
Uri Abraham
,
Shlomi Dolev
,
Ted Herman
,
Irit Koll
Theoretical Computer Science
266
(1-2), 2001, pp. 653-692
Distributed processes and location failures
James Riely
,
Matthew Hennessy
Theoretical Computer Science
266
(1-2), 2001, pp. 693-735
On the longest perpetual reductions in orthogonal expression reduction systems
Zurab Khasidashvili
Theoretical Computer Science
266
(1-2), 2001, pp. 737-772
An induction principle for pure type systems
Gilles Barthe
,
John Hatcliff
,
Morten Heine B. Srenson
Theoretical Computer Science
266
(1-2), 2001, pp. 773-818
Seiten 1
2
>