Sciweavers

4835 search results - page 214 / 967
» Refactoring Functional Programs
Sort
View
IGPL
2000
99views more  IGPL 2000»
15 years 2 months ago
Linear Explicit Substitutions
Abstract Neil Ghani Valeria de Paiva Eike Ritter The -calculus 1 adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implement...
Neil Ghani, Valeria de Paiva, Eike Ritter
101
Voted
SIGPLAN
2002
15 years 2 months ago
Pattern-matching and rewriting rules for group indexed data structures
In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-ba...
Jean-Louis Giavitto, Olivier Michel, Julien Cohen
135
Voted
IJACTAICIT
2010
127views more  IJACTAICIT 2010»
14 years 11 months ago
New Proposed Algorithms for nth Order Butterworth Active Filter Computer-Aided Design
This paper describes new proposed algorithms for constructing the transfer function of nth order Butterworth LPF using the idea of the cascade combination of active filters. Compu...
Haider Fakher Radhi Al-Saidy
ENTCS
2007
103views more  ENTCS 2007»
15 years 2 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
109
Voted
FUIN
2006
85views more  FUIN 2006»
15 years 2 months ago
Implementing Typeful Program Transformations
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
Chiyan Chen, Rui Shi, Hongwei Xi