Programming Languages and Systems
21st Asian Symposium, APLAS 2023, Taipei, Taiwan, November 26?29, 2023, Proceedings
Series: Lecture Notes in Computer Science; 14405;
- Publisher's listprice EUR 64.19
-
27 229 Ft (25 932 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 8% (cc. 2 178 Ft off)
- Discounted price 25 050 Ft (23 857 Ft + 5% VAT)
27 229 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 1st ed. 2023
- Publisher Springer
- Date of Publication 23 November 2023
- Number of Volumes 1 pieces, Book
- ISBN 9789819983100
- Binding Paperback
- No. of pages333 pages
- Size 235x155 mm
- Weight 528 g
- Language English
- Illustrations 51 Illustrations, black & white; 43 Illustrations, color 564
Categories
Long description:
Table of Contents:
?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.
More
