Art

J-GLOBAL ID：201802211857775323   Reference number：18A1365213

Static Dependency Pair Method in Functional Programs

関数プログラムにおける静的依存対法

Author (1)： KUSAKARI Keiichirou (Informatics Course, Department of Electrical, Electronic and Computer Engineering, Faculty of Engineering, Gifu University)
Material： IEICE Transactions on Information and Systems (Web)  (IEICE Trans Inf Syst (Web))
Volume： E101.D  Issue： 6  Page： 1491-1502(J-STAGE)  Publication year： 2018 
JST Material Number： U0469A  ISSN： 1745-1361  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *functional programming ,  dependence ,  *term rewriting system ,  recursion ,  accessibility ,  soundness ,  computability ,  lamda calculation ,  formulation ,  functional ,  stopping
Semi thesaurus term： *term rewriting system

Author keywords (5)： functional program ,  term rewriting system ,  termination ,  recursive definition ,  static dependency pair method

JST classification (2)： Other system programmings  (JD03070M) ,  Theory of computation  (JB02000A)

Reference (24)：

• [1] T. Arts and J. Giesl, “Termination of Term Rewriting Using Dependency Pairs,” Theoretical Computer Science, vol.236, no.1-2, pp.133-178, 2000. 10.1016/s0304-3975(99)00207-8
• [2] K. Bimbó, Combinatory Logic: Pure, Applied and Typed, Chapman and Hall/CRC, 2011.
• [3] F. Blanqui, J.-P. Jouannaud, and M. Okada, “Inductive-Data-Type Systems,” Theoretical Computer Science, vol.272, no.1-2, pp.41-68, 2002. 10.1016/s0304-3975(00)00347-9
• [4] F. Blanqui, “Computability Closure: Ten Years Later,” In Essay in Honour of Jean-Pierre Jouannaud's 60 Birthday, LNCS 4600, pp.68-88, 2007.
• [5] F. Blanqui, J.-P. Jouannaud, and A. Rubio, “The Computability Path Ordering: The End of a Quest,” Proc. 17th EACSL Annual Conf. on Computer Science Logic, LNCS 5213 (CSL2008), pp.1-14, 2008.

Terms in the title (2)： 関数 ,  法