default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 59
Volume 59, 1988
- Pier Giorgio Bosco, Elio Giovannetti, Corrado Moiso:
Narrowing vs. SLD-Resolution. 3-23 - Gérard Boudol, Ilaria Castellani
:
Concurrency and Atomicity. 25-84 - Val Tannen, Thierry Coquand:
Extensional Models for Polymorphism. 85-114 - Michael C. Browne, Edmund M. Clarke, Orna Grumberg:
Characterizing Finite Kripke Structures in Propositional Temporal Logic. 115-131 - Wlodzimierz Drabent, Jan Maluszynski:
Inductive Assertion Method for Logic Programs. 133-155 - Yves Lafont:
The Linear Abstract Machine. 157-180 - Simona Ronchi Della Rocca:
Principal Type Scheme and Unification for Intersection Type Discipline. 181-209 - Wim H. Hesselink:
Interpretations of Recursion under Unbounded Nondeterminacy. 211-234 - Wim H. Hesselink:
Deadlock and Fairness in Morphisms of Transition Systems. 235-257 - Alan Scottedward Hodel, Michael C. Loui:
Optimal Dynamic Embedding of X-Trees Into Arrays. 259-276 - K. Kalorkoti:
The Trace Invariant and Matrix Inversion. 277-286 - Manfred Schmidt-Schauß:
Implication of Clauses is Undecidable. 287-296 - Wojciech Rytter:
On Efficient Parallel Computations for some Dynamic Programming Problems. 297-307 - Joost Engelfriet, George Leih:
Nonterminal Bounded NLC Graph Grammars. 309-315 - Allen Stoughton:
Substitution Revisited. 317-325
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-22 19:02 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:
