Остановите войну!
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 40 matches
- 1994
- Hiralal Agrawal:
Dominators, Super Blocks, and Program Coverage. POPL 1994: 25-34 - Alexander Aiken, Edward L. Wimmers, T. K. Lakshman:
Soft Typing with Conditional Types. POPL 1994: 163-173 - Sergio Antoy, Rachid Echahed, Michael Hanus:
A Needed Narrowing Strategy. POPL 1994: 268-279 - Bard Bloom:
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms. POPL 1994: 339-347 - Frank S. de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi:
Proving Concurrent Constraint Programs Correct. POPL 1994: 98-108 - Koenraad De Bosschere, Saumya K. Debray, David Gudeman, Sampath Kannan:
Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages. POPL 1994: 409-420 - John Boyland, Susan L. Graham:
Composing Tree Attributions. POPL 1994: 375-388 - Brad Calder, Dirk Grunwald:
Reducing Indirect Function call Overhead in C++ Programs. POPL 1994: 397-408 - Giuseppe Castagna, Benjamin C. Pierce:
Decidable Bounded Quantification. POPL 1994: 151-162 - Rance Cleaveland, Daniel Yankelevich:
An Operational Framework for Value-Passing Processes. POPL 1994: 326-338 - Agostino Cortesi, Baudouin Le Charlier, Pascal Van Hentenryck:
Combinations of Abstract Domains for Logic Programming. POPL 1994: 227-239 - Amer Diwan, David Tarditi, J. Eliot B. Moss:
Memory Subsystem Performance of Programs Using Copying Garbage Collection. POPL 1994: 1-14 - Damien Doligez, Georges Gonthier:
Portable, Unobtrusive Garbage Collection for Multiprocessor Systems. POPL 1994: 70-83 - Lawrence Feigen, David Klappholz, Robert Casazza, Xing Xue:
The Revival Transformation. POPL 1994: 421-434 - Andrzej Filinski:
Representing Monads. POPL 1994: 446-457 - Jacques Garrigue, Hassan Aït-Kaci:
The Typed Polymorphic Label-Selective lambda-Calculus. POPL 1994: 35-47 - Chris Hankin, Daniel Le Métayer:
Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis. POPL 1994: 202-212 - Robert Harper, Mark Lillibridge:
A Type-Theoretic Approach to Higher-Order Modules with Sharing. POPL 1994: 123-137 - John Hatcliff, Olivier Danvy:
A Generic Account of Continuation-Passing Styles. POPL 1994: 458-471 - Fritz Henglein, Jesper Jørgensen:
Formally Optimal Boxing. POPL 1994: 213-226 - Kohei Honda, Nobuko Yoshida:
Combinatory Representation of Mobile Processes. POPL 1994: 348-360 - Dinesh Katiyar, David C. Luckham, John C. Mitchell:
A Type System for Prototyping Languages. POPL 1994: 138-150 - Xavier Leroy:
Manifest Types, Modules, and Separate Compilation. POPL 1994: 109-122 - Pierre Lescanne:
From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. POPL 1994: 60-69 - Kim Marriott, Maria J. García de la Banda, Manuel V. Hermenegildo:
Analyzing Logic Programs with Dynamic Scheduling. POPL 1994: 240-253 - Vadim Maslov:
Lazy Array Data-Flow Dependence Analysis. POPL 1994: 311-325 - Robert Muller:
A Staging Calculus and its Application to the Verification of Translators. POPL 1994: 389-396 - Hanne Riis Nielson, Flemming Nielson:
Higher-Order Concurrent Programs with Finite Communication Topology. POPL 1994: 84-97 - Martin Odersky:
A Functional Theory of Local Names. POPL 1994: 48-59 - Jukka Paakki:
Multi-Pass Execution of Functional Logic Programs. POPL 1994: 361-374
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-04-18 19: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