04500nam 22008175 450 99646530790331620230220095144.01-280-38608-897866135640093-642-12251-510.1007/978-3-642-12251-4(CKB)2560000000009128(SSID)ssj0000399482(PQKBManifestationID)11249184(PQKBTitleCode)TC0000399482(PQKBWorkID)10383549(PQKB)11080413(DE-He213)978-3-642-12251-4(MiAaPQ)EBC3065220(PPN)149073429(Association for Computing Machinery)10.5555/2175429(EXLCZ)99256000000000912820100411d2010 u| 0engurnn|008mamaatxtccrFunctional and Logic Programming 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010, Proceedings /edited by Matthias Blume, Naoki Kobayashi, Germán Vidal-Oriola1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XI, 355 p. 46 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6009Bibliographic Level Mode of Issuance: Monograph3-642-12250-7 Includes bibliographical references and index.Invited 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.Theoretical Computer Science and General Issues,2512-2029 ;6009FLOPS'10Computer programmingSoftware engineeringComputer scienceCompilers (Computer programs)Machine theoryArtificial intelligenceProgramming TechniquesSoftware EngineeringComputer Science Logic and Foundations of ProgrammingCompilers and InterpretersFormal Languages and Automata TheoryArtificial IntelligenceComputer programming.Software engineering.Computer science.Compilers (Computer programs).Machine theory.Artificial intelligence.Programming Techniques.Software Engineering.Computer Science Logic and Foundations of Programming.Compilers and Interpreters.Formal Languages and Automata Theory.Artificial Intelligence.005.11Blume Matthiasedthttp://id.loc.gov/vocabulary/relators/edtKobayashi Naokiedthttp://id.loc.gov/vocabulary/relators/edtVidal-Oriola Germánedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465307903316Functional and Logic Programming772537UNISA