Остановите войну!
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 1,030 matches
- 2022
- Beniamino Accattoli, Giulio Guerrieri:
The theory of call-by-value solvability. Proc. ACM Program. Lang. 6(ICFP): 855-885 (2022) - Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Multi types and reasonable space. Proc. ACM Program. Lang. 6(ICFP): 799-825 (2022) - Patrick Bahr, Graham Hutton:
Monadic compiler calculation (functional pearl). Proc. ACM Program. Lang. 6(ICFP): 80-108 (2022) - Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, Francesco Gavazzo:
On Feller continuity and full abstraction. Proc. ACM Program. Lang. 6(ICFP): 826-854 (2022) - Malgorzata Biernacka, Witold Charatonik, Tomasz Drab:
A simple and efficient implementation of strong call by need by an abstract machine. Proc. ACM Program. Lang. 6(ICFP): 109-136 (2022) - Frank Emrich, Jan Stolarek, James Cheney, Sam Lindley:
Constraint-based type inference for FreezeML. Proc. ACM Program. Lang. 6(ICFP): 570-595 (2022) - Joseph Eremondi, Ronald Garcia, Éric Tanter:
Propositional equality for gradual dependently typed programming. Proc. ACM Program. Lang. 6(ICFP): 165-193 (2022) - Lucas Escot, Jesper Cockx:
Practical generic programming over a universe of native datatypes. Proc. ACM Program. Lang. 6(ICFP): 625-649 (2022) - Son Ho, Jonathan Protzenko:
Aeneas: Rust verification by functional translation. Proc. ACM Program. Lang. 6(ICFP): 711-741 (2022) - Tram Hoang, Anton Trunov, Leonidas Lampropoulos, Ilya Sergey:
Random testing of a higher-order blockchain language (experience report). Proc. ACM Program. Lang. 6(ICFP): 886-901 (2022) - Jules Jacobs, Stephanie Balzer, Robbert Krebbers:
Multiparty GV: functional multiparty session types with certified deadlock freedom. Proc. ACM Program. Lang. 6(ICFP): 466-495 (2022) - Shin-ya Katsumata, Dylan McDermott, Tarmo Uustalu, Nicolas Wu:
Flexible presentations of graded monads. Proc. ACM Program. Lang. 6(ICFP): 902-930 (2022) - Steven Keuchel, Sander Huyghebaert, Georgy Lukyanov, Dominique Devriese:
Verified symbolic execution with Kripke specification monads (and no meta-programming). Proc. ACM Program. Lang. 6(ICFP): 194-224 (2022) - Hsiang-Shang Ko, Liang-Ting Chen, Tzu-Chi Lin:
Datatype-generic programming meets elaborator reflection. Proc. ACM Program. Lang. 6(ICFP): 225-253 (2022) - James Koppel, Zheng Guo, Edsko de Vries, Armando Solar-Lezama, Nadia Polikarpova:
Searching entangled program spaces. Proc. ACM Program. Lang. 6(ICFP): 23-51 (2022) - James Koppel, Jackson Kearl, Armando Solar-Lezama:
Automatically deriving control-flow graph generators from operational semantics. Proc. ACM Program. Lang. 6(ICFP): 742-771 (2022) - András Kovács:
Staged compilation with two-level type theory. Proc. ACM Program. Lang. 6(ICFP): 540-569 (2022) - Yao Li, Stephanie Weirich:
Program adverbs and Tlön embeddings. Proc. ACM Program. Lang. 6(ICFP): 312-342 (2022) - Anton Lorenzen, Daan Leijen:
Reference counting with frame limited reuse. Proc. ACM Program. Lang. 6(ICFP): 357-380 (2022) - Kenji Maillard, Meven Lennon-Bertrand, Nicolas Tabareau, Éric Tanter:
A reasonably gradual type theory. Proc. ACM Program. Lang. 6(ICFP): 931-959 (2022) - Marek Materzok:
Generating circuits with generators. Proc. ACM Program. Lang. 6(ICFP): 52-79 (2022) - Minh Nguyen, Roly Perera, Meng Wang, Nicolas Wu:
Modular probabilistic models via algebraic effects. Proc. ACM Program. Lang. 6(ICFP): 381-410 (2022) - Klaus Ostermann, David Binder, Ingo Skupin, Tim Süberkrüb, Paul Downen:
Introduction and elimination, left and right. Proc. ACM Program. Lang. 6(ICFP): 438-465 (2022) - Benjamin Quiring, John H. Reppy, Olin Shivers:
Analyzing binding extent in 3CPS. Proc. ACM Program. Lang. 6(ICFP): 650-678 (2022) - Norman Ramsey:
Beyond Relooper: recursive translation of unstructured control flow to structured control flow (functional pearl). Proc. ACM Program. Lang. 6(ICFP): 1-22 (2022) - Cas van der Rest, Wouter Swierstra:
A completely unique account of enumeration. Proc. ACM Program. Lang. 6(ICFP): 411-437 (2022) - Elijah Rivera, Shriram Krishnamurthi:
Structural versus pipeline composition of higher-order functions (experience report). Proc. ACM Program. Lang. 6(ICFP): 343-356 (2022) - Simon Spies, Lennard Gäher, Joseph Tassarotti, Ralf Jung, Robbert Krebbers, Lars Birkedal, Derek Dreyer:
Later credits: resourceful reasoning for the later modality. Proc. ACM Program. Lang. 6(ICFP): 283-311 (2022) - Arnaud Spiwack, Csongor Kiss, Jean-Philippe Bernardy, Nicolas Wu, Richard A. Eisenberg:
Linearly qualified types: generic inference for capabilities and uniqueness. Proc. ACM Program. Lang. 6(ICFP): 137-164 (2022) - Patrick Thomson, Rob Rix, Nicolas Wu, Tom Schrijvers:
Fusing industry and academia at GitHub (experience report). Proc. ACM Program. Lang. 6(ICFP): 496-511 (2022)
skipping 1,000 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-25 18:31 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