Muutke küpsiste eelistusi

Functional and Logic Programming: 13th International Symposium, FLOPS 2016, Kochi, Japan, March 4-6, 2016, Proceedings 1st ed. 2016 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 253 pages, kõrgus x laius: 235x155 mm, kaal: 4102 g, 55 Illustrations, color; XII, 253 p. 55 illus. in color., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 9613
  • Ilmumisaeg: 23-Feb-2016
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319296035
  • ISBN-13: 9783319296036
Teised raamatud teemal:
  • Pehme köide
  • Hind: 46,85 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 55,12 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Functional and Logic Programming: 13th International Symposium, FLOPS 2016, Kochi, Japan, March 4-6, 2016, Proceedings 1st ed. 2016Suurem pilt
  • Formaat: Paperback / softback, 253 pages, kõrgus x laius: 235x155 mm, kaal: 4102 g, 55 Illustrations, color; XII, 253 p. 55 illus. in color., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 9613
  • Ilmumisaeg: 23-Feb-2016
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319296035
  • ISBN-13: 9783319296036
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783319296036.html
Märksõnad:

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. 

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.