Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
This book constitutes the proceedings of the 16th International Symposium on Functional and Logic Programming, FLOPS 2022, held in Kyoto, Japan, in May 2022.
The 12 papers presented in this volume were carefully reviewed and selected from 30 submissions. Additionally, the volume includes two system descriptions and a declarative pearl paper. The papers cover all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming focusing on topics such as functional programming, logic programming, declarative programming, constraint programming, formal method, model checking, program transformation, program refinement, and type theory.
Series
Edition
Language
Place of publication
Publishing group
Springer International Publishing
Product notice
Illustrations
XVI, 283 p. 68 illus., 14 illus. in color.
File size
ISBN-13
978-3-030-99461-7 (9783030994617)
DOI
10.1007/978-3-030-99461-7
Schweitzer Classification
Enhancing expressivity of checked corecursive streams.- Improving Type Error Reporting for Type Classes.- Asynchronous Unfold/Fold Transformation for Fixpoint Logic.- Program Logic for Higher-Order Probabilistic Programs in Isabelle/HOL.- Generating C (System Description).- Translation Certification for Smart Contracts.- Zipping Strategies and Attribute Grammars.- Unified Program Generation and Verification: A Case Study on Number-Theoretic Transform.- Scheduling Complexity of Interleaving Search.- Automated Generation of Control Concepts Annotation Rules Using Inductive Logic Programming (System Description).- A Functional Account of Probabilistic Programming with Possible Worlds (Declarative Pearl).- Explanations as Programs in Probabilistic Logic Programming.- FOLD-R++: A Scalable Toolset for Automated Inductive Learning of Default Theories from Mixed Data.- A Lazy Desugaring System for Evaluating Programs with Sugars.- On Transforming Cut- and Quantifier-Free Cyclic Proofs into Rewriting-Induction Proofs.
