default search action
Mathematical Structures in Computer Science, Volume 18
Volume 18, Number 1, February 2008
- Flavio Corradini, Carlo Toffalori:
Preface to Special Issue devoted to the memory of Sauro Tulipani. 1-4 - Luca Aceto, Taolue Chen
, Wan J. Fokkink
On the axiomatisability of priority. 5-28 - Marco Bernardo
A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems. 29-55 - Andrea Capotorti
Comparative uncertainty: theory and automation. 57-79 - Agata Ciabattoni
Towards an algorithmic construction of cut-elimination procedures. 81-105 - Rocco De Nicola
Multiple-Labelled Transition Systems for nominal calculi and their logics. 107-143 - Ying Gao, Jingde Cheng:
Semantics for a basic relevant logic with intensional conjunction and disjunction (and some of its extensions). 145-164 - Ivan Gerace, Federico Greco:
The Travelling Salesman Problem in symmetric circulant matrices with two stripes. 165-175 - Giacomo Lenzi
A positive set theory with equality revisited. 177-188 - Angus Macintyre:
Model theory of exponentials on Lie algebras. 189-204 - Roland Hildebrand
Combinatorial laplacians and positivity under partial transpose. 205-219
Volume 18, Number 2, April 2008
- Mario Coppo, Mariangiola Dezani-Ciancaglini, Elio Giovannetti:
Types for ambient and process mobility. 221-290 - Cristobal Rojas
Computability and information in models of randomness and chaos. 291-307 - Zofia Kostrzycka
On asymptotic divergency in equivalential logics. 311-324 - Michel Bidoit, Donald Sannella
Observational interpretation of Casl specifications. 325-371 - Jan A. Bergstra, Cornelis A. Middelburg
Maurer computers for pipelined instruction processing. 373-409 - Maik Friedel, Swetlana Nikolajewa, Thomas Wilhelm:
The Decomposition Tree for analyses of Boolean functions. 411-426
Volume 18, Number 3, June 2008
- Horatiu Cirstea, Maribel Fernández
Rewriting calculi, higher-order reductions and patterns: introduction. 427-429 - Benjamin Wack, Clément Houtmann:
Strong normalisation in two Pure Pattern Type Systems. 431-465 - Luigi Liquori
iRho: an imperative rewriting calculus. 467-500 - David Sabel
A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations. 501-553 - Steffen van Bakel
Computation with classical sequents. 555-609 - Ernie Manes, Philip S. Mulry:
Monad compositions II: Kleisli strength. 613-643
Volume 18, Number 4, August 2008
- Ralph Matthes
Preface to the special issue: isomorphisms of types and invertibility of lambda terms. 645-646 - Joachim De Lataillade:
Curry-style type isomorphisms and game semantics. 647-692 - David Chemouil
An insertion operator preserving infinite reduction sequences. 693-728 - Zhaohui Luo:
Coercions in a polymorphic type system. 729-751 - Aleksy Schubert:
On the building of affine retractions. 753-793
Volume 18, Number 5, October 2008
- Adriana B. Compagnoni, Healfdene Goguen:
Theory and applications of subtyping: Introduction. 795-796 - Andreas Abel:
Polarised subtyping for sized types. 797-822 - Manuel Fähndrich, Jakob Rehof:
Type-based flow analysis and context-free language reachability. 823-894 - Simon J. Gay:
Bounded polymorphism in session types. 895-930 - Zhaohui Luo, Robin Adams
Structural subtyping for inductive types with functorial equality rules. 931-972 - Antonio Bucciarelli, Antonino Salibra
Graph lambda theories. 975-1004 - Francesca Cagliari
Exponentiable morphisms of domains. 1005-1016
Volume 18, Number 6, December 2008
- José Miguel Cañete Valdeón
On the interpretation of mathematical entities in the formalisation of programming and modelling languages. 1017-1030 - Jens Blanck:
Reducibility of domain representations and Cantor-Weihrauch domain representations. 1031-1056 - Jos C. M. Baeten, Mario Bravetti:
A ground-complete axiomatisation of finite-state processes in a generic process algebra. 1057-1089 - Matthew Collinson, David J. Pym, Edmund Robinson:
Bunched polymorphism. 1091-1132 - Patrick Dehornoy, Vincent van Oostrom
Using groups for investigating rewrite systems. 1133-1167 - Jean Goubault-Larrecq, Slawomir Lasota
Logical relations for monadic types. 1169-1217
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-11-15 19:22 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: