000 04077nam a22006015i 4500
001 978-3-540-76637-7
003 DE-He213
005 20240730164243.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540766377
_9978-3-540-76637-7
024 7 _a10.1007/978-3-540-76637-7
_2doi
050 4 _aQA76.76.C65
072 7 _aUMC
_2bicssc
072 7 _aCOM010000
_2bisacsh
072 7 _aUMC
_2thema
082 0 4 _a005.45
_223
245 1 0 _aProgramming Languages and Systems
_h[electronic resource] :
_b5th Asian Symposium, APLAS 2007, Singapore, November 28-December 1, 2007, Proceedings /
_cedited by Zhong Shao.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXI, 436 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aProgramming and Software Engineering,
_x2945-9168 ;
_v4807
505 0 _aInvited Talk 1 -- X10: Concurrent Programming for Modern Architectures -- The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification -- Local Reasoning for Storable Locks and Threads -- Monadic, Prompt Lazy Assertions in Haskell -- Translation Correctness for First-Order Object-Oriented Pattern Matching -- Persistent Oberon: A Programming Language with Integrated Persistence -- More Typed Assembly Languages for Confidentiality -- A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics -- On a Tighter Integration of Functional and Logic Programming -- Invited Talk 2 -- Scalable Simulation of Cellular Signaling Networks -- Timed, Distributed, Probabilistic, Typed Processes -- A Probabilistic Applied Pi-Calculus -- Type-Based Verification of Correspondence Assertions for Communication Protocols -- Deriving Compilers and Virtual Machines for a Multi-level Language -- Finally Tagless, Partially Evaluated -- Polymorphic Delimited Continuations -- Adjunct Elimination in Context Logic for Trees -- Positive Arithmetic Without Exchange Is a Subclassical Logic -- Mixed Inductive/Coinductive Types and Strong Normalization -- Invited Talk 3 -- Static and Dynamic Analysis: Better Together -- The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer -- An Efficient SSA-Based Algorithm for Complete Global Value Numbering -- A Systematic Approach to Probabilistic Pointer Analysis -- Complete Lattices and Up-To Techniques -- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract -- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence -- Call-by-Name and Call-by-Value in Normal Modal Logic -- Call-by-Value Is Dual to Call-by-Name, Extended.
650 0 _aCompilers (Computer programs).
_93350
650 0 _aSoftware engineering.
_94138
650 0 _aComputer science.
_99832
650 0 _aOperating systems (Computers).
_95329
650 0 _aComputer programming.
_94169
650 0 _aMachine theory.
_983335
650 1 4 _aCompilers and Interpreters.
_931853
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aOperating Systems.
_937074
650 2 4 _aProgramming Techniques.
_983339
650 2 4 _aFormal Languages and Automata Theory.
_983340
700 1 _aShao, Zhong.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_983342
710 2 _aSpringerLink (Online service)
_983343
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540766360
776 0 8 _iPrinted edition:
_z9783540845751
830 0 _aProgramming and Software Engineering,
_x2945-9168 ;
_v4807
_983345
856 4 0 _uhttps://doi.org/10.1007/978-3-540-76637-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c85490
_d85490