Sciweavers

18 search results - page 1 / 4
» Higher-Order Lazy Functional Slicing
Sort
View
JUCS
2007
80views more  JUCS 2007»
13 years 4 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa
PLILP
1995
Springer
13 years 8 months ago
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
LICS
1994
IEEE
13 years 9 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
13 years 9 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape
ERSHOV
2009
Springer
13 years 11 months ago
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
One of the applications of supercompilation is proving properties of programs.We focus in this paper on a speci c task: proving term equivalence for a higher-order lazy functiona...
Ilya Klyuchnikov, Sergei A. Romanenko