Theoretical Computer Science logo Elsevier logo

Publisher: Elsevier

Volume 198, Number 1, 30 May 1998
Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

< previous issue | next issue > | all issues

Equational unification, word unification, and 2nd-order equational unification
pp. 1-47(47)
Authors: Otto F.; Narendran P.; Dougherty D.J.

A notation for lambda terms A generalization of environments
pp. 49-98(50)
Authors: Nadathur G.; Wilson D.S.

A communication hierarchy of parallel computations
pp. 99-130(32)
Author: Geffert V.

A fixpoint approach to finite delay and fairness
pp. 131-158(28)
Author: Hartonas C.

Some congruence properties for pi-calculus bisimilarities
pp. 159-176(18)
Authors: Boreale M.; Sangiorgi D.

Enlargements of functional algebras for the lambda calculus
pp. 177-200(24)
Author: Goldblatt R.

An answer to an open problem of Urquhart
pp. 201-209(9)
Author: Egly U.

Reachability in live and safe free-choice Petri nets is NP-complete
pp. 211-224(14)
Author: Esparza J.

On the coarsest congruence within global-clock-bounded equivalence
pp. 225-237(13)
Author: Corradini F.

Combinatory weak reduction in lambda calculus
pp. 239-247(9)
Authors: Cagman N.; Hindley J.R.

< previous issue | next issue > | all issues

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A