Sciweavers

75 search results - page 2 / 15
» Termination Analysis of Higher-Order Functional Programs
Sort
View
FSEN
2009
Springer
14 years 9 days ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
JUCS
2007
80views more  JUCS 2007»
13 years 5 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
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
13 years 11 months ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
LICS
1994
IEEE
13 years 10 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
TLCA
2005
Springer
13 years 11 months ago
Recursive Functions with Higher Order Domains
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
Ana Bove, Venanzio Capretta