![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Mathematical Structures in Computer Science, Volume 21
Volume 21, Number 1, February 2011
- Pierre Boudes:
Non-uniform (hyper/multi)coherence spaces. 1-40 - Mateusz Kostanek, Pawel Waszkiewicz:
The formal ball model for -categories. 41-64 - Samuel Mimram
:
The structure of first-order causality. 65-110 - Hervé Perdry, Peter Schuster
:
Noetherian orders. 111-124 - Jimmie Lawson:
Stably compact spaces. 125-169
Volume 21, Number 2, April 2011
- Ernst-Erich Doberkat, Alexander Kurz
:
Foreword: special issue on coalgebraic logic. 171-174
- Ernst-Erich Doberkat, Christoph Schubert:
Coalgebraic logic over general measurable spaces - a survey. 175-234 - Lutz Schröder
, Dirk Pattinson:
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. 235-266 - Ichiro Hasuo
, Bart Jacobs:
Traces for coalgebraic components. 267-320 - Helle Hvid Hansen
, Bartek Klin
:
Pointwise extensions of GSOS-defined operations. 321-361 - Jirí Velebil, Alexander Kurz
:
Equational presentations of functors and monads. 363-381 - Marta Bílková
, Jirí Velebil, Yde Venema:
On monotone modalities and adjointness. 383-416 - Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot theories: a new perspective on the equational properties of iteration. 417-480 - Jirí Adámek, Vera Trnková:
Initial algebras and terminal coalgebras in many-sorted sets. 481-509
Volume 21, Number 3, June 2011
- Jean Goubault-Larrecq, Klaus Keimel:
Choquet-Kendall-Matheron theorems for non-Hausdorff spaces. 511-561 - Alessio Guglielmi
, Lutz Straßburger:
A system of interaction and structure V: the exponentials and splitting. 563-584 - Roy L. Crole:
The representational adequacy of Hybrid. 585-646 - Rory B. B. Lucyshyn-Wright:
Domains occur among spaces as strict algebras among lax. 647-670
Volume 21, Number 4, August 2011
- Gérard P. Huet:
Preface. 671-677
- Andrea Asperti
, Jeremy Avigad
:
Zen and the art of formalisation. 679-682 - Ioana Pasca:
Formal proofs for theoretical properties of Newton's method. 683-714 - John Harrison:
A formal proof of Pick's Theorem. 715-729 - Yves Bertot, Frédérique Guilhot, Assia Mahboubi:
A formal study of Bernstein coefficients and polynomials. 731-761 - Claudio Sacerdoti Coen
, Enrico Tassi:
Formalising Overlap Algebras in Matita. 763-793 - Bas Spitters
, Eelis van der Weegen:
Type classes for mathematics in type theory. 795-825 - Frédéric Blanqui
, Adam Koprowski:
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. 827-859 - Russell O'Connor:
Classical mathematics for a constructive world. 861-882 - Mihnea Iancu, Florian Rabe
:
Formalising foundations of mathematics. 883-911 - Robin Adams
, Zhaohui Luo:
A pluralist approach to the formalisation of mathematics. 913-942
Volume 21, Number 5, October 2011
- Xiaojuan Cai, Yuxi Fu:
The λ-calculus in the π-calculus. 943-996 - Murdoch James Gabbay
:
Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables. 997-1033 - Zoltán Ésik, Tamás Hajgató:
Dagger extension theorem. 1035-1066 - Panagis Karazeris, Apostolos Matzaris, Jirí Velebil:
Final coalgebras in accessible categories. 1067-1108
Volume 21, Number 6, December 2011
- David Clark
, Roberto Giacobazzi, Chunyan Mu:
Foreword: programming language interference and dependence. 1109-1110
- Ana Almeida Matos
, Jan Cederquist
:
Non-disclosure for distributed mobile code. 1111-1181 - Geoffrey Smith, Rafael Alpízar:
Non-termination and secure information flow. 1183-1205 - Gilles Barthe
, Pedro R. D'Argenio
, Tamara Rezk:
Secure information flow by self-composition. 1207-1252 - Isabella Mastroeni
, Anindya Banerjee:
Modelling declassification policies using abstract domain completeness. 1253-1299 - James Cheney
, Amal Ahmed
, Umut A. Acar:
Provenance as dependency analysis. 1301-1337 - Sebastian Danicic, Robert M. Hierons
, Michael R. Laurence:
On the computational complexity of dynamic slicing problems for program schemas. 1339-1362
![](https://dblp.org/img/cog.dark.24x24.png)
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.