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 264 matches
- 1994
- Shail Aditya, Christine H. Flood, James E. Hicks:
Garbage Collection for Strongly-Typed Languages Using Run-Time Type Reconstruction. LISP and Functional Programming 1994: 12-23 - J. Michael Ashley, R. Kent Dybvig:
An Efficient Implementation of Multiple Return Values in Scheme. LISP and Functional Programming 1994: 140-149 - Edoardo Biagioni, Robert Harper, Peter Lee, Brian Milnes:
Signatures for a Network Protocol Stack: A Systems Application of Standard ML. LISP and Functional Programming 1994: 55-64 - Sandip K. Biswas:
In-Place Updates in the Presence of Control Operators. LISP and Functional Programming 1994: 283-293 - Tyng-Ruey Chuang:
A Randomized Implementation of Multiple Functional Arrays. LISP and Functional Programming 1994: 173-184 - William D. Clinger, Lars Thomas Hansen:
Lambda, the Ultimate Label or a Simple Optimizing Compiler for Scheme. LISP and Functional Programming 1994: 128-139 - Stavros S. Cosmadakis:
Complete Proof Systems for Algebraic Simply-Typed Terms. LISP and Functional Programming 1994: 220-226 - Harley Davis, Pierre Parquier, Nitsan Séniak:
Talking About Modules and Delivery. LISP and Functional Programming 1994: 113-120 - Harley Davis, Pierre Parquier, Nitsan Séniak:
Sweet Harmony: The Talk/C++ Connection. LISP and Functional Programming 1994: 121-127 - Jeffrey Dean, Craig Chambers:
Towards Better Inlining Decisions Using Inlining Trials. LISP and Functional Programming 1994: 273-282 - Hsianlin Dzeng, Christopher T. Haynes:
Type Reconstruction for Variable-Arity Procedures. LISP and Functional Programming 1994: 239-249 - Pascal Fradet:
Collecting More Garbage. LISP and Functional Programming 1994: 24-33 - Cordelia V. Hall:
Using Hindley-Milner Type Inference to Optimise List Representation. LISP and Functional Programming 1994: 162-172 - Nevin Heintze:
Set-Based Analysis of ML Programs. LISP and Functional Programming 1994: 306-317 - Lorenz Huelsbergen, James R. Larus, Alexander Aiken:
Using the Run-Time Sizes of Data Structures to Guide Parallel-Thread Creation. LISP and Functional Programming 1994: 79-90 - J. H. Jacobs, Mark R. Swanson:
Syntax and Semantics of a Persistent Common Lisp. LISP and Functional Programming 1994: 103-112 - Suresh Jagannathan, Stephen Weeks:
Analyzing Stores and References in a Parallel Symbolic Language. LISP and Functional Programming 1994: 294-305 - A. J. Kfoury, J. B. Wells:
A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus. LISP and Functional Programming 1994: 196-207 - Julia L. Lawall, Olivier Danvy:
Continuation-Based Partial Evaluation. LISP and Functional Programming 1994: 227-238 - James W. O'Toole Jr., Scott Nettles:
Concurrent Replicating Garbage Collection. LISP and Functional Programming 1994: 34-42 - Christian Queinnec:
Locality, Causality and Continuations. LISP and Functional Programming 1994: 91-102 - Brian Reistad, David K. Gifford:
Static Dependent Costs for Estimating Execution Time. LISP and Functional Programming 1994: 65-78 - A. V. S. Sastry, William D. Clinger:
Parallel Destructive Updating in Strict Functional Languages. LISP and Functional Programming 1994: 263-272 - Zhong Shao, Andrew W. Appel:
Space-Efficient Closure Representations. LISP and Functional Programming 1994: 150-161 - Zhong Shao, John H. Reppy, Andrew W. Appel:
Unrolling Lists. LISP and Functional Programming 1994: 185-195 - Dan C. Stefanescu, Yuli Zhou:
An Equational Framework for the Flow Analysis of Higher Order Functional Programs. LISP and Functional Programming 1994: 318-327 - Darko Stefanovic, J. Eliot B. Moss:
Characterization of Object Behaviour in Standard ML of New Jersey. LISP and Functional Programming 1994: 43-54 - Satish R. Thatte:
Semantics of Type Classes Revisited. LISP and Functional Programming 1994: 208-219 - Andrew P. Tolmach:
Tag-Free Garbage Collection Using Explicit Type Parameters. LISP and Functional Programming 1994: 1-11 - Andrew K. Wright, Robert Cartwright:
A Practical Soft Type System for Scheme. LISP and Functional Programming 1994: 250-262
skipping 234 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-11-08 10:15 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