[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc. Press

0818608536

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the consistency of 'truly concurrent' operational and denotational semantics

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5112 ◽

2003 ◽

Cited By ~ 14

Author(s):

P. Degano ◽

R. De Nicola ◽

U. Montanari

Keyword(s):

Denotational Semantics

Download Full-text

Complete axiomatizations of the algebras of finite, rational and infinite trees

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5132 ◽

2003 ◽

Cited By ~ 78

Author(s):

M.J. Maher

Keyword(s):

Infinite Trees

Download Full-text

Proof-theoretic techniques for term rewriting theory

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5108 ◽

2003 ◽

Cited By ~ 19

Author(s):

N. Dershowitz ◽

M. Okada

Keyword(s):

Term Rewriting

Download Full-text

Characterization of typings in polymorphic type discipline

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5101 ◽

2003 ◽

Cited By ~ 21

Author(s):

P. Giannini ◽

S.R. Della Rocca

Keyword(s):

Polymorphic Type

Download Full-text

Efficient parallel algorithms for anti-unification and relative complement

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5109 ◽

2003 ◽

Cited By ~ 6

Author(s):

G.M. Kuper ◽

K.W. McAloon ◽

K.V. Palem ◽

K.J. Perry

Keyword(s):

Parallel Algorithms ◽

Relative Complement

Download Full-text

The notion of a framework and a framework for LTC

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5136 ◽

2003 ◽

Author(s):

P.F. Mendler ◽

P. Aczel

Download Full-text

Unification in free extensions of Boolean rings and Abelian groups

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5110 ◽

2003 ◽

Author(s):

A. Boudet ◽

J.-P. Jouannaud ◽

M. Schmidt-Schauss

Keyword(s):

Abelian Groups ◽

Boolean Rings

Download Full-text

The strength of the subset type in Martin-Lof's type theory

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5135 ◽

2003 ◽

Cited By ~ 2

Author(s):

A. Salveson ◽

J.M. Smith

Keyword(s):

Type Theory

Download Full-text

A modal process logic

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5119 ◽

2003 ◽

Cited By ~ 161

Author(s):

K.G. Larsen ◽

B. Thomsen

Download Full-text

A category of labelled Petri nets and compositional proof system

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science ◽

10.1109/lics.1988.5113 ◽

2003 ◽

Cited By ~ 10

Author(s):

G. Winskel

Keyword(s):

Petri Nets ◽

Proof System

Download Full-text

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc. Press

On the consistency of 'truly concurrent' operational and denotational semantics

Complete axiomatizations of the algebras of finite, rational and infinite trees

Proof-theoretic techniques for term rewriting theory

Characterization of typings in polymorphic type discipline

Efficient parallel algorithms for anti-unification and relative complement

The notion of a framework and a framework for LTC

Unification in free extensions of Boolean rings and Abelian groups

The strength of the subset type in Martin-Lof's type theory

A modal process logic

A category of labelled Petri nets and compositional proof system

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
Latest Publications