default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 89
Volume 89, Number 1, 1991
- Harald Ganzinger:
Order-Sorted Completion: The Many-Sorted Way. 3-32 - Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. 33-62 - Michael Hanus
:
Horn Clause Programs with Polymorphic Types: Semantics and Resolution. 63-106 - Robert Harper, Robert Pollack:
Type Checking with Universes. 107-136 - Frank Pfenning, Peter Lee:
Metacircularity in the Polymorphic lambda-Calculus. 137-159 - Colin Stirling, David Walker:
Local Model Checking in the Modal mu-Calculus. 161-177 - Chris A. Vissers, Giuseppe Scollo, Marten van Sinderen, Ed Brinksma:
Specification Styles in Distributed Systems Design and Verification. 179-206
Volume 89, Number 2, 1991
- Daniel Krob:
Complete Systems of B-Rational Identities. 207-343
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 2026-08-11 00:20 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
