Programming Languages and Systems
Editat de Chung-Kil Huren Limba Engleză Paperback – 23 noi 2023
This book constitutes the refereed proceedings of the 21st Asian Symposium on Programming Languages and Systems, APLAS 2023, held in Taipei, Taiwan, during November 26–29, 2023.
The 15 full papers included in this book are carefully reviewed and selected from 32 submissions. They were organized in topical sections as follows: semantics, logics, and foundational theory; design of languages, type systems, and foundational calculi; domain-specific languages; compilers, interpreters, and abstract machines; program derivation, synthesis, and transformation; program analysis, verification, and model-checking; logic, constraint, probabilistic, and quantum programming; software security; concurrency and parallelism; tools and environments for programming and implementation; and applications of SAT/SMT to programming and implementation.
Preț: 378.09 lei
Preț vechi: 472.62 lei
-20% Nou
Puncte Express: 567
Preț estimativ în valută:
66.89€ • 78.05$ • 58.48£
66.89€ • 78.05$ • 58.48£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789819983100
ISBN-10: 981998310X
Pagini: 344
Ilustrații: X, 333 p. 94 illus., 43 illus. in color.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:1st edition 2023
Editura: Springer
Locul publicării:Singapore, Singapore
ISBN-10: 981998310X
Pagini: 344
Ilustrații: X, 333 p. 94 illus., 43 illus. in color.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:1st edition 2023
Editura: Springer
Locul publicării:Singapore, Singapore
Cuprins
Types.- Compilation Semantics for a Programming Language with Versions.- What Types are Needed for Typing Dynamic Objects? A Python-based Empirical Study.- Types and Semantics for Extensible Data Types.- Functional Languages.- A Diamond Machine for Strong Evaluation.- Proofs as Terms, Terms as Graphs.- Typed Non-determinism in Functional and Concurrent Calculi.- Interactive Theorem Proving.- A Fresh Look at Commutativity: Free Algebraic Structures via Fresh Lists.- Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions.- Experimenting with an Intrinsically-typed Probabilistic Programming Language in Coq.- Verification.- Towards a Framework for Developing Verified Assemblers for the ELF Format.- Transport via Partial Galois Connections and Equivalences.- Argument Reduction of Constrained Horn Clauses Using Equality Constraints.- Static Analysis and Testing.- Incorrectness Proofs for Object-Oriented Programs via Subclass Reflection.- m-CFA Exhibits Perfect Stack Precision.- TorchProbe: Fuzzing Dynamic Deep Learning Compilers.