IEICE Trans

Keyword : termination

Static Dependency Pair Method in Functional Programs Keiichirou KUSAKARI
Publication: Publication Date: 2018/06/01 Vol. E101-D No. 6 ; pp. 1491-1502 Type of Manuscript: Special Section PAPER (Special Section on Formal Approaches) Category: Formal Approaches Keyword: functional program, term rewriting system, termination, recursive definition, static dependency pair method,
	Summary \| Full Text:PDF

Static Dependency Pair Method in Rewriting Systems for Functional Programs with Product, Algebraic Data, and ML-Polymorphic Types Keiichirou KUSAKARI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2013/03/01 Vol. E96-D No. 3 ; pp. 472-480 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —) Category: Keyword: rewriting systems for functional programs, termination, static dependency pair method,
	Summary \| Full Text:PDF

A Millimeter-Wave Resistance Error Tolerant Termination in Multi-Layered LTCC Substrate Takeshi YUASA Yukihiro TAHARA Naofumi YONEDA Hideyuki OH-HASHI
Publication: IEICE TRANSACTIONS on Electronics Publication Date: 2011/03/01 Vol. E94-C No. 3 ; pp. 321-326 Type of Manuscript: PAPER Category: Microwaves, Millimeter-Waves Keyword: multi-layered substrate, LTCC, termination, resistive film, manufacturing error, resistance error,
	Summary \| Full Text:PDF

A Digital Differential Transmitter with Pseudo-LVDS Output Driver and Digital Mismatch Calibration Jun-Hyun BAE Sang-Hune PARK Jae-Yoon SIM Hong-June PARK
Publication: IEICE TRANSACTIONS on Electronics Publication Date: 2010/01/01 Vol. E93-C No. 1 ; pp. 132-135 Type of Manuscript: BRIEF PAPER Category: Electronic Circuits Keyword: differential, digital transmitter, termination,
	Summary \| Full Text:PDF

Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems Keiichirou KUSAKARI Yasuo ISOGAI Masahiko SAKAI Frederic BLANQUI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2009/10/01 Vol. E92-D No. 10 ; pp. 2007-2015 Type of Manuscript: PAPER Category: Computation and Computational Models Keyword: higher-order rewrite system, termination, static dependency pair, plain function-passing, strong computability, subterm criterion,
	Summary \| Full Text:PDF

Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques Keiichirou KUSAKARI Masahiko SAKAI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2009/02/01 Vol. E92-D No. 2 ; pp. 235-247 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: simply-typed term rewriting, termination, static dependency pair method, argument filtering, usable rule,
	Summary \| Full Text:PDF

Optimal Termination of On-Chip Transmission-Lines for High-Speed Signaling Akira TSUCHIYA Masanori HASHIMOTO Hidetoshi ONODERA
Publication: IEICE TRANSACTIONS on Electronics Publication Date: 2007/06/01 Vol. E90-C No. 6 ; pp. 1267-1273 Type of Manuscript: Special Section PAPER (Special Section on Analog Circuits and Related SoC Integration Technologies) Category: Keyword: on-chip transmission-line, termination,
	Summary \| Full Text:PDF

On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems Masahiko SAKAI Keiichirou KUSAKARI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2005/03/01 Vol. E88-D No. 3 ; pp. 583-593 Type of Manuscript: PAPER Category: Computation and Computational Models Keyword: termination, dependency pair, higher-order rewrite system, dependency forest,
	Summary \| Full Text:PDF

Higher-Order Path Orders Based on Computability Keiichirou KUSAKARI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2004/02/01 Vol. E87-D No. 2 ; pp. 352-359 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: simply-typed term rewriting system, termination, path order, computability, dependency pair, argument filtering method,
	Summary \| Full Text:PDF

Termination Property of Inverse Finite Path Overlapping Term Rewriting System is Decidable Toshinori TAKAI Yuichi KAJI Hiroyuki SEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2002/03/01 Vol. E85-D No. 3 ; pp. 487-496 Type of Manuscript: PAPER Category: Theory/Models of Computation Keyword: term rewriting system, termination, tree automaton,
	Summary \| Full Text:PDF

An Extension of the Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems Masahiko SAKAI Yoshitsugu WATANABE Toshiki SAKABE
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2001/08/01 Vol. E84-D No. 8 ; pp. 1025-1032 Type of Manuscript: PAPER Category: Theory/Models of Computation Keyword: termination, dependency pair, higher-order rewrite system,
	Summary \| Full Text:PDF

An Improved Recursive Decomposition Ordering for Higher-Order Rewrite Systems Munehiro IWAMI Masahiko SAKAI Yoshihito TOYAMA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1998/09/25 Vol. E81-D No. 9 ; pp. 988-996 Type of Manuscript: PAPER Category: Automata,Languages and Theory of Computing Keyword: higher-order rewrite system, term rewriting system, termination, improved recursive decomposition ordering, pseudo-terminal occurrence, type, simplification ordering,
	Summary \| Full Text:PDF

Termination of Order-Sorted Rewriting with Non-minimal Signatures Yoshinobu KAWABE Naohiro ISHII
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1998/08/25 Vol. E81-D No. 8 ; pp. 839-845 Type of Manuscript: PAPER Category: Software Theory Keyword: order-sorted term rewriting systems, termination, non-minimal signatures,
	Summary \| Full Text:PDF

Decomposable Termination of Composable Term Rewriting Systems Masahito KURIHARA Azuma OHUCHI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1995/04/25 Vol. E78-D No. 4 ; pp. 314-320 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: term rewriting system, termination, modularity, algebraic specification, automated reasoning,
	Summary \| Full Text:PDF

High-Speed, Small-Amplitude I/O Interface Circuits for Memory Bus Application Masao TAGUCHI
Publication: IEICE TRANSACTIONS on Electronics Publication Date: 1994/12/25 Vol. E77-C No. 12 ; pp. 1944-1950 Type of Manuscript: INVITED PAPER (Special Issue on Multimedia, Analog and Processing LSIs) Category: Processor Interfaces Keyword: I/O, interface, termination, CTT,
	Summary \| Full Text:PDF