• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Functional Logic Programming with Distributed Constraint Solving System

Research Project

Project/Area Number 10480053
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field 計算機科学
Research InstitutionUniversity of Tsukuba

Principal Investigator

IDA Tetsuo  Institute of Information Sciences and Electronics University of Tsukuba Professor, 電子・情報工学系, 教授 (70100047)

Co-Investigator(Kenkyū-buntansha) MINAMIDE Yasuhiko  Institute of Information Sciences and Electronics University of Tsukuba Assistant Professor, 電子・情報工学系, 講師 (50252531)
CHAKRAVARTY Manuel  Institute of Information Sciences and Electronics University of Tsukuba Assistant Professor, 電子・情報工学系, 講師 (30292535)
MIDDELDORP Aart  Institute of Information Sciences and Electronics University of Tsukuba Associate Professor, 電子・情報工学系, 助教授 (30251044)
SUZUKI Taro  Scool of Information Science, JAIST Research Associate, 情報科学研究科, 助手 (90272179)
YAMADA Toshiyuki  Institute of Information Sciences and Electronics University of Tsukuba Research Associate, 電子・情報工学系, 助手 (60312831)
Project Period (FY) 1998 – 1999
Project Status Completed (Fiscal Year 1999)
Budget Amount *help
¥10,000,000 (Direct Cost: ¥10,000,000)
Fiscal Year 1999: ¥4,400,000 (Direct Cost: ¥4,400,000)
Fiscal Year 1998: ¥5,600,000 (Direct Cost: ¥5,600,000)
Keywordsfunctional logic languages / constraint solving system / computation model / narrowing calculus / completeness / Mathematica / CFLP / ナローイング
Research Abstract

Our contributions are (i) development of computation models for functional logic programming languages with distributed constraint solving systems and (ii) realization of a programming environment based on the computation models.
(i) Design of computation models
We started the research project with the design of a computation model called Lazy Narrowing Calculus (LNC). LNC forms the basis of our investigation into all our computation models for functional and logic programming. To deal with constraint solving in functional logic programming languages, we extended LNC to the conditional case. The resulting calculus is called Lazy Conditional Narrowing Calculus (LCNC). Moreover, we removed the non-determinism inherent in LCNC. This simplifies the implementation of the calculus on computers and improves the computational efficiency.
Furthermore we designed higher-order calculi, i.e. Applicative LNC, which simulates higher-order computation by using (first-order) applicative terms for representing terms, and Higher-Order Lazy Narrowing Calculus (LNff), which can handle lambda terms. We proved that all the above-mentioned calculi have completeness.
(ii) Implementation of the programming system
We implemented a functional logic programming system in a distributed environment. The system is called Constraint Functional Logic Programming system (CFLP). CFLP consists of three components : an interpreter, a scheduler, and a constraint solving system. We implemented CFLP as a distributed software system using the programming language Mathematica. The computation mechanism of CFLP is based on the narrowing calculi. The interpreter of the functional logic programming language in CFLP system solves given equations by accessing constraint solvers in a distributed environment. The narrowing calculi find solutions over the domain of term algebra. The other domain-specific constants and operations are handled by the constraint solvers which provide the domain-specific solving methods.

Report

(3 results)
  • 1999 Annual Research Report   Final Research Report Summary
  • 1998 Annual Research Report
  • Research Products

    (39 results)

All Other

All Publications (39 results)

  • [Publications] A.Middeldorp,S.Okui: "A Deterministic Lazy Narrowing Calculus"Journal of Symbolic Computation. 25(6). 733-757 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M.Hanus,S.Lucas,A.Middeldorp: "Strongly Sequential and Inductively Sequential Term Rewriting Systems"Information Processing Letters. 67(1). 1-8 (1998)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] 大崎人士,A.Middeldorp,井田哲雄: "等式付き書換え系における多ソート不変性"コンピュータソフトウェア. 16(1). 33-45 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M.Marin,T.Ida,T.Suzuki: "On reducing the Search Space of Higher-Order Lazy Narrowing"Proc. 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99). 319-334 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M.Marin,T.Ida,W.Schreiner: "CFLP : a Mathematica Implementation of a Distributed Constraint Solving System"Proc. 3rd Internationl Mathematica Symposium (IMS'99). (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M.Hamada,A.Middeldorp,T.Suzuki: "Completeness Results for a Lazy Conditional Narrowing Calculus"Proc. 2nd Discrete Mathematics and Theoretical Computer Science Conference DMTCS/CATS'99. 217-231 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M.Marin,T.Yanagi,T.Ida,A.Middeldorp: "LNCA : A Lazy Narrowing Calculus for Applicative Term Rewriting Systems"Proc. 1st JSSST Workshop on Programming and Programming Languages (PPL'99). 3-14 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M.Marin,W.Schreiner,T.Ida: "A Distributed System for Solving Equational Constraints Based on Lazy Narrowing Calculi"Proc. 1st JSSST Workshop on Programming and Programming Languages (PPL'99). 67-77 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Y.Minamide: "Space-Profiling Semantics of the Call-by-Value Lambda Calculus and the CPS Transformation"Proc. 3rd International Workshop on Higher-Order Operatinal Techniques in Semantics,ENTCS. 26. 103-118 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] T.Yamada et al.: "Logicality of Conditional Rewrite Systems"Theoretical Computer Science. 236(1,2). 209-232 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Q.Li,Y.Guo,T.Ida: "Modelling Integer Programming with Logic : Language and Implementation"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. (印刷中). (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] A. Middeldorp, S. Okui: "A Deterministic Lazy Narrowing Calculus"Journal of Symbolic Computation. 25(6). 733-757 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M. Hanus, S. Lucas, A. Middeldorp: "Strongly Sequential and Inductively Sequential Term Rewriting Systems"Information Processing Letters. 67(1). 1-8 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] H. Ohsaki, A. Middeldorp, T. Ida: "Persistence of Equational Term Rewriting Systems"Computer Software. 16(1). 33-45 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M. Marin, T. Ida, T. Suzuki: "On reducing the Search Space of Higher-Order Lazy Narrowing"Proc. 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99). 319-334 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M. Marin, T. Ida, W. Schreiner: "CFLP : a Mathematica Implementation of a Distributed Constraint Solving System"Proc. 3rd International Mathematica Symposium (IMS'99). (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M. Hamada, A. Middeldorp, T. Suzuki: "Completeness Results for a Lazy Conditional Narrowing Calculus"Proc. 2nd Discrete Mathematics and Theoretical Computer Science Conference DMTCS/CATS'99. 217-231 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M. Marin, T. Yanagi, T. Ida, A. Middeldorp: "LNCA : A Lazy Narrowing Calculus for Applicative Term Rewriting Systems"Proc. 1st JSSST Workshop on Programming and Programming Languages (PPL'99). 3-14 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M. Marin, W. Schreiner, T. Ida: "A Distributed System for Solving Equational Constraints Based on Lazy Narrowing Calculi"Proc. 1st JSSST Workshop on Programming and Programming Languages (PPL'99). 67-77 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Y. Minamide: "Space-Profiling Semantics of the Call-by Value Lambda Calculus and the CPS Transformation"Proc. 3rd International Workshop on Higher-Order Operational Techniques in Semantics, ENTCS 26. 103-118 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] T. Yamada, et al.: "Logicality of Conditional Rewrite Systems"Theoretical Computer Science. 236(1,2). 209-232 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Q. Li, Y. Guo, T. Ida: "Modeling Integer Programming with Logic : Language and Implementation"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. (to appear). (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] M.Marin,T.Ida T.Suzuki: "On reducing the Search Space of Higher-Order Lazy Narrowing"Proc.4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99). 319-334 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Mircea Marin and Wolfgang Schreiner: "CFLP:a Mathematica Implementation of a Distributed Constraint Solving System"Proc.3rd International Mathematica Symposium (IMS'99). (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] 大崎人士,A.Middeldorp 井田哲雄: "等式付き書換え系における多ソート不変性"コンピュータソフトウエア. 16(1). 33-45 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] M.Hamada,A.Middeldorp T.Suzuki: "Completeness Results for a Lazy Conditional Narrowing Calculus"Proc.2nd Discrete Mathematics and Theoretical Computer Science Conference DMTCS/CATS'99. 217-231 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] M.Marin,T.Yanagi T.Ida,A.Middeldorp: "LNCA:A Lazy Narrowing Calculus for Applicative Term Rewriting Systems"Proc.1st JSSST Workshop on programming and Programming Languages (PPL'99). 3-14 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] M.Marin,W.Schreiner T.Ida: "A Distributed System for Solving Equational Constraints Based on Lazy Narrowing Calculi"Proc.1st JSSST Workshop on programming and Programming Languages (PPL'99). 67-77 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Y.Minamide: "Space-Profiling Semantics of the Call-by-Value Lambda Calculus and the CPS Transformation"Proc.3rd International Workshop on Higher-Order Operational Techniques in Semantics,ENTCS. 26. 103-118 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] T.Yamada,et al.: "Logicality of Conditional Rewrite Systems"Theoretical Computer Science. 236(1,2). 209-232 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] G.Keller: "On the Distributed Implementation of Aggregate Data Structures by Program Transformation" Proc.4th HIPS. LNCS (to appear). (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] T.Yamada: "Logicality of Conditional Rewrite Systems" Tehoretical Computer Science. (to appear). (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] M.Hamada: "Completeness Results for a Lazy Conditional Narrowing Calculus" Proc.2nd DMTCS. 217-231 (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] 大崎 人士: "等式付き書換え系における多ソート不変性" コンピュータソフトウェア. 16(1). 33-45 (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] M.Marin: "LNCA: A Lazy Narrowing Calculus for Applicative Term Rewriting Systems" Proc.1st USSST Workshop on Programming & Prog.Lpng.(PPPL'99). (to appear). (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] M.M.T.Chakravaraty: "A Mobile Functional Object Code" Proc.10th International Workshop on the Implementation of Functional Languages. 395-405 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] M.M.T.Chakravaraty: "Distributed Haskell : Goffin on the Internet" Proc.3rd Fuji International Symposium on Functional and Logic Programming. 80-97 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] A.Middeldorp: "A Deterministic Lazy Narrowing Calculus" Journal of Symbolic Computation. 25(6). 733-757 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] M.Hamada: "Deterministic and Non-deterministic Lazy Conditional Narrowing and their implementations" 情報処理学会論文誌. 79(3). 656-663 (1998)

    • Related Report
      1998 Annual Research Report

URL: 

Published: 1998-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi