CAAP '92 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

19

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540552512, 9783540467991

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A complete type inference algorithm for simple intersection types

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_6 ◽

1992 ◽

pp. 102-123 ◽

Cited By ~ 4

Author(s):

M. Coppo ◽

P. Giannini

Keyword(s):

Type Inference ◽

Inference Algorithm ◽

Complete Type ◽

Intersection Types

Download Full-text

CTL* and ECTL* as fragments of the modal μ-calculus

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_8 ◽

1992 ◽

pp. 145-164 ◽

Cited By ~ 6

Author(s):

Mads Dam

Download Full-text

Decidability of reachability and disjoint union of term rewriting systems

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_5 ◽

1992 ◽

pp. 86-101 ◽

Cited By ~ 1

Author(s):

Anne -Cécile Caron

Keyword(s):

Disjoint Union ◽

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

A linear algorithm for solving fixed-point equations on transition systems

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_18 ◽

1992 ◽

pp. 322-341 ◽

Cited By ~ 13

Author(s):

Bart Vergauwen ◽

Johan Lewi

Keyword(s):

Fixed Point ◽

Transition Systems ◽

Linear Algorithm

Download Full-text

Beyond conditional equations

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_19 ◽

1992 ◽

pp. 342-361 ◽

Cited By ~ 1

Author(s):

Uwe Wolter ◽

Michael Löwe

Download Full-text

Modulo counting quantifiers over finite trees

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_15 ◽

1992 ◽

pp. 265-278 ◽

Cited By ~ 2

Author(s):

Andreas Potthoff

Download Full-text

Empty stack Pushdown ω-tree automata

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_14 ◽

1992 ◽

pp. 248-264

Author(s):

Wuxu Peng ◽

S. Purushothaman

Keyword(s):

Tree Automata

Download Full-text

Must preorder in non-deterministic untyped λ-calculus

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_11 ◽

1992 ◽

pp. 203-220 ◽

Cited By ~ 2

Author(s):

U. De'Liguoro ◽

A. Piperno

Download Full-text

Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topologies

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_10 ◽

1992 ◽

pp. 182-202

Author(s):

W. -J. Hsu ◽

C. V. Page ◽

J. Liu

Download Full-text

Graph grammars as context-dependent rewriting systems: A partial ordering semantics

CAAP '92 - Lecture Notes in Computer Science ◽

10.1007/3-540-55251-0_13 ◽

1992 ◽

pp. 232-247 ◽

Cited By ~ 7

Author(s):

Ugo Montanari ◽

Francesca Rossi

Keyword(s):

Partial Ordering ◽

Graph Grammars ◽

Rewriting Systems ◽

Ordering Semantics ◽

Context Dependent

Download Full-text