default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Sahlin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j4]Yoo C. Chung, Soo-Mook Moon, Kemal Ebcioglu, Dan Sahlin:
Selective sweeping. Softw. Pract. Exp. 35(1): 15-26 (2005)- 2001
- [c15]Theo Kanter, Tom Rindborg, Dan Sahlin:
3G and Beyond & Enabled Adaptive Mobile Multimedia Communication. ICN (1) 2001: 12-26 - 2000
- [c14]Yoo C. Chung, Soo-Mook Moon, Kemal Ebcioglu, Dan Sahlin:
Reducing Sweep Time for a Nearly Empty Heap. POPL 2000: 378-389
1990 – 1999
- 1999
- [c13]Lawrie Brown, Dan Sahlin:
Extending ERLANG for Safe Mobile Code Execution. ICICS 1999: 39-53 - 1997
- [c12]Kent Boortz, Dan Sahlin:
A Compacting Garbage Collector for Unidirectional Heaps. Implementation of Functional Languages 1997: 358- - [c11]Johan Arthursson, Jakob Engblom, Ing-Marie Jonsson, Rehan Mirza, Gustaf Naeser, Mikael Olsson, Robert Ottenhag, Dan Sahlin, Maria Schmid, Bertil Spolander, Elham Zolfonoon:
A Platform for Secure Mobile Agents. PAAM 1997: 109-120 - 1995
- [c10]Dan Sahlin:
Partial Evaluation of AKL. CCP 1995: 10:1-10:16 - [c9]Dan Sahlin, Thomas Sjöland:
An Analyzer for a Concurrent Constraint Language. ICLP 1995: 828 - 1993
- [j3]Dan Sahlin:
Mixtus: An Automatic Partial Avaluator for Full Prolog. New Gener. Comput. 12(1): 7-51 (1993) - [c8]Dan Sahlin, Thomas Sjöland:
Towards Abstract Interpretation of AKL. ICLP Workshop on Concurrent Constraint Programming 1993 - [c7]Seif Haridi, Sverker Janson, Johan Montelius, Torkel Franzén, Per Brand, Kent Boortz, Björn Danielsson, Björn Carlson, Torbjörn Keisu, Dan Sahlin, Thomas Sjöland:
Concurrent Constraint Programming at SICS with the Andorra Kernel Language (Extended Abstract). PPCP 1993: 107-116 - [c6]Dan Sahlin, Thomas Sjöland:
Demonstration: Static Analysis of AKL. WSA 1993: 282-283 - 1992
- [j2]Dan Sahlin, Torkel Franzén, Seif Haridi:
An Intuitionistic Predicate Logic Theorem Prover. J. Log. Comput. 2(5): 619-656 (1992) - 1991
- [c5]Dan Sahlin:
Determinacy Analysis for Full Prolog. PEPM 1991: 23-30 - 1990
- [c4]Dan Sahlin:
Finding the Least Fixed Point Using Wait-Declarations in Prolog. PLILP 1990: 151-158 - [c3]Dan Sahlin:
The Mixtus Approach to Automatic Partial Evaluation of Full Prolog. NACLP 1990: 377-398
1980 – 1989
- 1988
- [j1]Karen Appleby, Mats Carlsson, Seif Haridi, Dan Sahlin:
Garbage Collection for Prolog Based on WAM. Commun. ACM 31(6): 719-741 (1988) - 1985
- [c2]Istvan P. Orci, Dan Sahlin:
Two-Mode Evaluation for Dealing with Implicit Interactions Between Logic Programs and Relational Data Bases. Foundations of Knowledge Base Management (Xania) 1985: 345-371 - 1984
- [p1]Seif Haridi, Dan Sahlin:
Efficient Implementation of Unification of Cyclic Structures. Implementations of Prolog 1984: 234-249 - 1983
- [c1]Seif Haridi, Dan Sahlin:
Evaluation of Logic Programs Based on Natural Deduction (DRAFT). Logic Programming Workshop 1983: 560-574
Coauthor Index
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.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
