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 13 matches
- 2017
- Daniil Berezun, Neil D. Jones:
Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper). PEPM 2017: 1-11 - Levin Fritz, Jurriaan Hage:
Cost versus precision for approximate typing for Python. PEPM 2017: 89-98 - Fritz Henglein, Ulrik Terp Rasmussen:
PEG parsing in less space using progressive tabling and dynamic analysis. PEPM 2017: 35-46 - Tatsuya Katsushima, Oleg Kiselyov:
Language-integrated query with ordering, grouping and outer joins (poster paper). PEPM 2017: 123-124 - Markus Klinik, Jurriaan Hage, Jan Martin Jansen, Rinus Plasmeijer:
Predicting resource consumption of higher-order workflows. PEPM 2017: 99-110 - Kazutaka Matsuda, Kazuyuki Asada:
A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction. PEPM 2017: 71-82 - Tsubasa Matsushita, Isao Sasano:
Detecting code clones with gaps by function applications. PEPM 2017: 12-22 - Krishna Narasimhan, Christoph Reichenbach, Julia Lawall:
Interactive data representation migration: exploiting program dependence to aid program transformation. PEPM 2017: 47-58 - Tiark Rompf, Kevin J. Brown:
Functional parallels of sequential imperatives (short paper). PEPM 2017: 83-88 - Alejandro Serrano, Jurriaan Hage:
Lightweight soundness for towers of language extensions. PEPM 2017: 23-34 - Takashi Suwa, Takeshi Tsukada, Naoki Kobayashi, Atsushi Igarashi:
Verification of code generators via higher-order model checking. PEPM 2017: 59-70 - Ivo Gabe de Wolff, Jurriaan Hage:
Refining types using type guards in TypeScript. PEPM 2017: 111-122 - Ulrik Pagh Schultz, Jeremy Yallop:
Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017, Paris, France, January 18-20, 2017. ACM 2017, ISBN 978-1-4503-4721-1 [contents]
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 2025-01-14 21:32 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