000 03533nam a22005775i 4500
001 978-3-540-24754-8
003 DE-He213
005 20240423125003.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540247548
_9978-3-540-24754-8
024 7 _a10.1007/b96926
_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] :
_b7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004, Proceedings /
_cedited by Yukiyoshi Kameyama, Peter J. Stuckey.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aX, 307 p.
_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,
_x1611-3349 ;
_v2998
505 0 _aInvited Papers -- A Brief Survey of Quantum Programming Languages -- Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic -- Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework -- Refereed Papers Logic and Functional-Logic Programming -- Online Justification for Tabled Logic Programs -- Constructive Intensional Negation -- Analysing Definitional Trees: Looking for Determinism -- Applications -- : a Declarative Debugging Tool for Functional-Logic Languages -- LIX: an Effective Self-applicable Partial Evaluator for Prolog -- Program Analysis -- Multivariant Non-failure Analysis via Standard Abstract Interpretation -- Set-Sharing Is Not Always Redundant for Pair-Sharing -- Backward Pair Sharing Analysis -- Rewriting -- Implementing Natural Rewriting and Narrowing Efficiently -- Complete Axiomatization of an Algebraic Construction of Graphs -- Sub-Birkhoff -- Types and Modules -- Relaxing the Value Restriction -- Rigid Mixin Modules -- Logic and Semantics -- Semantics of Linear Continuation-Passing in Call-by-Name -- A Direct Proof of Strong Normalization for an Extended Herbelin’s Calculus -- Functional Programming -- Normalization by Evaluation for ? ?2 -- Basic Pattern Matching Calculi: a Fresh View on Matching Failure -- Derivation of Deterministic Inverse Programs Based on LR Parsing.
650 0 _aComputer programming.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 1 4 _aProgramming Techniques.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aArtificial Intelligence.
700 1 _aKameyama, Yukiyoshi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aStuckey, Peter J.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540214021
776 0 8 _iPrinted edition:
_z9783662208984
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2998
856 4 0 _uhttps://doi.org/10.1007/b96926
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c172956
_d172956