Cantitate/Preț
Produs
Total produse
Vezi coșul
Functional and Logic Programming: 13th International Symposium, FLOPS 2016, Kochi, Japan, March 4-6, 2016, Proceedings de Oleg Kiselyov

Functional and Logic Programming: 13th International Symposium, FLOPS 2016, Kochi, Japan, March 4-6, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9613

Editat de Oleg Kiselyov, Andy King
en Limba Engleză Paperback – 23 feb 2016
This bookconstitutes the proceedings of the 13th International Symposium on Functionaland Logic Programming, FLOPS 2016, held in Kochi, Japan, in March 2016.
The 14 papers presented in this volume were carefully reviewed and selectedfrom 36 submissions. They cover the following topics: functional and logicprogramming; program transformation and re-writing; and extracting programsfrom proofs of their correctness. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31848 lei

Preț vechi: 39810 lei
-20% Nou

Puncte Express: 478
Preț estimativ în valută:
5635€ • 6617$ • 4946£

Carte tipărită la comandă

Livrare economică 28 ianuarie-11 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319296036
ISBN-10: 3319296035
Pagini: 253
Ilustrații: XII, 253 p. 55 illus. in color.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Logic/ConstraintProgramming and Concurrency: The Hard-Won Lessons of the Fifth GenerationComputer Project.- From Sets to Bits in Coq.- From proposition to program:embedding the refinement calculus in Coq.- The Boolean Constraint Solver ofSWI-Prolog: System Description.- Probabilistic inference by programtransformation in Hakaru: System description.- An interaction net encoding ofGodel's System T.- Space-efficient Planar Acyclicity Constraints: A DeclarativePearl.- Executable Relational Specifications of Polymorphic Type Systems usingProlog.- Proof Relevant Corecursive Resolution.- A Coq Library For InternalVerification of Running-Times.- A Transformational Approach to ParametricAccumulated-cost Static Profiling.- Polymorphic Types in Erlang FunctionSpecifications.- Declarative foreign function binding through genericprogramming.- Declarative Programming with Algebra.

Caracteristici

Includes supplementary material: sn.pub/extras