Fundamenta Informaticae - researchr journal

223	--	234	Hiroshi Sakai. On a Framework for Logic Programming with Incomplete Information
235	--	274	Cecylia Rauszer. Dependencies in Relaional Databases Algebraic and Logical Approch
275	--	301	Andrzej Biela. Retrieval System and Dynamic Algorithm Looking for Axioms of Notions Defined by Programs
303	--	342	Mark Levene, George Loizou. A Fully Precise Null Extended Nested Relational Algebra
343	--	353	Jiri Novotný, Miroslav Novotný. On Dependence in Wille s Contexts
355	--	370	Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun. Deletion Sets
371	--	382	Gabriele Marongiu, Sauro Tulipani. Undecidable Fragments of Term Algebras with Subterm Relation
383	--	402	Amihood Amir, Carl H. Smith. The Syntax of Parallelism
403	--	416	David Murphy. Time and Duration in Nininterleaving Concurrency
417	--	431	Wiktor Danko. The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure is Decidable with Respect to Its Diagram

1	--	49	Val Tannen, Albert R. Meyer. Conservativity of Equational Theories in Typed Lambda Calculi
51	--	85	Pierre-Louis Curien. Substitution up to Isomorphism
87	--	125	Paola Giannini, Furio Honsell, Simona Ronchi Della Rocca. Type Inference: Some Results, Some Problems
127	--	165	Lalita Jategaonkar, John C. Mitchell. Type Inference with Extended Pattern Matching and Subtypes
167	--	184	Daniel Leivant, Jean-Yves Marion. Lambda Calculus Characterizations of Poly-Time
185	--	199	Frank Pfenning. On the Undecidability of Partial Polymorphic Type Reconstruction
201	--	222	Pawel Urzyczyn. Primitive Recursion with Extential Types

External Links