Functional and Logic Programming 5th International Symposium, FLOPS 2001, Tokyo, Japan, March 7-9, 2001. Proceedings

This book constitutes the refereed proceedings of the 5th International Symposium on Functional and Logic Programming, FLOPS 2001, held in Tokyo, Japan in March 2001.The 21 revised full papers presented together with three invited papers were carefully reviewed and selected from 40 submissions. The book offers topical sections on functional programming, logic programming, functional logic programming, types, program analysis and transformation, and Lambda calculus.

Invited Papers.- The Metalanguage ?prolog and Its Implementation.- A Scalable Architecture for Proof-Carrying Code.- Parameterized Logic Programs where Computing Meets Learning.- Functional Programming.- Proving Syntactic Properties of Exceptions in an Ordered Logical Framework.- A Higher-Order Colon Translation.- Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine.- Logic Programming.- A Higher-Order Logic Programming Language with Constraints.- Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and ?Prolog ? A Case-study ?.- An Effective Bottom-Up Semantics for First-Order Linear Logic Programs.- Functional Logic Programming.- A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs.- Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs.- Adding Linear Constraints over Real Numbers to Curry.- A Complete Selection Function for Lazy Conditional Narrowing.- An Abstract Machine Based System for a Lazy Narrowing Calculus.- Incremental Learning of Functional Logic Programs.- Types.- A General Type Inference Framework for Hindley/Milner Style Systems.- Monadic Encapsulation with Stack of Regions.- Well-Typed Logic Programs Are not Wrong.- Program Analysis and Transformation.- A Framework for Analysis of Typed Logic Programs.- Abstract Compilation for Sharing Analysis.- A Practical Partial Evaluator for a Multi-Paradigm Declarative Language.- A Simple Take on Typed Abstract Syntax in Haskell-like Languages.- Calculus.- A simply typed context calculus with first-class environments.- Refining the Barendregt Cube using Parameters.