default search action
Theoretical Computer Science, Volume 311
Volume 311, Numbers 1-3, 23 January 2004
- A. J. Kfoury, J. B. Wells:
Principality and type inference for intersection types using expansion variables. 1-70 - Claudio Hermida, Paulo Mateus:
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory. 71-103 - Felix Joachimski:
Confluence of the coinductive [lambda]-calculus. 105-119 - Atsushi Igarashi, Naoki Kobayashi:
A generic type system for the Pi-calculus. 121-163 - Li Jiao, To-Yat Cheung, Weiming Lu:
On liveness and boundedness of asymmetric choice nets. 165-197 - Yohji Akama:
Limiting partial combinatory algebras. 199-220 - Agostino Dovier, Carla Piazza, Alberto Policriti:
An efficient algorithm for computing bisimulation equivalence. 221-256 - Jirí Adámek, Hans-E. Porst:
On tree coalgebras and coalgebra presentations. 257-283 - Ernst-Erich Doberkat, Eugenio G. Omodeo:
ER modelling from first relational principles. 285-323 - Markus Müller-Olm:
Precise interprocedural dependence analysis of parallel programs. 325-388 - James Bailey, Guozhu Dong, Kotagiri Ramamohanarao:
On the decidability of the termination problem of active database systems. 389-437 - Razvan Diaconescu:
Interpolation in Grothendieck Institutions. 439-461 - Rob J. van Glabbeek, Ursula Goltz:
Well-behaved flow event structures for parallel composition and action refinement. 463-478 - María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal:
Rules + strategies for transforming lazy functional logic programs. 479-525 - Stacy E. Finkelstein, Peter J. Freyd, James Lipton:
Erratum to: "A new framework for declarative programming": [Theoret. Comput. Sci. 300 (2003) 91-160]. 527
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.