Functional and Logic Programming: 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings<br />Author: Herbert Kuchen, Kazunori Ueda<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-41739-2<br /> DOI: 10.1007/3-540-44716-4<br /><br />Table of Contents:<p></p><ul><li>The Metalanguage λprolog and Its Implementation </li><li>A Scalable Architecture for Proof-Carrying Code </li><li>Parameterized Logic Programs where Computing Meets Learning </li><li>Proving Syntactic Properties of Exceptions in an Ordered Logical Framework </li><li>A Higher-Order Colon Translation </li><li>Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine </li><li>A Higher-Order Logic Programming Language with Constraints </li><li>Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and λProlog ‐ A Case-study ‐ </li><li>An Effective Bottom-Up Semantics for First-Order Linear Logic Programs </li><li>A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs </li><li>Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs </li><li>Adding Linear Constraints over Real Numbers to Curry </li><li>A Complete Selection Function for Lazy Conditional Narrowing </li><li>An Abstract Machine Based System for a Lazy Narrowing Calculus </li><li>Incremental Learning of Functional Logic Programs </li><li>A General Type Inference Framework for Hindley/Milner Style Systems </li><li>Monadic Encapsulation with Stack of Regions </li><li>Well-Typed Logic Programs Are not Wrong </li><li>A Framework for Analysis of Typed Logic Programs </li><li>Abstract Compilation for Sharing Analysis</li></ul>