Fundamenta Informaticae
, Volume 19
Volume 19, Number 1/2, September, October 1993
Special Issue: Lambda Calculus and Type Theory
Val Tannen
,
Albert R. Meyer
: Conservativity of Equational Theories in Typed Lambda Calculi. 1-49
BibTeX
Pierre-Louis Curien
: Substitution up to Isomorphism. 51-85
BibTeX
Paola Giannini
,
Furio Honsell
,
Simona Ronchi Della Rocca
: Type Inference: Some Results, Some Problems. 87-125
BibTeX
Lalita Jategaonkar
,
John C. Mitchell
: Type Inference with Extended Pattern Matching and Subtypes. 127-165
BibTeX
Daniel Leivant
,
Jean-Yves Marion
: Lambda Calculus Characterizations of Poly-Time. 167-184
BibTeX
Frank Pfenning
: On the Undecidability of Partial Polymorphic Type Reconstruction. 185-199
BibTeX
Pawel Urzyczyn
: Primitive Recursion with Extential Types. 201-222
BibTeX
Volume 19, Number 3/4, November, December 1993
Hiroshi Sakai
: On a Framework for Logic Programming with Incomplete Information. 223-234
BibTeX
Cecylia Rauszer
: Dependencies in Relaional Databases Algebraic and Logical Approch. 235-274
BibTeX
Andrzej Biela
: Retrieval System and Dynamic Algorithm Looking for Axioms of Notions Defined by Programs. 275-301
BibTeX
Mark Levene
,
George Loizou
: A Fully Precise Null Extended Nested Relational Algebra. 303-342
BibTeX
Jiri Novotný
,
Miroslav Novotný
: On Dependence in Wille's Contexts. 343-353
BibTeX
Lila Kari
,
Alexandru Mateescu
,
Arto Salomaa
,
Gheorghe Paun
: Deletion Sets. 355-370
BibTeX
Gabriele Marongiu
,
Sauro Tulipani
: Undecidable Fragments of Term Algebras with Subterm Relation. 371-382
BibTeX
Amihood Amir
,
Carl H. Smith
: The Syntax of Parallelism. 383-402
BibTeX
David Murphy
: Time and Duration in Nininterleaving Concurrency. 403-416
BibTeX
Wiktor Danko
: The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure is Decidable with Respect to Its Diagram. 417-431
BibTeX
Copyright ©
Sat May 16 23:59:22 2009 by
Michael Ley
(
ley@uni-trier.de
)