Programming Languages and Systems

21st Asian Symposium, APLAS 2023, Taipei, Taiwan, November 26-29, 2023, Proceedings
1. Auflage 2023
ISBN: 978-981-99-8310-0
Verlag: Springer

Buch, Englisch, Band 14405, 333 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 522 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Hur, Chung-Kil

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik

Inhaltsverzeichnis

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.