default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFundamenta Informaticae, Volume 19
Volume 19, Number 1/2, September, October 1993
- Val Tannen, Albert R. Meyer:
Conservativity of Equational Theories in Typed Lambda Calculi. Fundam. Informaticae 19(1/2): 1-49 (1993) - Pierre-Louis Curien:
Substitution up to Isomorphism. Fundam. Informaticae 19(1/2): 51-85 (1993) - Paola Giannini, Furio Honsell, Simona Ronchi Della Rocca:
Type Inference: Some Results, Some Problems. Fundam. Informaticae 19(1/2): 87-125 (1993) - Lalita Jategaonkar, John C. Mitchell:
Type Inference with Extended Pattern Matching and Subtypes. Fundam. Informaticae 19(1/2): 127-165 (1993) - Daniel Leivant, Jean-Yves Marion:
Lambda Calculus Characterizations of Poly-Time. Fundam. Informaticae 19(1/2): 167-184 (1993) - Frank Pfenning:
On the Undecidability of Partial Polymorphic Type Reconstruction. Fundam. Informaticae 19(1/2): 185-199 (1993) - Pawel Urzyczyn:
Primitive Recursion with Extential Types. Fundam. Informaticae 19(1/2): 201-222 (1993)
Volume 19, Number 3/4, November, December 1993
- Hiroshi Sakai:
On a Framework for Logic Programming with Incomplete Information. Fundam. Informaticae 19(3/4): 223-234 (1993) - Cecylia Rauszer:
Dependencies in Relaional Databases Algebraic and Logical Approch. Fundam. Informaticae 19(3/4): 235-274 (1993) - Andrzej Biela:
Retrieval System and Dynamic Algorithm Looking for Axioms of Notions Defined by Programs. Fundam. Informaticae 19(3/4): 275-301 (1993) - Mark Levene, George Loizou:
A Fully Precise Null Extended Nested Relational Algebra. Fundam. Informaticae 19(3/4): 303-342 (1993) - Jiri Novotný, Miroslav Novotný:
On Dependence in Wille's Contexts. Fundam. Informaticae 19(3/4): 343-353 (1993) - Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun:
Deletion Sets. Fundam. Informaticae 19(3/4): 355-370 (1993) - Gabriele Marongiu, Sauro Tulipani:
Undecidable Fragments of Term Algebras with Subterm Relation. Fundam. Informaticae 19(3/4): 371-382 (1993) - Amihood Amir, Carl H. Smith:
The Syntax of Parallelism. Fundam. Informaticae 19(3/4): 383-402 (1993) - David Murphy:
Time and Duration in Nininterleaving Concurrency. Fundam. Informaticae 19(3/4): 403-416 (1993) - Wiktor Danko:
The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure is Decidable with Respect to Its Diagram. Fundam. Informaticae 19(3/4): 417-431 (1993)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
