default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 40 matches
- 2011
- Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot theories: a new perspective on the equational properties of iteration. Math. Struct. Comput. Sci. 21(2): 417-480 (2011) - Jirí Adámek, Vera Trnková:
Initial algebras and terminal coalgebras in many-sorted sets. Math. Struct. Comput. Sci. 21(2): 481-509 (2011) - Robin Adams, Zhaohui Luo:
A pluralist approach to the formalisation of mathematics. Math. Struct. Comput. Sci. 21(4): 913-942 (2011) - Andrea Asperti, Jeremy Avigad:
Zen and the art of formalisation. Math. Struct. Comput. Sci. 21(4): 679-682 (2011) - Gilles Barthe, Pedro R. D'Argenio, Tamara Rezk:
Secure information flow by self-composition. Math. Struct. Comput. Sci. 21(6): 1207-1252 (2011) - Yves Bertot, Frédérique Guilhot, Assia Mahboubi:
A formal study of Bernstein coefficients and polynomials. Math. Struct. Comput. Sci. 21(4): 731-761 (2011) - Marta Bílková, Jirí Velebil, Yde Venema:
On monotone modalities and adjointness. Math. Struct. Comput. Sci. 21(2): 383-416 (2011) - 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. Math. Struct. Comput. Sci. 21(4): 827-859 (2011) - Pierre Boudes:
Non-uniform (hyper/multi)coherence spaces. Math. Struct. Comput. Sci. 21(1): 1-40 (2011) - Xiaojuan Cai, Yuxi Fu:
The λ-calculus in the π-calculus. Math. Struct. Comput. Sci. 21(5): 943-996 (2011) - James Cheney, Amal Ahmed, Umut A. Acar:
Provenance as dependency analysis. Math. Struct. Comput. Sci. 21(6): 1301-1337 (2011) - David Clark, Roberto Giacobazzi, Chunyan Mu:
Foreword: programming language interference and dependence. Math. Struct. Comput. Sci. 21(6): 1109-1110 (2011) - Claudio Sacerdoti Coen, Enrico Tassi:
Formalising Overlap Algebras in Matita. Math. Struct. Comput. Sci. 21(4): 763-793 (2011) - Roy L. Crole:
The representational adequacy of Hybrid. Math. Struct. Comput. Sci. 21(3): 585-646 (2011) - Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
On the computational complexity of dynamic slicing problems for program schemas. Math. Struct. Comput. Sci. 21(6): 1339-1362 (2011) - Ernst-Erich Doberkat, Alexander Kurz:
Foreword: special issue on coalgebraic logic. Math. Struct. Comput. Sci. 21(2): 171-174 (2011) - Ernst-Erich Doberkat, Christoph Schubert:
Coalgebraic logic over general measurable spaces - a survey. Math. Struct. Comput. Sci. 21(2): 175-234 (2011) - Zoltán Ésik, Tamás Hajgató:
Dagger extension theorem. Math. Struct. Comput. Sci. 21(5): 1035-1066 (2011) - Murdoch James Gabbay:
Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables. Math. Struct. Comput. Sci. 21(5): 997-1033 (2011) - Jean Goubault-Larrecq, Klaus Keimel:
Choquet-Kendall-Matheron theorems for non-Hausdorff spaces. Math. Struct. Comput. Sci. 21(3): 511-561 (2011) - Alessio Guglielmi, Lutz Straßburger:
A system of interaction and structure V: the exponentials and splitting. Math. Struct. Comput. Sci. 21(3): 563-584 (2011) - Helle Hvid Hansen, Bartek Klin:
Pointwise extensions of GSOS-defined operations. Math. Struct. Comput. Sci. 21(2): 321-361 (2011) - John Harrison:
A formal proof of Pick's Theorem. Math. Struct. Comput. Sci. 21(4): 715-729 (2011) - Ichiro Hasuo, Bart Jacobs:
Traces for coalgebraic components. Math. Struct. Comput. Sci. 21(2): 267-320 (2011) - Gérard P. Huet:
Preface. Math. Struct. Comput. Sci. 21(4): 671-677 (2011) - Mihnea Iancu, Florian Rabe:
Formalising foundations of mathematics. Math. Struct. Comput. Sci. 21(4): 883-911 (2011) - Panagis Karazeris, Apostolos Matzaris, Jirí Velebil:
Final coalgebras in accessible categories. Math. Struct. Comput. Sci. 21(5): 1067-1108 (2011) - Mateusz Kostanek, Pawel Waszkiewicz:
The formal ball model for -categories. Math. Struct. Comput. Sci. 21(1): 41-64 (2011) - Jimmie Lawson:
Stably compact spaces. Math. Struct. Comput. Sci. 21(1): 125-169 (2011) - Rory B. B. Lucyshyn-Wright:
Domains occur among spaces as strict algebras among lax. Math. Struct. Comput. Sci. 21(3): 647-670 (2011)
skipping 10 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-27 22:21 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint