000			03557nam a22005535i 4500
001			978-3-642-12251-4
003			DE-He213
005			20160624102141.0
007			cr nn 008mamaa
008			100411s2010 gw | s |||| 0|eng d
020			_a9783642122514 _9978-3-642-12251-4
024	7		_a10.1007/978-3-642-12251-4 _2doi
050		4	_aQA76.758
072		7	_aUMZ _2bicssc
072		7	_aCOM051230 _2bisacsh
082	0	4	_a005.1 _223
245	1	0	_aFunctional and Logic Programming _h[electronic resource] : _b10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings / _cedited by Matthias Blume, Naoki Kobayashi, Germán Vidal.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_aXI, 355p. 46 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v6009
505	0		_aInvited Talks -- Beluga: Programming with Dependent Types, Contextual Data, and Contexts -- Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs -- Solving Constraint Satisfaction Problems with SAT Technology -- Refereed Papers -- A Church-Style Intermediate Language for ML F -- ??: Dependent Types without the Sugar -- Haskell Type Constraints Unleashed -- A Functional Framework for Result Checking -- Tag-Free Combinators for Binding-Time Polymorphic Program Generation -- Code Generation via Higher-Order Rewrite Systems -- A Complete Axiomatization of Strict Equality -- Standardization and Böhm Trees for ??-Calculus -- An Integrated Distance for Atoms -- A Pearl on SAT Solving in Prolog -- Automatically Generating Counterexamples to Naive Free Theorems -- Applying Constraint Logic Programming to SQL Test Case Generation -- Internal Normalization, Compilation and Decompilation for System -- Towards Normalization by Evaluation for the ??-Calculus of Constructions -- Defunctionalized Interpreters for Call-by-Need Evaluation -- Complexity Analysis by Graph Rewriting -- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and ?-Calculus -- Proving Injectivity of Functions via Program Inversion in Term Rewriting -- Delimited Control in OCaml, Abstractly and Concretely: System Description -- Automatic Parallelization of Recursive Functions Using Quantifier Elimination -- A Skeleton for Distributed Work Pools in Eden.
650		0	_aComputer science.
650		0	_aSoftware engineering.
650		0	_aLogic design.
650		0	_aArtificial intelligence.
650	1	4	_aComputer Science.
650	2	4	_aSoftware Engineering.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aProgramming Languages, Compilers, Interpreters.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aArtificial Intelligence (incl. Robotics).
650	2	4	_aProgramming Techniques.
700	1		_aBlume, Matthias. _eeditor.
700	1		_aKobayashi, Naoki. _eeditor.
700	1		_aVidal, Germán. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642122507
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6009
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-12251-4
942			_2EBK8985 _cEBK
999			_c38279 _d38279