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

Gopalan Nadathur (auth.), Herbert Kuchen, Kazunori Ueda (eds.)3540417397, 9783540417392

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.

---

Table of contents :
The Metalanguage λprolog and Its Implementation….Pages 1-20
A Scalable Architecture for Proof-Carrying Code….Pages 21-39
Parameterized Logic Programs where Computing Meets Learning….Pages 40-60
Proving Syntactic Properties of Exceptions in an Ordered Logical Framework….Pages 61-77
A Higher-Order Colon Translation….Pages 78-91
Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine….Pages 92-107
A Higher-Order Logic Programming Language with Constraints….Pages 108-122
Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and λProlog ‐ A Case-study ‐….Pages 123-137
An Effective Bottom-Up Semantics for First-Order Linear Logic Programs….Pages 138-152
A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs….Pages 153-169
Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs….Pages 170-184
Adding Linear Constraints over Real Numbers to Curry….Pages 185-200
A Complete Selection Function for Lazy Conditional Narrowing….Pages 201-215
An Abstract Machine Based System for a Lazy Narrowing Calculus….Pages 216-232
Incremental Learning of Functional Logic Programs….Pages 233-247
A General Type Inference Framework for Hindley/Milner Style Systems….Pages 248-263
Monadic Encapsulation with Stack of Regions….Pages 264-279
Well-Typed Logic Programs Are not Wrong….Pages 280-295
A Framework for Analysis of Typed Logic Programs….Pages 296-310
Abstract Compilation for Sharing Analysis….Pages 311-325
A Practical Partial Evaluator for a Multi-Paradigm Declarative Language….Pages 326-342
A Simple Take on Typed Abstract Syntax in Haskell-like Languages….Pages 343-358
A simply typed context calculus with first-class environments….Pages 359-374
Refining the Barendregt Cube using Parameters….Pages 375-389