ThisvolumecontainstheproceedingsoftheFifthInternationalSymposiumon FunctionalandLogicProgramming,FLOPS2001,heldinTokyo,Japan,March 7{9,2001,andhostedbyWasedaUniversity. FLOPSisaforumforresearchonallissuesconcerningfunctionalprogr- ming and logic programming. In particular, it aims to stimulate the cro- fertilizationaswellastheintegrationofthetwoparadigms. ThepreviousFLOPS meetingstookplaceinFuji-Susono(1995),Shonan(1996),Kyoto(1998),and Tsukuba (1999). The proceedings of FLOPS'99 were published by Springer- VerlagasLectureNotesinComputerScience,volume1722. There were 40 submissions, 38 of which were considered by the program 1 / committee. TheycamefromAustralia(5),Belgium( ),Denmark(3),Egypt 3 1 1 2 1 / / / / (1),France( ),Germany(2 ),Italy(4 ),Japan(5),Korea(1 ),Mexico 2 3 3 2 1 1 5 / / / (1),TheNetherlands(1 ),Spain(10 ),Switzerland(1),UK(1 ),andUSA 6 6 6 1 / (1 ). Eachpaperwasreviewedbyatleastthree,andmostlyfour,reviewers. 2 Theprogramcommitteemeetingwasconductedelectronicallyfortheperiodof twoweeksinNovember2000. Asaresultofactivediscussions,21papers(52. 5%) wereselectedforpresentation,whichappearinthisvolume. Inaddition,weare verypleasedtoincludeinthisvolumefullpapersbythreedistinguishedinvited speakers,namelyGopalanNadathur,GeorgeNecula,andTaisukeSato. Onbehalfoftheprogramcommittee,theprogramchairswouldliketothank theinvitedspeakerswhoagreedtogivetalksandcontributepapers,allthosewho submittedpapers,andalltherefereesfortheircarefulworkinthereviewingand selectionprocess. Thesupportofoursponsorsisalsogratefullyacknowledged. Inparticular,wewouldliketothanktheJapanSocietyforSoftwareScience andTechnology(JSSST),SpecialInterestGrouponPrinciplesofProgramming, andtheAssociationforLogicProgramming(ALP). Finally,wewouldliketo thankthemembersoftheorganizingcommittee,notablyZhenjiangHu,Yasuhiro Ajiro, Kazuhiko Kakehi, and Madoka Kuniyasu, for their invaluable support throughoutthepreparationandorganizationofthesymposium. January2001 HerbertKuchen KazunoriUeda Symposium Organization Program Chairs Herbert Kuchen University of Munster, .. Germany Kazunori Ueda Waseda University, Tokyo, Japan Program Committee Sergio Antoy Portland State University, USA Gopal Gupta University of Texas at Dallas, USA Michael Hanus University of Kiel, Germany Fergus Henderson University of Melbourne, Australia Zhenjiang Hu University of Tokyo, Japan Herbert Kuchen University of Munster, .. Germany Giorgio Levi University of Pisa, Italy Michael Maher Gri th University, Brisbane, Australia Dale Miller Pennsylvania State University, USA I. V. Ramakrishnan State University of New York at Stony Brook, USA Olivier Ridoux IRISA, Rennes, France Mario Rodr guez-Artalejo Complutense University, Madrid, Spain Colin Runciman University of York, UK Akihiko Takano Hitachi, Ltd.

Table of Contents:
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.