Programming Languages and Systems : 22nd Asian Symposium, APLAS 2024, Kyoto, Japan, October 22-24, 2024, Proceedings

個数:1
紙書籍版価格
¥14,946
  • 電子書籍

Programming Languages and Systems : 22nd Asian Symposium, APLAS 2024, Kyoto, Japan, October 22-24, 2024, Proceedings

  • 著者名:Kiselyov, Oleg (EDT)
  • 価格 ¥11,311 (本体¥10,283)
  • Springer(2024/10/27発売)
  • ポイント 102pt (実際に付与されるポイントはご注文内容確認画面でご確認下さい)
  • 言語:ENG
  • ISBN:9789819789429
  • eISBN:9789819789436

ファイル: /

Description

This book constitutes the proceedings of the 22nd Asian Symposium on Programming Languages and Systems, APLAS 2024, held in Kyoto, Japan, during October 22-24, 2024.

The 18 full papers presented here were carefully reviewed and selected from 37 submissions. These papers have been categorized under the following topical sections: Type theory and Semantic Frameworks; Probabilistic and Declarative Programming; Quantum Computation; Logical Relations; Verification.

Table of Contents

Type theory and Semantic Frameworks.- Comparing semantic frameworks of dependently sorted algebraic theories.- Random access lists from EE to FP.- Generic Reasoning of the Locally Nameless Representation.- Building A Correct By Construction Type Checker for a Dependently Typed Core.- Extending the Quantitative Pattern Matching Paradigm.- Probabilistic and Declarative Programming.- Hybrid Verification of Declarative Programs with Arithmetic Non Fail Conditions.- Explaining Explanations in Probabilistic Logic Programming.- Quantum Computation.- Quantum Programming Without the Quantum Physics.- Quantum Bisimilarity is a Congruence under Physically Admissible Schedulers.- Non deterministic, probabilistic, and quantum effects through the lens of event structures.- Type Based Verification of Connectivity Constraints in Lattice Surgery.- Logical Relations.- On Computational Indistinguishability and Logical Relations.- Relative Completeness of Incorrectness Separation Logic.- OBRA Oracle based, relational, algorithmic type verification.- Verification.- A Formal Verification Framework for Tezos Smart Contracts Based on Symbolic Execution.- Mode based Reduction from Validity Checking of Fixpoint Logic Formulas to Test Friendly Reachability Problem.- Efficiently Adapting Stateless Model Checking for C11/C++11 to Mixed Size Accesses.- Effective Search Space Pruning for Testing Deep Neural Networks.

最近チェックした商品