Verkauf durch Sack Fachmedien

Danvy / Filinski

Programs as Data Objects

Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings

Medium: Buch
ISBN: 978-3-540-42068-2
Verlag: Springer
Erscheinungstermin: 25.04.2001
Lieferfrist: bis zu 10 Tage

CatarinaCoquand ChalmersUniversity,Sweden RadhiaCousot EcolePolytechnique,France OlivierDanvy UniversityofAarhus,Denmark AndrzejFilinski UniversityofAarhus,Denmark YoshihikoFutamura WasedaUniversity,Japan FritzHenglein ITUniversity,Denmark PeterLee CarnegieMellonUniversity,USA Y. AnnieLiu SUNYStonyBrook,USA DaveMacQueen BellLabs,USA JamesS. Royer SyracuseUniversity,USA MortenHeineSørensen ITPractice,Denmark CarolynL. Talcott StanfordUniversity,USA JonLWhite CommerceOne,Inc. ,USA Additional Referees ZinoBenaissa,EdoardoS. Biagioni,HowardA. Blair,CraigChambers,Wei- NganChin,LarsR. Clausen,PierreCointe,ThierryCoquand,NielsDamgaard, DanielDamian,DamienDoligez,R´emiDouence,R. KentDybvig,PavelEmel- nov,GilbertoFil´e,JohnGallagher,RobertoGiacobazzi,RobertGl¨ uck,John Hatcli?,NevinHeintze,ThomasHildebrandt,ZhenjiangHu,DieterHutter, KazuhikoKakehi,JerzyKarczmarczuk,AndyKing,NaokiKobayashi,Zenjiro Konishi,KimG. Larsen,MarioLatendresse,JuliaL. Lawall,MichaelLeuschel, JakobLichtenberg,FrancescoLogozzo,HenningMakholm,JacquesMalenfant, BrianMayoh,AntoineMin´e,TorbenÆ. Mogensen,EugenioMoggi,DavidM- niaux,PeterD. Mosses,JoachimNiehren,SusanOlder,AlbertoPettorossi, Franco ¸isPottier,MaurizioProietti,AarneRanta,JakobRehof,JohnReppy, Laurent R´ eveill`ere,MartinC. Rinard,Kristo?erH. Rose,AbhikRoychoudhury, LouisSalvail,Jo˜aoSaraiva,DavidA. Schmidt,JensPeterSecher,MarioS¨udholt, S. DoaitseSwierstra,HaraldSøndergaard,ArnaudVenet,HongweiXi,ZheYang, Kwangkeun Yi. TableofContents InvitedOpeningTalk Program Analysis for Implicit Computational Complexity. 1 NeilD. Jones ContributedPapers Deriving Pre-conditions for Array Bound Check Elimination. 2 Wei-NganChin,Siau-ChengKhoo,DanaN. Xu Type Systems for Useless-Variable Elimination. 25 AdamFischbach,JohnHannan Boolean Constraints for Binding-Time Analysis. 39 KevinGlynn,PeterJ. Stuckey,MartinSulzmann,HaraldSøndergaard Constraint Abstractions. 63 J¨orgenGustavsson,JosefSvenningsson Implementing Circularity Using Partial Evaluation.


Produkteigenschaften


  • Artikelnummer: 9783540420682
  • Medium: Buch
  • ISBN: 978-3-540-42068-2
  • Verlag: Springer
  • Erscheinungstermin: 25.04.2001
  • Sprache(n): Englisch
  • Auflage: Erscheinungsjahr 2001
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert, Paperback
  • Gewicht: 452 g
  • Seiten: 286
  • Format (B x H x T): 155 x 235 x 17 mm
  • Ausgabetyp: Kein, Unbekannt
Autoren/Hrsg.

Herausgeber

Invited Opening Talk.- Program Analysis for Implicit Computational Complexity.- Contributed Papers.- Deriving Pre-conditions for Array Bound Check Elimination.- Type Systems for Useless-Variable Elimination.- Boolean Constraints for Binding-Time Analysis.- Constraint Abstractions.- Implementing Circularity Using Partial Evaluation.- Combining Forward And Backward Analyses of Temporal Properties.- Numerical Power Analysis.- Run-Time Bytecode Specialization.- A New Numerical Abstract Domain Based on Difference-Bound Matrices.- Partial Evaluation for Class-Based Object-Oriented Languages.- Driving in the Jungle.- Higher-Order Pattern Matching for Automatically Applying Fusion Transformations.- Dynamic Partial Evaluation.- Tag Elimination and Jones-Optimality.- Invited Closing Talk.- Bottom-Up Deduction with Deletion and Priorities.