default search action
Edmund Soon Lee Lam
Person information
- affiliation: University of Colorado Boulder, USA
- affiliation (former): Carnegie Mellon University Qatar
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c16]Foyzul Hassan, Shaikh Mostafa, Edmund S. L. Lam, Xiaoyin Wang:
Automatic Building of Java Projects in Software Repositories: A Study on Feasibility and Challenges. ESEM 2017: 38-47 - [c15]Edmund S. L. Lam, Peilun Zhang, Bor-Yuh Evan Chang
:
ChimpCheck: property-based randomized test generation for interactive apps. Onward! 2017: 58-77 - [i3]Edmund S. L. Lam, Peilun Zhang, Bor-Yuh Evan Chang:
ChimpCheck: Property-Based Randomized Test Generation for Interactive Apps. CoRR abs/1708.08613 (2017) - 2016
- [c14]Iliano Cervesato, Edmund Soon Lee Lam, Ali Elgazar:
Choreographic Compilation of Decentralized Comprehension Patterns. RuleML 2016: 113-129 - [c13]Edmund Soon Lee Lam, Iliano Cervesato:
Let's Unify With Scala Pattern Matching! UNIF 2016: 43-48 - [c12]Iliano Cervesato, Edmund S. L. Lam:
Overlap and Independence in Multiset Comprehension Patterns. UNIF 2016: 51-56 - 2015
- [c11]Edmund Soon Lee Lam, Iliano Cervesato, Nabeeha Fatima:
Comingle: Distributed Logic Programming for Decentralized Mobile Ensembles. COORDINATION 2015: 51-66 - [c10]Iliano Cervesato, Edmund S. L. Lam:
Modular Multiset Rewriting. LPAR 2015: 515-531 - [c9]Edmund S. L. Lam, Iliano Cervesato, Ali Elgazar:
Programmable orchestration of time-synchronized events across decentralized Android ensembles. WiMob 2015: 659-666 - 2014
- [c8]Edmund Soon Lee Lam, Iliano Cervesato:
Optimized Compilation of Multiset Rewriting with Comprehensions. APLAS 2014: 19-38 - [c7]Edmund S. L. Lam, Iliano Cervesato:
Reasoning About Set Comprehensions. SMT 2014: 27-37 - [i2]Edmund S. L. Lam, Iliano Cervesato:
Constraint Handling Rules with Multiset Comprehension Patterns. CoRR abs/1406.2121 (2014) - 2013
- [c6]Edmund S. L. Lam, Iliano Cervesato
Decentralized execution of constraint handling rules for ensembles. PPDP 2013: 205-216 - 2012
- [c5]Edmund Soon Lee Lam, Iliano Cervesato
Modeling datalog fact assertion and retraction in linear logic. PPDP 2012: 67-78 - 2011
- [j1]Edmund S. L. Lam, Martin Sulzmann:
Concurrent goal-based execution of Constraint Handling Rules. Theory Pract. Log. Program. 11(6): 841-879 (2011) - 2010
- [i1]Edmund S. L. Lam, Martin Sulzmann:
Concurrent Goal-Based Execution of Constraint Handling Rules. CoRR abs/1006.3039 (2010)
2000 – 2009
- 2009
- [c4]Martin Sulzmann, Edmund S. L. Lam, Simon Marlow:
Comparing the performance of concurrent linked-list implementations in Haskell. DAMP 2009: 37-46 - 2008
- [c3]Martin Sulzmann, Edmund S. L. Lam, Peter Van Weert:
Actors with Multi-headed Message Receive Patterns. COORDINATION 2008: 315-330 - [c2]Martin Sulzmann, Edmund S. L. Lam:
Parallel execution of multi-set constraint rewrite rules. PPDP 2008: 20-31 - 2007
- [c1]Edmund S. L. Lam, Martin Sulzmann:
A concurrent constraint handling rules implementation in Haskell with software transactional memory. DAMP 2007: 19-24
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:46 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: