Theoretical Computer Science logo Elsevier logo

Publisher: Elsevier

Related content
Volume 266, Number 1, 6 September 2001

< previous issue | all issues | next issue >

Primitive recursion for higher-order abstract syntax
pp. 1-57(57)
Authors: Schurmann1 C.; Despeyroux J.; Pfenning1 F.

The accepting power of unary string logic programs
pp. 59-79(21)
Authors: Matsushita T.; Runciman C.

Reductions for non-clausal theorem proving
pp. 81-112(32)
Authors: Aguilera G.; de Guzman I.P.; Ojeda-Aciego M.; Valverde A.

Combination of constraint systems II: Rational amalgamation
pp. 113-157(45)
Authors: Schulz K.U.; Kepser S.

Refinement and state machine abstraction
pp. 195-235(41)
Authors: Lermer K.; Strooper P.

Divergence in testing and readiness semantics
pp. 237-248(12)
Authors: Boreale M.; Nicola R.D.; Pugliese R.

A typed context calculus
pp. 249-272(24)
Authors: Hashimoto1 M.; Ohori2 A.

Subtyping dependent types
pp. 273-309(37)
Authors: Aspinall D.; Compagnoni1 A.

Finitary PCF is not decidable
pp. 341-364(24)
Author: Loader R.

Normal forms and syntactic completeness proofs for functional independencies
pp. 365-405(41)
Authors: Wijesekera D.; Ganesh M.; Srivastava J.; Nerode A.

Loop checks for logic programs with functions
pp. 441-461(21)
Authors: Shen1 Y.-D.; Yuan L.-Y.; You J.-H.

Node rewriting in graphs and hypergraphs: a categorical framework
pp. 463-487(25)
Authors: Bauderon M.; Jacquet H.

Partial correctness for probabilistic demonic programs
pp. 513-541(29)
Authors: McIver A.K.; Morgan C.

On the expressive power of first-order boolean functions in PCF
pp. 543-567(25)
Authors: Pucella1 R.; Panangaden P.

Bisimulations in the join-calculus
pp. 569-603(35)
Authors: Fournet C.; Laneve1 C.

Basic process algebra with deadlocking states
pp. 605-630(26)
Author: Srba1 J.

The parallel composition of uniform processes with data
pp. 631-652(22)
Authors: Groote1 J.F.; van Wamel J.

Self-stabilizing &unknown;-exclusion
pp. 653-692(40)
Authors: Abraham U.; Dolev1 S.; Herman2 T.; Koll I.

Distributed processes and location failures
pp. 693-735(43)
Authors: Riely J.; Hennessy M.

An induction principle for pure type systems
pp. 773-818(46)
Authors: Barthe G.; Hatcliff J.; Sorensen M.H.B.

Explaining updates by minimal sums
pp. 819-838(20)
Authors: Schlechta K.; Dix J.

Recursive equations in higher-order process calculi
pp. 839-852(14)
Authors: Ying1 M.; Wirsing M.

Sparse and limited wavelength conversion in all-optical tree networks
pp. 887-934(48)
Authors: Auletta V.; Caragiannis I.; Gargano L.; Kaklamanis C.; Persiano P.

Underspecification for a simple process algebra of recursive processes
pp. 935-950(16)
Author: Majster-Cederbaum M.E.

Type inference for set theory
pp. 951-974(24)
Author: Turner1 R.

Constant time parallel computations in lambda-calculus
pp. 975-985(11)
Author: Joly T.

Encoding Hamiltonian circuits into multiplicative linear logic
pp. 987-996(10)
Authors: Krantz T.; Mogbil V.

< previous issue | all issues | next issue >

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page