default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 266
Volume 266, Number 1-2, September 2001
- Carsten Schürmann, Joëlle Despeyroux, Frank Pfenning:
Primitive recursion for higher-order abstract syntax. 1-57 - Tatsuru Matsushita, Colin Runciman:
The accepting power of unary string logic programs. 59-79 - Gabriel Aguilera
, Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde:
Reductions for non-clausal theorem proving. 81-112 - Klaus U. Schulz, Stephan Kepser:
Combination of constraint systems II: Rational amalgamation. 113-157 - René David:
On the asymptotic behaviour of primitive recursive algorithms. 159-193 - Karl Lermer, Paul A. Strooper:
Refinement and state machine abstraction. 195-235 - Michele Boreale, Rocco De Nicola, Rosario Pugliese:
Divergence in testing and readiness semantics. 237-248 - Masatomo Hashimoto, Atsushi Ohori:
A typed context calculus. 249-272 - David Aspinall, Adriana B. Compagnoni:
Subtyping dependent types. 273-309 - Manolis Koubarakis:
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning. 311-339 - Ralph Loader:
Finitary PCF is not decidable. 341-364 - Duminda Wijesekera, M. Ganesh, Jaideep Srivastava, Anil Nerode:
Normal forms and syntactic completeness proofs for functional independencies. 365-405 - César A. Muñoz:
Proof-term synthesis on dependent-type systems via explicit substitutions. 407-440 - Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You:
Loop checks for logic programs with functions. 441-461 - Michel Bauderon, Hélène Jacquet:
Node rewriting in graphs and hypergraphs: a categorical framework. 463-487 - Susumu Yamasaki, Yoshinori Kurose:
A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics. 489-512 - Annabelle McIver, Carroll Morgan:
Partial correctness for probabilistic demonic programs. 513-541 - Riccardo Pucella, Prakash Panangaden:
On the expressive power of first-order boolean functions in PCF. 543-567 - Cédric Fournet, Cosimo Laneve:
Bisimulations in the join-calculus. 569-603 - Jirí Srba:
Basic process algebra with deadlocking states. 605-630 - Jan Friso Groote, Jos van Wamel:
The parallel composition of uniform processes with data. 631-652 - Uri Abraham, Shlomi Dolev, Ted Herman, Irit Koll:
Self-stabilizing l-exclusion. 653-692 - James Riely, Matthew Hennessy:
Distributed processes and location failures. 693-735 - Zurab Khasidashvili:
On the longest perpetual reductions in orthogonal expression reduction systems. 737-772 - Gilles Barthe, John Hatcliff, Morten Heine Sørensen:
An induction principle for pure type systems. 773-818 - Karl Schlechta, Jürgen Dix:
Explaining updates by minimal sums. 819-838 - Mingsheng Ying, Martin Wirsing:
Recursive equations in higher-order process calculi. 839-852 - Robert Goldblatt:
What is the coalgebraic analogue of Birkhoff's variety theorem? 853-886 - Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano:
Sparse and limited wavelength conversion in all-optical tree networks. 887-934 - Mila E. Majster-Cederbaum:
Underspecification for a simple process algebra of recursive processes. 935-950 - Raymond Turner:
Type inference for set theory. 951-974 - Thierry Joly:
Constant time parallel computations in lambda-calculus. 975-985 - Thomas Krantz, Virgile Mogbil:
Encoding Hamiltonian circuits into multiplicative linear logic. 987-996 - Dieter Spreen:
Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". 997-998
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-16 21:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
