LEADER 05591nam 22007935 450 001 9910483579003321 005 20251113182618.0 010 $a1-280-38584-7 010 $a9786613563767 010 $a3-642-11999-9 024 7 $a10.1007/978-3-642-11999-6 035 $a(CKB)2670000000010121 035 $a(SSID)ssj0000399481 035 $a(PQKBManifestationID)11275098 035 $a(PQKBTitleCode)TC0000399481 035 $a(PQKBWorkID)10376186 035 $a(PQKB)10157004 035 $a(DE-He213)978-3-642-11999-6 035 $a(MiAaPQ)EBC3065104 035 $a(PPN)149059779 035 $a(BIP)29190066 035 $a(EXLCZ)992670000000010121 100 $a20100316d2010 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFunctional and Constraint Logic Programming $e18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers /$fedited by Santiago Escobar 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (IX, 179 p. 35 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5979 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-11998-0 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Programming with Multiple Paradigms in Lua -- Constraint Based Strategies -- Contributed Papers -- Integrating ILOG CP Technology into -- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures -- Semantic Labelling for Proving Termination of Combinatory Reduction Systems -- A Taxonomy of Some Right-to-Left String-Matching Algorithms -- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types -- Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation -- New Results on Type Systems for Functional Logic Programming -- A Simple Region Inference Algorithm for a First-Order Functional Language -- A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions. 330 $aThisvolumecontainsaselectionofthepaperspresentedatthe18thInternational Workshop on Functional and (Constraint) Logic Programming (WFLP 2009), held on June 28, 2009 in Brasī ?lia, Brazil. Previous WFLP meetings were held in Siena (2008), Paris (2007), Madrid (2006), Tallinn (2005), Aachen (2004), Valencia (2003),Grado(2002),Kiel(2001),Benicassim(2000),Grenoble(1999), Bad Honnef (1998), Schwarzenberg (1997, 1995, and 1994), Marburg (1996), Rattenberg (1993), and Karlsruhe (1992). The aim of the WFLP series is to bring together researchers interested in functional programming, (constraint) logic programming, as well as the integ- tion of the two paradigms. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the di'erent commu- ties interested in the foundations, applications, and combinations of high-level, declarative programming languages and related areas. WFLP 2009 solicited papers in all areas of functional and (constraint) logic programming, including but not limited to: - Foundations:formalsemantics,rewritingandnarrowing,non-monotonicr- soning, dynamics, and type theory. - Language Design: modules and type systems, multi-paradigm languages, concurrency and distribution, and objects. - Implementation: abstract machines, parallelism, compile-time and run-time optimizations, and interfacing with external languages. - Transformation and Analysis: abstract interpretation, specialization, partial evaluation, program transformation, and meta-programming. - Software Engineering: design patterns, speci'cation, veri'cation and vali- tion, debugging, and test generation. - IntegrationofParadigms:integrationofdeclarativeprogrammingwithother paradigms such as imperative, object-oriented, concurrent, and real-time programming. - Applications: declarative programming in education and industry, doma- speci'c languages, visual/graphical user interfaces, embedded systems, WWW applications, knowledge representation and machine learning, - ductive databases, advanced programming environments and tools. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5979 606 $aMachine theory 606 $aSoftware engineering 606 $aComputer science 606 $aCompilers (Computer programs) 606 $aArtificial intelligence 606 $aFormal Languages and Automata Theory 606 $aSoftware Engineering 606 $aComputer Science Logic and Foundations of Programming 606 $aCompilers and Interpreters 606 $aArtificial Intelligence 615 0$aMachine theory. 615 0$aSoftware engineering. 615 0$aComputer science. 615 0$aCompilers (Computer programs) 615 0$aArtificial intelligence. 615 14$aFormal Languages and Automata Theory. 615 24$aSoftware Engineering. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aCompilers and Interpreters. 615 24$aArtificial Intelligence. 676 $a005.131 701 $aEscobar$b Santiago$01439236 712 12$aWFLP 2009 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483579003321 996 $aFunctional and constraint logic programming$94204135 997 $aUNINA