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 37 matches
- 2020
- Mauricio Ayala-Rincón, Philippe Balbiani:
Introduction to the special issue: Unification. Math. Struct. Comput. Sci. 30(6): 570-571 (2020) - Franz Baader, Pavlos Marantidis, Antoine Mottet, Alexander Okhotin:
Extensions of unification modulo ACUI. Math. Struct. Comput. Sci. 30(6): 597-626 (2020) - John C. Baez, Jade Master:
Open Petri nets. Math. Struct. Comput. Sci. 30(3): 314-341 (2020) - Lars Birkedal, Ranald Clouston, Bassel Mannaa, Rasmus Ejlers Møgelberg, Andrew M. Pitts, Bas Spitters:
Modal dependent type theory and dependent right adjoints. Math. Struct. Comput. Sci. 30(2): 118-138 (2020) - Ales Bizjak, Rasmus Ejlers Møgelberg:
Denotational semantics for guarded dependent type theory. Math. Struct. Comput. Sci. 30(4): 342-378 (2020) - Andreas Blass, Yuri Gurevich:
Witness algebra and anyon braiding. Math. Struct. Comput. Sci. 30(3): 234-270 (2020) - Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. Math. Struct. Comput. Sci. 30(7): 736-751 (2020) - Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin:
SMT-based verification of data-aware processes: a model-theoretic approach. Math. Struct. Comput. Sci. 30(3): 271-313 (2020) - David M. Cerna, Temur Kutsia:
Higher-order pattern generalization modulo equational theories. Math. Struct. Comput. Sci. 30(6): 627-663 (2020) - James Clift, Daniel Murfet:
Encodings of Turing machines in linear logic. Math. Struct. Comput. Sci. 30(4): 379-415 (2020) - James Clift, Daniel Murfet:
Cofree coalgebras and differential linear logic. Math. Struct. Comput. Sci. 30(4): 416-457 (2020) - Pieter Collins:
Computable analysis with applications to dynamic systems. Math. Struct. Comput. Sci. 30(2): 173-233 (2020) - Roy L. Crole:
The nominal/FM Yoneda Lemma. Math. Struct. Comput. Sci. 30(9): 1011-1024 (2020) - Ajay Kumar Eeralla, Christopher Lynch:
Bounded ACh unification. Math. Struct. Comput. Sci. 30(6): 664-682 (2020) - Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Computing knowledge in equational extensions of subterm convergent theories. Math. Struct. Comput. Sci. 30(6): 683-709 (2020) - Alain Finkel, Jean Goubault-Larrecq:
Forward analysis for WSTS, part I: completions. Math. Struct. Comput. Sci. 30(7): 752-832 (2020) - Laura Fontanella, Guillaume Geoffroy:
Preserving cardinals and weak forms of Zorn's lemma in realizability models. Math. Struct. Comput. Sci. 30(9): 976-996 (2020) - Anton Freund:
From Kruskal's theorem to Friedman's gap condition. Math. Struct. Comput. Sci. 30(8): 952-975 (2020) - Mai Gehrke, Daniela Petrisan, Luca Reggio:
Quantifiers on languages and codensity monads. Math. Struct. Comput. Sci. 30(10): 1054-1088 (2020) - Silvio Ghilardi, Luigi Santocanale:
Free Heyting algebra endomorphisms: Ruitenburg's Theorem and beyond. Math. Struct. Comput. Sci. 30(6): 572-596 (2020) - Emmanuel Godard, Eloi Perdereau:
Back to the Coordinated Attack Problem. Math. Struct. Comput. Sci. 30(10): 1089-1113 (2020) - Masahiro Hamano:
A MALL geometry of interaction based on indexed linear logic. Math. Struct. Comput. Sci. 30(10): 1025-1053 (2020) - Bart Jacobs:
A channel-based perspective on conjugate priors. Math. Struct. Comput. Sci. 30(1): 44-61 (2020) - Helmut Jürgensen:
Multisets, heaps, bags, families: What is a multiset? Math. Struct. Comput. Sci. 30(2): 139-158 (2020) - Yunus D. K. Kutz, Manfred Schmidt-Schauß:
Rewriting with generalized nominal unification. Math. Struct. Comput. Sci. 30(6): 710-735 (2020) - Daniel Leivant, Jean-Yves Marion:
Primitive recursion in the abstract. Math. Struct. Comput. Sci. 30(1): 33-43 (2020) - Jean-Simon Pacaud Lemay:
Convenient antiderivatives for differential linear categories. Math. Struct. Comput. Sci. 30(5): 545-569 (2020) - Qingguo Li, Zhenzhu Yuan, Dongsheng Zhao:
A unified approach to some non-Hausdorff topological properties. Math. Struct. Comput. Sci. 30(9): 997-1010 (2020) - Maxime Lucas:
A cubical Squier's theorem. Math. Struct. Comput. Sci. 30(2): 159-172 (2020) - Jade Master:
Petri nets based on Lawvere theories. Math. Struct. Comput. Sci. 30(7): 833-864 (2020)
skipping 7 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-25 00:49 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