000 03958nam a22006255i 4500
001 978-3-642-12251-4
003 DE-He213
005 20240423125313.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.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_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-Oriola.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXI, 355 p. 46 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_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 programming.
650 0 _aSoftware engineering.
650 0 _aComputer science.
650 0 _aCompilers (Computer programs).
650 0 _aMachine theory.
650 0 _aArtificial intelligence.
650 1 4 _aProgramming Techniques.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aArtificial Intelligence.
700 1 _aBlume, Matthias.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKobayashi, Naoki.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aVidal-Oriola, Germán.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642122507
776 0 8 _iPrinted edition:
_z9783642122521
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6009
856 4 0 _uhttps://doi.org/10.1007/978-3-642-12251-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c176485
_d176485