default search action
Theoretical Computer Science, Volume 309
Volume 309, Numbers 1-3, 2 December 2003
- Thomas Ehrhard, Laurent Regnier:
The differential lambda-calculus. 1-41 - Peter Selinger:
Order-incompleteness and finite lambda reduction models. 43-63 - Vashti Galpin:
A format for semantic equivalence comparison. 65-109 - Thomas Forster:
Better-quasi-orderings and coinduction. 111-123 - Claudio Hermida, Paulo Mateus:
Paracategories I: internal paracategories and saturated partial algebras. 125-156 - Paul H. B. Gardiner:
Power simulation and its relation to traces and failures refinement. 157-176 - Dirk Pattinson:
Coalgebraic modal logic: soundness, completeness and decidability of local consequence. 177-193 - Sándor Vágvölgyi:
Right-linear half-monadic term rewrite systems. 195-211 - Lutz Straßburger:
MELL in the calculus of structures. 213-285 - Zhaohui Zhu, Xian Xiao, Yong Zhou, Wujia Zhu:
Normal conditions for inference relations and injective models. 287-311 - Jan A. Bergstra, Alban Ponse, Mark van der Zwaag:
Branching time and orthogonal bisimulation equivalence. 313-355 - Francisco Durán, José Meseguer:
Structured theories and institutions. 357-380 - Daniel Kirsten, Jerzy Marcinkowski:
Two techniques in the area of the star problem in trace monoids. 381-412 - Bernard Boigelot:
On iterating linear transformations over recognizable sets of integers. 413-468 - Dan R. Ghica, Guy McCusker:
The regular-language semantics of second-order idealized ALGOL. 469-502 - Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini:
Concurrency in timed automata. 503-527 - Markus Lohrey:
Realizability of high-level message sequence charts: closing the gaps. 529-554
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.