Buch, Englisch, 411 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 645 g
18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009, Proceedings
Buch, Englisch, 411 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 645 g
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-642-00589-3
Verlag: Springer
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
- Mathematik | Informatik EDV | Informatik Betriebssysteme Windows Betriebssysteme
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
Weitere Infos & Material
Typed Functional Programming.- Well-Typed Programs Can’t Be Blamed.- Exploring the Design Space of Higher-Order Casts.- Practical Variable-Arity Polymorphism.- Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming.- ETAPS Invited Talk.- Using Category Theory to Design Programming Languages.- Computational Effects.- Modular Monad Transformers.- Handlers of Algebraic Effects.- Types for Object-Oriented Languages.- Is Structural Subtyping Useful? An Empirical Study.- An Interval-Based Inference of Variant Parametric Types.- Existential Quantification for Variant Ownership.- Verification.- Formalising and Verifying Reference Attribute Grammars in Coq.- Verified, Executable Parsing.- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees.- Amortised Memory Analysis Using the Depth of Data Structures.- ESOP Invited Talk.- The Financial Crisis, a Lack of Contract Specification Tools: What Can Finance Learn from Programming Language Design?.- Security.- All Secrets Great and Small.- Type-Based Automated Verification of Authenticity in Cryptographic Protocols.- Concurrency.- A Theory of Non-monotone Memory (Or: Contexts for free).- Abstraction for Concurrent Objects.- Minimization Algorithm for Symbolic Bisimilarity.- Service-Oriented Computing.- Conversation Types.- Abstract Processes in Orchestration Languages.- Global Principal Typing in Partially Commutative Asynchronous Sessions.- Tisa: A Language Design and Modular Verification Technique for Temporal Policies in Web Services.- Parallel and Concurrent Programming.- Automatic Parallelization with Separation Logic.- Deny-Guarantee Reasoning.- A Basis for Verifying Multi-threaded Programs.- SingleTrack: A Dynamic Determinism Checker for Multithreaded Programs.