Theoretical Computer Science logo Elsevier logo

Publisher: Elsevier

Volume 139, Number 1, 6 March 1995
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

On Gabbay's temporal fixed point operator
pp. 1-25(25)
Author: Hodkinson I.

On the logic of UNITY
pp. 27-67(41)
Author: Pappinghaus P.

Strong categorical datatypes II: A term logic for categorical programming
pp. 69-113(45)
Authors: Cockett J.R.B.; Spencer D.

Nonsymmetric *-autonomous categories
pp. 115-130(16)
Author: Barr M.

Divergence of F=< type checking
pp. 131-162(32)
Author: Ghelli G.

Sharing out control in distributed processes
pp. 163-186(24)
Author: Bergeron A.

Studying equivalences of transition systems with algebraic tools
pp. 187-205(19)
Author: Malacaria P.

A combinatory logic approach to higher-order E-unification
pp. 207-242(36)
Authors: Dougherty D.J.; Johann P.

Computable concurrent processes
pp. 243-273(31)
Author: Moschovakis Y.N.

Observational specifications and the indistinguishability assumption
pp. 275-314(40)
Authors: Bernot G.; Bidoit M.; Knapik T.

Deciding observational congruence of finite-state CCS expressions by rewriting
pp. 315-354(40)
Authors: Inverardi P.; Nesi M.

Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
pp. 355-362(8)
Author: Weiermann A.

< 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