Typed Lambda Calculi and Applications: 4th International Conference, TLCA’99 L’Aquila, Italy, April 7–9, 1999 Proceedings

409 Pages·1999·8.28 MB·English

by  Jean-Marc Andreoli (auth.)

Lecture Notes in Computer Science 1581
Editedby G.Goos,J. Hartmanisand J.van Leeuwen
3
Berlin
Heidelberg
NewYork
Barcelona
HongKong
London
Milan
Paris
Singapore
Tokyo
Jean-Yves Girard (Ed.)
Typed Lambda
Calculi
and Applications
4th International Conference, TLCA’99
L’Aquila, Italy, April 7-9, 1999
Proceedings
1 3
SeriesEditors
GerhardGoos,KarlsruheUniversity,Germany
JurisHartmanis,CornellUniversity,NY,USA
JanvanLeeuwen,UtrechtUniversity,TheNetherlands
VolumeEditor
J.-Y.Girard
InstitutdeMathe´matiquesdeLuminy,CNRS-UPR9016
163AvenuedeLuminy,case907
F-13288Marseillecedex9,France
E-mail:[email protected]
Cataloging-in-Publicationdataappliedfor
DieDeutscheBibliothek-CIP-Einheitsaufnahme
Typedlambdacalculiandapplications:4thinternational
conference/TLCA’99,L’Aquila,Italy,April7-9,1999.Jean-Yves
Girard(ed.).-Berlin;Heidelberg;NewYork;Barcelona;Hong
Kong;London;Milan;Paris;Singapore;Tokyo:Springer,1999
(Lecturenotesincomputerscience;Vol.1581)
ISBN3-540-65763-0
CRSubjectClassification(1998):F.4.1,F.3,D.1.1
ISSN0302-9743
ISBN3-540-65763-0Springer-VerlagBerlinHeidelbergNewYork
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer-Verlag.Violationsare
liableforprosecutionundertheGermanCopyrightLaw.
(cid:1)c Springer-VerlagBerlinHeidelberg1999
PrintedinGermany
Typesetting:Camera-readybyauthor
SPIN10703139 06/3142–543210 Printedonacid-freepaper
Preface
This volume represents the proceedings of the Fourth International Conference
onTyped LambdaCalculiandApplications,TLCA’99,held inL’Aquila,on7-9
April 1999.
It contains 25 contributions. Fifty were submitted, their overall quality was
high, and selection was difficult. The Programme Committee is very grateful
to everyone whosubmitted a paper. It alsocontains two papers introducing the
”demos”of”tlcasoftware”,i.e.industrialproducts makinguseoftypedlambda-
calculi.
The tutorials on
– Denotational semantics by Thomas Ehrhard and John Longley,and
– Intersection types byMarioCoppoandMariangiolaDezaniare notincluded
in this volume.
The editor wishes to thank the members of the Programme Committee and
the Organizing Committee listed, for their hard work and support, with a spe-
cial mention for Benedetto Intrigila. He also thanks Corrado Bo¨hm for kindly
accepting the task of delivering a banquet speech.
The editor also expresses his gratitude to all the referees listed on the next
page, as well as to those who wish not to be listed for their essential assistance
and time generously given.
Marseille, January 1999 Jean-Yves Girard
Programme Committee
S. Abramsky (Edinburgh) T. Coquand (Go¨teborg)
J.-Y. Girard (Marseille) ( Chair) R. Hindley (Swansea)
J.-L. Krivine (Paris) J. Reynolds (Pittsburgh)
S. Ronchi (Torino) A. Scedrov (Philadelphia)
T. Streicher(Darmstadt) M. Takahashi (Tˆokyˆo)
P. Urzyczyn (Warszawa)
Organizing Committee
F. Corradini, A. Formisano, B. Intrigila, (Chair), M.-C. Meo,
M. Nesi, A. Pierantonio,I. Salvo, S. Sorgi
(Dip. Matematica , L’Aquilaand Dip.Informatica,La Sapienza, Roma)
Referees
Y. Akama T. Altenkirch F. Barbanera H. Barendregt
O. Bastonero S. Berardi A. Berarducci C. Berline
V. Bono M. Bugliesi F. Cardone G. Castagna
I. Cervesato G.Chen R. Cockett A. Compagnoni
M. Coppo T. Crolard P.-L.Curien V. Danos
R. Davies P. De Groote U. De Liguoro M. Dezani
R. Dickhoff H. Geuvers N. Ghani P. Giannini
S. Guerrini B. Harper R. Hasegawa H. Herbelin
M. Hofmann K. Honda R. Jagadeesan T. Jim
Y. Kameyama M. Kanovich R. Kashima Y. Kinoshita
T. Kurata Y. Lafont J. Laird F. Lamarche
P. B. Levy C. Mc Bride M. Marz R. Matthes
P.-A.Mellies G.Mitschke H. Nickau S. Nishizaki
M. Parigot C. Paulin F. Pfenning B. Pierce
A. Piperno L. Regnier J. Rehof D. Remy
E. Ritter K. Rose L. Roversi P. Roziere
P. Ruet A. Schalk C. Schu¨ermann P.J. Scott
R.A.G.Seely P. Selinger M. H. So¨rensen R. Statman
C. Stewart I. Takeuti M. Tameyama C. Urban
J. Vauzeilles M. Wehr J. Wells H. Yokouchi
Table of Contents
Invited demonstrations
The Coordination Language Facility and Applications
J.-M. Andreoli ............................................................ 1
AnnoDomini in Practice: A Type-Theoretic Approach
to the Year 2000 Problem
P. H. Eidorff, F. Henglein, C. Mossin, H. Niss, M. H. S¨orensen, M. Tofte . 6
Contributions
Modules in Non-commutative Logic
V. M. Abrusci ............................................................ 14
Elementary Complexity and Geometry of Interaction
P. Baillot, M. Pedicini ................................................... 25
Quantitative Semantics Revisited
N. Barreiro, T. Ehrhard .................................................. 40
Total Functionals and Well-Founded Strategies
S. Berardi, U. de’Liguoro ................................................. 54
Counting a Type’s Principal Inhabitants
S. Broda, L. Damas ...................................................... 69
Useless-Code Detection and Elimination for PCF with
Algebraic Data types
F. Damiani .............................................................. 83
Every Unsolvable λ Term has a Decoration
R. David ................................................................. 98
Game Semantics for Untyped λβη-Calculus
P. Di Gianantonio, G. Franco, F. Honsell ............................... 114
A Finite Axiomatization of Inductive-Recursive Definitions
P. Dybjer, A. Setzer .................................................... 129
Lambda Definability with Sums via Grothendieck
Logical Relations
M. Fiore, A. Simpson ................................................... 147
Explicitly Typed λµ-Calculus for Polymorphism and
Call-by-Value
K. Fujita ................................................................ 162
Soundnessof the Logical Framework for Its Typed
Operational Semantics
H. Goguen .............................................................. 177
VIII Table of Contents
Logical Predicates for Intuitionistic Linear Type Theories
M. Hasegawa ............................................................ 198
Polarized Proof-Nets: Proof-Nets for LC
O. Laurent .............................................................. 213
Call-by-Push-Value: A Subsuming Paradigm
P. B. Levy .............................................................. 228
A Study of Abramsky’s Linear Chemical Abstract Machine
S. Mikami, Y. Akama ................................................... 243
Resource Interpretations, Bunched Implications
and the αλ-Calculus
P. W. O’Hearn ......................................................... 258
A Curry-Howard Isomorphism for Compilation
and Program Execution
A. Ohori ................................................................ 280
Natural Deduction for Intuitionistic Non-commutative
Linear Logic
J. Polakow, F. Pfenning ................................................ 295
A Logic for Abstract Data Types as Existential Types
E. Poll, J. Zwanenburg .................................................. 310
Characterising Explicit Substitutionswhich
Preserve Termination
E. Ritter ................................................................ 325
Explicit Environments
M. Sato, T. Sakurai, R. Burstall ........................................ 340
Consequences of Jacopini’s Theorem: Consistent
Equalities and Equations
R. Statman ............................................................. 355
Strong Normalisation of Cut-Elimination in Classical Logic
C. Urban, G. M. Bierman ............................................... 365
Pure Type Systems with Subtyping
J. Zwanenburg .......................................................... 381
Author Index ......................................................... 397
The Coordination Language Facility and
Applications
Jean-Marc Andreoli
Xerox Research Centre Europe, 38240 Grenoble, France,
[email protected],
http://www.xrce.xerox.com
Abstract. ThisshortpapergivesaquickoverviewofCLF,adistributed
object coordination middleware, and two applications of that platform
to workflow. The driving concepts behind CLF derive from a reflection
on proof search in Linear Logic, and in particular, the systematic ex-
ploitation ofits resource conscious nature.
1 CLF: A Coordination Middleware
CLF is born from a reflection on the application of Linear Logic to distributed
object coordination.It exploits the resource-conscious nature of Linear Logic in
the framework of the concurrent logicprogramming paradigm,where computa-
tions are identi(cid:12)ed with proof-search [And92]. Turning a theoretical model of
resource manipulation into a concrete distributed object coordination middle-
ware required two main steps:
{ First, the notions of \resources" and \objects" had to be integrated. This
was achievedthrough amodi(cid:12)cationofthe traditionalobject modelofcom-
putation, makingplain the role of objects as resource managers.
{ Second, the concurrent logic programming paradigm of proof search had
to be adapted to this new object model. This was realized by a scripting
language based on Linear Logic formulae to express coordination.
1.1 The CLF Object Model
TheCLFobjectmodelenrichesthetraditionalonebyviewingobjectsasresource
managers,thusseparating,insidetheobjectstate,theresources themselvesfrom
their management state. Primitives are introduced to (i) inquire and negotiate
objects capabilities in terms of resource availability,(ii) perform basic transac-
tionoperationsovertheresources ofseveralobjects(two-phasecommit)and(iii)
request resource insertion.This enriched interaction model(Figure 1)is charac-
terized byaset of8interactionverbs (similartoKQMLperformatives)together
with a protocol describing correct sequences of invocations of these verbs, and
their intended meaning in terms of resource manipulations. Figure 2 gives an
overview of the verbs and the protocol. The interface of a CLF object distin-
guishesbetween \CLFservices", accessed throughtheCLFinteractionprotocol,
andregular methods, accessed through the traditionalrequest/answer protocol.
J.-Y.Girard(Ed.): TLCA’99,LNCS1581,pp. 1–5,1999.
(cid:13)c Springer-VerlagBerlinHeidelberg1999