75 search results - page 4 / 15 » Termination Analysis of Higher-Order Functional Programs |
IFL
1998
Springer
13 years 11 months ago
1998
Springer
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...
TYPES
2000
Springer
13 years 11 months ago
2000
Springer
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
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...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
POPL
1990
ACM
13 years 11 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...