This book constitutes the refereed proceedings of the 7th International Symposium on Functional and Logic Programming, FLOPS 2004, held in Nara, Japan, in April 2004. The 18 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 55 submissions. The papers are organized in topical sections on logic and functional-logic programming, applications, program analysis, rewriting, types and modules, logic and semantics, and functional programming.
Edited by:
Yukiyoshi Kameyama, Peter J. Stuckey Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Country of Publication: Germany Edition: 2004 ed. Volume: 2998 Dimensions:
Height: 233mm,
Width: 155mm,
Spine: 17mm
Weight: 1.010kg ISBN:9783540214021 ISBN 10: 354021402X Series:Lecture Notes in Computer Science Pages: 307 Publication Date:24 March 2004 Audience:
College/higher education
,
Professional and scholarly
,
Further / Higher Education
,
Undergraduate
Format:Paperback Publisher's Status: Active
Invited 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.