LEADER 04500nam  22008175  450 
001 996465307903316
005 20230220095144.0
010   $a1-280-38608-8
010   $a9786613564009
010   $a3-642-12251-5
024 7 $a10.1007/978-3-642-12251-4
035   $a(CKB)2560000000009128
035   $a(SSID)ssj0000399482
035   $a(PQKBManifestationID)11249184
035   $a(PQKBTitleCode)TC0000399482
035   $a(PQKBWorkID)10383549
035   $a(PQKB)11080413
035   $a(DE-He213)978-3-642-12251-4
035   $a(MiAaPQ)EBC3065220
035   $a(PPN)149073429
035   $a(Association for Computing Machinery)10.5555/2175429
035   $a(EXLCZ)992560000000009128
100   $a20100411d2010      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFunctional and Logic Programming $e10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010, Proceedings /$fedited by Matthias Blume, Naoki Kobayashi, Germán Vidal-Oriola
205   $a1st ed. 2010.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010.
215   $a1 online resource (XI, 355 p. 46 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6009
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-12250-7 
320   $aIncludes bibliographical references and index.
327   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6009
517 3 $aFLOPS'10
606   $aComputer programming
606   $aSoftware engineering
606   $aComputer science
606   $aCompilers (Computer programs)
606   $aMachine theory
606   $aArtificial intelligence
606   $aProgramming Techniques
606   $aSoftware Engineering
606   $aComputer Science Logic and Foundations of Programming
606   $aCompilers and Interpreters
606   $aFormal Languages and Automata Theory
606   $aArtificial Intelligence
615  0$aComputer programming.
615  0$aSoftware engineering.
615  0$aComputer science.
615  0$aCompilers (Computer programs).
615  0$aMachine theory.
615  0$aArtificial intelligence.
615 14$aProgramming Techniques.
615 24$aSoftware Engineering.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aCompilers and Interpreters.
615 24$aFormal Languages and Automata Theory.
615 24$aArtificial Intelligence.
676   $a005.11
702   $aBlume$b Matthias$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKobayashi$b Naoki$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aVidal-Oriola$b Germán$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465307903316
996   $aFunctional and Logic Programming$9772537
997   $aUNISA