Sciweavers

66 search results - page 1 / 14
» Recursive Functions with Higher Order Domains
Sort
View
TLCA
2005
Springer
13 years 9 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
POPL
2010
ACM
14 years 1 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
VISUALIZATION
2005
IEEE
13 years 10 months ago
Framework for Visualizing Higher-Order Basis Functions
Techniques in numerical simulation such as the finite element method depend on basis functions for approximating the geometry and variation of the solution over discrete regions ...
William J. Schroeder, François Bertel, Math...
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
13 years 9 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
1999
IEEE
13 years 8 months ago
The Higher-Order Recursive Path Ordering
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio