1 option
Functional and Logic Programming : 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004, Proceedings / edited by Yukiyoshi Kameyama, Peter J. Stuckey.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2998.
- Lecture Notes in Computer Science, 0302-9743 ; 2998
- Language:
- English
- Subjects (All):
- Computer programming.
- Programming languages (Electronic computers).
- Computer logic.
- Artificial intelligence.
- Programming Techniques.
- Programming Languages, Compilers, Interpreters.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Local Subjects:
- Programming Techniques.
- Programming Languages, Compilers, Interpreters.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (X, 307 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-24754-8
- 9783540247548
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.