Results 1 - 10 of 2,644

Deterministic Higher-order Patterns for Program Transformation

by Tetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi , 2003
"... Higher-order patterns, together with higher-order matching, enable concise speci cation of program transformation, and have been implemented in several program transformation systems. However, higherorder matching generally generates nondeterministic matches, and the matching algorithm is so ex ..."
Abstract - Add to MetaCart
most general uni er. We relax the restriction of his patterns without changing determinism in the context of matching instead of uni cation. As a consequence, our deterministic higher-order pattern (DHP) covers a wide class of useful patterns for program transformation. Our deterministic matching

Dynamic programming algorithm optimization for spoken word recognition

by Hiroaki Sakoe, Seibi Chiba - IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING , 1978
"... This paper reports on an optimum dynamic programming (DP) based time-normalization algorithm for spoken word recognition. First, a general principle of time-normalization is given using timewarping function. Then, two time-normalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract - Cited by 788 (3 self) - Add to MetaCart
the relative superiority of either a symmetric form of DP-matching or an asymmetric one. In the asymmetric form, time-normalization is achieved by trans-forming the time axis of a speech pattern onto that of the other. In the symmetric form, on the other hand, both time axes are transformed onto a temporarily

Design and implementation of deterministic higher-order patterns

by Tetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi , 2005
"... We introduce a class of deterministic higher-order patterns to Template Haskell for supporting declarative transformational programming with more elegant binding of pattern variables. Higher-order patterns are capable of checking and binding subtrees far from the root, which is useful for program m ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
We introduce a class of deterministic higher-order patterns to Template Haskell for supporting declarative transformational programming with more elegant binding of pattern variables. Higher-order patterns are capable of checking and binding subtrees far from the root, which is useful for program

Higher-order Matching for Program Transformation

by Oege De Moor, Ganesh Sittampalam , 1999
"... We present a simple, practical algorithm for higher order matching in the context of automatic program transformation. Our algorithm finds more matches than the standard second order matching algorithm of Huet and Lang, but it has an equally simple specification, and it is better suited to the tr ..."
Abstract - Cited by 17 (1 self) - Add to MetaCart
We present a simple, practical algorithm for higher order matching in the context of automatic program transformation. Our algorithm finds more matches than the standard second order matching algorithm of Huet and Lang, but it has an equally simple specification, and it is better suited

Bug Isolation via Remote Program Sampling

by Ben Liblit, Alex Aiken, Alice X. Zheng, Michael I. Jordan - In Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation , 2003
"... We propose a low-overhead sampling infrastructure for gathering information from the executions experienced by a program 's user community. Several example applications illustrate ways to use sampled instrumentation to isolate bugs. Assertion-dense code can be transformed to share the cost of a ..."
Abstract - Cited by 335 (16 self) - Add to MetaCart
We propose a low-overhead sampling infrastructure for gathering information from the executions experienced by a program 's user community. Several example applications illustrate ways to use sampled instrumentation to isolate bugs. Assertion-dense code can be transformed to share the cost

Deterministic Second-order Patterns in Program Transformation

by Tetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi - In International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2003 , 2003
"... Higher-order patterns, together with higher-order matching, enable concise specification of program transformation, and have been implemented in several program transformation systems. However, higherorder matching generally generates nondeterministic matches, and the matching algorithm is so ex ..."
Abstract - Add to MetaCart
Higher-order patterns, together with higher-order matching, enable concise specification of program transformation, and have been implemented in several program transformation systems. However, higherorder matching generally generates nondeterministic matches, and the matching algorithm is so

Higher-Order Redundancy Elimination

by Peter Thiemann - Workshop Partial Evaluation and Semantics-Based Program Manipulation '94 , 1994
"... Functional programs often define functions by pattern matching where patterns may inadvertedly overlap through successive function calls. This leads to hidden inefficiencies since the recursively called function possibly repeats redundant tests while trying to match the pattern. An analysis which is ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
is based on conservative symbolic execution (similar to higher order constant propagation) is proposed for a strict higher-order language to drive an arity raiser which generates specialized versions for functions with partially known arguments. To ensure termination only the definitely consumed part

Deterministic Second-order Patterns

by Tetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi , 2004
"... Second-order patterns, together with second-order matching, enable concise speci cation of program transformation, and have been implemented in several program transformation systems. However, second-order matching in general is nondeterministic, and the matching algorithm is so expensive that the ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
. In this paper, we relax the restriction of his patterns without changing determinism in the context of matching instead of uni cation. As a consequence, our deterministic second-order patterns cover a wide class of useful patterns for program transformation. The time complexity of our deterministic matching

Programming in Higher-Order Typed Lambda-Calculi

by Benjamin Pierce, Scott Dietzen, Spiro Michaylov, Maurice Nivat, James Thatcher, Mathematical Foundations Of , 1989
"... on Foundations of Computer Science, pages 279-282, IEEE, October 1988. [55] J. Steensgaard-Madsen. Typed representation of objects by functions. ACM Transactions on Programming Languages and Systems, 11(1):67-89, January 1989. 71 [31] [33] [34] [35] Grard Huet. A unification algorithm for ty ..."
Abstract - Cited by 29 (5 self) - Add to MetaCart
for typed A-calculus. Theoretical Computer Science, 1:27-57, 1975. Grard Huet. A uniform approach to type theory. 1988. Unpublished notes. Grard Huet and Bernard Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31-55, 1978. Daniel Leivant

Types and Higher-Order Recursion Schemes for Verification of Higher-Order Programs

by Naoki Kobayashi , 2009
"... We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong’s recent result on the decidability of the model-checking problem for higher-order recursion schemes (HORS’s). A program is transformed to an HORS that generates a tree repr ..."
Abstract - Cited by 63 (14 self) - Add to MetaCart
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong’s recent result on the decidability of the model-checking problem for higher-order recursion schemes (HORS’s). A program is transformed to an HORS that generates a tree
Results 1 - 10 of 2,644