TY - BOOK AU - Kiselyov,Oleg AU - King,Andy ED - SpringerLink (Online service) TI - Functional and Logic Programming: 13th International Symposium, FLOPS 2016, Kochi, Japan, March 4-6, 2016, Proceedings T2 - Theoretical Computer Science and General Issues SN - 9783319296043 AV - QA76.758 U1 - 005.1 23 PY - 2016/// CY - Cham PB - Springer International Publishing, Imprint: Springer KW - Software engineering KW - Computer logic KW - Programming languages (Electronic computers) KW - Mathematical logic KW - Artificial intelligence KW - Computer programming KW - Software Engineering KW - Logics and Meanings of Programs KW - Programming Languages, Compilers, Interpreters KW - Mathematical Logic and Formal Languages KW - Artificial Intelligence KW - Programming Techniques N1 - Logic/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer Project -- From Sets to Bits in Coq -- From proposition to program: embedding the refinement calculus in Coq -- The Boolean Constraint Solver of SWI-Prolog: System Description -- Probabilistic inference by program transformation in Hakaru: System description -- An interaction net encoding of Godel's System T -- Space-efficient Planar Acyclicity Constraints: A Declarative Pearl -- Executable Relational Specifications of Polymorphic Type Systems using Prolog -- Proof Relevant Corecursive Resolution -- A Coq Library For Internal Verification of Running-Times -- A Transformational Approach to Parametric Accumulated-cost Static Profiling -- Polymorphic Types in Erlang Function Specifications -- Declarative foreign function binding through generic programming -- Declarative Programming with Algebra N2 - This book constitutes the proceedings of the 13th International Symposium on Functional and Logic Programming, FLOPS 2016, held in Kochi, Japan, in March 2016. The 14 papers presented in this volume were carefully reviewed and selected from 36 submissions. They cover the following topics: functional and logic programming; program transformation and re-writing; and extracting programs from proofs of their correctness. UR - https://doi.org/10.1007/978-3-319-29604-3 ER -