Остановите войну!
for scientists:
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 183 matches
- 2005
- Lars Birkedal:
Proceedings of the 10th Conference on Category Theory in Computer Science, CTCS 2004, Copenhagen, Denmark, August 12-14, 2004. Electronic Notes in Theoretical Computer Science 122, Elsevier 2005 [contents] - 2004
- Jirí Adámek, Stefan Milius, Jirí Velebil:
Iterative Algebras for a Base. CTCS 2004: 147-170 - Lars Birkedal:
Preface. CTCS 2004: 1- - Mario Cáccamo, Glynn Winskel:
Limit Preservation from Naturality. CTCS 2004: 3-22 - J. Robin B. Cockett, Craig A. Pastro:
A Language For Multiplicative-additive Linear Logic. CTCS 2004: 23-65 - Ana Paula Lüdtke Ferreira, Leila Ribeiro:
A Graph-based Semantics For Object-oriented Programming Constructs. CTCS 2004: 89-104 - Esfandiar Haghverdi, Philip J. Scott:
From Geometry of Interaction to Denotational Semantics. CTCS 2004: 67-87 - Maria Emilia Maietti:
Reflection Into Models of Finite Decidable FP-sketches in an Arithmetic Universe. CTCS 2004: 105-126 - Paul-André Melliès:
Asynchronous Games 3 An Innocent Model of Linear Logic. CTCS 2004: 171-192 - Sun Meng, Bernhard K. Aichernig, Luís Soares Barbosa, Zhang Naixiao:
A Coalgebraic Semantic Framework for Component-based Development in UML. CTCS 2004: 229-245 - Markus Michelbrink, Anton Setzer:
State Dependent IO-Monads in Type Theory. CTCS 2004: 127-146 - Andrea Schalk, José Juan Palacios Pérez:
Concrete Data Structures as Games. CTCS 2004: 193-210 - Ana Sokolova, Erik P. de Vink, Harald Woracek:
Weak Bisimulation for Action-Type Coalgebras: (Extended Abstract). CTCS 2004: 211-228 - Paul Taylor:
Inside Every Model of Abstract Stone Duality Lies an Arithmetic Universe. CTCS 2004: 247-296 - 2002
- Samson Abramsky, Bob Coecke:
Physical Traces: Quantum vs. Classical Information Processing. CTCS 2002: 1-22 - Jirí Adámek, Stefan Milius, Jirí Velebil:
On Rational Monads and Free Iterative Theories. CTCS 2002: 23-46 - Stephen L. Bloom, Zoltán Ésik:
Unique, guarded fixed points in an additive setting: Extended Abstract. CTCS 2002: 47-61 - Richard Blute, Peter Selinger:
Preface. CTCS 2002: 362-365 - Pierre Boudes:
Non-Uniform Hypercoherences. CTCS 2002: 62-82 - Matteo Coccia, Fabio Gadducci, Ugo Montanari:
GS.Lambda Theories: A Syntax for Higher-Order Graphs. CTCS 2002: 83-100 - J. Robin B. Cockett, Luigi Santocanale:
Induction, Coinduction, and Adjoints. CTCS 2002: 101-119 - Esfandiar Haghverdi, Paulo Tabuada, George J. Pappas:
Bisimulation Relations for Dynamical and Control Systems. CTCS 2002: 120-136 - Masahito Hasegawa:
The Uniformity Principle on Traced Monoidal Categories. CTCS 2002: 137-155 - Jesse Hughes, Bart Jacobs:
Factorization systems and fibrations: Toward a fibred Birkhoff variety theorem. CTCS 2002: 156-182 - Jürgen Koslowski:
A monadic approach to polycategories. CTCS 2002: 183-208 - James Laird:
A Categorical Semantics of Higher Order Store. CTCS 2002: 209-226 - François Lamarche:
Multiplicative Linear Logics and Fibrations. CTCS 2002: 227-247 - Paul Blain Levy:
Adjunction Models For Call-By-Push-Value With Stacks. CTCS 2002: 248-271 - Maria Emilia Maietti:
Joyal's arithmetic universes via type theory. CTCS 2002: 272-286 - Stefan Milius:
On Iteratable Endofunctors. CTCS 2002: 287-304
skipping 153 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-05-23 09:26 CEST 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