Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Structures in Computer Science, Volume 15
Volume 15, Number 1, February 2005
- Paolo Baldan, Andrea Corradini
, Hartmut Ehrig, Reiko Heckel:
Compositional semantics for open Petri nets based on deterministic processe. 1-35 - Frédéric Blanqui:
Definitions by rewriting in the Calculus of Constructions. 37-92 - Jan J. M. M. Rutten:
A coinductive calculus of streams. 93-147 - Alexander Kurz, Jirí Rosický:
Operations and equations for coalgebras. 149-166 - Stefano Berardi:
Classical logic as limit completion. 167-200
Volume 15, Number 2, April 2005
- Patricia Johann:
On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi. 201-229 - Matthieu Picantin:
Garside monoids vs divisibility monoids. 231-242 - Robert Goldblatt:
A comonadic account of behavioural covarieties of coalgebras. 243-269 - Jean Goubault-Larrecq:
Extensions of valuations. 271-297 - Dieter Spreen:
The largest Cartesian closed category of domains, considered constructively. 299-321 - Masahito Hasegawa:
Classical linear logic of implications. 323-342 - Maribel Fernández, Ian Mackie, François-Régis Sinot:
Closed reduction: explicit substitutions without alpha-conversion. 343-381 - K. Subramani:
Periodic Linear Programming with applications to real-time scheduling. 383-406
Volume 15, Number 3, June 2005
- Lawrence S. Moss:
Introduction: special issue on selected papers from the Fifth Workshop on Coalgebraic Methods in Computer Science. 407-408 - Jirí Adámek, Stefan Milius, Jirí Velebil:
A general final coalgebra theorem. 409-432 - Neil Ghani, Christoph Lüth, Federico De Marchi:
Monads of coalgebras: rational terms and term graphs. 433-451 - Alexander Kurz, Dirk Pattinson:
Coalgebraic modal logic of finite rank. 453-473 - James Worrell:
A note on coalgebras and presheaves. 475-483 - Johannes Borgström, Uwe Nestmann:
On bisimulations for the spi calculus. 487-552 - Gian Luca Cattani, Glynn Winskel:
Profunctors, open maps and bisimulation. 553-614
Volume 15, Number 4, August 2005
- Thomas Ehrhard:
Finiteness spaces. 615-646 - Ernst-Erich Doberkat:
Semi-pullbacks for stochastic relations over analytic spaces. 647-670 - Ana Bove, Venanzio Capretta:
Modelling general recursion in type theory. 671-708 - Lars Birkedal, Rasmus Ejlers Møgelberg:
Categorical models for Abadi and Plotkin's logic for parametricity. 709-772 - Giorgio Busatto, Hans-Jörg Kreowski, Sabine Kuske:
Abstract hierarchical graph transformation. 773-819
Volume 15, Number 5, October 2005
- Sergei Soloviev:
Foreword. 821-823 - Roberto Di Cosmo:
A short survey of isomorphisms of types. 825-838 - Gilles Barthe:
A computational view of implicit coercions in type theory. 839-874 - David Chemouil:
Isomorphisms of simple inductive types through extensional rewriting. 875-915 - Joseph Gil, Yoav Zibin:
Efficient algorithms for isomorphisms of simple types. 917-957 - Bernard Lang:
Matching with multiplication and exponentiation (extended abstract). 959-968 - Olivier Laurent:
Classical isomorphisms of types. 969-1004
Volume 15, Number 6, December 2005
- Robin Milner:
Axioms for bigraphical structure. 1005-1032 - Didier Galmiche, Daniel Méry, David J. Pym:
The semantics of BI and resource tableaux. 1033-1088 - Maria Emilia Maietti:
Modular correspondence between dependent type theories and categories including pretopoi and topoi. 1089-1149 - Sergey Slavnov:
From proof-nets to bordisms: the geometric meaning of multiplicative connectives. 1151-1178
a service of 
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 2024-04-17 20:31 CEST 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:
