Остановите войну!
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 42 matches
- 1999
- Thorsten Altenkirch, Bernhard Reus:
Monadic Presentations of Lambda Terms Using Generalized Inductive Types. CSL 1999: 453-468 - Carlos Areces, Patrick Blackburn, Maarten Marx:
A Road-Map on Complexity for Hybrid Logics. CSL 1999: 307-321 - Thomas Arts, Jürgen Giesl:
Applying Rewriting Techniques to the Verification of Erlang Processes. CSL 1999: 96-110 - Vincent Balat, Roberto Di Cosmo:
A Linear Logical View of Linear Type Isomorphisms. CSL 1999: 250-265 - José L. Balcázar:
The Consistency Dimension, Compactness, and Query Learning. CSL 1999: 2-13 - Lev D. Beklemishev:
Open Least Element Principle and Bounded Query Computation. CSL 1999: 389-404 - Eduardo Bonelli:
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. CSL 1999: 204-219 - Julian C. Bradfield:
Fixpoint Alternation and the Game Quantifier. CSL 1999: 350-361 - Adriana B. Compagnoni, Healfdene Goguen:
Anti-Symmetry of Higher-Order Subtyping. CSL 1999: 420-438 - Giorgio Delzanno, Javier Esparza, Andreas Podelski:
Constraint-Based Analysis of Broadcast Protocols. CSL 1999: 50-66 - Volker Diekert, Paul Gastin:
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. CSL 1999: 188-203 - Maribel Fernández, Ian Mackie:
Closed Reductions in the lambda-Calculus. CSL 1999: 220-234 - Martin Fränzle:
Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States. CSL 1999: 126-140 - Paul Gastin, Michael W. Mislove:
A Truly Concurrent Semantics for a Simple Parallel Programming Language. CSL 1999: 515-529 - Herman Geuvers, Erik Poll, Jan Zwanenburg:
Safe Proof Checking in Type Theory with Y. CSL 1999: 439-452 - Erich Grädel, Stephan Kreutzer:
Descriptive Complexity Theory for Constraint Databases. CSL 1999: 67-81 - Martin Grohe:
Descriptive and Parameterized Complexity. CSL 1999: 14-31 - Shigeki Hagihara, Naoki Yonezaki:
Resolution Method for Modal Logic with Well-Founded Frames. CSL 1999: 277-291 - Jo Erskine Hannay:
Specification Refinement with System F. CSL 1999: 530-545 - Yoram Hirshfeld, Alexander Moshe Rabinovich:
Quantitative Temporal Logic. CSL 1999: 172-187 - Furio Honsell, Donald Sannella:
Pre-logical Relations. CSL 1999: 546-561 - Douglas J. Howe:
Interactive Theorem Proving Using Type Theory. CSL 1999: 578 - Samin S. Ishtiaq, David J. Pym:
Kripke Resource Models of a Dependently-Typed, Bunched lambda-Calculus. CSL 1999: 235-249 - Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong:
A Universal Innocent Game Model for the Böhm Tree Lambda Theory. CSL 1999: 405-419 - Yonit Kesten, Amir Pnueli:
Verifying Liveness by Augmented Abstraction. CSL 1999: 141-156 - Yoshiki Kinoshita, John Power:
Data-Refinement for Call-By-Value Programming Languages. CSL 1999: 562-576 - Antonín Kucera, Javier Esparza:
A Logical Viewpoint on Process-Algebraic Quotients. CSL 1999: 499-514 - Clemens Lautemann, Bernhard Weinzinger:
MonadicNLIN and Quantifier-Free Reductions. CSL 1999: 322-337 - Daniel Leivant:
Applicative Control and Computational Complexity. CSL 1999: 82-95 - Jerzy Marcinkowski:
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. CSL 1999: 338-349
skipping 12 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-09 18:17 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