Theoretical Computer Science

Primitive recursion for higher-order abstract syntax
pp. 1-57(57)
Authors: Schurmann¹ C.; Despeyroux J.; Pfenning¹ 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.

On the asymptotic behaviour of primitive recursive algorithms
pp. 159-193(35)
Author: David R.

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: Hashimoto¹ M.; Ohori² A.

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

Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
pp. 311-339(29)
Author: Koubarakis M.

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.

Proof-term synthesis on dependent-type systems via explicit substitutions
pp. 407-440(34)
Author: Munoz¹ C.

Loop checks for logic programs with functions
pp. 441-461(21)
Authors: Shen¹ 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.

A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
pp. 489-512(24)
Authors: Yamasaki S.; Kurose Y.

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: Pucella¹ R.; Panangaden P.

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

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

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

Self-stabilizing &unknown;-exclusion
pp. 653-692(40)
Authors: Abraham U.; Dolev¹ S.; Herman² T.; Koll I.

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

On the longest perpetual reductions in orthogonal expression reduction systems
pp. 737-772(36)
Author: Khasidashvili Z.

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: Ying¹ M.; Wirsing M.

What is the coalgebraic analogue of Birkhoff's variety theorem?
pp. 853-886(34)
Author: Goldblatt R.

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: Turner¹ R.

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

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

Corrigendum to ''On functions preserving levels of approximation: a refined model construction for various lambda calculi'' [Theoret. Comput. Sci. 212 (1999) 261-303]
pp. 997-998(2)
Author: Spreen D.

Author index volume 266 (2001)
pp. 999-1000(2)