Остановите войну!
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 32 matches
- 1989
- Guy Argo:
Improving the Three Instruction Machine. FPCA 1989: 100-115 - Zena M. Ariola, Arvind:
P-TAC: A Parallel Intermediate Language. FPCA 1989: 230-242 - Kavi Arya:
Processes in a Functional Animation System. FPCA 1989: 382-395 - Lennart Augustsson, Thomas Johnsson:
Parallel Graph Reduction with the <nu, G>-Machine. FPCA 1989: 202-213 - Bror Bjerner, Sören Holmström:
A Composition Approach to Time Analysis of First Order Lazy Functional Programs. FPCA 1989: 157-165 - Adrienne G. Bloss:
Update Analysis and the Efficient Implementation of Functional Aggregates. FPCA 1989: 26-38 - F. Warren Burton:
Indeterminate Behavior with Determinate Semantics in Parallel Programs. FPCA 1989: 340-346 - Peter S. Canning, William R. Cook, Walter L. Hill, Walter G. Olthoff, John C. Mitchell:
F-Bounded Polymorphism for Object-Oriented Programming. FPCA 1989: 273-280 - Andrew Dwelly:
Functions and Dynamic User Interfaces. FPCA 1989: 371-381 - Lal George:
An Abstract Machine for Parallel Graph Reduction. FPCA 1989: 214-229 - Sebastian Hunt:
Frontiers and Open Sets in Abstract Interpretation. FPCA 1989: 1-13 - Simon B. Jones, Daniel Le Métayer:
Computer-Time Garbage Collection by Sharing Analysis. FPCA 1989: 54-74 - Simon L. Peyton Jones, Jon Salkild:
The Spineless Tagless G-Machine. FPCA 1989: 184-201 - Tsung-Min Kuo, Prateek Mishra:
Strictness Analysis: A New Perspective Based on Type Inference. FPCA 1989: 260-272 - David R. Lester:
Stacklessness: Compiling Recursion for a Distributed Architecture. FPCA 1989: 116-128 - Michel Mauny:
Parsers and Printers as Stream Destructors and Constructors Embedded in Functional Languages. FPCA 1989: 360-370 - Torben Æ. Mogensen:
Separating Binding Times in Language Specifications. FPCA 1989: 14-25 - Hanne Riis Nielson, Flemming Nielson:
Transformations on Higher-Order Functions. FPCA 1989: 129-143 - Atsushi Ohori:
A Simple Semantics for ML Polymorphism. FPCA 1989: 281-292 - John Peterson:
Untagged Data in Tagged Environments: Choosing Optimal Representations at Compile Time. FPCA 1989: 89-99 - Mikael Rittri:
Using Types as Search Keys in Function Libraries. FPCA 1989: 174-183 - Mads Rosendahl:
Automatic Complexity Analysis. FPCA 1989: 144-156 - Erik Ruf, Daniel Weise:
Nondeterminism and Unification in LogScheme: Integrating Logic and Functional Programming. FPCA 1989: 327-339 - Colin Runciman, Ian Toyn:
Retrieving Re-Usable Software Components by Polymorphic Type. FPCA 1989: 166-173 - Peter Sestoft:
Replacing Function Parameters by Global Variables. FPCA 1989: 39-53 - Frank S. K. Silbermann, Bharat Jayaraman:
Set Abstraction in Functional and Logic Programming. FPCA 1989: 313-326 - Yukihide Takayama:
Extended Projection - New Method to Extract Efficient Programs from Constructive Proofs. FPCA 1989: 299-312 - Kenneth R. Traub:
Compilation as Partitioning: A New Approach to Compiling Non-Strict Functional Languages. FPCA 1989: 75-88 - Philip Wadler:
Theorems for Free! FPCA 1989: 347-359 - Mitchell Wand, Patrick O'Keefe:
On the Complexity of Type Inference with Coercion. FPCA 1989: 293-298
skipping 2 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-07-04 04:43 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