default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Structures in Computer Science, Volume 27
Volume 27, Number 1, January 2017
- Francisco Marmolejo
, A. Vázquez-Márquez:
No-iteration mixed distributive laws. 1-16 - Bosheng Song, Tao Song, Linqiang Pan:
A time-free uniform solution to subset sum problem by tissue P systems with cell division. 17-32 - Svetlana Jaksic, Jovanka Pantovic, Silvia Ghilezan:
Linked data privacy. 33-53 - Zoltán Ésik:
Equational axioms associated with finite automata for fixed point operations in cartesian categories. 54-69 - Geoff S. H. Cruttwell:
Cartesian differential categories revisited. 70-91
Volume 27, Number 2, February 2017
- Mariangiola Dezani, Sabrina Mantaci, Marinella Sciortino:
Preface. 92-93
- Davide Ancona, Paola Giannini, Elena Zucca:
Type safe incremental rebinding. 94-122 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Structure and properties of strong prefix codes of pictures. 123-142 - Tanver Athar, Carl Barton, Widmer Bland, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Fast circular dictionary-matching algorithm. 143-156 - Daniela Battaglino, Mathilde Bouvel, Andrea Frosini, Simone Rinaldi:
Permutation classes and polyomino classes with excluded submatrices. 157-183 - Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki:
A Gray code for cross-bifix-free sets. 184-196 - Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
On lookahead equilibria in congestion games. 197-214 - Stefano Bistarelli, Francesco Santini:
On merging two trust-networks in one with bipolar preferences. 215-233 - Sara Brunetti, Gennaro Cordasco, Elena Lodi, Luisa Gargano, Walter Quattrociocchi:
Multi-level dynamo and opinion spreading. 234-256 - Julien Clément, Laura Giambruno:
Representing prefix and border tables: results on enumeration. 257-276 - Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Filippo Mignosi:
The longest common substring problem. 277-295 - Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Set-syllogistics meet combinatorics. 296-310
Volume 27, Number 3, March 2017
- Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Generalizations of the distributed Deutsch-Jozsa promise problem. 311-331 - Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic:
A rewriting framework and logic for activities subject to regulations. 332-375 - Arno Pauly:
Many-one reductions and the category of multivalued functions. 376-404 - Benedetto Intrigila, Richard Statman:
Lambda theories allowing terms with a finite number of fixed points. 405-427 - Walter Ferrer Santos, Jonas Frey, Mauricio Guillermo, Octavio Malherbe, Alexandre Miquel:
Ordered combinatory algebras and realizability. 428-458
Volume 27, Number 4, May 2017
- Achim Jung, Guo-Qiang Zhang:
Preface. 459
- Xuechong Guan, Yongming Li, Jürg Kohlas:
On conditions for semirings to induce compact information algebras. 460-469 - Lankun Guo, Qingguo Li, Petko Valtchev, Yaping Lin:
Representation of algebraic domains by formal association rule systems. 470-490 - Weng Kin Ho:
Characterising E-projectives via Comonads. 491-506 - Xiaoyong Xi, Dongsheng Zhao:
Well-filtered spaces and their dcpo models. 507-515 - Wei Yao:
Lattice-valued Scott topology on dcpos. 516-529 - Wenfeng Zhang, Xiaoquan Xu:
A completion-invariant extension of the concept of meet continuous lattices. 530-539 - Haoran Zhao, Hui Kou:
A stable universal domain related to $\mathbb{T}$ω. 540-556
Volume 27, Number 5, June 2017
- Stefano Guerrini, Henk Barendrengt, Adolfo Piperno:
Computing with lambda-terms: A special issue dedicated to Corrado Böhm for his 90th birthday. 557-559
- Ugo de'Liguoro:
The approximation theorem for the Λμ-calculus. 560-580 - Damiano Mazza:
Infinitary affine proofs. 581-602 - Mario Coppo, Mariangiola Dezani-Ciancaglini, Ines Margaria, Maddalena Zacchi:
Isomorphism of intersection and union types. 603-625 - Luca Paolini, Mauro Piccolo, Simona Ronchi Della Rocca:
Essential and relational models. 626-650 - Paul-André Melliès:
The parametric continuation monad. 651-680 - Paula Severi, Fer-Jan de Vries:
The infinitary lambda calculus of the infinite eta Böhm trees. 681-733 - Rick Statman:
Taming the wild ant-lion; a counterexample to a conjecture of Böhm. 734-737 - Jean-Jacques Lévy:
Redexes are stable in the λ-calculus. 738-750 - Samson Abramsky, Viktor Winschel:
Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting. 751-761 - J. M. E. Hyland:
Classical lambda calculus in modern dress. 762-781 - Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
Clocked lambda calculus. 782-806 - Gérard P. Huet, Benoît Razet:
Computing with relational machines. 807-826 - Jean-Yves Girard:
Transcendental syntax I: deterministic case. 827-849
Volume 27, Number 6, September 2017
- Tobias Fritz:
Resource convertibility and ordered commutative monoids. 850-938 - Michele Pagani, Paolo Tranquilli:
The conservation theorem for differential nets. 939-992 - Federico Aschieri:
Constructive forcing, CPS translations and witness extraction in Interactive realizability. 993-1031 - Jean Goubault-Larrecq:
Isomorphism theorems between models of mixed choice. 1032-1067 - Mauricio Guillermo, Étienne Miquey:
Classical realizability and arithmetical formulæ. 1068-1107
Volume 27, Number 7, October 2017
- Ernst-Erich Doberkat, Alexander Kurz:
Foreword: special issue on coalgebraic logic. 1108-1110
- Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva:
Well-founded coalgebras, revisited. 1111-1131 - Dexter Kozen, Alexandra Silva:
Practical coinduction. 1132-1152 - Alexander Kurz, Jirí Velebil:
Quasivarieties and varieties of ordered algebras: regularity and exactness. 1153-1194 - Dusko Pavlovic, Bertfried Fauser:
Smooth coalgebra: testing vector analysis. 1195-1235 - Jurriaan Rot, Filippo Bonchi, Marcello M. Bonsangue, Damien Pous, Jan Rutten, Alexandra Silva:
Enhanced coalgebraic bisimulation. 1236-1264 - Pedro Sánchez Terraf:
Bisimilarity is not Borel. 1265-1284
Volume 27, Number 8, December 2017
- Hajime Ishihara, Margarita V. Korovina, Arno Pauly, Monika Seisenberger, Dieter Spreen:
Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013. 1285-1286
- Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
On computability and disintegration. 1287-1314 - Edwin J. Beggs, José Félix Costa, Diogo Poças, John V. Tucker:
Computations with oracles that measure vanishing quantities. 1315-1363 - Ulrich Berger, Tie Hou:
A realizability interpretation of Church's simple theory of types. 1364-1385 - Christine Gaßner:
Computation over algebraic structures and a classification of undecidable problems. 1386-1413 - Vassilios Gregoriades, Tamás Kispéter, Arno Pauly:
A comparison of concepts from computable analysis and effective descriptive set theory. 1414-1436 - Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
On the computational complexity of the Dirichlet Problem for Poisson's Equation. 1437-1465 - Margarita V. Korovina, Oleg V. Kudinov:
Computable elements and functions in effectively enumerable topological spaces. 1466-1494 - Robert Rettinger:
Effective Riemann mappings of multiply connected domains and Riemann surfaces. 1495-1520 - Vladimir Sazonov:
On naturally continuous non-dcpo domains. 1521-1552 - Victor L. Selivanov:
Towards a descriptive theory of cb0-spaces. 1553-1580 - Stanislav O. Speranski:
Quantifying over events in probability logic: an introduction. 1581-1600 - Dieter Spreen:
Some results related to the continuity problem. 1601-1624 - Yasuyuki Tsukamoto, Hideki Tsuiki:
Properties of domain representations of spaces through dyadic subbases. 1625-1638
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 2026-01-29 02:28 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:
