Functional and Logic Programming: 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings
Author: Herbert Kuchen, Kazunori Ueda
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-41739-2
DOI: 10.1007/3-540-44716-4

Table of Contents:

• The Metalanguage λprolog and Its Implementation
  
• A Scalable Architecture for Proof-Carrying Code
  
• Parameterized Logic Programs where Computing Meets Learning
  
• 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
  
• 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
  
• 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
  
• A General Type Inference Framework for Hindley/Milner Style Systems
  
• Monadic Encapsulation with Stack of Regions
  
• Well-Typed Logic Programs Are not Wrong
  
• A Framework for Analysis of Typed Logic Programs
  
• Abstract Compilation for Sharing Analysis