Typed Lambda Calculi and Applications

Jean-Yves Girard

ISBN 10: 3540657630 / ISBN 13: 9783540657637

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 1999, 1999

Riguardo questo articolo

This item is printed on demand - it takes 3-4 days longer - Neuware -Thisvolumerepresents the proceedings ofthe Fourth International Conference onTypedLambdaCalculiandApplications,TLCA 99,heldinL Aquila,on7-9 April1999. It contains25contributions. Fiftywere submitted, their overallqualitywas high, and selection was di cult. The Programme Committee is very grateful toeveryonewhosubmittedapaper. Italsocontainstwopapersintroducingthe demos of tlcasoftware ,i. e. industrialproductsmakinguseoftypedlamb- calculi. Thetutorialson DenotationalsemanticsbyThomasEhrhardandJohnLongley,and IntersectiontypesbyMarioCoppoandMariangiolaDezaniarenotincluded inthisvolume. Theeditor wishestothankthemembersoftheProgrammeCommitteeand theOrganizingCommitteelisted, fortheir hard work andsupport, witha s- cial mention for Benedetto Intrigila. He also thanks Corrado Boh m for kindly acceptingthe taskofdeliveringabanquetspeech. Theeditor alsoexpresses hisgratitude to allthereferees listed on the next page,as wellas tothose whowishnotto belisted fortheiressential assistance andtimegenerouslygiven. Marseille,January1999 Jean-YvesGirard ProgrammeCommittee S. Abramsky(Edinburgh) T. Coquand(Got eborg) 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) OrganizingCommittee F. Corradini,A. Formisano,B. Intrigila,(Chair),M. -C. Meo, M. Nesi,A. Pierantonio,I. Salvo,S. Sorgi (Dip. Matematica, L AquilaandDip. Informatica,LaSapienza, 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. DeGroote U. DeLiguoro M. Dezani R. Dickho 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. McBride M. Marz R. Matthes P. -A. Mellies G. Mitschke H. Nickau S. Nishizaki M. Parigot C. Paulin F. Pfenning B. 412 pp. Englisch.

Codice articolo 9783540657637

Dati bibliografici

• Titolo: Typed Lambda Calculi and Applications
• Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 1999
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 3540657630
• ISBN 13: 9783540657637
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 23 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 23 millimetri di profondità
• Peso: 622 grammi

Descrizione articolo

Riassunto

DeGroote U. DeLiguoro M. Dezani R. Dickho? 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. McBride M. Marz R. Matthes P. -A. Mellies G. Mitschke H. Nickau S. Nishizaki M. Parigot C. Paulin F. Pfenning B.

Contenuti

Invited Demonstration.- The Coordination Language Facility and Applications.- AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem.- Contributions.- Modules in Non-commutative Logic.- Elementary Complexity and Geometry of Interaction.- Quantitative Semantics Revisited.- Total Functionals and Well-Founded Strategies.- Counting a Type’s Principal Inhabitants.- Useless-Code Detection and Elimination for PCF with Algebraic Data Types.- Every Unsolvable ? Term has a Decoration.- Game Semantics for Untyped ???-Calculus.- A Finite Axiomatization of Inductive-Recursive Definitions.- Lambda Definability with Sums via Grothendieck Logical Relations.- Explicitly Typed ??-Calculus for Polymorphism and Call-by-Value.- Soundness of the Logical Framework for Its Typed Operational Semantic.- Logical Predicates for Intuitionistic Linear Type Theories.- Polarized Proof-Nets: Proof-Nets for LC.- Call-by-Push-Value: A Subsuming Paradigm.- A Study of Abramsky’s Linear Chemical Abstract Machine.- Resource Interpretations, Bunched Implications and the ??-Calculus (Preliminary Version).- A Curry-Howard Isomorphism for Compilation and Program Execution.- Natural Deduction for Intuitionistic Non-commutative Linear Logic.- A Logic for Abstract Data Types as Existential Types.- Characterising Explicit Substitutions which Preserve Termination.- Explicit Environments.- Consequences of Jacopini’s Theorem: Consistent Equalities and Equations.- Strong Normalisation of Cut-Elimination in Classical Logic.- Pure Type Systems with Subtyping.