TAPSOFT '89 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

24

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540509394, 9783540461166

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Local model checking in the modal mu-calculus

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_144 ◽

1989 ◽

pp. 369-383 ◽

Author(s):

Colin Stirling ◽

David Walker

Keyword(s):

Model Checking ◽

Local Model ◽

Local Model Checking

Download Full-text

Independence of negative constraints

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_122 ◽

1989 ◽

pp. 19-27 ◽

Author(s):

J. L. Lassez ◽

K. McAloon

Download Full-text

Order-sorted completion: The many-sorted way

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_136 ◽

1989 ◽

pp. 244-258 ◽

Author(s):

Harald Ganzinger

Keyword(s):

Download Full-text

Proofs of declarative properties of logic programs

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_134 ◽

1989 ◽

pp. 207-226 ◽

Author(s):

Pierre Deransart

Keyword(s):

Download Full-text

Inductive proofs by resolution and paramodulation

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_143 ◽

1989 ◽

pp. 352-368

Author(s):

Peter Padawitz

Download Full-text

Continuation semantics for PROLOG with cut

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_132 ◽

1989 ◽

pp. 178-192 ◽

Author(s):

A. Bruin ◽

E. P. Vink

Download Full-text

The varieties of programming language

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_121 ◽

1989 ◽

pp. 1-18 ◽

Author(s):

C. A. R. Hoare

Keyword(s):

Programming Language

Download Full-text

Some applications and techniques for generating functions

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_141 ◽

1989 ◽

pp. 321-336 ◽

Author(s):

P. Massazza ◽

N. Sabadini

Keyword(s):

Generating Functions

Download Full-text

The subsequence graph of a text

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_127 ◽

1989 ◽

pp. 104-118 ◽

Author(s):

Ricardo A. Baeza-Yates

Download Full-text

Decidable boundedness problems for hyperedge-replacement graph grammars

TAPSOFT '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-50939-9_138 ◽

1989 ◽

pp. 275-289 ◽

Author(s):

Annegret Habel ◽

Hans-Jörg Kreowski ◽

Walter Vogler

Keyword(s):

Graph Grammars ◽

Hyperedge Replacement

Download Full-text