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=105
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the relations between stable and well-founded semantics of logic programs
Phan Minh Dung
Theoretical Computer Science
105
, 1992, pp. 7-25
Transforming normal logic programs to constraint logic programs
Kanchana Kanchanasut
,
Peter J. Stuckey
Theoretical Computer Science
105
, 1992, pp. 27-56
Equivalence-preserving first-order unfold/fold transformation systems
Taisuke Sato
Theoretical Computer Science
105
, 1992, pp. 57-84
Unfolding and fixpoint semantics of concurrent constraint logic programs
Maurizio Gabbrielli
,
Giorgio Levi
Theoretical Computer Science
105
, 1992, pp. 85-128
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Dieter Hofbauer
Theoretical Computer Science
105
, 1992, pp. 129-140
Multimodal logic programming using equational and order-sorted logic
Françoise Debart
,
Patrice Enjalbert
,
Madeleine Lescot
Theoretical Computer Science
105
, 1992, pp. 141-166
Inferring the equivalence of functional programs that mutate data
Ian Mason
,
Carolyn Talcott
Theoretical Computer Science
105
, 1992, pp. 167-215
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
Joseph A. Goguen
,
José Meseguer
Theoretical Computer Science
105
, 1992, pp. 217-273
Data types with errors and exceptions
Ming-Hua Zhang
Theoretical Computer Science
105
, 1992, pp. 275-299