Observational equivalences for linear logic concurrent constraint languages

Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on Girard's linear logic instead of the classical logic. In this paper, we address the problem of program equivalence for this programming framewo...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 11; no. 4-5; pp. 469 - 485
Main Author: Haemmerle, Remy
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.07.2011
Subjects:
Algebra
Equivalence
Handling
Logic
Logic programming
Materials handling
Programming
Regular Papers
Semantics
bisimulation
observational equivalences
π-calculus
Constraint Handling Rules
linear logic
Concurrent Constraint programming
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on Girard's linear logic instead of the classical logic. In this paper, we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition system and investigate different notions of observational equivalences inspired by the state of art of process algebras. Then, we demonstrate that the asynchronous π-calculus can be viewed as simple syntactical restrictions of LCC. Finally, we show that LCC observational equivalences can be transposed straightforwardly to classical Concurrent Constraint languages and Constraint Handling Rules, and investigate the resulting equivalences.
AbstractList Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on Girard's linear logic instead of the classical logic. In this paper, we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition system and investigate different notions of observational equivalences inspired by the state of art of process algebras. Then, we demonstrate that the asynchronous π-calculus can be viewed as simple syntactical restrictions of LCC. Finally, we show that LCC observational equivalences can be transposed straightforwardly to classical Concurrent Constraint languages and Constraint Handling Rules, and investigate the resulting equivalences.
Abstract Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on Girard's linear logic instead of the classical logic. In this paper, we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition system and investigate different notions of observational equivalences inspired by the state of art of process algebras. Then, we demonstrate that the asynchronous π-calculus can be viewed as simple syntactical restrictions of LCC. Finally, we show that LCC observational equivalences can be transposed straightforwardly to classical Concurrent Constraint languages and Constraint Handling Rules, and investigate the resulting equivalences. [PUBLICATION ABSTRACT]
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on Girard's linear logic instead of the classical logic. In this paper, we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition system and investigate different notions of observational equivalences inspired by the state of art of process algebras. Then, we demonstrate that the asynchronous pi -calculus can be viewed as simple syntactical restrictions of LCC. Finally, we show that LCC observational equivalences can be transposed straightforwardly to classical Concurrent Constraint languages and Constraint Handling Rules, and investigate the resulting equivalences.
Author HAEMMERLÉ, RÉMY
Author_xml – sequence: 1
  givenname: Remy
  surname: Haemmerle
  fullname: Haemmerle, Remy
BookMark eNp9UMtOwzAQtFCRaAsfwK3ixCXgR2I7R1TxEpV6AM6R42wiV6nd2kkl_h6nrYRUBKed9c6sZ2eCRtZZQOia4DuCibh_J6kgmMuUEIwxoewMjeNTljAsyWiPSTLML9AkhFWkcEbTMXpblgH8TnXGWdXOYNubnWrBagiz2vlZayyoWFxj9Ew7q3vvwXYDDJ1XJsJW2aZXDYRLdF6rNsDVsU7R59Pjx_wlWSyfX-cPi0SzNO8SVinBM1AlyAwLXVW5EtEeJ7nkMgOd0lSXlBIJHFjFGat5FTtSsTwXnGk2RbeHvRvvtj2ErliboKGNRsD1oSDxm5TiTLJIvTmhrlzv46WhkHnOMKVCRJI4kLR3IXioC226fSLDhW1BcDFkXPzKOCrJiXLjzVr5r3817KhR69KbqoEfT3-rvgEZMI4z
CitedBy_id crossref_primary_10_1016_j_tcs_2015_06_031
crossref_primary_10_1017_S1471068418000017
crossref_primary_10_1016_j_tcs_2016_08_026
crossref_primary_10_1017_S1471068411000123
crossref_primary_10_1007_s10601_013_9145_3
Cites_doi 10.1016/j.jlap.2004.01.006
10.1007/978-3-540-27775-0_7
10.1016/0304-3975(84)90113-0
10.7551/mitpress/7160.001.0001
10.1007/978-3-540-74610-2_16
10.1006/inco.2000.3002
10.1016/0304-3975(92)90185-I
10.1016/0304-3975(87)90045-4
10.1145/322217.322230
10.1007/3-540-49481-2_4
10.1016/0304-3975(95)00074-7
10.1017/S1471068411000123
10.1017/CBO9780511609886
10.19153/cleiej.1.2.2
10.7551/mitpress/2086.001.0001
10.1007/3-540-55719-9_114
10.1016/S0304-3975(97)00223-5
ContentType Journal Article
Copyright Copyright © Cambridge University Press 2011
Copyright_xml – notice: Copyright © Cambridge University Press 2011
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1017/S1471068411000123
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
ProQuest advanced technologies & aerospace journals
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList CrossRef

Computer Science Database
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1475-3081
EndPage 485
ExternalDocumentID 2490686611
10_1017_S1471068411000123
Genre Feature
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVKB
ABVZP
ABZCX
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACNCT
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IPYYG
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
NIKVX
O9-
OYBOY
P2P
P62
PHGZT
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
AAYXX
ABGDZ
ABXHF
AFFHD
AKMAY
CITATION
PHGZM
PQGLB
3V.
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
M0N
PKEHL
PQEST
PQUKI
PRINS
Q9U
PUEGO
ID FETCH-LOGICAL-c349t-3da765eabe8507cdd9a71476198685ec424cb2218e6e3d633f6d2181d399763c3
IEDL.DBID K7-
ISICitedReferencesCount 10
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000292701100004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-0684
IngestDate Fri Sep 05 07:24:56 EDT 2025
Fri Jul 25 06:57:37 EDT 2025
Tue Nov 18 21:36:20 EST 2025
Sat Nov 29 04:58:34 EST 2025
Wed Mar 05 09:16:29 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 4-5
Keywords bisimulation
observational equivalences
π-calculus
Constraint Handling Rules
linear logic
Concurrent Constraint programming
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c349t-3da765eabe8507cdd9a71476198685ec424cb2218e6e3d633f6d2181d399763c3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 899302277
PQPubID 43613
PageCount 17
ParticipantIDs proquest_miscellaneous_1349420583
proquest_journals_899302277
crossref_citationtrail_10_1017_S1471068411000123
crossref_primary_10_1017_S1471068411000123
cambridge_journals_10_1017_S1471068411000123
PublicationCentury 2000
PublicationDate 20110700
2011-07-00
20110701
PublicationDateYYYYMMDD 2011-07-01
PublicationDate_xml – month: 07
  year: 2011
  text: 20110700
PublicationDecade 2010
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2011
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References S1471068411000123_ref27
Best (S1471068411000123_ref7) 1997
Maher (S1471068411000123_ref24) 1987
S1471068411000123_ref28
S1471068411000123_ref22
Martinez (S1471068411000123_ref25) 2010
Abdennadher (S1471068411000123_ref2) 1998
Milner (S1471068411000123_ref26) 1989
Abadi (S1471068411000123_ref1) 2000
S1471068411000123_ref20
S1471068411000123_ref21
Buscemi (S1471068411000123_ref8) 2007
Gilbert (S1471068411000123_ref15) 2000
Saraswat (S1471068411000123_ref33) 1991
Laneve (S1471068411000123_ref23) 1992
S1471068411000123_ref16
S1471068411000123_ref5
S1471068411000123_ref17
S1471068411000123_ref6
S1471068411000123_ref11
Haemmerlé (S1471068411000123_ref18) 2007
S1471068411000123_ref12
S1471068411000123_ref34
Ruet (S1471068411000123_ref30) 1997
S1471068411000123_ref35
S1471068411000123_ref13
Aït-Kaci (S1471068411000123_ref4) 1991
S1471068411000123_ref14
S1471068411000123_ref31
S1471068411000123_ref10
Parrow (S1471068411000123_ref29) 1998
Abdennadher (S1471068411000123_ref3) 1999
Saraswat (S1471068411000123_ref32) 1990
Díaz (S1471068411000123_ref9) 1998; 1
S1471068411000123_ref19
References_xml – ident: S1471068411000123_ref13
  doi: 10.1016/j.jlap.2004.01.006
– ident: S1471068411000123_ref10
  doi: 10.1007/978-3-540-27775-0_7
– ident: S1471068411000123_ref28
  doi: 10.1016/0304-3975(84)90113-0
– ident: S1471068411000123_ref35
– start-page: 463
  volume-title: Computational Logic
  year: 2000
  ident: S1471068411000123_ref15
– volume-title: Proc. of International Conference on Logic Programming (ICLP '87)
  year: 1987
  ident: S1471068411000123_ref24
– volume-title: Warren's Abstract Machine, A Tutorial Reconstruction
  year: 1991
  ident: S1471068411000123_ref4
  doi: 10.7551/mitpress/7160.001.0001
– start-page: 57
  volume-title: Principles and Practice of Declarative Programming
  year: 2010
  ident: S1471068411000123_ref25
– start-page: 43
  volume-title: Principles and Practice of Constraint Programming
  year: 1999
  ident: S1471068411000123_ref3
– ident: S1471068411000123_ref22
– start-page: 333
  volume-title: Principles of Programming Languages
  year: 1991
  ident: S1471068411000123_ref33
– start-page: 256
  volume-title: Proc. of Coordination
  year: 1997
  ident: S1471068411000123_ref7
– ident: S1471068411000123_ref11
  doi: 10.1007/978-3-540-74610-2_16
– ident: S1471068411000123_ref12
  doi: 10.1006/inco.2000.3002
– ident: S1471068411000123_ref6
  doi: 10.1016/0304-3975(92)90185-I
– start-page: 554
  volume-title: Foundations of Software Technology and Theoretical Computer Science
  year: 2007
  ident: S1471068411000123_ref18
– ident: S1471068411000123_ref16
  doi: 10.1016/0304-3975(87)90045-4
– start-page: 302
  volume-title: Principles of Programming Languages
  year: 2000
  ident: S1471068411000123_ref1
– ident: S1471068411000123_ref20
  doi: 10.1145/322217.322230
– volume-title: Communication and Concurrency
  year: 1989
  ident: S1471068411000123_ref26
– start-page: 25
  volume-title: Principles and Practice of Constraint Programming.
  year: 1998
  ident: S1471068411000123_ref2
  doi: 10.1007/3-540-49481-2_4
– ident: S1471068411000123_ref19
  doi: 10.1016/0304-3975(95)00074-7
– ident: S1471068411000123_ref34
– ident: S1471068411000123_ref17
  doi: 10.1017/S1471068411000123
– start-page: 18
  volume-title: European Symposium on Programming
  year: 2007
  ident: S1471068411000123_ref8
– ident: S1471068411000123_ref14
  doi: 10.1017/CBO9780511609886
– start-page: 232
  volume-title: Principles of Programming Languages
  year: 1990
  ident: S1471068411000123_ref32
– start-page: 406
  volume-title: Proc. of Annual Conference on Computer Science Logic
  year: 1997
  ident: S1471068411000123_ref30
– ident: S1471068411000123_ref21
– volume: 1
  year: 1998
  ident: S1471068411000123_ref9
  article-title: Pi+- calculus: A calculus for concurrent processes with constraints
  publication-title: CLEI Electronic Journal
  doi: 10.19153/cleiej.1.2.2
– ident: S1471068411000123_ref31
  doi: 10.7551/mitpress/2086.001.0001
– start-page: 176
  volume-title: Logic in Computer Science
  year: 1998
  ident: S1471068411000123_ref29
– start-page: 336
  volume-title: Mathematical Foundations of Computer Science
  year: 1992
  ident: S1471068411000123_ref23
– ident: S1471068411000123_ref27
  doi: 10.1007/3-540-55719-9_114
– ident: S1471068411000123_ref5
  doi: 10.1016/S0304-3975(97)00223-5
SSID ssj0016324
Score 1.913318
Snippet Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on...
Abstract Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 469
SubjectTerms Algebra
Equivalence
Handling
Logic
Logic programming
Materials handling
Programming
Regular Papers
Semantics
Title Observational equivalences for linear logic concurrent constraint languages
URI https://www.cambridge.org/core/product/identifier/S1471068411000123/type/journal_article
https://www.proquest.com/docview/899302277
https://www.proquest.com/docview/1349420583
Volume 11
WOSCitedRecordID wos000292701100004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest advanced technologies & aerospace journals
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB609eDF-sRaLRE8icE2m002J1GxCJVaRKV4CZvdLRQkfST19zuTlxahFy9J2GzCZmd2dl75BuBCui6LAsoSl0bZqFIrXFLS2MEYNytfScdkOAXvT_5gIEajYFjk5iRFWmUpEzNBraeKfOTXaBcwgrvzb2Zzm4pGUXC1qKCxCfWu43SJzfu-XQURCIk8-7nIp-Qe4ZZBTUKMpkZqI8Q0Uit-QyusblGrEjrbdnqNfw54F3YKfdO6zRlkDzZMvA-NspaDVSztA-g_R5V_Fvub-XKCPJglWVuo11qkjUo8kaS00IZWOa4TXSZZmYnUKl2fySG89R5e7x_totCCrZgbpDbT0ve4kZERqB4qrQPp4wShbSU8wY1yHVdFOMHCeIZpj7Gxp0k10KjdoHxS7Ahq8TQ2x2AZSVZu4HQ9D8UD41J2DedCc2U6WijVhKtqnsNiuSRhnmrmh3_I0oROSYpQFaDl9FGf6x65rB6Z5Ygd6zq3SuL9jKaiXBPOq7u46iiUImMzXeKACdXH6XDBTta-oQXbuROa8ntPoZYuluYMttRXOkkWbajfPQyGL-2MbfE45B_fhhPvqw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8QwEB58gV58i-uzgl7E4m7TNulBRHyg7Lp6UPFWs8kIgnTV7ir-KP-jM32pCHvz4KklTULSzDOZfAOwqX1fdCKOEtdoXDKpDbGURje6J2UljfYwwym4acl2W93eRpdD8FHeheGwylImZoLadg3vke-SXyAY7k7uPz27nDSKD1fLDBo5VTTx_Y08tnTv7IiWd8vzTo6vDk_dIqmAa4Qf9VxhtQwD1B1UZAoZayMtGz478ypUARrf803HI8WHIQobCnEfWlaDljQ58aIR1O8wjPpCSYbqb0q3OrRg5PPsMpPkYCLll4eojFDNhVzGCG1sxnyHcvipEn9qhEzNnUz9sx80DZOFPe0c5AwwA0OYzMJUmavCKUTXHDQvOtX-M9XH5_4D8VgWRO6Q3e6wta3pwZrAMd3E5LhV_JpmaTR6Trm1m87D9Z9MaQFGkm6Ci-CgZi8-8hphSOJPBFo3MAiUDQzWrTKmBjvVusaFOEjjPJROxr_IoAb1culjU4Cy86QeBzXZrpo85Ygkgyovl8TyNZqKUmqwUX0lqcJHRTrBbp8GzKhFXj1QYmlgD-swfnp13opbZ-3mMkzkG-4cy7wCI72XPq7CmHntPaQvaxmrOHD316T3CQvESG4
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Observational+equivalences+for+linear+logic+concurrent+constraint+languages&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=HAEMMERL%C3%89%2C+R%C3%89MY&rft.date=2011-07-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=11&rft.issue=4-5&rft.spage=469&rft.epage=485&rft_id=info:doi/10.1017%2FS1471068411000123&rft.externalDocID=10_1017_S1471068411000123
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon